CombinedText stringlengths 4 3.42M |
|---|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . A L T I V E C . V E C T O R _ O P E R A T I O N S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-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, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This unit is the user-level Ada interface to AltiVec operations on vector
-- objects. It is common to both the Soft and the Hard bindings.
with GNAT.Altivec.Vector_Types; use GNAT.Altivec.Vector_Types;
with GNAT.Altivec.Low_Level_Interface; use GNAT.Altivec.Low_Level_Interface;
package GNAT.Altivec.Vector_Operations is
-- The vast majority of the operations exposed here are overloads over a
-- much smaller set of low level primitives with type conversions around.
--
-- In some cases, a direct binding without any intermediate body is
-- possible or even even mandatory for technical reasons. What we provide
-- here for such cases are renamings of straight imports exposed by
-- Altivec.Low_Level_Interface. See the comments in the private part for
-- additional details.
-------------------------------------------------------
-- [PIM-4.4 Generic and Specific AltiVec operations] --
-------------------------------------------------------
-- vec_abs --
function vec_abs
(A : vector_signed_char) return vector_signed_char;
function vec_abs
(A : vector_signed_short) return vector_signed_short;
function vec_abs
(A : vector_signed_int) return vector_signed_int;
function vec_abs
(A : vector_float) return vector_float;
-- vec_abss --
function vec_abss
(A : vector_signed_char) return vector_signed_char;
function vec_abss
(A : vector_signed_short) return vector_signed_short;
function vec_abss
(A : vector_signed_int) return vector_signed_int;
-- vec_add --
function vec_add
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_add
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_add
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_add
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_add
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_add
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_add
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_add
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_add
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_add
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_add
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_add
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_add
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_add
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_add
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_add
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_add
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_add
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_add
(A : vector_float;
B : vector_float) return vector_float;
-- vec_vaddfp --
function vec_vaddfp
(A : vector_float;
B : vector_float) return vector_float;
-- vec_vadduwm --
function vec_vadduwm
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_vadduwm
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_vadduwm
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_vadduwm
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_vadduwm
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_vadduwm
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vadduhm --
function vec_vadduhm
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_vadduhm
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_vadduhm
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_vadduhm
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_vadduhm
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_vadduhm
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
-- vec_vaddubm --
function vec_vaddubm
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_vaddubm
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_vaddubm
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_vaddubm
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_vaddubm
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_vaddubm
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_addc --
function vec_addc
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_adds --
function vec_adds
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_adds
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_adds
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_adds
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_adds
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_adds
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_adds
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_adds
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_adds
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_adds
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_adds
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_adds
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_adds
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_adds
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_adds
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_adds
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_adds
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_adds
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
-- vec_vaddsws --
function vec_vaddsws
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_vaddsws
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_vaddsws
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
-- vec_vadduws --
function vec_vadduws
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_vadduws
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_vadduws
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vaddshs --
function vec_vaddshs
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_vaddshs
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_vaddshs
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
-- vec_vadduhs --
function vec_vadduhs
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_vadduhs
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_vadduhs
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
-- vec_vaddsbs --
function vec_vaddsbs
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_vaddsbs
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_vaddsbs
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
-- vec_vaddubs --
function vec_vaddubs
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_vaddubs
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_vaddubs
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_and --
function vec_and
(A : vector_float;
B : vector_float) return vector_float;
function vec_and
(A : vector_float;
B : vector_bool_int) return vector_float;
function vec_and
(A : vector_bool_int;
B : vector_float) return vector_float;
function vec_and
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int;
function vec_and
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_and
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_and
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_and
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_and
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_and
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_and
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short;
function vec_and
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_and
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_and
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_and
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_and
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_and
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_and
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_and
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char;
function vec_and
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_and
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_and
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_and
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_and
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_andc --
function vec_andc
(A : vector_float;
B : vector_float) return vector_float;
function vec_andc
(A : vector_float;
B : vector_bool_int) return vector_float;
function vec_andc
(A : vector_bool_int;
B : vector_float) return vector_float;
function vec_andc
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int;
function vec_andc
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_andc
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_andc
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_andc
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_andc
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_andc
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_andc
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short;
function vec_andc
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_andc
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_andc
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_andc
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_andc
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_andc
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_andc
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_andc
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char;
function vec_andc
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_andc
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_andc
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_andc
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_andc
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_avg --
function vec_avg
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_avg
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_avg
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_avg
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_avg
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_avg
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
-- vec_vavgsw --
function vec_vavgsw
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
-- vec_vavguw --
function vec_vavguw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vavgsh --
function vec_vavgsh
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
-- vec_vavguh --
function vec_vavguh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
-- vec_vavgsb --
function vec_vavgsb
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
-- vec_vavgub --
function vec_vavgub
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_ceil --
function vec_ceil
(A : vector_float) return vector_float;
-- vec_cmpb --
function vec_cmpb
(A : vector_float;
B : vector_float) return vector_signed_int;
-- vec_cmpeq --
function vec_cmpeq
(A : vector_signed_char;
B : vector_signed_char) return vector_bool_char;
function vec_cmpeq
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_bool_char;
function vec_cmpeq
(A : vector_signed_short;
B : vector_signed_short) return vector_bool_short;
function vec_cmpeq
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_bool_short;
function vec_cmpeq
(A : vector_signed_int;
B : vector_signed_int) return vector_bool_int;
function vec_cmpeq
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_bool_int;
function vec_cmpeq
(A : vector_float;
B : vector_float) return vector_bool_int;
-- vec_vcmpeqfp --
function vec_vcmpeqfp
(A : vector_float;
B : vector_float) return vector_bool_int;
-- vec_vcmpequw --
function vec_vcmpequw
(A : vector_signed_int;
B : vector_signed_int) return vector_bool_int;
function vec_vcmpequw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_bool_int;
-- vec_vcmpequh --
function vec_vcmpequh
(A : vector_signed_short;
B : vector_signed_short) return vector_bool_short;
function vec_vcmpequh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_bool_short;
-- vec_vcmpequb --
function vec_vcmpequb
(A : vector_signed_char;
B : vector_signed_char) return vector_bool_char;
function vec_vcmpequb
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_bool_char;
-- vec_cmpge --
function vec_cmpge
(A : vector_float;
B : vector_float) return vector_bool_int;
-- vec_cmpgt --
function vec_cmpgt
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_bool_char;
function vec_cmpgt
(A : vector_signed_char;
B : vector_signed_char) return vector_bool_char;
function vec_cmpgt
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_bool_short;
function vec_cmpgt
(A : vector_signed_short;
B : vector_signed_short) return vector_bool_short;
function vec_cmpgt
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_bool_int;
function vec_cmpgt
(A : vector_signed_int;
B : vector_signed_int) return vector_bool_int;
function vec_cmpgt
(A : vector_float;
B : vector_float) return vector_bool_int;
-- vec_vcmpgtfp --
function vec_vcmpgtfp
(A : vector_float;
B : vector_float) return vector_bool_int;
-- vec_vcmpgtsw --
function vec_vcmpgtsw
(A : vector_signed_int;
B : vector_signed_int) return vector_bool_int;
-- vec_vcmpgtuw --
function vec_vcmpgtuw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_bool_int;
-- vec_vcmpgtsh --
function vec_vcmpgtsh
(A : vector_signed_short;
B : vector_signed_short) return vector_bool_short;
-- vec_vcmpgtuh --
function vec_vcmpgtuh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_bool_short;
-- vec_vcmpgtsb --
function vec_vcmpgtsb
(A : vector_signed_char;
B : vector_signed_char) return vector_bool_char;
-- vec_vcmpgtub --
function vec_vcmpgtub
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_bool_char;
-- vec_cmple --
function vec_cmple
(A : vector_float;
B : vector_float) return vector_bool_int;
-- vec_cmplt --
function vec_cmplt
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_bool_char;
function vec_cmplt
(A : vector_signed_char;
B : vector_signed_char) return vector_bool_char;
function vec_cmplt
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_bool_short;
function vec_cmplt
(A : vector_signed_short;
B : vector_signed_short) return vector_bool_short;
function vec_cmplt
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_bool_int;
function vec_cmplt
(A : vector_signed_int;
B : vector_signed_int) return vector_bool_int;
function vec_cmplt
(A : vector_float;
B : vector_float) return vector_bool_int;
-- vec_ctf --
function vec_ctf
(A : vector_unsigned_int;
B : c_int) return vector_float
renames Low_Level_Interface.vec_ctf_vui_cint_r_vf;
function vec_ctf
(A : vector_signed_int;
B : c_int) return vector_float
renames Low_Level_Interface.vec_ctf_vsi_cint_r_vf;
-- vec_vcfsx --
function vec_vcfsx
(A : vector_signed_int;
B : c_int) return vector_float
renames Low_Level_Interface.vec_vcfsx_vsi_cint_r_vf;
-- vec_vcfux --
function vec_vcfux
(A : vector_unsigned_int;
B : c_int) return vector_float
renames Low_Level_Interface.vec_vcfux_vui_cint_r_vf;
-- vec_cts --
function vec_cts
(A : vector_float;
B : c_int) return vector_signed_int
renames Low_Level_Interface.vec_cts_vf_cint_r_vsi;
-- vec_ctu --
function vec_ctu
(A : vector_float;
B : c_int) return vector_unsigned_int
renames Low_Level_Interface.vec_ctu_vf_cint_r_vui;
-- vec_dss --
procedure vec_dss
(A : c_int)
renames Low_Level_Interface.vec_dss_cint;
-- vec_dssall --
procedure vec_dssall
renames Low_Level_Interface.vec_dssall;
-- vec_dst --
procedure vec_dst
(A : const_vector_unsigned_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kvucp_cint_cint;
procedure vec_dst
(A : const_vector_signed_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kvscp_cint_cint;
procedure vec_dst
(A : const_vector_bool_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kvbcp_cint_cint;
procedure vec_dst
(A : const_vector_unsigned_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kvusp_cint_cint;
procedure vec_dst
(A : const_vector_signed_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kvssp_cint_cint;
procedure vec_dst
(A : const_vector_bool_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kvbsp_cint_cint;
procedure vec_dst
(A : const_vector_pixel_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kvxp_cint_cint;
procedure vec_dst
(A : const_vector_unsigned_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kvuip_cint_cint;
procedure vec_dst
(A : const_vector_signed_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kvsip_cint_cint;
procedure vec_dst
(A : const_vector_bool_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kvbip_cint_cint;
procedure vec_dst
(A : const_vector_float_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kvfp_cint_cint;
procedure vec_dst
(A : const_unsigned_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kucp_cint_cint;
procedure vec_dst
(A : const_signed_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kscp_cint_cint;
procedure vec_dst
(A : const_unsigned_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kusp_cint_cint;
procedure vec_dst
(A : const_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_ksp_cint_cint;
procedure vec_dst
(A : const_unsigned_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kuip_cint_cint;
procedure vec_dst
(A : const_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kip_cint_cint;
procedure vec_dst
(A : const_unsigned_long_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kulongp_cint_cint;
procedure vec_dst
(A : const_long_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_klongp_cint_cint;
procedure vec_dst
(A : const_float_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dst_kfp_cint_cint;
-- vec_dstst --
procedure vec_dstst
(A : const_vector_unsigned_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kvucp_cint_cint;
procedure vec_dstst
(A : const_vector_signed_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kvscp_cint_cint;
procedure vec_dstst
(A : const_vector_bool_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kvbcp_cint_cint;
procedure vec_dstst
(A : const_vector_unsigned_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kvusp_cint_cint;
procedure vec_dstst
(A : const_vector_signed_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kvssp_cint_cint;
procedure vec_dstst
(A : const_vector_bool_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kvbsp_cint_cint;
procedure vec_dstst
(A : const_vector_pixel_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kvxp_cint_cint;
procedure vec_dstst
(A : const_vector_unsigned_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kvuip_cint_cint;
procedure vec_dstst
(A : const_vector_signed_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kvsip_cint_cint;
procedure vec_dstst
(A : const_vector_bool_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kvbip_cint_cint;
procedure vec_dstst
(A : const_vector_float_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kvfp_cint_cint;
procedure vec_dstst
(A : const_unsigned_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kucp_cint_cint;
procedure vec_dstst
(A : const_signed_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kscp_cint_cint;
procedure vec_dstst
(A : const_unsigned_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kusp_cint_cint;
procedure vec_dstst
(A : const_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_ksp_cint_cint;
procedure vec_dstst
(A : const_unsigned_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kuip_cint_cint;
procedure vec_dstst
(A : const_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kip_cint_cint;
procedure vec_dstst
(A : const_unsigned_long_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kulongp_cint_cint;
procedure vec_dstst
(A : const_long_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_klongp_cint_cint;
procedure vec_dstst
(A : const_float_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstst_kfp_cint_cint;
-- vec_dststt --
procedure vec_dststt
(A : const_vector_unsigned_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kvucp_cint_cint;
procedure vec_dststt
(A : const_vector_signed_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kvscp_cint_cint;
procedure vec_dststt
(A : const_vector_bool_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kvbcp_cint_cint;
procedure vec_dststt
(A : const_vector_unsigned_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kvusp_cint_cint;
procedure vec_dststt
(A : const_vector_signed_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kvssp_cint_cint;
procedure vec_dststt
(A : const_vector_bool_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kvbsp_cint_cint;
procedure vec_dststt
(A : const_vector_pixel_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kvxp_cint_cint;
procedure vec_dststt
(A : const_vector_unsigned_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kvuip_cint_cint;
procedure vec_dststt
(A : const_vector_signed_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kvsip_cint_cint;
procedure vec_dststt
(A : const_vector_bool_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kvbip_cint_cint;
procedure vec_dststt
(A : const_vector_float_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kvfp_cint_cint;
procedure vec_dststt
(A : const_unsigned_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kucp_cint_cint;
procedure vec_dststt
(A : const_signed_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kscp_cint_cint;
procedure vec_dststt
(A : const_unsigned_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kusp_cint_cint;
procedure vec_dststt
(A : const_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_ksp_cint_cint;
procedure vec_dststt
(A : const_unsigned_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kuip_cint_cint;
procedure vec_dststt
(A : const_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kip_cint_cint;
procedure vec_dststt
(A : const_unsigned_long_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kulongp_cint_cint;
procedure vec_dststt
(A : const_long_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_klongp_cint_cint;
procedure vec_dststt
(A : const_float_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dststt_kfp_cint_cint;
-- vec_dstt --
procedure vec_dstt
(A : const_vector_unsigned_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kvucp_cint_cint;
procedure vec_dstt
(A : const_vector_signed_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kvscp_cint_cint;
procedure vec_dstt
(A : const_vector_bool_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kvbcp_cint_cint;
procedure vec_dstt
(A : const_vector_unsigned_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kvusp_cint_cint;
procedure vec_dstt
(A : const_vector_signed_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kvssp_cint_cint;
procedure vec_dstt
(A : const_vector_bool_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kvbsp_cint_cint;
procedure vec_dstt
(A : const_vector_pixel_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kvxp_cint_cint;
procedure vec_dstt
(A : const_vector_unsigned_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kvuip_cint_cint;
procedure vec_dstt
(A : const_vector_signed_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kvsip_cint_cint;
procedure vec_dstt
(A : const_vector_bool_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kvbip_cint_cint;
procedure vec_dstt
(A : const_vector_float_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kvfp_cint_cint;
procedure vec_dstt
(A : const_unsigned_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kucp_cint_cint;
procedure vec_dstt
(A : const_signed_char_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kscp_cint_cint;
procedure vec_dstt
(A : const_unsigned_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kusp_cint_cint;
procedure vec_dstt
(A : const_short_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_ksp_cint_cint;
procedure vec_dstt
(A : const_unsigned_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kuip_cint_cint;
procedure vec_dstt
(A : const_int_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kip_cint_cint;
procedure vec_dstt
(A : const_unsigned_long_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kulongp_cint_cint;
procedure vec_dstt
(A : const_long_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_klongp_cint_cint;
procedure vec_dstt
(A : const_float_ptr;
B : c_int;
C : c_int)
renames Low_Level_Interface.vec_dstt_kfp_cint_cint;
-- vec_expte --
function vec_expte
(A : vector_float) return vector_float;
-- vec_floor --
function vec_floor
(A : vector_float) return vector_float;
-- vec_ld --
function vec_ld
(A : c_long;
B : const_vector_float_ptr) return vector_float;
function vec_ld
(A : c_long;
B : const_float_ptr) return vector_float;
function vec_ld
(A : c_long;
B : const_vector_bool_int_ptr) return vector_bool_int;
function vec_ld
(A : c_long;
B : const_vector_signed_int_ptr) return vector_signed_int;
function vec_ld
(A : c_long;
B : const_int_ptr) return vector_signed_int;
function vec_ld
(A : c_long;
B : const_long_ptr) return vector_signed_int;
function vec_ld
(A : c_long;
B : const_vector_unsigned_int_ptr) return vector_unsigned_int;
function vec_ld
(A : c_long;
B : const_unsigned_int_ptr) return vector_unsigned_int;
function vec_ld
(A : c_long;
B : const_unsigned_long_ptr) return vector_unsigned_int;
function vec_ld
(A : c_long;
B : const_vector_bool_short_ptr) return vector_bool_short;
function vec_ld
(A : c_long;
B : const_vector_pixel_ptr) return vector_pixel;
function vec_ld
(A : c_long;
B : const_vector_signed_short_ptr) return vector_signed_short;
function vec_ld
(A : c_long;
B : const_short_ptr) return vector_signed_short;
function vec_ld
(A : c_long;
B : const_vector_unsigned_short_ptr) return vector_unsigned_short;
function vec_ld
(A : c_long;
B : const_unsigned_short_ptr) return vector_unsigned_short;
function vec_ld
(A : c_long;
B : const_vector_bool_char_ptr) return vector_bool_char;
function vec_ld
(A : c_long;
B : const_vector_signed_char_ptr) return vector_signed_char;
function vec_ld
(A : c_long;
B : const_signed_char_ptr) return vector_signed_char;
function vec_ld
(A : c_long;
B : const_vector_unsigned_char_ptr) return vector_unsigned_char;
function vec_ld
(A : c_long;
B : const_unsigned_char_ptr) return vector_unsigned_char;
-- vec_lde --
function vec_lde
(A : c_long;
B : const_signed_char_ptr) return vector_signed_char;
function vec_lde
(A : c_long;
B : const_unsigned_char_ptr) return vector_unsigned_char;
function vec_lde
(A : c_long;
B : const_short_ptr) return vector_signed_short;
function vec_lde
(A : c_long;
B : const_unsigned_short_ptr) return vector_unsigned_short;
function vec_lde
(A : c_long;
B : const_float_ptr) return vector_float;
function vec_lde
(A : c_long;
B : const_int_ptr) return vector_signed_int;
function vec_lde
(A : c_long;
B : const_unsigned_int_ptr) return vector_unsigned_int;
function vec_lde
(A : c_long;
B : const_long_ptr) return vector_signed_int;
function vec_lde
(A : c_long;
B : const_unsigned_long_ptr) return vector_unsigned_int;
-- vec_lvewx --
function vec_lvewx
(A : c_long;
B : float_ptr) return vector_float;
function vec_lvewx
(A : c_long;
B : int_ptr) return vector_signed_int;
function vec_lvewx
(A : c_long;
B : unsigned_int_ptr) return vector_unsigned_int;
function vec_lvewx
(A : c_long;
B : long_ptr) return vector_signed_int;
function vec_lvewx
(A : c_long;
B : unsigned_long_ptr) return vector_unsigned_int;
-- vec_lvehx --
function vec_lvehx
(A : c_long;
B : short_ptr) return vector_signed_short;
function vec_lvehx
(A : c_long;
B : unsigned_short_ptr) return vector_unsigned_short;
-- vec_lvebx --
function vec_lvebx
(A : c_long;
B : signed_char_ptr) return vector_signed_char;
function vec_lvebx
(A : c_long;
B : unsigned_char_ptr) return vector_unsigned_char;
-- vec_ldl --
function vec_ldl
(A : c_long;
B : const_vector_float_ptr) return vector_float;
function vec_ldl
(A : c_long;
B : const_float_ptr) return vector_float;
function vec_ldl
(A : c_long;
B : const_vector_bool_int_ptr) return vector_bool_int;
function vec_ldl
(A : c_long;
B : const_vector_signed_int_ptr) return vector_signed_int;
function vec_ldl
(A : c_long;
B : const_int_ptr) return vector_signed_int;
function vec_ldl
(A : c_long;
B : const_long_ptr) return vector_signed_int;
function vec_ldl
(A : c_long;
B : const_vector_unsigned_int_ptr) return vector_unsigned_int;
function vec_ldl
(A : c_long;
B : const_unsigned_int_ptr) return vector_unsigned_int;
function vec_ldl
(A : c_long;
B : const_unsigned_long_ptr) return vector_unsigned_int;
function vec_ldl
(A : c_long;
B : const_vector_bool_short_ptr) return vector_bool_short;
function vec_ldl
(A : c_long;
B : const_vector_pixel_ptr) return vector_pixel;
function vec_ldl
(A : c_long;
B : const_vector_signed_short_ptr) return vector_signed_short;
function vec_ldl
(A : c_long;
B : const_short_ptr) return vector_signed_short;
function vec_ldl
(A : c_long;
B : const_vector_unsigned_short_ptr) return vector_unsigned_short;
function vec_ldl
(A : c_long;
B : const_unsigned_short_ptr) return vector_unsigned_short;
function vec_ldl
(A : c_long;
B : const_vector_bool_char_ptr) return vector_bool_char;
function vec_ldl
(A : c_long;
B : const_vector_signed_char_ptr) return vector_signed_char;
function vec_ldl
(A : c_long;
B : const_signed_char_ptr) return vector_signed_char;
function vec_ldl
(A : c_long;
B : const_vector_unsigned_char_ptr) return vector_unsigned_char;
function vec_ldl
(A : c_long;
B : const_unsigned_char_ptr) return vector_unsigned_char;
-- vec_loge --
function vec_loge
(A : vector_float) return vector_float;
-- vec_lvsl --
function vec_lvsl
(A : c_long;
B : constv_unsigned_char_ptr) return vector_unsigned_char;
function vec_lvsl
(A : c_long;
B : constv_signed_char_ptr) return vector_unsigned_char;
function vec_lvsl
(A : c_long;
B : constv_unsigned_short_ptr) return vector_unsigned_char;
function vec_lvsl
(A : c_long;
B : constv_short_ptr) return vector_unsigned_char;
function vec_lvsl
(A : c_long;
B : constv_unsigned_int_ptr) return vector_unsigned_char;
function vec_lvsl
(A : c_long;
B : constv_int_ptr) return vector_unsigned_char;
function vec_lvsl
(A : c_long;
B : constv_unsigned_long_ptr) return vector_unsigned_char;
function vec_lvsl
(A : c_long;
B : constv_long_ptr) return vector_unsigned_char;
function vec_lvsl
(A : c_long;
B : constv_float_ptr) return vector_unsigned_char;
-- vec_lvsr --
function vec_lvsr
(A : c_long;
B : constv_unsigned_char_ptr) return vector_unsigned_char;
function vec_lvsr
(A : c_long;
B : constv_signed_char_ptr) return vector_unsigned_char;
function vec_lvsr
(A : c_long;
B : constv_unsigned_short_ptr) return vector_unsigned_char;
function vec_lvsr
(A : c_long;
B : constv_short_ptr) return vector_unsigned_char;
function vec_lvsr
(A : c_long;
B : constv_unsigned_int_ptr) return vector_unsigned_char;
function vec_lvsr
(A : c_long;
B : constv_int_ptr) return vector_unsigned_char;
function vec_lvsr
(A : c_long;
B : constv_unsigned_long_ptr) return vector_unsigned_char;
function vec_lvsr
(A : c_long;
B : constv_long_ptr) return vector_unsigned_char;
function vec_lvsr
(A : c_long;
B : constv_float_ptr) return vector_unsigned_char;
-- vec_madd --
function vec_madd
(A : vector_float;
B : vector_float;
C : vector_float) return vector_float;
-- vec_madds --
function vec_madds
(A : vector_signed_short;
B : vector_signed_short;
C : vector_signed_short) return vector_signed_short;
-- vec_max --
function vec_max
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_max
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_max
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_max
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_max
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_max
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_max
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_max
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_max
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_max
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_max
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_max
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_max
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_max
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_max
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_max
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_max
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_max
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_max
(A : vector_float;
B : vector_float) return vector_float;
-- vec_vmaxfp --
function vec_vmaxfp
(A : vector_float;
B : vector_float) return vector_float;
-- vec_vmaxsw --
function vec_vmaxsw
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_vmaxsw
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_vmaxsw
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
-- vec_vmaxuw --
function vec_vmaxuw
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_vmaxuw
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_vmaxuw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vmaxsh --
function vec_vmaxsh
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_vmaxsh
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_vmaxsh
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
-- vec_vmaxuh --
function vec_vmaxuh
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_vmaxuh
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_vmaxuh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
-- vec_vmaxsb --
function vec_vmaxsb
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_vmaxsb
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_vmaxsb
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
-- vec_vmaxub --
function vec_vmaxub
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_vmaxub
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_vmaxub
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_mergeh --
function vec_mergeh
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char;
function vec_mergeh
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_mergeh
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_mergeh
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short;
function vec_mergeh
(A : vector_pixel;
B : vector_pixel) return vector_pixel;
function vec_mergeh
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_mergeh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_mergeh
(A : vector_float;
B : vector_float) return vector_float;
function vec_mergeh
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int;
function vec_mergeh
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_mergeh
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vmrghw --
function vec_vmrghw
(A : vector_float;
B : vector_float) return vector_float;
function vec_vmrghw
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int;
function vec_vmrghw
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_vmrghw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vmrghh --
function vec_vmrghh
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short;
function vec_vmrghh
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_vmrghh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_vmrghh
(A : vector_pixel;
B : vector_pixel) return vector_pixel;
-- vec_vmrghb --
function vec_vmrghb
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char;
function vec_vmrghb
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_vmrghb
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_mergel --
function vec_mergel
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char;
function vec_mergel
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_mergel
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_mergel
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short;
function vec_mergel
(A : vector_pixel;
B : vector_pixel) return vector_pixel;
function vec_mergel
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_mergel
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_mergel
(A : vector_float;
B : vector_float) return vector_float;
function vec_mergel
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int;
function vec_mergel
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_mergel
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vmrglw --
function vec_vmrglw
(A : vector_float;
B : vector_float) return vector_float;
function vec_vmrglw
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_vmrglw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_vmrglw
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int;
-- vec_vmrglh --
function vec_vmrglh
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short;
function vec_vmrglh
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_vmrglh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_vmrglh
(A : vector_pixel;
B : vector_pixel) return vector_pixel;
-- vec_vmrglb --
function vec_vmrglb
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char;
function vec_vmrglb
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_vmrglb
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_mfvscr --
function vec_mfvscr return vector_unsigned_short;
-- vec_min --
function vec_min
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_min
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_min
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_min
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_min
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_min
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_min
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_min
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_min
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_min
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_min
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_min
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_min
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_min
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_min
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_min
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_min
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_min
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_min
(A : vector_float;
B : vector_float) return vector_float;
-- vec_vminfp --
function vec_vminfp
(A : vector_float;
B : vector_float) return vector_float;
-- vec_vminsw --
function vec_vminsw
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_vminsw
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_vminsw
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
-- vec_vminuw --
function vec_vminuw
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_vminuw
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_vminuw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vminsh --
function vec_vminsh
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_vminsh
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_vminsh
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
-- vec_vminuh --
function vec_vminuh
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_vminuh
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_vminuh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
-- vec_vminsb --
function vec_vminsb
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_vminsb
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_vminsb
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
-- vec_vminub --
function vec_vminub
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_vminub
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_vminub
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_mladd --
function vec_mladd
(A : vector_signed_short;
B : vector_signed_short;
C : vector_signed_short) return vector_signed_short;
function vec_mladd
(A : vector_signed_short;
B : vector_unsigned_short;
C : vector_unsigned_short) return vector_signed_short;
function vec_mladd
(A : vector_unsigned_short;
B : vector_signed_short;
C : vector_signed_short) return vector_signed_short;
function vec_mladd
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_unsigned_short) return vector_unsigned_short;
-- vec_mradds --
function vec_mradds
(A : vector_signed_short;
B : vector_signed_short;
C : vector_signed_short) return vector_signed_short;
-- vec_msum --
function vec_msum
(A : vector_unsigned_char;
B : vector_unsigned_char;
C : vector_unsigned_int) return vector_unsigned_int;
function vec_msum
(A : vector_signed_char;
B : vector_unsigned_char;
C : vector_signed_int) return vector_signed_int;
function vec_msum
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_unsigned_int) return vector_unsigned_int;
function vec_msum
(A : vector_signed_short;
B : vector_signed_short;
C : vector_signed_int) return vector_signed_int;
-- vec_vmsumshm --
function vec_vmsumshm
(A : vector_signed_short;
B : vector_signed_short;
C : vector_signed_int) return vector_signed_int;
-- vec_vmsumuhm --
function vec_vmsumuhm
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_unsigned_int) return vector_unsigned_int;
-- vec_vmsummbm --
function vec_vmsummbm
(A : vector_signed_char;
B : vector_unsigned_char;
C : vector_signed_int) return vector_signed_int;
-- vec_vmsumubm --
function vec_vmsumubm
(A : vector_unsigned_char;
B : vector_unsigned_char;
C : vector_unsigned_int) return vector_unsigned_int;
-- vec_msums --
function vec_msums
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_unsigned_int) return vector_unsigned_int;
function vec_msums
(A : vector_signed_short;
B : vector_signed_short;
C : vector_signed_int) return vector_signed_int;
-- vec_vmsumshs --
function vec_vmsumshs
(A : vector_signed_short;
B : vector_signed_short;
C : vector_signed_int) return vector_signed_int;
-- vec_vmsumuhs --
function vec_vmsumuhs
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_unsigned_int) return vector_unsigned_int;
-- vec_mtvscr --
procedure vec_mtvscr
(A : vector_signed_int);
procedure vec_mtvscr
(A : vector_unsigned_int);
procedure vec_mtvscr
(A : vector_bool_int);
procedure vec_mtvscr
(A : vector_signed_short);
procedure vec_mtvscr
(A : vector_unsigned_short);
procedure vec_mtvscr
(A : vector_bool_short);
procedure vec_mtvscr
(A : vector_pixel);
procedure vec_mtvscr
(A : vector_signed_char);
procedure vec_mtvscr
(A : vector_unsigned_char);
procedure vec_mtvscr
(A : vector_bool_char);
-- vec_mule --
function vec_mule
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_short;
function vec_mule
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_short;
function vec_mule
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_int;
function vec_mule
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_int;
-- vec_vmulesh --
function vec_vmulesh
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_int;
-- vec_vmuleuh --
function vec_vmuleuh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_int;
-- vec_vmulesb --
function vec_vmulesb
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_short;
-- vec_vmuleub --
function vec_vmuleub
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_short;
-- vec_mulo --
function vec_mulo
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_short;
function vec_mulo
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_short;
function vec_mulo
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_int;
function vec_mulo
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_int;
-- vec_vmulosh --
function vec_vmulosh
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_int;
-- vec_vmulouh --
function vec_vmulouh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_int;
-- vec_vmulosb --
function vec_vmulosb
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_short;
-- vec_vmuloub --
function vec_vmuloub
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_short;
-- vec_nmsub --
function vec_nmsub
(A : vector_float;
B : vector_float;
C : vector_float) return vector_float;
-- vec_nor --
function vec_nor
(A : vector_float;
B : vector_float) return vector_float;
function vec_nor
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_nor
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_nor
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int;
function vec_nor
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_nor
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_nor
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short;
function vec_nor
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_nor
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_nor
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char;
-- vec_or --
function vec_or
(A : vector_float;
B : vector_float) return vector_float;
function vec_or
(A : vector_float;
B : vector_bool_int) return vector_float;
function vec_or
(A : vector_bool_int;
B : vector_float) return vector_float;
function vec_or
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int;
function vec_or
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_or
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_or
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_or
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_or
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_or
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_or
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short;
function vec_or
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_or
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_or
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_or
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_or
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_or
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_or
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_or
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char;
function vec_or
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_or
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_or
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_or
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_or
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_pack --
function vec_pack
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_char;
function vec_pack
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_char;
function vec_pack
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_char;
function vec_pack
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_short;
function vec_pack
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_short;
function vec_pack
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_short;
-- vec_vpkuwum --
function vec_vpkuwum
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_short;
function vec_vpkuwum
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_short;
function vec_vpkuwum
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_short;
-- vec_vpkuhum --
function vec_vpkuhum
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_char;
function vec_vpkuhum
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_char;
function vec_vpkuhum
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_char;
-- vec_packpx --
function vec_packpx
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_pixel;
-- vec_packs --
function vec_packs
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_char;
function vec_packs
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_char;
function vec_packs
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_short;
function vec_packs
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_short;
-- vec_vpkswss --
function vec_vpkswss
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_short;
-- vec_vpkuwus --
function vec_vpkuwus
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_short;
-- vec_vpkshss --
function vec_vpkshss
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_char;
-- vec_vpkuhus --
function vec_vpkuhus
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_char;
-- vec_packsu --
function vec_packsu
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_char;
function vec_packsu
(A : vector_signed_short;
B : vector_signed_short) return vector_unsigned_char;
function vec_packsu
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_short;
function vec_packsu
(A : vector_signed_int;
B : vector_signed_int) return vector_unsigned_short;
-- vec_vpkswus --
function vec_vpkswus
(A : vector_signed_int;
B : vector_signed_int) return vector_unsigned_short;
-- vec_vpkshus --
function vec_vpkshus
(A : vector_signed_short;
B : vector_signed_short) return vector_unsigned_char;
-- vec_perm --
function vec_perm
(A : vector_float;
B : vector_float;
C : vector_unsigned_char) return vector_float;
function vec_perm
(A : vector_signed_int;
B : vector_signed_int;
C : vector_unsigned_char) return vector_signed_int;
function vec_perm
(A : vector_unsigned_int;
B : vector_unsigned_int;
C : vector_unsigned_char) return vector_unsigned_int;
function vec_perm
(A : vector_bool_int;
B : vector_bool_int;
C : vector_unsigned_char) return vector_bool_int;
function vec_perm
(A : vector_signed_short;
B : vector_signed_short;
C : vector_unsigned_char) return vector_signed_short;
function vec_perm
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_unsigned_char) return vector_unsigned_short;
function vec_perm
(A : vector_bool_short;
B : vector_bool_short;
C : vector_unsigned_char) return vector_bool_short;
function vec_perm
(A : vector_pixel;
B : vector_pixel;
C : vector_unsigned_char) return vector_pixel;
function vec_perm
(A : vector_signed_char;
B : vector_signed_char;
C : vector_unsigned_char) return vector_signed_char;
function vec_perm
(A : vector_unsigned_char;
B : vector_unsigned_char;
C : vector_unsigned_char) return vector_unsigned_char;
function vec_perm
(A : vector_bool_char;
B : vector_bool_char;
C : vector_unsigned_char) return vector_bool_char;
-- vec_re --
function vec_re
(A : vector_float) return vector_float;
-- vec_rl --
function vec_rl
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_rl
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_rl
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short;
function vec_rl
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_rl
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int;
function vec_rl
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vrlw --
function vec_vrlw
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int;
function vec_vrlw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vrlh --
function vec_vrlh
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short;
function vec_vrlh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
-- vec_vrlb --
function vec_vrlb
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_vrlb
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_round --
function vec_round
(A : vector_float) return vector_float;
-- vec_rsqrte --
function vec_rsqrte
(A : vector_float) return vector_float;
-- vec_sel --
function vec_sel
(A : vector_float;
B : vector_float;
C : vector_bool_int) return vector_float;
function vec_sel
(A : vector_float;
B : vector_float;
C : vector_unsigned_int) return vector_float;
function vec_sel
(A : vector_signed_int;
B : vector_signed_int;
C : vector_bool_int) return vector_signed_int;
function vec_sel
(A : vector_signed_int;
B : vector_signed_int;
C : vector_unsigned_int) return vector_signed_int;
function vec_sel
(A : vector_unsigned_int;
B : vector_unsigned_int;
C : vector_bool_int) return vector_unsigned_int;
function vec_sel
(A : vector_unsigned_int;
B : vector_unsigned_int;
C : vector_unsigned_int) return vector_unsigned_int;
function vec_sel
(A : vector_bool_int;
B : vector_bool_int;
C : vector_bool_int) return vector_bool_int;
function vec_sel
(A : vector_bool_int;
B : vector_bool_int;
C : vector_unsigned_int) return vector_bool_int;
function vec_sel
(A : vector_signed_short;
B : vector_signed_short;
C : vector_bool_short) return vector_signed_short;
function vec_sel
(A : vector_signed_short;
B : vector_signed_short;
C : vector_unsigned_short) return vector_signed_short;
function vec_sel
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_bool_short) return vector_unsigned_short;
function vec_sel
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_unsigned_short) return vector_unsigned_short;
function vec_sel
(A : vector_bool_short;
B : vector_bool_short;
C : vector_bool_short) return vector_bool_short;
function vec_sel
(A : vector_bool_short;
B : vector_bool_short;
C : vector_unsigned_short) return vector_bool_short;
function vec_sel
(A : vector_signed_char;
B : vector_signed_char;
C : vector_bool_char) return vector_signed_char;
function vec_sel
(A : vector_signed_char;
B : vector_signed_char;
C : vector_unsigned_char) return vector_signed_char;
function vec_sel
(A : vector_unsigned_char;
B : vector_unsigned_char;
C : vector_bool_char) return vector_unsigned_char;
function vec_sel
(A : vector_unsigned_char;
B : vector_unsigned_char;
C : vector_unsigned_char) return vector_unsigned_char;
function vec_sel
(A : vector_bool_char;
B : vector_bool_char;
C : vector_bool_char) return vector_bool_char;
function vec_sel
(A : vector_bool_char;
B : vector_bool_char;
C : vector_unsigned_char) return vector_bool_char;
-- vec_sl --
function vec_sl
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_sl
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_sl
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short;
function vec_sl
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_sl
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int;
function vec_sl
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vslw --
function vec_vslw
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int;
function vec_vslw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vslh --
function vec_vslh
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short;
function vec_vslh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
-- vec_vslb --
function vec_vslb
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_vslb
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_sld --
function vec_sld
(A : vector_float;
B : vector_float;
C : c_int) return vector_float
renames Low_Level_Interface.vec_sld_vf_vf_cint_r_vf;
function vec_sld
(A : vector_signed_int;
B : vector_signed_int;
C : c_int) return vector_signed_int
renames Low_Level_Interface.vec_sld_vsi_vsi_cint_r_vsi;
function vec_sld
(A : vector_unsigned_int;
B : vector_unsigned_int;
C : c_int) return vector_unsigned_int
renames Low_Level_Interface.vec_sld_vui_vui_cint_r_vui;
function vec_sld
(A : vector_bool_int;
B : vector_bool_int;
C : c_int) return vector_bool_int
renames Low_Level_Interface.vec_sld_vbi_vbi_cint_r_vbi;
function vec_sld
(A : vector_signed_short;
B : vector_signed_short;
C : c_int) return vector_signed_short
renames Low_Level_Interface.vec_sld_vss_vss_cint_r_vss;
function vec_sld
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : c_int) return vector_unsigned_short
renames Low_Level_Interface.vec_sld_vus_vus_cint_r_vus;
function vec_sld
(A : vector_bool_short;
B : vector_bool_short;
C : c_int) return vector_bool_short
renames Low_Level_Interface.vec_sld_vbs_vbs_cint_r_vbs;
function vec_sld
(A : vector_pixel;
B : vector_pixel;
C : c_int) return vector_pixel
renames Low_Level_Interface.vec_sld_vx_vx_cint_r_vx;
function vec_sld
(A : vector_signed_char;
B : vector_signed_char;
C : c_int) return vector_signed_char
renames Low_Level_Interface.vec_sld_vsc_vsc_cint_r_vsc;
function vec_sld
(A : vector_unsigned_char;
B : vector_unsigned_char;
C : c_int) return vector_unsigned_char
renames Low_Level_Interface.vec_sld_vuc_vuc_cint_r_vuc;
function vec_sld
(A : vector_bool_char;
B : vector_bool_char;
C : c_int) return vector_bool_char
renames Low_Level_Interface.vec_sld_vbc_vbc_cint_r_vbc;
-- vec_sll --
function vec_sll
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int;
function vec_sll
(A : vector_signed_int;
B : vector_unsigned_short) return vector_signed_int;
function vec_sll
(A : vector_signed_int;
B : vector_unsigned_char) return vector_signed_int;
function vec_sll
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_sll
(A : vector_unsigned_int;
B : vector_unsigned_short) return vector_unsigned_int;
function vec_sll
(A : vector_unsigned_int;
B : vector_unsigned_char) return vector_unsigned_int;
function vec_sll
(A : vector_bool_int;
B : vector_unsigned_int) return vector_bool_int;
function vec_sll
(A : vector_bool_int;
B : vector_unsigned_short) return vector_bool_int;
function vec_sll
(A : vector_bool_int;
B : vector_unsigned_char) return vector_bool_int;
function vec_sll
(A : vector_signed_short;
B : vector_unsigned_int) return vector_signed_short;
function vec_sll
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short;
function vec_sll
(A : vector_signed_short;
B : vector_unsigned_char) return vector_signed_short;
function vec_sll
(A : vector_unsigned_short;
B : vector_unsigned_int) return vector_unsigned_short;
function vec_sll
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_sll
(A : vector_unsigned_short;
B : vector_unsigned_char) return vector_unsigned_short;
function vec_sll
(A : vector_bool_short;
B : vector_unsigned_int) return vector_bool_short;
function vec_sll
(A : vector_bool_short;
B : vector_unsigned_short) return vector_bool_short;
function vec_sll
(A : vector_bool_short;
B : vector_unsigned_char) return vector_bool_short;
function vec_sll
(A : vector_pixel;
B : vector_unsigned_int) return vector_pixel;
function vec_sll
(A : vector_pixel;
B : vector_unsigned_short) return vector_pixel;
function vec_sll
(A : vector_pixel;
B : vector_unsigned_char) return vector_pixel;
function vec_sll
(A : vector_signed_char;
B : vector_unsigned_int) return vector_signed_char;
function vec_sll
(A : vector_signed_char;
B : vector_unsigned_short) return vector_signed_char;
function vec_sll
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_sll
(A : vector_unsigned_char;
B : vector_unsigned_int) return vector_unsigned_char;
function vec_sll
(A : vector_unsigned_char;
B : vector_unsigned_short) return vector_unsigned_char;
function vec_sll
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_sll
(A : vector_bool_char;
B : vector_unsigned_int) return vector_bool_char;
function vec_sll
(A : vector_bool_char;
B : vector_unsigned_short) return vector_bool_char;
function vec_sll
(A : vector_bool_char;
B : vector_unsigned_char) return vector_bool_char;
-- vec_slo --
function vec_slo
(A : vector_float;
B : vector_signed_char) return vector_float;
function vec_slo
(A : vector_float;
B : vector_unsigned_char) return vector_float;
function vec_slo
(A : vector_signed_int;
B : vector_signed_char) return vector_signed_int;
function vec_slo
(A : vector_signed_int;
B : vector_unsigned_char) return vector_signed_int;
function vec_slo
(A : vector_unsigned_int;
B : vector_signed_char) return vector_unsigned_int;
function vec_slo
(A : vector_unsigned_int;
B : vector_unsigned_char) return vector_unsigned_int;
function vec_slo
(A : vector_signed_short;
B : vector_signed_char) return vector_signed_short;
function vec_slo
(A : vector_signed_short;
B : vector_unsigned_char) return vector_signed_short;
function vec_slo
(A : vector_unsigned_short;
B : vector_signed_char) return vector_unsigned_short;
function vec_slo
(A : vector_unsigned_short;
B : vector_unsigned_char) return vector_unsigned_short;
function vec_slo
(A : vector_pixel;
B : vector_signed_char) return vector_pixel;
function vec_slo
(A : vector_pixel;
B : vector_unsigned_char) return vector_pixel;
function vec_slo
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_slo
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_slo
(A : vector_unsigned_char;
B : vector_signed_char) return vector_unsigned_char;
function vec_slo
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_splat --
function vec_splat
(A : vector_signed_char;
B : c_int) return vector_signed_char
renames Low_Level_Interface.vec_splat_vsc_cint_r_vsc;
function vec_splat
(A : vector_unsigned_char;
B : c_int) return vector_unsigned_char
renames Low_Level_Interface.vec_splat_vuc_cint_r_vuc;
function vec_splat
(A : vector_bool_char;
B : c_int) return vector_bool_char
renames Low_Level_Interface.vec_splat_vbc_cint_r_vbc;
function vec_splat
(A : vector_signed_short;
B : c_int) return vector_signed_short
renames Low_Level_Interface.vec_splat_vss_cint_r_vss;
function vec_splat
(A : vector_unsigned_short;
B : c_int) return vector_unsigned_short
renames Low_Level_Interface.vec_splat_vus_cint_r_vus;
function vec_splat
(A : vector_bool_short;
B : c_int) return vector_bool_short
renames Low_Level_Interface.vec_splat_vbs_cint_r_vbs;
function vec_splat
(A : vector_pixel;
B : c_int) return vector_pixel
renames Low_Level_Interface.vec_splat_vx_cint_r_vx;
function vec_splat
(A : vector_float;
B : c_int) return vector_float
renames Low_Level_Interface.vec_splat_vf_cint_r_vf;
function vec_splat
(A : vector_signed_int;
B : c_int) return vector_signed_int
renames Low_Level_Interface.vec_splat_vsi_cint_r_vsi;
function vec_splat
(A : vector_unsigned_int;
B : c_int) return vector_unsigned_int
renames Low_Level_Interface.vec_splat_vui_cint_r_vui;
function vec_splat
(A : vector_bool_int;
B : c_int) return vector_bool_int
renames Low_Level_Interface.vec_splat_vbi_cint_r_vbi;
-- vec_vspltw --
function vec_vspltw
(A : vector_float;
B : c_int) return vector_float
renames Low_Level_Interface.vec_vspltw_vf_cint_r_vf;
function vec_vspltw
(A : vector_signed_int;
B : c_int) return vector_signed_int
renames Low_Level_Interface.vec_vspltw_vsi_cint_r_vsi;
function vec_vspltw
(A : vector_unsigned_int;
B : c_int) return vector_unsigned_int
renames Low_Level_Interface.vec_vspltw_vui_cint_r_vui;
function vec_vspltw
(A : vector_bool_int;
B : c_int) return vector_bool_int
renames Low_Level_Interface.vec_vspltw_vbi_cint_r_vbi;
-- vec_vsplth --
function vec_vsplth
(A : vector_bool_short;
B : c_int) return vector_bool_short
renames Low_Level_Interface.vec_vsplth_vbs_cint_r_vbs;
function vec_vsplth
(A : vector_signed_short;
B : c_int) return vector_signed_short
renames Low_Level_Interface.vec_vsplth_vss_cint_r_vss;
function vec_vsplth
(A : vector_unsigned_short;
B : c_int) return vector_unsigned_short
renames Low_Level_Interface.vec_vsplth_vus_cint_r_vus;
function vec_vsplth
(A : vector_pixel;
B : c_int) return vector_pixel
renames Low_Level_Interface.vec_vsplth_vx_cint_r_vx;
-- vec_vspltb --
function vec_vspltb
(A : vector_signed_char;
B : c_int) return vector_signed_char
renames Low_Level_Interface.vec_vspltb_vsc_cint_r_vsc;
function vec_vspltb
(A : vector_unsigned_char;
B : c_int) return vector_unsigned_char
renames Low_Level_Interface.vec_vspltb_vuc_cint_r_vuc;
function vec_vspltb
(A : vector_bool_char;
B : c_int) return vector_bool_char
renames Low_Level_Interface.vec_vspltb_vbc_cint_r_vbc;
-- vec_splat_s8 --
function vec_splat_s8
(A : c_int) return vector_signed_char
renames Low_Level_Interface.vec_splat_s8_cint_r_vsc;
-- vec_splat_s16 --
function vec_splat_s16
(A : c_int) return vector_signed_short
renames Low_Level_Interface.vec_splat_s16_cint_r_vss;
-- vec_splat_s32 --
function vec_splat_s32
(A : c_int) return vector_signed_int
renames Low_Level_Interface.vec_splat_s32_cint_r_vsi;
-- vec_splat_u8 --
function vec_splat_u8
(A : c_int) return vector_unsigned_char
renames Low_Level_Interface.vec_splat_u8_cint_r_vuc;
-- vec_splat_u16 --
function vec_splat_u16
(A : c_int) return vector_unsigned_short
renames Low_Level_Interface.vec_splat_u16_cint_r_vus;
-- vec_splat_u32 --
function vec_splat_u32
(A : c_int) return vector_unsigned_int
renames Low_Level_Interface.vec_splat_u32_cint_r_vui;
-- vec_sr --
function vec_sr
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_sr
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_sr
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short;
function vec_sr
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_sr
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int;
function vec_sr
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vsrw --
function vec_vsrw
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int;
function vec_vsrw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vsrh --
function vec_vsrh
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short;
function vec_vsrh
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
-- vec_vsrb --
function vec_vsrb
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_vsrb
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_sra --
function vec_sra
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_sra
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_sra
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short;
function vec_sra
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_sra
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int;
function vec_sra
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vsraw --
function vec_vsraw
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int;
function vec_vsraw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vsrah --
function vec_vsrah
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short;
function vec_vsrah
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
-- vec_vsrab --
function vec_vsrab
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_vsrab
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_srl --
function vec_srl
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int;
function vec_srl
(A : vector_signed_int;
B : vector_unsigned_short) return vector_signed_int;
function vec_srl
(A : vector_signed_int;
B : vector_unsigned_char) return vector_signed_int;
function vec_srl
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_srl
(A : vector_unsigned_int;
B : vector_unsigned_short) return vector_unsigned_int;
function vec_srl
(A : vector_unsigned_int;
B : vector_unsigned_char) return vector_unsigned_int;
function vec_srl
(A : vector_bool_int;
B : vector_unsigned_int) return vector_bool_int;
function vec_srl
(A : vector_bool_int;
B : vector_unsigned_short) return vector_bool_int;
function vec_srl
(A : vector_bool_int;
B : vector_unsigned_char) return vector_bool_int;
function vec_srl
(A : vector_signed_short;
B : vector_unsigned_int) return vector_signed_short;
function vec_srl
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short;
function vec_srl
(A : vector_signed_short;
B : vector_unsigned_char) return vector_signed_short;
function vec_srl
(A : vector_unsigned_short;
B : vector_unsigned_int) return vector_unsigned_short;
function vec_srl
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_srl
(A : vector_unsigned_short;
B : vector_unsigned_char) return vector_unsigned_short;
function vec_srl
(A : vector_bool_short;
B : vector_unsigned_int) return vector_bool_short;
function vec_srl
(A : vector_bool_short;
B : vector_unsigned_short) return vector_bool_short;
function vec_srl
(A : vector_bool_short;
B : vector_unsigned_char) return vector_bool_short;
function vec_srl
(A : vector_pixel;
B : vector_unsigned_int) return vector_pixel;
function vec_srl
(A : vector_pixel;
B : vector_unsigned_short) return vector_pixel;
function vec_srl
(A : vector_pixel;
B : vector_unsigned_char) return vector_pixel;
function vec_srl
(A : vector_signed_char;
B : vector_unsigned_int) return vector_signed_char;
function vec_srl
(A : vector_signed_char;
B : vector_unsigned_short) return vector_signed_char;
function vec_srl
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_srl
(A : vector_unsigned_char;
B : vector_unsigned_int) return vector_unsigned_char;
function vec_srl
(A : vector_unsigned_char;
B : vector_unsigned_short) return vector_unsigned_char;
function vec_srl
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_srl
(A : vector_bool_char;
B : vector_unsigned_int) return vector_bool_char;
function vec_srl
(A : vector_bool_char;
B : vector_unsigned_short) return vector_bool_char;
function vec_srl
(A : vector_bool_char;
B : vector_unsigned_char) return vector_bool_char;
-- vec_sro --
function vec_sro
(A : vector_float;
B : vector_signed_char) return vector_float;
function vec_sro
(A : vector_float;
B : vector_unsigned_char) return vector_float;
function vec_sro
(A : vector_signed_int;
B : vector_signed_char) return vector_signed_int;
function vec_sro
(A : vector_signed_int;
B : vector_unsigned_char) return vector_signed_int;
function vec_sro
(A : vector_unsigned_int;
B : vector_signed_char) return vector_unsigned_int;
function vec_sro
(A : vector_unsigned_int;
B : vector_unsigned_char) return vector_unsigned_int;
function vec_sro
(A : vector_signed_short;
B : vector_signed_char) return vector_signed_short;
function vec_sro
(A : vector_signed_short;
B : vector_unsigned_char) return vector_signed_short;
function vec_sro
(A : vector_unsigned_short;
B : vector_signed_char) return vector_unsigned_short;
function vec_sro
(A : vector_unsigned_short;
B : vector_unsigned_char) return vector_unsigned_short;
function vec_sro
(A : vector_pixel;
B : vector_signed_char) return vector_pixel;
function vec_sro
(A : vector_pixel;
B : vector_unsigned_char) return vector_pixel;
function vec_sro
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_sro
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char;
function vec_sro
(A : vector_unsigned_char;
B : vector_signed_char) return vector_unsigned_char;
function vec_sro
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_st --
procedure vec_st
(A : vector_float;
B : c_int;
C : vector_float_ptr);
procedure vec_st
(A : vector_float;
B : c_int;
C : float_ptr);
procedure vec_st
(A : vector_signed_int;
B : c_int;
C : vector_signed_int_ptr);
procedure vec_st
(A : vector_signed_int;
B : c_int;
C : int_ptr);
procedure vec_st
(A : vector_unsigned_int;
B : c_int;
C : vector_unsigned_int_ptr);
procedure vec_st
(A : vector_unsigned_int;
B : c_int;
C : unsigned_int_ptr);
procedure vec_st
(A : vector_bool_int;
B : c_int;
C : vector_bool_int_ptr);
procedure vec_st
(A : vector_bool_int;
B : c_int;
C : unsigned_int_ptr);
procedure vec_st
(A : vector_bool_int;
B : c_int;
C : int_ptr);
procedure vec_st
(A : vector_signed_short;
B : c_int;
C : vector_signed_short_ptr);
procedure vec_st
(A : vector_signed_short;
B : c_int;
C : short_ptr);
procedure vec_st
(A : vector_unsigned_short;
B : c_int;
C : vector_unsigned_short_ptr);
procedure vec_st
(A : vector_unsigned_short;
B : c_int;
C : unsigned_short_ptr);
procedure vec_st
(A : vector_bool_short;
B : c_int;
C : vector_bool_short_ptr);
procedure vec_st
(A : vector_bool_short;
B : c_int;
C : unsigned_short_ptr);
procedure vec_st
(A : vector_pixel;
B : c_int;
C : vector_pixel_ptr);
procedure vec_st
(A : vector_pixel;
B : c_int;
C : unsigned_short_ptr);
procedure vec_st
(A : vector_pixel;
B : c_int;
C : short_ptr);
procedure vec_st
(A : vector_bool_short;
B : c_int;
C : short_ptr);
procedure vec_st
(A : vector_signed_char;
B : c_int;
C : vector_signed_char_ptr);
procedure vec_st
(A : vector_signed_char;
B : c_int;
C : signed_char_ptr);
procedure vec_st
(A : vector_unsigned_char;
B : c_int;
C : vector_unsigned_char_ptr);
procedure vec_st
(A : vector_unsigned_char;
B : c_int;
C : unsigned_char_ptr);
procedure vec_st
(A : vector_bool_char;
B : c_int;
C : vector_bool_char_ptr);
procedure vec_st
(A : vector_bool_char;
B : c_int;
C : unsigned_char_ptr);
procedure vec_st
(A : vector_bool_char;
B : c_int;
C : signed_char_ptr);
-- vec_ste --
procedure vec_ste
(A : vector_signed_char;
B : c_int;
C : signed_char_ptr);
procedure vec_ste
(A : vector_unsigned_char;
B : c_int;
C : unsigned_char_ptr);
procedure vec_ste
(A : vector_bool_char;
B : c_int;
C : signed_char_ptr);
procedure vec_ste
(A : vector_bool_char;
B : c_int;
C : unsigned_char_ptr);
procedure vec_ste
(A : vector_signed_short;
B : c_int;
C : short_ptr);
procedure vec_ste
(A : vector_unsigned_short;
B : c_int;
C : unsigned_short_ptr);
procedure vec_ste
(A : vector_bool_short;
B : c_int;
C : short_ptr);
procedure vec_ste
(A : vector_bool_short;
B : c_int;
C : unsigned_short_ptr);
procedure vec_ste
(A : vector_pixel;
B : c_int;
C : short_ptr);
procedure vec_ste
(A : vector_pixel;
B : c_int;
C : unsigned_short_ptr);
procedure vec_ste
(A : vector_float;
B : c_int;
C : float_ptr);
procedure vec_ste
(A : vector_signed_int;
B : c_int;
C : int_ptr);
procedure vec_ste
(A : vector_unsigned_int;
B : c_int;
C : unsigned_int_ptr);
procedure vec_ste
(A : vector_bool_int;
B : c_int;
C : int_ptr);
procedure vec_ste
(A : vector_bool_int;
B : c_int;
C : unsigned_int_ptr);
-- vec_stvewx --
procedure vec_stvewx
(A : vector_float;
B : c_int;
C : float_ptr);
procedure vec_stvewx
(A : vector_signed_int;
B : c_int;
C : int_ptr);
procedure vec_stvewx
(A : vector_unsigned_int;
B : c_int;
C : unsigned_int_ptr);
procedure vec_stvewx
(A : vector_bool_int;
B : c_int;
C : int_ptr);
procedure vec_stvewx
(A : vector_bool_int;
B : c_int;
C : unsigned_int_ptr);
-- vec_stvehx --
procedure vec_stvehx
(A : vector_signed_short;
B : c_int;
C : short_ptr);
procedure vec_stvehx
(A : vector_unsigned_short;
B : c_int;
C : unsigned_short_ptr);
procedure vec_stvehx
(A : vector_bool_short;
B : c_int;
C : short_ptr);
procedure vec_stvehx
(A : vector_bool_short;
B : c_int;
C : unsigned_short_ptr);
procedure vec_stvehx
(A : vector_pixel;
B : c_int;
C : short_ptr);
procedure vec_stvehx
(A : vector_pixel;
B : c_int;
C : unsigned_short_ptr);
-- vec_stvebx --
procedure vec_stvebx
(A : vector_signed_char;
B : c_int;
C : signed_char_ptr);
procedure vec_stvebx
(A : vector_unsigned_char;
B : c_int;
C : unsigned_char_ptr);
procedure vec_stvebx
(A : vector_bool_char;
B : c_int;
C : signed_char_ptr);
procedure vec_stvebx
(A : vector_bool_char;
B : c_int;
C : unsigned_char_ptr);
-- vec_stl --
procedure vec_stl
(A : vector_float;
B : c_int;
C : vector_float_ptr);
procedure vec_stl
(A : vector_float;
B : c_int;
C : float_ptr);
procedure vec_stl
(A : vector_signed_int;
B : c_int;
C : vector_signed_int_ptr);
procedure vec_stl
(A : vector_signed_int;
B : c_int;
C : int_ptr);
procedure vec_stl
(A : vector_unsigned_int;
B : c_int;
C : vector_unsigned_int_ptr);
procedure vec_stl
(A : vector_unsigned_int;
B : c_int;
C : unsigned_int_ptr);
procedure vec_stl
(A : vector_bool_int;
B : c_int;
C : vector_bool_int_ptr);
procedure vec_stl
(A : vector_bool_int;
B : c_int;
C : unsigned_int_ptr);
procedure vec_stl
(A : vector_bool_int;
B : c_int;
C : int_ptr);
procedure vec_stl
(A : vector_signed_short;
B : c_int;
C : vector_signed_short_ptr);
procedure vec_stl
(A : vector_signed_short;
B : c_int;
C : short_ptr);
procedure vec_stl
(A : vector_unsigned_short;
B : c_int;
C : vector_unsigned_short_ptr);
procedure vec_stl
(A : vector_unsigned_short;
B : c_int;
C : unsigned_short_ptr);
procedure vec_stl
(A : vector_bool_short;
B : c_int;
C : vector_bool_short_ptr);
procedure vec_stl
(A : vector_bool_short;
B : c_int;
C : unsigned_short_ptr);
procedure vec_stl
(A : vector_bool_short;
B : c_int;
C : short_ptr);
procedure vec_stl
(A : vector_pixel;
B : c_int;
C : vector_pixel_ptr);
procedure vec_stl
(A : vector_pixel;
B : c_int;
C : unsigned_short_ptr);
procedure vec_stl
(A : vector_pixel;
B : c_int;
C : short_ptr);
procedure vec_stl
(A : vector_signed_char;
B : c_int;
C : vector_signed_char_ptr);
procedure vec_stl
(A : vector_signed_char;
B : c_int;
C : signed_char_ptr);
procedure vec_stl
(A : vector_unsigned_char;
B : c_int;
C : vector_unsigned_char_ptr);
procedure vec_stl
(A : vector_unsigned_char;
B : c_int;
C : unsigned_char_ptr);
procedure vec_stl
(A : vector_bool_char;
B : c_int;
C : vector_bool_char_ptr);
procedure vec_stl
(A : vector_bool_char;
B : c_int;
C : unsigned_char_ptr);
procedure vec_stl
(A : vector_bool_char;
B : c_int;
C : signed_char_ptr);
-- vec_sub --
function vec_sub
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_sub
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_sub
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_sub
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_sub
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_sub
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_sub
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_sub
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_sub
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_sub
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_sub
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_sub
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_sub
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_sub
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_sub
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_sub
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_sub
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_sub
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_sub
(A : vector_float;
B : vector_float) return vector_float;
-- vec_vsubfp --
function vec_vsubfp
(A : vector_float;
B : vector_float) return vector_float;
-- vec_vsubuwm --
function vec_vsubuwm
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_vsubuwm
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_vsubuwm
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_vsubuwm
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_vsubuwm
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_vsubuwm
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vsubuhm --
function vec_vsubuhm
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_vsubuhm
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_vsubuhm
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_vsubuhm
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_vsubuhm
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_vsubuhm
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
-- vec_vsububm --
function vec_vsububm
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_vsububm
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_vsububm
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_vsububm
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_vsububm
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_vsububm
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_subc --
function vec_subc
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_subs --
function vec_subs
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_subs
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_subs
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_subs
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_subs
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_subs
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_subs
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_subs
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_subs
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_subs
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_subs
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_subs
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_subs
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_subs
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_subs
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_subs
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_subs
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_subs
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
-- vec_vsubsws --
function vec_vsubsws
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_vsubsws
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_vsubsws
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
-- vec_vsubuws --
function vec_vsubuws
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_vsubuws
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_vsubuws
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_vsubshs --
function vec_vsubshs
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_vsubshs
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_vsubshs
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
-- vec_vsubuhs --
function vec_vsubuhs
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_vsubuhs
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_vsubuhs
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
-- vec_vsubsbs --
function vec_vsubsbs
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_vsubsbs
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_vsubsbs
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
-- vec_vsububs --
function vec_vsububs
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_vsububs
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_vsububs
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
-- vec_sum4s --
function vec_sum4s
(A : vector_unsigned_char;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_sum4s
(A : vector_signed_char;
B : vector_signed_int) return vector_signed_int;
function vec_sum4s
(A : vector_signed_short;
B : vector_signed_int) return vector_signed_int;
-- vec_vsum4shs --
function vec_vsum4shs
(A : vector_signed_short;
B : vector_signed_int) return vector_signed_int;
-- vec_vsum4sbs --
function vec_vsum4sbs
(A : vector_signed_char;
B : vector_signed_int) return vector_signed_int;
-- vec_vsum4ubs --
function vec_vsum4ubs
(A : vector_unsigned_char;
B : vector_unsigned_int) return vector_unsigned_int;
-- vec_sum2s --
function vec_sum2s
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
-- vec_sums --
function vec_sums
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
-- vec_trunc --
function vec_trunc
(A : vector_float) return vector_float;
-- vec_unpackh --
function vec_unpackh
(A : vector_signed_char) return vector_signed_short;
function vec_unpackh
(A : vector_bool_char) return vector_bool_short;
function vec_unpackh
(A : vector_signed_short) return vector_signed_int;
function vec_unpackh
(A : vector_bool_short) return vector_bool_int;
function vec_unpackh
(A : vector_pixel) return vector_unsigned_int;
-- vec_vupkhsh --
function vec_vupkhsh
(A : vector_bool_short) return vector_bool_int;
function vec_vupkhsh
(A : vector_signed_short) return vector_signed_int;
-- vec_vupkhpx --
function vec_vupkhpx
(A : vector_pixel) return vector_unsigned_int;
-- vec_vupkhsb --
function vec_vupkhsb
(A : vector_bool_char) return vector_bool_short;
function vec_vupkhsb
(A : vector_signed_char) return vector_signed_short;
-- vec_unpackl --
function vec_unpackl
(A : vector_signed_char) return vector_signed_short;
function vec_unpackl
(A : vector_bool_char) return vector_bool_short;
function vec_unpackl
(A : vector_pixel) return vector_unsigned_int;
function vec_unpackl
(A : vector_signed_short) return vector_signed_int;
function vec_unpackl
(A : vector_bool_short) return vector_bool_int;
-- vec_vupklpx --
function vec_vupklpx
(A : vector_pixel) return vector_unsigned_int;
-- vec_upklsh --
function vec_vupklsh
(A : vector_bool_short) return vector_bool_int;
function vec_vupklsh
(A : vector_signed_short) return vector_signed_int;
-- vec_vupklsb --
function vec_vupklsb
(A : vector_bool_char) return vector_bool_short;
function vec_vupklsb
(A : vector_signed_char) return vector_signed_short;
-- vec_xor --
function vec_xor
(A : vector_float;
B : vector_float) return vector_float;
function vec_xor
(A : vector_float;
B : vector_bool_int) return vector_float;
function vec_xor
(A : vector_bool_int;
B : vector_float) return vector_float;
function vec_xor
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int;
function vec_xor
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int;
function vec_xor
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int;
function vec_xor
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int;
function vec_xor
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_xor
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int;
function vec_xor
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int;
function vec_xor
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short;
function vec_xor
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short;
function vec_xor
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short;
function vec_xor
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short;
function vec_xor
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_xor
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short;
function vec_xor
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short;
function vec_xor
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char;
function vec_xor
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char;
function vec_xor
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char;
function vec_xor
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char;
function vec_xor
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char;
function vec_xor
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char;
function vec_xor
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char;
----------------------------------
-- [PIM-4.5 AltiVec predicates] --
----------------------------------
-- vec_all_eq --
function vec_all_eq
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_all_eq
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_all_eq
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_all_eq
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_all_eq
(A : vector_bool_char;
B : vector_bool_char) return c_int;
function vec_all_eq
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_all_eq
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_all_eq
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_all_eq
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_all_eq
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_all_eq
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_all_eq
(A : vector_bool_short;
B : vector_bool_short) return c_int;
function vec_all_eq
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_all_eq
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_all_eq
(A : vector_pixel;
B : vector_pixel) return c_int;
function vec_all_eq
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_all_eq
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_all_eq
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_all_eq
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_all_eq
(A : vector_bool_int;
B : vector_bool_int) return c_int;
function vec_all_eq
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_all_eq
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_all_eq
(A : vector_float;
B : vector_float) return c_int;
-- vec_all_ge --
function vec_all_ge
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_all_ge
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_all_ge
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_all_ge
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_all_ge
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_all_ge
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_all_ge
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_all_ge
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_all_ge
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_all_ge
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_all_ge
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_all_ge
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_all_ge
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_all_ge
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_all_ge
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_all_ge
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_all_ge
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_all_ge
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_all_ge
(A : vector_float;
B : vector_float) return c_int;
-- vec_all_gt --
function vec_all_gt
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_all_gt
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_all_gt
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_all_gt
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_all_gt
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_all_gt
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_all_gt
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_all_gt
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_all_gt
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_all_gt
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_all_gt
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_all_gt
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_all_gt
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_all_gt
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_all_gt
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_all_gt
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_all_gt
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_all_gt
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_all_gt
(A : vector_float;
B : vector_float) return c_int;
-- vec_all_in --
function vec_all_in
(A : vector_float;
B : vector_float) return c_int;
-- vec_all_le --
function vec_all_le
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_all_le
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_all_le
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_all_le
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_all_le
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_all_le
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_all_le
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_all_le
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_all_le
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_all_le
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_all_le
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_all_le
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_all_le
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_all_le
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_all_le
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_all_le
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_all_le
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_all_le
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_all_le
(A : vector_float;
B : vector_float) return c_int;
-- vec_all_lt --
function vec_all_lt
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_all_lt
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_all_lt
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_all_lt
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_all_lt
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_all_lt
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_all_lt
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_all_lt
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_all_lt
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_all_lt
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_all_lt
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_all_lt
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_all_lt
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_all_lt
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_all_lt
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_all_lt
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_all_lt
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_all_lt
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_all_lt
(A : vector_float;
B : vector_float) return c_int;
-- vec_all_nan --
function vec_all_nan
(A : vector_float) return c_int;
-- vec_all_ne --
function vec_all_ne
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_all_ne
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_all_ne
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_all_ne
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_all_ne
(A : vector_bool_char;
B : vector_bool_char) return c_int;
function vec_all_ne
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_all_ne
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_all_ne
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_all_ne
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_all_ne
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_all_ne
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_all_ne
(A : vector_bool_short;
B : vector_bool_short) return c_int;
function vec_all_ne
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_all_ne
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_all_ne
(A : vector_pixel;
B : vector_pixel) return c_int;
function vec_all_ne
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_all_ne
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_all_ne
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_all_ne
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_all_ne
(A : vector_bool_int;
B : vector_bool_int) return c_int;
function vec_all_ne
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_all_ne
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_all_ne
(A : vector_float;
B : vector_float) return c_int;
-- vec_all_nge --
function vec_all_nge
(A : vector_float;
B : vector_float) return c_int;
-- vec_all_ngt --
function vec_all_ngt
(A : vector_float;
B : vector_float) return c_int;
-- vec_all_nle --
function vec_all_nle
(A : vector_float;
B : vector_float) return c_int;
-- vec_all_nlt --
function vec_all_nlt
(A : vector_float;
B : vector_float) return c_int;
-- vec_all_numeric --
function vec_all_numeric
(A : vector_float) return c_int;
-- vec_any_eq --
function vec_any_eq
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_any_eq
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_any_eq
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_any_eq
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_any_eq
(A : vector_bool_char;
B : vector_bool_char) return c_int;
function vec_any_eq
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_any_eq
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_any_eq
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_any_eq
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_any_eq
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_any_eq
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_any_eq
(A : vector_bool_short;
B : vector_bool_short) return c_int;
function vec_any_eq
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_any_eq
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_any_eq
(A : vector_pixel;
B : vector_pixel) return c_int;
function vec_any_eq
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_any_eq
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_any_eq
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_any_eq
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_any_eq
(A : vector_bool_int;
B : vector_bool_int) return c_int;
function vec_any_eq
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_any_eq
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_any_eq
(A : vector_float;
B : vector_float) return c_int;
-- vec_any_ge --
function vec_any_ge
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_any_ge
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_any_ge
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_any_ge
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_any_ge
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_any_ge
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_any_ge
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_any_ge
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_any_ge
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_any_ge
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_any_ge
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_any_ge
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_any_ge
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_any_ge
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_any_ge
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_any_ge
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_any_ge
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_any_ge
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_any_ge
(A : vector_float;
B : vector_float) return c_int;
-- vec_any_gt --
function vec_any_gt
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_any_gt
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_any_gt
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_any_gt
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_any_gt
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_any_gt
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_any_gt
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_any_gt
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_any_gt
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_any_gt
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_any_gt
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_any_gt
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_any_gt
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_any_gt
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_any_gt
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_any_gt
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_any_gt
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_any_gt
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_any_gt
(A : vector_float;
B : vector_float) return c_int;
-- vec_any_le --
function vec_any_le
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_any_le
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_any_le
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_any_le
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_any_le
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_any_le
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_any_le
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_any_le
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_any_le
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_any_le
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_any_le
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_any_le
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_any_le
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_any_le
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_any_le
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_any_le
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_any_le
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_any_le
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_any_le
(A : vector_float;
B : vector_float) return c_int;
-- vec_any_lt --
function vec_any_lt
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_any_lt
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_any_lt
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_any_lt
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_any_lt
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_any_lt
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_any_lt
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_any_lt
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_any_lt
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_any_lt
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_any_lt
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_any_lt
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_any_lt
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_any_lt
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_any_lt
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_any_lt
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_any_lt
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_any_lt
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_any_lt
(A : vector_float;
B : vector_float) return c_int;
-- vec_any_nan --
function vec_any_nan
(A : vector_float) return c_int;
-- vec_any_ne --
function vec_any_ne
(A : vector_signed_char;
B : vector_bool_char) return c_int;
function vec_any_ne
(A : vector_signed_char;
B : vector_signed_char) return c_int;
function vec_any_ne
(A : vector_unsigned_char;
B : vector_bool_char) return c_int;
function vec_any_ne
(A : vector_unsigned_char;
B : vector_unsigned_char) return c_int;
function vec_any_ne
(A : vector_bool_char;
B : vector_bool_char) return c_int;
function vec_any_ne
(A : vector_bool_char;
B : vector_unsigned_char) return c_int;
function vec_any_ne
(A : vector_bool_char;
B : vector_signed_char) return c_int;
function vec_any_ne
(A : vector_signed_short;
B : vector_bool_short) return c_int;
function vec_any_ne
(A : vector_signed_short;
B : vector_signed_short) return c_int;
function vec_any_ne
(A : vector_unsigned_short;
B : vector_bool_short) return c_int;
function vec_any_ne
(A : vector_unsigned_short;
B : vector_unsigned_short) return c_int;
function vec_any_ne
(A : vector_bool_short;
B : vector_bool_short) return c_int;
function vec_any_ne
(A : vector_bool_short;
B : vector_unsigned_short) return c_int;
function vec_any_ne
(A : vector_bool_short;
B : vector_signed_short) return c_int;
function vec_any_ne
(A : vector_pixel;
B : vector_pixel) return c_int;
function vec_any_ne
(A : vector_signed_int;
B : vector_bool_int) return c_int;
function vec_any_ne
(A : vector_signed_int;
B : vector_signed_int) return c_int;
function vec_any_ne
(A : vector_unsigned_int;
B : vector_bool_int) return c_int;
function vec_any_ne
(A : vector_unsigned_int;
B : vector_unsigned_int) return c_int;
function vec_any_ne
(A : vector_bool_int;
B : vector_bool_int) return c_int;
function vec_any_ne
(A : vector_bool_int;
B : vector_unsigned_int) return c_int;
function vec_any_ne
(A : vector_bool_int;
B : vector_signed_int) return c_int;
function vec_any_ne
(A : vector_float;
B : vector_float) return c_int;
-- vec_any_nge --
function vec_any_nge
(A : vector_float;
B : vector_float) return c_int;
-- vec_any_ngt --
function vec_any_ngt
(A : vector_float;
B : vector_float) return c_int;
-- vec_any_nle --
function vec_any_nle
(A : vector_float;
B : vector_float) return c_int;
-- vec_any_nlt --
function vec_any_nlt
(A : vector_float;
B : vector_float) return c_int;
-- vec_any_numeric --
function vec_any_numeric
(A : vector_float) return c_int;
-- vec_any_out --
function vec_any_out
(A : vector_float;
B : vector_float) return c_int;
-------------------------------------------
-- Straight overloads of routines aboves --
-------------------------------------------
-- vec_vaddcuw --
function vec_vaddcuw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_addc;
-- vec_vand --
function vec_vand
(A : vector_float;
B : vector_float) return vector_float
renames vec_and;
function vec_vand
(A : vector_float;
B : vector_bool_int) return vector_float
renames vec_and;
function vec_vand
(A : vector_bool_int;
B : vector_float) return vector_float
renames vec_and;
function vec_vand
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int
renames vec_and;
function vec_vand
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int
renames vec_and;
function vec_vand
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int
renames vec_and;
function vec_vand
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int
renames vec_and;
function vec_vand
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_and;
function vec_vand
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int
renames vec_and;
function vec_vand
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_and;
function vec_vand
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short
renames vec_and;
function vec_vand
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short
renames vec_and;
function vec_vand
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short
renames vec_and;
function vec_vand
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short
renames vec_and;
function vec_vand
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short
renames vec_and;
function vec_vand
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short
renames vec_and;
function vec_vand
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short
renames vec_and;
function vec_vand
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char
renames vec_and;
function vec_vand
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char
renames vec_and;
function vec_vand
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char
renames vec_and;
function vec_vand
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char
renames vec_and;
function vec_vand
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_and;
function vec_vand
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char
renames vec_and;
function vec_vand
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_and;
-- vec_vandc --
function vec_vandc
(A : vector_float;
B : vector_float) return vector_float
renames vec_andc;
function vec_vandc
(A : vector_float;
B : vector_bool_int) return vector_float
renames vec_andc;
function vec_vandc
(A : vector_bool_int;
B : vector_float) return vector_float
renames vec_andc;
function vec_vandc
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int
renames vec_andc;
function vec_vandc
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int
renames vec_andc;
function vec_vandc
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int
renames vec_andc;
function vec_vandc
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int
renames vec_andc;
function vec_vandc
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_andc;
function vec_vandc
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int
renames vec_andc;
function vec_vandc
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_andc;
function vec_vandc
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short
renames vec_andc;
function vec_vandc
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short
renames vec_andc;
function vec_vandc
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short
renames vec_andc;
function vec_vandc
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short
renames vec_andc;
function vec_vandc
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short
renames vec_andc;
function vec_vandc
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short
renames vec_andc;
function vec_vandc
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short
renames vec_andc;
function vec_vandc
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char
renames vec_andc;
function vec_vandc
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char
renames vec_andc;
function vec_vandc
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char
renames vec_andc;
function vec_vandc
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char
renames vec_andc;
function vec_vandc
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_andc;
function vec_vandc
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char
renames vec_andc;
function vec_vandc
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_andc;
-- vec_vrfip --
function vec_vrfip
(A : vector_float) return vector_float
renames vec_ceil;
-- vec_vcmpbfp --
function vec_vcmpbfp
(A : vector_float;
B : vector_float) return vector_signed_int
renames vec_cmpb;
-- vec_vcmpgefp --
function vec_vcmpgefp
(A : vector_float;
B : vector_float) return vector_bool_int
renames vec_cmpge;
-- vec_vctsxs --
function vec_vctsxs
(A : vector_float;
B : c_int) return vector_signed_int
renames vec_cts;
-- vec_vctuxs --
function vec_vctuxs
(A : vector_float;
B : c_int) return vector_unsigned_int
renames vec_ctu;
-- vec_vexptefp --
function vec_vexptefp
(A : vector_float) return vector_float
renames vec_expte;
-- vec_vrfim --
function vec_vrfim
(A : vector_float) return vector_float
renames vec_floor;
-- vec_lvx --
function vec_lvx
(A : c_long;
B : const_vector_float_ptr) return vector_float
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_float_ptr) return vector_float
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_vector_bool_int_ptr) return vector_bool_int
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_vector_signed_int_ptr) return vector_signed_int
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_int_ptr) return vector_signed_int
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_long_ptr) return vector_signed_int
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_vector_unsigned_int_ptr) return vector_unsigned_int
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_unsigned_int_ptr) return vector_unsigned_int
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_unsigned_long_ptr) return vector_unsigned_int
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_vector_bool_short_ptr) return vector_bool_short
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_vector_pixel_ptr) return vector_pixel
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_vector_signed_short_ptr) return vector_signed_short
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_short_ptr) return vector_signed_short
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_vector_unsigned_short_ptr) return vector_unsigned_short
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_unsigned_short_ptr) return vector_unsigned_short
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_vector_bool_char_ptr) return vector_bool_char
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_vector_signed_char_ptr) return vector_signed_char
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_signed_char_ptr) return vector_signed_char
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_vector_unsigned_char_ptr) return vector_unsigned_char
renames vec_ld;
function vec_lvx
(A : c_long;
B : const_unsigned_char_ptr) return vector_unsigned_char
renames vec_ld;
-- vec_lvxl --
function vec_lvxl
(A : c_long;
B : const_vector_float_ptr) return vector_float
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_float_ptr) return vector_float
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_vector_bool_int_ptr) return vector_bool_int
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_vector_signed_int_ptr) return vector_signed_int
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_int_ptr) return vector_signed_int
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_long_ptr) return vector_signed_int
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_vector_unsigned_int_ptr) return vector_unsigned_int
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_unsigned_int_ptr) return vector_unsigned_int
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_unsigned_long_ptr) return vector_unsigned_int
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_vector_bool_short_ptr) return vector_bool_short
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_vector_pixel_ptr) return vector_pixel
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_vector_signed_short_ptr) return vector_signed_short
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_short_ptr) return vector_signed_short
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_vector_unsigned_short_ptr) return vector_unsigned_short
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_unsigned_short_ptr) return vector_unsigned_short
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_vector_bool_char_ptr) return vector_bool_char
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_vector_signed_char_ptr) return vector_signed_char
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_signed_char_ptr) return vector_signed_char
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_vector_unsigned_char_ptr) return vector_unsigned_char
renames vec_ldl;
function vec_lvxl
(A : c_long;
B : const_unsigned_char_ptr) return vector_unsigned_char
renames vec_ldl;
-- vec_vlogefp --
function vec_vlogefp
(A : vector_float) return vector_float
renames vec_loge;
-- vec_vmaddfp --
function vec_vmaddfp
(A : vector_float;
B : vector_float;
C : vector_float) return vector_float
renames vec_madd;
-- vec_vmhaddshs --
function vec_vmhaddshs
(A : vector_signed_short;
B : vector_signed_short;
C : vector_signed_short) return vector_signed_short
renames vec_madds;
-- vec_vmladduhm --
function vec_vmladduhm
(A : vector_signed_short;
B : vector_signed_short;
C : vector_signed_short) return vector_signed_short
renames vec_mladd;
function vec_vmladduhm
(A : vector_signed_short;
B : vector_unsigned_short;
C : vector_unsigned_short) return vector_signed_short
renames vec_mladd;
function vec_vmladduhm
(A : vector_unsigned_short;
B : vector_signed_short;
C : vector_signed_short) return vector_signed_short
renames vec_mladd;
function vec_vmladduhm
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_unsigned_short) return vector_unsigned_short
renames vec_mladd;
-- vec_vmhraddshs --
function vec_vmhraddshs
(A : vector_signed_short;
B : vector_signed_short;
C : vector_signed_short) return vector_signed_short
renames vec_mradds;
-- vec_vnmsubfp --
function vec_vnmsubfp
(A : vector_float;
B : vector_float;
C : vector_float) return vector_float
renames vec_nmsub;
-- vec_vnor --
function vec_vnor
(A : vector_float;
B : vector_float) return vector_float
renames vec_nor;
function vec_vnor
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int
renames vec_nor;
function vec_vnor
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_nor;
function vec_vnor
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int
renames vec_nor;
function vec_vnor
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short
renames vec_nor;
function vec_vnor
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short
renames vec_nor;
function vec_vnor
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short
renames vec_nor;
function vec_vnor
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char
renames vec_nor;
function vec_vnor
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_nor;
function vec_vnor
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char
renames vec_nor;
-- vec_vor --
function vec_vor
(A : vector_float;
B : vector_float) return vector_float
renames vec_or;
function vec_vor
(A : vector_float;
B : vector_bool_int) return vector_float
renames vec_or;
function vec_vor
(A : vector_bool_int;
B : vector_float) return vector_float
renames vec_or;
function vec_vor
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int
renames vec_or;
function vec_vor
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int
renames vec_or;
function vec_vor
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int
renames vec_or;
function vec_vor
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int
renames vec_or;
function vec_vor
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_or;
function vec_vor
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int
renames vec_or;
function vec_vor
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_or;
function vec_vor
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short
renames vec_or;
function vec_vor
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short
renames vec_or;
function vec_vor
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short
renames vec_or;
function vec_vor
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short
renames vec_or;
function vec_vor
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short
renames vec_or;
function vec_vor
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short
renames vec_or;
function vec_vor
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short
renames vec_or;
function vec_vor
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char
renames vec_or;
function vec_vor
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char
renames vec_or;
function vec_vor
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char
renames vec_or;
function vec_vor
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char
renames vec_or;
function vec_vor
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_or;
function vec_vor
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char
renames vec_or;
function vec_vor
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_or;
-- vec_vpkpx --
function vec_vpkpx
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_pixel
renames vec_packpx;
-- vec_vperm --
function vec_vperm
(A : vector_float;
B : vector_float;
C : vector_unsigned_char) return vector_float
renames vec_perm;
function vec_vperm
(A : vector_signed_int;
B : vector_signed_int;
C : vector_unsigned_char) return vector_signed_int
renames vec_perm;
function vec_vperm
(A : vector_unsigned_int;
B : vector_unsigned_int;
C : vector_unsigned_char) return vector_unsigned_int
renames vec_perm;
function vec_vperm
(A : vector_bool_int;
B : vector_bool_int;
C : vector_unsigned_char) return vector_bool_int
renames vec_perm;
function vec_vperm
(A : vector_signed_short;
B : vector_signed_short;
C : vector_unsigned_char) return vector_signed_short
renames vec_perm;
function vec_vperm
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_unsigned_char) return vector_unsigned_short
renames vec_perm;
function vec_vperm
(A : vector_bool_short;
B : vector_bool_short;
C : vector_unsigned_char) return vector_bool_short
renames vec_perm;
function vec_vperm
(A : vector_pixel;
B : vector_pixel;
C : vector_unsigned_char) return vector_pixel
renames vec_perm;
function vec_vperm
(A : vector_signed_char;
B : vector_signed_char;
C : vector_unsigned_char) return vector_signed_char
renames vec_perm;
function vec_vperm
(A : vector_unsigned_char;
B : vector_unsigned_char;
C : vector_unsigned_char) return vector_unsigned_char
renames vec_perm;
function vec_vperm
(A : vector_bool_char;
B : vector_bool_char;
C : vector_unsigned_char) return vector_bool_char
renames vec_perm;
-- vec_vrefp --
function vec_vrefp
(A : vector_float) return vector_float
renames vec_re;
-- vec_vrfin --
function vec_vrfin
(A : vector_float) return vector_float
renames vec_round;
-- vec_vrsqrtefp --
function vec_vrsqrtefp
(A : vector_float) return vector_float
renames vec_rsqrte;
-- vec_vsel --
function vec_vsel
(A : vector_float;
B : vector_float;
C : vector_bool_int) return vector_float
renames vec_sel;
function vec_vsel
(A : vector_float;
B : vector_float;
C : vector_unsigned_int) return vector_float
renames vec_sel;
function vec_vsel
(A : vector_signed_int;
B : vector_signed_int;
C : vector_bool_int) return vector_signed_int
renames vec_sel;
function vec_vsel
(A : vector_signed_int;
B : vector_signed_int;
C : vector_unsigned_int) return vector_signed_int
renames vec_sel;
function vec_vsel
(A : vector_unsigned_int;
B : vector_unsigned_int;
C : vector_bool_int) return vector_unsigned_int
renames vec_sel;
function vec_vsel
(A : vector_unsigned_int;
B : vector_unsigned_int;
C : vector_unsigned_int) return vector_unsigned_int
renames vec_sel;
function vec_vsel
(A : vector_bool_int;
B : vector_bool_int;
C : vector_bool_int) return vector_bool_int
renames vec_sel;
function vec_vsel
(A : vector_bool_int;
B : vector_bool_int;
C : vector_unsigned_int) return vector_bool_int
renames vec_sel;
function vec_vsel
(A : vector_signed_short;
B : vector_signed_short;
C : vector_bool_short) return vector_signed_short
renames vec_sel;
function vec_vsel
(A : vector_signed_short;
B : vector_signed_short;
C : vector_unsigned_short) return vector_signed_short
renames vec_sel;
function vec_vsel
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_bool_short) return vector_unsigned_short
renames vec_sel;
function vec_vsel
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : vector_unsigned_short) return vector_unsigned_short
renames vec_sel;
function vec_vsel
(A : vector_bool_short;
B : vector_bool_short;
C : vector_bool_short) return vector_bool_short
renames vec_sel;
function vec_vsel
(A : vector_bool_short;
B : vector_bool_short;
C : vector_unsigned_short) return vector_bool_short
renames vec_sel;
function vec_vsel
(A : vector_signed_char;
B : vector_signed_char;
C : vector_bool_char) return vector_signed_char
renames vec_sel;
function vec_vsel
(A : vector_signed_char;
B : vector_signed_char;
C : vector_unsigned_char) return vector_signed_char
renames vec_sel;
function vec_vsel
(A : vector_unsigned_char;
B : vector_unsigned_char;
C : vector_bool_char) return vector_unsigned_char
renames vec_sel;
function vec_vsel
(A : vector_unsigned_char;
B : vector_unsigned_char;
C : vector_unsigned_char) return vector_unsigned_char
renames vec_sel;
function vec_vsel
(A : vector_bool_char;
B : vector_bool_char;
C : vector_bool_char) return vector_bool_char
renames vec_sel;
function vec_vsel
(A : vector_bool_char;
B : vector_bool_char;
C : vector_unsigned_char) return vector_bool_char
renames vec_sel;
-- vec_vsldoi --
function vec_vsldoi
(A : vector_float;
B : vector_float;
C : c_int) return vector_float
renames vec_sld;
function vec_vsldoi
(A : vector_signed_int;
B : vector_signed_int;
C : c_int) return vector_signed_int
renames vec_sld;
function vec_vsldoi
(A : vector_unsigned_int;
B : vector_unsigned_int;
C : c_int) return vector_unsigned_int
renames vec_sld;
function vec_vsldoi
(A : vector_bool_int;
B : vector_bool_int;
C : c_int) return vector_bool_int
renames vec_sld;
function vec_vsldoi
(A : vector_signed_short;
B : vector_signed_short;
C : c_int) return vector_signed_short
renames vec_sld;
function vec_vsldoi
(A : vector_unsigned_short;
B : vector_unsigned_short;
C : c_int) return vector_unsigned_short
renames vec_sld;
function vec_vsldoi
(A : vector_bool_short;
B : vector_bool_short;
C : c_int) return vector_bool_short
renames vec_sld;
function vec_vsldoi
(A : vector_pixel;
B : vector_pixel;
C : c_int) return vector_pixel
renames vec_sld;
function vec_vsldoi
(A : vector_signed_char;
B : vector_signed_char;
C : c_int) return vector_signed_char
renames vec_sld;
function vec_vsldoi
(A : vector_unsigned_char;
B : vector_unsigned_char;
C : c_int) return vector_unsigned_char
renames vec_sld;
function vec_vsldoi
(A : vector_bool_char;
B : vector_bool_char;
C : c_int) return vector_bool_char
renames vec_sld;
-- vec_vsl --
function vec_vsl
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int
renames vec_sll;
function vec_vsl
(A : vector_signed_int;
B : vector_unsigned_short) return vector_signed_int
renames vec_sll;
function vec_vsl
(A : vector_signed_int;
B : vector_unsigned_char) return vector_signed_int
renames vec_sll;
function vec_vsl
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_sll;
function vec_vsl
(A : vector_unsigned_int;
B : vector_unsigned_short) return vector_unsigned_int
renames vec_sll;
function vec_vsl
(A : vector_unsigned_int;
B : vector_unsigned_char) return vector_unsigned_int
renames vec_sll;
function vec_vsl
(A : vector_bool_int;
B : vector_unsigned_int) return vector_bool_int
renames vec_sll;
function vec_vsl
(A : vector_bool_int;
B : vector_unsigned_short) return vector_bool_int
renames vec_sll;
function vec_vsl
(A : vector_bool_int;
B : vector_unsigned_char) return vector_bool_int
renames vec_sll;
function vec_vsl
(A : vector_signed_short;
B : vector_unsigned_int) return vector_signed_short
renames vec_sll;
function vec_vsl
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short
renames vec_sll;
function vec_vsl
(A : vector_signed_short;
B : vector_unsigned_char) return vector_signed_short
renames vec_sll;
function vec_vsl
(A : vector_unsigned_short;
B : vector_unsigned_int) return vector_unsigned_short
renames vec_sll;
function vec_vsl
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short
renames vec_sll;
function vec_vsl
(A : vector_unsigned_short;
B : vector_unsigned_char) return vector_unsigned_short
renames vec_sll;
function vec_vsl
(A : vector_bool_short;
B : vector_unsigned_int) return vector_bool_short
renames vec_sll;
function vec_vsl
(A : vector_bool_short;
B : vector_unsigned_short) return vector_bool_short
renames vec_sll;
function vec_vsl
(A : vector_bool_short;
B : vector_unsigned_char) return vector_bool_short
renames vec_sll;
function vec_vsl
(A : vector_pixel;
B : vector_unsigned_int) return vector_pixel
renames vec_sll;
function vec_vsl
(A : vector_pixel;
B : vector_unsigned_short) return vector_pixel
renames vec_sll;
function vec_vsl
(A : vector_pixel;
B : vector_unsigned_char) return vector_pixel
renames vec_sll;
function vec_vsl
(A : vector_signed_char;
B : vector_unsigned_int) return vector_signed_char
renames vec_sll;
function vec_vsl
(A : vector_signed_char;
B : vector_unsigned_short) return vector_signed_char
renames vec_sll;
function vec_vsl
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char
renames vec_sll;
function vec_vsl
(A : vector_unsigned_char;
B : vector_unsigned_int) return vector_unsigned_char
renames vec_sll;
function vec_vsl
(A : vector_unsigned_char;
B : vector_unsigned_short) return vector_unsigned_char
renames vec_sll;
function vec_vsl
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_sll;
function vec_vsl
(A : vector_bool_char;
B : vector_unsigned_int) return vector_bool_char
renames vec_sll;
function vec_vsl
(A : vector_bool_char;
B : vector_unsigned_short) return vector_bool_char
renames vec_sll;
function vec_vsl
(A : vector_bool_char;
B : vector_unsigned_char) return vector_bool_char
renames vec_sll;
-- vec_vslo --
function vec_vslo
(A : vector_float;
B : vector_signed_char) return vector_float
renames vec_slo;
function vec_vslo
(A : vector_float;
B : vector_unsigned_char) return vector_float
renames vec_slo;
function vec_vslo
(A : vector_signed_int;
B : vector_signed_char) return vector_signed_int
renames vec_slo;
function vec_vslo
(A : vector_signed_int;
B : vector_unsigned_char) return vector_signed_int
renames vec_slo;
function vec_vslo
(A : vector_unsigned_int;
B : vector_signed_char) return vector_unsigned_int
renames vec_slo;
function vec_vslo
(A : vector_unsigned_int;
B : vector_unsigned_char) return vector_unsigned_int
renames vec_slo;
function vec_vslo
(A : vector_signed_short;
B : vector_signed_char) return vector_signed_short
renames vec_slo;
function vec_vslo
(A : vector_signed_short;
B : vector_unsigned_char) return vector_signed_short
renames vec_slo;
function vec_vslo
(A : vector_unsigned_short;
B : vector_signed_char) return vector_unsigned_short
renames vec_slo;
function vec_vslo
(A : vector_unsigned_short;
B : vector_unsigned_char) return vector_unsigned_short
renames vec_slo;
function vec_vslo
(A : vector_pixel;
B : vector_signed_char) return vector_pixel
renames vec_slo;
function vec_vslo
(A : vector_pixel;
B : vector_unsigned_char) return vector_pixel
renames vec_slo;
function vec_vslo
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char
renames vec_slo;
function vec_vslo
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char
renames vec_slo;
function vec_vslo
(A : vector_unsigned_char;
B : vector_signed_char) return vector_unsigned_char
renames vec_slo;
function vec_vslo
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_slo;
-- vec_vspltisb --
function vec_vspltisb
(A : c_int) return vector_signed_char
renames vec_splat_s8;
-- vec_vspltish --
function vec_vspltish
(A : c_int) return vector_signed_short
renames vec_splat_s16;
-- vec_vspltisw --
function vec_vspltisw
(A : c_int) return vector_signed_int
renames vec_splat_s32;
-- vec_vsr --
function vec_vsr
(A : vector_signed_int;
B : vector_unsigned_int) return vector_signed_int
renames vec_srl;
function vec_vsr
(A : vector_signed_int;
B : vector_unsigned_short) return vector_signed_int
renames vec_srl;
function vec_vsr
(A : vector_signed_int;
B : vector_unsigned_char) return vector_signed_int
renames vec_srl;
function vec_vsr
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_srl;
function vec_vsr
(A : vector_unsigned_int;
B : vector_unsigned_short) return vector_unsigned_int
renames vec_srl;
function vec_vsr
(A : vector_unsigned_int;
B : vector_unsigned_char) return vector_unsigned_int
renames vec_srl;
function vec_vsr
(A : vector_bool_int;
B : vector_unsigned_int) return vector_bool_int
renames vec_srl;
function vec_vsr
(A : vector_bool_int;
B : vector_unsigned_short) return vector_bool_int
renames vec_srl;
function vec_vsr
(A : vector_bool_int;
B : vector_unsigned_char) return vector_bool_int
renames vec_srl;
function vec_vsr
(A : vector_signed_short;
B : vector_unsigned_int) return vector_signed_short
renames vec_srl;
function vec_vsr
(A : vector_signed_short;
B : vector_unsigned_short) return vector_signed_short
renames vec_srl;
function vec_vsr
(A : vector_signed_short;
B : vector_unsigned_char) return vector_signed_short
renames vec_srl;
function vec_vsr
(A : vector_unsigned_short;
B : vector_unsigned_int) return vector_unsigned_short
renames vec_srl;
function vec_vsr
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short
renames vec_srl;
function vec_vsr
(A : vector_unsigned_short;
B : vector_unsigned_char) return vector_unsigned_short
renames vec_srl;
function vec_vsr
(A : vector_bool_short;
B : vector_unsigned_int) return vector_bool_short
renames vec_srl;
function vec_vsr
(A : vector_bool_short;
B : vector_unsigned_short) return vector_bool_short
renames vec_srl;
function vec_vsr
(A : vector_bool_short;
B : vector_unsigned_char) return vector_bool_short
renames vec_srl;
function vec_vsr
(A : vector_pixel;
B : vector_unsigned_int) return vector_pixel
renames vec_srl;
function vec_vsr
(A : vector_pixel;
B : vector_unsigned_short) return vector_pixel
renames vec_srl;
function vec_vsr
(A : vector_pixel;
B : vector_unsigned_char) return vector_pixel
renames vec_srl;
function vec_vsr
(A : vector_signed_char;
B : vector_unsigned_int) return vector_signed_char
renames vec_srl;
function vec_vsr
(A : vector_signed_char;
B : vector_unsigned_short) return vector_signed_char
renames vec_srl;
function vec_vsr
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char
renames vec_srl;
function vec_vsr
(A : vector_unsigned_char;
B : vector_unsigned_int) return vector_unsigned_char
renames vec_srl;
function vec_vsr
(A : vector_unsigned_char;
B : vector_unsigned_short) return vector_unsigned_char
renames vec_srl;
function vec_vsr
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_srl;
function vec_vsr
(A : vector_bool_char;
B : vector_unsigned_int) return vector_bool_char
renames vec_srl;
function vec_vsr
(A : vector_bool_char;
B : vector_unsigned_short) return vector_bool_char
renames vec_srl;
function vec_vsr
(A : vector_bool_char;
B : vector_unsigned_char) return vector_bool_char
renames vec_srl;
-- vec_vsro --
function vec_vsro
(A : vector_float;
B : vector_signed_char) return vector_float
renames vec_sro;
function vec_vsro
(A : vector_float;
B : vector_unsigned_char) return vector_float
renames vec_sro;
function vec_vsro
(A : vector_signed_int;
B : vector_signed_char) return vector_signed_int
renames vec_sro;
function vec_vsro
(A : vector_signed_int;
B : vector_unsigned_char) return vector_signed_int
renames vec_sro;
function vec_vsro
(A : vector_unsigned_int;
B : vector_signed_char) return vector_unsigned_int
renames vec_sro;
function vec_vsro
(A : vector_unsigned_int;
B : vector_unsigned_char) return vector_unsigned_int
renames vec_sro;
function vec_vsro
(A : vector_signed_short;
B : vector_signed_char) return vector_signed_short
renames vec_sro;
function vec_vsro
(A : vector_signed_short;
B : vector_unsigned_char) return vector_signed_short
renames vec_sro;
function vec_vsro
(A : vector_unsigned_short;
B : vector_signed_char) return vector_unsigned_short
renames vec_sro;
function vec_vsro
(A : vector_unsigned_short;
B : vector_unsigned_char) return vector_unsigned_short
renames vec_sro;
function vec_vsro
(A : vector_pixel;
B : vector_signed_char) return vector_pixel
renames vec_sro;
function vec_vsro
(A : vector_pixel;
B : vector_unsigned_char) return vector_pixel
renames vec_sro;
function vec_vsro
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char
renames vec_sro;
function vec_vsro
(A : vector_signed_char;
B : vector_unsigned_char) return vector_signed_char
renames vec_sro;
function vec_vsro
(A : vector_unsigned_char;
B : vector_signed_char) return vector_unsigned_char
renames vec_sro;
function vec_vsro
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_sro;
-- vec_stvx --
procedure vec_stvx
(A : vector_float;
B : c_int;
C : vector_float_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_float;
B : c_int;
C : float_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_signed_int;
B : c_int;
C : vector_signed_int_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_signed_int;
B : c_int;
C : int_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_unsigned_int;
B : c_int;
C : vector_unsigned_int_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_unsigned_int;
B : c_int;
C : unsigned_int_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_bool_int;
B : c_int;
C : vector_bool_int_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_bool_int;
B : c_int;
C : unsigned_int_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_bool_int;
B : c_int;
C : int_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_signed_short;
B : c_int;
C : vector_signed_short_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_signed_short;
B : c_int;
C : short_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_unsigned_short;
B : c_int;
C : vector_unsigned_short_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_unsigned_short;
B : c_int;
C : unsigned_short_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_bool_short;
B : c_int;
C : vector_bool_short_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_bool_short;
B : c_int;
C : unsigned_short_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_pixel;
B : c_int;
C : vector_pixel_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_pixel;
B : c_int;
C : unsigned_short_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_pixel;
B : c_int;
C : short_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_bool_short;
B : c_int;
C : short_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_signed_char;
B : c_int;
C : vector_signed_char_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_signed_char;
B : c_int;
C : signed_char_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_unsigned_char;
B : c_int;
C : vector_unsigned_char_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_unsigned_char;
B : c_int;
C : unsigned_char_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_bool_char;
B : c_int;
C : vector_bool_char_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_bool_char;
B : c_int;
C : unsigned_char_ptr)
renames vec_st;
procedure vec_stvx
(A : vector_bool_char;
B : c_int;
C : signed_char_ptr)
renames vec_st;
-- vec_stvxl --
procedure vec_stvxl
(A : vector_float;
B : c_int;
C : vector_float_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_float;
B : c_int;
C : float_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_signed_int;
B : c_int;
C : vector_signed_int_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_signed_int;
B : c_int;
C : int_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_unsigned_int;
B : c_int;
C : vector_unsigned_int_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_unsigned_int;
B : c_int;
C : unsigned_int_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_bool_int;
B : c_int;
C : vector_bool_int_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_bool_int;
B : c_int;
C : unsigned_int_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_bool_int;
B : c_int;
C : int_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_signed_short;
B : c_int;
C : vector_signed_short_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_signed_short;
B : c_int;
C : short_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_unsigned_short;
B : c_int;
C : vector_unsigned_short_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_unsigned_short;
B : c_int;
C : unsigned_short_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_bool_short;
B : c_int;
C : vector_bool_short_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_bool_short;
B : c_int;
C : unsigned_short_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_bool_short;
B : c_int;
C : short_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_pixel;
B : c_int;
C : vector_pixel_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_pixel;
B : c_int;
C : unsigned_short_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_pixel;
B : c_int;
C : short_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_signed_char;
B : c_int;
C : vector_signed_char_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_signed_char;
B : c_int;
C : signed_char_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_unsigned_char;
B : c_int;
C : vector_unsigned_char_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_unsigned_char;
B : c_int;
C : unsigned_char_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_bool_char;
B : c_int;
C : vector_bool_char_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_bool_char;
B : c_int;
C : unsigned_char_ptr)
renames vec_stl;
procedure vec_stvxl
(A : vector_bool_char;
B : c_int;
C : signed_char_ptr)
renames vec_stl;
-- vec_vsubcuw --
function vec_vsubcuw
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_subc;
-- vec_vsum2sws --
function vec_vsum2sws
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int
renames vec_sum2s;
-- vec_vsumsws --
function vec_vsumsws
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int
renames vec_sums;
-- vec_vrfiz --
function vec_vrfiz
(A : vector_float) return vector_float
renames vec_trunc;
-- vec_vxor --
function vec_vxor
(A : vector_float;
B : vector_float) return vector_float
renames vec_xor;
function vec_vxor
(A : vector_float;
B : vector_bool_int) return vector_float
renames vec_xor;
function vec_vxor
(A : vector_bool_int;
B : vector_float) return vector_float
renames vec_xor;
function vec_vxor
(A : vector_bool_int;
B : vector_bool_int) return vector_bool_int
renames vec_xor;
function vec_vxor
(A : vector_bool_int;
B : vector_signed_int) return vector_signed_int
renames vec_xor;
function vec_vxor
(A : vector_signed_int;
B : vector_bool_int) return vector_signed_int
renames vec_xor;
function vec_vxor
(A : vector_signed_int;
B : vector_signed_int) return vector_signed_int
renames vec_xor;
function vec_vxor
(A : vector_bool_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_xor;
function vec_vxor
(A : vector_unsigned_int;
B : vector_bool_int) return vector_unsigned_int
renames vec_xor;
function vec_vxor
(A : vector_unsigned_int;
B : vector_unsigned_int) return vector_unsigned_int
renames vec_xor;
function vec_vxor
(A : vector_bool_short;
B : vector_bool_short) return vector_bool_short
renames vec_xor;
function vec_vxor
(A : vector_bool_short;
B : vector_signed_short) return vector_signed_short
renames vec_xor;
function vec_vxor
(A : vector_signed_short;
B : vector_bool_short) return vector_signed_short
renames vec_xor;
function vec_vxor
(A : vector_signed_short;
B : vector_signed_short) return vector_signed_short
renames vec_xor;
function vec_vxor
(A : vector_bool_short;
B : vector_unsigned_short) return vector_unsigned_short
renames vec_xor;
function vec_vxor
(A : vector_unsigned_short;
B : vector_bool_short) return vector_unsigned_short
renames vec_xor;
function vec_vxor
(A : vector_unsigned_short;
B : vector_unsigned_short) return vector_unsigned_short
renames vec_xor;
function vec_vxor
(A : vector_bool_char;
B : vector_signed_char) return vector_signed_char
renames vec_xor;
function vec_vxor
(A : vector_bool_char;
B : vector_bool_char) return vector_bool_char
renames vec_xor;
function vec_vxor
(A : vector_signed_char;
B : vector_bool_char) return vector_signed_char
renames vec_xor;
function vec_vxor
(A : vector_signed_char;
B : vector_signed_char) return vector_signed_char
renames vec_xor;
function vec_vxor
(A : vector_bool_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_xor;
function vec_vxor
(A : vector_unsigned_char;
B : vector_bool_char) return vector_unsigned_char
renames vec_xor;
function vec_vxor
(A : vector_unsigned_char;
B : vector_unsigned_char) return vector_unsigned_char
renames vec_xor;
----------------------------------------------
-- [PIM 2.5.3 Value for adjusting pointers] --
----------------------------------------------
-- "At compile time, vec_step (vec_data) produces the integer value
-- representing the amount by which a pointer to a component of an AltiVec
-- data type should increment to cause a pointer increment to increment by
-- 16 bytes".
function vec_step (V : vector_unsigned_char) return Integer;
function vec_step (V : vector_signed_char) return Integer;
function vec_step (V : vector_bool_char) return Integer;
function vec_step (V : vector_unsigned_short) return Integer;
function vec_step (V : vector_signed_short) return Integer;
function vec_step (V : vector_bool_short) return Integer;
function vec_step (V : vector_unsigned_int) return Integer;
function vec_step (V : vector_signed_int) return Integer;
function vec_step (V : vector_bool_int) return Integer;
function vec_step (V : vector_float) return Integer;
function vec_step (V : vector_pixel) return Integer;
private
-------------------------------------
-- Different flavors of interfaces --
-------------------------------------
-- The vast majority of the user visible functions are just neutral type
-- conversion wrappers around calls to low level primitives. For instance:
--
-- function vec_sll
-- (A : vector_signed_int;
-- B : vector_unsigned_char) return vector_signed_int is
-- begin
-- return To_VSI (vsl (To_VSI (A), To_VSI (B)));
-- end vec_sll;
--
-- We actually don't always need an explicit wrapper and can bind directly
-- with a straight Import of the low level routine, or a renaming of such
-- instead.
--
-- A direct binding is not possible (that is, a wrapper is mandatory) in
-- a number of cases:
--
-- o When the high-level/low-level types don't match, in which case a
-- straight import would risk wrong code generation or compiler blowups in
-- the Hard binding case. This is the case for 'B' in the example above.
--
-- o When the high-level/low-level argument lists differ, as is the case
-- for most of the AltiVec predicates, relying on a low-level primitive
-- which expects a control code argument, like:
--
-- function vec_any_ne
-- (A : vector_signed_int;
-- B : vector_signed_int) return c_int is
-- begin
-- return vcmpequw_p (CR6_LT_REV, To_VSI (A), To_VSI (B));
-- end vec_any_ne;
--
-- o When the high-level/low-level arguments order don't match, as in:
--
-- function vec_cmplt
-- (A : vector_unsigned_char;
-- B : vector_unsigned_char) return vector_bool_char is
-- begin
-- return To_VBC (vcmpgtub (To_VSC (B), To_VSC (A)));
-- end vec_cmplt;
--
-- Conversely, a direct (without wrapper) binding is sometimes mandatory
-- in the Hard binding case, because the corresponding low level code
-- accept only literal values for some arguments. Inlined calls to the
-- wrapper with proper arguments would be fine, but the wrapper body
-- itself would not be compilable. These can of course also be used in the
-- Soft binding, and so are naturally in this common unit.
--
-- Fortunately, the sets of operations for which a wrapper is required
-- and the set of operations for which a wrapper would not be compilable
-- do not intersect.
-----------------------------
-- Inlining considerations --
-----------------------------
-- The intent in the Hard binding case is to eventually map operations
-- to hardware instructions. Needless to say, intermediate function calls
-- do not fit this purpose, so all the user visible subprograms shall be
-- inlined. In the soft case, the bulk of the work is performed by the
-- low level routines, and those exported by this unit are short enough
-- for the inlining to make sense and even be beneficial, so...
pragma Inline_Always (vec_abs);
pragma Inline_Always (vec_abss);
pragma Inline_Always (vec_add);
pragma Inline_Always (vec_vaddfp);
pragma Inline_Always (vec_vadduwm);
pragma Inline_Always (vec_vadduhm);
pragma Inline_Always (vec_vaddubm);
pragma Inline_Always (vec_addc);
pragma Inline_Always (vec_adds);
pragma Inline_Always (vec_vaddsws);
pragma Inline_Always (vec_vadduws);
pragma Inline_Always (vec_vaddshs);
pragma Inline_Always (vec_vadduhs);
pragma Inline_Always (vec_vaddsbs);
pragma Inline_Always (vec_vaddubs);
pragma Inline_Always (vec_and);
pragma Inline_Always (vec_andc);
pragma Inline_Always (vec_avg);
pragma Inline_Always (vec_vavgsw);
pragma Inline_Always (vec_vavguw);
pragma Inline_Always (vec_vavgsh);
pragma Inline_Always (vec_vavguh);
pragma Inline_Always (vec_vavgsb);
pragma Inline_Always (vec_vavgub);
pragma Inline_Always (vec_ceil);
pragma Inline_Always (vec_cmpb);
pragma Inline_Always (vec_cmpeq);
pragma Inline_Always (vec_vcmpeqfp);
pragma Inline_Always (vec_vcmpequw);
pragma Inline_Always (vec_vcmpequh);
pragma Inline_Always (vec_vcmpequb);
pragma Inline_Always (vec_cmpge);
pragma Inline_Always (vec_cmpgt);
pragma Inline_Always (vec_vcmpgtfp);
pragma Inline_Always (vec_vcmpgtsw);
pragma Inline_Always (vec_vcmpgtuw);
pragma Inline_Always (vec_vcmpgtsh);
pragma Inline_Always (vec_vcmpgtuh);
pragma Inline_Always (vec_vcmpgtsb);
pragma Inline_Always (vec_vcmpgtub);
pragma Inline_Always (vec_cmple);
pragma Inline_Always (vec_cmplt);
pragma Inline_Always (vec_expte);
pragma Inline_Always (vec_floor);
pragma Inline_Always (vec_ld);
pragma Inline_Always (vec_lde);
pragma Inline_Always (vec_lvewx);
pragma Inline_Always (vec_lvehx);
pragma Inline_Always (vec_lvebx);
pragma Inline_Always (vec_ldl);
pragma Inline_Always (vec_loge);
pragma Inline_Always (vec_lvsl);
pragma Inline_Always (vec_lvsr);
pragma Inline_Always (vec_madd);
pragma Inline_Always (vec_madds);
pragma Inline_Always (vec_max);
pragma Inline_Always (vec_vmaxfp);
pragma Inline_Always (vec_vmaxsw);
pragma Inline_Always (vec_vmaxuw);
pragma Inline_Always (vec_vmaxsh);
pragma Inline_Always (vec_vmaxuh);
pragma Inline_Always (vec_vmaxsb);
pragma Inline_Always (vec_vmaxub);
pragma Inline_Always (vec_mergeh);
pragma Inline_Always (vec_vmrghw);
pragma Inline_Always (vec_vmrghh);
pragma Inline_Always (vec_vmrghb);
pragma Inline_Always (vec_mergel);
pragma Inline_Always (vec_vmrglw);
pragma Inline_Always (vec_vmrglh);
pragma Inline_Always (vec_vmrglb);
pragma Inline_Always (vec_mfvscr);
pragma Inline_Always (vec_min);
pragma Inline_Always (vec_vminfp);
pragma Inline_Always (vec_vminsw);
pragma Inline_Always (vec_vminuw);
pragma Inline_Always (vec_vminsh);
pragma Inline_Always (vec_vminuh);
pragma Inline_Always (vec_vminsb);
pragma Inline_Always (vec_vminub);
pragma Inline_Always (vec_mladd);
pragma Inline_Always (vec_mradds);
pragma Inline_Always (vec_msum);
pragma Inline_Always (vec_vmsumshm);
pragma Inline_Always (vec_vmsumuhm);
pragma Inline_Always (vec_vmsummbm);
pragma Inline_Always (vec_vmsumubm);
pragma Inline_Always (vec_msums);
pragma Inline_Always (vec_vmsumshs);
pragma Inline_Always (vec_vmsumuhs);
pragma Inline_Always (vec_mtvscr);
pragma Inline_Always (vec_mule);
pragma Inline_Always (vec_vmulesh);
pragma Inline_Always (vec_vmuleuh);
pragma Inline_Always (vec_vmulesb);
pragma Inline_Always (vec_vmuleub);
pragma Inline_Always (vec_mulo);
pragma Inline_Always (vec_vmulosh);
pragma Inline_Always (vec_vmulouh);
pragma Inline_Always (vec_vmulosb);
pragma Inline_Always (vec_vmuloub);
pragma Inline_Always (vec_nmsub);
pragma Inline_Always (vec_nor);
pragma Inline_Always (vec_or);
pragma Inline_Always (vec_pack);
pragma Inline_Always (vec_vpkuwum);
pragma Inline_Always (vec_vpkuhum);
pragma Inline_Always (vec_packpx);
pragma Inline_Always (vec_packs);
pragma Inline_Always (vec_vpkswss);
pragma Inline_Always (vec_vpkuwus);
pragma Inline_Always (vec_vpkshss);
pragma Inline_Always (vec_vpkuhus);
pragma Inline_Always (vec_packsu);
pragma Inline_Always (vec_vpkswus);
pragma Inline_Always (vec_vpkshus);
pragma Inline_Always (vec_perm);
pragma Inline_Always (vec_re);
pragma Inline_Always (vec_rl);
pragma Inline_Always (vec_vrlw);
pragma Inline_Always (vec_vrlh);
pragma Inline_Always (vec_vrlb);
pragma Inline_Always (vec_round);
pragma Inline_Always (vec_rsqrte);
pragma Inline_Always (vec_sel);
pragma Inline_Always (vec_sl);
pragma Inline_Always (vec_vslw);
pragma Inline_Always (vec_vslh);
pragma Inline_Always (vec_vslb);
pragma Inline_Always (vec_sll);
pragma Inline_Always (vec_slo);
pragma Inline_Always (vec_sr);
pragma Inline_Always (vec_vsrw);
pragma Inline_Always (vec_vsrh);
pragma Inline_Always (vec_vsrb);
pragma Inline_Always (vec_sra);
pragma Inline_Always (vec_vsraw);
pragma Inline_Always (vec_vsrah);
pragma Inline_Always (vec_vsrab);
pragma Inline_Always (vec_srl);
pragma Inline_Always (vec_sro);
pragma Inline_Always (vec_st);
pragma Inline_Always (vec_ste);
pragma Inline_Always (vec_stvewx);
pragma Inline_Always (vec_stvehx);
pragma Inline_Always (vec_stvebx);
pragma Inline_Always (vec_stl);
pragma Inline_Always (vec_sub);
pragma Inline_Always (vec_vsubfp);
pragma Inline_Always (vec_vsubuwm);
pragma Inline_Always (vec_vsubuhm);
pragma Inline_Always (vec_vsububm);
pragma Inline_Always (vec_subc);
pragma Inline_Always (vec_subs);
pragma Inline_Always (vec_vsubsws);
pragma Inline_Always (vec_vsubuws);
pragma Inline_Always (vec_vsubshs);
pragma Inline_Always (vec_vsubuhs);
pragma Inline_Always (vec_vsubsbs);
pragma Inline_Always (vec_vsububs);
pragma Inline_Always (vec_sum4s);
pragma Inline_Always (vec_vsum4shs);
pragma Inline_Always (vec_vsum4sbs);
pragma Inline_Always (vec_vsum4ubs);
pragma Inline_Always (vec_sum2s);
pragma Inline_Always (vec_sums);
pragma Inline_Always (vec_trunc);
pragma Inline_Always (vec_unpackh);
pragma Inline_Always (vec_vupkhsh);
pragma Inline_Always (vec_vupkhpx);
pragma Inline_Always (vec_vupkhsb);
pragma Inline_Always (vec_unpackl);
pragma Inline_Always (vec_vupklpx);
pragma Inline_Always (vec_vupklsh);
pragma Inline_Always (vec_vupklsb);
pragma Inline_Always (vec_xor);
pragma Inline_Always (vec_all_eq);
pragma Inline_Always (vec_all_ge);
pragma Inline_Always (vec_all_gt);
pragma Inline_Always (vec_all_in);
pragma Inline_Always (vec_all_le);
pragma Inline_Always (vec_all_lt);
pragma Inline_Always (vec_all_nan);
pragma Inline_Always (vec_all_ne);
pragma Inline_Always (vec_all_nge);
pragma Inline_Always (vec_all_ngt);
pragma Inline_Always (vec_all_nle);
pragma Inline_Always (vec_all_nlt);
pragma Inline_Always (vec_all_numeric);
pragma Inline_Always (vec_any_eq);
pragma Inline_Always (vec_any_ge);
pragma Inline_Always (vec_any_gt);
pragma Inline_Always (vec_any_le);
pragma Inline_Always (vec_any_lt);
pragma Inline_Always (vec_any_nan);
pragma Inline_Always (vec_any_ne);
pragma Inline_Always (vec_any_nge);
pragma Inline_Always (vec_any_ngt);
pragma Inline_Always (vec_any_nle);
pragma Inline_Always (vec_any_nlt);
pragma Inline_Always (vec_any_numeric);
pragma Inline_Always (vec_any_out);
-- Similarily, vec_step is expected to be turned into a compile time
-- constant, so ...
pragma Inline_Always (vec_step);
end GNAT.Altivec.Vector_Operations;
|
-- CE3806C.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT PUT FOR FLOAT_IO RAISES CONSTRAINT_ERROR WHEN THE
-- VALUES SUPPLIED BY FORE, AFT, OR EXP ARE NEGATIVE OR GREATER
-- THAN FIELD'LAST WHEN FIELD'LAST < FIELD'BASE'LAST. ALSO CHECK
-- THAT PUT FOR FLOAT_IO RAISES CONSTRAINT_ERROR WHEN THE VALUE OF
-- ITEM IS OUTSIDE THE RANGE OF THE TYPE USED TO INSTANTIATE
-- FLOAT_IO.
-- HISTORY:
-- SPS 09/10/82
-- JBG 08/30/83
-- JLH 09/14/87 ADDED CASES FOR COMPLETE OBJECTIVE.
-- KAS 11/24/95 DELETED DIGITS CONSTRAINT FROM SUBTYPE
-- CHANGED STATIC EXPRESSIONS INVOLVING 'LAST
WITH REPORT;
USE REPORT;
WITH TEXT_IO;
USE TEXT_IO;
PROCEDURE CE3806C IS
FIELD_LAST : TEXT_IO.FIELD := TEXT_IO.FIELD'LAST;
BEGIN
TEST ("CE3806C", "CHECK THAT PUT FOR FLOAT_IO RAISES " &
"CONSTRAINT_ERROR APPROPRIATELY");
DECLARE
TYPE FLOAT IS DIGITS 5 RANGE 0.0 .. 2.0;
SUBTYPE MY_FLOAT IS FLOAT RANGE 0.0 .. 1.0;
PACKAGE NFL_IO IS NEW FLOAT_IO (MY_FLOAT);
USE NFL_IO;
FT : FILE_TYPE;
Y : FLOAT := 1.8;
X : MY_FLOAT := 26.3 / 26.792;
BEGIN
BEGIN
PUT (FT, X, FORE => IDENT_INT(-6));
FAILED ("CONSTRAINT_ERROR NOT RAISED - NEGATIVE FORE " &
"FLOAT");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN STATUS_ERROR =>
FAILED ("STATUS_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 1");
WHEN USE_ERROR =>
FAILED ("USE_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 1");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - NEGATIVE FORE " &
"FLOAT");
END;
BEGIN
PUT (FT, X, AFT => IDENT_INT(-2));
FAILED ("CONSTRAINT_ERROR NOT RAISED - NEGATIVE AFT " &
"FLOAT");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN STATUS_ERROR =>
FAILED ("STATUS_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 2");
WHEN USE_ERROR =>
FAILED ("USE_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 2");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - NEGATIVE AFT " &
"FLOAT");
END;
BEGIN
PUT (FT, X, EXP => IDENT_INT(-1));
FAILED ("CONSTRAINT_ERROR NOT RAISED - NEGATIVE EXP " &
"FLOAT");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN STATUS_ERROR =>
FAILED ("STATUS_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 3");
WHEN USE_ERROR =>
FAILED ("USE_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 3");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - NEGATIVE EXP " &
"FLOAT");
END;
IF FIELD_LAST < FIELD'BASE'LAST THEN
BEGIN
PUT (FT, X, FORE => IDENT_INT(FIELD_LAST+1));
FAILED ("CONSTRAINT_ERROR NOT RAISED - FORE FLOAT");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN STATUS_ERROR =>
FAILED ("STATUS_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 4");
WHEN USE_ERROR =>
FAILED ("USE_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 4");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - FORE FLOAT");
END;
BEGIN
PUT (FT, X, AFT => IDENT_INT(FIELD_LAST+1));
FAILED ("CONSTRAINT_ERROR NOT RAISED - AFT FLOAT");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN STATUS_ERROR =>
FAILED ("STATUS_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 5");
WHEN USE_ERROR =>
FAILED ("USE_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 5");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - AFT FLOAT");
END;
BEGIN
PUT (FT, X, EXP => IDENT_INT(FIELD_LAST+1));
FAILED ("CONSTRAINT_ERROR NOT RAISED - EXP FLOAT");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN STATUS_ERROR =>
FAILED ("STATUS_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 6");
WHEN USE_ERROR =>
FAILED ("USE_ERROR RAISED INSTEAD OF " &
"CONSTRAINT_ERROR - 6");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - EXP FLOAT");
END;
END IF;
BEGIN
PUT (FT, Y);
FAILED ("CONSTRAINT_ERROR NOT RAISED FOR ITEM OUTSIDE " &
"RANGE - FILE");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED FOR ITEM OUTSIDE " &
"RANGE - FILE");
END;
BEGIN
PUT (Y);
FAILED ("CONSTRAINT_ERROR NOT RAISED FOR ITEM OUTSIDE " &
"RANGE - DEFAULT");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED FOR ITEM OUTSIDE " &
"RANGE - DEFAULT");
END;
END;
RESULT;
END CE3806C;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . A W K --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-2011, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is an AWK-like unit. It provides an easy interface for parsing one
-- or more files containing formatted data. The file can be viewed seen as
-- a database where each record is a line and a field is a data element in
-- this line. In this implementation an AWK record is a line. This means
-- that a record cannot span multiple lines. The operating procedure is to
-- read files line by line, with each line being presented to the user of
-- the package. The interface provides services to access specific fields
-- in the line. Thus it is possible to control actions taken on a line based
-- on values of some fields. This can be achieved directly or by registering
-- callbacks triggered on programmed conditions.
--
-- The state of an AWK run is recorded in an object of type session.
-- The following is the procedure for using a session to control an
-- AWK run:
--
-- 1) Specify which session is to be used. It is possible to use the
-- default session or to create a new one by declaring an object of
-- type Session_Type. For example:
--
-- Computers : Session_Type;
--
-- 2) Specify how to cut a line into fields. There are two modes: using
-- character fields separators or column width. This is done by using
-- Set_Fields_Separators or Set_Fields_Width. For example by:
--
-- AWK.Set_Field_Separators (";,", Computers);
--
-- or by using iterators' Separators parameter.
--
-- 3) Specify which files to parse. This is done with Add_File/Add_Files
-- services, or by using the iterators' Filename parameter. For
-- example:
--
-- AWK.Add_File ("myfile.db", Computers);
--
-- 4) Run the AWK session using one of the provided iterators.
--
-- Parse
-- This is the most automated iterator. You can gain control on
-- the session only by registering one or more callbacks (see
-- Register).
--
-- Get_Line/End_Of_Data
-- This is a manual iterator to be used with a loop. You have
-- complete control on the session. You can use callbacks but
-- this is not required.
--
-- For_Every_Line
-- This provides a mixture of manual/automated iterator action.
--
-- Examples of these three approaches appear below
--
-- There are many ways to use this package. The following discussion shows
-- three approaches to using this package, using the three iterator forms.
-- All examples will use the following file (computer.db):
--
-- Pluton;Windows-NT;Pentium III
-- Mars;Linux;Pentium Pro
-- Venus;Solaris;Sparc
-- Saturn;OS/2;i486
-- Jupiter;MacOS;PPC
--
-- 1) Using Parse iterator
--
-- Here the first step is to register some action associated to a pattern
-- and then to call the Parse iterator (this is the simplest way to use
-- this unit). The default session is used here. For example to output the
-- second field (the OS) of computer "Saturn".
--
-- procedure Action is
-- begin
-- Put_Line (AWK.Field (2));
-- end Action;
--
-- begin
-- AWK.Register (1, "Saturn", Action'Access);
-- AWK.Parse (";", "computer.db");
--
--
-- 2) Using the Get_Line/End_Of_Data iterator
--
-- Here you have full control. For example to do the same as
-- above but using a specific session, you could write:
--
-- Computer_File : Session_Type;
--
-- begin
-- AWK.Set_Current (Computer_File);
-- AWK.Open (Separators => ";",
-- Filename => "computer.db");
--
-- -- Display Saturn OS
--
-- while not AWK.End_Of_File loop
-- AWK.Get_Line;
--
-- if AWK.Field (1) = "Saturn" then
-- Put_Line (AWK.Field (2));
-- end if;
-- end loop;
--
-- AWK.Close (Computer_File);
--
--
-- 3) Using For_Every_Line iterator
--
-- In this case you use a provided iterator and you pass the procedure
-- that must be called for each record. You could code the previous
-- example could be coded as follows (using the iterator quick interface
-- but without using the current session):
--
-- Computer_File : Session_Type;
--
-- procedure Action (Quit : in out Boolean) is
-- begin
-- if AWK.Field (1, Computer_File) = "Saturn" then
-- Put_Line (AWK.Field (2, Computer_File));
-- end if;
-- end Action;
--
-- procedure Look_For_Saturn is
-- new AWK.For_Every_Line (Action);
--
-- begin
-- Look_For_Saturn (Separators => ";",
-- Filename => "computer.db",
-- Session => Computer_File);
--
-- Integer_Text_IO.Put
-- (Integer (AWK.NR (Session => Computer_File)));
-- Put_Line (" line(s) have been processed.");
--
-- You can also use a regular expression for the pattern. Let us output
-- the computer name for all computer for which the OS has a character
-- O in its name.
--
-- Regexp : String := ".*O.*";
--
-- Matcher : Regpat.Pattern_Matcher := Regpat.Compile (Regexp);
--
-- procedure Action is
-- begin
-- Text_IO.Put_Line (AWK.Field (2));
-- end Action;
--
-- begin
-- AWK.Register (2, Matcher, Action'Unrestricted_Access);
-- AWK.Parse (";", "computer.db");
--
with Ada.Finalization;
with GNAT.Regpat;
package GNAT.AWK is
Session_Error : exception;
-- Raised when a Session is reused but is not closed
File_Error : exception;
-- Raised when there is a file problem (see below)
End_Error : exception;
-- Raised when an attempt is made to read beyond the end of the last
-- file of a session.
Field_Error : exception;
-- Raised when accessing a field value which does not exist
Data_Error : exception;
-- Raised when it is impossible to convert a field value to a specific type
type Count is new Natural;
type Widths_Set is array (Positive range <>) of Positive;
-- Used to store a set of columns widths
Default_Separators : constant String := " " & ASCII.HT;
Use_Current : constant String := "";
-- Value used when no separator or filename is specified in iterators
type Session_Type is limited private;
-- This is the main exported type. A session is used to keep the state of
-- a full AWK run. The state comprises a list of files, the current file,
-- the number of line processed, the current line, the number of fields in
-- the current line... A default session is provided (see Set_Current,
-- Current_Session and Default_Session below).
----------------------------
-- Package initialization --
----------------------------
-- To be thread safe it is not possible to use the default provided
-- session. Each task must used a specific session and specify it
-- explicitly for every services.
procedure Set_Current (Session : Session_Type);
-- Set the session to be used by default. This file will be used when the
-- Session parameter in following services is not specified.
function Current_Session return not null access Session_Type;
-- Returns the session used by default by all services. This is the
-- latest session specified by Set_Current service or the session
-- provided by default with this implementation.
function Default_Session return not null access Session_Type;
-- Returns the default session provided by this package. Note that this is
-- the session return by Current_Session if Set_Current has not been used.
procedure Set_Field_Separators
(Separators : String := Default_Separators;
Session : Session_Type);
procedure Set_Field_Separators
(Separators : String := Default_Separators);
-- Set the field separators. Each character in the string is a field
-- separator. When a line is read it will be split by field using the
-- separators set here. Separators can be changed at any point and in this
-- case the current line is split according to the new separators. In the
-- special case that Separators is a space and a tabulation
-- (Default_Separators), fields are separated by runs of spaces and/or
-- tabs.
procedure Set_FS
(Separators : String := Default_Separators;
Session : Session_Type)
renames Set_Field_Separators;
procedure Set_FS
(Separators : String := Default_Separators)
renames Set_Field_Separators;
-- FS is the AWK abbreviation for above service
procedure Set_Field_Widths
(Field_Widths : Widths_Set;
Session : Session_Type);
procedure Set_Field_Widths
(Field_Widths : Widths_Set);
-- This is another way to split a line by giving the length (in number of
-- characters) of each field in a line. Field widths can be changed at any
-- point and in this case the current line is split according to the new
-- field lengths. A line split with this method must have a length equal or
-- greater to the total of the field widths. All characters remaining on
-- the line after the latest field are added to a new automatically
-- created field.
procedure Add_File
(Filename : String;
Session : Session_Type);
procedure Add_File
(Filename : String);
-- Add Filename to the list of file to be processed. There is no limit on
-- the number of files that can be added. Files are processed in the order
-- they have been added (i.e. the filename list is FIFO). If Filename does
-- not exist or if it is not readable, File_Error is raised.
procedure Add_Files
(Directory : String;
Filenames : String;
Number_Of_Files_Added : out Natural;
Session : Session_Type);
procedure Add_Files
(Directory : String;
Filenames : String;
Number_Of_Files_Added : out Natural);
-- Add all files matching the regular expression Filenames in the specified
-- directory to the list of file to be processed. There is no limit on
-- the number of files that can be added. Each file is processed in
-- the same order they have been added (i.e. the filename list is FIFO).
-- The number of files (possibly 0) added is returned in
-- Number_Of_Files_Added.
-------------------------------------
-- Information about current state --
-------------------------------------
function Number_Of_Fields
(Session : Session_Type) return Count;
function Number_Of_Fields
return Count;
pragma Inline (Number_Of_Fields);
-- Returns the number of fields in the current record. It returns 0 when
-- no file is being processed.
function NF
(Session : Session_Type) return Count
renames Number_Of_Fields;
function NF
return Count
renames Number_Of_Fields;
-- AWK abbreviation for above service
function Number_Of_File_Lines
(Session : Session_Type) return Count;
function Number_Of_File_Lines
return Count;
pragma Inline (Number_Of_File_Lines);
-- Returns the current line number in the processed file. It returns 0 when
-- no file is being processed.
function FNR (Session : Session_Type) return Count
renames Number_Of_File_Lines;
function FNR return Count
renames Number_Of_File_Lines;
-- AWK abbreviation for above service
function Number_Of_Lines
(Session : Session_Type) return Count;
function Number_Of_Lines
return Count;
pragma Inline (Number_Of_Lines);
-- Returns the number of line processed until now. This is equal to number
-- of line in each already processed file plus FNR. It returns 0 when
-- no file is being processed.
function NR (Session : Session_Type) return Count
renames Number_Of_Lines;
function NR return Count
renames Number_Of_Lines;
-- AWK abbreviation for above service
function Number_Of_Files
(Session : Session_Type) return Natural;
function Number_Of_Files
return Natural;
pragma Inline (Number_Of_Files);
-- Returns the number of files associated with Session. This is the total
-- number of files added with Add_File and Add_Files services.
function File (Session : Session_Type) return String;
function File return String;
-- Returns the name of the file being processed. It returns the empty
-- string when no file is being processed.
---------------------
-- Field accessors --
---------------------
function Field
(Rank : Count;
Session : Session_Type) return String;
function Field
(Rank : Count) return String;
-- Returns field number Rank value of the current record. If Rank = 0 it
-- returns the current record (i.e. the line as read in the file). It
-- raises Field_Error if Rank > NF or if Session is not open.
function Field
(Rank : Count;
Session : Session_Type) return Integer;
function Field
(Rank : Count) return Integer;
-- Returns field number Rank value of the current record as an integer. It
-- raises Field_Error if Rank > NF or if Session is not open. It
-- raises Data_Error if the field value cannot be converted to an integer.
function Field
(Rank : Count;
Session : Session_Type) return Float;
function Field
(Rank : Count) return Float;
-- Returns field number Rank value of the current record as a float. It
-- raises Field_Error if Rank > NF or if Session is not open. It
-- raises Data_Error if the field value cannot be converted to a float.
generic
type Discrete is (<>);
function Discrete_Field
(Rank : Count;
Session : Session_Type) return Discrete;
generic
type Discrete is (<>);
function Discrete_Field_Current_Session
(Rank : Count) return Discrete;
-- Returns field number Rank value of the current record as a type
-- Discrete. It raises Field_Error if Rank > NF. It raises Data_Error if
-- the field value cannot be converted to type Discrete.
--------------------
-- Pattern/Action --
--------------------
-- AWK defines rules like "PATTERN { ACTION }". Which means that ACTION
-- will be executed if PATTERN match. A pattern in this implementation can
-- be a simple string (match function is equality), a regular expression,
-- a function returning a boolean. An action is associated to a pattern
-- using the Register services.
--
-- Each procedure Register will add a rule to the set of rules for the
-- session. Rules are examined in the order they have been added.
type Pattern_Callback is access function return Boolean;
-- This is a pattern function pointer. When it returns True the associated
-- action will be called.
type Action_Callback is access procedure;
-- A simple action pointer
type Match_Action_Callback is
access procedure (Matches : GNAT.Regpat.Match_Array);
-- An advanced action pointer used with a regular expression pattern. It
-- returns an array of all the matches. See GNAT.Regpat for further
-- information.
procedure Register
(Field : Count;
Pattern : String;
Action : Action_Callback;
Session : Session_Type);
procedure Register
(Field : Count;
Pattern : String;
Action : Action_Callback);
-- Register an Action associated with a Pattern. The pattern here is a
-- simple string that must match exactly the field number specified.
procedure Register
(Field : Count;
Pattern : GNAT.Regpat.Pattern_Matcher;
Action : Action_Callback;
Session : Session_Type);
procedure Register
(Field : Count;
Pattern : GNAT.Regpat.Pattern_Matcher;
Action : Action_Callback);
-- Register an Action associated with a Pattern. The pattern here is a
-- simple regular expression which must match the field number specified.
procedure Register
(Field : Count;
Pattern : GNAT.Regpat.Pattern_Matcher;
Action : Match_Action_Callback;
Session : Session_Type);
procedure Register
(Field : Count;
Pattern : GNAT.Regpat.Pattern_Matcher;
Action : Match_Action_Callback);
-- Same as above but it pass the set of matches to the action
-- procedure. This is useful to analyse further why and where a regular
-- expression did match.
procedure Register
(Pattern : Pattern_Callback;
Action : Action_Callback;
Session : Session_Type);
procedure Register
(Pattern : Pattern_Callback;
Action : Action_Callback);
-- Register an Action associated with a Pattern. The pattern here is a
-- function that must return a boolean. Action callback will be called if
-- the pattern callback returns True and nothing will happen if it is
-- False. This version is more general, the two other register services
-- trigger an action based on the value of a single field only.
procedure Register
(Action : Action_Callback;
Session : Session_Type);
procedure Register
(Action : Action_Callback);
-- Register an Action that will be called for every line. This is
-- equivalent to a Pattern_Callback function always returning True.
--------------------
-- Parse iterator --
--------------------
procedure Parse
(Separators : String := Use_Current;
Filename : String := Use_Current;
Session : Session_Type);
procedure Parse
(Separators : String := Use_Current;
Filename : String := Use_Current);
-- Launch the iterator, it will read every line in all specified
-- session's files. Registered callbacks are then called if the associated
-- pattern match. It is possible to specify a filename and a set of
-- separators directly. This offer a quick way to parse a single
-- file. These parameters will override those specified by Set_FS and
-- Add_File. The Session will be opened and closed automatically.
-- File_Error is raised if there is no file associated with Session, or if
-- a file associated with Session is not longer readable. It raises
-- Session_Error is Session is already open.
-----------------------------------
-- Get_Line/End_Of_Data Iterator --
-----------------------------------
type Callback_Mode is (None, Only, Pass_Through);
-- These mode are used for Get_Line/End_Of_Data and For_Every_Line
-- iterators. The associated semantic is:
--
-- None
-- callbacks are not active. This is the default mode for
-- Get_Line/End_Of_Data and For_Every_Line iterators.
--
-- Only
-- callbacks are active, if at least one pattern match, the associated
-- action is called and this line will not be passed to the user. In
-- the Get_Line case the next line will be read (if there is some
-- line remaining), in the For_Every_Line case Action will
-- not be called for this line.
--
-- Pass_Through
-- callbacks are active, for patterns which match the associated
-- action is called. Then the line is passed to the user. It means
-- that Action procedure is called in the For_Every_Line case and
-- that Get_Line returns with the current line active.
--
procedure Open
(Separators : String := Use_Current;
Filename : String := Use_Current;
Session : Session_Type);
procedure Open
(Separators : String := Use_Current;
Filename : String := Use_Current);
-- Open the first file and initialize the unit. This must be called once
-- before using Get_Line. It is possible to specify a filename and a set of
-- separators directly. This offer a quick way to parse a single file.
-- These parameters will override those specified by Set_FS and Add_File.
-- File_Error is raised if there is no file associated with Session, or if
-- the first file associated with Session is no longer readable. It raises
-- Session_Error is Session is already open.
procedure Get_Line
(Callbacks : Callback_Mode := None;
Session : Session_Type);
procedure Get_Line
(Callbacks : Callback_Mode := None);
-- Read a line from the current input file. If the file index is at the
-- end of the current input file (i.e. End_Of_File is True) then the
-- following file is opened. If there is no more file to be processed,
-- exception End_Error will be raised. File_Error will be raised if Open
-- has not been called. Next call to Get_Line will return the following
-- line in the file. By default the registered callbacks are not called by
-- Get_Line, this can activated by setting Callbacks (see Callback_Mode
-- description above). File_Error may be raised if a file associated with
-- Session is not readable.
--
-- When Callbacks is not None, it is possible to exhaust all the lines
-- of all the files associated with Session. In this case, File_Error
-- is not raised.
--
-- This procedure can be used from a subprogram called by procedure Parse
-- or by an instantiation of For_Every_Line (see below).
function End_Of_Data
(Session : Session_Type) return Boolean;
function End_Of_Data
return Boolean;
pragma Inline (End_Of_Data);
-- Returns True if there is no more data to be processed in Session. It
-- means that the latest session's file is being processed and that
-- there is no more data to be read in this file (End_Of_File is True).
function End_Of_File
(Session : Session_Type) return Boolean;
function End_Of_File
return Boolean;
pragma Inline (End_Of_File);
-- Returns True when there is no more data to be processed on the current
-- session's file.
procedure Close (Session : Session_Type);
-- Release all associated data with Session. All memory allocated will
-- be freed, the current file will be closed if needed, the callbacks
-- will be unregistered. Close is convenient in reestablishing a session
-- for new use. Get_Line is no longer usable (will raise File_Error)
-- except after a successful call to Open, Parse or an instantiation
-- of For_Every_Line.
-----------------------------
-- For_Every_Line iterator --
-----------------------------
generic
with procedure Action (Quit : in out Boolean);
procedure For_Every_Line
(Separators : String := Use_Current;
Filename : String := Use_Current;
Callbacks : Callback_Mode := None;
Session : Session_Type);
generic
with procedure Action (Quit : in out Boolean);
procedure For_Every_Line_Current_Session
(Separators : String := Use_Current;
Filename : String := Use_Current;
Callbacks : Callback_Mode := None);
-- This is another iterator. Action will be called for each new
-- record. The iterator's termination can be controlled by setting Quit
-- to True. It is by default set to False. It is possible to specify a
-- filename and a set of separators directly. This offer a quick way to
-- parse a single file. These parameters will override those specified by
-- Set_FS and Add_File. By default the registered callbacks are not called
-- by For_Every_Line, this can activated by setting Callbacks (see
-- Callback_Mode description above). The Session will be opened and
-- closed automatically. File_Error is raised if there is no file
-- associated with Session. It raises Session_Error is Session is already
-- open.
private
type Session_Data;
type Session_Data_Access is access Session_Data;
type Session_Type is new Ada.Finalization.Limited_Controlled with record
Data : Session_Data_Access;
Self : not null access Session_Type := Session_Type'Unchecked_Access;
end record;
procedure Initialize (Session : in out Session_Type);
procedure Finalize (Session : in out Session_Type);
end GNAT.AWK;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- L I B . X R E F --
-- --
-- S p e c --
-- --
-- Copyright (C) 1998-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. --
-- --
------------------------------------------------------------------------------
-- This package contains for collecting and outputting cross-reference
-- information.
with Einfo; use Einfo;
with SPARK_Xrefs;
package Lib.Xref is
-------------------------------------------------------
-- Format of Cross-Reference Information in ALI File --
-------------------------------------------------------
-- Cross-reference sections follow the dependency section (D lines) in
-- an ALI file, so that they need not be read by gnatbind, gnatmake etc.
-- A cross reference section has a header of the form
-- X dependency-number filename
-- This header precedes xref information (entities/references from
-- the unit), identified by dependency number and file name. The
-- dependency number is the index into the generated D lines and
-- is ones origin (e.g. 2 = reference to second generated D line).
-- Note that the filename here will reflect the original name if
-- a Source_Reference pragma was encountered (since all line number
-- references will be with respect to the original file).
-- The lines following the header look like
-- line type col level entity renameref instref typeref overref ref ref
-- line is the line number of the referenced entity. The name of
-- the entity starts in column col. Columns are numbered from one,
-- and if horizontal tab characters are present, the column number
-- is computed assuming standard 1,9,17,.. tab stops. For example,
-- if the entity is the first token on the line, and is preceded
-- by space-HT-space, then the column would be column 10.
-- type is a single letter identifying the type of the entity. See
-- next section (Cross-Reference Entity Identifiers) for a full list
-- of the characters used).
-- col is the column number of the referenced entity
-- level is a single character that separates the col and entity
-- fields. It is an asterisk (*) for a top level library entity that
-- is publicly visible, as well for an entity declared in the visible
-- part of a generic package, the plus sign (+) for a C/C++ static
-- entity, and space otherwise.
-- entity is the name of the referenced entity, with casing in
-- the canonical casing for the source file where it is defined.
-- renameref provides information on renaming. If the entity is
-- a package, object or overloadable entity which is declared by
-- a renaming declaration, and the renaming refers to an entity
-- with a simple identifier or expanded name, then renameref has
-- the form:
-- =line:col
-- Here line:col give the reference to the identifier that appears
-- in the renaming declaration. Note that we never need a file entry,
-- since this identifier is always in the current file in which the
-- entity is declared. Currently, renameref appears only for the
-- simple renaming case. If the renaming reference is a complex
-- expressions, then renameref is omitted. Here line/col give
-- line/column as defined above.
-- instref is only present for package and subprogram instances. The
-- information in instref is the location of the point of declaration
-- of the generic parent unit. This part has the form:
-- [file|line]
-- without column information, on the reasonable assumption that
-- there is only one unit per line (the same assumption is made in
-- references to entities declared within instances, see below).
-- typeref is the reference for a related type. This part is
-- optional. It is present for the following cases:
-- derived types (points to the parent type) LR=<>
-- access types (points to designated type) LR=()
-- array types (points to component type) LR=()
-- subtypes (points to ancestor type) LR={}
-- functions (points to result type) LR={}
-- enumeration literals (points to enum type) LR={}
-- objects and components (points to type) LR={}
-- For a type that implements multiple interfaces, there is an
-- entry of the form LR=<> for each of the interfaces appearing
-- in the type declaration. In the data structures of ali.ads,
-- the type that the entity extends (or the first interface if
-- there is no such type) is stored in Xref_Entity_Record.Tref*,
-- additional interfaces are stored in the list of references
-- with a special type of Interface_Reference.
-- For an array type, there is an entry of the form LR=<> for each
-- of the index types appearing in the type declaration. The index
-- types follow the entry for the component type. In the data
-- structures of ali.ads, however, the list of index types are
-- output in the list of references with a special Rtype set to
-- Array_Index_Reference.
-- In the above list LR shows the brackets used in the output which
-- has one of the two following forms:
-- L file | line type col R user entity
-- L name-in-lower-case R standard entity
-- For the form for a user entity, file is the dependency number
-- of the file containing the declaration of the related type.
-- This number and the following vertical bar are omitted if the
-- relevant type is defined in the same file as the current entity.
-- The line, type, col are defined as previously described, and
-- specify the location of the relevant type declaration in the
-- referenced file. For the standard entity form, the name between
-- the brackets is the normal name of the entity in lower case.
-- overref is present for overriding operations (procedures and
-- functions), and provides information on the operation that it
-- overrides. This information has the format:
-- '<' file | line 'o' col '>'
-- file is the dependency number of the file containing the
-- declaration of the overridden operation. It and the following
-- vertical bar are omitted if the file is the same as that of
-- the overriding operation.
-- There may be zero or more ref entries on each line
-- file | line type col [...]
-- file is the dependency number of the file with the reference.
-- It and the following vertical bar are omitted if the file is
-- the same as the previous ref, and the refs for the current
-- file are first (and do not need a bar).
-- line is the line number of the reference
-- col is the column number of the reference, as defined above
-- type is one of
-- b = body entity
-- c = completion of private or incomplete type
-- d = discriminant of type
-- D = object definition
-- e = end of spec
-- E = first private entity
-- H = abstract type
-- i = implicit reference
-- k = implicit reference to parent unit in child unit
-- l = label on END line
-- m = modification
-- o = own variable reference (SPARK only)
-- p = primitive operation
-- P = overriding primitive operation
-- r = reference
-- R = subprogram reference in dispatching call
-- s = subprogram reference in a static call
-- t = end of body
-- w = WITH line
-- x = type extension
-- z = generic formal parameter
-- > = subprogram IN parameter
-- = = subprogram IN OUT parameter
-- < = subprogram OUT parameter
-- ^ = subprogram ACCESS parameter
-- b is used for spec entities that are repeated in a body,
-- including the unit (subprogram, package, task, protected body,
-- protected entry) name itself, and in the case of a subprogram,
-- the formals. This letter is also used for the occurrence of
-- entry names in accept statements. Such entities are not
-- considered to be definitions for cross-referencing purposes,
-- but rather are considered to be references to the corresponding
-- spec entities, marked with this special type.
-- c is similar to b but is used to mark the completion of a
-- private or incomplete type. As with b, the completion is not
-- regarded as a separate definition, but rather a reference to
-- the initial declaration, marked with this special type.
-- d is used to identify a discriminant of a type. If this is
-- an incomplete or private type with discriminants, the entry
-- denotes the occurrence of the discriminant in the partial view
-- which is also the point of definition of the discriminant. The
-- occurrence of the same discriminant in the full view is a
-- regular reference to it.
-- e is used to identify the end of a construct in the following
-- cases:
-- Block Statement end [block_IDENTIFIER];
-- Loop Statement end loop [loop_IDENTIFIER];
-- Package Specification end [[PARENT_UNIT_NAME .] IDENTIFIER];
-- Task Definition end [task_IDENTIFIER];
-- Protected Definition end [protected_IDENTIFIER];
-- Record Definition end record;
-- Enumeration Definition );
-- Note that 'e' entries are special in that they appear even
-- in referencing units (normally xref entries appear only for
-- references in the extended main source unit (see Lib) to which
-- the ali applies. But 'e' entries are really structural and
-- simply indicate where packages end. This information can be
-- used to reconstruct scope information for any entities
-- referenced from within the package. The line/column values
-- for these entries point to the semicolon ending the construct.
-- i is used to identify a reference to the entity in a generic
-- actual or in a default in a call. The node that denotes the
-- entity does not come from source, but it has the Sloc of the
-- source node that generates the implicit reference, and it is
-- useful to record this one.
-- k is another non-standard reference type, used to record a
-- reference from a child unit to its parent. For various cross-
-- referencing tools, we need a pointer from the xref entries for
-- the child to the parent. This is the opposite way round from
-- normal xref entries, since the reference is *from* the child
-- unit *to* the parent unit, yet appears in the xref entries for
-- the child. Consider this example:
--
-- package q is
-- end;
-- package q.r is
-- end q.r;
--
-- The ali file for q-r.ads has these entries
--
-- D q.ads
-- D q-r.ads
-- D system.ads
-- X 1 q.ads
-- 1K9*q 2e4 2|1r9 2r5
-- X 2 q-r.ads
-- 1K11*r 1|1k9 2|2l7 2e8
--
-- Here the 2|1r9 entry appearing in the section for the parent
-- is the normal reference from the child to the parent. The 1k9
-- entry in the section for the child duplicates this information
-- but appears in the child rather than the parent.
-- l is used to identify the occurrence in the source of the name
-- on an end line. This is just a syntactic reference which can be
-- ignored for semantic purposes (e.g. a call graph construction).
-- Again, in the case of an accept there can be multiple l lines.
-- o is used for variables referenced from a SPARK 'own'
-- definition. In the SPARK language, it is allowed to use a
-- variable before its actual declaration.
-- p is used to mark a primitive operation of the given entity.
-- For example, if we have a type Tx, and a primitive operation
-- Pq of this type, then an entry in the list of references to
-- Tx will point to the declaration of Pq. Note that this entry
-- type is unusual because it an implicit rather than explicit,
-- and the name of the reference does not match the name of the
-- entity for which a reference is generated. These entries are
-- generated only for entities declared in the extended main
-- source unit (main unit itself, its separate spec (if any).
-- and all subunits (considered recursively).
-- If the primitive operation overrides an inherited primitive
-- operation of the parent type, the letter 'P' is used in the
-- corresponding entry.
-- R is used to mark a dispatching call. The reference is to
-- the specification of the primitive operation of the root
-- type when the call has a controlling argument in its class.
-- s is used to mark a static subprogram call. The reference is
-- to the specification of the subprogram being called.
-- t is similar to e. It identifies the end of a corresponding
-- body (such a reference always links up with a b reference)
-- Subprogram Body end [DESIGNATOR];
-- Package Body end [[PARENT_UNIT_NAME .] IDENTIFIER];
-- Task Body end [task_IDENTIFIER];
-- Entry Body end [entry_IDENTIFIER];
-- Protected Body end [protected_IDENTIFIER]
-- Accept Statement end [entry_IDENTIFIER]];
-- Note that in the case of accept statements, there can
-- be multiple b and t entries for the same entity.
-- x is used to identify the reference as the entity from which a
-- tagged type is extended. This allows immediate access to the
-- parent of a tagged type.
-- z is used on the cross-reference line for a generic unit,
-- to mark the definition of a generic formal of the unit. This
-- entry type is similar to 'k' and 'p' in that it is an implicit
-- reference for an entity with a different name.
-- The characters >, <. =, and ^ are used on the cross-reference
-- line for a subprogram, to denote formal parameters and their
-- modes. As with the 'z' and 'p' entries, each such entry is
-- an implicit reference to an entity with a different name.
-- [..] is used for generic instantiation references. These
-- references are present only if the entity in question is
-- a generic entity, and in that case the [..] contains the
-- reference for the instantiation. In the case of nested
-- instantiations, this can be nested [...[...[...]]] etc. The
-- reference is of the form [file|line] no column is present since
-- it is assumed that only one instantiation appears on a single
-- source line. Note that the appearance of file numbers in such
-- references follows the normal rules (present only if needed,
-- and resets the current file for subsequent references).
-- Examples:
-- 44B5*Flag_Type{boolean} 5r23 6m45 3|9r35 11r56
-- This line gives references for the publicly visible Boolean
-- type Flag_Type declared on line 44, column 5. There are four
-- references
-- a reference on line 5, column 23 of the current file
-- a modification on line 6, column 45 of the current file
-- a reference on line 9, column 35 of unit number 3
-- a reference on line 11, column 56 of unit number 3
-- 2U13 p3=2:35 5b13 8r4 12r13 12t15
-- This line gives references for the non-publicly visible
-- procedure p3 declared on line 2, column 13. This procedure
-- renames the procedure whose identifier reference is at
-- line 2 column 35. There are four references:
-- the corresponding body entity at line 5, column 13,
-- of the current file.
-- a reference (e.g. a call) at line 8 column 4 of the
-- current file.
-- the END line of the body has an explicit reference to
-- the name of the procedure at line 12, column 13.
-- the body ends at line 12, column 15, just past this label
-- 16I9*My_Type<2|4I9> 18r8
-- This line gives references for the publicly visible Integer
-- derived type My_Type declared on line 16, column 9. It also
-- gives references to the parent type declared in the unit
-- number 2 on line 4, column 9. There is one reference:
-- a reference (e.g. a variable declaration) at line 18 column
-- 4 of the current file.
-- 10I3*Genv{integer} 3|4I10[6|12]
-- This line gives a reference for the entity Genv in a generic
-- package. The reference in file 3, line 4, col 10, refers to an
-- instance of the generic where the instantiation can be found in
-- file 6 at line 12.
-- Continuation lines are used if the reference list gets too long,
-- a continuation line starts with a period, and then has references
-- continuing from the previous line. The references are sorted first
-- by unit, then by position in the source.
-- Note on handling of generic entities. The cross-reference is oriented
-- towards source references, so the entities in a generic instantiation
-- are not considered distinct from the entities in the template. All
-- definitions and references from generic instantiations are suppressed,
-- since they will be generated from the template. Any references to
-- entities in a generic instantiation from outside the instantiation
-- are considered to be references to the original template entity.
----------------------------------------
-- Cross-Reference Entity Identifiers --
----------------------------------------
-- In the cross-reference section of the ali file, entity types are
-- identified by a single letter, indicating the entity type. The following
-- table indicates the letter. A space for an entry is used for entities
-- that do not appear in the cross-reference table.
-- For objects, the character * appears in this table. In the xref listing,
-- this character is replaced by the lower case letter that corresponds to
-- the type of the object. For example, if a variable is of a Float type,
-- then, since the type is represented by an upper case F, the object would
-- be represented by a lower case f.
-- A special exception is the case of booleans, whose entities are normal
-- E_Enumeration_Type or E_Enumeration_Subtype entities, but which appear
-- as B/b in the xref lines, rather than E/e.
-- For private types, the character + appears in the table. In this case
-- the kind of the underlying type is used, if available, to determine the
-- character to use in the xref listing. The listing will still include a
-- '+' for a generic private type, for example, but will retain the '*' for
-- an object or formal parameter of such a type.
-- For subprograms, the characters 'U' and 'V' appear in the table,
-- indicating procedures and functions. If the operation is abstract,
-- these letters are replaced in the xref by 'x' and 'y' respectively.
Xref_Entity_Letters : constant array (Entity_Kind) of Character :=
(E_Abstract_State => '@',
E_Access_Attribute_Type => 'P',
E_Access_Protected_Subprogram_Type => 'P',
E_Access_Subprogram_Type => 'P',
E_Access_Subtype => 'P',
E_Access_Type => 'P',
E_Allocator_Type => ' ',
E_Anonymous_Access_Protected_Subprogram_Type => ' ',
E_Anonymous_Access_Subprogram_Type => ' ',
E_Anonymous_Access_Type => ' ',
E_Array_Subtype => 'A',
E_Array_Type => 'A',
E_Block => 'q',
E_Class_Wide_Subtype => 'C',
E_Class_Wide_Type => 'C',
E_Component => '*',
E_Constant => '*',
E_Decimal_Fixed_Point_Subtype => 'D',
E_Decimal_Fixed_Point_Type => 'D',
E_Discriminant => '*',
E_Entry => 'Y',
E_Entry_Family => 'Y',
E_Entry_Index_Parameter => '*',
E_Enumeration_Literal => 'n',
E_Enumeration_Subtype => 'E', -- B for boolean
E_Enumeration_Type => 'E', -- B for boolean
E_Exception => 'X',
E_Exception_Type => ' ',
E_Floating_Point_Subtype => 'F',
E_Floating_Point_Type => 'F',
E_Function => 'V',
E_General_Access_Type => 'P',
E_Generic_Function => 'v',
E_Generic_In_Out_Parameter => '*',
E_Generic_In_Parameter => '*',
E_Generic_Package => 'k',
E_Generic_Procedure => 'u',
E_Label => 'L',
E_Limited_Private_Subtype => '+',
E_Limited_Private_Type => '+',
E_Loop => 'l',
E_Loop_Parameter => '*',
E_In_Out_Parameter => '*',
E_In_Parameter => '*',
E_Incomplete_Subtype => '+',
E_Incomplete_Type => '+',
E_Modular_Integer_Subtype => 'M',
E_Modular_Integer_Type => 'M',
E_Named_Integer => 'N',
E_Named_Real => 'N',
E_Operator => 'V',
E_Ordinary_Fixed_Point_Subtype => 'O',
E_Ordinary_Fixed_Point_Type => 'O',
E_Out_Parameter => '*',
E_Package => 'K',
E_Private_Subtype => '+',
E_Private_Type => '+',
E_Procedure => 'U',
E_Protected_Subtype => 'W',
E_Protected_Type => 'W',
E_Record_Subtype => 'R',
E_Record_Subtype_With_Private => 'R',
E_Record_Type => 'R',
E_Record_Type_With_Private => 'R',
E_Return_Statement => ' ',
E_Signed_Integer_Subtype => 'I',
E_Signed_Integer_Type => 'I',
E_String_Literal_Subtype => ' ',
E_Subprogram_Type => ' ',
E_Task_Subtype => 'T',
E_Task_Type => 'T',
E_Variable => '*',
E_Void => ' ',
-- The following entities are not ones to which we gather the cross-
-- references, since it does not make sense to do so (e.g. references
-- to a package are to the spec, not the body). Indeed the occurrence of
-- the body entity is considered to be a reference to the spec entity.
E_Package_Body => ' ',
E_Protected_Body => ' ',
E_Subprogram_Body => ' ',
E_Task_Body => ' ');
-- The following table is for information purposes. It shows the use of
-- each character appearing as an entity type.
-- letter lower case usage UPPER CASE USAGE
-- a array object (except string) array type (except string)
-- b Boolean object Boolean type
-- c class-wide object class-wide type
-- d decimal fixed-point object decimal fixed-point type
-- e non-Boolean enumeration object non_Boolean enumeration type
-- f floating-point object floating-point type
-- g C/C++ macro C/C++ fun-like macro
-- h Interface (Ada 2005) Abstract type
-- i signed integer object signed integer type
-- j C++ class object C++ class
-- k generic package package
-- l label on loop label on statement
-- m modular integer object modular integer type
-- n enumeration literal named number
-- o ordinary fixed-point object ordinary fixed-point type
-- p access object access type
-- q label on block C/C++ include file
-- r record object record type
-- s string object string type
-- t task object task type
-- u generic procedure procedure
-- v generic function or operator function or operator
-- w protected object protected type
-- x abstract procedure exception
-- y abstract function entry or entry family
-- z generic formal parameter (unused)
---------------------------------------------------
-- Handling of Imported and Exported Subprograms --
---------------------------------------------------
-- If a pragma Import or Interface applies to a subprogram, the pragma is
-- the completion of the subprogram. This is noted in the ALI file by
-- making the occurrence of the subprogram in the pragma into a body
-- reference ('b') and by including the external name of the subprogram and
-- its language, bracketed by '<' and '>' in that reference. For example:
-- 3U13*imported_proc 4b<c,there>21
-- indicates that procedure imported_proc, declared at line 3, has a pragma
-- Import at line 4, that its body is in C, and that the link name as given
-- in the pragma is "there".
-- If a pragma Export applies to a subprogram exported to a foreign
-- language (ie. the pragma has convention different from Ada), then the
-- pragma is annotated in the ALI file by making the occurrence of the
-- subprogram in the pragma into an implicit reference ('i') and by
-- including the external name of the subprogram and its language,
-- bracketed by '<' and '>' in that reference. For example:
-- 3U13*exported_proc 4i<c,here>21
-- indicates that procedure exported_proc, declared at line 3, has a pragma
-- Export at line 4, that its body is exported to C, and that the link name
-- as given in the pragma is "here".
-------------------------
-- Deferred_References --
-------------------------
-- Normally we generate references as we go along, but as discussed in
-- Sem_Util.Is_LHS, and Sem_Ch8.Find_Direct_Name/Find_Selected_Component,
-- we have one case where that is tricky, which is when we have something
-- like X.A := 3, where we don't know until we know the type of X whether
-- this is a reference (if X is an access type, so what we really have is
-- X.all.A := 3) or a modification, where X is not an access type.
-- What we do in such cases is to gather nodes, where we would have liked
-- to call Generate_Reference but we couldn't because we didn't know enough
-- into a table, then we deal with generating references later on when we
-- have sufficient information to do it right.
type Deferred_Reference_Entry is record
E : Entity_Id;
N : Node_Id;
end record;
-- One entry, E, N are as required for Generate_Reference call
procedure Defer_Reference (Deferred_Reference : Deferred_Reference_Entry);
-- Add one entry to the deferred reference table
procedure Process_Deferred_References;
-- This procedure is called from Frontend to process these table entries.
-- It is also called from Sem_Warn.
function Has_Deferred_Reference (Ent : Entity_Id) return Boolean;
-- Determine whether arbitrary entity Ent has a pending reference in order
-- to suppress premature warnings about useless assignments. See comments
-- in Analyze_Assignment in sem_ch5.adb.
-----------------------------
-- SPARK Xrefs Information --
-----------------------------
-- This package defines procedures for collecting SPARK cross-reference
-- information and printing in ALI files.
package SPARK_Specific is
function Enclosing_Subprogram_Or_Library_Package
(N : Node_Id) return Entity_Id;
-- Return the closest enclosing subprogram or library-level package.
-- This ensures that GNATprove can distinguish local variables from
-- global variables.
--
-- ??? This routine should only be used for processing related to
-- cross-references, where it might return wrong result but must avoid
-- crashes on ill-formed source code. It is wrong to use it where exact
-- result is needed.
procedure Generate_Dereference
(N : Node_Id;
Typ : Character := 'r');
-- This procedure is called to record a dereference. N is the location
-- of the dereference.
generic
with procedure Process
(Index : Int;
Xref : SPARK_Xrefs.SPARK_Xref_Record);
procedure Iterate_SPARK_Xrefs;
-- Call Process on cross-references relevant to the SPARK backend with
-- parameter Xref holding the relevant subset of the xref entry and
-- Index holding the position in the original tables with references
-- (if positive) or dereferences (if negative).
end SPARK_Specific;
-----------------
-- Subprograms --
-----------------
procedure Generate_Definition (E : Entity_Id);
-- Records the definition of an entity
procedure Generate_Operator_Reference
(N : Node_Id;
T : Entity_Id);
-- Node N is an operator node, whose entity has been set. If this entity
-- is a user defined operator (i.e. an operator not defined in package
-- Standard), then a reference to the operator is recorded at node N.
-- T is the operand type of the operator. A reference to the operator is an
-- implicit reference to the type, and that needs to be recorded to avoid
-- spurious warnings on unused entities, when the operator is a renaming of
-- a predefined operator.
procedure Generate_Reference
(E : Entity_Id;
N : Node_Id;
Typ : Character := 'r';
Set_Ref : Boolean := True;
Force : Boolean := False);
-- This procedure is called to record a reference. N is the location of the
-- reference and E is the referenced entity. Typ is one of:
--
-- a character already described in the description of ref entries above
-- ' ' for dummy reference (see below)
--
-- Note: all references to incomplete or private types are to the original
-- (incomplete or private type) declaration. The full declaration is
-- treated as a reference with type 'c'.
--
-- Note: all references to packages or subprograms are to the entity for
-- the spec. The entity in the body is treated as a reference with type
-- 'b'. Similar handling for references to subprogram formals.
--
-- The call has no effect if N is not in the extended main source unit.
-- This check is omitted for type 'e' references (where it is useful to
-- have structural scoping information for other than the main source),
-- and for 'p' (since we want to pick up inherited primitive operations
-- that are defined in other packages).
--
-- The call also has no effect if any of the following conditions hold:
--
-- cross-reference collection is disabled
-- entity does not come from source (and Force is False)
-- reference does not come from source (and Force is False)
-- the entity is not one for which xrefs are appropriate
-- the type letter is blank
-- the node N is not an identifier, defining identifier, or expanded name
-- the type is 'p' and the entity is not in the extended main source
--
-- If all these conditions are met, then the Is_Referenced flag of E is set
-- (unless Set_Ref is False) and a cross-reference entry is recorded for
-- later output when Output_References is called.
--
-- Note: the dummy space entry is for the convenience of some callers,
-- who find it easier to pass a space to suppress the entry than to do
-- a specific test. The call has no effect if the type is a space.
--
-- The parameter Set_Ref is normally True, and indicates that in addition
-- to generating a cross-reference, the Referenced flag of the specified
-- entity should be set. If this parameter is False, then setting of the
-- Referenced flag is inhibited.
--
-- The parameter Force is set to True to force a reference to be generated
-- even if Comes_From_Source is false. This is used for certain implicit
-- references, and also for end label references.
procedure Generate_Reference_To_Formals (E : Entity_Id);
-- Add a reference to the definition of each formal on the line for
-- a subprogram or an access_to_subprogram type.
procedure Generate_Reference_To_Generic_Formals (E : Entity_Id);
-- Add a reference to the definition of each generic formal on the line
-- for a generic unit.
procedure Output_References;
-- Output references to the current ali file
procedure Initialize;
-- Initialize internal tables
end Lib.Xref;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . A D D R E S S _ I M A G E --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
function System.Address_Image (A : Address) return String is
Result : String (1 .. 2 * Address'Size / Storage_Unit);
type Byte is mod 2 ** 8;
for Byte'Size use 8;
Hexdigs :
constant array (Byte range 0 .. 15) of Character := "0123456789ABCDEF";
type Bytes is array (1 .. Address'Size / Storage_Unit) of Byte;
for Bytes'Size use Address'Size;
function To_Bytes is new Ada.Unchecked_Conversion (Address, Bytes);
Byte_Sequence : constant Bytes := To_Bytes (A);
LE : constant := Standard'Default_Bit_Order;
BE : constant := 1 - LE;
-- Set to 1/0 for True/False for Little-Endian/Big-Endian
Start : constant Natural := BE * (1) + LE * (Bytes'Length);
Incr : constant Integer := BE * (1) + LE * (-1);
-- Start and increment for accessing characters of address string
Ptr : Natural;
-- Scan address string
begin
Ptr := Start;
for N in Bytes'Range loop
Result (2 * N - 1) := Hexdigs (Byte_Sequence (Ptr) / 16);
Result (2 * N) := Hexdigs (Byte_Sequence (Ptr) mod 16);
Ptr := Ptr + Incr;
end loop;
return Result;
end System.Address_Image;
|
package GESTE_Fonts.FreeSerifItalic6pt7b is
Font : constant Bitmap_Font_Ref;
private
FreeSerifItalic6pt7bBitmaps : aliased constant Font_Bitmap := (
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#08#,
16#01#, 16#00#, 16#20#, 16#08#, 16#01#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#50#, 16#0A#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#00#, 16#28#, 16#09#, 16#03#, 16#E0#, 16#48#, 16#1F#, 16#81#,
16#40#, 16#48#, 16#0A#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#80#, 16#58#, 16#15#, 16#01#, 16#80#, 16#30#,
16#05#, 16#00#, 16#A0#, 16#54#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#62#, 16#1B#, 16#82#,
16#60#, 16#55#, 16#8F#, 16#50#, 16#2A#, 16#09#, 16#41#, 16#30#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#,
16#02#, 16#80#, 16#60#, 16#1B#, 16#8D#, 16#21#, 16#18#, 16#23#, 16#03#,
16#B0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#40#, 16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#02#, 16#00#, 16#40#, 16#08#,
16#01#, 16#00#, 16#20#, 16#04#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#40#, 16#08#, 16#01#, 16#00#,
16#20#, 16#04#, 16#00#, 16#80#, 16#10#, 16#02#, 16#00#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#0D#,
16#00#, 16#C0#, 16#3C#, 16#02#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#80#, 16#10#, 16#0F#, 16#C0#, 16#40#, 16#08#,
16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#,
16#02#, 16#00#, 16#80#, 16#20#, 16#04#, 16#01#, 16#00#, 16#20#, 16#08#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#80#, 16#48#, 16#11#, 16#02#, 16#20#, 16#44#, 16#11#, 16#82#, 16#20#,
16#2C#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#30#, 16#02#, 16#00#, 16#80#, 16#10#, 16#02#,
16#00#, 16#80#, 16#10#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#12#, 16#00#, 16#40#,
16#08#, 16#02#, 16#00#, 16#80#, 16#20#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#58#, 16#03#,
16#00#, 16#80#, 16#38#, 16#01#, 16#00#, 16#20#, 16#08#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#08#, 16#02#, 16#01#, 16#C0#, 16#48#, 16#12#, 16#03#, 16#E0#, 16#08#,
16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#38#, 16#08#, 16#01#, 16#80#, 16#08#, 16#01#, 16#00#,
16#20#, 16#08#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#C0#, 16#30#, 16#08#, 16#02#, 16#C0#, 16#68#,
16#11#, 16#82#, 16#20#, 16#44#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#11#, 16#00#,
16#40#, 16#10#, 16#02#, 16#00#, 16#80#, 16#10#, 16#04#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#48#,
16#09#, 16#01#, 16#40#, 16#30#, 16#19#, 16#02#, 16#20#, 16#24#, 16#07#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#80#, 16#C8#, 16#11#, 16#02#, 16#20#, 16#4C#, 16#0F#, 16#00#, 16#60#,
16#18#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#,
16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#30#, 16#18#, 16#0C#, 16#01#, 16#80#, 16#0C#, 16#00#, 16#60#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#18#, 16#00#, 16#C0#,
16#30#, 16#18#, 16#04#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#01#, 16#00#, 16#20#, 16#08#,
16#02#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#0B#, 16#62#,
16#54#, 16#52#, 16#8A#, 16#51#, 16#4A#, 16#17#, 16#81#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#,
16#03#, 16#00#, 16#A0#, 16#24#, 16#07#, 16#81#, 16#10#, 16#22#, 16#0C#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7C#, 16#04#, 16#81#, 16#10#, 16#3C#, 16#04#, 16#81#, 16#98#,
16#22#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3C#, 16#0C#, 16#43#, 16#08#, 16#40#, 16#08#,
16#01#, 16#00#, 16#22#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#04#, 16#C1#, 16#08#,
16#21#, 16#04#, 16#21#, 16#8C#, 16#23#, 16#0F#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#04#,
16#01#, 16#20#, 16#3C#, 16#04#, 16#01#, 16#80#, 16#21#, 16#0F#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7E#, 16#04#, 16#01#, 16#20#, 16#38#, 16#04#, 16#01#, 16#80#, 16#20#,
16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#0C#, 16#43#, 16#00#, 16#40#, 16#08#, 16#F1#,
16#08#, 16#21#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#77#, 16#04#, 16#41#, 16#08#, 16#3F#,
16#04#, 16#41#, 16#88#, 16#21#, 16#0E#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#04#, 16#01#,
16#00#, 16#20#, 16#04#, 16#01#, 16#80#, 16#20#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#,
16#02#, 16#00#, 16#C0#, 16#10#, 16#02#, 16#00#, 16#40#, 16#10#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#77#, 16#04#, 16#81#, 16#20#, 16#38#, 16#05#, 16#01#, 16#A0#,
16#22#, 16#0E#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#70#, 16#04#, 16#01#, 16#00#, 16#20#, 16#04#,
16#01#, 16#80#, 16#21#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#61#, 16#C4#, 16#31#, 16#8C#,
16#52#, 16#8A#, 16#91#, 16#36#, 16#24#, 16#8D#, 16#38#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#63#, 16#04#,
16#41#, 16#C8#, 16#2A#, 16#09#, 16#41#, 16#18#, 16#22#, 16#0C#, 16#40#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1C#, 16#0C#, 16#43#, 16#08#, 16#41#, 16#18#, 16#63#, 16#08#, 16#22#,
16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#04#, 16#81#, 16#10#, 16#22#, 16#07#, 16#81#,
16#80#, 16#20#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#0C#, 16#43#, 16#08#, 16#41#,
16#08#, 16#63#, 16#08#, 16#22#, 16#02#, 16#80#, 16#A2#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#0C#, 16#81#,
16#10#, 16#3C#, 16#05#, 16#01#, 16#B0#, 16#22#, 16#0E#, 16#60#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#,
16#19#, 16#03#, 16#00#, 16#30#, 16#03#, 16#02#, 16#20#, 16#44#, 16#07#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7E#, 16#12#, 16#40#, 16#40#, 16#18#, 16#02#, 16#00#, 16#40#,
16#08#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#73#, 16#0C#, 16#41#, 16#08#, 16#21#, 16#04#,
16#41#, 16#88#, 16#31#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#63#, 16#0C#, 16#40#, 16#90#,
16#12#, 16#02#, 16#80#, 16#60#, 16#0C#, 16#01#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#6E#, 16#CC#,
16#88#, 16#92#, 16#16#, 16#43#, 16#50#, 16#64#, 16#08#, 16#81#, 16#20#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#E6#, 16#0C#, 16#80#, 16#A0#, 16#18#, 16#03#, 16#00#, 16#B0#, 16#22#,
16#0E#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#66#, 16#04#, 16#80#, 16#A0#, 16#18#, 16#02#, 16#00#,
16#40#, 16#08#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#11#, 16#00#, 16#40#, 16#08#,
16#02#, 16#00#, 16#80#, 16#22#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#08#, 16#01#,
16#00#, 16#20#, 16#08#, 16#01#, 16#00#, 16#20#, 16#04#, 16#01#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#,
16#08#, 16#01#, 16#00#, 16#10#, 16#02#, 16#00#, 16#20#, 16#04#, 16#00#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#60#, 16#04#, 16#00#, 16#80#, 16#10#, 16#02#, 16#00#, 16#80#,
16#10#, 16#02#, 16#00#, 16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#40#, 16#14#, 16#02#, 16#80#, 16#88#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#40#, 16#08#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#34#, 16#09#, 16#03#, 16#20#, 16#4E#,
16#0E#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#C0#, 16#08#, 16#01#, 16#00#, 16#58#, 16#0C#, 16#81#,
16#30#, 16#4C#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#,
16#08#, 16#02#, 16#00#, 16#40#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#01#, 16#00#,
16#20#, 16#38#, 16#09#, 16#03#, 16#20#, 16#4A#, 16#06#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#09#, 16#03#, 16#C0#, 16#40#, 16#07#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#C0#, 16#20#, 16#04#, 16#01#, 16#00#, 16#78#, 16#04#, 16#00#, 16#80#,
16#10#, 16#04#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#09#,
16#01#, 16#60#, 16#18#, 16#04#, 16#01#, 16#60#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#08#, 16#01#, 16#00#,
16#58#, 16#0D#, 16#01#, 16#20#, 16#26#, 16#09#, 16#80#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#40#, 16#00#,
16#00#, 16#00#, 16#40#, 16#08#, 16#01#, 16#00#, 16#30#, 16#04#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#20#, 16#00#, 16#00#, 16#00#, 16#60#, 16#04#, 16#00#, 16#80#, 16#10#,
16#04#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#C0#, 16#08#, 16#01#, 16#00#, 16#5C#, 16#0A#, 16#01#,
16#80#, 16#28#, 16#09#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#08#, 16#01#, 16#00#, 16#40#,
16#08#, 16#01#, 16#00#, 16#30#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#5B#, 16#0D#, 16#A1#, 16#24#, 16#25#, 16#09#, 16#30#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#58#, 16#0D#, 16#01#, 16#20#, 16#26#, 16#09#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#08#, 16#83#, 16#20#,
16#44#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#58#, 16#0C#,
16#81#, 16#20#, 16#2C#, 16#0F#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#0D#, 16#03#, 16#20#, 16#4C#, 16#0F#, 16#00#, 16#20#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#58#, 16#0C#, 16#01#, 16#00#, 16#20#, 16#08#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#0A#, 16#00#, 16#80#, 16#50#,
16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#60#, 16#08#, 16#01#,
16#00#, 16#30#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#48#,
16#09#, 16#01#, 16#60#, 16#5A#, 16#0D#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#48#, 16#05#, 16#00#, 16#A0#, 16#18#, 16#02#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#49#, 16#07#, 16#20#, 16#E8#, 16#13#, 16#04#,
16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#68#, 16#07#, 16#00#, 16#80#,
16#30#, 16#09#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#68#, 16#04#,
16#80#, 16#A0#, 16#14#, 16#01#, 16#00#, 16#40#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#70#, 16#04#, 16#01#, 16#00#, 16#20#, 16#0C#, 16#00#, 16#60#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#04#,
16#01#, 16#00#, 16#20#, 16#08#, 16#01#, 16#00#, 16#20#, 16#04#, 16#00#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#80#, 16#10#, 16#02#, 16#00#, 16#40#, 16#08#, 16#01#, 16#00#, 16#20#,
16#04#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#00#, 16#20#, 16#04#, 16#00#, 16#80#, 16#10#, 16#04#, 16#00#,
16#80#, 16#10#, 16#04#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0C#, 16#80#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#);
Font_D : aliased constant Bitmap_Font :=
(
Bytes_Per_Glyph => 19,
Glyph_Width => 11,
Glyph_Height => 14,
Data => FreeSerifItalic6pt7bBitmaps'Access);
Font : constant Bitmap_Font_Ref := Font_D'Access;
end GESTE_Fonts.FreeSerifItalic6pt7b;
|
-- { dg-do run }
with Unchecked_Conversion;
procedure Unchecked_Convert12 is
subtype Unsigned_Type is Integer range 2_034 .. 2_164;
subtype Signed_Type is Integer range -2048 .. 2047;
type Rec is record
S : Unsigned_Type;
end record;
pragma Pack (Rec);
function To_Signed_Type is
new Unchecked_Conversion (Source => Rec, Target => Signed_Type);
function To_Unsigned_Type is
new Unchecked_Conversion (Source => Signed_Type, Target => Rec);
Data : Signed_Type;
Temp : Rec;
begin
Data := -1996;
Temp := To_Unsigned_Type (Data);
if Temp.S /= 2100 then
raise Program_Error;
end if;
Data := To_Signed_Type (Temp);
if Data /= -1996 then
raise Program_Error;
end if;
Data := 2047;
Temp := To_Unsigned_Type (Data);
if Temp.S /= 2047 then
raise Program_Error;
end if;
Data := To_Signed_Type (Temp);
if Data /= 2047 then
raise Program_Error;
end if;
end;
|
--------------------------------------------------------------------------------
-- Copyright (c) 2013, Felix Krause <contact@flyx.org>
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
--------------------------------------------------------------------------------
package CL.Contexts.CL_GL is
type Context is new Contexts.Context with null record;
package Constructors is
function Create (Platform : Platforms.Platform;
Devices : Platforms.Device_List;
Callback : Error_Callback := null)
return Context;
end Constructors;
end CL.Contexts.CL_GL;
|
-- A54B01A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT IF A CASE EXPRESSION IS A CONSTANT, VARIABLE,
-- TYPE CONVERSION, OR QUALIFIED EXPRESSION,
-- AND THE SUBTYPE OF THE
-- EXPRESSION IS STATIC, AN 'OTHERS' CAN BE OMITTED IF ALL
-- VALUES IN THE SUBTYPE'S RANGE ARE COVERED.
-- RM 01/23/80
-- SPS 10/26/82
-- SPS 2/1/83
WITH REPORT ;
PROCEDURE A54B01A IS
USE REPORT ;
BEGIN
TEST("A54B01A" , "CHECK THAT IF" &
" THE SUBTYPE OF A CASE EXPRESSION IS STATIC," &
" AN 'OTHERS' CAN BE OMITTED IF ALL" &
" VALUES IN THE SUBTYPE'S RANGE ARE COVERED" );
-- THE TEST CASES APPEAR IN THE FOLLOWING ORDER:
--
-- I. CONSTANTS
--
-- II. STATIC SUBRANGES
--
-- (A) VARIABLES (INTEGER , BOOLEAN)
-- (B) QUALIFIED EXPRESSIONS
-- (C) TYPE CONVERSIONS
DECLARE -- CONSTANTS
T : CONSTANT BOOLEAN := TRUE;
FIVE : CONSTANT INTEGER := IDENT_INT(5);
BEGIN
CASE FIVE IS
WHEN INTEGER'FIRST..4 => NULL ;
WHEN 5 => NULL ;
WHEN 6 .. INTEGER'LAST => NULL ;
END CASE;
CASE T IS
WHEN TRUE => NULL ;
WHEN FALSE => NULL ;
END CASE;
END ;
DECLARE -- STATIC SUBRANGES
SUBTYPE STAT IS INTEGER RANGE 1..5 ;
I : INTEGER RANGE 1..5 ;
J : STAT ;
BOOL: BOOLEAN := FALSE ;
CHAR: CHARACTER := 'U' ;
TYPE ENUMERATION IS ( FIRST,SECOND,THIRD,FOURTH,FIFTH );
ENUM: ENUMERATION := THIRD ;
BEGIN
I := IDENT_INT( 2 );
J := IDENT_INT( 2 );
CASE I IS
WHEN 1 | 3 | 5 => NULL ;
WHEN 2 | 4 => NULL ;
END CASE;
CASE BOOL IS
WHEN TRUE => NULL ;
WHEN FALSE => NULL ;
END CASE;
CASE STAT'( 2 ) IS
WHEN 5 | 2..4 => NULL ;
WHEN 1 => NULL ;
END CASE;
CASE STAT( J ) IS
WHEN 5 | 2..4 => NULL ;
WHEN 1 => NULL ;
END CASE;
END ; -- STATIC SUBRANGES
RESULT ;
END A54B01A ;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . D Y N A M I C _ T A B L E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-2019, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Resizable one dimensional array support
-- This package provides an implementation of dynamically resizable one
-- dimensional arrays. The idea is to mimic the normal Ada semantics for
-- arrays as closely as possible with the one additional capability of
-- dynamically modifying the value of the Last attribute.
-- This package provides a facility similar to that of Ada.Containers.Vectors.
-- Note that these three interfaces should remain synchronized to keep as much
-- coherency as possible among these related units:
--
-- GNAT.Dynamic_Tables
-- GNAT.Table
-- Table (the compiler unit)
pragma Compiler_Unit_Warning;
with Ada.Unchecked_Conversion;
generic
type Table_Component_Type is private;
type Table_Index_Type is range <>;
Table_Low_Bound : Table_Index_Type := Table_Index_Type'First;
Table_Initial : Positive := 8;
Table_Increment : Natural := 100;
Release_Threshold : Natural := 0; -- size in bytes
package GNAT.Dynamic_Tables is
-- Table_Component_Type and Table_Index_Type specify the type of the array,
-- Table_Low_Bound is the lower bound. The effect is roughly to declare:
-- Table : array (Table_Low_Bound .. <>) of Table_Component_Type;
-- The lower bound of Table_Index_Type is ignored.
-- Table_Component_Type must not be a type with controlled parts.
-- The Table_Initial value controls the allocation of the table when it is
-- first allocated.
-- The Table_Increment value controls the amount of increase, if the table
-- has to be increased in size. The value given is a percentage value (e.g.
-- 100 = increase table size by 100%, i.e. double it).
-- The Last and Set_Last subprograms provide control over the current
-- logical allocation. They are quite efficient, so they can be used
-- freely (expensive reallocation occurs only at major granularity
-- chunks controlled by the allocation parameters).
-- Note: we do not make the table components aliased, since this would
-- restrict the use of table for discriminated types. If it is necessary
-- to take the access of a table element, use Unrestricted_Access.
-- WARNING: On HPPA, the virtual addressing approach used in this unit is
-- incompatible with the indexing instructions on the HPPA. So when using
-- this unit, compile your application with -mdisable-indexing.
-- WARNING: If the table is reallocated, then the address of all its
-- components will change. So do not capture the address of an element
-- and then use the address later after the table may be reallocated. One
-- tricky case of this is passing an element of the table to a subprogram
-- by reference where the table gets reallocated during the execution of
-- the subprogram. The best rule to follow is never to pass a table element
-- as a parameter except for the case of IN mode parameters with scalar
-- values.
pragma Assert (Table_Low_Bound /= Table_Index_Type'Base'First);
subtype Valid_Table_Index_Type is Table_Index_Type'Base
range Table_Low_Bound .. Table_Index_Type'Base'Last;
subtype Table_Last_Type is Table_Index_Type'Base
range Table_Low_Bound - 1 .. Table_Index_Type'Base'Last;
-- Table_Component_Type must not be a type with controlled parts.
-- The Table_Initial value controls the allocation of the table when it is
-- first allocated.
-- The Table_Increment value controls the amount of increase, if the table
-- has to be increased in size. The value given is a percentage value (e.g.
-- 100 = increase table size by 100%, i.e. double it).
-- The Last and Set_Last subprograms provide control over the current
-- logical allocation. They are quite efficient, so they can be used
-- freely (expensive reallocation occurs only at major granularity
-- chunks controlled by the allocation parameters).
-- Note: we do not make the table components aliased, since this would
-- restrict the use of table for discriminated types. If it is necessary
-- to take the access of a table element, use Unrestricted_Access.
type Table_Type is
array (Valid_Table_Index_Type range <>) of Table_Component_Type;
subtype Big_Table_Type is
Table_Type (Table_Low_Bound .. Valid_Table_Index_Type'Last);
-- We work with pointers to a bogus array type that is constrained with
-- the maximum possible range bound. This means that the pointer is a thin
-- pointer, which is more efficient. Since subscript checks in any case
-- must be on the logical, rather than physical bounds, safety is not
-- compromised by this approach.
-- To get subscript checking, rename a slice of the Table, like this:
-- Table : Table_Type renames T.Table (First .. Last (T));
-- and then refer to components of Table.
type Table_Ptr is access all Big_Table_Type;
for Table_Ptr'Storage_Size use 0;
-- The table is actually represented as a pointer to allow reallocation
type Table_Private is private;
-- Table private data that is not exported in Instance
-- Private use only:
subtype Empty_Table_Array_Type is
Table_Type (Table_Low_Bound .. Table_Low_Bound - 1);
type Empty_Table_Array_Ptr is access all Empty_Table_Array_Type;
Empty_Table_Array : aliased Empty_Table_Array_Type;
function Empty_Table_Array_Ptr_To_Table_Ptr is
new Ada.Unchecked_Conversion (Empty_Table_Array_Ptr, Table_Ptr);
Empty_Table_Ptr : constant Table_Ptr :=
Empty_Table_Array_Ptr_To_Table_Ptr (Empty_Table_Array'Access);
-- End private use only. The above are used to initialize Table to point to
-- an empty array.
type Instance is record
Table : Table_Ptr := Empty_Table_Ptr;
-- The table itself. The lower bound is the value of First. Logically
-- the upper bound is the current value of Last (although the actual
-- size of the allocated table may be larger than this). The program may
-- only access and modify Table entries in the range First .. Last.
--
-- It's a good idea to access this via a renaming of a slice, in order
-- to ensure bounds checking, as in:
--
-- Tab : Table_Type renames X.Table (First .. X.Last);
--
-- Note: The Table component must come first. See declarations of
-- SCO_Unit_Table and SCO_Table in scos.h.
Locked : Boolean := False;
-- Table reallocation is permitted only if this is False. A client may
-- set Locked to True, in which case any operation that might expand or
-- shrink the table will cause an assertion failure. While a table is
-- locked, its address in memory remains fixed and unchanging.
P : Table_Private;
end record;
function Is_Empty (T : Instance) return Boolean;
pragma Inline (Is_Empty);
procedure Init (T : in out Instance);
-- Reinitializes the table to empty. There is no need to call this before
-- using a table; tables default to empty.
procedure Free (T : in out Instance) renames Init;
function First return Table_Index_Type;
pragma Inline (First);
-- Export First as synonym for Table_Low_Bound (parallel with use of Last)
function Last (T : Instance) return Table_Last_Type;
pragma Inline (Last);
-- Returns the current value of the last used entry in the table, which can
-- then be used as a subscript for Table.
procedure Release (T : in out Instance);
-- Storage is allocated in chunks according to the values given in the
-- Table_Initial and Table_Increment parameters. If Release_Threshold is
-- 0 or the length of the table does not exceed this threshold then a call
-- to Release releases all storage that is allocated, but is not logically
-- part of the current array value; otherwise the call to Release leaves
-- the current array value plus 0.1% of the current table length free
-- elements located at the end of the table. This parameter facilitates
-- reopening large tables and adding a few elements without allocating a
-- chunk of memory. In both cases current array values are not affected by
-- this call.
procedure Set_Last (T : in out Instance; New_Val : Table_Last_Type);
pragma Inline (Set_Last);
-- This procedure sets Last to the indicated value. If necessary the table
-- is reallocated to accommodate the new value (i.e. on return the
-- allocated table has an upper bound of at least Last). If Set_Last
-- reduces the size of the table, then logically entries are removed from
-- the table. If Set_Last increases the size of the table, then new entries
-- are logically added to the table.
procedure Increment_Last (T : in out Instance);
pragma Inline (Increment_Last);
-- Adds 1 to Last (same as Set_Last (Last + 1))
procedure Decrement_Last (T : in out Instance);
pragma Inline (Decrement_Last);
-- Subtracts 1 from Last (same as Set_Last (Last - 1))
procedure Append (T : in out Instance; New_Val : Table_Component_Type);
pragma Inline (Append);
-- Appends New_Val onto the end of the table
-- Equivalent to:
-- Increment_Last (T);
-- T.Table (T.Last) := New_Val;
procedure Append_All (T : in out Instance; New_Vals : Table_Type);
-- Appends all components of New_Vals
procedure Set_Item
(T : in out Instance;
Index : Valid_Table_Index_Type;
Item : Table_Component_Type);
pragma Inline (Set_Item);
-- Put Item in the table at position Index. If Index points to an existing
-- item (i.e. it is in the range First .. Last (T)), the item is replaced.
-- Otherwise (i.e. Index > Last (T)), the table is expanded, and Last is
-- set to Index.
procedure Move (From, To : in out Instance);
-- Moves from From to To, and sets From to empty
procedure Allocate (T : in out Instance; Num : Integer := 1);
pragma Inline (Allocate);
-- Adds Num to Last
generic
with procedure Action
(Index : Valid_Table_Index_Type;
Item : Table_Component_Type;
Quit : in out Boolean) is <>;
procedure For_Each (Table : Instance);
-- Calls procedure Action for each component of the table, or until one of
-- these calls set Quit to True.
generic
with function Lt (Comp1, Comp2 : Table_Component_Type) return Boolean;
procedure Sort_Table (Table : in out Instance);
-- This procedure sorts the components of the table into ascending order
-- making calls to Lt to do required comparisons, and using assignments
-- to move components around. The Lt function returns True if Comp1 is
-- less than Comp2 (in the sense of the desired sort), and False if Comp1
-- is greater than Comp2. For equal objects it does not matter if True or
-- False is returned (it is slightly more efficient to return False). The
-- sort is not stable (the order of equal items in the table is not
-- preserved).
private
type Table_Private is record
Last_Allocated : Table_Last_Type := Table_Low_Bound - 1;
-- Subscript of the maximum entry in the currently allocated table.
-- Initial value ensures that we initially allocate the table.
Last : Table_Last_Type := Table_Low_Bound - 1;
-- Current value of Last function
-- Invariant: Last <= Last_Allocated
end record;
end GNAT.Dynamic_Tables;
|
-- Copyright 2014-2016 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
type Array_Type is array (Integer range <>) of Integer;
Var: Array_Type (0 .. -1);
begin
Do_Nothing (Var'Address); -- STOP
end Foo;
|
-----------------------------------------------------------------------
-- functions -- Show how to plug and use functions
-- Copyright (C) 2009, 2010 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with EL.Expressions;
with EL.Objects;
with EL.Contexts.Default;
with EL.Functions.Default;
with Ada.Text_IO;
with Bean;
procedure Functions is
use Bean;
use Ada.Text_IO;
use EL.Expressions;
use EL.Objects;
E : Expression;
Fn : constant EL.Functions.Function_Mapper_Access
:= new EL.Functions.Default.Default_Function_Mapper;
Ctx : EL.Contexts.Default.Default_Context;
Joe : constant Person_Access := Create_Person ("Joe", "Smith", 12);
Bill : constant Person_Access := Create_Person ("Bill", "Johnson", 42);
Result : Object;
begin
-- Register the 'format' function.
Fn.Set_Function (Namespace => "",
Name => "format",
Func => Bean.Format'Access);
Ctx.Set_Function_Mapper (Fn);
-- Create the expression
E := Create_Expression ("#{format(user.firstName)} #{user.lastName}", Ctx);
-- Bind the context to 'Joe' and evaluate
Ctx.Set_Variable ("user", Joe);
Result := E.Get_Value (Ctx);
Put_Line ("Joe's name is " & To_String (Result));
-- Bind the context to 'Bill' and evaluate
Ctx.Set_Variable ("user", Bill);
Result := E.Get_Value (Ctx);
Put_Line ("Bill's name is " & To_String (Result));
end Functions;
|
with Ada.Strings.Fixed.Hash;
package body Limited_With3_Pkg1 is
function Equal ( Left, Right : Element_Access) return Boolean is
begin
return True;
end;
function Equivalent_Keys (Left, Right : Key_Type) return Boolean is
begin
return True;
end;
function Hash (Key : Key_Type) return Ada.Containers.Hash_Type is
begin
return Ada.Strings.Fixed.Hash (Key.all);
end Hash;
end Limited_With3_Pkg1;
|
-- C43105B.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- IN A RECORD AGGREGATE (X => E, Y => E), WHERE E IS AN OVERLOADED
-- FUNCTION CALL, OVERLOADING RESOLUTION OCCURS SEPARATELY FOR THE
-- DIFFERENT OCCURRENCES OF E.
-- HISTORY:
-- DHH 09/07/88 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
PROCEDURE C43105B IS
BEGIN
TEST ("C43105B", "IN A RECORD AGGREGATE (X => E, Y => E), WHERE " &
"E IS AN OVERLOADED FUNCTION CALL, OVERLOADING " &
"RESOLUTION OCCURS SEPARATELY FOR THE " &
"DIFFERENT OCCURRENCES OF E");
DECLARE
TYPE COLOR IS (RED, YELLOW, GREEN);
TYPE PALETTE IS (GREEN, YELLOW, RED);
TYPE REC IS
RECORD
X : COLOR;
Y : PALETTE;
END RECORD;
TYPE RECD IS
RECORD
X : PALETTE;
Y : COLOR;
END RECORD;
REC1 : REC;
REC2 : RECD;
FUNCTION IDENT_C(C : COLOR) RETURN COLOR IS
BEGIN
IF EQUAL(3,3) THEN
RETURN C;
ELSE
RETURN GREEN;
END IF;
END IDENT_C;
FUNCTION IDENT_C(P : PALETTE) RETURN PALETTE IS
BEGIN
IF EQUAL(3,3) THEN
RETURN P;
ELSE
RETURN RED;
END IF;
END IDENT_C;
BEGIN
REC1 := (X => IDENT_C(YELLOW), Y => IDENT_C(YELLOW));
REC2 := (X => IDENT_C(YELLOW), Y => IDENT_C(YELLOW));
IF REC1.X /= REC2.Y THEN
FAILED("COLOR FUNCTION RESOLUTION FAILED");
END IF;
IF REC1.Y /= REC2.X THEN
FAILED("PALETTE FUNCTION RESOLUTION FAILED");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED("EXCEPTION RAISED");
END;
RESULT;
END C43105B;
|
-- --
-- package Copyright (c) Dmitry A. Kazakov --
-- IEEE_754.Generic_Double_Precision Luebeck --
-- Interface Summer, 2008 --
-- --
-- Last revision : 09:27 06 Nov 2016 --
-- --
-- This library 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 2 of --
-- the License, or (at your option) any later version. This library --
-- is distributed in the hope that it will be useful, but WITHOUT --
-- ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. You should have --
-- received a copy of the GNU General Public License along with --
-- this library; if not, write to the Free Software Foundation, --
-- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. --
-- --
-- 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. --
--____________________________________________________________________--
generic
type Number is digits <>;
package IEEE_754.Generic_Double_Precision is
pragma Pure (IEEE_754.Generic_Double_Precision);
use Interfaces;
--
-- Float_64 -- 64-bit double-precision IEEE 754 float. The memory layout
-- is big endian, i.e. the byte containing the number's sign
-- and the most significant bits of the exponent is the first array
-- element. The byte containing the least significant bits of the
-- mantissa is the last array element.
--
type Float_64 is array (1..8) of Byte;
Positive_Infinity : constant Float_64;
Positive_Zero : constant Float_64;
Negative_Infinity : constant Float_64;
Negative_Zero : constant Float_64;
--
-- From_IEEE -- Conversion from 32-bit single precision IEEE 754 float
--
-- Value - The argument
--
-- Returns :
--
-- The corresponding floating-point number
--
-- Exceptions :
--
-- Not_A_Number_Error - Not a number
-- Positive_Overflow_Error - Positive infinity or too big positive
-- Negative_Overflow_Error - Negative infinity or too big negative
--
function From_IEEE (Value : Float_64) return Number;
--
-- Is_NaN -- NaN test
--
-- Value - The argument
--
-- Returns :
--
-- True if Value is an IEEE NaN
--
function Is_NaN (Value : Float_64) return Boolean;
--
-- Is_Negative -- IEEE sign test
--
-- Value - The argument
--
-- Returns :
--
-- True if Value has an IEEE sign
--
function Is_Negative (Value : Float_64) return Boolean;
--
-- Is_Real -- Value test
--
-- Value - The argument
--
-- This function tests if Value represents a real number. Infinities and
-- NaN are not numbers. Both zeros are considered numbers.
--
-- Returns :
--
-- True if Value represents a real number
--
function Is_Real (Value : Float_64) return Boolean;
--
-- Normalize -- Split number into integer mantissa and binary exponent
--
-- Value - The argument
-- Mantissa - The mantissa
-- Exponent - The binary exponent
--
procedure Normalize
( Value : Number;
Mantissa : out Unsigned_64;
Exponent : out Integer
);
--
-- To_IEEE -- Conversion to 32-bit single precision IEEE 754 float
--
-- Value - The argument
--
-- The value to big for normalized representation results in the
-- corresponding IEEE infinities. Too small values are represented as
-- IEEE zero.
--
-- Returns :
--
-- The corresponding IEEE 754 representation
--
function To_IEEE (Value : Number) return Float_64;
private
pragma Inline (Is_NaN);
pragma Inline (Is_Negative);
pragma Inline (Is_Real);
pragma Inline (Normalize);
Positive_Infinity : constant Float_64 := (16#7F#,16#F0#,others => 0);
Positive_Zero : constant Float_64 := (others => 0);
Negative_Infinity : constant Float_64 := (16#FF#,16#F8#,others => 0);
Negative_Zero : constant Float_64 := (16#80#,others => 0);
end IEEE_754.Generic_Double_Precision;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ C H 5 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Aspects; use Aspects;
with Atree; use Atree;
with Checks; use Checks;
with Debug; use Debug;
with Einfo; use Einfo;
with Elists; use Elists;
with Errout; use Errout;
with Exp_Aggr; use Exp_Aggr;
with Exp_Ch6; use Exp_Ch6;
with Exp_Ch7; use Exp_Ch7;
with Exp_Ch11; use Exp_Ch11;
with Exp_Dbug; use Exp_Dbug;
with Exp_Pakd; use Exp_Pakd;
with Exp_Tss; use Exp_Tss;
with Exp_Util; use Exp_Util;
with Inline; use Inline;
with Namet; use Namet;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Restrict; use Restrict;
with Rident; use Rident;
with Rtsfind; use Rtsfind;
with Sinfo; use Sinfo;
with Sem; use Sem;
with Sem_Aux; use Sem_Aux;
with Sem_Ch3; use Sem_Ch3;
with Sem_Ch8; use Sem_Ch8;
with Sem_Ch13; use Sem_Ch13;
with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
with Sem_Util; use Sem_Util;
with Snames; use Snames;
with Stand; use Stand;
with Stringt; use Stringt;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
with Validsw; use Validsw;
package body Exp_Ch5 is
procedure Build_Formal_Container_Iteration
(N : Node_Id;
Container : Entity_Id;
Cursor : Entity_Id;
Init : out Node_Id;
Advance : out Node_Id;
New_Loop : out Node_Id);
-- Utility to create declarations and loop statement for both forms
-- of formal container iterators.
function Change_Of_Representation (N : Node_Id) return Boolean;
-- Determine if the right-hand side of assignment N is a type conversion
-- which requires a change of representation. Called only for the array
-- and record cases.
procedure Expand_Assign_Array (N : Node_Id; Rhs : Node_Id);
-- N is an assignment which assigns an array value. This routine process
-- the various special cases and checks required for such assignments,
-- including change of representation. Rhs is normally simply the right-
-- hand side of the assignment, except that if the right-hand side is a
-- type conversion or a qualified expression, then the RHS is the actual
-- expression inside any such type conversions or qualifications.
function Expand_Assign_Array_Loop
(N : Node_Id;
Larray : Entity_Id;
Rarray : Entity_Id;
L_Type : Entity_Id;
R_Type : Entity_Id;
Ndim : Pos;
Rev : Boolean) return Node_Id;
-- N is an assignment statement which assigns an array value. This routine
-- expands the assignment into a loop (or nested loops for the case of a
-- multi-dimensional array) to do the assignment component by component.
-- Larray and Rarray are the entities of the actual arrays on the left-hand
-- and right-hand sides. L_Type and R_Type are the types of these arrays
-- (which may not be the same, due to either sliding, or to a change of
-- representation case). Ndim is the number of dimensions and the parameter
-- Rev indicates if the loops run normally (Rev = False), or reversed
-- (Rev = True). The value returned is the constructed loop statement.
-- Auxiliary declarations are inserted before node N using the standard
-- Insert_Actions mechanism.
procedure Expand_Assign_Record (N : Node_Id);
-- N is an assignment of an untagged record value. This routine handles
-- the case where the assignment must be made component by component,
-- either because the target is not byte aligned, or there is a change
-- of representation, or when we have a tagged type with a representation
-- clause (this last case is required because holes in the tagged type
-- might be filled with components from child types).
procedure Expand_Assign_With_Target_Names (N : Node_Id);
-- (AI12-0125): N is an assignment statement whose RHS contains occurrences
-- of @ that designate the value of the LHS of the assignment. If the LHS
-- is side-effect free the target names can be replaced with a copy of the
-- LHS; otherwise the semantics of the assignment is described in terms of
-- a procedure with an in-out parameter, and expanded as such.
procedure Expand_Formal_Container_Loop (N : Node_Id);
-- Use the primitives specified in an Iterable aspect to expand a loop
-- over a so-called formal container, primarily for SPARK usage.
procedure Expand_Formal_Container_Element_Loop (N : Node_Id);
-- Same, for an iterator of the form " For E of C". In this case the
-- iterator provides the name of the element, and the cursor is generated
-- internally.
procedure Expand_Iterator_Loop (N : Node_Id);
-- Expand loop over arrays and containers that uses the form "for X of C"
-- with an optional subtype mark, or "for Y in C".
procedure Expand_Iterator_Loop_Over_Container
(N : Node_Id;
Isc : Node_Id;
I_Spec : Node_Id;
Container : Node_Id;
Container_Typ : Entity_Id);
-- Expand loop over containers that uses the form "for X of C" with an
-- optional subtype mark, or "for Y in C". Isc is the iteration scheme.
-- I_Spec is the iterator specification and Container is either the
-- Container (for OF) or the iterator (for IN).
procedure Expand_Predicated_Loop (N : Node_Id);
-- Expand for loop over predicated subtype
function Make_Tag_Ctrl_Assignment (N : Node_Id) return List_Id;
-- Generate the necessary code for controlled and tagged assignment, that
-- is to say, finalization of the target before, adjustment of the target
-- after and save and restore of the tag and finalization pointers which
-- are not 'part of the value' and must not be changed upon assignment. N
-- is the original Assignment node.
--------------------------------------
-- Build_Formal_Container_iteration --
--------------------------------------
procedure Build_Formal_Container_Iteration
(N : Node_Id;
Container : Entity_Id;
Cursor : Entity_Id;
Init : out Node_Id;
Advance : out Node_Id;
New_Loop : out Node_Id)
is
Loc : constant Source_Ptr := Sloc (N);
Stats : constant List_Id := Statements (N);
Typ : constant Entity_Id := Base_Type (Etype (Container));
First_Op : constant Entity_Id :=
Get_Iterable_Type_Primitive (Typ, Name_First);
Next_Op : constant Entity_Id :=
Get_Iterable_Type_Primitive (Typ, Name_Next);
Has_Element_Op : constant Entity_Id :=
Get_Iterable_Type_Primitive (Typ, Name_Has_Element);
begin
-- Declaration for Cursor
Init :=
Make_Object_Declaration (Loc,
Defining_Identifier => Cursor,
Object_Definition => New_Occurrence_Of (Etype (First_Op), Loc),
Expression =>
Make_Function_Call (Loc,
Name => New_Occurrence_Of (First_Op, Loc),
Parameter_Associations => New_List (
New_Occurrence_Of (Container, Loc))));
-- Statement that advances cursor in loop
Advance :=
Make_Assignment_Statement (Loc,
Name => New_Occurrence_Of (Cursor, Loc),
Expression =>
Make_Function_Call (Loc,
Name => New_Occurrence_Of (Next_Op, Loc),
Parameter_Associations => New_List (
New_Occurrence_Of (Container, Loc),
New_Occurrence_Of (Cursor, Loc))));
-- Iterator is rewritten as a while_loop
New_Loop :=
Make_Loop_Statement (Loc,
Iteration_Scheme =>
Make_Iteration_Scheme (Loc,
Condition =>
Make_Function_Call (Loc,
Name => New_Occurrence_Of (Has_Element_Op, Loc),
Parameter_Associations => New_List (
New_Occurrence_Of (Container, Loc),
New_Occurrence_Of (Cursor, Loc)))),
Statements => Stats,
End_Label => Empty);
end Build_Formal_Container_Iteration;
------------------------------
-- Change_Of_Representation --
------------------------------
function Change_Of_Representation (N : Node_Id) return Boolean is
Rhs : constant Node_Id := Expression (N);
begin
return
Nkind (Rhs) = N_Type_Conversion
and then
not Same_Representation (Etype (Rhs), Etype (Expression (Rhs)));
end Change_Of_Representation;
-------------------------
-- Expand_Assign_Array --
-------------------------
-- There are two issues here. First, do we let Gigi do a block move, or
-- do we expand out into a loop? Second, we need to set the two flags
-- Forwards_OK and Backwards_OK which show whether the block move (or
-- corresponding loops) can be legitimately done in a forwards (low to
-- high) or backwards (high to low) manner.
procedure Expand_Assign_Array (N : Node_Id; Rhs : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Lhs : constant Node_Id := Name (N);
Act_Lhs : constant Node_Id := Get_Referenced_Object (Lhs);
Act_Rhs : Node_Id := Get_Referenced_Object (Rhs);
L_Type : constant Entity_Id :=
Underlying_Type (Get_Actual_Subtype (Act_Lhs));
R_Type : Entity_Id :=
Underlying_Type (Get_Actual_Subtype (Act_Rhs));
L_Slice : constant Boolean := Nkind (Act_Lhs) = N_Slice;
R_Slice : constant Boolean := Nkind (Act_Rhs) = N_Slice;
Crep : constant Boolean := Change_Of_Representation (N);
Larray : Node_Id;
Rarray : Node_Id;
Ndim : constant Pos := Number_Dimensions (L_Type);
Loop_Required : Boolean := False;
-- This switch is set to True if the array move must be done using
-- an explicit front end generated loop.
procedure Apply_Dereference (Arg : Node_Id);
-- If the argument is an access to an array, and the assignment is
-- converted into a procedure call, apply explicit dereference.
function Has_Address_Clause (Exp : Node_Id) return Boolean;
-- Test if Exp is a reference to an array whose declaration has
-- an address clause, or it is a slice of such an array.
function Is_Formal_Array (Exp : Node_Id) return Boolean;
-- Test if Exp is a reference to an array which is either a formal
-- parameter or a slice of a formal parameter. These are the cases
-- where hidden aliasing can occur.
function Is_Non_Local_Array (Exp : Node_Id) return Boolean;
-- Determine if Exp is a reference to an array variable which is other
-- than an object defined in the current scope, or a component or a
-- slice of such an object. Such objects can be aliased to parameters
-- (unlike local array references).
-----------------------
-- Apply_Dereference --
-----------------------
procedure Apply_Dereference (Arg : Node_Id) is
Typ : constant Entity_Id := Etype (Arg);
begin
if Is_Access_Type (Typ) then
Rewrite (Arg, Make_Explicit_Dereference (Loc,
Prefix => Relocate_Node (Arg)));
Analyze_And_Resolve (Arg, Designated_Type (Typ));
end if;
end Apply_Dereference;
------------------------
-- Has_Address_Clause --
------------------------
function Has_Address_Clause (Exp : Node_Id) return Boolean is
begin
return
(Is_Entity_Name (Exp) and then
Present (Address_Clause (Entity (Exp))))
or else
(Nkind (Exp) = N_Slice and then Has_Address_Clause (Prefix (Exp)));
end Has_Address_Clause;
---------------------
-- Is_Formal_Array --
---------------------
function Is_Formal_Array (Exp : Node_Id) return Boolean is
begin
return
(Is_Entity_Name (Exp) and then Is_Formal (Entity (Exp)))
or else
(Nkind (Exp) = N_Slice and then Is_Formal_Array (Prefix (Exp)));
end Is_Formal_Array;
------------------------
-- Is_Non_Local_Array --
------------------------
function Is_Non_Local_Array (Exp : Node_Id) return Boolean is
begin
case Nkind (Exp) is
when N_Indexed_Component
| N_Selected_Component
| N_Slice
=>
return Is_Non_Local_Array (Prefix (Exp));
when others =>
return
not (Is_Entity_Name (Exp)
and then Scope (Entity (Exp)) = Current_Scope);
end case;
end Is_Non_Local_Array;
-- Determine if Lhs, Rhs are formal arrays or nonlocal arrays
Lhs_Formal : constant Boolean := Is_Formal_Array (Act_Lhs);
Rhs_Formal : constant Boolean := Is_Formal_Array (Act_Rhs);
Lhs_Non_Local_Var : constant Boolean := Is_Non_Local_Array (Act_Lhs);
Rhs_Non_Local_Var : constant Boolean := Is_Non_Local_Array (Act_Rhs);
-- Start of processing for Expand_Assign_Array
begin
-- Deal with length check. Note that the length check is done with
-- respect to the right-hand side as given, not a possible underlying
-- renamed object, since this would generate incorrect extra checks.
Apply_Length_Check (Rhs, L_Type);
-- We start by assuming that the move can be done in either direction,
-- i.e. that the two sides are completely disjoint.
Set_Forwards_OK (N, True);
Set_Backwards_OK (N, True);
-- Normally it is only the slice case that can lead to overlap, and
-- explicit checks for slices are made below. But there is one case
-- where the slice can be implicit and invisible to us: when we have a
-- one dimensional array, and either both operands are parameters, or
-- one is a parameter (which can be a slice passed by reference) and the
-- other is a non-local variable. In this case the parameter could be a
-- slice that overlaps with the other operand.
-- However, if the array subtype is a constrained first subtype in the
-- parameter case, then we don't have to worry about overlap, since
-- slice assignments aren't possible (other than for a slice denoting
-- the whole array).
-- Note: No overlap is possible if there is a change of representation,
-- so we can exclude this case.
if Ndim = 1
and then not Crep
and then
((Lhs_Formal and Rhs_Formal)
or else
(Lhs_Formal and Rhs_Non_Local_Var)
or else
(Rhs_Formal and Lhs_Non_Local_Var))
and then
(not Is_Constrained (Etype (Lhs))
or else not Is_First_Subtype (Etype (Lhs)))
then
Set_Forwards_OK (N, False);
Set_Backwards_OK (N, False);
-- Note: the bit-packed case is not worrisome here, since if we have
-- a slice passed as a parameter, it is always aligned on a byte
-- boundary, and if there are no explicit slices, the assignment
-- can be performed directly.
end if;
-- If either operand has an address clause clear Backwards_OK and
-- Forwards_OK, since we cannot tell if the operands overlap. We
-- exclude this treatment when Rhs is an aggregate, since we know
-- that overlap can't occur.
if (Has_Address_Clause (Lhs) and then Nkind (Rhs) /= N_Aggregate)
or else Has_Address_Clause (Rhs)
then
Set_Forwards_OK (N, False);
Set_Backwards_OK (N, False);
end if;
-- We certainly must use a loop for change of representation and also
-- we use the operand of the conversion on the right-hand side as the
-- effective right-hand side (the component types must match in this
-- situation).
if Crep then
Act_Rhs := Get_Referenced_Object (Rhs);
R_Type := Get_Actual_Subtype (Act_Rhs);
Loop_Required := True;
-- We require a loop if the left side is possibly bit unaligned
elsif Possible_Bit_Aligned_Component (Lhs)
or else
Possible_Bit_Aligned_Component (Rhs)
then
Loop_Required := True;
-- Arrays with controlled components are expanded into a loop to force
-- calls to Adjust at the component level.
elsif Has_Controlled_Component (L_Type) then
Loop_Required := True;
-- If object is atomic/VFA, we cannot tolerate a loop
elsif Is_Atomic_Or_VFA_Object (Act_Lhs)
or else
Is_Atomic_Or_VFA_Object (Act_Rhs)
then
return;
-- Loop is required if we have atomic components since we have to
-- be sure to do any accesses on an element by element basis.
elsif Has_Atomic_Components (L_Type)
or else Has_Atomic_Components (R_Type)
or else Is_Atomic_Or_VFA (Component_Type (L_Type))
or else Is_Atomic_Or_VFA (Component_Type (R_Type))
then
Loop_Required := True;
-- Case where no slice is involved
elsif not L_Slice and not R_Slice then
-- The following code deals with the case of unconstrained bit packed
-- arrays. The problem is that the template for such arrays contains
-- the bounds of the actual source level array, but the copy of an
-- entire array requires the bounds of the underlying array. It would
-- be nice if the back end could take care of this, but right now it
-- does not know how, so if we have such a type, then we expand out
-- into a loop, which is inefficient but works correctly. If we don't
-- do this, we get the wrong length computed for the array to be
-- moved. The two cases we need to worry about are:
-- Explicit dereference of an unconstrained packed array type as in
-- the following example:
-- procedure C52 is
-- type BITS is array(INTEGER range <>) of BOOLEAN;
-- pragma PACK(BITS);
-- type A is access BITS;
-- P1,P2 : A;
-- begin
-- P1 := new BITS (1 .. 65_535);
-- P2 := new BITS (1 .. 65_535);
-- P2.ALL := P1.ALL;
-- end C52;
-- A formal parameter reference with an unconstrained bit array type
-- is the other case we need to worry about (here we assume the same
-- BITS type declared above):
-- procedure Write_All (File : out BITS; Contents : BITS);
-- begin
-- File.Storage := Contents;
-- end Write_All;
-- We expand to a loop in either of these two cases
-- Question for future thought. Another potentially more efficient
-- approach would be to create the actual subtype, and then do an
-- unchecked conversion to this actual subtype ???
Check_Unconstrained_Bit_Packed_Array : declare
function Is_UBPA_Reference (Opnd : Node_Id) return Boolean;
-- Function to perform required test for the first case, above
-- (dereference of an unconstrained bit packed array).
-----------------------
-- Is_UBPA_Reference --
-----------------------
function Is_UBPA_Reference (Opnd : Node_Id) return Boolean is
Typ : constant Entity_Id := Underlying_Type (Etype (Opnd));
P_Type : Entity_Id;
Des_Type : Entity_Id;
begin
if Present (Packed_Array_Impl_Type (Typ))
and then Is_Array_Type (Packed_Array_Impl_Type (Typ))
and then not Is_Constrained (Packed_Array_Impl_Type (Typ))
then
return True;
elsif Nkind (Opnd) = N_Explicit_Dereference then
P_Type := Underlying_Type (Etype (Prefix (Opnd)));
if not Is_Access_Type (P_Type) then
return False;
else
Des_Type := Designated_Type (P_Type);
return
Is_Bit_Packed_Array (Des_Type)
and then not Is_Constrained (Des_Type);
end if;
else
return False;
end if;
end Is_UBPA_Reference;
-- Start of processing for Check_Unconstrained_Bit_Packed_Array
begin
if Is_UBPA_Reference (Lhs)
or else
Is_UBPA_Reference (Rhs)
then
Loop_Required := True;
-- Here if we do not have the case of a reference to a bit packed
-- unconstrained array case. In this case gigi can most certainly
-- handle the assignment if a forwards move is allowed.
-- (could it handle the backwards case also???)
elsif Forwards_OK (N) then
return;
end if;
end Check_Unconstrained_Bit_Packed_Array;
-- The back end can always handle the assignment if the right side is a
-- string literal (note that overlap is definitely impossible in this
-- case). If the type is packed, a string literal is always converted
-- into an aggregate, except in the case of a null slice, for which no
-- aggregate can be written. In that case, rewrite the assignment as a
-- null statement, a length check has already been emitted to verify
-- that the range of the left-hand side is empty.
-- Note that this code is not executed if we have an assignment of a
-- string literal to a non-bit aligned component of a record, a case
-- which cannot be handled by the backend.
elsif Nkind (Rhs) = N_String_Literal then
if String_Length (Strval (Rhs)) = 0
and then Is_Bit_Packed_Array (L_Type)
then
Rewrite (N, Make_Null_Statement (Loc));
Analyze (N);
end if;
return;
-- If either operand is bit packed, then we need a loop, since we can't
-- be sure that the slice is byte aligned. Similarly, if either operand
-- is a possibly unaligned slice, then we need a loop (since the back
-- end cannot handle unaligned slices).
elsif Is_Bit_Packed_Array (L_Type)
or else Is_Bit_Packed_Array (R_Type)
or else Is_Possibly_Unaligned_Slice (Lhs)
or else Is_Possibly_Unaligned_Slice (Rhs)
then
Loop_Required := True;
-- If we are not bit-packed, and we have only one slice, then no overlap
-- is possible except in the parameter case, so we can let the back end
-- handle things.
elsif not (L_Slice and R_Slice) then
if Forwards_OK (N) then
return;
end if;
end if;
-- If the right-hand side is a string literal, introduce a temporary for
-- it, for use in the generated loop that will follow.
if Nkind (Rhs) = N_String_Literal then
declare
Temp : constant Entity_Id := Make_Temporary (Loc, 'T', Rhs);
Decl : Node_Id;
begin
Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => Temp,
Object_Definition => New_Occurrence_Of (L_Type, Loc),
Expression => Relocate_Node (Rhs));
Insert_Action (N, Decl);
Rewrite (Rhs, New_Occurrence_Of (Temp, Loc));
R_Type := Etype (Temp);
end;
end if;
-- Come here to complete the analysis
-- Loop_Required: Set to True if we know that a loop is required
-- regardless of overlap considerations.
-- Forwards_OK: Set to False if we already know that a forwards
-- move is not safe, else set to True.
-- Backwards_OK: Set to False if we already know that a backwards
-- move is not safe, else set to True
-- Our task at this stage is to complete the overlap analysis, which can
-- result in possibly setting Forwards_OK or Backwards_OK to False, and
-- then generating the final code, either by deciding that it is OK
-- after all to let Gigi handle it, or by generating appropriate code
-- in the front end.
declare
L_Index_Typ : constant Node_Id := Etype (First_Index (L_Type));
R_Index_Typ : constant Node_Id := Etype (First_Index (R_Type));
Left_Lo : constant Node_Id := Type_Low_Bound (L_Index_Typ);
Left_Hi : constant Node_Id := Type_High_Bound (L_Index_Typ);
Right_Lo : constant Node_Id := Type_Low_Bound (R_Index_Typ);
Right_Hi : constant Node_Id := Type_High_Bound (R_Index_Typ);
Act_L_Array : Node_Id;
Act_R_Array : Node_Id;
Cleft_Lo : Node_Id;
Cright_Lo : Node_Id;
Condition : Node_Id;
Cresult : Compare_Result;
begin
-- Get the expressions for the arrays. If we are dealing with a
-- private type, then convert to the underlying type. We can do
-- direct assignments to an array that is a private type, but we
-- cannot assign to elements of the array without this extra
-- unchecked conversion.
-- Note: We propagate Parent to the conversion nodes to generate
-- a well-formed subtree.
if Nkind (Act_Lhs) = N_Slice then
Larray := Prefix (Act_Lhs);
else
Larray := Act_Lhs;
if Is_Private_Type (Etype (Larray)) then
declare
Par : constant Node_Id := Parent (Larray);
begin
Larray :=
Unchecked_Convert_To
(Underlying_Type (Etype (Larray)), Larray);
Set_Parent (Larray, Par);
end;
end if;
end if;
if Nkind (Act_Rhs) = N_Slice then
Rarray := Prefix (Act_Rhs);
else
Rarray := Act_Rhs;
if Is_Private_Type (Etype (Rarray)) then
declare
Par : constant Node_Id := Parent (Rarray);
begin
Rarray :=
Unchecked_Convert_To
(Underlying_Type (Etype (Rarray)), Rarray);
Set_Parent (Rarray, Par);
end;
end if;
end if;
-- If both sides are slices, we must figure out whether it is safe
-- to do the move in one direction or the other. It is always safe
-- if there is a change of representation since obviously two arrays
-- with different representations cannot possibly overlap.
if (not Crep) and L_Slice and R_Slice then
Act_L_Array := Get_Referenced_Object (Prefix (Act_Lhs));
Act_R_Array := Get_Referenced_Object (Prefix (Act_Rhs));
-- If both left- and right-hand arrays are entity names, and refer
-- to different entities, then we know that the move is safe (the
-- two storage areas are completely disjoint).
if Is_Entity_Name (Act_L_Array)
and then Is_Entity_Name (Act_R_Array)
and then Entity (Act_L_Array) /= Entity (Act_R_Array)
then
null;
-- Otherwise, we assume the worst, which is that the two arrays
-- are the same array. There is no need to check if we know that
-- is the case, because if we don't know it, we still have to
-- assume it.
-- Generally if the same array is involved, then we have an
-- overlapping case. We will have to really assume the worst (i.e.
-- set neither of the OK flags) unless we can determine the lower
-- or upper bounds at compile time and compare them.
else
Cresult :=
Compile_Time_Compare
(Left_Lo, Right_Lo, Assume_Valid => True);
if Cresult = Unknown then
Cresult :=
Compile_Time_Compare
(Left_Hi, Right_Hi, Assume_Valid => True);
end if;
case Cresult is
when EQ | LE | LT =>
Set_Backwards_OK (N, False);
when GE | GT =>
Set_Forwards_OK (N, False);
when NE | Unknown =>
Set_Backwards_OK (N, False);
Set_Forwards_OK (N, False);
end case;
end if;
end if;
-- If after that analysis Loop_Required is False, meaning that we
-- have not discovered some non-overlap reason for requiring a loop,
-- then the outcome depends on the capabilities of the back end.
if not Loop_Required then
-- Assume the back end can deal with all cases of overlap by
-- falling back to memmove if it cannot use a more efficient
-- approach.
return;
end if;
-- At this stage we have to generate an explicit loop, and we have
-- the following cases:
-- Forwards_OK = True
-- Rnn : right_index := right_index'First;
-- for Lnn in left-index loop
-- left (Lnn) := right (Rnn);
-- Rnn := right_index'Succ (Rnn);
-- end loop;
-- Note: the above code MUST be analyzed with checks off, because
-- otherwise the Succ could overflow. But in any case this is more
-- efficient.
-- Forwards_OK = False, Backwards_OK = True
-- Rnn : right_index := right_index'Last;
-- for Lnn in reverse left-index loop
-- left (Lnn) := right (Rnn);
-- Rnn := right_index'Pred (Rnn);
-- end loop;
-- Note: the above code MUST be analyzed with checks off, because
-- otherwise the Pred could overflow. But in any case this is more
-- efficient.
-- Forwards_OK = Backwards_OK = False
-- This only happens if we have the same array on each side. It is
-- possible to create situations using overlays that violate this,
-- but we simply do not promise to get this "right" in this case.
-- There are two possible subcases. If the No_Implicit_Conditionals
-- restriction is set, then we generate the following code:
-- declare
-- T : constant <operand-type> := rhs;
-- begin
-- lhs := T;
-- end;
-- If implicit conditionals are permitted, then we generate:
-- if Left_Lo <= Right_Lo then
-- <code for Forwards_OK = True above>
-- else
-- <code for Backwards_OK = True above>
-- end if;
-- In order to detect possible aliasing, we examine the renamed
-- expression when the source or target is a renaming. However,
-- the renaming may be intended to capture an address that may be
-- affected by subsequent code, and therefore we must recover
-- the actual entity for the expansion that follows, not the
-- object it renames. In particular, if source or target designate
-- a portion of a dynamically allocated object, the pointer to it
-- may be reassigned but the renaming preserves the proper location.
if Is_Entity_Name (Rhs)
and then
Nkind (Parent (Entity (Rhs))) = N_Object_Renaming_Declaration
and then Nkind (Act_Rhs) = N_Slice
then
Rarray := Rhs;
end if;
if Is_Entity_Name (Lhs)
and then
Nkind (Parent (Entity (Lhs))) = N_Object_Renaming_Declaration
and then Nkind (Act_Lhs) = N_Slice
then
Larray := Lhs;
end if;
-- Cases where either Forwards_OK or Backwards_OK is true
if Forwards_OK (N) or else Backwards_OK (N) then
if Needs_Finalization (Component_Type (L_Type))
and then Base_Type (L_Type) = Base_Type (R_Type)
and then Ndim = 1
and then not No_Ctrl_Actions (N)
then
declare
Proc : constant Entity_Id :=
TSS (Base_Type (L_Type), TSS_Slice_Assign);
Actuals : List_Id;
begin
Apply_Dereference (Larray);
Apply_Dereference (Rarray);
Actuals := New_List (
Duplicate_Subexpr (Larray, Name_Req => True),
Duplicate_Subexpr (Rarray, Name_Req => True),
Duplicate_Subexpr (Left_Lo, Name_Req => True),
Duplicate_Subexpr (Left_Hi, Name_Req => True),
Duplicate_Subexpr (Right_Lo, Name_Req => True),
Duplicate_Subexpr (Right_Hi, Name_Req => True));
Append_To (Actuals,
New_Occurrence_Of (
Boolean_Literals (not Forwards_OK (N)), Loc));
Rewrite (N,
Make_Procedure_Call_Statement (Loc,
Name => New_Occurrence_Of (Proc, Loc),
Parameter_Associations => Actuals));
end;
else
Rewrite (N,
Expand_Assign_Array_Loop
(N, Larray, Rarray, L_Type, R_Type, Ndim,
Rev => not Forwards_OK (N)));
end if;
-- Case of both are false with No_Implicit_Conditionals
elsif Restriction_Active (No_Implicit_Conditionals) then
declare
T : constant Entity_Id :=
Make_Defining_Identifier (Loc, Chars => Name_T);
begin
Rewrite (N,
Make_Block_Statement (Loc,
Declarations => New_List (
Make_Object_Declaration (Loc,
Defining_Identifier => T,
Constant_Present => True,
Object_Definition =>
New_Occurrence_Of (Etype (Rhs), Loc),
Expression => Relocate_Node (Rhs))),
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (
Make_Assignment_Statement (Loc,
Name => Relocate_Node (Lhs),
Expression => New_Occurrence_Of (T, Loc))))));
end;
-- Case of both are false with implicit conditionals allowed
else
-- Before we generate this code, we must ensure that the left and
-- right side array types are defined. They may be itypes, and we
-- cannot let them be defined inside the if, since the first use
-- in the then may not be executed.
Ensure_Defined (L_Type, N);
Ensure_Defined (R_Type, N);
-- We normally compare addresses to find out which way round to
-- do the loop, since this is reliable, and handles the cases of
-- parameters, conversions etc. But we can't do that in the bit
-- packed case, because addresses don't work there.
if not Is_Bit_Packed_Array (L_Type) then
Condition :=
Make_Op_Le (Loc,
Left_Opnd =>
Unchecked_Convert_To (RTE (RE_Integer_Address),
Make_Attribute_Reference (Loc,
Prefix =>
Make_Indexed_Component (Loc,
Prefix =>
Duplicate_Subexpr_Move_Checks (Larray, True),
Expressions => New_List (
Make_Attribute_Reference (Loc,
Prefix =>
New_Occurrence_Of
(L_Index_Typ, Loc),
Attribute_Name => Name_First))),
Attribute_Name => Name_Address)),
Right_Opnd =>
Unchecked_Convert_To (RTE (RE_Integer_Address),
Make_Attribute_Reference (Loc,
Prefix =>
Make_Indexed_Component (Loc,
Prefix =>
Duplicate_Subexpr_Move_Checks (Rarray, True),
Expressions => New_List (
Make_Attribute_Reference (Loc,
Prefix =>
New_Occurrence_Of
(R_Index_Typ, Loc),
Attribute_Name => Name_First))),
Attribute_Name => Name_Address)));
-- For the bit packed and VM cases we use the bounds. That's OK,
-- because we don't have to worry about parameters, since they
-- cannot cause overlap. Perhaps we should worry about weird slice
-- conversions ???
else
-- Copy the bounds
Cleft_Lo := New_Copy_Tree (Left_Lo);
Cright_Lo := New_Copy_Tree (Right_Lo);
-- If the types do not match we add an implicit conversion
-- here to ensure proper match
if Etype (Left_Lo) /= Etype (Right_Lo) then
Cright_Lo :=
Unchecked_Convert_To (Etype (Left_Lo), Cright_Lo);
end if;
-- Reset the Analyzed flag, because the bounds of the index
-- type itself may be universal, and must must be reanalyzed
-- to acquire the proper type for the back end.
Set_Analyzed (Cleft_Lo, False);
Set_Analyzed (Cright_Lo, False);
Condition :=
Make_Op_Le (Loc,
Left_Opnd => Cleft_Lo,
Right_Opnd => Cright_Lo);
end if;
if Needs_Finalization (Component_Type (L_Type))
and then Base_Type (L_Type) = Base_Type (R_Type)
and then Ndim = 1
and then not No_Ctrl_Actions (N)
then
-- Call TSS procedure for array assignment, passing the
-- explicit bounds of right- and left-hand sides.
declare
Proc : constant Entity_Id :=
TSS (Base_Type (L_Type), TSS_Slice_Assign);
Actuals : List_Id;
begin
Apply_Dereference (Larray);
Apply_Dereference (Rarray);
Actuals := New_List (
Duplicate_Subexpr (Larray, Name_Req => True),
Duplicate_Subexpr (Rarray, Name_Req => True),
Duplicate_Subexpr (Left_Lo, Name_Req => True),
Duplicate_Subexpr (Left_Hi, Name_Req => True),
Duplicate_Subexpr (Right_Lo, Name_Req => True),
Duplicate_Subexpr (Right_Hi, Name_Req => True));
Append_To (Actuals,
Make_Op_Not (Loc,
Right_Opnd => Condition));
Rewrite (N,
Make_Procedure_Call_Statement (Loc,
Name => New_Occurrence_Of (Proc, Loc),
Parameter_Associations => Actuals));
end;
else
Rewrite (N,
Make_Implicit_If_Statement (N,
Condition => Condition,
Then_Statements => New_List (
Expand_Assign_Array_Loop
(N, Larray, Rarray, L_Type, R_Type, Ndim,
Rev => False)),
Else_Statements => New_List (
Expand_Assign_Array_Loop
(N, Larray, Rarray, L_Type, R_Type, Ndim,
Rev => True))));
end if;
end if;
Analyze (N, Suppress => All_Checks);
end;
exception
when RE_Not_Available =>
return;
end Expand_Assign_Array;
------------------------------
-- Expand_Assign_Array_Loop --
------------------------------
-- The following is an example of the loop generated for the case of a
-- two-dimensional array:
-- declare
-- R2b : Tm1X1 := 1;
-- begin
-- for L1b in 1 .. 100 loop
-- declare
-- R4b : Tm1X2 := 1;
-- begin
-- for L3b in 1 .. 100 loop
-- vm1 (L1b, L3b) := vm2 (R2b, R4b);
-- R4b := Tm1X2'succ(R4b);
-- end loop;
-- end;
-- R2b := Tm1X1'succ(R2b);
-- end loop;
-- end;
-- Here Rev is False, and Tm1Xn are the subscript types for the right-hand
-- side. The declarations of R2b and R4b are inserted before the original
-- assignment statement.
function Expand_Assign_Array_Loop
(N : Node_Id;
Larray : Entity_Id;
Rarray : Entity_Id;
L_Type : Entity_Id;
R_Type : Entity_Id;
Ndim : Pos;
Rev : Boolean) return Node_Id
is
Loc : constant Source_Ptr := Sloc (N);
Lnn : array (1 .. Ndim) of Entity_Id;
Rnn : array (1 .. Ndim) of Entity_Id;
-- Entities used as subscripts on left and right sides
L_Index_Type : array (1 .. Ndim) of Entity_Id;
R_Index_Type : array (1 .. Ndim) of Entity_Id;
-- Left and right index types
Assign : Node_Id;
F_Or_L : Name_Id;
S_Or_P : Name_Id;
function Build_Step (J : Nat) return Node_Id;
-- The increment step for the index of the right-hand side is written
-- as an attribute reference (Succ or Pred). This function returns
-- the corresponding node, which is placed at the end of the loop body.
----------------
-- Build_Step --
----------------
function Build_Step (J : Nat) return Node_Id is
Step : Node_Id;
Lim : Name_Id;
begin
if Rev then
Lim := Name_First;
else
Lim := Name_Last;
end if;
Step :=
Make_Assignment_Statement (Loc,
Name => New_Occurrence_Of (Rnn (J), Loc),
Expression =>
Make_Attribute_Reference (Loc,
Prefix =>
New_Occurrence_Of (R_Index_Type (J), Loc),
Attribute_Name => S_Or_P,
Expressions => New_List (
New_Occurrence_Of (Rnn (J), Loc))));
-- Note that on the last iteration of the loop, the index is increased
-- (or decreased) past the corresponding bound. This is consistent with
-- the C semantics of the back-end, where such an off-by-one value on a
-- dead index variable is OK. However, in CodePeer mode this leads to
-- spurious warnings, and thus we place a guard around the attribute
-- reference. For obvious reasons we only do this for CodePeer.
if CodePeer_Mode then
Step :=
Make_If_Statement (Loc,
Condition =>
Make_Op_Ne (Loc,
Left_Opnd => New_Occurrence_Of (Lnn (J), Loc),
Right_Opnd =>
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (L_Index_Type (J), Loc),
Attribute_Name => Lim)),
Then_Statements => New_List (Step));
end if;
return Step;
end Build_Step;
-- Start of processing for Expand_Assign_Array_Loop
begin
if Rev then
F_Or_L := Name_Last;
S_Or_P := Name_Pred;
else
F_Or_L := Name_First;
S_Or_P := Name_Succ;
end if;
-- Setup index types and subscript entities
declare
L_Index : Node_Id;
R_Index : Node_Id;
begin
L_Index := First_Index (L_Type);
R_Index := First_Index (R_Type);
for J in 1 .. Ndim loop
Lnn (J) := Make_Temporary (Loc, 'L');
Rnn (J) := Make_Temporary (Loc, 'R');
L_Index_Type (J) := Etype (L_Index);
R_Index_Type (J) := Etype (R_Index);
Next_Index (L_Index);
Next_Index (R_Index);
end loop;
end;
-- Now construct the assignment statement
declare
ExprL : constant List_Id := New_List;
ExprR : constant List_Id := New_List;
begin
for J in 1 .. Ndim loop
Append_To (ExprL, New_Occurrence_Of (Lnn (J), Loc));
Append_To (ExprR, New_Occurrence_Of (Rnn (J), Loc));
end loop;
Assign :=
Make_Assignment_Statement (Loc,
Name =>
Make_Indexed_Component (Loc,
Prefix => Duplicate_Subexpr (Larray, Name_Req => True),
Expressions => ExprL),
Expression =>
Make_Indexed_Component (Loc,
Prefix => Duplicate_Subexpr (Rarray, Name_Req => True),
Expressions => ExprR));
-- We set assignment OK, since there are some cases, e.g. in object
-- declarations, where we are actually assigning into a constant.
-- If there really is an illegality, it was caught long before now,
-- and was flagged when the original assignment was analyzed.
Set_Assignment_OK (Name (Assign));
-- Propagate the No_Ctrl_Actions flag to individual assignments
Set_No_Ctrl_Actions (Assign, No_Ctrl_Actions (N));
end;
-- Now construct the loop from the inside out, with the last subscript
-- varying most rapidly. Note that Assign is first the raw assignment
-- statement, and then subsequently the loop that wraps it up.
for J in reverse 1 .. Ndim loop
Assign :=
Make_Block_Statement (Loc,
Declarations => New_List (
Make_Object_Declaration (Loc,
Defining_Identifier => Rnn (J),
Object_Definition =>
New_Occurrence_Of (R_Index_Type (J), Loc),
Expression =>
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (R_Index_Type (J), Loc),
Attribute_Name => F_Or_L))),
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (
Make_Implicit_Loop_Statement (N,
Iteration_Scheme =>
Make_Iteration_Scheme (Loc,
Loop_Parameter_Specification =>
Make_Loop_Parameter_Specification (Loc,
Defining_Identifier => Lnn (J),
Reverse_Present => Rev,
Discrete_Subtype_Definition =>
New_Occurrence_Of (L_Index_Type (J), Loc))),
Statements => New_List (Assign, Build_Step (J))))));
end loop;
return Assign;
end Expand_Assign_Array_Loop;
--------------------------
-- Expand_Assign_Record --
--------------------------
procedure Expand_Assign_Record (N : Node_Id) is
Lhs : constant Node_Id := Name (N);
Rhs : Node_Id := Expression (N);
L_Typ : constant Entity_Id := Base_Type (Etype (Lhs));
begin
-- If change of representation, then extract the real right-hand side
-- from the type conversion, and proceed with component-wise assignment,
-- since the two types are not the same as far as the back end is
-- concerned.
if Change_Of_Representation (N) then
Rhs := Expression (Rhs);
-- If this may be a case of a large bit aligned component, then proceed
-- with component-wise assignment, to avoid possible clobbering of other
-- components sharing bits in the first or last byte of the component to
-- be assigned.
elsif Possible_Bit_Aligned_Component (Lhs)
or
Possible_Bit_Aligned_Component (Rhs)
then
null;
-- If we have a tagged type that has a complete record representation
-- clause, we must do we must do component-wise assignments, since child
-- types may have used gaps for their components, and we might be
-- dealing with a view conversion.
elsif Is_Fully_Repped_Tagged_Type (L_Typ) then
null;
-- If neither condition met, then nothing special to do, the back end
-- can handle assignment of the entire component as a single entity.
else
return;
end if;
-- At this stage we know that we must do a component wise assignment
declare
Loc : constant Source_Ptr := Sloc (N);
R_Typ : constant Entity_Id := Base_Type (Etype (Rhs));
Decl : constant Node_Id := Declaration_Node (R_Typ);
RDef : Node_Id;
F : Entity_Id;
function Find_Component
(Typ : Entity_Id;
Comp : Entity_Id) return Entity_Id;
-- Find the component with the given name in the underlying record
-- declaration for Typ. We need to use the actual entity because the
-- type may be private and resolution by identifier alone would fail.
function Make_Component_List_Assign
(CL : Node_Id;
U_U : Boolean := False) return List_Id;
-- Returns a sequence of statements to assign the components that
-- are referenced in the given component list. The flag U_U is
-- used to force the usage of the inferred value of the variant
-- part expression as the switch for the generated case statement.
function Make_Field_Assign
(C : Entity_Id;
U_U : Boolean := False) return Node_Id;
-- Given C, the entity for a discriminant or component, build an
-- assignment for the corresponding field values. The flag U_U
-- signals the presence of an Unchecked_Union and forces the usage
-- of the inferred discriminant value of C as the right-hand side
-- of the assignment.
function Make_Field_Assigns (CI : List_Id) return List_Id;
-- Given CI, a component items list, construct series of statements
-- for fieldwise assignment of the corresponding components.
--------------------
-- Find_Component --
--------------------
function Find_Component
(Typ : Entity_Id;
Comp : Entity_Id) return Entity_Id
is
Utyp : constant Entity_Id := Underlying_Type (Typ);
C : Entity_Id;
begin
C := First_Entity (Utyp);
while Present (C) loop
if Chars (C) = Chars (Comp) then
return C;
end if;
Next_Entity (C);
end loop;
raise Program_Error;
end Find_Component;
--------------------------------
-- Make_Component_List_Assign --
--------------------------------
function Make_Component_List_Assign
(CL : Node_Id;
U_U : Boolean := False) return List_Id
is
CI : constant List_Id := Component_Items (CL);
VP : constant Node_Id := Variant_Part (CL);
Alts : List_Id;
DC : Node_Id;
DCH : List_Id;
Expr : Node_Id;
Result : List_Id;
V : Node_Id;
begin
Result := Make_Field_Assigns (CI);
if Present (VP) then
V := First_Non_Pragma (Variants (VP));
Alts := New_List;
while Present (V) loop
DCH := New_List;
DC := First (Discrete_Choices (V));
while Present (DC) loop
Append_To (DCH, New_Copy_Tree (DC));
Next (DC);
end loop;
Append_To (Alts,
Make_Case_Statement_Alternative (Loc,
Discrete_Choices => DCH,
Statements =>
Make_Component_List_Assign (Component_List (V))));
Next_Non_Pragma (V);
end loop;
-- If we have an Unchecked_Union, use the value of the inferred
-- discriminant of the variant part expression as the switch
-- for the case statement. The case statement may later be
-- folded.
if U_U then
Expr :=
New_Copy (Get_Discriminant_Value (
Entity (Name (VP)),
Etype (Rhs),
Discriminant_Constraint (Etype (Rhs))));
else
Expr :=
Make_Selected_Component (Loc,
Prefix => Duplicate_Subexpr (Rhs),
Selector_Name =>
Make_Identifier (Loc, Chars (Name (VP))));
end if;
Append_To (Result,
Make_Case_Statement (Loc,
Expression => Expr,
Alternatives => Alts));
end if;
return Result;
end Make_Component_List_Assign;
-----------------------
-- Make_Field_Assign --
-----------------------
function Make_Field_Assign
(C : Entity_Id;
U_U : Boolean := False) return Node_Id
is
A : Node_Id;
Expr : Node_Id;
begin
-- In the case of an Unchecked_Union, use the discriminant
-- constraint value as on the right-hand side of the assignment.
if U_U then
Expr :=
New_Copy (Get_Discriminant_Value (C,
Etype (Rhs),
Discriminant_Constraint (Etype (Rhs))));
else
Expr :=
Make_Selected_Component (Loc,
Prefix => Duplicate_Subexpr (Rhs),
Selector_Name => New_Occurrence_Of (C, Loc));
end if;
A :=
Make_Assignment_Statement (Loc,
Name =>
Make_Selected_Component (Loc,
Prefix => Duplicate_Subexpr (Lhs),
Selector_Name =>
New_Occurrence_Of (Find_Component (L_Typ, C), Loc)),
Expression => Expr);
-- Set Assignment_OK, so discriminants can be assigned
Set_Assignment_OK (Name (A), True);
if Componentwise_Assignment (N)
and then Nkind (Name (A)) = N_Selected_Component
and then Chars (Selector_Name (Name (A))) = Name_uParent
then
Set_Componentwise_Assignment (A);
end if;
return A;
end Make_Field_Assign;
------------------------
-- Make_Field_Assigns --
------------------------
function Make_Field_Assigns (CI : List_Id) return List_Id is
Item : Node_Id;
Result : List_Id;
begin
Item := First (CI);
Result := New_List;
while Present (Item) loop
-- Look for components, but exclude _tag field assignment if
-- the special Componentwise_Assignment flag is set.
if Nkind (Item) = N_Component_Declaration
and then not (Is_Tag (Defining_Identifier (Item))
and then Componentwise_Assignment (N))
then
Append_To
(Result, Make_Field_Assign (Defining_Identifier (Item)));
end if;
Next (Item);
end loop;
return Result;
end Make_Field_Assigns;
-- Start of processing for Expand_Assign_Record
begin
-- Note that we use the base types for this processing. This results
-- in some extra work in the constrained case, but the change of
-- representation case is so unusual that it is not worth the effort.
-- First copy the discriminants. This is done unconditionally. It
-- is required in the unconstrained left side case, and also in the
-- case where this assignment was constructed during the expansion
-- of a type conversion (since initialization of discriminants is
-- suppressed in this case). It is unnecessary but harmless in
-- other cases.
if Has_Discriminants (L_Typ) then
F := First_Discriminant (R_Typ);
while Present (F) loop
-- If we are expanding the initialization of a derived record
-- that constrains or renames discriminants of the parent, we
-- must use the corresponding discriminant in the parent.
declare
CF : Entity_Id;
begin
if Inside_Init_Proc
and then Present (Corresponding_Discriminant (F))
then
CF := Corresponding_Discriminant (F);
else
CF := F;
end if;
if Is_Unchecked_Union (Base_Type (R_Typ)) then
-- Within an initialization procedure this is the
-- assignment to an unchecked union component, in which
-- case there is no discriminant to initialize.
if Inside_Init_Proc then
null;
else
-- The assignment is part of a conversion from a
-- derived unchecked union type with an inferable
-- discriminant, to a parent type.
Insert_Action (N, Make_Field_Assign (CF, True));
end if;
else
Insert_Action (N, Make_Field_Assign (CF));
end if;
Next_Discriminant (F);
end;
end loop;
end if;
-- We know the underlying type is a record, but its current view
-- may be private. We must retrieve the usable record declaration.
if Nkind_In (Decl, N_Private_Type_Declaration,
N_Private_Extension_Declaration)
and then Present (Full_View (R_Typ))
then
RDef := Type_Definition (Declaration_Node (Full_View (R_Typ)));
else
RDef := Type_Definition (Decl);
end if;
if Nkind (RDef) = N_Derived_Type_Definition then
RDef := Record_Extension_Part (RDef);
end if;
if Nkind (RDef) = N_Record_Definition
and then Present (Component_List (RDef))
then
if Is_Unchecked_Union (R_Typ) then
Insert_Actions (N,
Make_Component_List_Assign (Component_List (RDef), True));
else
Insert_Actions
(N, Make_Component_List_Assign (Component_List (RDef)));
end if;
Rewrite (N, Make_Null_Statement (Loc));
end if;
end;
end Expand_Assign_Record;
-------------------------------------
-- Expand_Assign_With_Target_Names --
-------------------------------------
procedure Expand_Assign_With_Target_Names (N : Node_Id) is
LHS : constant Node_Id := Name (N);
LHS_Typ : constant Entity_Id := Etype (LHS);
Loc : constant Source_Ptr := Sloc (N);
RHS : constant Node_Id := Expression (N);
Ent : Entity_Id;
-- The entity of the left-hand side
function Replace_Target (N : Node_Id) return Traverse_Result;
-- Replace occurrences of the target name by the proper entity: either
-- the entity of the LHS in simple cases, or the formal of the
-- constructed procedure otherwise.
--------------------
-- Replace_Target --
--------------------
function Replace_Target (N : Node_Id) return Traverse_Result is
begin
if Nkind (N) = N_Target_Name then
Rewrite (N, New_Occurrence_Of (Ent, Sloc (N)));
end if;
Set_Analyzed (N, False);
return OK;
end Replace_Target;
procedure Replace_Target_Name is new Traverse_Proc (Replace_Target);
-- Local variables
New_RHS : Node_Id;
Proc_Id : Entity_Id;
-- Start of processing for Expand_Assign_With_Target_Names
begin
New_RHS := New_Copy_Tree (RHS);
-- The left-hand side is a direct name
if Is_Entity_Name (LHS)
and then not Is_Renaming_Of_Object (Entity (LHS))
then
Ent := Entity (LHS);
Replace_Target_Name (New_RHS);
-- Generate:
-- LHS := ... LHS ...;
Rewrite (N,
Make_Assignment_Statement (Loc,
Name => Relocate_Node (LHS),
Expression => New_RHS));
-- The left-hand side is not a direct name, but is side-effect free.
-- Capture its value in a temporary to avoid multiple evaluations.
elsif Side_Effect_Free (LHS) then
Ent := Make_Temporary (Loc, 'T');
Replace_Target_Name (New_RHS);
-- Generate:
-- T : LHS_Typ := LHS;
Insert_Before_And_Analyze (N,
Make_Object_Declaration (Loc,
Defining_Identifier => Ent,
Object_Definition => New_Occurrence_Of (LHS_Typ, Loc),
Expression => New_Copy_Tree (LHS)));
-- Generate:
-- LHS := ... T ...;
Rewrite (N,
Make_Assignment_Statement (Loc,
Name => Relocate_Node (LHS),
Expression => New_RHS));
-- Otherwise wrap the whole assignment statement in a procedure with an
-- IN OUT parameter. The original assignment then becomes a call to the
-- procedure with the left-hand side as an actual.
else
Ent := Make_Temporary (Loc, 'T');
Replace_Target_Name (New_RHS);
-- Generate:
-- procedure P (T : in out LHS_Typ) is
-- begin
-- T := ... T ...;
-- end P;
Proc_Id := Make_Temporary (Loc, 'P');
Insert_Before_And_Analyze (N,
Make_Subprogram_Body (Loc,
Specification =>
Make_Procedure_Specification (Loc,
Defining_Unit_Name => Proc_Id,
Parameter_Specifications => New_List (
Make_Parameter_Specification (Loc,
Defining_Identifier => Ent,
In_Present => True,
Out_Present => True,
Parameter_Type =>
New_Occurrence_Of (LHS_Typ, Loc)))),
Declarations => Empty_List,
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (
Make_Assignment_Statement (Loc,
Name => New_Occurrence_Of (Ent, Loc),
Expression => New_RHS)))));
-- Generate:
-- P (LHS);
Rewrite (N,
Make_Procedure_Call_Statement (Loc,
Name => New_Occurrence_Of (Proc_Id, Loc),
Parameter_Associations => New_List (Relocate_Node (LHS))));
end if;
-- Analyze rewritten node, either as assignment or procedure call
Analyze (N);
end Expand_Assign_With_Target_Names;
-----------------------------------
-- Expand_N_Assignment_Statement --
-----------------------------------
-- This procedure implements various cases where an assignment statement
-- cannot just be passed on to the back end in untransformed state.
procedure Expand_N_Assignment_Statement (N : Node_Id) is
Crep : constant Boolean := Change_Of_Representation (N);
Lhs : constant Node_Id := Name (N);
Loc : constant Source_Ptr := Sloc (N);
Rhs : constant Node_Id := Expression (N);
Typ : constant Entity_Id := Underlying_Type (Etype (Lhs));
Exp : Node_Id;
begin
-- Special case to check right away, if the Componentwise_Assignment
-- flag is set, this is a reanalysis from the expansion of the primitive
-- assignment procedure for a tagged type, and all we need to do is to
-- expand to assignment of components, because otherwise, we would get
-- infinite recursion (since this looks like a tagged assignment which
-- would normally try to *call* the primitive assignment procedure).
if Componentwise_Assignment (N) then
Expand_Assign_Record (N);
return;
end if;
-- Defend against invalid subscripts on left side if we are in standard
-- validity checking mode. No need to do this if we are checking all
-- subscripts.
-- Note that we do this right away, because there are some early return
-- paths in this procedure, and this is required on all paths.
if Validity_Checks_On
and then Validity_Check_Default
and then not Validity_Check_Subscripts
then
Check_Valid_Lvalue_Subscripts (Lhs);
end if;
-- Separate expansion if RHS contain target names. Note that assignment
-- may already have been expanded if RHS is aggregate.
if Nkind (N) = N_Assignment_Statement and then Has_Target_Names (N) then
Expand_Assign_With_Target_Names (N);
return;
end if;
-- Ada 2005 (AI-327): Handle assignment to priority of protected object
-- Rewrite an assignment to X'Priority into a run-time call
-- For example: X'Priority := New_Prio_Expr;
-- ...is expanded into Set_Ceiling (X._Object, New_Prio_Expr);
-- Note that although X'Priority is notionally an object, it is quite
-- deliberately not defined as an aliased object in the RM. This means
-- that it works fine to rewrite it as a call, without having to worry
-- about complications that would other arise from X'Priority'Access,
-- which is illegal, because of the lack of aliasing.
if Ada_Version >= Ada_2005 then
declare
Call : Node_Id;
Conctyp : Entity_Id;
Ent : Entity_Id;
Subprg : Entity_Id;
RT_Subprg_Name : Node_Id;
begin
-- Handle chains of renamings
Ent := Name (N);
while Nkind (Ent) in N_Has_Entity
and then Present (Entity (Ent))
and then Present (Renamed_Object (Entity (Ent)))
loop
Ent := Renamed_Object (Entity (Ent));
end loop;
-- The attribute Priority applied to protected objects has been
-- previously expanded into a call to the Get_Ceiling run-time
-- subprogram. In restricted profiles this is not available.
if Is_Expanded_Priority_Attribute (Ent) then
-- Look for the enclosing concurrent type
Conctyp := Current_Scope;
while not Is_Concurrent_Type (Conctyp) loop
Conctyp := Scope (Conctyp);
end loop;
pragma Assert (Is_Protected_Type (Conctyp));
-- Generate the first actual of the call
Subprg := Current_Scope;
while not Present (Protected_Body_Subprogram (Subprg)) loop
Subprg := Scope (Subprg);
end loop;
-- Select the appropriate run-time call
if Number_Entries (Conctyp) = 0 then
RT_Subprg_Name :=
New_Occurrence_Of (RTE (RE_Set_Ceiling), Loc);
else
RT_Subprg_Name :=
New_Occurrence_Of (RTE (RO_PE_Set_Ceiling), Loc);
end if;
Call :=
Make_Procedure_Call_Statement (Loc,
Name => RT_Subprg_Name,
Parameter_Associations => New_List (
New_Copy_Tree (First (Parameter_Associations (Ent))),
Relocate_Node (Expression (N))));
Rewrite (N, Call);
Analyze (N);
return;
end if;
end;
end if;
-- Deal with assignment checks unless suppressed
if not Suppress_Assignment_Checks (N) then
-- First deal with generation of range check if required
if Do_Range_Check (Rhs) then
Generate_Range_Check (Rhs, Typ, CE_Range_Check_Failed);
end if;
-- Then generate predicate check if required
Apply_Predicate_Check (Rhs, Typ);
end if;
-- Check for a special case where a high level transformation is
-- required. If we have either of:
-- P.field := rhs;
-- P (sub) := rhs;
-- where P is a reference to a bit packed array, then we have to unwind
-- the assignment. The exact meaning of being a reference to a bit
-- packed array is as follows:
-- An indexed component whose prefix is a bit packed array is a
-- reference to a bit packed array.
-- An indexed component or selected component whose prefix is a
-- reference to a bit packed array is itself a reference ot a
-- bit packed array.
-- The required transformation is
-- Tnn : prefix_type := P;
-- Tnn.field := rhs;
-- P := Tnn;
-- or
-- Tnn : prefix_type := P;
-- Tnn (subscr) := rhs;
-- P := Tnn;
-- Since P is going to be evaluated more than once, any subscripts
-- in P must have their evaluation forced.
if Nkind_In (Lhs, N_Indexed_Component, N_Selected_Component)
and then Is_Ref_To_Bit_Packed_Array (Prefix (Lhs))
then
declare
BPAR_Expr : constant Node_Id := Relocate_Node (Prefix (Lhs));
BPAR_Typ : constant Entity_Id := Etype (BPAR_Expr);
Tnn : constant Entity_Id :=
Make_Temporary (Loc, 'T', BPAR_Expr);
begin
-- Insert the post assignment first, because we want to copy the
-- BPAR_Expr tree before it gets analyzed in the context of the
-- pre assignment. Note that we do not analyze the post assignment
-- yet (we cannot till we have completed the analysis of the pre
-- assignment). As usual, the analysis of this post assignment
-- will happen on its own when we "run into" it after finishing
-- the current assignment.
Insert_After (N,
Make_Assignment_Statement (Loc,
Name => New_Copy_Tree (BPAR_Expr),
Expression => New_Occurrence_Of (Tnn, Loc)));
-- At this stage BPAR_Expr is a reference to a bit packed array
-- where the reference was not expanded in the original tree,
-- since it was on the left side of an assignment. But in the
-- pre-assignment statement (the object definition), BPAR_Expr
-- will end up on the right-hand side, and must be reexpanded. To
-- achieve this, we reset the analyzed flag of all selected and
-- indexed components down to the actual indexed component for
-- the packed array.
Exp := BPAR_Expr;
loop
Set_Analyzed (Exp, False);
if Nkind_In (Exp, N_Indexed_Component,
N_Selected_Component)
then
Exp := Prefix (Exp);
else
exit;
end if;
end loop;
-- Now we can insert and analyze the pre-assignment
-- If the right-hand side requires a transient scope, it has
-- already been placed on the stack. However, the declaration is
-- inserted in the tree outside of this scope, and must reflect
-- the proper scope for its variable. This awkward bit is forced
-- by the stricter scope discipline imposed by GCC 2.97.
declare
Uses_Transient_Scope : constant Boolean :=
Scope_Is_Transient
and then N = Node_To_Be_Wrapped;
begin
if Uses_Transient_Scope then
Push_Scope (Scope (Current_Scope));
end if;
Insert_Before_And_Analyze (N,
Make_Object_Declaration (Loc,
Defining_Identifier => Tnn,
Object_Definition => New_Occurrence_Of (BPAR_Typ, Loc),
Expression => BPAR_Expr));
if Uses_Transient_Scope then
Pop_Scope;
end if;
end;
-- Now fix up the original assignment and continue processing
Rewrite (Prefix (Lhs),
New_Occurrence_Of (Tnn, Loc));
-- We do not need to reanalyze that assignment, and we do not need
-- to worry about references to the temporary, but we do need to
-- make sure that the temporary is not marked as a true constant
-- since we now have a generated assignment to it.
Set_Is_True_Constant (Tnn, False);
end;
end if;
-- When we have the appropriate type of aggregate in the expression (it
-- has been determined during analysis of the aggregate by setting the
-- delay flag), let's perform in place assignment and thus avoid
-- creating a temporary.
if Is_Delayed_Aggregate (Rhs) then
Convert_Aggr_In_Assignment (N);
Rewrite (N, Make_Null_Statement (Loc));
Analyze (N);
return;
end if;
-- Apply discriminant check if required. If Lhs is an access type to a
-- designated type with discriminants, we must always check. If the
-- type has unknown discriminants, more elaborate processing below.
if Has_Discriminants (Etype (Lhs))
and then not Has_Unknown_Discriminants (Etype (Lhs))
then
-- Skip discriminant check if change of representation. Will be
-- done when the change of representation is expanded out.
if not Crep then
Apply_Discriminant_Check (Rhs, Etype (Lhs), Lhs);
end if;
-- If the type is private without discriminants, and the full type
-- has discriminants (necessarily with defaults) a check may still be
-- necessary if the Lhs is aliased. The private discriminants must be
-- visible to build the discriminant constraints.
-- Only an explicit dereference that comes from source indicates
-- aliasing. Access to formals of protected operations and entries
-- create dereferences but are not semantic aliasings.
elsif Is_Private_Type (Etype (Lhs))
and then Has_Discriminants (Typ)
and then Nkind (Lhs) = N_Explicit_Dereference
and then Comes_From_Source (Lhs)
then
declare
Lt : constant Entity_Id := Etype (Lhs);
Ubt : Entity_Id := Base_Type (Typ);
begin
-- In the case of an expander-generated record subtype whose base
-- type still appears private, Typ will have been set to that
-- private type rather than the underlying record type (because
-- Underlying type will have returned the record subtype), so it's
-- necessary to apply Underlying_Type again to the base type to
-- get the record type we need for the discriminant check. Such
-- subtypes can be created for assignments in certain cases, such
-- as within an instantiation passed this kind of private type.
-- It would be good to avoid this special test, but making changes
-- to prevent this odd form of record subtype seems difficult. ???
if Is_Private_Type (Ubt) then
Ubt := Underlying_Type (Ubt);
end if;
Set_Etype (Lhs, Ubt);
Rewrite (Rhs, OK_Convert_To (Base_Type (Ubt), Rhs));
Apply_Discriminant_Check (Rhs, Ubt, Lhs);
Set_Etype (Lhs, Lt);
end;
-- If the Lhs has a private type with unknown discriminants, it may
-- have a full view with discriminants, but those are nameable only
-- in the underlying type, so convert the Rhs to it before potential
-- checking. Convert Lhs as well, otherwise the actual subtype might
-- not be constructible. If the discriminants have defaults the type
-- is unconstrained and there is nothing to check.
elsif Has_Unknown_Discriminants (Base_Type (Etype (Lhs)))
and then Has_Discriminants (Typ)
and then not Has_Defaulted_Discriminants (Typ)
then
Rewrite (Rhs, OK_Convert_To (Base_Type (Typ), Rhs));
Rewrite (Lhs, OK_Convert_To (Base_Type (Typ), Lhs));
Apply_Discriminant_Check (Rhs, Typ, Lhs);
-- In the access type case, we need the same discriminant check, and
-- also range checks if we have an access to constrained array.
elsif Is_Access_Type (Etype (Lhs))
and then Is_Constrained (Designated_Type (Etype (Lhs)))
then
if Has_Discriminants (Designated_Type (Etype (Lhs))) then
-- Skip discriminant check if change of representation. Will be
-- done when the change of representation is expanded out.
if not Crep then
Apply_Discriminant_Check (Rhs, Etype (Lhs));
end if;
elsif Is_Array_Type (Designated_Type (Etype (Lhs))) then
Apply_Range_Check (Rhs, Etype (Lhs));
if Is_Constrained (Etype (Lhs)) then
Apply_Length_Check (Rhs, Etype (Lhs));
end if;
if Nkind (Rhs) = N_Allocator then
declare
Target_Typ : constant Entity_Id := Etype (Expression (Rhs));
C_Es : Check_Result;
begin
C_Es :=
Get_Range_Checks
(Lhs,
Target_Typ,
Etype (Designated_Type (Etype (Lhs))));
Insert_Range_Checks
(C_Es,
N,
Target_Typ,
Sloc (Lhs),
Lhs);
end;
end if;
end if;
-- Apply range check for access type case
elsif Is_Access_Type (Etype (Lhs))
and then Nkind (Rhs) = N_Allocator
and then Nkind (Expression (Rhs)) = N_Qualified_Expression
then
Analyze_And_Resolve (Expression (Rhs));
Apply_Range_Check
(Expression (Rhs), Designated_Type (Etype (Lhs)));
end if;
-- Ada 2005 (AI-231): Generate the run-time check
if Is_Access_Type (Typ)
and then Can_Never_Be_Null (Etype (Lhs))
and then not Can_Never_Be_Null (Etype (Rhs))
-- If an actual is an out parameter of a null-excluding access
-- type, there is access check on entry, so we set the flag
-- Suppress_Assignment_Checks on the generated statement to
-- assign the actual to the parameter block, and we do not want
-- to generate an additional check at this point.
and then not Suppress_Assignment_Checks (N)
then
Apply_Constraint_Check (Rhs, Etype (Lhs));
end if;
-- Ada 2012 (AI05-148): Update current accessibility level if Rhs is a
-- stand-alone obj of an anonymous access type. Do not install the check
-- when the Lhs denotes a container cursor and the Next function employs
-- an access type, because this can never result in a dangling pointer.
if Is_Access_Type (Typ)
and then Is_Entity_Name (Lhs)
and then Ekind (Entity (Lhs)) /= E_Loop_Parameter
and then Present (Effective_Extra_Accessibility (Entity (Lhs)))
then
declare
function Lhs_Entity return Entity_Id;
-- Look through renames to find the underlying entity.
-- For assignment to a rename, we don't care about the
-- Enclosing_Dynamic_Scope of the rename declaration.
----------------
-- Lhs_Entity --
----------------
function Lhs_Entity return Entity_Id is
Result : Entity_Id := Entity (Lhs);
begin
while Present (Renamed_Object (Result)) loop
-- Renamed_Object must return an Entity_Name here
-- because of preceding "Present (E_E_A (...))" test.
Result := Entity (Renamed_Object (Result));
end loop;
return Result;
end Lhs_Entity;
-- Local Declarations
Access_Check : constant Node_Id :=
Make_Raise_Program_Error (Loc,
Condition =>
Make_Op_Gt (Loc,
Left_Opnd =>
Dynamic_Accessibility_Level (Rhs),
Right_Opnd =>
Make_Integer_Literal (Loc,
Intval =>
Scope_Depth
(Enclosing_Dynamic_Scope
(Lhs_Entity)))),
Reason => PE_Accessibility_Check_Failed);
Access_Level_Update : constant Node_Id :=
Make_Assignment_Statement (Loc,
Name =>
New_Occurrence_Of
(Effective_Extra_Accessibility
(Entity (Lhs)), Loc),
Expression =>
Dynamic_Accessibility_Level (Rhs));
begin
if not Accessibility_Checks_Suppressed (Entity (Lhs)) then
Insert_Action (N, Access_Check);
end if;
Insert_Action (N, Access_Level_Update);
end;
end if;
-- Case of assignment to a bit packed array element. If there is a
-- change of representation this must be expanded into components,
-- otherwise this is a bit-field assignment.
if Nkind (Lhs) = N_Indexed_Component
and then Is_Bit_Packed_Array (Etype (Prefix (Lhs)))
then
-- Normal case, no change of representation
if not Crep then
Expand_Bit_Packed_Element_Set (N);
return;
-- Change of representation case
else
-- Generate the following, to force component-by-component
-- assignments in an efficient way. Otherwise each component
-- will require a temporary and two bit-field manipulations.
-- T1 : Elmt_Type;
-- T1 := RhS;
-- Lhs := T1;
declare
Tnn : constant Entity_Id := Make_Temporary (Loc, 'T');
Stats : List_Id;
begin
Stats :=
New_List (
Make_Object_Declaration (Loc,
Defining_Identifier => Tnn,
Object_Definition =>
New_Occurrence_Of (Etype (Lhs), Loc)),
Make_Assignment_Statement (Loc,
Name => New_Occurrence_Of (Tnn, Loc),
Expression => Relocate_Node (Rhs)),
Make_Assignment_Statement (Loc,
Name => Relocate_Node (Lhs),
Expression => New_Occurrence_Of (Tnn, Loc)));
Insert_Actions (N, Stats);
Rewrite (N, Make_Null_Statement (Loc));
Analyze (N);
end;
end if;
-- Build-in-place function call case. Note that we're not yet doing
-- build-in-place for user-written assignment statements (the assignment
-- here came from an aggregate.)
elsif Ada_Version >= Ada_2005
and then Is_Build_In_Place_Function_Call (Rhs)
then
Make_Build_In_Place_Call_In_Assignment (N, Rhs);
elsif Is_Tagged_Type (Typ)
or else (Needs_Finalization (Typ) and then not Is_Array_Type (Typ))
then
Tagged_Case : declare
L : List_Id := No_List;
Expand_Ctrl_Actions : constant Boolean := not No_Ctrl_Actions (N);
begin
-- In the controlled case, we ensure that function calls are
-- evaluated before finalizing the target. In all cases, it makes
-- the expansion easier if the side effects are removed first.
Remove_Side_Effects (Lhs);
Remove_Side_Effects (Rhs);
-- Avoid recursion in the mechanism
Set_Analyzed (N);
-- If dispatching assignment, we need to dispatch to _assign
if Is_Class_Wide_Type (Typ)
-- If the type is tagged, we may as well use the predefined
-- primitive assignment. This avoids inlining a lot of code
-- and in the class-wide case, the assignment is replaced
-- by a dispatching call to _assign. It is suppressed in the
-- case of assignments created by the expander that correspond
-- to initializations, where we do want to copy the tag
-- (Expand_Ctrl_Actions flag is set False in this case). It is
-- also suppressed if restriction No_Dispatching_Calls is in
-- force because in that case predefined primitives are not
-- generated.
or else (Is_Tagged_Type (Typ)
and then Chars (Current_Scope) /= Name_uAssign
and then Expand_Ctrl_Actions
and then
not Restriction_Active (No_Dispatching_Calls))
then
if Is_Limited_Type (Typ) then
-- This can happen in an instance when the formal is an
-- extension of a limited interface, and the actual is
-- limited. This is an error according to AI05-0087, but
-- is not caught at the point of instantiation in earlier
-- versions.
-- This is wrong, error messages cannot be issued during
-- expansion, since they would be missed in -gnatc mode ???
Error_Msg_N ("assignment not available on limited type", N);
return;
end if;
-- Fetch the primitive op _assign and proper type to call it.
-- Because of possible conflicts between private and full view,
-- fetch the proper type directly from the operation profile.
declare
Op : constant Entity_Id :=
Find_Prim_Op (Typ, Name_uAssign);
F_Typ : Entity_Id := Etype (First_Formal (Op));
begin
-- If the assignment is dispatching, make sure to use the
-- proper type.
if Is_Class_Wide_Type (Typ) then
F_Typ := Class_Wide_Type (F_Typ);
end if;
L := New_List;
-- In case of assignment to a class-wide tagged type, before
-- the assignment we generate run-time check to ensure that
-- the tags of source and target match.
if not Tag_Checks_Suppressed (Typ)
and then Is_Class_Wide_Type (Typ)
and then Is_Tagged_Type (Typ)
and then Is_Tagged_Type (Underlying_Type (Etype (Rhs)))
then
declare
Lhs_Tag : Node_Id;
Rhs_Tag : Node_Id;
begin
if not Is_Interface (Typ) then
Lhs_Tag :=
Make_Selected_Component (Loc,
Prefix => Duplicate_Subexpr (Lhs),
Selector_Name =>
Make_Identifier (Loc, Name_uTag));
Rhs_Tag :=
Make_Selected_Component (Loc,
Prefix => Duplicate_Subexpr (Rhs),
Selector_Name =>
Make_Identifier (Loc, Name_uTag));
else
-- Displace the pointer to the base of the objects
-- applying 'Address, which is later expanded into
-- a call to RE_Base_Address.
Lhs_Tag :=
Make_Explicit_Dereference (Loc,
Prefix =>
Unchecked_Convert_To (RTE (RE_Tag_Ptr),
Make_Attribute_Reference (Loc,
Prefix => Duplicate_Subexpr (Lhs),
Attribute_Name => Name_Address)));
Rhs_Tag :=
Make_Explicit_Dereference (Loc,
Prefix =>
Unchecked_Convert_To (RTE (RE_Tag_Ptr),
Make_Attribute_Reference (Loc,
Prefix => Duplicate_Subexpr (Rhs),
Attribute_Name => Name_Address)));
end if;
Append_To (L,
Make_Raise_Constraint_Error (Loc,
Condition =>
Make_Op_Ne (Loc,
Left_Opnd => Lhs_Tag,
Right_Opnd => Rhs_Tag),
Reason => CE_Tag_Check_Failed));
end;
end if;
declare
Left_N : Node_Id := Duplicate_Subexpr (Lhs);
Right_N : Node_Id := Duplicate_Subexpr (Rhs);
begin
-- In order to dispatch the call to _assign the type of
-- the actuals must match. Add conversion (if required).
if Etype (Lhs) /= F_Typ then
Left_N := Unchecked_Convert_To (F_Typ, Left_N);
end if;
if Etype (Rhs) /= F_Typ then
Right_N := Unchecked_Convert_To (F_Typ, Right_N);
end if;
Append_To (L,
Make_Procedure_Call_Statement (Loc,
Name => New_Occurrence_Of (Op, Loc),
Parameter_Associations => New_List (
Node1 => Left_N,
Node2 => Right_N)));
end;
end;
else
L := Make_Tag_Ctrl_Assignment (N);
-- We can't afford to have destructive Finalization Actions in
-- the Self assignment case, so if the target and the source
-- are not obviously different, code is generated to avoid the
-- self assignment case:
-- if lhs'address /= rhs'address then
-- <code for controlled and/or tagged assignment>
-- end if;
-- Skip this if Restriction (No_Finalization) is active
if not Statically_Different (Lhs, Rhs)
and then Expand_Ctrl_Actions
and then not Restriction_Active (No_Finalization)
then
L := New_List (
Make_Implicit_If_Statement (N,
Condition =>
Make_Op_Ne (Loc,
Left_Opnd =>
Make_Attribute_Reference (Loc,
Prefix => Duplicate_Subexpr (Lhs),
Attribute_Name => Name_Address),
Right_Opnd =>
Make_Attribute_Reference (Loc,
Prefix => Duplicate_Subexpr (Rhs),
Attribute_Name => Name_Address)),
Then_Statements => L));
end if;
-- We need to set up an exception handler for implementing
-- 7.6.1(18). The remaining adjustments are tackled by the
-- implementation of adjust for record_controllers (see
-- s-finimp.adb).
-- This is skipped if we have no finalization
if Expand_Ctrl_Actions
and then not Restriction_Active (No_Finalization)
then
L := New_List (
Make_Block_Statement (Loc,
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => L,
Exception_Handlers => New_List (
Make_Handler_For_Ctrl_Operation (Loc)))));
end if;
end if;
Rewrite (N,
Make_Block_Statement (Loc,
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc, Statements => L)));
-- If no restrictions on aborts, protect the whole assignment
-- for controlled objects as per 9.8(11).
if Needs_Finalization (Typ)
and then Expand_Ctrl_Actions
and then Abort_Allowed
then
declare
Blk : constant Entity_Id :=
New_Internal_Entity
(E_Block, Current_Scope, Sloc (N), 'B');
AUD : constant Entity_Id := RTE (RE_Abort_Undefer_Direct);
begin
Set_Is_Abort_Block (N);
Set_Scope (Blk, Current_Scope);
Set_Etype (Blk, Standard_Void_Type);
Set_Identifier (N, New_Occurrence_Of (Blk, Sloc (N)));
Prepend_To (L, Build_Runtime_Call (Loc, RE_Abort_Defer));
Set_At_End_Proc (Handled_Statement_Sequence (N),
New_Occurrence_Of (AUD, Loc));
-- Present the Abort_Undefer_Direct function to the backend
-- so that it can inline the call to the function.
Add_Inlined_Body (AUD, N);
Expand_At_End_Handler
(Handled_Statement_Sequence (N), Blk);
end;
end if;
-- N has been rewritten to a block statement for which it is
-- known by construction that no checks are necessary: analyze
-- it with all checks suppressed.
Analyze (N, Suppress => All_Checks);
return;
end Tagged_Case;
-- Array types
elsif Is_Array_Type (Typ) then
declare
Actual_Rhs : Node_Id := Rhs;
begin
while Nkind_In (Actual_Rhs, N_Type_Conversion,
N_Qualified_Expression)
loop
Actual_Rhs := Expression (Actual_Rhs);
end loop;
Expand_Assign_Array (N, Actual_Rhs);
return;
end;
-- Record types
elsif Is_Record_Type (Typ) then
Expand_Assign_Record (N);
return;
-- Scalar types. This is where we perform the processing related to the
-- requirements of (RM 13.9.1(9-11)) concerning the handling of invalid
-- scalar values.
elsif Is_Scalar_Type (Typ) then
-- Case where right side is known valid
if Expr_Known_Valid (Rhs) then
-- Here the right side is valid, so it is fine. The case to deal
-- with is when the left side is a local variable reference whose
-- value is not currently known to be valid. If this is the case,
-- and the assignment appears in an unconditional context, then
-- we can mark the left side as now being valid if one of these
-- conditions holds:
-- The expression of the right side has Do_Range_Check set so
-- that we know a range check will be performed. Note that it
-- can be the case that a range check is omitted because we
-- make the assumption that we can assume validity for operands
-- appearing in the right side in determining whether a range
-- check is required
-- The subtype of the right side matches the subtype of the
-- left side. In this case, even though we have not checked
-- the range of the right side, we know it is in range of its
-- subtype if the expression is valid.
if Is_Local_Variable_Reference (Lhs)
and then not Is_Known_Valid (Entity (Lhs))
and then In_Unconditional_Context (N)
then
if Do_Range_Check (Rhs)
or else Etype (Lhs) = Etype (Rhs)
then
Set_Is_Known_Valid (Entity (Lhs), True);
end if;
end if;
-- Case where right side may be invalid in the sense of the RM
-- reference above. The RM does not require that we check for the
-- validity on an assignment, but it does require that the assignment
-- of an invalid value not cause erroneous behavior.
-- The general approach in GNAT is to use the Is_Known_Valid flag
-- to avoid the need for validity checking on assignments. However
-- in some cases, we have to do validity checking in order to make
-- sure that the setting of this flag is correct.
else
-- Validate right side if we are validating copies
if Validity_Checks_On
and then Validity_Check_Copies
then
-- Skip this if left-hand side is an array or record component
-- and elementary component validity checks are suppressed.
if Nkind_In (Lhs, N_Selected_Component, N_Indexed_Component)
and then not Validity_Check_Components
then
null;
else
Ensure_Valid (Rhs);
end if;
-- We can propagate this to the left side where appropriate
if Is_Local_Variable_Reference (Lhs)
and then not Is_Known_Valid (Entity (Lhs))
and then In_Unconditional_Context (N)
then
Set_Is_Known_Valid (Entity (Lhs), True);
end if;
-- Otherwise check to see what should be done
-- If left side is a local variable, then we just set its flag to
-- indicate that its value may no longer be valid, since we are
-- copying a potentially invalid value.
elsif Is_Local_Variable_Reference (Lhs) then
Set_Is_Known_Valid (Entity (Lhs), False);
-- Check for case of a nonlocal variable on the left side which
-- is currently known to be valid. In this case, we simply ensure
-- that the right side is valid. We only play the game of copying
-- validity status for local variables, since we are doing this
-- statically, not by tracing the full flow graph.
elsif Is_Entity_Name (Lhs)
and then Is_Known_Valid (Entity (Lhs))
then
-- Note: If Validity_Checking mode is set to none, we ignore
-- the Ensure_Valid call so don't worry about that case here.
Ensure_Valid (Rhs);
-- In all other cases, we can safely copy an invalid value without
-- worrying about the status of the left side. Since it is not a
-- variable reference it will not be considered
-- as being known to be valid in any case.
else
null;
end if;
end if;
end if;
exception
when RE_Not_Available =>
return;
end Expand_N_Assignment_Statement;
------------------------------
-- Expand_N_Block_Statement --
------------------------------
-- Encode entity names defined in block statement
procedure Expand_N_Block_Statement (N : Node_Id) is
begin
Qualify_Entity_Names (N);
end Expand_N_Block_Statement;
-----------------------------
-- Expand_N_Case_Statement --
-----------------------------
procedure Expand_N_Case_Statement (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Expr : constant Node_Id := Expression (N);
Alt : Node_Id;
Len : Nat;
Cond : Node_Id;
Choice : Node_Id;
Chlist : List_Id;
begin
-- Check for the situation where we know at compile time which branch
-- will be taken.
-- If the value is static but its subtype is predicated and the value
-- does not obey the predicate, the value is marked non-static, and
-- there can be no corresponding static alternative. In that case we
-- replace the case statement with an exception, regardless of whether
-- assertions are enabled or not, unless predicates are ignored.
if Compile_Time_Known_Value (Expr)
and then Has_Predicates (Etype (Expr))
and then not Predicates_Ignored (Etype (Expr))
and then not Is_OK_Static_Expression (Expr)
then
Rewrite (N,
Make_Raise_Constraint_Error (Loc, Reason => CE_Invalid_Data));
Analyze (N);
return;
elsif Compile_Time_Known_Value (Expr)
and then (not Has_Predicates (Etype (Expr))
or else Is_Static_Expression (Expr))
then
Alt := Find_Static_Alternative (N);
-- Do not consider controlled objects found in a case statement which
-- actually models a case expression because their early finalization
-- will affect the result of the expression.
if not From_Conditional_Expression (N) then
Process_Statements_For_Controlled_Objects (Alt);
end if;
-- Move statements from this alternative after the case statement.
-- They are already analyzed, so will be skipped by the analyzer.
Insert_List_After (N, Statements (Alt));
-- That leaves the case statement as a shell. So now we can kill all
-- other alternatives in the case statement.
Kill_Dead_Code (Expression (N));
declare
Dead_Alt : Node_Id;
begin
-- Loop through case alternatives, skipping pragmas, and skipping
-- the one alternative that we select (and therefore retain).
Dead_Alt := First (Alternatives (N));
while Present (Dead_Alt) loop
if Dead_Alt /= Alt
and then Nkind (Dead_Alt) = N_Case_Statement_Alternative
then
Kill_Dead_Code (Statements (Dead_Alt), Warn_On_Deleted_Code);
end if;
Next (Dead_Alt);
end loop;
end;
Rewrite (N, Make_Null_Statement (Loc));
return;
end if;
-- Here if the choice is not determined at compile time
declare
Last_Alt : constant Node_Id := Last (Alternatives (N));
Others_Present : Boolean;
Others_Node : Node_Id;
Then_Stms : List_Id;
Else_Stms : List_Id;
begin
if Nkind (First (Discrete_Choices (Last_Alt))) = N_Others_Choice then
Others_Present := True;
Others_Node := Last_Alt;
else
Others_Present := False;
end if;
-- First step is to worry about possible invalid argument. The RM
-- requires (RM 5.4(13)) that if the result is invalid (e.g. it is
-- outside the base range), then Constraint_Error must be raised.
-- Case of validity check required (validity checks are on, the
-- expression is not known to be valid, and the case statement
-- comes from source -- no need to validity check internally
-- generated case statements).
if Validity_Check_Default
and then not Predicates_Ignored (Etype (Expr))
then
Ensure_Valid (Expr);
end if;
-- If there is only a single alternative, just replace it with the
-- sequence of statements since obviously that is what is going to
-- be executed in all cases.
Len := List_Length (Alternatives (N));
if Len = 1 then
-- We still need to evaluate the expression if it has any side
-- effects.
Remove_Side_Effects (Expression (N));
Alt := First (Alternatives (N));
-- Do not consider controlled objects found in a case statement
-- which actually models a case expression because their early
-- finalization will affect the result of the expression.
if not From_Conditional_Expression (N) then
Process_Statements_For_Controlled_Objects (Alt);
end if;
Insert_List_After (N, Statements (Alt));
-- That leaves the case statement as a shell. The alternative that
-- will be executed is reset to a null list. So now we can kill
-- the entire case statement.
Kill_Dead_Code (Expression (N));
Rewrite (N, Make_Null_Statement (Loc));
return;
-- An optimization. If there are only two alternatives, and only
-- a single choice, then rewrite the whole case statement as an
-- if statement, since this can result in subsequent optimizations.
-- This helps not only with case statements in the source of a
-- simple form, but also with generated code (discriminant check
-- functions in particular).
-- Note: it is OK to do this before expanding out choices for any
-- static predicates, since the if statement processing will handle
-- the static predicate case fine.
elsif Len = 2 then
Chlist := Discrete_Choices (First (Alternatives (N)));
if List_Length (Chlist) = 1 then
Choice := First (Chlist);
Then_Stms := Statements (First (Alternatives (N)));
Else_Stms := Statements (Last (Alternatives (N)));
-- For TRUE, generate "expression", not expression = true
if Nkind (Choice) = N_Identifier
and then Entity (Choice) = Standard_True
then
Cond := Expression (N);
-- For FALSE, generate "expression" and switch then/else
elsif Nkind (Choice) = N_Identifier
and then Entity (Choice) = Standard_False
then
Cond := Expression (N);
Else_Stms := Statements (First (Alternatives (N)));
Then_Stms := Statements (Last (Alternatives (N)));
-- For a range, generate "expression in range"
elsif Nkind (Choice) = N_Range
or else (Nkind (Choice) = N_Attribute_Reference
and then Attribute_Name (Choice) = Name_Range)
or else (Is_Entity_Name (Choice)
and then Is_Type (Entity (Choice)))
then
Cond :=
Make_In (Loc,
Left_Opnd => Expression (N),
Right_Opnd => Relocate_Node (Choice));
-- A subtype indication is not a legal operator in a membership
-- test, so retrieve its range.
elsif Nkind (Choice) = N_Subtype_Indication then
Cond :=
Make_In (Loc,
Left_Opnd => Expression (N),
Right_Opnd =>
Relocate_Node
(Range_Expression (Constraint (Choice))));
-- For any other subexpression "expression = value"
else
Cond :=
Make_Op_Eq (Loc,
Left_Opnd => Expression (N),
Right_Opnd => Relocate_Node (Choice));
end if;
-- Now rewrite the case as an IF
Rewrite (N,
Make_If_Statement (Loc,
Condition => Cond,
Then_Statements => Then_Stms,
Else_Statements => Else_Stms));
Analyze (N);
return;
end if;
end if;
-- If the last alternative is not an Others choice, replace it with
-- an N_Others_Choice. Note that we do not bother to call Analyze on
-- the modified case statement, since it's only effect would be to
-- compute the contents of the Others_Discrete_Choices which is not
-- needed by the back end anyway.
-- The reason for this is that the back end always needs some default
-- for a switch, so if we have not supplied one in the processing
-- above for validity checking, then we need to supply one here.
if not Others_Present then
Others_Node := Make_Others_Choice (Sloc (Last_Alt));
-- If Predicates_Ignored is true the value does not satisfy the
-- predicate, and there is no Others choice, Constraint_Error
-- must be raised (4.5.7 (21/3)).
if Predicates_Ignored (Etype (Expr)) then
declare
Except : constant Node_Id :=
Make_Raise_Constraint_Error (Loc,
Reason => CE_Invalid_Data);
New_Alt : constant Node_Id :=
Make_Case_Statement_Alternative (Loc,
Discrete_Choices => New_List (
Make_Others_Choice (Loc)),
Statements => New_List (Except));
begin
Append (New_Alt, Alternatives (N));
Analyze_And_Resolve (Except);
end;
else
Set_Others_Discrete_Choices
(Others_Node, Discrete_Choices (Last_Alt));
Set_Discrete_Choices (Last_Alt, New_List (Others_Node));
end if;
end if;
-- Deal with possible declarations of controlled objects, and also
-- with rewriting choice sequences for static predicate references.
Alt := First_Non_Pragma (Alternatives (N));
while Present (Alt) loop
-- Do not consider controlled objects found in a case statement
-- which actually models a case expression because their early
-- finalization will affect the result of the expression.
if not From_Conditional_Expression (N) then
Process_Statements_For_Controlled_Objects (Alt);
end if;
if Has_SP_Choice (Alt) then
Expand_Static_Predicates_In_Choices (Alt);
end if;
Next_Non_Pragma (Alt);
end loop;
end;
end Expand_N_Case_Statement;
-----------------------------
-- Expand_N_Exit_Statement --
-----------------------------
-- The only processing required is to deal with a possible C/Fortran
-- boolean value used as the condition for the exit statement.
procedure Expand_N_Exit_Statement (N : Node_Id) is
begin
Adjust_Condition (Condition (N));
end Expand_N_Exit_Statement;
----------------------------------
-- Expand_Formal_Container_Loop --
----------------------------------
procedure Expand_Formal_Container_Loop (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Isc : constant Node_Id := Iteration_Scheme (N);
I_Spec : constant Node_Id := Iterator_Specification (Isc);
Cursor : constant Entity_Id := Defining_Identifier (I_Spec);
Container : constant Node_Id := Entity (Name (I_Spec));
Stats : constant List_Id := Statements (N);
Advance : Node_Id;
Blk_Nod : Node_Id;
Init : Node_Id;
New_Loop : Node_Id;
begin
-- The expansion resembles the one for Ada containers, but the
-- primitives mention the domain of iteration explicitly, and
-- function First applied to the container yields a cursor directly.
-- Cursor : Cursor_type := First (Container);
-- while Has_Element (Cursor, Container) loop
-- <original loop statements>
-- Cursor := Next (Container, Cursor);
-- end loop;
Build_Formal_Container_Iteration
(N, Container, Cursor, Init, Advance, New_Loop);
Set_Ekind (Cursor, E_Variable);
Append_To (Stats, Advance);
-- Build block to capture declaration of cursor entity.
Blk_Nod :=
Make_Block_Statement (Loc,
Declarations => New_List (Init),
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (New_Loop)));
Rewrite (N, Blk_Nod);
Analyze (N);
end Expand_Formal_Container_Loop;
------------------------------------------
-- Expand_Formal_Container_Element_Loop --
------------------------------------------
procedure Expand_Formal_Container_Element_Loop (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Isc : constant Node_Id := Iteration_Scheme (N);
I_Spec : constant Node_Id := Iterator_Specification (Isc);
Element : constant Entity_Id := Defining_Identifier (I_Spec);
Container : constant Node_Id := Entity (Name (I_Spec));
Container_Typ : constant Entity_Id := Base_Type (Etype (Container));
Stats : constant List_Id := Statements (N);
Cursor : constant Entity_Id :=
Make_Defining_Identifier (Loc,
Chars => New_External_Name (Chars (Element), 'C'));
Elmt_Decl : Node_Id;
Elmt_Ref : Node_Id;
Element_Op : constant Entity_Id :=
Get_Iterable_Type_Primitive (Container_Typ, Name_Element);
Advance : Node_Id;
Init : Node_Id;
New_Loop : Node_Id;
begin
-- For an element iterator, the Element aspect must be present,
-- (this is checked during analysis) and the expansion takes the form:
-- Cursor : Cursor_Type := First (Container);
-- Elmt : Element_Type;
-- while Has_Element (Cursor, Container) loop
-- Elmt := Element (Container, Cursor);
-- <original loop statements>
-- Cursor := Next (Container, Cursor);
-- end loop;
-- However this expansion is not legal if the element is indefinite.
-- In that case we create a block to hold a variable declaration
-- initialized with a call to Element, and generate:
-- Cursor : Cursor_Type := First (Container);
-- while Has_Element (Cursor, Container) loop
-- declare
-- Elmt : Element_Type := Element (Container, Cursor);
-- begin
-- <original loop statements>
-- Cursor := Next (Container, Cursor);
-- end;
-- end loop;
Build_Formal_Container_Iteration
(N, Container, Cursor, Init, Advance, New_Loop);
Append_To (Stats, Advance);
Set_Ekind (Cursor, E_Variable);
Insert_Action (N, Init);
-- Declaration for Element
Elmt_Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => Element,
Object_Definition => New_Occurrence_Of (Etype (Element_Op), Loc));
if not Is_Constrained (Etype (Element_Op)) then
Set_Expression (Elmt_Decl,
Make_Function_Call (Loc,
Name => New_Occurrence_Of (Element_Op, Loc),
Parameter_Associations => New_List (
New_Occurrence_Of (Container, Loc),
New_Occurrence_Of (Cursor, Loc))));
Set_Statements (New_Loop,
New_List
(Make_Block_Statement (Loc,
Declarations => New_List (Elmt_Decl),
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => Stats))));
else
Elmt_Ref :=
Make_Assignment_Statement (Loc,
Name => New_Occurrence_Of (Element, Loc),
Expression =>
Make_Function_Call (Loc,
Name => New_Occurrence_Of (Element_Op, Loc),
Parameter_Associations => New_List (
New_Occurrence_Of (Container, Loc),
New_Occurrence_Of (Cursor, Loc))));
Prepend (Elmt_Ref, Stats);
-- The element is assignable in the expanded code
Set_Assignment_OK (Name (Elmt_Ref));
-- The loop is rewritten as a block, to hold the element declaration
New_Loop :=
Make_Block_Statement (Loc,
Declarations => New_List (Elmt_Decl),
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (New_Loop)));
end if;
-- The element is only modified in expanded code, so it appears as
-- unassigned to the warning machinery. We must suppress this spurious
-- warning explicitly.
Set_Warnings_Off (Element);
Rewrite (N, New_Loop);
-- The loop parameter is declared by an object declaration, but within
-- the loop we must prevent user assignments to it, so we analyze the
-- declaration and reset the entity kind, before analyzing the rest of
-- the loop;
Analyze (Elmt_Decl);
Set_Ekind (Defining_Identifier (Elmt_Decl), E_Loop_Parameter);
Analyze (N);
end Expand_Formal_Container_Element_Loop;
-----------------------------
-- Expand_N_Goto_Statement --
-----------------------------
-- Add poll before goto if polling active
procedure Expand_N_Goto_Statement (N : Node_Id) is
begin
Generate_Poll_Call (N);
end Expand_N_Goto_Statement;
---------------------------
-- Expand_N_If_Statement --
---------------------------
-- First we deal with the case of C and Fortran convention boolean values,
-- with zero/non-zero semantics.
-- Second, we deal with the obvious rewriting for the cases where the
-- condition of the IF is known at compile time to be True or False.
-- Third, we remove elsif parts which have non-empty Condition_Actions and
-- rewrite as independent if statements. For example:
-- if x then xs
-- elsif y then ys
-- ...
-- end if;
-- becomes
--
-- if x then xs
-- else
-- <<condition actions of y>>
-- if y then ys
-- ...
-- end if;
-- end if;
-- This rewriting is needed if at least one elsif part has a non-empty
-- Condition_Actions list. We also do the same processing if there is a
-- constant condition in an elsif part (in conjunction with the first
-- processing step mentioned above, for the recursive call made to deal
-- with the created inner if, this deals with properly optimizing the
-- cases of constant elsif conditions).
procedure Expand_N_If_Statement (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Hed : Node_Id;
E : Node_Id;
New_If : Node_Id;
Warn_If_Deleted : constant Boolean :=
Warn_On_Deleted_Code and then Comes_From_Source (N);
-- Indicates whether we want warnings when we delete branches of the
-- if statement based on constant condition analysis. We never want
-- these warnings for expander generated code.
begin
-- Do not consider controlled objects found in an if statement which
-- actually models an if expression because their early finalization
-- will affect the result of the expression.
if not From_Conditional_Expression (N) then
Process_Statements_For_Controlled_Objects (N);
end if;
Adjust_Condition (Condition (N));
-- The following loop deals with constant conditions for the IF. We
-- need a loop because as we eliminate False conditions, we grab the
-- first elsif condition and use it as the primary condition.
while Compile_Time_Known_Value (Condition (N)) loop
-- If condition is True, we can simply rewrite the if statement now
-- by replacing it by the series of then statements.
if Is_True (Expr_Value (Condition (N))) then
-- All the else parts can be killed
Kill_Dead_Code (Elsif_Parts (N), Warn_If_Deleted);
Kill_Dead_Code (Else_Statements (N), Warn_If_Deleted);
Hed := Remove_Head (Then_Statements (N));
Insert_List_After (N, Then_Statements (N));
Rewrite (N, Hed);
return;
-- If condition is False, then we can delete the condition and
-- the Then statements
else
-- We do not delete the condition if constant condition warnings
-- are enabled, since otherwise we end up deleting the desired
-- warning. Of course the backend will get rid of this True/False
-- test anyway, so nothing is lost here.
if not Constant_Condition_Warnings then
Kill_Dead_Code (Condition (N));
end if;
Kill_Dead_Code (Then_Statements (N), Warn_If_Deleted);
-- If there are no elsif statements, then we simply replace the
-- entire if statement by the sequence of else statements.
if No (Elsif_Parts (N)) then
if No (Else_Statements (N))
or else Is_Empty_List (Else_Statements (N))
then
Rewrite (N,
Make_Null_Statement (Sloc (N)));
else
Hed := Remove_Head (Else_Statements (N));
Insert_List_After (N, Else_Statements (N));
Rewrite (N, Hed);
end if;
return;
-- If there are elsif statements, the first of them becomes the
-- if/then section of the rebuilt if statement This is the case
-- where we loop to reprocess this copied condition.
else
Hed := Remove_Head (Elsif_Parts (N));
Insert_Actions (N, Condition_Actions (Hed));
Set_Condition (N, Condition (Hed));
Set_Then_Statements (N, Then_Statements (Hed));
-- Hed might have been captured as the condition determining
-- the current value for an entity. Now it is detached from
-- the tree, so a Current_Value pointer in the condition might
-- need to be updated.
Set_Current_Value_Condition (N);
if Is_Empty_List (Elsif_Parts (N)) then
Set_Elsif_Parts (N, No_List);
end if;
end if;
end if;
end loop;
-- Loop through elsif parts, dealing with constant conditions and
-- possible condition actions that are present.
if Present (Elsif_Parts (N)) then
E := First (Elsif_Parts (N));
while Present (E) loop
-- Do not consider controlled objects found in an if statement
-- which actually models an if expression because their early
-- finalization will affect the result of the expression.
if not From_Conditional_Expression (N) then
Process_Statements_For_Controlled_Objects (E);
end if;
Adjust_Condition (Condition (E));
-- If there are condition actions, then rewrite the if statement
-- as indicated above. We also do the same rewrite for a True or
-- False condition. The further processing of this constant
-- condition is then done by the recursive call to expand the
-- newly created if statement
if Present (Condition_Actions (E))
or else Compile_Time_Known_Value (Condition (E))
then
New_If :=
Make_If_Statement (Sloc (E),
Condition => Condition (E),
Then_Statements => Then_Statements (E),
Elsif_Parts => No_List,
Else_Statements => Else_Statements (N));
-- Elsif parts for new if come from remaining elsif's of parent
while Present (Next (E)) loop
if No (Elsif_Parts (New_If)) then
Set_Elsif_Parts (New_If, New_List);
end if;
Append (Remove_Next (E), Elsif_Parts (New_If));
end loop;
Set_Else_Statements (N, New_List (New_If));
if Present (Condition_Actions (E)) then
Insert_List_Before (New_If, Condition_Actions (E));
end if;
Remove (E);
if Is_Empty_List (Elsif_Parts (N)) then
Set_Elsif_Parts (N, No_List);
end if;
Analyze (New_If);
-- Note this is not an implicit if statement, since it is part
-- of an explicit if statement in the source (or of an implicit
-- if statement that has already been tested). We set the flag
-- after calling Analyze to avoid generating extra warnings
-- specific to pure if statements, however (see
-- Sem_Ch5.Analyze_If_Statement).
Set_Comes_From_Source (New_If, Comes_From_Source (N));
return;
-- No special processing for that elsif part, move to next
else
Next (E);
end if;
end loop;
end if;
-- Some more optimizations applicable if we still have an IF statement
if Nkind (N) /= N_If_Statement then
return;
end if;
-- Another optimization, special cases that can be simplified
-- if expression then
-- return true;
-- else
-- return false;
-- end if;
-- can be changed to:
-- return expression;
-- and
-- if expression then
-- return false;
-- else
-- return true;
-- end if;
-- can be changed to:
-- return not (expression);
-- Only do these optimizations if we are at least at -O1 level and
-- do not do them if control flow optimizations are suppressed.
if Optimization_Level > 0
and then not Opt.Suppress_Control_Flow_Optimizations
then
if Nkind (N) = N_If_Statement
and then No (Elsif_Parts (N))
and then Present (Else_Statements (N))
and then List_Length (Then_Statements (N)) = 1
and then List_Length (Else_Statements (N)) = 1
then
declare
Then_Stm : constant Node_Id := First (Then_Statements (N));
Else_Stm : constant Node_Id := First (Else_Statements (N));
begin
if Nkind (Then_Stm) = N_Simple_Return_Statement
and then
Nkind (Else_Stm) = N_Simple_Return_Statement
then
declare
Then_Expr : constant Node_Id := Expression (Then_Stm);
Else_Expr : constant Node_Id := Expression (Else_Stm);
begin
if Nkind (Then_Expr) = N_Identifier
and then
Nkind (Else_Expr) = N_Identifier
then
if Entity (Then_Expr) = Standard_True
and then Entity (Else_Expr) = Standard_False
then
Rewrite (N,
Make_Simple_Return_Statement (Loc,
Expression => Relocate_Node (Condition (N))));
Analyze (N);
return;
elsif Entity (Then_Expr) = Standard_False
and then Entity (Else_Expr) = Standard_True
then
Rewrite (N,
Make_Simple_Return_Statement (Loc,
Expression =>
Make_Op_Not (Loc,
Right_Opnd =>
Relocate_Node (Condition (N)))));
Analyze (N);
return;
end if;
end if;
end;
end if;
end;
end if;
end if;
end Expand_N_If_Statement;
--------------------------
-- Expand_Iterator_Loop --
--------------------------
procedure Expand_Iterator_Loop (N : Node_Id) is
Isc : constant Node_Id := Iteration_Scheme (N);
I_Spec : constant Node_Id := Iterator_Specification (Isc);
Container : constant Node_Id := Name (I_Spec);
Container_Typ : constant Entity_Id := Base_Type (Etype (Container));
begin
-- Processing for arrays
if Is_Array_Type (Container_Typ) then
pragma Assert (Of_Present (I_Spec));
Expand_Iterator_Loop_Over_Array (N);
elsif Has_Aspect (Container_Typ, Aspect_Iterable) then
if Of_Present (I_Spec) then
Expand_Formal_Container_Element_Loop (N);
else
Expand_Formal_Container_Loop (N);
end if;
-- Processing for containers
else
Expand_Iterator_Loop_Over_Container
(N, Isc, I_Spec, Container, Container_Typ);
end if;
end Expand_Iterator_Loop;
-------------------------------------
-- Expand_Iterator_Loop_Over_Array --
-------------------------------------
procedure Expand_Iterator_Loop_Over_Array (N : Node_Id) is
Isc : constant Node_Id := Iteration_Scheme (N);
I_Spec : constant Node_Id := Iterator_Specification (Isc);
Array_Node : constant Node_Id := Name (I_Spec);
Array_Typ : constant Entity_Id := Base_Type (Etype (Array_Node));
Array_Dim : constant Pos := Number_Dimensions (Array_Typ);
Id : constant Entity_Id := Defining_Identifier (I_Spec);
Loc : constant Source_Ptr := Sloc (N);
Stats : constant List_Id := Statements (N);
Core_Loop : Node_Id;
Dim1 : Int;
Ind_Comp : Node_Id;
Iterator : Entity_Id;
-- Start of processing for Expand_Iterator_Loop_Over_Array
begin
-- for Element of Array loop
-- It requires an internally generated cursor to iterate over the array
pragma Assert (Of_Present (I_Spec));
Iterator := Make_Temporary (Loc, 'C');
-- Generate:
-- Element : Component_Type renames Array (Iterator);
-- Iterator is the index value, or a list of index values
-- in the case of a multidimensional array.
Ind_Comp :=
Make_Indexed_Component (Loc,
Prefix => Relocate_Node (Array_Node),
Expressions => New_List (New_Occurrence_Of (Iterator, Loc)));
Prepend_To (Stats,
Make_Object_Renaming_Declaration (Loc,
Defining_Identifier => Id,
Subtype_Mark =>
New_Occurrence_Of (Component_Type (Array_Typ), Loc),
Name => Ind_Comp));
-- Mark the loop variable as needing debug info, so that expansion
-- of the renaming will result in Materialize_Entity getting set via
-- Debug_Renaming_Declaration. (This setting is needed here because
-- the setting in Freeze_Entity comes after the expansion, which is
-- too late. ???)
Set_Debug_Info_Needed (Id);
-- Generate:
-- for Iterator in [reverse] Array'Range (Array_Dim) loop
-- Element : Component_Type renames Array (Iterator);
-- <original loop statements>
-- end loop;
-- If this is an iteration over a multidimensional array, the
-- innermost loop is over the last dimension in Ada, and over
-- the first dimension in Fortran.
if Convention (Array_Typ) = Convention_Fortran then
Dim1 := 1;
else
Dim1 := Array_Dim;
end if;
Core_Loop :=
Make_Loop_Statement (Loc,
Iteration_Scheme =>
Make_Iteration_Scheme (Loc,
Loop_Parameter_Specification =>
Make_Loop_Parameter_Specification (Loc,
Defining_Identifier => Iterator,
Discrete_Subtype_Definition =>
Make_Attribute_Reference (Loc,
Prefix => Relocate_Node (Array_Node),
Attribute_Name => Name_Range,
Expressions => New_List (
Make_Integer_Literal (Loc, Dim1))),
Reverse_Present => Reverse_Present (I_Spec))),
Statements => Stats,
End_Label => Empty);
-- Processing for multidimensional array. The body of each loop is
-- a loop over a previous dimension, going in decreasing order in Ada
-- and in increasing order in Fortran.
if Array_Dim > 1 then
for Dim in 1 .. Array_Dim - 1 loop
if Convention (Array_Typ) = Convention_Fortran then
Dim1 := Dim + 1;
else
Dim1 := Array_Dim - Dim;
end if;
Iterator := Make_Temporary (Loc, 'C');
-- Generate the dimension loops starting from the innermost one
-- for Iterator in [reverse] Array'Range (Array_Dim - Dim) loop
-- <core loop>
-- end loop;
Core_Loop :=
Make_Loop_Statement (Loc,
Iteration_Scheme =>
Make_Iteration_Scheme (Loc,
Loop_Parameter_Specification =>
Make_Loop_Parameter_Specification (Loc,
Defining_Identifier => Iterator,
Discrete_Subtype_Definition =>
Make_Attribute_Reference (Loc,
Prefix => Relocate_Node (Array_Node),
Attribute_Name => Name_Range,
Expressions => New_List (
Make_Integer_Literal (Loc, Dim1))),
Reverse_Present => Reverse_Present (I_Spec))),
Statements => New_List (Core_Loop),
End_Label => Empty);
-- Update the previously created object renaming declaration with
-- the new iterator, by adding the index of the next loop to the
-- indexed component, in the order that corresponds to the
-- convention.
if Convention (Array_Typ) = Convention_Fortran then
Append_To (Expressions (Ind_Comp),
New_Occurrence_Of (Iterator, Loc));
else
Prepend_To (Expressions (Ind_Comp),
New_Occurrence_Of (Iterator, Loc));
end if;
end loop;
end if;
-- Inherit the loop identifier from the original loop. This ensures that
-- the scope stack is consistent after the rewriting.
if Present (Identifier (N)) then
Set_Identifier (Core_Loop, Relocate_Node (Identifier (N)));
end if;
Rewrite (N, Core_Loop);
Analyze (N);
end Expand_Iterator_Loop_Over_Array;
-----------------------------------------
-- Expand_Iterator_Loop_Over_Container --
-----------------------------------------
-- For a 'for ... in' loop, such as:
-- for Cursor in Iterator_Function (...) loop
-- ...
-- end loop;
-- we generate:
-- Iter : Iterator_Type := Iterator_Function (...);
-- Cursor : Cursor_type := First (Iter); -- or Last for "reverse"
-- while Has_Element (Cursor) loop
-- ...
--
-- Cursor := Iter.Next (Cursor); -- or Prev for "reverse"
-- end loop;
-- For a 'for ... of' loop, such as:
-- for X of Container loop
-- ...
-- end loop;
-- the RM implies the generation of:
-- Iter : Iterator_Type := Container.Iterate; -- the Default_Iterator
-- Cursor : Cursor_Type := First (Iter); -- or Last for "reverse"
-- while Has_Element (Cursor) loop
-- declare
-- X : Element_Type renames Element (Cursor).Element.all;
-- -- or Constant_Element
-- begin
-- ...
-- end;
-- Cursor := Iter.Next (Cursor); -- or Prev for "reverse"
-- end loop;
-- In the general case, we do what the RM says. However, the operations
-- Element and Iter.Next are slow, which is bad inside a loop, because they
-- involve dispatching via interfaces, secondary stack manipulation,
-- Busy/Lock incr/decr, and adjust/finalization/at-end handling. So for the
-- predefined containers, we use an equivalent but optimized expansion.
-- In the optimized case, we make use of these:
-- procedure Next (Position : in out Cursor); -- instead of Iter.Next
-- function Pseudo_Reference
-- (Container : aliased Vector'Class) return Reference_Control_Type;
-- type Element_Access is access all Element_Type;
-- function Get_Element_Access
-- (Position : Cursor) return not null Element_Access;
-- Next is declared in the visible part of the container packages.
-- The other three are added in the private part. (We're not supposed to
-- pollute the namespace for clients. The compiler has no trouble breaking
-- privacy to call things in the private part of an instance.)
-- Source:
-- for X of My_Vector loop
-- X.Count := X.Count + 1;
-- ...
-- end loop;
-- The compiler will generate:
-- Iter : Reversible_Iterator'Class := Iterate (My_Vector);
-- -- Reversible_Iterator is an interface. Iterate is the
-- -- Default_Iterator aspect of Vector. This increments Lock,
-- -- disallowing tampering with cursors. Unfortunately, it does not
-- -- increment Busy. The result of Iterate is Limited_Controlled;
-- -- finalization will decrement Lock. This is a build-in-place
-- -- dispatching call to Iterate.
-- Cur : Cursor := First (Iter); -- or Last
-- -- Dispatching call via interface.
-- Control : Reference_Control_Type := Pseudo_Reference (My_Vector);
-- -- Pseudo_Reference increments Busy, to detect tampering with
-- -- elements, as required by RM. Also redundantly increment
-- -- Lock. Finalization of Control will decrement both Busy and
-- -- Lock. Pseudo_Reference returns a record containing a pointer to
-- -- My_Vector, used by Finalize.
-- --
-- -- Control is not used below, except to finalize it -- it's purely
-- -- an RAII thing. This is needed because we are eliminating the
-- -- call to Reference within the loop.
-- while Has_Element (Cur) loop
-- declare
-- X : My_Element renames Get_Element_Access (Cur).all;
-- -- Get_Element_Access returns a pointer to the element
-- -- designated by Cur. No dispatching here, and no horsing
-- -- around with access discriminants. This is instead of the
-- -- existing
-- --
-- -- X : My_Element renames Reference (Cur).Element.all;
-- --
-- -- which creates a controlled object.
-- begin
-- -- Any attempt to tamper with My_Vector here in the loop
-- -- will correctly raise Program_Error, because of the
-- -- Control.
--
-- X.Count := X.Count + 1;
-- ...
--
-- Next (Cur); -- or Prev
-- -- This is instead of "Cur := Next (Iter, Cur);"
-- end;
-- -- No finalization here
-- end loop;
-- Finalize Iter and Control here, decrementing Lock twice and Busy
-- once.
-- This optimization makes "for ... of" loops over 30 times faster in cases
-- measured.
procedure Expand_Iterator_Loop_Over_Container
(N : Node_Id;
Isc : Node_Id;
I_Spec : Node_Id;
Container : Node_Id;
Container_Typ : Entity_Id)
is
Id : constant Entity_Id := Defining_Identifier (I_Spec);
Elem_Typ : constant Entity_Id := Etype (Id);
Id_Kind : constant Entity_Kind := Ekind (Id);
Loc : constant Source_Ptr := Sloc (N);
Stats : constant List_Id := Statements (N);
Cursor : Entity_Id;
Decl : Node_Id;
Iter_Type : Entity_Id;
Iterator : Entity_Id;
Name_Init : Name_Id;
Name_Step : Name_Id;
New_Loop : Node_Id;
Fast_Element_Access_Op : Entity_Id := Empty;
Fast_Step_Op : Entity_Id := Empty;
-- Only for optimized version of "for ... of"
Iter_Pack : Entity_Id;
-- The package in which the iterator interface is instantiated. This is
-- typically an instance within the container package.
Pack : Entity_Id;
-- The package in which the container type is declared
begin
-- Determine the advancement and initialization steps for the cursor.
-- Analysis of the expanded loop will verify that the container has a
-- reverse iterator.
if Reverse_Present (I_Spec) then
Name_Init := Name_Last;
Name_Step := Name_Previous;
else
Name_Init := Name_First;
Name_Step := Name_Next;
end if;
-- The type of the iterator is the return type of the Iterate function
-- used. For the "of" form this is the default iterator for the type,
-- otherwise it is the type of the explicit function used in the
-- iterator specification. The most common case will be an Iterate
-- function in the container package.
-- The Iterator type is declared in an instance within the container
-- package itself, for example:
-- package Vector_Iterator_Interfaces is new
-- Ada.Iterator_Interfaces (Cursor, Has_Element);
-- If the container type is a derived type, the cursor type is found in
-- the package of the ultimate ancestor type.
if Is_Derived_Type (Container_Typ) then
Pack := Scope (Root_Type (Container_Typ));
else
Pack := Scope (Container_Typ);
end if;
if Of_Present (I_Spec) then
Handle_Of : declare
Container_Arg : Node_Id;
function Get_Default_Iterator
(T : Entity_Id) return Entity_Id;
-- If the container is a derived type, the aspect holds the parent
-- operation. The required one is a primitive of the derived type
-- and is either inherited or overridden. Also sets Container_Arg.
--------------------------
-- Get_Default_Iterator --
--------------------------
function Get_Default_Iterator
(T : Entity_Id) return Entity_Id
is
Iter : constant Entity_Id :=
Entity (Find_Value_Of_Aspect (T, Aspect_Default_Iterator));
Prim : Elmt_Id;
Op : Entity_Id;
begin
Container_Arg := New_Copy_Tree (Container);
-- A previous version of GNAT allowed indexing aspects to
-- be redefined on derived container types, while the
-- default iterator was inherited from the parent type.
-- This non-standard extension is preserved temporarily for
-- use by the modelling project under debug flag d.X.
if Debug_Flag_Dot_XX then
if Base_Type (Etype (Container)) /=
Base_Type (Etype (First_Formal (Iter)))
then
Container_Arg :=
Make_Type_Conversion (Loc,
Subtype_Mark =>
New_Occurrence_Of
(Etype (First_Formal (Iter)), Loc),
Expression => Container_Arg);
end if;
return Iter;
elsif Is_Derived_Type (T) then
-- The default iterator must be a primitive operation of the
-- type, at the same dispatch slot position. The DT position
-- may not be established if type is not frozen yet.
Prim := First_Elmt (Primitive_Operations (T));
while Present (Prim) loop
Op := Node (Prim);
if Alias (Op) = Iter
or else
(Chars (Op) = Chars (Iter)
and then Present (DTC_Entity (Op))
and then DT_Position (Op) = DT_Position (Iter))
then
return Op;
end if;
Next_Elmt (Prim);
end loop;
-- Default iterator must exist
pragma Assert (False);
-- Otherwise not a derived type
else
return Iter;
end if;
end Get_Default_Iterator;
-- Local variables
Default_Iter : Entity_Id;
Ent : Entity_Id;
Reference_Control_Type : Entity_Id := Empty;
Pseudo_Reference : Entity_Id := Empty;
-- Start of processing for Handle_Of
begin
if Is_Class_Wide_Type (Container_Typ) then
Default_Iter :=
Get_Default_Iterator (Etype (Base_Type (Container_Typ)));
else
Default_Iter := Get_Default_Iterator (Etype (Container));
end if;
Cursor := Make_Temporary (Loc, 'C');
-- For a container element iterator, the iterator type is obtained
-- from the corresponding aspect, whose return type is descended
-- from the corresponding interface type in some instance of
-- Ada.Iterator_Interfaces. The actuals of that instantiation
-- are Cursor and Has_Element.
Iter_Type := Etype (Default_Iter);
-- The iterator type, which is a class-wide type, may itself be
-- derived locally, so the desired instantiation is the scope of
-- the root type of the iterator type.
Iter_Pack := Scope (Root_Type (Etype (Iter_Type)));
-- Find declarations needed for "for ... of" optimization
Ent := First_Entity (Pack);
while Present (Ent) loop
if Chars (Ent) = Name_Get_Element_Access then
Fast_Element_Access_Op := Ent;
elsif Chars (Ent) = Name_Step
and then Ekind (Ent) = E_Procedure
then
Fast_Step_Op := Ent;
elsif Chars (Ent) = Name_Reference_Control_Type then
Reference_Control_Type := Ent;
elsif Chars (Ent) = Name_Pseudo_Reference then
Pseudo_Reference := Ent;
end if;
Next_Entity (Ent);
end loop;
if Present (Reference_Control_Type)
and then Present (Pseudo_Reference)
then
Insert_Action (N,
Make_Object_Declaration (Loc,
Defining_Identifier => Make_Temporary (Loc, 'D'),
Object_Definition =>
New_Occurrence_Of (Reference_Control_Type, Loc),
Expression =>
Make_Function_Call (Loc,
Name =>
New_Occurrence_Of (Pseudo_Reference, Loc),
Parameter_Associations =>
New_List (New_Copy_Tree (Container_Arg)))));
end if;
-- Rewrite domain of iteration as a call to the default iterator
-- for the container type. The formal may be an access parameter
-- in which case we must build a reference to the container.
declare
Arg : Node_Id;
begin
if Is_Access_Type (Etype (First_Entity (Default_Iter))) then
Arg :=
Make_Attribute_Reference (Loc,
Prefix => Container_Arg,
Attribute_Name => Name_Unrestricted_Access);
else
Arg := Container_Arg;
end if;
Rewrite (Name (I_Spec),
Make_Function_Call (Loc,
Name =>
New_Occurrence_Of (Default_Iter, Loc),
Parameter_Associations => New_List (Arg)));
end;
Analyze_And_Resolve (Name (I_Spec));
-- Find cursor type in proper iterator package, which is an
-- instantiation of Iterator_Interfaces.
Ent := First_Entity (Iter_Pack);
while Present (Ent) loop
if Chars (Ent) = Name_Cursor then
Set_Etype (Cursor, Etype (Ent));
exit;
end if;
Next_Entity (Ent);
end loop;
if Present (Fast_Element_Access_Op) then
Decl :=
Make_Object_Renaming_Declaration (Loc,
Defining_Identifier => Id,
Subtype_Mark =>
New_Occurrence_Of (Elem_Typ, Loc),
Name =>
Make_Explicit_Dereference (Loc,
Prefix =>
Make_Function_Call (Loc,
Name =>
New_Occurrence_Of (Fast_Element_Access_Op, Loc),
Parameter_Associations =>
New_List (New_Occurrence_Of (Cursor, Loc)))));
else
Decl :=
Make_Object_Renaming_Declaration (Loc,
Defining_Identifier => Id,
Subtype_Mark =>
New_Occurrence_Of (Elem_Typ, Loc),
Name =>
Make_Indexed_Component (Loc,
Prefix => Relocate_Node (Container_Arg),
Expressions =>
New_List (New_Occurrence_Of (Cursor, Loc))));
end if;
-- The defining identifier in the iterator is user-visible and
-- must be visible in the debugger.
Set_Debug_Info_Needed (Id);
-- If the container does not have a variable indexing aspect,
-- the element is a constant in the loop. The container itself
-- may be constant, in which case the element is a constant as
-- well. The container has been rewritten as a call to Iterate,
-- so examine original node.
if No (Find_Value_Of_Aspect
(Container_Typ, Aspect_Variable_Indexing))
or else not Is_Variable (Original_Node (Container))
then
Set_Ekind (Id, E_Constant);
end if;
Prepend_To (Stats, Decl);
end Handle_Of;
-- X in Iterate (S) : type of iterator is type of explicitly given
-- Iterate function, and the loop variable is the cursor. It will be
-- assigned in the loop and must be a variable.
else
Iter_Type := Etype (Name (I_Spec));
-- The iterator type, which is a class-wide type, may itself be
-- derived locally, so the desired instantiation is the scope of
-- the root type of the iterator type, as in the "of" case.
Iter_Pack := Scope (Root_Type (Etype (Iter_Type)));
Cursor := Id;
end if;
Iterator := Make_Temporary (Loc, 'I');
-- For both iterator forms, add a call to the step operation to advance
-- the cursor. Generate:
-- Cursor := Iterator.Next (Cursor);
-- or else
-- Cursor := Next (Cursor);
if Present (Fast_Element_Access_Op) and then Present (Fast_Step_Op) then
declare
Curs_Name : constant Node_Id := New_Occurrence_Of (Cursor, Loc);
Step_Call : Node_Id;
begin
Step_Call :=
Make_Procedure_Call_Statement (Loc,
Name =>
New_Occurrence_Of (Fast_Step_Op, Loc),
Parameter_Associations => New_List (Curs_Name));
Append_To (Stats, Step_Call);
Set_Assignment_OK (Curs_Name);
end;
else
declare
Rhs : Node_Id;
begin
Rhs :=
Make_Function_Call (Loc,
Name =>
Make_Selected_Component (Loc,
Prefix => New_Occurrence_Of (Iterator, Loc),
Selector_Name => Make_Identifier (Loc, Name_Step)),
Parameter_Associations => New_List (
New_Occurrence_Of (Cursor, Loc)));
Append_To (Stats,
Make_Assignment_Statement (Loc,
Name => New_Occurrence_Of (Cursor, Loc),
Expression => Rhs));
Set_Assignment_OK (Name (Last (Stats)));
end;
end if;
-- Generate:
-- while Has_Element (Cursor) loop
-- <Stats>
-- end loop;
-- Has_Element is the second actual in the iterator package
New_Loop :=
Make_Loop_Statement (Loc,
Iteration_Scheme =>
Make_Iteration_Scheme (Loc,
Condition =>
Make_Function_Call (Loc,
Name =>
New_Occurrence_Of
(Next_Entity (First_Entity (Iter_Pack)), Loc),
Parameter_Associations => New_List (
New_Occurrence_Of (Cursor, Loc)))),
Statements => Stats,
End_Label => Empty);
-- If present, preserve identifier of loop, which can be used in an exit
-- statement in the body.
if Present (Identifier (N)) then
Set_Identifier (New_Loop, Relocate_Node (Identifier (N)));
end if;
-- Create the declarations for Iterator and cursor and insert them
-- before the source loop. Given that the domain of iteration is already
-- an entity, the iterator is just a renaming of that entity. Possible
-- optimization ???
Insert_Action (N,
Make_Object_Renaming_Declaration (Loc,
Defining_Identifier => Iterator,
Subtype_Mark => New_Occurrence_Of (Iter_Type, Loc),
Name => Relocate_Node (Name (I_Spec))));
-- Create declaration for cursor
declare
Cursor_Decl : constant Node_Id :=
Make_Object_Declaration (Loc,
Defining_Identifier => Cursor,
Object_Definition =>
New_Occurrence_Of (Etype (Cursor), Loc),
Expression =>
Make_Selected_Component (Loc,
Prefix =>
New_Occurrence_Of (Iterator, Loc),
Selector_Name =>
Make_Identifier (Loc, Name_Init)));
begin
-- The cursor is only modified in expanded code, so it appears
-- as unassigned to the warning machinery. We must suppress this
-- spurious warning explicitly. The cursor's kind is that of the
-- original loop parameter (it is a constant if the domain of
-- iteration is constant).
Set_Warnings_Off (Cursor);
Set_Assignment_OK (Cursor_Decl);
Insert_Action (N, Cursor_Decl);
Set_Ekind (Cursor, Id_Kind);
end;
-- If the range of iteration is given by a function call that returns
-- a container, the finalization actions have been saved in the
-- Condition_Actions of the iterator. Insert them now at the head of
-- the loop.
if Present (Condition_Actions (Isc)) then
Insert_List_Before (N, Condition_Actions (Isc));
end if;
Rewrite (N, New_Loop);
Analyze (N);
end Expand_Iterator_Loop_Over_Container;
-----------------------------
-- Expand_N_Loop_Statement --
-----------------------------
-- 1. Remove null loop entirely
-- 2. Deal with while condition for C/Fortran boolean
-- 3. Deal with loops with a non-standard enumeration type range
-- 4. Deal with while loops where Condition_Actions is set
-- 5. Deal with loops over predicated subtypes
-- 6. Deal with loops with iterators over arrays and containers
-- 7. Insert polling call if required
procedure Expand_N_Loop_Statement (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Scheme : constant Node_Id := Iteration_Scheme (N);
Stmt : Node_Id;
begin
-- Delete null loop
if Is_Null_Loop (N) then
Rewrite (N, Make_Null_Statement (Loc));
return;
end if;
-- Deal with condition for C/Fortran Boolean
if Present (Scheme) then
Adjust_Condition (Condition (Scheme));
end if;
-- Generate polling call
if Is_Non_Empty_List (Statements (N)) then
Generate_Poll_Call (First (Statements (N)));
end if;
-- Nothing more to do for plain loop with no iteration scheme
if No (Scheme) then
null;
-- Case of for loop (Loop_Parameter_Specification present)
-- Note: we do not have to worry about validity checking of the for loop
-- range bounds here, since they were frozen with constant declarations
-- and it is during that process that the validity checking is done.
elsif Present (Loop_Parameter_Specification (Scheme)) then
declare
LPS : constant Node_Id :=
Loop_Parameter_Specification (Scheme);
Loop_Id : constant Entity_Id := Defining_Identifier (LPS);
Ltype : constant Entity_Id := Etype (Loop_Id);
Btype : constant Entity_Id := Base_Type (Ltype);
Expr : Node_Id;
Decls : List_Id;
New_Id : Entity_Id;
begin
-- Deal with loop over predicates
if Is_Discrete_Type (Ltype)
and then Present (Predicate_Function (Ltype))
then
Expand_Predicated_Loop (N);
-- Handle the case where we have a for loop with the range type
-- being an enumeration type with non-standard representation.
-- In this case we expand:
-- for x in [reverse] a .. b loop
-- ...
-- end loop;
-- to
-- for xP in [reverse] integer
-- range etype'Pos (a) .. etype'Pos (b)
-- loop
-- declare
-- x : constant etype := Pos_To_Rep (xP);
-- begin
-- ...
-- end;
-- end loop;
elsif Is_Enumeration_Type (Btype)
and then Present (Enum_Pos_To_Rep (Btype))
then
New_Id :=
Make_Defining_Identifier (Loc,
Chars => New_External_Name (Chars (Loop_Id), 'P'));
-- If the type has a contiguous representation, successive
-- values can be generated as offsets from the first literal.
if Has_Contiguous_Rep (Btype) then
Expr :=
Unchecked_Convert_To (Btype,
Make_Op_Add (Loc,
Left_Opnd =>
Make_Integer_Literal (Loc,
Enumeration_Rep (First_Literal (Btype))),
Right_Opnd => New_Occurrence_Of (New_Id, Loc)));
else
-- Use the constructed array Enum_Pos_To_Rep
Expr :=
Make_Indexed_Component (Loc,
Prefix =>
New_Occurrence_Of (Enum_Pos_To_Rep (Btype), Loc),
Expressions =>
New_List (New_Occurrence_Of (New_Id, Loc)));
end if;
-- Build declaration for loop identifier
Decls :=
New_List (
Make_Object_Declaration (Loc,
Defining_Identifier => Loop_Id,
Constant_Present => True,
Object_Definition => New_Occurrence_Of (Ltype, Loc),
Expression => Expr));
Rewrite (N,
Make_Loop_Statement (Loc,
Identifier => Identifier (N),
Iteration_Scheme =>
Make_Iteration_Scheme (Loc,
Loop_Parameter_Specification =>
Make_Loop_Parameter_Specification (Loc,
Defining_Identifier => New_Id,
Reverse_Present => Reverse_Present (LPS),
Discrete_Subtype_Definition =>
Make_Subtype_Indication (Loc,
Subtype_Mark =>
New_Occurrence_Of (Standard_Natural, Loc),
Constraint =>
Make_Range_Constraint (Loc,
Range_Expression =>
Make_Range (Loc,
Low_Bound =>
Make_Attribute_Reference (Loc,
Prefix =>
New_Occurrence_Of (Btype, Loc),
Attribute_Name => Name_Pos,
Expressions => New_List (
Relocate_Node
(Type_Low_Bound (Ltype)))),
High_Bound =>
Make_Attribute_Reference (Loc,
Prefix =>
New_Occurrence_Of (Btype, Loc),
Attribute_Name => Name_Pos,
Expressions => New_List (
Relocate_Node
(Type_High_Bound
(Ltype))))))))),
Statements => New_List (
Make_Block_Statement (Loc,
Declarations => Decls,
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => Statements (N)))),
End_Label => End_Label (N)));
-- The loop parameter's entity must be removed from the loop
-- scope's entity list and rendered invisible, since it will
-- now be located in the new block scope. Any other entities
-- already associated with the loop scope, such as the loop
-- parameter's subtype, will remain there.
-- In an element loop, the loop will contain a declaration for
-- a cursor variable; otherwise the loop id is the first entity
-- in the scope constructed for the loop.
if Comes_From_Source (Loop_Id) then
pragma Assert (First_Entity (Scope (Loop_Id)) = Loop_Id);
null;
end if;
Set_First_Entity (Scope (Loop_Id), Next_Entity (Loop_Id));
Remove_Homonym (Loop_Id);
if Last_Entity (Scope (Loop_Id)) = Loop_Id then
Set_Last_Entity (Scope (Loop_Id), Empty);
end if;
Analyze (N);
-- Nothing to do with other cases of for loops
else
null;
end if;
end;
-- Second case, if we have a while loop with Condition_Actions set, then
-- we change it into a plain loop:
-- while C loop
-- ...
-- end loop;
-- changed to:
-- loop
-- <<condition actions>>
-- exit when not C;
-- ...
-- end loop
elsif Present (Scheme)
and then Present (Condition_Actions (Scheme))
and then Present (Condition (Scheme))
then
declare
ES : Node_Id;
begin
ES :=
Make_Exit_Statement (Sloc (Condition (Scheme)),
Condition =>
Make_Op_Not (Sloc (Condition (Scheme)),
Right_Opnd => Condition (Scheme)));
Prepend (ES, Statements (N));
Insert_List_Before (ES, Condition_Actions (Scheme));
-- This is not an implicit loop, since it is generated in response
-- to the loop statement being processed. If this is itself
-- implicit, the restriction has already been checked. If not,
-- it is an explicit loop.
Rewrite (N,
Make_Loop_Statement (Sloc (N),
Identifier => Identifier (N),
Statements => Statements (N),
End_Label => End_Label (N)));
Analyze (N);
end;
-- Here to deal with iterator case
elsif Present (Scheme)
and then Present (Iterator_Specification (Scheme))
then
Expand_Iterator_Loop (N);
-- An iterator loop may generate renaming declarations for elements
-- that require debug information. This is the case in particular
-- with element iterators, where debug information must be generated
-- for the temporary that holds the element value. These temporaries
-- are created within a transient block whose local declarations are
-- transferred to the loop, which now has nontrivial local objects.
if Nkind (N) = N_Loop_Statement
and then Present (Identifier (N))
then
Qualify_Entity_Names (N);
end if;
end if;
-- When the iteration scheme mentiones attribute 'Loop_Entry, the loop
-- is transformed into a conditional block where the original loop is
-- the sole statement. Inspect the statements of the nested loop for
-- controlled objects.
Stmt := N;
if Subject_To_Loop_Entry_Attributes (Stmt) then
Stmt := Find_Loop_In_Conditional_Block (Stmt);
end if;
Process_Statements_For_Controlled_Objects (Stmt);
end Expand_N_Loop_Statement;
----------------------------
-- Expand_Predicated_Loop --
----------------------------
-- Note: the expander can handle generation of loops over predicated
-- subtypes for both the dynamic and static cases. Depending on what
-- we decide is allowed in Ada 2012 mode and/or extensions allowed
-- mode, the semantic analyzer may disallow one or both forms.
procedure Expand_Predicated_Loop (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Isc : constant Node_Id := Iteration_Scheme (N);
LPS : constant Node_Id := Loop_Parameter_Specification (Isc);
Loop_Id : constant Entity_Id := Defining_Identifier (LPS);
Ltype : constant Entity_Id := Etype (Loop_Id);
Stat : constant List_Id := Static_Discrete_Predicate (Ltype);
Stmts : constant List_Id := Statements (N);
begin
-- Case of iteration over non-static predicate, should not be possible
-- since this is not allowed by the semantics and should have been
-- caught during analysis of the loop statement.
if No (Stat) then
raise Program_Error;
-- If the predicate list is empty, that corresponds to a predicate of
-- False, in which case the loop won't run at all, and we rewrite the
-- entire loop as a null statement.
elsif Is_Empty_List (Stat) then
Rewrite (N, Make_Null_Statement (Loc));
Analyze (N);
-- For expansion over a static predicate we generate the following
-- declare
-- J : Ltype := min-val;
-- begin
-- loop
-- body
-- case J is
-- when endpoint => J := startpoint;
-- when endpoint => J := startpoint;
-- ...
-- when max-val => exit;
-- when others => J := Lval'Succ (J);
-- end case;
-- end loop;
-- end;
-- with min-val replaced by max-val and Succ replaced by Pred if the
-- loop parameter specification carries a Reverse indicator.
-- To make this a little clearer, let's take a specific example:
-- type Int is range 1 .. 10;
-- subtype StaticP is Int with
-- predicate => StaticP in 3 | 10 | 5 .. 7;
-- ...
-- for L in StaticP loop
-- Put_Line ("static:" & J'Img);
-- end loop;
-- In this case, the loop is transformed into
-- begin
-- J : L := 3;
-- loop
-- body
-- case J is
-- when 3 => J := 5;
-- when 7 => J := 10;
-- when 10 => exit;
-- when others => J := L'Succ (J);
-- end case;
-- end loop;
-- end;
else
Static_Predicate : declare
S : Node_Id;
D : Node_Id;
P : Node_Id;
Alts : List_Id;
Cstm : Node_Id;
function Lo_Val (N : Node_Id) return Node_Id;
-- Given static expression or static range, returns an identifier
-- whose value is the low bound of the expression value or range.
function Hi_Val (N : Node_Id) return Node_Id;
-- Given static expression or static range, returns an identifier
-- whose value is the high bound of the expression value or range.
------------
-- Hi_Val --
------------
function Hi_Val (N : Node_Id) return Node_Id is
begin
if Is_OK_Static_Expression (N) then
return New_Copy (N);
else
pragma Assert (Nkind (N) = N_Range);
return New_Copy (High_Bound (N));
end if;
end Hi_Val;
------------
-- Lo_Val --
------------
function Lo_Val (N : Node_Id) return Node_Id is
begin
if Is_OK_Static_Expression (N) then
return New_Copy (N);
else
pragma Assert (Nkind (N) = N_Range);
return New_Copy (Low_Bound (N));
end if;
end Lo_Val;
-- Start of processing for Static_Predicate
begin
-- Convert loop identifier to normal variable and reanalyze it so
-- that this conversion works. We have to use the same defining
-- identifier, since there may be references in the loop body.
Set_Analyzed (Loop_Id, False);
Set_Ekind (Loop_Id, E_Variable);
-- In most loops the loop variable is assigned in various
-- alternatives in the body. However, in the rare case when
-- the range specifies a single element, the loop variable
-- may trigger a spurious warning that is could be constant.
-- This warning might as well be suppressed.
Set_Warnings_Off (Loop_Id);
-- Loop to create branches of case statement
Alts := New_List;
if Reverse_Present (LPS) then
-- Initial value is largest value in predicate.
D :=
Make_Object_Declaration (Loc,
Defining_Identifier => Loop_Id,
Object_Definition => New_Occurrence_Of (Ltype, Loc),
Expression => Hi_Val (Last (Stat)));
P := Last (Stat);
while Present (P) loop
if No (Prev (P)) then
S := Make_Exit_Statement (Loc);
else
S :=
Make_Assignment_Statement (Loc,
Name => New_Occurrence_Of (Loop_Id, Loc),
Expression => Hi_Val (Prev (P)));
Set_Suppress_Assignment_Checks (S);
end if;
Append_To (Alts,
Make_Case_Statement_Alternative (Loc,
Statements => New_List (S),
Discrete_Choices => New_List (Lo_Val (P))));
Prev (P);
end loop;
else
-- Initial value is smallest value in predicate.
D :=
Make_Object_Declaration (Loc,
Defining_Identifier => Loop_Id,
Object_Definition => New_Occurrence_Of (Ltype, Loc),
Expression => Lo_Val (First (Stat)));
P := First (Stat);
while Present (P) loop
if No (Next (P)) then
S := Make_Exit_Statement (Loc);
else
S :=
Make_Assignment_Statement (Loc,
Name => New_Occurrence_Of (Loop_Id, Loc),
Expression => Lo_Val (Next (P)));
Set_Suppress_Assignment_Checks (S);
end if;
Append_To (Alts,
Make_Case_Statement_Alternative (Loc,
Statements => New_List (S),
Discrete_Choices => New_List (Hi_Val (P))));
Next (P);
end loop;
end if;
-- Add others choice
declare
Name_Next : Name_Id;
begin
if Reverse_Present (LPS) then
Name_Next := Name_Pred;
else
Name_Next := Name_Succ;
end if;
S :=
Make_Assignment_Statement (Loc,
Name => New_Occurrence_Of (Loop_Id, Loc),
Expression =>
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Ltype, Loc),
Attribute_Name => Name_Next,
Expressions => New_List (
New_Occurrence_Of (Loop_Id, Loc))));
Set_Suppress_Assignment_Checks (S);
end;
Append_To (Alts,
Make_Case_Statement_Alternative (Loc,
Discrete_Choices => New_List (Make_Others_Choice (Loc)),
Statements => New_List (S)));
-- Construct case statement and append to body statements
Cstm :=
Make_Case_Statement (Loc,
Expression => New_Occurrence_Of (Loop_Id, Loc),
Alternatives => Alts);
Append_To (Stmts, Cstm);
-- Rewrite the loop
Set_Suppress_Assignment_Checks (D);
Rewrite (N,
Make_Block_Statement (Loc,
Declarations => New_List (D),
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (
Make_Loop_Statement (Loc,
Statements => Stmts,
End_Label => Empty)))));
Analyze (N);
end Static_Predicate;
end if;
end Expand_Predicated_Loop;
------------------------------
-- Make_Tag_Ctrl_Assignment --
------------------------------
function Make_Tag_Ctrl_Assignment (N : Node_Id) return List_Id is
Asn : constant Node_Id := Relocate_Node (N);
L : constant Node_Id := Name (N);
Loc : constant Source_Ptr := Sloc (N);
Res : constant List_Id := New_List;
T : constant Entity_Id := Underlying_Type (Etype (L));
Comp_Asn : constant Boolean := Is_Fully_Repped_Tagged_Type (T);
Ctrl_Act : constant Boolean := Needs_Finalization (T)
and then not No_Ctrl_Actions (N);
Save_Tag : constant Boolean := Is_Tagged_Type (T)
and then not Comp_Asn
and then not No_Ctrl_Actions (N)
and then Tagged_Type_Expansion;
Adj_Call : Node_Id;
Fin_Call : Node_Id;
Tag_Id : Entity_Id;
begin
-- Finalize the target of the assignment when controlled
-- We have two exceptions here:
-- 1. If we are in an init proc since it is an initialization more
-- than an assignment.
-- 2. If the left-hand side is a temporary that was not initialized
-- (or the parent part of a temporary since it is the case in
-- extension aggregates). Such a temporary does not come from
-- source. We must examine the original node for the prefix, because
-- it may be a component of an entry formal, in which case it has
-- been rewritten and does not appear to come from source either.
-- Case of init proc
if not Ctrl_Act then
null;
-- The left-hand side is an uninitialized temporary object
elsif Nkind (L) = N_Type_Conversion
and then Is_Entity_Name (Expression (L))
and then Nkind (Parent (Entity (Expression (L)))) =
N_Object_Declaration
and then No_Initialization (Parent (Entity (Expression (L))))
then
null;
else
Fin_Call :=
Make_Final_Call
(Obj_Ref => Duplicate_Subexpr_No_Checks (L),
Typ => Etype (L));
if Present (Fin_Call) then
Append_To (Res, Fin_Call);
end if;
end if;
-- Save the Tag in a local variable Tag_Id
if Save_Tag then
Tag_Id := Make_Temporary (Loc, 'A');
Append_To (Res,
Make_Object_Declaration (Loc,
Defining_Identifier => Tag_Id,
Object_Definition => New_Occurrence_Of (RTE (RE_Tag), Loc),
Expression =>
Make_Selected_Component (Loc,
Prefix => Duplicate_Subexpr_No_Checks (L),
Selector_Name =>
New_Occurrence_Of (First_Tag_Component (T), Loc))));
-- Otherwise Tag_Id is not used
else
Tag_Id := Empty;
end if;
-- If the tagged type has a full rep clause, expand the assignment into
-- component-wise assignments. Mark the node as unanalyzed in order to
-- generate the proper code and propagate this scenario by setting a
-- flag to avoid infinite recursion.
if Comp_Asn then
Set_Analyzed (Asn, False);
Set_Componentwise_Assignment (Asn, True);
end if;
Append_To (Res, Asn);
-- Restore the tag
if Save_Tag then
Append_To (Res,
Make_Assignment_Statement (Loc,
Name =>
Make_Selected_Component (Loc,
Prefix => Duplicate_Subexpr_No_Checks (L),
Selector_Name =>
New_Occurrence_Of (First_Tag_Component (T), Loc)),
Expression => New_Occurrence_Of (Tag_Id, Loc)));
end if;
-- Adjust the target after the assignment when controlled (not in the
-- init proc since it is an initialization more than an assignment).
if Ctrl_Act then
Adj_Call :=
Make_Adjust_Call
(Obj_Ref => Duplicate_Subexpr_Move_Checks (L),
Typ => Etype (L));
if Present (Adj_Call) then
Append_To (Res, Adj_Call);
end if;
end if;
return Res;
exception
-- Could use comment here ???
when RE_Not_Available =>
return Empty_List;
end Make_Tag_Ctrl_Assignment;
end Exp_Ch5;
|
with Interfaces; use Interfaces;
with Interfaces.C.Extensions;
package Lv.Color_Types is
type Color_T_Comp is record
Blue : Extensions.Unsigned_5;
Green : Extensions.Unsigned_6;
Red : Extensions.Unsigned_5;
end record
with Pack, Object_Size => 16;
pragma Convention (C_Pass_By_Copy, Color_T_Comp);
subtype Color_Int_T is Uint16_T;
type Color_T (Discr : unsigned := 0) is record
case Discr is
when 0 =>
Comp : aliased Color_T_Comp;
when others =>
Full : aliased Color_Int_T;
end case;
end record
with Pack, Object_Size => 16;
pragma Convention (C_Pass_By_Copy, Color_T);
pragma Unchecked_Union (Color_T);
function Color_Make
(R8, G8, B8 : Uint8_T) return Color_T is
(Discr => 0,
Comp => (Extensions.Unsigned_5 (Shift_Right (B8, 3)),
Extensions.Unsigned_6 (Shift_Right (G8, 2)),
Extensions.Unsigned_5 (Shift_Right (R8, 3))))
with Inline_Always;
end Lv.Color_Types;
|
-- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
with Ada.Unchecked_Deallocation;
package body Yaml.Events.Context is
use type Store.Optional_Reference;
use type Text.Reference;
use type Store.Anchor_Cursor;
use type Store.Element_Cursor;
procedure Free_Scope_Array is new Ada.Unchecked_Deallocation
(Scope_Array, Scope_Array_Pointer);
procedure Free_Data_Array is new Ada.Unchecked_Deallocation
(Data_Array, Data_Array_Pointer);
procedure Free_Symbol_Table is new Ada.Unchecked_Deallocation
(Symbol_Tables.Map, Symbol_Table_Pointer);
function Create (External : Store.Reference := Store.New_Store)
return Reference is
((Ada.Finalization.Controlled with Data =>
new Instance'(Refcount_Base with Generated_Data => null,
Generated_Data_Count => 0,
Document_Data => Store.New_Store,
Stream_Data => Store.New_Store,
Transformed_Data => Store.New_Store,
External_Data => External,
Local_Scopes => null, Local_Scope_Count => 0)));
function External_Store (Object : Reference) return Store.Accessor is
(Object.Data.External_Data.Value);
function Stream_Store (Object : Reference) return Store.Accessor is
(Object.Data.Stream_Data.Value);
function Document_Store (Object : Reference) return Store.Accessor is
(Object.Data.Document_Data.Value);
function Transformed_Store (Object : Reference) return Store.Accessor is
(Object.Data.Transformed_Data.Value);
function Local_Store (Object : Reference; Position : Local_Scope_Cursor)
return Store.Accessor is
begin
if (Object.Data.Local_Scopes = null or
Object.Data.Local_Scope_Count < Natural (Position)) then
raise Constraint_Error with "no local store at this position";
elsif Object.Data.Local_Scopes (Positive (Position)).Events =
Store.Null_Reference then
Object.Data.Local_Scopes (Positive (Position)).Events :=
Store.New_Store.Optional;
end if;
return Object.Data.Local_Scopes (Positive (Position)).Events.Value;
end Local_Store;
function Local_Store_Ref (Object : Reference; Position : Local_Scope_Cursor)
return Store.Optional_Reference is
begin
if Object.Data.Local_Scopes = null or
Object.Data.Local_Scope_Count < Natural (Position) then
return Store.Null_Reference;
elsif Object.Data.Local_Scopes (Positive (Position)).Events =
Store.Null_Reference then
Object.Data.Local_Scopes (Positive (Position)).Events :=
Store.New_Store.Optional;
end if;
return Object.Data.Local_Scopes (Positive (Position)).Events;
end Local_Store_Ref;
function Generated_Store (Object : Reference;
Position : Generated_Store_Cursor)
return Store.Accessor is
begin
if Object.Data.Generated_Data = null or
Object.Data.Generated_Data_Count < Natural (Position) then
raise Constraint_Error with "no generated store at this position";
elsif Object.Data.Generated_Data (Positive (Position)) =
Store.Null_Reference then
raise Program_Error with
"internal error: expected generated store at position" &
Position'Img;
end if;
return Object.Data.Generated_Data (Positive (Position)).Value;
end Generated_Store;
function Generated_Store_Ref (Object : Reference;
Position : Generated_Store_Cursor)
return Store.Optional_Reference is
begin
if Object.Data.Generated_Data = null or
Object.Data.Generated_Data_Count < Natural (Position) then
return Store.Null_Reference;
elsif Object.Data.Generated_Data (Positive (Position)) =
Store.Null_Reference then
raise Program_Error with
"internal error: expected generated store at position" &
Position'Img;
end if;
return Object.Data.Generated_Data (Positive (Position));
end Generated_Store_Ref;
procedure Grow_Scopes (Object : in out Instance) is
begin
if Object.Local_Scopes = null then
Object.Local_Scopes := new Scope_Array (1 .. 16);
elsif Object.Local_Scope_Count = Object.Local_Scopes'Last then
declare
New_Array : constant not null Scope_Array_Pointer :=
new Scope_Array (1 .. Object.Local_Scope_Count * 2);
begin
New_Array (Object.Local_Scopes'Range) :=
Object.Local_Scopes.all;
Free_Scope_Array (Object.Local_Scopes);
Object.Local_Scopes := New_Array;
end;
end if;
Object.Local_Scope_Count := Object.Local_Scope_Count + 1;
end Grow_Scopes;
procedure Create_Local_Store (Object : Reference;
Position : out Local_Scope_Cursor) is
begin
Grow_Scopes (Object.Data.all);
Object.Data.Local_Scopes (Object.Data.Local_Scope_Count).Events :=
Store.New_Store.Optional;
Position := Local_Scope_Cursor (Object.Data.Local_Scope_Count);
end Create_Local_Store;
procedure Create_Local_Symbol_Scope (Object : Reference;
Position : out Local_Scope_Cursor) is
begin
Grow_Scopes (Object.Data.all);
Object.Data.Local_Scopes (Object.Data.Local_Scope_Count).Symbols :=
new Symbol_Tables.Map;
Position := Local_Scope_Cursor (Object.Data.Local_Scope_Count);
end Create_Local_Symbol_Scope;
procedure Release_Local_Store (Object : Reference;
Position : Local_Scope_Cursor) is
begin
if Object.Data.Local_Scopes (Positive (Position)).Symbols /= null then
Free_Symbol_Table
(Object.Data.Local_Scopes (Positive (Position)).Symbols);
end if;
Object.Data.Local_Scopes (Positive (Position)).Events :=
Store.Null_Reference;
while Object.Data.Local_Scope_Count > 0 and then
(Object.Data.Local_Scopes (Object.Data.Local_Scope_Count).Events =
Store.Null_Reference and Object.Data.Local_Scopes
(Object.Data.Local_Scope_Count).Symbols = null) loop
Object.Data.Local_Scope_Count := Object.Data.Local_Scope_Count - 1;
end loop;
end Release_Local_Store;
procedure Create_Generated_Store (Object : Reference;
Position : out Generated_Store_Cursor) is
begin
if Object.Data.Generated_Data = null then
Object.Data.Generated_Data := new Data_Array (1 .. 16);
elsif Object.Data.Generated_Data_Count =
Object.Data.Generated_Data'Last then
declare
New_Array : constant not null Data_Array_Pointer :=
new Data_Array (1 .. Object.Data.Generated_Data_Count * 2);
begin
New_Array (Object.Data.Generated_Data'Range) :=
Object.Data.Generated_Data.all;
Free_Data_Array (Object.Data.Generated_Data);
Object.Data.Generated_Data := New_Array;
end;
end if;
Object.Data.Generated_Data_Count := Object.Data.Generated_Data_Count + 1;
Object.Data.Generated_Data (Object.Data.Generated_Data_Count) :=
Store.New_Store.Optional;
Position := Generated_Store_Cursor (Object.Data.Generated_Data_Count);
end Create_Generated_Store;
procedure Release_Generated_Store (Object : Reference;
Position : Generated_Store_Cursor) is
begin
Object.Data.Generated_Data (Positive (Position)) := Store.Null_Reference;
while Object.Data.Generated_Data_Count > 0 and then
(Object.Data.Generated_Data (Object.Data.Generated_Data_Count) =
Store.Null_Reference) loop
Object.Data.Generated_Data_Count :=
Object.Data.Generated_Data_Count - 1;
end loop;
end Release_Generated_Store;
procedure Create_Symbol (Object : Reference;
Scope : Local_Scope_Cursor;
Name : Text.Reference;
Position : out Symbol_Cursor) is
Inserted : Boolean;
begin
if Object.Data.Local_Scopes (Positive (Scope)).Symbols = null then
Object.Data.Local_Scopes (Positive (Scope)).Symbols :=
new Symbol_Tables.Map;
end if;
Object.Data.Local_Scopes (Positive (Scope)).Symbols.Insert
(Name, No_Element, Symbol_Tables.Cursor (Position), Inserted);
if not Inserted then
raise Constraint_Error with "Symbol """ & Name & """ already exists!";
end if;
end Create_Symbol;
procedure Update_Symbol (Object : Reference;
Scope : Local_Scope_Cursor;
Position : Symbol_Cursor;
New_Value : Cursor) is
function Try_Update_With_Anchored (Anchor : Text.Reference)
return Boolean is
begin
if Anchor = Text.Empty then
return False;
end if;
Object.Data.Local_Scopes (Positive (Scope)).Symbols.Replace_Element
(Symbol_Tables.Cursor (Position), Object.Position (Anchor));
return True;
end Try_Update_With_Anchored;
Target_Event : constant Event := First (New_Value);
begin
case Target_Event.Kind is
when Scalar =>
if Try_Update_With_Anchored (Target_Event.Scalar_Properties.Anchor)
then
return;
end if;
when Mapping_Start | Sequence_Start =>
if Try_Update_With_Anchored
(Target_Event.Collection_Properties.Anchor) then
return;
end if;
when Alias =>
Object.Data.Local_Scopes (Positive (Scope)).Symbols.Replace_Element
(Symbol_Tables.Cursor (Position),
Object.Position (Target_Event.Target));
return;
when others => null;
end case;
Object.Data.Local_Scopes (Positive (Scope)).Symbols.Replace_Element
(Symbol_Tables.Cursor (Position), New_Value);
end Update_Symbol;
function Symbol_Name (Position : Symbol_Cursor) return Text.Reference is
(Symbol_Tables.Key (Symbol_Tables.Cursor (Position)));
function Position (Object : Reference; Alias : Text.Reference) return Cursor
is
Pos : Store.Anchor_Cursor := Store.No_Anchor;
function Resolved (Position : Cursor) return Cursor is
begin
return Pos : Cursor := Position do
if Pos /= No_Element then
declare
Target_Event : constant Event := First (Pos);
begin
if Target_Event.Kind = Annotation_Start and then
Target_Event.Annotation_Properties.Anchor /= Text.Empty then
declare
Resolved_Target : constant Store.Anchor_Cursor :=
Object.Data.Transformed_Data.Value.Find
(Target_Event.Annotation_Properties.Anchor);
begin
if Resolved_Target /= Store.No_Anchor then
Pos.Target := Object.Data.Transformed_Data.Optional;
Pos.Anchored_Position := Resolved_Target;
Pos.Element_Position := Store.No_Element;
end if;
end;
end if;
end;
end if;
end return;
end Resolved;
begin
for Index in reverse 1 .. Object.Data.Generated_Data_Count loop
Pos := Object.Data.Generated_Data (Index).Value.Find (Alias);
if Pos /= Store.No_Anchor then
return Resolved ((Target => Object.Data.Generated_Data (Index),
Anchored_Position => Pos,
Element_Position => Events.Store.No_Element,
Target_Location => Generated));
end if;
end loop;
for Index in reverse 1 .. Object.Data.Local_Scope_Count loop
if Object.Data.Local_Scopes (Index).Symbols /= null then
declare
Symbol_Pos : constant Symbol_Tables.Cursor :=
Object.Data.Local_Scopes (Index).Symbols.Find (Alias);
begin
if Symbol_Tables.Has_Element (Symbol_Pos) then
return Resolved (Symbol_Tables.Element (Symbol_Pos));
end if;
end;
end if;
if Object.Data.Local_Scopes (Index).Events /= Store.Null_Reference then
Pos := Object.Data.Local_Scopes (Index).Events.Value.Find (Alias);
if Pos /= Store.No_Anchor then
return Resolved
((Target => Object.Data.Local_Scopes (Index).Events,
Anchored_Position => Pos,
Element_Position => Events.Store.No_Element,
Target_Location => Local));
end if;
end if;
end loop;
Pos := Object.Data.Document_Data.Value.Find (Alias);
if Pos = Store.No_Anchor then
Pos := Object.Data.Stream_Data.Value.Find (Alias);
if Pos = Store.No_Anchor then
Pos := Object.Data.External_Data.Value.Find (Alias);
if Pos = Store.No_Anchor then
return No_Element;
else
return Resolved ((Target => Object.Data.External_Data.Optional,
Anchored_Position => Pos,
Element_Position => Events.Store.No_Element,
Target_Location => External));
end if;
else
return Resolved ((Target => Object.Data.Stream_Data.Optional,
Anchored_Position => Pos,
Element_Position => Events.Store.No_Element,
Target_Location => Stream));
end if;
else
return Resolved ((Target => Object.Data.Document_Data.Optional,
Anchored_Position => Pos,
Element_Position => Events.Store.No_Element,
Target_Location => Document));
end if;
end Position;
function Location (Position : Cursor) return Location_Type is
(Position.Target_Location);
function Is_Anchored (Pos : Cursor) return Boolean is
(Pos.Anchored_Position /= Store.No_Anchor);
function Retrieve (Pos : Cursor) return Store.Stream_Reference is
(if Pos.Element_Position /= Store.No_Element then
Pos.Target.Required.Retrieve (Pos.Element_Position) else
Pos.Target.Required.Retrieve (Pos.Anchored_Position));
function First (Pos : Cursor) return Event is
(if Pos.Element_Position /= Store.No_Element then
Pos.Target.Value.Element (Pos.Element_Position) else
Pos.Target.Value.First (Pos.Anchored_Position));
procedure Adjust (Object : in out Reference) is
begin
Object.Data.Increase_Refcount;
end Adjust;
procedure Finalize (Object : in out Reference) is
begin
Object.Data.Decrease_Refcount;
end Finalize;
function Exists_In_Ouput (Position : Cursor) return Boolean is
(if Position.Element_Position = Store.No_Element then
Store.Exists_In_Output (Position.Anchored_Position) else False);
procedure Set_Exists_In_Output (Position : in out Cursor) is
begin
if Position.Anchored_Position /= Events.Store.No_Anchor then
Store.Set_Exists_In_Output (Position.Target.Value,
Position.Anchored_Position);
end if;
end Set_Exists_In_Output;
procedure Finalize (Object : in out Instance) is
begin
if Object.Local_Scopes /= null then
for Index in 1 .. Object.Local_Scope_Count loop
if Object.Local_Scopes (Index).Symbols /= null then
Free_Symbol_Table (Object.Local_Scopes (Index).Symbols);
end if;
end loop;
Free_Scope_Array (Object.Local_Scopes);
end if;
if Object.Generated_Data /= null then
Free_Data_Array (Object.Generated_Data);
end if;
end Finalize;
procedure Get_Store_And_Cursor
(Position : Cursor; Target : out Store.Optional_Reference;
Element_Position : out Events.Store.Element_Cursor) is
begin
Target := Position.Target;
if Position.Anchored_Position /= Store.No_Anchor then
Element_Position := Store.To_Element_Cursor
(Position.Anchored_Position);
else
Element_Position := Position.Element_Position;
end if;
end Get_Store_And_Cursor;
function To_Cursor (Object : Reference;
Parent : Store.Optional_Reference;
Element_Position : Events.Store.Element_Cursor)
return Cursor is
((Target => Parent, Anchored_Position => Store.No_Anchor,
Element_Position => Element_Position,
Target_Location => (if Parent.Value.Data = Object.External_Store.Data then
External elsif Parent.Value.Data = Object.Stream_Store.Data then
Stream elsif Parent.Value.Data = Object.Document_Store.Data then
Document elsif Parent.Value.Data = null then None else Local)));
end Yaml.Events.Context;
|
with Ada.Real_Time; use Ada.Real_Time;
with HIL.GPIO; use HIL.GPIO;
with HIL.Clock; use HIL.Clock;
with Crash;
pragma Unreferenced (Crash);
with Calc;
procedure main with SPARK_Mode is
f1, f2, res : Float;
next : Time := Clock;
PERIOD : constant Time_Span := Milliseconds(500);
led_on : Boolean := False;
begin
HIL.Clock.configure;
HIL.GPIO.configure;
-- For the following tests, we have set system.Denorm (in RTS) to True
-- Test1: Subnormal OUT FROM FPU: OKAY
-- f1 := 0.00429291604;
-- f2 := -2.02303554e-38;
-- 0.00429291604*-2.02303554e-38 = -8.68468736e-41
-- Test2: Subnormal INTO FPU: WORKS.
f1 := 0.00429291604;
f2 := -8.68468736e-41; -- subnormal INTO FPU
-- 0.00429291604*-8.68468736e-41 = -3.72745392e-43.
res := Calc.calc (f1, f2); -- function call to force use of FPU
loop
if led_on then
write (RED_LED, HIGH);
else
write (RED_LED, LOW);
end if;
led_on := not led_on;
next := next + PERIOD;
delay until next;
end loop;
res := 0.0;
end main;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . C O M M A N D _ L I N E . R E M O V E --
-- --
-- S p e c --
-- --
-- Copyright (C) 1999-2006, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- 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 is intended to be used in conjunction with its parent unit,
-- Ada.Command_Line. It provides facilities for logically removing arguments
-- from the command line, so that subsequent calls to Argument_Count and
-- Argument will reflect the removals.
-- For example, if the original command line has three arguments A B C, so
-- that Argument_Count is initially three, then after removing B, the second
-- argument, Argument_Count will be 2, and Argument (2) will return C.
package Ada.Command_Line.Remove is
pragma Preelaborate;
procedure Remove_Argument (Number : Positive);
-- Removes the argument identified by Number, which must be in the
-- range 1 .. Argument_Count (i.e. an in range argument number which
-- reflects removals). If Number is out of range Constraint_Error
-- will be raised.
--
-- Note: the numbering of arguments greater than Number is affected
-- by the call. If you need a loop through the arguments, removing
-- some as you go, run the loop in reverse to avoid confusion from
-- this renumbering:
--
-- for J in reverse 1 .. Argument_Count loop
-- if Should_Remove (Arguments (J)) then
-- Remove_Argument (J);
-- end if;
-- end loop;
--
-- Reversing the loop in this manner avoids the confusion.
procedure Remove_Arguments (From : Positive; To : Natural);
-- Removes arguments in the given From..To range. From must be in the
-- range 1 .. Argument_Count and To in the range 0 .. Argument_Count.
-- Constraint_Error is raised if either argument is out of range. If
-- To is less than From, then the call has no effect.
procedure Remove_Argument (Argument : String);
-- Removes the argument which matches the given string Argument. Has
-- no effect if no argument matches the string. If more than one
-- argument matches the string, all are removed.
procedure Remove_Arguments (Argument_Prefix : String);
-- Removes all arguments whose prefix matches Argument_Prefix. Has
-- no effect if no argument matches the string. For example a call
-- to Remove_Arguments ("--") removes all arguments starting with --.
end Ada.Command_Line.Remove;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2016 onox <denkpadje@gmail.com>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with AUnit.Assertions;
with AUnit.Test_Caller;
with Orka.SIMD.AVX.Doubles.Math;
package body Test_SIMD_AVX_Math is
use Orka;
use Orka.SIMD.AVX.Doubles;
use Orka.SIMD.AVX.Doubles.Math;
use AUnit.Assertions;
package Caller is new AUnit.Test_Caller (Test);
Test_Suite : aliased AUnit.Test_Suites.Test_Suite;
function Suite return AUnit.Test_Suites.Access_Test_Suite is
Name : constant String := "(SIMD - AVX - Math) ";
begin
Test_Suite.Add_Test (Caller.Create
(Name & "Test Max function", Test_Max'Access));
Test_Suite.Add_Test (Caller.Create
(Name & "Test Min function", Test_Min'Access));
Test_Suite.Add_Test (Caller.Create
(Name & "Test Round_Nearest_Integer function", Test_Nearest_Integer'Access));
Test_Suite.Add_Test (Caller.Create
(Name & "Test Floor function", Test_Floor'Access));
Test_Suite.Add_Test (Caller.Create
(Name & "Test Ceil function", Test_Ceil'Access));
Test_Suite.Add_Test (Caller.Create
(Name & "Test Round_Truncate function", Test_Truncate'Access));
return Test_Suite'Access;
end Suite;
procedure Test_Max (Object : in out Test) is
Left : constant m256d := (0.0, 1.0, -2.0, 1.0);
Right : constant m256d := (0.0, 0.0, 1.0, 2.0);
Expected : constant m256d := (0.0, 1.0, 1.0, 2.0);
Result : constant m256d := Max (Left, Right);
begin
for I in Index_Homogeneous loop
Assert (Expected (I) = Result (I), "Unexpected Double at " & Index_Homogeneous'Image (I));
end loop;
end Test_Max;
procedure Test_Min (Object : in out Test) is
Left : constant m256d := (0.0, 1.0, -2.0, 1.0);
Right : constant m256d := (0.0, 0.0, 1.0, 2.0);
Expected : constant m256d := (0.0, 0.0, -2.0, 1.0);
Result : constant m256d := Min (Left, Right);
begin
for I in Index_Homogeneous loop
Assert (Expected (I) = Result (I), "Unexpected Double at " & Index_Homogeneous'Image (I));
end loop;
end Test_Min;
procedure Test_Nearest_Integer (Object : in out Test) is
Elements : constant m256d := (-1.5, 0.6, -0.4, 1.9);
Expected : constant m256d := (-2.0, 1.0, 0.0, 2.0);
Result : constant m256d := Round_Nearest_Integer (Elements);
begin
for I in Index_Homogeneous loop
Assert (Expected (I) = Result (I), "Unexpected Double at " & Index_Homogeneous'Image (I));
end loop;
end Test_Nearest_Integer;
procedure Test_Floor (Object : in out Test) is
Elements : constant m256d := (-1.5, 0.6, -0.4, 1.9);
Expected : constant m256d := (-2.0, 0.0, -1.0, 1.0);
Result : constant m256d := Floor (Elements);
begin
for I in Index_Homogeneous loop
Assert (Expected (I) = Result (I), "Unexpected Double at " & Index_Homogeneous'Image (I));
end loop;
end Test_Floor;
procedure Test_Ceil (Object : in out Test) is
Elements : constant m256d := (-1.5, 0.2, -0.4, 1.9);
Expected : constant m256d := (-1.0, 1.0, 0.0, 2.0);
Result : constant m256d := Ceil (Elements);
begin
for I in Index_Homogeneous loop
Assert (Expected (I) = Result (I), "Unexpected Double at " & Index_Homogeneous'Image (I));
end loop;
end Test_Ceil;
procedure Test_Truncate (Object : in out Test) is
Elements : constant m256d := (-1.5, 0.2, -0.4, 1.9);
Expected : constant m256d := (-1.0, 0.0, 0.0, 1.0);
Result : constant m256d := Round_Truncate (Elements);
begin
for I in Index_Homogeneous loop
Assert (Expected (I) = Result (I), "Unexpected Double at " & Index_Homogeneous'Image (I));
end loop;
end Test_Truncate;
end Test_SIMD_AVX_Math;
|
-- Copyright 2008-2016 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Types is
type Object_Int is interface;
type Another_Int is interface;
type Object_Root is abstract tagged record
X : Natural;
Y : Natural;
end record;
type Object is abstract new Object_Root and Object_Int and Another_Int
with null record;
function Ident (O : Object'Class) return Object'Class;
procedure Do_Nothing (O : in out Object'Class);
type Rectangle is new Object with record
W : Natural;
H : Natural;
end record;
type Circle is new Object with record
R : Natural;
end record;
end Types;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY COMPONENTS --
-- --
-- S Y S T E M . C O M P A R E _ A R R A Y _ U N S I G N E D _ 3 2 --
-- --
-- S p e c --
-- --
-- Copyright (C) 2002-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains functions for runtime comparisons on arrays whose
-- elements are 32-bit discrete type values to be treated as unsigned.
package System.Compare_Array_Unsigned_32 is
-- Note: although the functions in this package are in a sense Pure, the
-- package cannot be declared as Pure, since the arguments are addresses,
-- not the data, and the result is not pure wrt the address values.
function Compare_Array_U32
(Left : System.Address;
Right : System.Address;
Left_Len : Natural;
Right_Len : Natural) return Integer;
-- Compare the array starting at address Left of length Left_Len
-- with the array starting at address Right of length Right_Len.
-- The comparison is in the normal Ada semantic sense of array
-- comparison. The result is -1,0,+1 for Left<Right, Left=Right,
-- Left>Right respectively.
end System.Compare_Array_Unsigned_32;
|
-----------------------------------------------------------------------
-- components-utils-beans -- Bean component utility
-- Copyright (C) 2011 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package body ASF.Components.Utils.Beans is
-- ------------------------------
-- Evaluate the <b>value</b> attribute and set it in the value expression
-- referred to by the <b>var</b> attribute.
-- ------------------------------
overriding
procedure Encode_Begin (UI : in UISetBean;
Context : in out ASF.Contexts.Faces.Faces_Context'Class) is
VE : constant EL.Expressions.Value_Expression := UI.Get_Value_Expression ("var");
begin
if VE.Is_Null then
UI.Log_Error ("Invalid value expression for 'var'");
return;
end if;
VE.Set_Value (Context => Context.Get_ELContext.all,
Value => UI.Get_Attribute (Context => Context, Name => "value"));
end Encode_Begin;
end ASF.Components.Utils.Beans;
|
with Ada.Text_IO; use Ada.Text_IO;
procedure Print_Line is
Printer : File_Type;
begin
begin
Open (Printer, Mode => Out_File, Name => "/dev/lp0");
exception
when others =>
Put_Line ("Unable to open printer.");
return;
end;
Set_Output (Printer);
Put_Line ("Hello World!");
Close (Printer);
end Print_Line;
|
-- BinToAsc_Suite
-- Unit tests for BinToAsc
-- Copyright (c) 2015, James Humphry - see LICENSE file for details
with BinToAsc_Suite.Misc_Tests;
with BinToAsc_Suite.Base16_Tests;
with BinToAsc_Suite.Base32_Tests;
with BinToAsc_Suite.Base64_Tests;
with BinToAsc_Suite.Base85_Tests;
package body BinToAsc_Suite is
use AUnit.Test_Suites;
Result : aliased Test_Suite;
Test_Misc : aliased Misc_Tests.Misc_Test;
Test_Base16 : aliased Base16_Tests.Base16_Test;
Test_Base32 : aliased Base32_Tests.Base32_Test;
Test_Base64 : aliased Base64_Tests.Base64_Test;
Test_Base85 : aliased Base85_Tests.Base85_Test;
-----------
-- Suite --
-----------
function Suite return AUnit.Test_Suites.Access_Test_Suite is
begin
Add_Test (Result'Access, Test_Misc'Access);
Add_Test (Result'Access, Test_Base16'Access);
Add_Test (Result'Access, Test_Base32'Access);
Add_Test (Result'Access, Test_Base64'Access);
Add_Test (Result'Access, Test_Base85'Access);
return Result'Access;
end Suite;
end BinToAsc_Suite;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
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_Expansion_Regions is
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UML_Expansion_Region_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_Expansion_Region
(AMF.UML.Expansion_Regions.UML_Expansion_Region_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UML_Expansion_Region_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_Expansion_Region
(AMF.UML.Expansion_Regions.UML_Expansion_Region_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UML_Expansion_Region_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_Expansion_Region
(Visitor,
AMF.UML.Expansion_Regions.UML_Expansion_Region_Access (Self),
Control);
end if;
end Visit_Element;
-----------------------
-- Get_Input_Element --
-----------------------
overriding function Get_Input_Element
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Expansion_Nodes.Collections.Set_Of_UML_Expansion_Node is
begin
return
AMF.UML.Expansion_Nodes.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Input_Element
(Self.Element)));
end Get_Input_Element;
--------------
-- Get_Mode --
--------------
overriding function Get_Mode
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.UML_Expansion_Kind is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Mode
(Self.Element);
end Get_Mode;
--------------
-- Set_Mode --
--------------
overriding procedure Set_Mode
(Self : not null access UML_Expansion_Region_Proxy;
To : AMF.UML.UML_Expansion_Kind) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Mode
(Self.Element, To);
end Set_Mode;
------------------------
-- Get_Output_Element --
------------------------
overriding function Get_Output_Element
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Expansion_Nodes.Collections.Set_Of_UML_Expansion_Node is
begin
return
AMF.UML.Expansion_Nodes.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Output_Element
(Self.Element)));
end Get_Output_Element;
------------------
-- Get_Activity --
------------------
overriding function Get_Activity
(Self : not null access constant UML_Expansion_Region_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_Activity
(Self.Element)));
end Get_Activity;
------------------
-- Set_Activity --
------------------
overriding procedure Set_Activity
(Self : not null access UML_Expansion_Region_Proxy;
To : AMF.UML.Activities.UML_Activity_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Activity
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Activity;
--------------
-- Get_Edge --
--------------
overriding function Get_Edge
(Self : not null access constant UML_Expansion_Region_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_Must_Isolate --
----------------------
overriding function Get_Must_Isolate
(Self : not null access constant UML_Expansion_Region_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Must_Isolate
(Self.Element);
end Get_Must_Isolate;
----------------------
-- Set_Must_Isolate --
----------------------
overriding procedure Set_Must_Isolate
(Self : not null access UML_Expansion_Region_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Must_Isolate
(Self.Element, To);
end Set_Must_Isolate;
--------------
-- Get_Node --
--------------
overriding function Get_Node
(Self : not null access constant UML_Expansion_Region_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_Structured_Node_Input --
-------------------------------
overriding function Get_Structured_Node_Input
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Input_Pins.Collections.Set_Of_UML_Input_Pin is
begin
return
AMF.UML.Input_Pins.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Structured_Node_Input
(Self.Element)));
end Get_Structured_Node_Input;
--------------------------------
-- Get_Structured_Node_Output --
--------------------------------
overriding function Get_Structured_Node_Output
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Output_Pins.Collections.Set_Of_UML_Output_Pin is
begin
return
AMF.UML.Output_Pins.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Structured_Node_Output
(Self.Element)));
end Get_Structured_Node_Output;
------------------
-- Get_Variable --
------------------
overriding function Get_Variable
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Variables.Collections.Set_Of_UML_Variable is
begin
return
AMF.UML.Variables.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Variable
(Self.Element)));
end Get_Variable;
------------------------
-- Get_Element_Import --
------------------------
overriding function Get_Element_Import
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Element_Imports.Collections.Set_Of_UML_Element_Import is
begin
return
AMF.UML.Element_Imports.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Element_Import
(Self.Element)));
end Get_Element_Import;
-------------------------
-- Get_Imported_Member --
-------------------------
overriding function Get_Imported_Member
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
return
AMF.UML.Packageable_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Imported_Member
(Self.Element)));
end Get_Imported_Member;
----------------
-- Get_Member --
----------------
overriding function Get_Member
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Member
(Self.Element)));
end Get_Member;
----------------------
-- Get_Owned_Member --
----------------------
overriding function Get_Owned_Member
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Member
(Self.Element)));
end Get_Owned_Member;
--------------------
-- Get_Owned_Rule --
--------------------
overriding function Get_Owned_Rule
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint is
begin
return
AMF.UML.Constraints.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Rule
(Self.Element)));
end Get_Owned_Rule;
------------------------
-- Get_Package_Import --
------------------------
overriding function Get_Package_Import
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Package_Imports.Collections.Set_Of_UML_Package_Import is
begin
return
AMF.UML.Package_Imports.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Package_Import
(Self.Element)));
end Get_Package_Import;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant UML_Expansion_Region_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_Expansion_Region_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_Expansion_Region_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_Expansion_Region_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_Expansion_Region_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.UML_Attributes.Internal_Get_Qualified_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Qualified_Name;
------------------------
-- Get_Contained_Edge --
------------------------
overriding function Get_Contained_Edge
(Self : not null access constant UML_Expansion_Region_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_Expansion_Region_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_Expansion_Region_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_Expansion_Region_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_Expansion_Region_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_Expansion_Region_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_Context --
-----------------
overriding function Get_Context
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access is
begin
return
AMF.UML.Classifiers.UML_Classifier_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Context
(Self.Element)));
end Get_Context;
---------------
-- Get_Input --
---------------
overriding function Get_Input
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Input_Pins.Collections.Ordered_Set_Of_UML_Input_Pin is
begin
return
AMF.UML.Input_Pins.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Input
(Self.Element)));
end Get_Input;
------------------------------
-- Get_Is_Locally_Reentrant --
------------------------------
overriding function Get_Is_Locally_Reentrant
(Self : not null access constant UML_Expansion_Region_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Locally_Reentrant
(Self.Element);
end Get_Is_Locally_Reentrant;
------------------------------
-- Set_Is_Locally_Reentrant --
------------------------------
overriding procedure Set_Is_Locally_Reentrant
(Self : not null access UML_Expansion_Region_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Locally_Reentrant
(Self.Element, To);
end Set_Is_Locally_Reentrant;
-----------------------------
-- Get_Local_Postcondition --
-----------------------------
overriding function Get_Local_Postcondition
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint is
begin
return
AMF.UML.Constraints.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Local_Postcondition
(Self.Element)));
end Get_Local_Postcondition;
----------------------------
-- Get_Local_Precondition --
----------------------------
overriding function Get_Local_Precondition
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint is
begin
return
AMF.UML.Constraints.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Local_Precondition
(Self.Element)));
end Get_Local_Precondition;
----------------
-- Get_Output --
----------------
overriding function Get_Output
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Output_Pins.Collections.Ordered_Set_Of_UML_Output_Pin is
begin
return
AMF.UML.Output_Pins.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Output
(Self.Element)));
end Get_Output;
-----------------
-- Get_Handler --
-----------------
overriding function Get_Handler
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Exception_Handlers.Collections.Set_Of_UML_Exception_Handler is
begin
return
AMF.UML.Exception_Handlers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Handler
(Self.Element)));
end Get_Handler;
------------------
-- Get_In_Group --
------------------
overriding function Get_In_Group
(Self : not null access constant UML_Expansion_Region_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_In_Group
(Self.Element)));
end Get_In_Group;
---------------------------------
-- Get_In_Interruptible_Region --
---------------------------------
overriding function Get_In_Interruptible_Region
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Interruptible_Activity_Regions.Collections.Set_Of_UML_Interruptible_Activity_Region is
begin
return
AMF.UML.Interruptible_Activity_Regions.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_In_Interruptible_Region
(Self.Element)));
end Get_In_Interruptible_Region;
----------------------
-- Get_In_Partition --
----------------------
overriding function Get_In_Partition
(Self : not null access constant UML_Expansion_Region_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_In_Partition
(Self.Element)));
end Get_In_Partition;
----------------------------
-- Get_In_Structured_Node --
----------------------------
overriding function Get_In_Structured_Node
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access is
begin
return
AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_In_Structured_Node
(Self.Element)));
end Get_In_Structured_Node;
----------------------------
-- Set_In_Structured_Node --
----------------------------
overriding procedure Set_In_Structured_Node
(Self : not null access UML_Expansion_Region_Proxy;
To : AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_In_Structured_Node
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_In_Structured_Node;
------------------
-- Get_Incoming --
------------------
overriding function Get_Incoming
(Self : not null access constant UML_Expansion_Region_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_Incoming
(Self.Element)));
end Get_Incoming;
------------------
-- Get_Outgoing --
------------------
overriding function Get_Outgoing
(Self : not null access constant UML_Expansion_Region_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_Outgoing
(Self.Element)));
end Get_Outgoing;
------------------------
-- Get_Redefined_Node --
------------------------
overriding function Get_Redefined_Node
(Self : not null access constant UML_Expansion_Region_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_Redefined_Node
(Self.Element)));
end Get_Redefined_Node;
-----------------
-- Get_Is_Leaf --
-----------------
overriding function Get_Is_Leaf
(Self : not null access constant UML_Expansion_Region_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Leaf
(Self.Element);
end Get_Is_Leaf;
-----------------
-- Set_Is_Leaf --
-----------------
overriding procedure Set_Is_Leaf
(Self : not null access UML_Expansion_Region_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Leaf
(Self.Element, To);
end Set_Is_Leaf;
---------------------------
-- Get_Redefined_Element --
---------------------------
overriding function Get_Redefined_Element
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element is
begin
return
AMF.UML.Redefinable_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Redefined_Element
(Self.Element)));
end Get_Redefined_Element;
------------------------------
-- Get_Redefinition_Context --
------------------------------
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Redefinition_Context
(Self.Element)));
end Get_Redefinition_Context;
------------------------
-- Exclude_Collisions --
------------------------
overriding function Exclude_Collisions
(Self : not null access constant UML_Expansion_Region_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Exclude_Collisions unimplemented");
raise Program_Error with "Unimplemented procedure UML_Expansion_Region_Proxy.Exclude_Collisions";
return Exclude_Collisions (Self, Imps);
end Exclude_Collisions;
-------------------------
-- Get_Names_Of_Member --
-------------------------
overriding function Get_Names_Of_Member
(Self : not null access constant UML_Expansion_Region_Proxy;
Element : AMF.UML.Named_Elements.UML_Named_Element_Access)
return AMF.String_Collections.Set_Of_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Get_Names_Of_Member unimplemented");
raise Program_Error with "Unimplemented procedure UML_Expansion_Region_Proxy.Get_Names_Of_Member";
return Get_Names_Of_Member (Self, Element);
end Get_Names_Of_Member;
--------------------
-- Import_Members --
--------------------
overriding function Import_Members
(Self : not null access constant UML_Expansion_Region_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Import_Members unimplemented");
raise Program_Error with "Unimplemented procedure UML_Expansion_Region_Proxy.Import_Members";
return Import_Members (Self, Imps);
end Import_Members;
---------------------
-- Imported_Member --
---------------------
overriding function Imported_Member
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Imported_Member unimplemented");
raise Program_Error with "Unimplemented procedure UML_Expansion_Region_Proxy.Imported_Member";
return Imported_Member (Self);
end Imported_Member;
---------------------------------
-- Members_Are_Distinguishable --
---------------------------------
overriding function Members_Are_Distinguishable
(Self : not null access constant UML_Expansion_Region_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Members_Are_Distinguishable unimplemented");
raise Program_Error with "Unimplemented procedure UML_Expansion_Region_Proxy.Members_Are_Distinguishable";
return Members_Are_Distinguishable (Self);
end Members_Are_Distinguishable;
------------------
-- Owned_Member --
------------------
overriding function Owned_Member
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Owned_Member unimplemented");
raise Program_Error with "Unimplemented procedure UML_Expansion_Region_Proxy.Owned_Member";
return Owned_Member (Self);
end Owned_Member;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant UML_Expansion_Region_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_Expansion_Region_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_Expansion_Region_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_Expansion_Region_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_Expansion_Region_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_Expansion_Region_Proxy.Namespace";
return Namespace (Self);
end Namespace;
-------------
-- Context --
-------------
overriding function Context
(Self : not null access constant UML_Expansion_Region_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Context unimplemented");
raise Program_Error with "Unimplemented procedure UML_Expansion_Region_Proxy.Context";
return Context (Self);
end Context;
------------------------
-- Is_Consistent_With --
------------------------
overriding function Is_Consistent_With
(Self : not null access constant UML_Expansion_Region_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Consistent_With unimplemented");
raise Program_Error with "Unimplemented procedure UML_Expansion_Region_Proxy.Is_Consistent_With";
return Is_Consistent_With (Self, Redefinee);
end Is_Consistent_With;
-----------------------------------
-- Is_Redefinition_Context_Valid --
-----------------------------------
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Expansion_Region_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Redefinition_Context_Valid unimplemented");
raise Program_Error with "Unimplemented procedure UML_Expansion_Region_Proxy.Is_Redefinition_Context_Valid";
return Is_Redefinition_Context_Valid (Self, Redefined);
end Is_Redefinition_Context_Valid;
end AMF.Internals.UML_Expansion_Regions;
|
-----------------------------------------------------------------------
-- components-root -- ASF Root View Component
-- Copyright (C) 2010, 2011, 2012 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Finalization;
limited with ASF.Components.Base;
package ASF.Components.Root is
type UIViewRoot is private;
-- Get the root node of the view.
function Get_Root (UI : in UIViewRoot) return access ASF.Components.Base.UIComponent'Class;
-- Get the view identifier.
function Get_View_Id (UI : in UIViewRoot) return String;
-- Create an identifier for a component.
procedure Create_Unique_Id (UI : in out UIViewRoot;
Id : out Natural);
-- Set the root node of the view.
procedure Set_Root (UI : in out UIViewRoot;
Root : access ASF.Components.Base.UIComponent'Class;
Name : in String);
-- Set the metadata component of the view.
procedure Set_Meta (UI : in out UIViewRoot);
-- Returns True if the view has a metadata component.
function Has_Meta (UI : in UIViewRoot) return Boolean;
private
-- The <b>Root_Holder</b> must be shared by multiple <b>UIViewRoot</b> instances.
-- If this happens, this is shared by the <b>same</b> task.
type Root_Holder (Len : Natural) is limited record
Ref_Counter : Natural;
View : access ASF.Components.Base.UIComponent'Class;
Meta : access ASF.Components.Base.UIComponent'Class;
Name : String (1 .. Len);
end record;
type Root_Holder_Access is access all Root_Holder;
type UIViewRoot is new Ada.Finalization.Controlled with record
Root : Root_Holder_Access := null;
Last_Id : Natural := 0;
end record;
-- Increment the reference counter.
overriding
procedure Adjust (Object : in out UIViewRoot);
-- Free the memory held by the component tree.
overriding
procedure Finalize (Object : in out UIViewRoot);
end ASF.Components.Root;
|
-- Copyright 2012-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pck is
procedure Break_Me;
-- A procedure doing nothing, but which is a convenient anchor
-- for inserting breakpoints.
end Pck;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
-- A package can have one or more profile applications to indicate which
-- profiles have been applied. Because a profile is a package, it is possible
-- to apply a profile not only to packages, but also to profiles.
--
-- Package specializes TemplateableElement and PackageableElement specializes
-- ParameterableElement to specify that a package can be used as a template
-- and a PackageableElement as a template parameter.
--
-- A package is used to group elements, and provides a namespace for the
-- grouped elements.
------------------------------------------------------------------------------
limited with AMF.UML.Named_Elements;
with AMF.UML.Namespaces;
limited with AMF.UML.Package_Merges.Collections;
with AMF.UML.Packageable_Elements;
limited with AMF.UML.Packageable_Elements.Collections;
limited with AMF.UML.Packages.Collections;
limited with AMF.UML.Profile_Applications.Collections;
limited with AMF.UML.Profiles;
limited with AMF.UML.Stereotypes.Collections;
with AMF.UML.Templateable_Elements;
limited with AMF.UML.Types.Collections;
package AMF.UML.Packages is
pragma Preelaborate;
type UML_Package is limited interface
and AMF.UML.Namespaces.UML_Namespace
and AMF.UML.Packageable_Elements.UML_Packageable_Element
and AMF.UML.Templateable_Elements.UML_Templateable_Element;
type UML_Package_Access is
access all UML_Package'Class;
for UML_Package_Access'Storage_Size use 0;
not overriding function Get_URI
(Self : not null access constant UML_Package)
return AMF.Optional_String is abstract;
-- Getter of Package::URI.
--
-- Provides an identifier for the package that can be used for many
-- purposes. A URI is the universally unique identification of the package
-- following the IETF URI specification, RFC 2396
-- http://www.ietf.org/rfc/rfc2396.txt and it must comply with those
-- syntax rules.
not overriding procedure Set_URI
(Self : not null access UML_Package;
To : AMF.Optional_String) is abstract;
-- Setter of Package::URI.
--
-- Provides an identifier for the package that can be used for many
-- purposes. A URI is the universally unique identification of the package
-- following the IETF URI specification, RFC 2396
-- http://www.ietf.org/rfc/rfc2396.txt and it must comply with those
-- syntax rules.
not overriding function Get_Nested_Package
(Self : not null access constant UML_Package)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is abstract;
-- Getter of Package::nestedPackage.
--
-- References the packaged elements that are Packages.
not overriding function Get_Nesting_Package
(Self : not null access constant UML_Package)
return AMF.UML.Packages.UML_Package_Access is abstract;
-- Getter of Package::nestingPackage.
--
-- References the Package that owns this Package.
not overriding procedure Set_Nesting_Package
(Self : not null access UML_Package;
To : AMF.UML.Packages.UML_Package_Access) is abstract;
-- Setter of Package::nestingPackage.
--
-- References the Package that owns this Package.
not overriding function Get_Owned_Stereotype
(Self : not null access constant UML_Package)
return AMF.UML.Stereotypes.Collections.Set_Of_UML_Stereotype is abstract;
-- Getter of Package::ownedStereotype.
--
-- References the Stereotypes that are owned by the Package
not overriding function Get_Owned_Type
(Self : not null access constant UML_Package)
return AMF.UML.Types.Collections.Set_Of_UML_Type is abstract;
-- Getter of Package::ownedType.
--
-- References the packaged elements that are Types.
not overriding function Get_Package_Merge
(Self : not null access constant UML_Package)
return AMF.UML.Package_Merges.Collections.Set_Of_UML_Package_Merge is abstract;
-- Getter of Package::packageMerge.
--
-- References the PackageMerges that are owned by this Package.
not overriding function Get_Packaged_Element
(Self : not null access constant UML_Package)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is abstract;
-- Getter of Package::packagedElement.
--
-- Specifies the packageable elements that are owned by this Package.
not overriding function Get_Profile_Application
(Self : not null access constant UML_Package)
return AMF.UML.Profile_Applications.Collections.Set_Of_UML_Profile_Application is abstract;
-- Getter of Package::profileApplication.
--
-- References the ProfileApplications that indicate which profiles have
-- been applied to the Package.
not overriding function All_Applicable_Stereotypes
(Self : not null access constant UML_Package)
return AMF.UML.Stereotypes.Collections.Set_Of_UML_Stereotype is abstract;
-- Operation Package::allApplicableStereotypes.
--
-- The query allApplicableStereotypes() returns all the directly or
-- indirectly owned stereotypes, including stereotypes contained in
-- sub-profiles.
not overriding function Containing_Profile
(Self : not null access constant UML_Package)
return AMF.UML.Profiles.UML_Profile_Access is abstract;
-- Operation Package::containingProfile.
--
-- The query containingProfile() returns the closest profile directly or
-- indirectly containing this package (or this package itself, if it is a
-- profile).
not overriding function Makes_Visible
(Self : not null access constant UML_Package;
El : AMF.UML.Named_Elements.UML_Named_Element_Access)
return Boolean is abstract;
-- Operation Package::makesVisible.
--
-- The query makesVisible() defines whether a Package makes an element
-- visible outside itself. Elements with no visibility and elements with
-- public visibility are made visible.
overriding function Must_Be_Owned
(Self : not null access constant UML_Package)
return Boolean is abstract;
-- Operation Package::mustBeOwned.
--
-- The query mustBeOwned() indicates whether elements of this type must
-- have an owner.
not overriding function Nested_Package
(Self : not null access constant UML_Package)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is abstract;
-- Operation Package::nestedPackage.
--
-- Missing derivation for Package::/nestedPackage : Package
not overriding function Owned_Stereotype
(Self : not null access constant UML_Package)
return AMF.UML.Stereotypes.Collections.Set_Of_UML_Stereotype is abstract;
-- Operation Package::ownedStereotype.
--
-- Missing derivation for Package::/ownedStereotype : Stereotype
not overriding function Owned_Type
(Self : not null access constant UML_Package)
return AMF.UML.Types.Collections.Set_Of_UML_Type is abstract;
-- Operation Package::ownedType.
--
-- Missing derivation for Package::/ownedType : Type
not overriding function Visible_Members
(Self : not null access constant UML_Package)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is abstract;
-- Operation Package::visibleMembers.
--
-- The query visibleMembers() defines which members of a Package can be
-- accessed outside it.
end AMF.UML.Packages;
|
-----------------------------------------------------------------------
-- servlet -- Ada Servlet
-- Copyright (C) 2009, 2010, 2018 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
-- Ada Servlet is an adapted implementation of JSR 154 and 315,
-- the Java Servlet for Ada 2005.
package Servlet is
pragma Pure;
end Servlet;
|
------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT IMPLEMENTATION COMPONENTS --
-- --
-- A S I S . D A T A _ D E C O M P O S I T I O N . S E T _ G E T --
-- --
-- S p e c --
-- --
-- Copyright (c) 1995-2005, Free Software Foundation, Inc. --
-- --
-- ASIS-for-GNAT is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the Free --
-- Software Foundation; either version 2, or (at your option) any later --
-- version. ASIS-for-GNAT is distributed in the hope that it will be use- --
-- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- --
-- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General --
-- Public License for more details. You should have received a copy of the --
-- GNU General Public License distributed with ASIS-for-GNAT; see file --
-- COPYING. If not, write to the Free Software Foundation, 59 Temple Place --
-- - Suite 330, Boston, MA 02111-1307, 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 Ada Core Technologies Inc --
-- (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This package contains access and update routines for abstractions
-- declared in Asis.Data_Decomposition.
--
-- It also contains routines for creating lists of record and array
-- components
with A4G.Asis_Tables; use A4G.Asis_Tables;
with A4G.DDA_Aux; use A4G.DDA_Aux;
with Table;
private package Asis.Data_Decomposition.Set_Get is
-- Tables used to create query results which are of list types:
package Record_Component_Table is new Table.Table (
Table_Component_Type => Record_Component,
Table_Index_Type => Asis.ASIS_Natural,
Table_Low_Bound => 1,
Table_Initial => 10,
Table_Increment => 100,
Table_Name => "Record_Componnet_List");
RC_Table : Record_Component_Table.Table_Ptr renames
Record_Component_Table.Table;
Def_N_Table : Asis_Element_Table.Table_Ptr renames
Asis_Element_Table.Table;
Nil_Record_Component_List : Record_Component_List (1 .. 0);
-- Nil constant for Record_Component_List is not provided in the
-- Asis.Data_Decomposition package.
Parent_Type_Definition : Element;
-- Global variable used to store the type definition from which componnets
-- are extracted
Record_Type_Entity : Entity_Id;
-- Global variable used to store the type entity defining the type of
-- a record. This is a type entity which actually defines the
-- type, that is, it may be an implicit type as well
procedure Set_Parent_Type_Definition (E : Element);
-- Sets Parent_Type_Definition (Currently this is a trivial assignment,
-- but we would better keep procedural interface in case if something
-- more smart is really required here.
procedure Set_Record_Type_Entity (RC : Record_Component);
-- Sets Record_Type_Entity for RC, if Is_Record (RC)
procedure Set_Record_Type_Entity (AC : Array_Component);
-- Sets Record_Type_Entity for AC, if Is_Record (AC)
procedure Set_Record_Type_Entity;
-- Sets Record_Type_Entity by using the valuse of Parent_Type_Definition
-- global variable
-- Access functions to Record_Component fields:
subtype RC is Record_Component;
function Parent_Record_Type (Comp : RC) return Asis.Declaration;
function Component_Name (Comp : RC) return Asis.Defining_Name;
function Is_Record_Comp (Comp : RC) return Boolean;
function Is_Array_Comp (Comp : RC) return Boolean;
function Parent_Discrims (Comp : RC) return Discrim_List;
function Get_Type_Entity (Comp : RC) return Entity_Id;
-- Returns type Entity describing the subtype of the component.
-- It may be implicit type as well
function Get_Comp_Entity (Comp : RC) return Entity_Id;
-- Returns the Entity Id of the given record component
function Get_Record_Entity (Comp : RC) return Entity_Id;
-- Returns the Entity Id of the enclosing record type declaration
-- for a given component (it may be a type derived from a record type)
-- Array Components:
subtype AC is Array_Component;
function Parent_Array_Type (Comp : AC) return Asis.Declaration;
function Is_Record_Comp (Comp : AC) return Boolean;
function Is_Array_Comp (Comp : AC) return Boolean;
function Dimension (Comp : AC) return ASIS_Natural;
function Parent_Discrims (Comp : AC) return Discrim_List;
function Get_Array_Type_Entity (Comp : AC) return Entity_Id;
-- Returns the Entity_Id for the array type from which this array
-- component is extracted. It may be the Id of some implicit array type
-- as well
procedure Set_Parent_Discrims (Comp : in out AC; Discs : Discrim_List);
-- Sets Discs as Parent_Discrims for Comp. In case if Discs is
-- Null_Discrims sets Parent_Discrims as null.
type List_Kinds is (New_List, Append);
-- The way of creating a list in Element or Component Table
procedure Set_Named_Components (E : Element; List_Kind : List_Kinds);
-- Stores all the A_Defining_Identifier components contained in E in
-- Asis_Element_Table. If List_Kind is set to New_List, it resets
-- Asis_Element_Table before putting any information in it. If List_Kind
-- is set to Append, the Table is not reset, and the created list
-- is appended to the list already stored in the table.
procedure Set_All_Named_Components (E : Element);
-- Provided that E is a record type definition or a definition of a
-- derived type derived from some record type, this function
-- stores all the A_Defining_Identifier Elements defining the
-- componnets for this type in Asis_Element_Table. Before doing this,
-- the procedure resets Asis_Element_Table.
procedure Set_Record_Components_From_Names
(Parent_First_Bit : ASIS_Natural := 0;
Data_Stream : Portable_Data := Nil_Portable_Data;
Discriminants : Boolean := False);
-- Supposing that an appropriate list of component defining names is set
-- in the Asis_Element_Table, this procedure converts them into
-- the corresponding list of record componnets in Record_Component_Table.
--
-- Parent_First_Bit is needed to compute the first bit and position of
-- the component that is extracted from another (record or array)
-- component. Usually everything is alligned at least bytewise, but in case
-- if representation clauses are used to create heavily packed data
-- structure, we may need to know where to start to compute the component
-- beginning
--
-- If Data_Stream parameter is set, it is used to define which
-- components from the list set in Asis_Element_Table should be
-- presented in the result.
--
-- Discriminants flag is used to indicate the case when (only)
-- discriminant components should be constructed, in this case no
-- discriminant constraint (explicit or default) should be taken into
-- account (they may be dynamic in case of A_Complex_Dynamic_Model type).
function Set_Array_Componnet
(Array_Type_Definition : Element;
Enclosing_Record_Component : Record_Component := Nil_Record_Component;
Parent_Indication : Element := Nil_Element;
Parent_Discriminants : Discrim_List := Null_Discrims;
Parent_First_Bit_Offset : ASIS_Natural := 0;
Dynamic_Array : Boolean := False)
return Array_Component;
-- Sets and returns an Array_Component value. Array_Type_Definition
-- parameter should represent a (constrained or unconstrained) array type
-- definition or a derived type definition for which an ancestor type is
-- an array type. The returned value represent the component of this array
-- type. Enclosing_Record_Component is set when the array componnet to be
-- created is a part of some Record_Component, in this case the
-- corresponding component definition may contain index constraints.
-- Parent_Indication is set when the array componnet to be created is a
-- part of some other array component, in this case the corresponding
-- component subtype indication may contain an index constraint
-- ???? Documentation needs revising!!!
end Asis.Data_Decomposition.Set_Get;
|
-- =============================================================================
-- Package AVR.POWER_MANAGEMENT
--
-- Handles the power management.
-- - Sleep mode
-- - Power reduction
-- =============================================================================
package AVR.POWER_MANAGEMENT is
type Sleep_Mode_Control_Register_Type is
record
SE : Boolean; -- Sleep Enable
SM0 : Boolean; -- Sleep Mode Select Bit 0
SM1 : Boolean; -- Sleep Mode Select Bit 1
SM2 : Boolean; -- Sleep Mode Select Bit 2
Spare : Spare_Type (0 .. 3);
end record;
pragma Pack (Sleep_Mode_Control_Register_Type);
for Sleep_Mode_Control_Register_Type'Size use BYTE_SIZE;
Reg_SMCR : Sleep_Mode_Control_Register_Type;
for Reg_SMCR'Address use System'To_Address (16#53#);
type Power_Reduction_Register_0_Type is
record
PRADC : Boolean; -- Power Reduction ADC
PRUSART0 : Boolean; -- Power Reduction USART0
PRSPI : Boolean; -- Power Reduction Serial Peripheral Interface
PRTIM1 : Boolean; -- Power Reduction Timer/Counter 1
Spare : Spare_Type (0 .. 0);
PRTIM0 : Boolean; -- Power Reduction Timer/Counter 0
PRTIM2 : Boolean; -- Power Reduction Timer/Counter 2
PRTWI : Boolean; -- Power Reduction TWI
end record;
pragma Pack (Power_Reduction_Register_0_Type);
for Power_Reduction_Register_0_Type'Size use BYTE_SIZE;
#if MCU="ATMEGA2560" then
type Power_Reduction_Register_1_Type is
record
PRUSART1 : Boolean; -- Power Reduction USART 1
PRUSART2 : Boolean; -- Power Reduction USART 2
PRUSART3 : Boolean; -- Power Reduction USART 3
PRTIM3 : Boolean; -- Power Reductin Timer/Counter 3
PRTIM4 : Boolean; -- Power Reductin Timer/Counter 4
PRTIM5 : Boolean; -- Power Reductin Timer/Counter 5
Spare : Spare_Type (0 .. 1);
end record;
pragma Pack (Power_Reduction_Register_1_Type);
for Power_Reduction_Register_1_Type'Size use BYTE_SIZE;
#end if;
Reg_PRR0 : Power_Reduction_Register_0_Type;
for Reg_PRR0'Address use System'To_Address (16#64#);
#if MCU="ATMEGA2560" then
Reg_PRR1 : Power_Reduction_Register_0_Type;
for Reg_PRR1'Address use System'To_Address (16#65#);
#end if;
end AVR.POWER_MANAGEMENT;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2013 Felix Krause <contact@flyx.org>
--
-- 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 GL.Types;
private generic
with function Raw_Subprogram_Reference (Name : String) return System.Address;
package GL.Runtime_Loading is
pragma Preelaborate;
-- This package loads the raw API function pointers at runtime. Some GL
-- implementations may return a pointer even when the feature is not
-- supported. Therefore, the only reliable way on all platforms to find
-- out whether a feature is supported is by using the GL.Context package.
generic
Function_Name : String;
type Return_Type is private;
package Function_Without_Params is
type Function_Reference is not null access function return Return_Type
with Convention => StdCall;
function Init return Return_Type
with Convention => StdCall;
Ref : Function_Reference := Init'Access;
end Function_Without_Params;
generic
Function_Name : String;
type Param1_Type (<>) is private;
type Return_Type is private;
package Function_With_1_Param is
type Function_Reference is not null access function
(Param1 : Param1_Type) return Return_Type
with Convention => StdCall;
function Init (Param1 : Param1_Type) return Return_Type
with Convention => StdCall;
Ref : Function_Reference := Init'Access;
end Function_With_1_Param;
generic
Function_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Return_Type is private;
package Function_With_2_Params is
type Function_Reference is not null access function
(Param1 : Param1_Type;
Param2 : Param2_Type) return Return_Type
with Convention => StdCall;
function Init
(Param1 : Param1_Type;
Param2 : Param2_Type) return Return_Type
with Convention => StdCall;
Ref : Function_Reference := Init'Access;
end Function_With_2_Params;
generic
Function_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Return_Type is private;
package Function_With_3_Params is
type Function_Reference is not null access function
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type) return Return_Type
with Convention => StdCall;
function Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type) return Return_Type
with Convention => StdCall;
Ref : Function_Reference := Init'Access;
end Function_With_3_Params;
generic
Function_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Return_Type is private;
package Function_With_4_Params is
type Function_Reference is not null access function
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type) return Return_Type
with Convention => StdCall;
function Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type) return Return_Type
with Convention => StdCall;
Ref : Function_Reference := Init'Access;
end Function_With_4_Params;
generic
Function_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Param5_Type (<>) is private;
type Param6_Type (<>) is private;
type Param7_Type (<>) is private;
type Param8_Type (<>) is private;
type Return_Type is private;
package Function_With_8_Params is
type Function_Reference is not null access function
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type) return Return_Type
with Convention => StdCall;
function Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type) return Return_Type
with Convention => StdCall;
Ref : Function_Reference := Init'Access;
end Function_With_8_Params;
generic
Procedure_Name : String;
package Procedure_Without_Params is
type Procedure_Reference is not null access procedure
with Convention => StdCall;
procedure Init
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_Without_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
package Procedure_With_1_Param is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type)
with Convention => StdCall;
procedure Init (Param1 : Param1_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_1_Param;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
package Procedure_With_2_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_2_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
package Procedure_With_3_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_3_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
package Procedure_With_4_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_4_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Param5_Type (<>) is private;
package Procedure_With_5_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_5_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Param5_Type (<>) is private;
type Param6_Type (<>) is private;
package Procedure_With_6_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_6_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Param5_Type (<>) is private;
type Param6_Type (<>) is private;
type Param7_Type (<>) is private;
package Procedure_With_7_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_7_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Param5_Type (<>) is private;
type Param6_Type (<>) is private;
type Param7_Type (<>) is private;
type Param8_Type (<>) is private;
package Procedure_With_8_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_8_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Param5_Type (<>) is private;
type Param6_Type (<>) is private;
type Param7_Type (<>) is private;
type Param8_Type (<>) is private;
type Param9_Type (<>) is private;
package Procedure_With_9_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type;
Param9 : Param9_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type;
Param9 : Param9_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_9_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Param5_Type (<>) is private;
type Param6_Type (<>) is private;
type Param7_Type (<>) is private;
type Param8_Type (<>) is private;
type Param9_Type (<>) is private;
type Param10_Type (<>) is private;
package Procedure_With_10_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type;
Param9 : Param9_Type;
Param10 : Param10_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type;
Param9 : Param9_Type;
Param10 : Param10_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_10_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Param5_Type (<>) is private;
type Param6_Type (<>) is private;
type Param7_Type (<>) is private;
type Param8_Type (<>) is private;
type Param9_Type (<>) is private;
type Param10_Type (<>) is private;
type Param11_Type (<>) is private;
package Procedure_With_11_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type;
Param9 : Param9_Type;
Param10 : Param10_Type;
Param11 : Param11_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type;
Param9 : Param9_Type;
Param10 : Param10_Type;
Param11 : Param11_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_11_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Param5_Type (<>) is private;
type Param6_Type (<>) is private;
type Param7_Type (<>) is private;
type Param8_Type (<>) is private;
type Param9_Type (<>) is private;
type Param10_Type (<>) is private;
type Param11_Type (<>) is private;
type Param12_Type (<>) is private;
package Procedure_With_12_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type;
Param9 : Param9_Type;
Param10 : Param10_Type;
Param11 : Param11_Type;
Param12 : Param12_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type;
Param9 : Param9_Type;
Param10 : Param10_Type;
Param11 : Param11_Type;
Param12 : Param12_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_12_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Param5_Type (<>) is private;
type Param6_Type (<>) is private;
type Param7_Type (<>) is private;
type Param8_Type (<>) is private;
type Param9_Type (<>) is private;
type Param10_Type (<>) is private;
type Param11_Type (<>) is private;
type Param12_Type (<>) is private;
type Param13_Type (<>) is private;
type Param14_Type (<>) is private;
type Param15_Type (<>) is private;
package Procedure_With_15_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type;
Param9 : Param9_Type;
Param10 : Param10_Type;
Param11 : Param11_Type;
Param12 : Param12_Type;
Param13 : Param13_Type;
Param14 : Param14_Type;
Param15 : Param15_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Param6 : Param6_Type;
Param7 : Param7_Type;
Param8 : Param8_Type;
Param9 : Param9_Type;
Param10 : Param10_Type;
Param11 : Param11_Type;
Param12 : Param12_Type;
Param13 : Param13_Type;
Param14 : Param14_Type;
Param15 : Param15_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Procedure_With_15_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Element_Type is private;
type Array_Type is array (Types.Size range <>) of Element_Type;
package Array_Getter_With_5_Params is
function Ref
(Param1 : Param1_Type;
Param2 : Param2_Type;
Max_Size : Types.Size) return Array_Type;
end Array_Getter_With_5_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Param2_Type (<>) is private;
type Param3_Type (<>) is private;
type Param4_Type (<>) is private;
type Param5_Type (<>) is private;
type Element_Type is private;
type Array_Type is array (Types.Size range <>) of Element_Type;
package Array_Getter_With_8_Params is
function Ref
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Param5 : Param5_Type;
Max_Size : Types.Size) return Array_Type;
end Array_Getter_With_8_Params;
generic
Procedure_Name : String;
type Size_Type is (<>);
type Element_Type is private;
type Array_Type is array (Positive range <>) of Element_Type;
package Array_Proc_With_2_Params is
type Procedure_Reference is not null access procedure
(Param1 : Size_Type;
Param2 : Array_Type)
with Convention => StdCall;
procedure Init
(Param1 : Size_Type;
Param2 : Array_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Array_Proc_With_2_Params;
generic
Procedure_Name : String;
type Param1_Type (<>) is private;
type Size_Type is (<>);
type Element_Type is private;
type Array_Type is array (Positive range <>) of Element_Type;
package Array_Proc_With_3_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Size_Type;
Param3 : Array_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Size_Type;
Param3 : Array_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Array_Proc_With_3_Params;
generic
Procedure_Name : String;
type Param1_Type is private;
type Value_Type (<>) is private;
package Getter_With_2_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Value : in out Value_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Value : in out Value_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Getter_With_2_Params;
generic
Procedure_Name : String;
type Param1_Type is private;
type Param2_Type is private;
type Value_Type (<>) is private;
package Getter_With_3_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Value : in out Value_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Value : in out Value_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Getter_With_3_Params;
generic
Procedure_Name : String;
type Param1_Type is private;
type Param2_Type is private;
type Param3_Type is private;
type Value_Type (<>) is private;
package Getter_With_4_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Value : in out Value_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Value : in out Value_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Getter_With_4_Params;
generic
Procedure_Name : String;
type Param1_Type is private;
type Param2_Type is private;
type Param3_Type is private;
type Param4_Type is private;
type Value_Type (<>) is private;
package Getter_With_5_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Value : in out Value_Type)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Param3 : Param3_Type;
Param4 : Param4_Type;
Value : in out Value_Type)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end Getter_With_5_Params;
generic
Procedure_Name : String;
type Size_Type is (<>);
type Param1_Type is private;
package String_Getter_With_4_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Buffer_Size : Size_Type;
Length : out Size_Type;
Value : in out String)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Buffer_Size : Size_Type;
Length : out Size_Type;
Value : in out String)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end String_Getter_With_4_Params;
generic
Procedure_Name : String;
type Size_Type is (<>);
type Param1_Type is private;
type Param2_Type is private;
package String_Getter_With_5_Params is
type Procedure_Reference is not null access procedure
(Param1 : Param1_Type;
Param2 : Param2_Type;
Buffer_Size : Size_Type;
Length : out Size_Type;
Value : in out String)
with Convention => StdCall;
procedure Init
(Param1 : Param1_Type;
Param2 : Param2_Type;
Buffer_Size : Size_Type;
Length : out Size_Type;
Value : in out String)
with Convention => StdCall;
Ref : Procedure_Reference := Init'Access;
end String_Getter_With_5_Params;
end GL.Runtime_Loading;
|
-- SPDX-FileCopyrightText: 2020 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
----------------------------------------------------------------
private
package Markdown.Inline_Parsers.Autolinks is
procedure Find
(Text : Plain_Texts.Plain_Text;
Cursor : Position;
State : in out Optional_Inline_State);
end Markdown.Inline_Parsers.Autolinks;
|
with Tkmrpc.Request;
with Tkmrpc.Response;
package Tkmrpc.Operation_Handlers.Cfg.Tkm_Version is
procedure Handle (Req : Request.Data_Type; Res : out Response.Data_Type);
-- Handler for the tkm_version operation.
end Tkmrpc.Operation_Handlers.Cfg.Tkm_Version;
|
------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT IMPLEMENTATION COMPONENTS --
-- --
-- A 4 G . S K I P _ T B --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-2012, Free Software Foundation, Inc. --
-- --
-- ASIS-for-GNAT is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the Free --
-- Software Foundation; either version 2, or (at your option) any later --
-- version. ASIS-for-GNAT is distributed in the hope that it will be use- --
-- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- --
-- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General --
-- Public License for more details. You should have received a copy of the --
-- GNU General Public License distributed with ASIS-for-GNAT; see file --
-- COPYING. If not, write to the Free Software Foundation, 51 Franklin --
-- Street, Fifth Floor, Boston, MA 02110-1301, USA. --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the --
-- Software Engineering Laboratory of the Swiss Federal Institute of --
-- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the --
-- Scientific Research Computer Center of Moscow State University (SRCC --
-- MSU), Russia, with funding partially provided by grants from the Swiss --
-- National Science Foundation and the Swiss Academy of Engineering --
-- Sciences. ASIS-for-GNAT is now maintained by AdaCore --
-- (http://www.adacore.com). --
-- --
------------------------------------------------------------------------------
with Asis.Definitions; use Asis.Definitions;
with Asis.Elements; use Asis.Elements;
with Asis.Expressions; use Asis.Expressions;
with Asis.Set_Get; use Asis.Set_Get;
with A4G.A_Debug; use A4G.A_Debug;
with A4G.A_Sinput; use A4G.A_Sinput;
with A4G.A_Types; use A4G.A_Types;
with A4G.Int_Knds; use A4G.Int_Knds;
with Atree; use Atree;
with Output; use Output;
with Sinfo; use Sinfo;
package body A4G.Skip_TB is
-- In fact, there is a very few different cases of skipping the "syntax
-- sugar", but we implement this skipping by means of look-up table
-- for ease of maintenance.
-------------------------------
-- Specific Serach Functions --
-------------------------------
type Find_Source_Location_Type is access
function (E : Asis.Element; S : Source_Ptr) return Source_Ptr;
-- All the specific search functions are of the designated profile of
-- this access-to-function type. We need the Element parameter to
-- define the presennce or absence of optional component, because
-- such optional components may have trailing brackets specific for
-- them
function No_Brackets (E : Asis.Element; S : Source_Ptr) return Source_Ptr;
-- No seaqrch is made, the argument is returned
function Search_Right_Parenthesis
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr;
-- The location of the right-most ')' is returned. The search is started
-- the position S + 1, so if S itself points to ')', S will not be
-- returned
function Search_QE_Right_Parenthesis
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr;
-- Version of the previous function for a qualified expression. If the
-- argument is an aggregate which does not Needs_Extra_Parentheses, this
-- function is equivalent to No_Brackets, otherwise is the same as
-- Search_Right_Parenthesis
function Search_Attr_Right_Parenthesis
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr;
-- If E has a static expression as part of attribute designator,
-- this function looks for the location of the right-most ')'.
-- otherwise it makes no search.
-- E should be of A_First_Attribute, A_Last_Attribute, A_Length_Attribute,
-- A_Range_Attribute, An_Implementation_Defined_Attribute or
-- An_Unknown_Attribute kind only, otherwise ASIS_Inappropriate_Element
-- will be raised
function Search_Before_Semicolon
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr;
-- This is a somewhat special case: a task/protected declaration ends
-- with "end [identifier];", but the corresponding definition ends
-- with "end [identifier]", that is, *without* ";" .
-- When this function is called, it is supposed, that S points
-- to the trailing semicolon of the last component of a task/protected
-- definition or to the first character of the trailing end in case
-- if there is no component
function Search_Semicolon
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr;
-- The location of the rigt-most ';' is returned, starting from the
-- position next to S, but not S itself
function Clear_After_Funcion_Call
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr;
-- For a function call we have to make a differenve between an infix
-- call (no trailing brackets to skip) and prefix call, and in the
-- latter case - between the case when there is no parameter (no
-- trailing brackets to skip) and the case when there is(are) a
-- parameter(s) (a ')' should be skipped)
function Skip_WP (E : Asis.Element; S : Source_Ptr) return Source_Ptr;
-- This function handles a special case with
-- A_Formal_Derived_Type_Definition: in skips 'with private"
-- keywords, if any
function Search_End_Of_Box
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr;
-- If E may contain a box as the end of its text image, this function
-- returns the location of the '>' that is the end of this box, otherwise
-- it returns S. It is supposed that there is no other '<' between S and
-- the end of box except '<' that is the beginning of the box to look for.
function A_Bug (E : Asis.Element; S : Source_Ptr) return Source_Ptr;
-- This function should never be called. We need it for "others"
-- choise in the aggregate initializing the look-up table for those
-- values of Internal_Element_Kinds which should never be processed
-- (they correspond to implicit root and universal types). This
-- function raises Internal_Implementation_Error
------------------
-- Serach Array --
------------------
Skip_Switch : constant array (Internal_Element_Kinds) of
Find_Source_Location_Type :=
(An_All_Calls_Remote_Pragma ..
-- An_Asynchronous_Pragma
-- An_Atomic_Pragma
-- An_Atomic_Components_Pragma
-- An_Attach_Handler_Pragma
-- A_Controlled_Pragma
-- A_Convention_Pragma
-- An_Elaborate_All_Pragma
-- An_Elaborate_Body_Pragma
-- An_Export_Pragma
-- An_Import_Pragma
-- An_Inline_Pragma
-- An_Inspection_Point_Pragma
-- An_Interrupt_Handler_Pragma
-- An_Interrupt_Priority_Pragma
-- A_List_Pragma
-- A_Locking_Policy_Pragma
-- A_Normalize_Scalars_Pragma
-- An_Optimize_Pragma
-- A_Pack_Pragma
-- A_Page_Pragma
-- A_Preelaborate_Pragma
-- A_Priority_Pragma
-- A_Pure_Pragma
-- A_Queuing_Policy_Pragma
-- A_Remote_Call_Interface_Pragma
-- A_Remote_Types_Pragma
-- A_Restrictions_Pragma
-- A_Reviewable_Pragma
-- A_Shared_Passive_Pragma
-- A_Suppress_Pragma
-- A_Task_Dispatching_Policy_Pragma
-- A_Volatile_Pragma
-- A_Volatile_Components_Pragma
-- An_Implementation_Defined_Pragma
An_Unknown_Pragma => Search_Semicolon'Access,
A_Defining_Identifier ..
-- A_Defining_Character_Literal
-- A_Defining_Enumeration_Literal
-- A_Defining_And_Operator
-- A_Defining_Or_Operator
-- A_Defining_Xor_Operator
-- A_Defining_Equal_Operator
-- A_Defining_Not_Equal_Operator
-- A_Defining_Less_Than_Operator
-- A_Defining_Less_Than_Or_Equal_Operator
-- A_Defining_Greater_Than_Operator
-- A_Defining_Greater_Than_Or_Equal_Operator
-- A_Defining_Plus_Operator
-- A_Defining_Minus_Operator
-- A_Defining_Concatenate_Operator
-- A_Defining_Unary_Plus_Operator
-- A_Defining_Unary_Minus_Operator
-- A_Defining_Multiply_Operator
-- A_Defining_Divide_Operator
-- A_Defining_Mod_Operator
-- A_Defining_Rem_Operator
-- A_Defining_Exponentiate_Operator
-- A_Defining_Abs_Operator
-- A_Defining_Not_Operator
A_Defining_Expanded_Name => No_Brackets'Access,
An_Ordinary_Type_Declaration ..
-- A_Task_Type_Declaration
-- A_Protected_Type_Declaration
-- An_Incomplete_Type_Declaration
-- A_Private_Type_Declaration
-- A_Private_Extension_Declaration
-- A_Subtype_Declaration
-- A_Variable_Declaration
-- A_Constant_Declaration
-- A_Deferred_Constant_Declaration
-- A_Single_Task_Declaration
-- A_Single_Protected_Declaration
-- An_Integer_Number_Declaration
A_Real_Number_Declaration => Search_Semicolon'Access,
An_Enumeration_Literal_Specification => No_Brackets'Access,
A_Discriminant_Specification => No_Brackets'Access,
A_Component_Declaration => Search_Semicolon'Access,
A_Loop_Parameter_Specification => No_Brackets'Access,
A_Generalized_Iterator_Specification => No_Brackets'Access,
An_Element_Iterator_Specification => No_Brackets'Access,
A_Procedure_Declaration => Search_Semicolon'Access,
A_Function_Declaration => Search_Semicolon'Access,
A_Parameter_Specification => No_Brackets'Access,
A_Procedure_Body_Declaration ..
A_Function_Body_Declaration => Search_Semicolon'Access,
A_Return_Variable_Specification => No_Brackets'Access,
A_Return_Constant_Specification => No_Brackets'Access,
A_Null_Procedure_Declaration ..
-- An_Expression_Function_Declaration
-- A_Package_Declaration
-- A_Package_Body_Declaration
-- A_Package_Body_Declaration
-- An_Object_Renaming_Declaration
-- An_Exception_Renaming_Declaration
-- A_Package_Renaming_Declaration
-- A_Procedure_Renaming_Declaration
-- A_Function_Renaming_Declaration
-- A_Generic_Package_Renaming_Declaration
-- A_Generic_Procedure_Renaming_Declaration
-- A_Generic_Function_Renaming_Declaration
-- A_Task_Body_Declaration
-- A_Protected_Body_Declaration
-- An_Entry_Declaration
An_Entry_Body_Declaration => Search_Semicolon'Access,
An_Entry_Index_Specification => No_Brackets'Access,
A_Procedure_Body_Stub ..
-- A_Function_Body_Stub
-- A_Package_Body_Stub
-- A_Task_Body_Stub
-- A_Protected_Body_Stub
An_Exception_Declaration => Search_Semicolon'Access,
A_Choice_Parameter_Specification => No_Brackets'Access,
A_Generic_Procedure_Declaration ..
-- A_Generic_Function_Declaration
-- A_Generic_Package_Declaration
-- A_Package_Instantiation
-- A_Procedure_Instantiation
-- A_Function_Instantiation
-- A_Formal_Object_Declaration
-- A_Formal_Type_Declaration
-- A_Formal_Procedure_Declaration
-- A_Formal_Function_Declaration
-- A_Formal_Package_Declaration
A_Formal_Package_Declaration_With_Box => Search_Semicolon'Access,
A_Derived_Type_Definition => No_Brackets'Access,
A_Derived_Record_Extension_Definition => No_Brackets'Access,
An_Enumeration_Type_Definition => Search_Right_Parenthesis'Access,
A_Signed_Integer_Type_Definition ..
-- A_Modular_Type_Definition
---------------------------------------------------------
-- !!! They all are implicit and cannot have image
-- |
-- |-> A_Root_Integer_Definition
-- |-> A_Root_Real_Definition
-- |-> A_Root_Fixed_Definition
-- |-> A_Universal_Integer_Definition
-- |-> A_Universal_Real_Definition
-- +-> A_Universal_Fixed_Definition
---------------------------------------------------------
-- A_Floating_Point_Definition
-- An_Ordinary_Fixed_Point_Definition
-- A_Decimal_Fixed_Point_Definition
-- An_Unconstrained_Array_Definition
-- A_Constrained_Array_Definition
-- A_Record_Type_Definition
-- A_Tagged_Record_Type_Definition
-- A_Pool_Specific_Access_To_Variable
-- An_Access_To_Variable
An_Access_To_Constant => No_Brackets'Access,
An_Access_To_Procedure => Search_Right_Parenthesis'Access,
An_Access_To_Protected_Procedure => Search_Right_Parenthesis'Access,
An_Access_To_Function ..
-- An_Access_To_Protected_Function
-- A_Subtype_Indication
-- A_Range_Attribute_Reference
-- A_Simple_Expression_Range
-- A_Digits_Constraint
A_Delta_Constraint => No_Brackets'Access,
An_Index_Constraint => Search_Right_Parenthesis'Access,
A_Discriminant_Constraint => Search_Right_Parenthesis'Access,
A_Component_Definition ..
-- A_Discrete_Subtype_Indication_As_Subtype_Definition
-- A_Discrete_Range_Attribute_Reference_As_Subtype_Definition
-- A_Discrete_Simple_Expression_Range_As_Subtype_Definition
-- A_Discrete_Subtype_Indication
-- A_Discrete_Range_Attribute_Reference
-- A_Discrete_Simple_Expression_Range
An_Unknown_Discriminant_Part => No_Brackets'Access,
A_Known_Discriminant_Part => Search_Right_Parenthesis'Access,
A_Record_Definition => No_Brackets'Access,
A_Null_Record_Definition => No_Brackets'Access,
A_Null_Component => Search_Semicolon'Access,
A_Variant_Part => Search_Semicolon'Access,
A_Variant ..
An_Others_Choice => No_Brackets'Access,
-- --|A2005 start
An_Anonymous_Access_To_Variable ..
An_Anonymous_Access_To_Constant => No_Brackets'Access,
An_Anonymous_Access_To_Procedure ..
An_Anonymous_Access_To_Protected_Procedure =>
Search_Right_Parenthesis'Access,
An_Anonymous_Access_To_Function ..
An_Anonymous_Access_To_Protected_Function => No_Brackets'Access,
-- --|A2005 end
A_Private_Type_Definition ..
-- A_Tagged_Private_Type_Definition
A_Private_Extension_Definition => No_Brackets'Access,
A_Task_Definition ..
A_Protected_Definition => Search_Before_Semicolon'Access,
A_Formal_Private_Type_Definition ..
A_Formal_Tagged_Private_Type_Definition => No_Brackets'Access,
A_Formal_Derived_Type_Definition => Skip_WP'Access,
A_Formal_Discrete_Type_Definition ..
-- A_Formal_Signed_Integer_Type_Definition
-- A_Formal_Modular_Type_Definition
-- A_Formal_Floating_Point_Definition
-- A_Formal_Ordinary_Fixed_Point_Definition
-- A_Formal_Decimal_Fixed_Point_Definition
-- A_Formal_Unconstrained_Array_Definition
-- A_Formal_Constrained_Array_Definition
-- A_Formal_Pool_Specific_Access_To_Variable
-- A_Formal_Access_To_Variable
A_Formal_Access_To_Constant => No_Brackets'Access,
A_Formal_Access_To_Procedure =>
Search_Right_Parenthesis'Access,
A_Formal_Access_To_Protected_Procedure =>
Search_Right_Parenthesis'Access,
A_Formal_Access_To_Function ..
-- A_Formal_Access_To_Protected_Function
-- An_Integer_Literal
-- A_Real_Literal
-- A_String_Literal
-- An_Identifier
-- An_And_Operator
-- An_Or_Operator
-- An_Xor_Operator
-- An_Equal_Operator
-- A_Not_Equal_Operator
-- A_Less_Than_Operator
-- A_Less_Than_Or_Equal_Operator
-- A_Greater_Than_Operator
-- A_Greater_Than_Or_Equal_Operator
-- A_Plus_Operator
-- A_Minus_Operator
-- A_Concatenate_Operator
-- A_Unary_Plus_Operator
-- A_Unary_Minus_Operator
-- A_Multiply_Operator
-- A_Divide_Operator
-- A_Mod_Operator
-- A_Rem_Operator
-- An_Exponentiate_Operator
-- An_Abs_Operator
-- A_Not_Operator
-- A_Character_Literal
-- An_Enumeration_Literal
An_Explicit_Dereference => No_Brackets'Access,
A_Function_Call => Clear_After_Funcion_Call'Access,
An_Indexed_Component ..
A_Slice => Search_Right_Parenthesis'Access,
A_Selected_Component => No_Brackets'Access,
An_Access_Attribute ..
-- An_Address_Attribute
-- An_Adjacent_Attribute
-- An_Aft_Attribute
-- An_Alignment_Attribute
-- A_Base_Attribute
-- A_Bit_Order_Attribute
-- A_Body_Version_Attribute
-- A_Callable_Attribute
-- A_Caller_Attribute
-- A_Ceiling_Attribute
-- A_Class_Attribute
-- A_Component_Size_Attribute
-- A_Compose_Attribute
-- A_Constrained_Attribute
-- A_Copy_Sign_Attribute
-- A_Count_Attribute
-- A_Definite_Attribute
-- A_Delta_Attribute
-- A_Denorm_Attribute
-- A_Digits_Attribute
-- An_Exponent_Attribute
An_External_Tag_Attribute => No_Brackets'Access,
A_First_Attribute => Search_Attr_Right_Parenthesis'Access,
A_First_Bit_Attribute ..
-- A_Floor_Attribute
-- A_Fore_Attribute
-- A_Fraction_Attribute
-- An_Identity_Attribute
-- An_Image_Attribute
An_Input_Attribute => No_Brackets'Access,
A_Last_Attribute => Search_Attr_Right_Parenthesis'Access,
A_Last_Bit_Attribute => No_Brackets'Access,
A_Leading_Part_Attribute => No_Brackets'Access,
A_Length_Attribute => Search_Attr_Right_Parenthesis'Access,
A_Machine_Attribute ..
-- A_Machine_Emax_Attribute
-- A_Machine_Emin_Attribute
-- A_Machine_Mantissa_Attribute
-- A_Machine_Overflows_Attribute
-- A_Machine_Radix_Attribute
-- A_Machine_Rounds_Attribute
-- A_Max_Attribute
-- A_Max_Size_In_Storage_Elements_Attribute
-- A_Min_Attribute
-- A_Model_Attribute
-- A_Model_Emin_Attribute
-- A_Model_Epsilon_Attribute
-- A_Model_Mantissa_Attribute
-- A_Model_Small_Attribute
-- A_Modulus_Attribute
-- An_Output_Attribute
-- A_Partition_ID_Attribute
-- A_Pos_Attribute
-- A_Position_Attribute
A_Pred_Attribute => No_Brackets'Access,
A_Range_Attribute => Search_Attr_Right_Parenthesis'Access,
A_Read_Attribute ..
-- A_Remainder_Attribute
-- A_Round_Attribute
-- A_Rounding_Attribute
-- A_Safe_First_Attribute
-- A_Safe_Last_Attribute
-- A_Scale_Attribute
-- A_Scaling_Attribute
-- A_Signed_Zeros_Attribute
-- A_Size_Attribute
-- A_Small_Attribute
-- A_Storage_Pool_Attribute
-- A_Storage_Size_Attribute
-- A_Succ_Attribute
-- A_Tag_Attribute
-- A_Terminated_Attribute
-- A_Truncation_Attribute
-- An_Unbiased_Rounding_Attribute
-- An_Unchecked_Access_Attribute
-- A_Val_Attribute
-- A_Valid_Attribute
-- A_Value_Attribute
-- A_Version_Attribute
-- A_Wide_Image_Attribute
-- A_Wide_Value_Attribute
-- A_Wide_Width_Attribute
-- A_Width_Attribute
-- A_Write_Attribute
-- |A2006 start
-- New Ada 2005 attributes. To be alphabetically ordered later
-- A_Machine_Rounding_Attribute
-- A_Mod_Attribute
-- A_Priority_Attribute
-- A_Stream_Size_Attribute
-- A_Wide_Wide_Image_Attribute
-- A_Wide_Wide_Value_Attribute
A_Wide_Wide_Width_Attribute => No_Brackets'Access,
-- |A2006 end
An_Implementation_Defined_Attribute ..
An_Unknown_Attribute => Search_Attr_Right_Parenthesis'Access,
A_Record_Aggregate ..
-- An_Extension_Aggregate
-- A_Positional_Array_Aggregate
A_Named_Array_Aggregate => Search_Right_Parenthesis'Access,
An_And_Then_Short_Circuit ..
-- An_Or_Else_Short_Circuit
-- An_In_Range_Membership_Test
-- A_Not_In_Range_Membership_Test
-- An_In_Type_Membership_Test
-- A_Not_In_Type_Membership_Test
A_Null_Literal => No_Brackets'Access,
A_Parenthesized_Expression ..
A_Type_Conversion => Search_Right_Parenthesis'Access,
A_Qualified_Expression => Search_QE_Right_Parenthesis'Access,
An_Allocation_From_Subtype ..
An_Allocation_From_Qualified_Expression => No_Brackets'Access,
A_Case_Expression => No_Brackets'Access, -- Ada 2012
An_If_Expression => No_Brackets'Access, -- Ada 2012
A_For_All_Quantified_Expression => No_Brackets'Access, -- Ada 2012
A_For_Some_Quantified_Expression => No_Brackets'Access, -- Ada 2012
A_Pragma_Argument_Association ..
-- A_Discriminant_Association
-- A_Record_Component_Association
-- An_Array_Component_Association
A_Parameter_Association => No_Brackets'Access,
A_Generic_Association => Search_End_Of_Box'Access,
A_Null_Statement ..
-- An_Assignment_Statement
-- An_If_Statement
-- A_Case_Statement
-- A_Loop_Statement
-- A_While_Loop_Statement
-- A_For_Loop_Statement
-- A_Block_Statement
-- An_Exit_Statement
-- A_Goto_Statement
-- A_Procedure_Call_Statement
-- A_Return_Statement
-- An_Accept_Statement
-- An_Entry_Call_Statement
-- A_Requeue_Statement
-- A_Requeue_Statement_With_Abort
-- A_Delay_Until_Statement
-- A_Delay_Relative_Statement
-- A_Terminate_Alternative_Statement
-- A_Selective_Accept_Statement
-- A_Timed_Entry_Call_Statement
-- A_Conditional_Entry_Call_Statement
-- An_Asynchronous_Select_Statement
-- An_Abort_Statement
-- A_Raise_Statement
A_Code_Statement => Search_Semicolon'Access,
An_If_Path ..
-- An_Elsif_Path
-- An_Else_Path
-- A_Case_Path
-- A_Select_Path
-- An_Or_Path
-- A_Then_Abort_Path
-- A_Case_Expression_Path -- ASIS 2012
-- An_If_Expression_Path -- ASIS 2012
-- An_Elsif_Expression_Path -- ASIS 2012
An_Else_Expression_Path => No_Brackets'Access, -- Ada 2012
A_Use_Package_Clause ..
-- A_Use_Type_Clause
-- A_Use_All_Type_Clause -- Ada 2012
-- A_With_Clause
-- An_Attribute_Definition_Clause
-- An_Enumeration_Representation_Clause
-- A_Record_Representation_Clause
-- An_At_Clause
A_Component_Clause => Search_Semicolon'Access,
An_Exception_Handler => No_Brackets'Access,
others => A_Bug'Access);
-----------
-- A_Bug --
-----------
function A_Bug (E : Asis.Element; S : Source_Ptr) return Source_Ptr is
begin
pragma Unreferenced (E);
-- This function should never be called
raise Internal_Implementation_Error;
return S;
end A_Bug;
------------------------------
-- Clear_After_Funcion_Call --
------------------------------
function Clear_After_Funcion_Call
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr
is
begin
if Is_Prefix_Call (E) then
if Is_Nil (Function_Call_Parameters (E)) then
return No_Brackets (E, S);
else
return Search_Right_Parenthesis (E, S);
end if;
else
return No_Brackets (E, S);
end if;
end Clear_After_Funcion_Call;
-----------------------------
-- Needs_Extra_Parentheses --
-----------------------------
function Needs_Extra_Parentheses (E : Asis.Element) return Boolean is
Result : Boolean := False;
N : Node_Id;
begin
if Int_Kind (E) in A_Record_Aggregate .. A_Named_Array_Aggregate then
N := R_Node (E);
if Paren_Count (N) = 1 and then
Nkind (Parent (N)) = N_Qualified_Expression
then
Result := True;
end if;
end if;
return Result;
end Needs_Extra_Parentheses;
-----------------
-- No_Brackets --
-----------------
function No_Brackets (E : Asis.Element; S : Source_Ptr) return Source_Ptr is
begin
pragma Unreferenced (E);
return S;
end No_Brackets;
-----------------------------------
-- Search_Attr_Right_Parenthesis --
-----------------------------------
function Search_Attr_Right_Parenthesis
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr
is
begin
if Is_Nil (Attribute_Designator_Expressions (E)) then
return No_Brackets (E, S);
else
return Search_Right_Parenthesis (E, S);
end if;
end Search_Attr_Right_Parenthesis;
-----------------------------
-- Search_Before_Semicolon --
-----------------------------
function Search_Before_Semicolon
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr
is
S_P : Source_Ptr;
Result : Source_Ptr;
begin
-- first, we have to check where we are: at ';' or at the beginning of
-- the reserved word "end" in case if there is no components,
-- and if we are at ';', we have to go to "end":
if Get_Character (S) = ';' then
S_P := Next_Identifier (S);
elsif Asis.Definitions.Is_Private_Present (E) then
-- patological case of empty efinition with private part
S_P := S + 7;
else
S_P := S;
S_P := Rightmost_Non_Blank (S_P);
end if;
Result := S_P + 2;
-- the last character of "end"
S_P := S_P + 3;
-- the first character after "end"
S_P := Rightmost_Non_Blank (S_P);
-- and the final check - what follows the final "end"
if Get_Character (S_P) /= ';' then
-- there is an identifier after "end"
Result := Get_Word_End (P => S_P,
In_Word => In_Identifier'Access);
end if;
return Result;
end Search_Before_Semicolon;
-----------------------
-- Search_End_Of_Box --
-----------------------
function Search_End_Of_Box
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr
is
Result : Source_Ptr := S;
begin
case Int_Kind (E) is
when A_Generic_Association =>
if Is_Nil (Actual_Parameter (E)) then
Result := Search_Rightmost_Symbol (S, '<');
Result := Result + 1;
end if;
when others =>
null;
end case;
return Result;
end Search_End_Of_Box;
---------------------------------
-- Search_QE_Right_Parenthesis --
---------------------------------
function Search_QE_Right_Parenthesis
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr
is
Result : Source_Ptr := S;
Tmp : constant Asis.Element := Converted_Or_Qualified_Expression (E);
begin
if Int_Kind (Tmp) not in A_Record_Aggregate .. A_Named_Array_Aggregate
or else Needs_Extra_Parentheses (Tmp)
then
Result := Search_Rightmost_Symbol (S + 1, ')');
end if;
return Result;
end Search_QE_Right_Parenthesis;
------------------------------
-- Search_Right_Parenthesis --
------------------------------
function Search_Right_Parenthesis
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr
is
begin
pragma Unreferenced (E);
return Search_Rightmost_Symbol (S + 1, ')');
end Search_Right_Parenthesis;
----------------------
-- Search_Semicolon --
----------------------
function Search_Semicolon
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr
is
pragma Unreferenced (E);
S_P : Source_Ptr;
begin
S_P := Search_Rightmost_Symbol (S + 1, ';');
return S_P;
end Search_Semicolon;
-------------
-- Skip_WP --
-------------
function Skip_WP (E : Asis.Element; S : Source_Ptr) return Source_Ptr is
S_P : Source_Ptr;
begin
-- just jump to the trailing semicolon, and then - to the end of
-- the previous word, this should handle properly cases where there
-- are and where there are not "with private" keywords
S_P := Search_Semicolon (E, S);
S_P := Search_Prev_Word (S_P);
return S_P;
end Skip_WP;
----------------------------
-- Skip_Trailing_Brackets --
----------------------------
function Skip_Trailing_Brackets
(E : Asis.Element;
S : Source_Ptr)
return Source_Ptr
is
begin
-- all that this function does is switching to the function
-- implementing the specific processing for the given element
-- kind
if Debug_Flag_X then
Write_Str (" Skip_Trailing_Brackets - called for ");
Write_Str (Internal_Element_Kinds'Image (Int_Kind (E)));
Write_Eol;
Write_Eol;
end if;
return Skip_Switch (Int_Kind (E)) (E, S);
end Skip_Trailing_Brackets;
end A4G.Skip_TB;
|
with Globals_Example1;
with Md_Example4;
package Md_Example5 is
type T is new Md_Example4.T with record
Child_Attribute : Globals_Example1.Itype;
end record;
procedure Display_It (The_T : T);
end Md_Example5;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_render_pictvisual_t is
-- Item
--
type Item is record
visual : aliased xcb.xcb_visualid_t;
format : aliased xcb.xcb_render_pictformat_t;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_render_pictvisual_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_render_pictvisual_t.Item,
Element_Array => xcb.xcb_render_pictvisual_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_pictvisual_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_render_pictvisual_t.Pointer,
Element_Array => xcb.xcb_render_pictvisual_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_render_pictvisual_t;
|
-----------------------------------------------------------------------
-- util-serialize-io-form-tests -- Unit tests for form parser
-- Copyright (C) 2018 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Tests;
package Util.Serialize.IO.Form.Tests is
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
type Test is new Util.Tests.Test with null record;
procedure Test_Parse_Error (T : in out Test);
procedure Test_Parser (T : in out Test);
-- Generate some output stream for the test.
procedure Write_Stream (Stream : in out Util.Serialize.IO.Output_Stream'Class);
-- Test the form output stream generation.
procedure Test_Output (T : in out Test);
-- Test reading a form content into an Object tree.
procedure Test_Read (T : in out Test);
end Util.Serialize.IO.Form.Tests;
|
pragma Style_Checks (Off);
-- This spec has been automatically generated from STM32F3x4.svd
pragma Restrictions (No_Elaboration_Code);
with HAL;
with System;
package STM32_SVD.RTC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype TR_SU_Field is HAL.UInt4;
subtype TR_ST_Field is HAL.UInt3;
subtype TR_MNU_Field is HAL.UInt4;
subtype TR_MNT_Field is HAL.UInt3;
subtype TR_HU_Field is HAL.UInt4;
subtype TR_HT_Field is HAL.UInt2;
-- time register
type TR_Register is record
-- Second units in BCD format
SU : TR_SU_Field := 16#0#;
-- Second tens in BCD format
ST : TR_ST_Field := 16#0#;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#0#;
-- Minute units in BCD format
MNU : TR_MNU_Field := 16#0#;
-- Minute tens in BCD format
MNT : TR_MNT_Field := 16#0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Hour units in BCD format
HU : TR_HU_Field := 16#0#;
-- Hour tens in BCD format
HT : TR_HT_Field := 16#0#;
-- AM/PM notation
PM : Boolean := False;
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TR_Register use record
SU at 0 range 0 .. 3;
ST at 0 range 4 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
MNU at 0 range 8 .. 11;
MNT at 0 range 12 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
HU at 0 range 16 .. 19;
HT at 0 range 20 .. 21;
PM at 0 range 22 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
subtype DR_DU_Field is HAL.UInt4;
subtype DR_DT_Field is HAL.UInt2;
subtype DR_MU_Field is HAL.UInt4;
subtype DR_WDU_Field is HAL.UInt3;
subtype DR_YU_Field is HAL.UInt4;
subtype DR_YT_Field is HAL.UInt4;
-- date register
type DR_Register is record
-- Date units in BCD format
DU : DR_DU_Field := 16#1#;
-- Date tens in BCD format
DT : DR_DT_Field := 16#0#;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
-- Month units in BCD format
MU : DR_MU_Field := 16#1#;
-- Month tens in BCD format
MT : Boolean := False;
-- Week day units
WDU : DR_WDU_Field := 16#1#;
-- Year units in BCD format
YU : DR_YU_Field := 16#0#;
-- Year tens in BCD format
YT : DR_YT_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DR_Register use record
DU at 0 range 0 .. 3;
DT at 0 range 4 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
MU at 0 range 8 .. 11;
MT at 0 range 12 .. 12;
WDU at 0 range 13 .. 15;
YU at 0 range 16 .. 19;
YT at 0 range 20 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype CR_WCKSEL_Field is HAL.UInt3;
subtype CR_OSEL_Field is HAL.UInt2;
-- control register
type CR_Register is record
-- Wakeup clock selection
WCKSEL : CR_WCKSEL_Field := 16#0#;
-- Time-stamp event active edge
TSEDGE : Boolean := False;
-- Reference clock detection enable (50 or 60 Hz)
REFCKON : Boolean := False;
-- Bypass the shadow registers
BYPSHAD : Boolean := False;
-- Hour format
FMT : Boolean := False;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#0#;
-- Alarm A enable
ALRAE : Boolean := False;
-- Alarm B enable
ALRBE : Boolean := False;
-- Wakeup timer enable
WUTE : Boolean := False;
-- Time stamp enable
TSE : Boolean := False;
-- Alarm A interrupt enable
ALRAIE : Boolean := False;
-- Alarm B interrupt enable
ALRBIE : Boolean := False;
-- Wakeup timer interrupt enable
WUTIE : Boolean := False;
-- Time-stamp interrupt enable
TSIE : Boolean := False;
-- Add 1 hour (summer time change)
ADD1H : Boolean := False;
-- Subtract 1 hour (winter time change)
SUB1H : Boolean := False;
-- Backup
BKP : Boolean := False;
-- Calibration output selection
COSEL : Boolean := False;
-- Output polarity
POL : Boolean := False;
-- Output selection
OSEL : CR_OSEL_Field := 16#0#;
-- Calibration output enable
COE : Boolean := False;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
WCKSEL at 0 range 0 .. 2;
TSEDGE at 0 range 3 .. 3;
REFCKON at 0 range 4 .. 4;
BYPSHAD at 0 range 5 .. 5;
FMT at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
ALRAE at 0 range 8 .. 8;
ALRBE at 0 range 9 .. 9;
WUTE at 0 range 10 .. 10;
TSE at 0 range 11 .. 11;
ALRAIE at 0 range 12 .. 12;
ALRBIE at 0 range 13 .. 13;
WUTIE at 0 range 14 .. 14;
TSIE at 0 range 15 .. 15;
ADD1H at 0 range 16 .. 16;
SUB1H at 0 range 17 .. 17;
BKP at 0 range 18 .. 18;
COSEL at 0 range 19 .. 19;
POL at 0 range 20 .. 20;
OSEL at 0 range 21 .. 22;
COE at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- initialization and status register
type ISR_Register is record
-- Read-only. Alarm A write flag
ALRAWF : Boolean := True;
-- Read-only. Alarm B write flag
ALRBWF : Boolean := True;
-- Read-only. Wakeup timer write flag
WUTWF : Boolean := True;
-- Shift operation pending
SHPF : Boolean := False;
-- Read-only. Initialization status flag
INITS : Boolean := False;
-- Registers synchronization flag
RSF : Boolean := False;
-- Read-only. Initialization flag
INITF : Boolean := False;
-- Initialization mode
INIT : Boolean := False;
-- Alarm A flag
ALRAF : Boolean := False;
-- Alarm B flag
ALRBF : Boolean := False;
-- Wakeup timer flag
WUTF : Boolean := False;
-- Time-stamp flag
TSF : Boolean := False;
-- Time-stamp overflow flag
TSOVF : Boolean := False;
-- Tamper detection flag
TAMP1F : Boolean := False;
-- RTC_TAMP2 detection flag
TAMP2F : Boolean := False;
-- RTC_TAMP3 detection flag
TAMP3F : Boolean := False;
-- Read-only. Recalibration pending Flag
RECALPF : Boolean := False;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
ALRAWF at 0 range 0 .. 0;
ALRBWF at 0 range 1 .. 1;
WUTWF at 0 range 2 .. 2;
SHPF at 0 range 3 .. 3;
INITS at 0 range 4 .. 4;
RSF at 0 range 5 .. 5;
INITF at 0 range 6 .. 6;
INIT at 0 range 7 .. 7;
ALRAF at 0 range 8 .. 8;
ALRBF at 0 range 9 .. 9;
WUTF at 0 range 10 .. 10;
TSF at 0 range 11 .. 11;
TSOVF at 0 range 12 .. 12;
TAMP1F at 0 range 13 .. 13;
TAMP2F at 0 range 14 .. 14;
TAMP3F at 0 range 15 .. 15;
RECALPF at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
subtype PRER_PREDIV_S_Field is HAL.UInt15;
subtype PRER_PREDIV_A_Field is HAL.UInt7;
-- prescaler register
type PRER_Register is record
-- Synchronous prescaler factor
PREDIV_S : PRER_PREDIV_S_Field := 16#FF#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Asynchronous prescaler factor
PREDIV_A : PRER_PREDIV_A_Field := 16#7F#;
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for PRER_Register use record
PREDIV_S at 0 range 0 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
PREDIV_A at 0 range 16 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
subtype WUTR_WUT_Field is HAL.UInt16;
-- wakeup timer register
type WUTR_Register is record
-- Wakeup auto-reload value bits
WUT : WUTR_WUT_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for WUTR_Register use record
WUT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype ALRMAR_SU_Field is HAL.UInt4;
subtype ALRMAR_ST_Field is HAL.UInt3;
subtype ALRMAR_MNU_Field is HAL.UInt4;
subtype ALRMAR_MNT_Field is HAL.UInt3;
subtype ALRMAR_HU_Field is HAL.UInt4;
subtype ALRMAR_HT_Field is HAL.UInt2;
subtype ALRMAR_DU_Field is HAL.UInt4;
subtype ALRMAR_DT_Field is HAL.UInt2;
-- alarm A register
type ALRMAR_Register is record
-- Second units in BCD format
SU : ALRMAR_SU_Field := 16#0#;
-- Second tens in BCD format
ST : ALRMAR_ST_Field := 16#0#;
-- Alarm A seconds mask
MSK1 : Boolean := False;
-- Minute units in BCD format
MNU : ALRMAR_MNU_Field := 16#0#;
-- Minute tens in BCD format
MNT : ALRMAR_MNT_Field := 16#0#;
-- Alarm A minutes mask
MSK2 : Boolean := False;
-- Hour units in BCD format
HU : ALRMAR_HU_Field := 16#0#;
-- Hour tens in BCD format
HT : ALRMAR_HT_Field := 16#0#;
-- AM/PM notation
PM : Boolean := False;
-- Alarm A hours mask
MSK3 : Boolean := False;
-- Date units or day in BCD format
DU : ALRMAR_DU_Field := 16#0#;
-- Date tens in BCD format
DT : ALRMAR_DT_Field := 16#0#;
-- Week day selection
WDSEL : Boolean := False;
-- Alarm A date mask
MSK4 : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMAR_Register use record
SU at 0 range 0 .. 3;
ST at 0 range 4 .. 6;
MSK1 at 0 range 7 .. 7;
MNU at 0 range 8 .. 11;
MNT at 0 range 12 .. 14;
MSK2 at 0 range 15 .. 15;
HU at 0 range 16 .. 19;
HT at 0 range 20 .. 21;
PM at 0 range 22 .. 22;
MSK3 at 0 range 23 .. 23;
DU at 0 range 24 .. 27;
DT at 0 range 28 .. 29;
WDSEL at 0 range 30 .. 30;
MSK4 at 0 range 31 .. 31;
end record;
subtype ALRMBR_SU_Field is HAL.UInt4;
subtype ALRMBR_ST_Field is HAL.UInt3;
subtype ALRMBR_MNU_Field is HAL.UInt4;
subtype ALRMBR_MNT_Field is HAL.UInt3;
subtype ALRMBR_HU_Field is HAL.UInt4;
subtype ALRMBR_HT_Field is HAL.UInt2;
subtype ALRMBR_DU_Field is HAL.UInt4;
subtype ALRMBR_DT_Field is HAL.UInt2;
-- alarm B register
type ALRMBR_Register is record
-- Second units in BCD format
SU : ALRMBR_SU_Field := 16#0#;
-- Second tens in BCD format
ST : ALRMBR_ST_Field := 16#0#;
-- Alarm B seconds mask
MSK1 : Boolean := False;
-- Minute units in BCD format
MNU : ALRMBR_MNU_Field := 16#0#;
-- Minute tens in BCD format
MNT : ALRMBR_MNT_Field := 16#0#;
-- Alarm B minutes mask
MSK2 : Boolean := False;
-- Hour units in BCD format
HU : ALRMBR_HU_Field := 16#0#;
-- Hour tens in BCD format
HT : ALRMBR_HT_Field := 16#0#;
-- AM/PM notation
PM : Boolean := False;
-- Alarm B hours mask
MSK3 : Boolean := False;
-- Date units or day in BCD format
DU : ALRMBR_DU_Field := 16#0#;
-- Date tens in BCD format
DT : ALRMBR_DT_Field := 16#0#;
-- Week day selection
WDSEL : Boolean := False;
-- Alarm B date mask
MSK4 : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMBR_Register use record
SU at 0 range 0 .. 3;
ST at 0 range 4 .. 6;
MSK1 at 0 range 7 .. 7;
MNU at 0 range 8 .. 11;
MNT at 0 range 12 .. 14;
MSK2 at 0 range 15 .. 15;
HU at 0 range 16 .. 19;
HT at 0 range 20 .. 21;
PM at 0 range 22 .. 22;
MSK3 at 0 range 23 .. 23;
DU at 0 range 24 .. 27;
DT at 0 range 28 .. 29;
WDSEL at 0 range 30 .. 30;
MSK4 at 0 range 31 .. 31;
end record;
subtype WPR_KEY_Field is HAL.UInt8;
-- write protection register
type WPR_Register is record
-- Write-only. Write protection key
KEY : WPR_KEY_Field := 16#0#;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for WPR_Register use record
KEY at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype SSR_SS_Field is HAL.UInt16;
-- sub second register
type SSR_Register is record
-- Read-only. Sub second value
SS : SSR_SS_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SSR_Register use record
SS at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype SHIFTR_SUBFS_Field is HAL.UInt15;
-- shift control register
type SHIFTR_Register is record
-- Write-only. Subtract a fraction of a second
SUBFS : SHIFTR_SUBFS_Field := 16#0#;
-- unspecified
Reserved_15_30 : HAL.UInt16 := 16#0#;
-- Write-only. Add one second
ADD1S : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SHIFTR_Register use record
SUBFS at 0 range 0 .. 14;
Reserved_15_30 at 0 range 15 .. 30;
ADD1S at 0 range 31 .. 31;
end record;
subtype TSTR_SU_Field is HAL.UInt4;
subtype TSTR_ST_Field is HAL.UInt3;
subtype TSTR_MNU_Field is HAL.UInt4;
subtype TSTR_MNT_Field is HAL.UInt3;
subtype TSTR_HU_Field is HAL.UInt4;
subtype TSTR_HT_Field is HAL.UInt2;
-- time stamp time register
type TSTR_Register is record
-- Read-only. Second units in BCD format
SU : TSTR_SU_Field;
-- Read-only. Second tens in BCD format
ST : TSTR_ST_Field;
-- unspecified
Reserved_7_7 : HAL.Bit;
-- Read-only. Minute units in BCD format
MNU : TSTR_MNU_Field;
-- Read-only. Minute tens in BCD format
MNT : TSTR_MNT_Field;
-- unspecified
Reserved_15_15 : HAL.Bit;
-- Read-only. Hour units in BCD format
HU : TSTR_HU_Field;
-- Read-only. Hour tens in BCD format
HT : TSTR_HT_Field;
-- Read-only. AM/PM notation
PM : Boolean;
-- unspecified
Reserved_23_31 : HAL.UInt9;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TSTR_Register use record
SU at 0 range 0 .. 3;
ST at 0 range 4 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
MNU at 0 range 8 .. 11;
MNT at 0 range 12 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
HU at 0 range 16 .. 19;
HT at 0 range 20 .. 21;
PM at 0 range 22 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
subtype TSDR_DU_Field is HAL.UInt4;
subtype TSDR_DT_Field is HAL.UInt2;
subtype TSDR_MU_Field is HAL.UInt4;
subtype TSDR_WDU_Field is HAL.UInt3;
-- time stamp date register
type TSDR_Register is record
-- Read-only. Date units in BCD format
DU : TSDR_DU_Field;
-- Read-only. Date tens in BCD format
DT : TSDR_DT_Field;
-- unspecified
Reserved_6_7 : HAL.UInt2;
-- Read-only. Month units in BCD format
MU : TSDR_MU_Field;
-- Read-only. Month tens in BCD format
MT : Boolean;
-- Read-only. Week day units
WDU : TSDR_WDU_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TSDR_Register use record
DU at 0 range 0 .. 3;
DT at 0 range 4 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
MU at 0 range 8 .. 11;
MT at 0 range 12 .. 12;
WDU at 0 range 13 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype TSSSR_SS_Field is HAL.UInt16;
-- timestamp sub second register
type TSSSR_Register is record
-- Read-only. Sub second value
SS : TSSSR_SS_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TSSSR_Register use record
SS at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CALR_CALM_Field is HAL.UInt9;
-- calibration register
type CALR_Register is record
-- Calibration minus
CALM : CALR_CALM_Field := 16#0#;
-- unspecified
Reserved_9_12 : HAL.UInt4 := 16#0#;
-- Use a 16-second calibration cycle period
CALW16 : Boolean := False;
-- Use an 8-second calibration cycle period
CALW8 : Boolean := False;
-- Increase frequency of RTC by 488.5 ppm
CALP : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CALR_Register use record
CALM at 0 range 0 .. 8;
Reserved_9_12 at 0 range 9 .. 12;
CALW16 at 0 range 13 .. 13;
CALW8 at 0 range 14 .. 14;
CALP at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype TAFCR_TAMPFREQ_Field is HAL.UInt3;
subtype TAFCR_TAMPFLT_Field is HAL.UInt2;
subtype TAFCR_TAMPPRCH_Field is HAL.UInt2;
-- tamper and alternate function configuration register
type TAFCR_Register is record
-- Tamper 1 detection enable
TAMP1E : Boolean := False;
-- Active level for tamper 1
TAMP1TRG : Boolean := False;
-- Tamper interrupt enable
TAMPIE : Boolean := False;
-- Tamper 2 detection enable
TAMP2E : Boolean := False;
-- Active level for tamper 2
TAMP2TRG : Boolean := False;
-- Tamper 3 detection enable
TAMP3E : Boolean := False;
-- Active level for tamper 3
TAMP3TRG : Boolean := False;
-- Activate timestamp on tamper detection event
TAMPTS : Boolean := False;
-- Tamper sampling frequency
TAMPFREQ : TAFCR_TAMPFREQ_Field := 16#0#;
-- Tamper filter count
TAMPFLT : TAFCR_TAMPFLT_Field := 16#0#;
-- Tamper precharge duration
TAMPPRCH : TAFCR_TAMPPRCH_Field := 16#0#;
-- TAMPER pull-up disable
TAMPPUDIS : Boolean := False;
-- unspecified
Reserved_16_17 : HAL.UInt2 := 16#0#;
-- PC13 value
PC13VALUE : Boolean := False;
-- PC13 mode
PC13MODE : Boolean := False;
-- PC14 value
PC14VALUE : Boolean := False;
-- PC 14 mode
PC14MODE : Boolean := False;
-- PC15 value
PC15VALUE : Boolean := False;
-- PC15 mode
PC15MODE : Boolean := False;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TAFCR_Register use record
TAMP1E at 0 range 0 .. 0;
TAMP1TRG at 0 range 1 .. 1;
TAMPIE at 0 range 2 .. 2;
TAMP2E at 0 range 3 .. 3;
TAMP2TRG at 0 range 4 .. 4;
TAMP3E at 0 range 5 .. 5;
TAMP3TRG at 0 range 6 .. 6;
TAMPTS at 0 range 7 .. 7;
TAMPFREQ at 0 range 8 .. 10;
TAMPFLT at 0 range 11 .. 12;
TAMPPRCH at 0 range 13 .. 14;
TAMPPUDIS at 0 range 15 .. 15;
Reserved_16_17 at 0 range 16 .. 17;
PC13VALUE at 0 range 18 .. 18;
PC13MODE at 0 range 19 .. 19;
PC14VALUE at 0 range 20 .. 20;
PC14MODE at 0 range 21 .. 21;
PC15VALUE at 0 range 22 .. 22;
PC15MODE at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype ALRMASSR_SS_Field is HAL.UInt15;
subtype ALRMASSR_MASKSS_Field is HAL.UInt4;
-- alarm A sub second register
type ALRMASSR_Register is record
-- Sub seconds value
SS : ALRMASSR_SS_Field := 16#0#;
-- unspecified
Reserved_15_23 : HAL.UInt9 := 16#0#;
-- Mask the most-significant bits starting at this bit
MASKSS : ALRMASSR_MASKSS_Field := 16#0#;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMASSR_Register use record
SS at 0 range 0 .. 14;
Reserved_15_23 at 0 range 15 .. 23;
MASKSS at 0 range 24 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype ALRMBSSR_SS_Field is HAL.UInt15;
subtype ALRMBSSR_MASKSS_Field is HAL.UInt4;
-- alarm B sub second register
type ALRMBSSR_Register is record
-- Sub seconds value
SS : ALRMBSSR_SS_Field := 16#0#;
-- unspecified
Reserved_15_23 : HAL.UInt9 := 16#0#;
-- Mask the most-significant bits starting at this bit
MASKSS : ALRMBSSR_MASKSS_Field := 16#0#;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMBSSR_Register use record
SS at 0 range 0 .. 14;
Reserved_15_23 at 0 range 15 .. 23;
MASKSS at 0 range 24 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Real-time clock
type RTC_Peripheral is record
-- time register
TR : aliased TR_Register;
-- date register
DR : aliased DR_Register;
-- control register
CR : aliased CR_Register;
-- initialization and status register
ISR : aliased ISR_Register;
-- prescaler register
PRER : aliased PRER_Register;
-- wakeup timer register
WUTR : aliased WUTR_Register;
-- alarm A register
ALRMAR : aliased ALRMAR_Register;
-- alarm B register
ALRMBR : aliased ALRMBR_Register;
-- write protection register
WPR : aliased WPR_Register;
-- sub second register
SSR : aliased SSR_Register;
-- shift control register
SHIFTR : aliased SHIFTR_Register;
-- time stamp time register
TSTR : aliased TSTR_Register;
-- time stamp date register
TSDR : aliased TSDR_Register;
-- timestamp sub second register
TSSSR : aliased TSSSR_Register;
-- calibration register
CALR : aliased CALR_Register;
-- tamper and alternate function configuration register
TAFCR : aliased TAFCR_Register;
-- alarm A sub second register
ALRMASSR : aliased ALRMASSR_Register;
-- alarm B sub second register
ALRMBSSR : aliased ALRMBSSR_Register;
-- backup register
BKP0R : aliased HAL.UInt32;
-- backup register
BKP1R : aliased HAL.UInt32;
-- backup register
BKP2R : aliased HAL.UInt32;
-- backup register
BKP3R : aliased HAL.UInt32;
-- backup register
BKP4R : aliased HAL.UInt32;
-- backup register
BKP5R : aliased HAL.UInt32;
-- backup register
BKP6R : aliased HAL.UInt32;
-- backup register
BKP7R : aliased HAL.UInt32;
-- backup register
BKP8R : aliased HAL.UInt32;
-- backup register
BKP9R : aliased HAL.UInt32;
-- backup register
BKP10R : aliased HAL.UInt32;
-- backup register
BKP11R : aliased HAL.UInt32;
-- backup register
BKP12R : aliased HAL.UInt32;
-- backup register
BKP13R : aliased HAL.UInt32;
-- backup register
BKP14R : aliased HAL.UInt32;
-- backup register
BKP15R : aliased HAL.UInt32;
-- backup register
BKP16R : aliased HAL.UInt32;
-- backup register
BKP17R : aliased HAL.UInt32;
-- backup register
BKP18R : aliased HAL.UInt32;
-- backup register
BKP19R : aliased HAL.UInt32;
-- backup register
BKP20R : aliased HAL.UInt32;
-- backup register
BKP21R : aliased HAL.UInt32;
-- backup register
BKP22R : aliased HAL.UInt32;
-- backup register
BKP23R : aliased HAL.UInt32;
-- backup register
BKP24R : aliased HAL.UInt32;
-- backup register
BKP25R : aliased HAL.UInt32;
-- backup register
BKP26R : aliased HAL.UInt32;
-- backup register
BKP27R : aliased HAL.UInt32;
-- backup register
BKP28R : aliased HAL.UInt32;
-- backup register
BKP29R : aliased HAL.UInt32;
-- backup register
BKP30R : aliased HAL.UInt32;
-- backup register
BKP31R : aliased HAL.UInt32;
end record
with Volatile;
for RTC_Peripheral use record
TR at 16#0# range 0 .. 31;
DR at 16#4# range 0 .. 31;
CR at 16#8# range 0 .. 31;
ISR at 16#C# range 0 .. 31;
PRER at 16#10# range 0 .. 31;
WUTR at 16#14# range 0 .. 31;
ALRMAR at 16#1C# range 0 .. 31;
ALRMBR at 16#20# range 0 .. 31;
WPR at 16#24# range 0 .. 31;
SSR at 16#28# range 0 .. 31;
SHIFTR at 16#2C# range 0 .. 31;
TSTR at 16#30# range 0 .. 31;
TSDR at 16#34# range 0 .. 31;
TSSSR at 16#38# range 0 .. 31;
CALR at 16#3C# range 0 .. 31;
TAFCR at 16#40# range 0 .. 31;
ALRMASSR at 16#44# range 0 .. 31;
ALRMBSSR at 16#48# range 0 .. 31;
BKP0R at 16#50# range 0 .. 31;
BKP1R at 16#54# range 0 .. 31;
BKP2R at 16#58# range 0 .. 31;
BKP3R at 16#5C# range 0 .. 31;
BKP4R at 16#60# range 0 .. 31;
BKP5R at 16#64# range 0 .. 31;
BKP6R at 16#68# range 0 .. 31;
BKP7R at 16#6C# range 0 .. 31;
BKP8R at 16#70# range 0 .. 31;
BKP9R at 16#74# range 0 .. 31;
BKP10R at 16#78# range 0 .. 31;
BKP11R at 16#7C# range 0 .. 31;
BKP12R at 16#80# range 0 .. 31;
BKP13R at 16#84# range 0 .. 31;
BKP14R at 16#88# range 0 .. 31;
BKP15R at 16#8C# range 0 .. 31;
BKP16R at 16#90# range 0 .. 31;
BKP17R at 16#94# range 0 .. 31;
BKP18R at 16#98# range 0 .. 31;
BKP19R at 16#9C# range 0 .. 31;
BKP20R at 16#A0# range 0 .. 31;
BKP21R at 16#A4# range 0 .. 31;
BKP22R at 16#A8# range 0 .. 31;
BKP23R at 16#AC# range 0 .. 31;
BKP24R at 16#B0# range 0 .. 31;
BKP25R at 16#B4# range 0 .. 31;
BKP26R at 16#B8# range 0 .. 31;
BKP27R at 16#BC# range 0 .. 31;
BKP28R at 16#C0# range 0 .. 31;
BKP29R at 16#C4# range 0 .. 31;
BKP30R at 16#C8# range 0 .. 31;
BKP31R at 16#CC# range 0 .. 31;
end record;
-- Real-time clock
RTC_Periph : aliased RTC_Peripheral
with Import, Address => RTC_Base;
end STM32_SVD.RTC;
|
with Interfaces.C.Extensions;
with Ada.Strings.Hash;
with z3_optimization_h;
with System;
package body Z3
is
use Interfaces.C.Strings;
procedure Set_Param_Value (ID : String; Value : String)
is
C_ID : chars_ptr := New_String (ID);
C_Value : chars_ptr := New_String (Value);
begin
z3_api_h.Z3_set_param_value (c => Default_Config.Data,
param_id => z3_api_h.Z3_string (C_ID),
param_value => z3_api_h.Z3_string (C_Value));
Free (C_ID);
Free (C_Value);
end Set_Param_Value;
------------------------------------------------------------------------------------------------
function Bool (Name : String; Context : Z3.Context := Default_Context) return Bool_Type
is
C_Name : constant chars_ptr := New_String (Name);
Symbol : constant z3_api_h.Z3_symbol :=
z3_api_h.Z3_mk_string_symbol (c => Context.Data,
s => z3_api_h.Z3_string (C_Name));
begin
return (Data => z3_api_h.Z3_mk_const (c => Context.Data,
s => Symbol,
ty => z3_api_h.Z3_mk_bool_sort (Context.Data)),
Context => Context);
end Bool;
------------------------------------------------------------------------------------------------
function Bool (Value : Boolean; Context : Z3.Context := Default_Context) return Bool_Type
is
begin
if Value then
return (Data => z3_api_h.Z3_mk_true (Context.Data),
Context => Context);
end if;
return (Data => z3_api_h.Z3_mk_false (Context.Data),
Context => Context);
end Bool;
------------------------------------------------------------------------------------------------
function Bool (Expr : Expr_Type'Class) return Bool_Type is
(Data => Expr.Data,
Context => Expr.Context);
------------------------------------------------------------------------------------------------
function Equal (Left, Right : Expr_Type'Class) return Bool_Type
is
begin
return (Data => z3_api_h.Z3_mk_eq (c => Left.Context.Data,
l => Left.Data,
r => Right.Data),
Context => Left.Context);
end Equal;
function "=" (Left, Right : Expr_Type'Class) return Bool_Type is (Equal (Left, Right));
function "/=" (Left, Right : Expr_Type'Class) return Bool_Type is (not Equal (Left, Right));
------------------------------------------------------------------------------------------------
function Simplified (Value : Expr_Type) return Expr_Type
is
begin
return (Data => z3_api_h.Z3_simplify (c => Value.Context.Data,
a => Value.Data),
Context => Value.Context);
end Simplified;
------------------------------------------------------------------------------------------------
function Substitute (Expr : Expr_Type'Class;
From : Bool_Array;
To : Bool_Array) return Expr_Type'Class
is
From_Ast : constant Z3_ast_array := To_Z3_ast_array (From);
To_Ast : constant Z3_ast_array := To_Z3_ast_array (To);
begin
if From'Length = 0 then
return Expr;
end if;
return Expr_Type'(Data => z3_api_h.Z3_substitute (Expr.Context.Data,
Expr.Data,
From_Ast'Length,
From_Ast'Address,
To_Ast'Address),
Context => Expr.Context);
end Substitute;
------------------------------------------------------------------------------------------------
function Substitute (Expr : Expr_Type'Class;
From : Int_Array;
To : Int_Array) return Expr_Type'Class
is
From_Ast : constant Z3_ast_array := To_Z3_ast_array (From);
To_Ast : constant Z3_ast_array := To_Z3_ast_array (To);
begin
if From'Length = 0 then
return Expr;
end if;
return Expr_Type'(Data => z3_api_h.Z3_substitute (Expr.Context.Data,
Expr.Data,
From_Ast'Length,
From_Ast'Address,
To_Ast'Address),
Context => Expr.Context);
end Substitute;
------------------------------------------------------------------------------------------------
function New_Context return Context is ((Data => z3_api_h.Z3_mk_context (z3_api_h.Z3_mk_config)));
------------------------------------------------------------------------------------------------
function "not" (Value : Bool_Type) return Bool_Type
is
begin
return (Data => z3_api_h.Z3_mk_not (c => Value.Context.Data,
a => Value.Data),
Context => Value.Context);
end "not";
------------------------------------------------------------------------------------------------
function Conjunction (Terms : Bool_Array) return Bool_Type
is
type Z3_Bool_Array is array (Terms'Range) of z3_api_h.Z3_ast;
Args : Z3_Bool_Array;
First : constant Bool_Type := Terms (Terms'First);
begin
for I in Terms'Range loop
Args (I) := Terms (I).Data;
end loop;
return (Data => z3_api_h.Z3_mk_and (c => First.Context.Data,
num_args => Args'Length,
args => Args'Address),
Context => First.Context);
end Conjunction;
------------------------------------------------------------------------------------------------
function "and" (Left, Right : Bool_Type) return Bool_Type
is
begin
return Conjunction ((Left, Right));
end "and";
------------------------------------------------------------------------------------------------
function Disjunction (Terms : Bool_Array) return Bool_Type
is
type Z3_Bool_Array is array (Terms'Range) of z3_api_h.Z3_ast;
Args : Z3_Bool_Array;
First : constant Bool_Type := Terms (Terms'First);
begin
for I in Terms'Range loop
Args (I) := Terms (I).Data;
end loop;
return (Data => z3_api_h.Z3_mk_or (c => First.Context.Data,
num_args => Args'Length,
args => Args'Address),
Context => First.Context);
end Disjunction;
------------------------------------------------------------------------------------------------
function "or" (Left, Right : Bool_Type) return Bool_Type
is
begin
return Disjunction ((Left, Right));
end "or";
------------------------------------------------------------------------------------------------
function Int (Name : String; Context : Z3.Context := Default_Context) return Int_Type
is
C_Name : constant chars_ptr := New_String (Name);
Symbol : constant z3_api_h.Z3_symbol :=
z3_api_h.Z3_mk_string_symbol (c => Context.Data,
s => z3_api_h.Z3_string (C_Name));
begin
return (Data => z3_api_h.Z3_mk_const (c => Context.Data,
s => Symbol,
ty => z3_api_h.Z3_mk_int_sort (Context.Data)),
Context => Context);
end Int;
------------------------------------------------------------------------------------------------
function Int (Value : Long_Long_Integer;
Context : Z3.Context := Default_Context) return Int_Type
is
begin
return (Data => z3_api_h.Z3_mk_int64 (c => Context.Data,
v => Value,
ty => z3_api_h.Z3_mk_int_sort (Context.Data)),
Context => Context);
end Int;
------------------------------------------------------------------------------------------------
function Int (Expr : Expr_Type'Class) return Int_Type is
(Data => Expr.Data,
Context => Expr.Context);
------------------------------------------------------------------------------------------------
function Int (Value : Long_Long_Unsigned;
Context : Z3.Context := Default_Context) return Int_Type
is
begin
return (Data => z3_api_h.Z3_mk_unsigned_int64 (c => Context.Data,
v => Interfaces.C.Extensions.unsigned_long_long (Value),
ty => z3_api_h.Z3_mk_int_sort (Context.Data)),
Context => Context);
end Int;
------------------------------------------------------------------------------------------------
function Add (Values : Int_Array) return Int_Type
is
type Z3_Int_Array is array (Values'Range) of z3_api_h.Z3_ast;
Args : Z3_Int_Array;
First : constant Int_Type := Values (Values'First);
begin
for I in Values'Range loop
Args (I) := Values (I).Data;
end loop;
return (Data => z3_api_h.Z3_mk_add (c => First.Context.Data,
num_args => Args'Length,
args => Args'Address),
Context => First.Context);
end Add;
------------------------------------------------------------------------------------------------
function "+" (Left : Int_Type; Right : Int_Type) return Int_Type
is
begin
return Add ((Left, Right));
end "+";
------------------------------------------------------------------------------------------------
function Mul (Values : Int_Array) return Int_Type
is
type Z3_Int_Array is array (Values'Range) of z3_api_h.Z3_ast;
Args : Z3_Int_Array;
First : constant Int_Type := Values (Values'First);
begin
for I in Values'Range loop
Args (I) := Values (I).Data;
end loop;
return (Data => z3_api_h.Z3_mk_mul (c => First.Context.Data,
num_args => Args'Length,
args => Args'Address),
Context => First.Context);
end Mul;
------------------------------------------------------------------------------------------------
function "*" (Left : Int_Type; Right : Int_Type) return Int_Type
is
begin
return Mul ((Left, Right));
end "*";
------------------------------------------------------------------------------------------------
function "-" (Left : Int_Type; Right : Int_Type) return Int_Type
is
type Int_Array is array (1 .. 2) of z3_api_h.Z3_ast;
Args : constant Int_Array := (Left.Data, Right.Data);
begin
return (Data => z3_api_h.Z3_mk_sub (c => Left.Context.Data,
num_args => Args'Length,
args => Args'Address),
Context => Left.Context);
end "-";
------------------------------------------------------------------------------------------------
function "/" (Left : Int_Type; Right : Int_Type) return Int_Type
is
begin
return (Data => z3_api_h.Z3_mk_div (c => Left.Context.Data,
arg1 => Left.Data,
arg2 => Right.Data),
Context => Left.Context);
end "/";
------------------------------------------------------------------------------------------------
function "**" (Left : Int_Type; Right : Int_Type) return Int_Type
is
begin
return (Data => z3_api_h.Z3_mk_power (c => Left.Context.Data,
arg1 => Left.Data,
arg2 => Right.Data),
Context => Left.Context);
end "**";
------------------------------------------------------------------------------------------------
function "mod" (Left : Int_Type; Right : Int_Type) return Int_Type
is
begin
return (Data => z3_api_h.Z3_mk_mod (c => Left.Context.Data,
arg1 => Left.Data,
arg2 => Right.Data),
Context => Left.Context);
end "mod";
------------------------------------------------------------------------------------------------
function "-" (Value : Int_Type) return Int_Type
is
begin
return (Data => z3_api_h.Z3_mk_unary_minus (c => Value.Context.Data,
arg => Value.Data),
Context => Value.Context);
end "-";
------------------------------------------------------------------------------------------------
function "<" (Left : Int_Type'Class; Right : Int_Type'Class) return Bool_Type
is
begin
return (Data => z3_api_h.Z3_mk_lt (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end "<";
------------------------------------------------------------------------------------------------
function "<=" (Left : Int_Type'Class; Right : Int_Type'Class) return Bool_Type
is
begin
return (Data => z3_api_h.Z3_mk_le (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end "<=";
------------------------------------------------------------------------------------------------
function ">" (Left : Int_Type'Class; Right : Int_Type'Class) return Bool_Type
is
begin
return (Data => z3_api_h.Z3_mk_gt (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end ">";
------------------------------------------------------------------------------------------------
function ">=" (Left : Int_Type'Class; Right : Int_Type'Class) return Bool_Type
is
begin
return (Data => z3_api_h.Z3_mk_ge (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end ">=";
------------------------------------------------------------------------------------------------
function Create (Context : Z3.Context := Default_Context) return Solver
is
begin
return (Data => z3_api_h.Z3_mk_solver (Context.Data),
Context => Context);
end Create;
------------------------------------------------------------------------------------------------
function Create (Logic : Solver_Logic;
Context : Z3.Context := Default_Context) return Solver
is
begin
return (Data => z3_api_h.Z3_mk_solver_for_logic
(Context.Data,
z3_api_h.Z3_mk_string_symbol (Context.Data, z3_api_h.Z3_string (Logic))),
Context => Context);
end Create;
------------------------------------------------------------------------------------------------
procedure Assert (Solver : in out Z3.Solver;
Fact : Bool_Type'Class;
Context : Z3.Context := Default_Context)
is
begin
z3_api_h.Z3_solver_assert (c => Context.Data,
s => Solver.Data,
a => Fact.Data);
end Assert;
------------------------------------------------------------------------------------------------
function Check (Solver : Z3.Solver;
Context : Z3.Context := Default_Context) return Result
is
Check_Result : z3_api_h.Z3_lbool;
begin
Check_Result := z3_api_h.Z3_solver_check (c => Context.Data, s => Solver.Data);
case Check_Result is
when z3_api_h.Z3_L_FALSE => return Result_False;
when z3_api_h.Z3_L_TRUE => return Result_True;
when z3_api_h.Z3_L_UNDEF => return Result_Undef;
when others => raise Z3.Internal_Error; -- GCOV_EXCL_LINE
end case;
end Check;
------------------------------------------------------------------------------------------------
procedure Reset (Solver : in out Z3.Solver;
Context : Z3.Context := Default_Context)
is
begin
z3_api_h.Z3_solver_reset (c => Context.Data, s => Solver.Data);
end Reset;
------------------------------------------------------------------------------------------------
function Same_Context (Left, Right : Expr_Type'Class) return Boolean
is
begin
return Left.Context = Right.Context;
end Same_Context;
------------------------------------------------------------------------------------------------
function Same_Context (Terms : Bool_Array) return Boolean
is
First : Bool_Type;
begin
if Terms'Length <= 1 then
return True;
end if;
First := Terms (Terms'First);
return (for all T of Terms (Terms'First + 1 .. Terms'Last) => Same_Context (T, First));
end Same_Context;
------------------------------------------------------------------------------------------------
function Same_Context (Values : Int_Array) return Boolean
is
First : Int_Type;
begin
if Values'Length <= 1 then
return True;
end if;
First := Values (Values'First);
return (for all T of Values (Values'First + 1 .. Values'Last) => Same_Context (T, First));
end Same_Context;
------------------------------------------------------------------------------------------------
function "+" (Value : Expr_Type) return String
is
begin
return ICS.Value (chars_ptr (z3_api_h.Z3_ast_to_string (c => Value.Context.Data,
a => Value.Data)));
end "+";
------------------------------------------------------------------------------------------------
function Value (Data : Int_Type) return Long_Long_Integer
is
Success : z3_api_h.Z3_bool;
Result : aliased Long_Long_Integer;
use type Interfaces.C.Extensions.bool;
begin
Success := z3_api_h.Z3_get_numeral_int64 (c => Data.Context.Data,
v => Data.Data,
i => Result'Access);
if not Success then
raise Z3.Value_Error;
end if;
return Result;
end Value;
------------------------------------------------------------------------------------------------
function Value (Data : Int_Type) return Long_Long_Unsigned
is
Success : z3_api_h.Z3_bool;
Result : aliased Interfaces.C.Extensions.unsigned_long_long;
use type Interfaces.C.Extensions.bool;
begin
Success := z3_api_h.Z3_get_numeral_uint64 (c => Data.Context.Data,
v => Data.Data,
u => Result'Access);
if not Success then
raise Z3.Value_Error;
end if;
return Long_Long_Unsigned (Result);
end Value;
------------------------------------------------------------------------------------------------
function To_Z3_ast_array (Value : Bool_Array) return Z3_ast_array
is
Result : Z3_ast_array (Value'First .. Value'Last);
begin
for I in Value'Range loop
Result (I) := Value (I).Data;
end loop;
return Result;
end To_Z3_ast_array;
------------------------------------------------------------------------------------------------
function To_Z3_ast_array (Value : Int_Array) return Z3_ast_array
is
Result : Z3_ast_array (Value'First .. Value'Last);
begin
for I in Value'Range loop
Result (I) := Value (I).Data;
end loop;
return Result;
end To_Z3_ast_array;
------------------------------------------------------------------------------------------------
function To_Z3_ast_array (Value : Bit_Vector_Array) return Z3_ast_array
is
Result : Z3_ast_array (Value'First .. Value'Last);
begin
for I in Value'Range loop
Result (I) := Value (I).Data;
end loop;
return Result;
end To_Z3_ast_array;
------------------------------------------------------------------------------------------------
function Terms (Value : Expr_Type) return Natural
is
begin
if z3_api_h.Z3_get_ast_kind (Value.Context.Data, Value.Data) = 1 then
return Natural (z3_api_h.Z3_get_app_num_args (Value.Context.Data,
z3_api_h.Z3_to_app (Value.Context.Data,
Value.Data)));
else
return 0;
end if;
end Terms;
------------------------------------------------------------------------------------------------
function Term (Value : Expr_Type;
Index : Natural) return Expr_Type'Class
is
begin
if Index >= Terms (Value) then
raise Z3.Value_Error;
end if;
return Expr_Type'(Context => Value.Context,
Data => z3_api_h.Z3_get_app_arg (Value.Context.Data,
z3_api_h.Z3_to_app (Value.Context.Data, Value.Data),
Interfaces.C.unsigned (Index)));
end Term;
------------------------------------------------------------------------------------------------
function Kind (Value : Expr_Type) return Expr_Kind
is
Ctx : constant z3_api_h.Z3_context := Value.Context.Data;
Decl_Kind : z3_api_h.Z3_decl_kind;
begin
case z3_api_h.Z3_get_ast_kind (Ctx, Value.Data) is
when 0 =>
return Kind_Constant;
when 1 =>
Decl_Kind := z3_api_h.Z3_get_decl_kind
(Ctx, z3_api_h.Z3_get_app_decl (Ctx, z3_api_h.Z3_to_app (Ctx, Value.Data)));
case Decl_Kind is
when z3_api_h.Z3_OP_TRUE => return Kind_Constant;
when z3_api_h.Z3_OP_FALSE => return Kind_Constant;
when z3_api_h.Z3_OP_EQ => return Kind_Equal;
when z3_api_h.Z3_OP_AND => return Kind_And;
when z3_api_h.Z3_OP_OR => return Kind_Or;
when z3_api_h.Z3_OP_NOT => return Kind_Not;
when z3_api_h.Z3_OP_LE => return Kind_Less_Equal;
when z3_api_h.Z3_OP_SLEQ => return Kind_Less_Equal;
when z3_api_h.Z3_OP_GE => return Kind_Greater_Equal;
when z3_api_h.Z3_OP_SGEQ => return Kind_Greater_Equal;
when z3_api_h.Z3_OP_LT => return Kind_Less_Than;
when z3_api_h.Z3_OP_SLT => return Kind_Less_Than;
when z3_api_h.Z3_OP_GT => return Kind_Greater_Than;
when z3_api_h.Z3_OP_SGT => return Kind_Greater_Than;
when z3_api_h.Z3_OP_ADD => return Kind_Add;
when z3_api_h.Z3_OP_BADD => return Kind_Add;
when z3_api_h.Z3_OP_SUB => return Kind_Sub;
when z3_api_h.Z3_OP_BSUB => return Kind_Sub;
when z3_api_h.Z3_OP_MUL => return Kind_Mul;
when z3_api_h.Z3_OP_BMUL => return Kind_Mul;
when z3_api_h.Z3_OP_IDIV => return Kind_Div;
when z3_api_h.Z3_OP_BSDIV => return Kind_Div;
when z3_api_h.Z3_OP_MOD => return Kind_Mod;
when z3_api_h.Z3_OP_BSMOD => return Kind_Mod;
when z3_api_h.Z3_OP_POWER => return Kind_Power;
when z3_api_h.Z3_OP_UNINTERPRETED => return Kind_Var;
when others => return Kind_Any; -- GCOV_EXCL_LINE
end case;
when others => -- GCOV_EXCL_LINE
return Kind_Any; -- GCOV_EXCL_LINE
end case;
end Kind;
------------------------------------------------------------------------------------------------
function Sort (Value : Expr_Type) return Expr_Sort
is
Ctx : constant z3_api_h.Z3_context := Value.Context.Data;
begin
case z3_api_h.Z3_get_sort_kind (Ctx, z3_api_h.Z3_get_sort (Ctx, Value.Data)) is
when z3_api_h.Z3_BOOL_SORT => return Sort_Bool;
when z3_api_h.Z3_INT_SORT => return Sort_Int;
when z3_api_h.Z3_BV_SORT => return Sort_Bit_Vector;
when others => return Sort_Unknown; -- GCOV_EXCL_LINE
end case;
end Sort;
------------------------------------------------------------------------------------------------
overriding
function "=" (Left, Right : Expr_Type) return Boolean
is
begin
return Boolean (z3_api_h.Z3_is_eq_ast (Left.Context.Data, Left.Data, Right.Data));
end "=";
------------------------------------------------------------------------------------------------
function Create (Context : Z3.Context := Default_Context) return Optimize
is
Opt : constant z3_api_h.Z3_optimize := z3_optimization_h.Z3_mk_optimize (Context.Data);
begin
-- ISSUE: Componolit/AZ3#9
z3_optimization_h.Z3_optimize_inc_ref (Context.Data, Opt);
z3_optimization_h.Z3_optimize_push (Context.Data, Opt);
return Optimize'(Data => Opt,
Context => Context,
Objectives => Int_Maps.Empty_Map,
Backtracking_Count => 0);
end Create;
function "+" (Optimize : Z3.Optimize) return String
is
begin
return ICS.Value (chars_ptr (z3_optimization_h.Z3_optimize_to_string (c => Optimize.Context.Data,
o => Optimize.Data)));
end "+";
------------------------------------------------------------------------------------------------
procedure Set_Timeout (Optimize : in out Z3.Optimize;
Timeout : Natural := 1000)
is
Param_Name : constant chars_ptr := New_String ("timeout");
Params : constant z3_api_h.Z3_params := z3_api_h.Z3_mk_params (Optimize.Context.Data);
begin
z3_api_h.Z3_params_set_uint
(Optimize.Context.Data,
Params,
z3_api_h.Z3_mk_string_symbol (Optimize.Context.Data, z3_api_h.Z3_string (Param_Name)),
Interfaces.C.unsigned (Timeout));
z3_optimization_h.Z3_optimize_set_params (Optimize.Context.Data, Optimize.Data, Params);
end Set_Timeout;
------------------------------------------------------------------------------------------------
function Same_Context (Optimize : Z3.Optimize;
Term : Z3.Expr_Type'Class) return Boolean is
(Optimize.Context.Data = Term.Context.Data);
------------------------------------------------------------------------------------------------
procedure Assert (Optimize : in out Z3.Optimize;
Fact : Bool_Type'Class)
is
begin
z3_optimization_h.Z3_optimize_assert (Optimize.Context.Data, Optimize.Data, Fact.Data);
end Assert;
------------------------------------------------------------------------------------------------
procedure Minimize (Optimize : in out Z3.Optimize;
Term : Z3.Arith_Type'Class)
is
Index : Interfaces.C.unsigned;
begin
Index := z3_optimization_h.Z3_optimize_minimize (Optimize.Context.Data, Optimize.Data, Term.Data);
Optimize.Objectives.Insert (Term, (Index, Optimize.Backtracking_Count));
end Minimize;
------------------------------------------------------------------------------------------------
procedure Maximize (Optimize : in out Z3.Optimize;
Term : Z3.Arith_Type'Class)
is
Index : Interfaces.C.unsigned;
begin
Index := z3_optimization_h.Z3_optimize_maximize (Optimize.Context.Data, Optimize.Data, Term.Data);
Optimize.Objectives.Insert (Term, (Index, Optimize.Backtracking_Count));
end Maximize;
------------------------------------------------------------------------------------------------
procedure Check (Optimize : in out Z3.Optimize;
Result : out Z3.Result)
is
Check_Result : z3_api_h.Z3_lbool;
begin
Check_Result := z3_optimization_h.Z3_optimize_check
(Optimize.Context.Data, Optimize.Data, 0, System.Null_Address);
case Check_Result is
when z3_api_h.Z3_L_FALSE => Result := Result_False;
when z3_api_h.Z3_L_TRUE => Result := Result_True;
when z3_api_h.Z3_L_UNDEF => Result := Result_Undef;
when others => raise Z3.Internal_Error; -- GCOV_EXCL_LINE
end case;
end Check;
------------------------------------------------------------------------------------------------
function Lower (Optimize : Z3.Optimize;
Objective : Z3.Arith_Type'Class) return Z3.Int_Type'Class
is
begin
return Z3.Int_Type'(Data => z3_optimization_h.Z3_optimize_get_lower (Optimize.Context.Data,
Optimize.Data,
Optimize.Objectives (Objective).Index),
Context => Optimize.Context);
end Lower;
------------------------------------------------------------------------------------------------
function Upper (Optimize : Z3.Optimize;
Objective : Z3.Arith_Type'Class) return Z3.Int_Type'Class
is
begin
return Z3.Int_Type'(Data => z3_optimization_h.Z3_optimize_get_upper (Optimize.Context.Data,
Optimize.Data,
Optimize.Objectives (Objective).Index),
Context => Optimize.Context);
end Upper;
------------------------------------------------------------------------------------------------
function Hash (Key : Z3.Arith_Type'Class) return Ada.Containers.Hash_Type is (Ada.Strings.Hash (+Key));
------------------------------------------------------------------------------------------------
procedure Reset (Optimize : in out Z3.Optimize)
is
begin
for I in 0 .. Optimize.Backtracking_Count loop
z3_optimization_h.Z3_optimize_pop (Optimize.Context.Data, Optimize.Data);
end loop;
Optimize.Backtracking_Count := 0;
z3_optimization_h.Z3_optimize_push (Optimize.Context.Data, Optimize.Data);
Optimize.Objectives := Int_Maps.Empty_Map;
end Reset;
------------------------------------------------------------------------------------------------
procedure Push (Optimize : in out Z3.Optimize)
is
begin
z3_optimization_h.Z3_optimize_push (Optimize.Context.Data, Optimize.Data);
Optimize.Backtracking_Count := Optimize.Backtracking_Count + 1;
end Push;
------------------------------------------------------------------------------------------------
procedure Pop (Optimize : in out Z3.Optimize)
is
Objectives : constant Int_Maps.Map := Optimize.Objectives;
begin
if Optimize.Backtracking_Count < 1 then
raise Z3.Value_Error;
end if;
z3_optimization_h.Z3_optimize_pop (Optimize.Context.Data, Optimize.Data);
Optimize.Backtracking_Count := Optimize.Backtracking_Count - 1;
for C in Objectives.Iterate loop
if Int_Maps.Element (C).Backtracking_Point > Optimize.Backtracking_Count then
Optimize.Objectives.Delete (Int_Maps.Key (C));
end if;
end loop;
end Pop;
------------------------------------------------------------------------------------------------
function Get_Number_Of_Values (Optimize : Z3.Optimize) return Natural is
(Natural (z3_api_h.Z3_model_get_num_consts (Optimize.Context.Data,
z3_optimization_h.Z3_optimize_get_model (Optimize.Context.Data,
Optimize.Data))));
------------------------------------------------------------------------------------------------
procedure Get_Values (Optimize : Z3.Optimize;
Constants : out Int_Array;
Values : out Int_Array)
is
Model : constant z3_api_h.Z3_model :=
z3_optimization_h.Z3_optimize_get_model (Optimize.Context.Data, Optimize.Data);
Func_Decl : z3_api_h.Z3_func_decl;
begin
for I in 0 .. Interfaces.C.unsigned (Constants'Length - 1) loop
Func_Decl := z3_api_h.Z3_model_get_const_decl (Optimize.Context.Data, Model, I);
Constants (Constants'First + Natural (I)) :=
Int_Type'(Data => z3_api_h.Z3_mk_app (Optimize.Context.Data,
Func_Decl,
0,
System.Null_Address),
Context => Optimize.Context);
Values (Values'First + Natural (I)) :=
Int_Type'(Data => z3_api_h.Z3_model_get_const_interp (Optimize.Context.Data,
Model,
Func_Decl),
Context => Optimize.Context);
end loop;
end Get_Values;
------------------------------------------------------------------------------------------------
function Term (Pos : Cursor) return Expr_Type'Class is (Pos.Expr.Term (Pos.Index));
------------------------------------------------------------------------------------------------
function Has_Term (Pos : Cursor) return Boolean is (Pos.Index < Pos.Expr.Terms);
------------------------------------------------------------------------------------------------
function Term_Value (Expr : Expr_Type;
Pos : Cursor) return Expr_Type'Class is (Term (Pos));
------------------------------------------------------------------------------------------------
function Iterate (Expr : Expr_Type) return Expr_Iterators.Forward_Iterator'Class is
(Expr_Iterator'(Expr_Iterators.Forward_Iterator with Expr => Expr));
------------------------------------------------------------------------------------------------
overriding
function First (Object : Expr_Iterator) return Cursor is (Cursor'(Expr => Object.Expr, Index => 0));
------------------------------------------------------------------------------------------------
overriding
function Next (Object : Expr_Iterator;
Pos : Cursor) return Cursor is (Cursor'(Expr => Pos.Expr, Index => Pos.Index + 1));
------------------------------------------------------------------------------------------------
function Big_Int (Value : String;
Base : Positive := 10;
Context : Z3.Context := Default_Context) return Int_Type
is
Position : Long_Long_Integer := 0;
Result : Int_Type;
procedure Check_Digit (Digit : Character;
Base : Positive)
is
begin
if
Digit not in '0' .. '9' | 'a' .. 'f' | 'A' .. 'F'
or (Digit in '0' .. '9'
and Base <= 10
and Base <= Character'Pos (Digit) - Character'Pos ('0'))
or (Digit in 'A' .. 'F'
and Base <= 16
and Base <= Character'Pos (Digit) - Character'Pos ('A'))
or (Digit in 'a' .. 'f'
and Base <= 16
and Base <= Character'Pos (Digit) - Character'Pos ('a'))
then
raise Z3.Value_Error with "Invalid character '" & Digit & "' in numeric value";
end if;
end Check_Digit;
function Val (Digit : Character) return Int_Type
is
begin
if Digit >= '0' and Digit <= '9' then
return Int (Long_Long_Unsigned (Character'Pos (Digit) - Character'Pos ('0')));
elsif Digit >= 'a' and Digit <= 'f' then
return Int (Long_Long_Unsigned (Character'Pos (Digit) - Character'Pos ('a') + 10));
else
return Int (Long_Long_Unsigned (Character'Pos (Digit) - Character'Pos ('A') + 10));
end if;
end Val;
Underscore_Seen : Boolean := False;
begin
for C of reverse Value loop
if C = '_' then
if Position = 0 then
raise Z3.Value_Error with "Leading underscore in " & Value;
end if;
if Underscore_Seen then
raise Z3.Value_Error with "Double underscore in " & Value;
end if;
else
Check_Digit (C, Base);
if Position = 0 then
Result := Val (C);
else
Result := Result + Int (Long_Long_Unsigned (Base)) ** Int (Position) * Val (C);
end if;
Position := Position + 1;
end if;
Underscore_Seen := C = '_';
end loop;
if Underscore_Seen then
raise Z3.Value_Error with "Trailing underscore in " & Value;
end if;
return Simplified (Result);
end Big_Int;
------------------------------------------------------------------------------------------------
function Bit_Vector (Name : String;
Size : Natural;
Context : Z3.Context := Default_Context) return Bit_Vector_Type
is
C_Name : constant chars_ptr := New_String (Name);
Symbol : constant z3_api_h.Z3_symbol :=
z3_api_h.Z3_mk_string_symbol (c => Context.Data,
s => z3_api_h.Z3_string (C_Name));
begin
return (Data => z3_api_h.Z3_mk_const (c => Context.Data,
s => Symbol,
ty => z3_api_h.Z3_mk_bv_sort
(Context.Data, Interfaces.C.unsigned (Size))),
Context => Context);
end Bit_Vector;
------------------------------------------------------------------------------------------------
function Bit_Vector (Value : Long_Long_Unsigned;
Size : Natural;
Context : Z3.Context := Default_Context) return Bit_Vector_Type
is
begin
return (Data => z3_api_h.Z3_mk_unsigned_int64 (c => Context.Data,
v => Interfaces.C.Extensions.unsigned_long_long (Value),
ty => z3_api_h.Z3_mk_bv_sort
(Context.Data, Interfaces.C.unsigned (Size))),
Context => Context);
end Bit_Vector;
------------------------------------------------------------------------------------------------
function Bit_Vector (Value : Long_Long_Integer;
Size : Natural;
Context : Z3.Context := Default_Context) return Bit_Vector_Type
is
begin
return (Data => z3_api_h.Z3_mk_int64 (c => Context.Data,
v => Value,
ty => z3_api_h.Z3_mk_bv_sort
(Context.Data, Interfaces.C.unsigned (Size))),
Context => Context);
end Bit_Vector;
------------------------------------------------------------------------------------------------
function Bit_Vector (Value : Int_Type'Class;
Size : Natural) return Bit_Vector_Type
is
begin
return Simplified ((Data => z3_api_h.Z3_mk_int2bv (c => Value.Context.Data,
n => Interfaces.C.unsigned (Size),
t1 => Value.Data),
Context => Value.Context));
end Bit_Vector;
------------------------------------------------------------------------------------------------
function Bit_Vector (Expr : Expr_Type'Class) return Bit_Vector_Type is
(Data => Expr.Data,
Context => Expr.Context);
------------------------------------------------------------------------------------------------
function Same_Context (Values : Bit_Vector_Array) return Boolean
is
First : Bit_Vector_Type;
begin
if Values'Length <= 1 then
return True;
end if;
First := Values (Values'First);
return (for all T of Values (Values'First + 1 .. Values'Last) => Same_Context (T, First));
end Same_Context;
------------------------------------------------------------------------------------------------
function Substitute (Expr : Expr_Type'Class;
From : Bit_Vector_Array;
To : Bit_Vector_Array) return Expr_Type'Class
is
From_Ast : constant Z3_ast_array := To_Z3_ast_array (From);
To_Ast : constant Z3_ast_array := To_Z3_ast_array (To);
begin
if From'Length = 0 then
return Expr;
end if;
return Expr_Type'(Data => z3_api_h.Z3_substitute (Expr.Context.Data,
Expr.Data,
From_Ast'Length,
From_Ast'Address,
To_Ast'Address),
Context => Expr.Context);
end Substitute;
------------------------------------------------------------------------------------------------
function Value (Data : Bit_Vector_Type) return Long_Long_Unsigned
is
Success : z3_api_h.Z3_bool;
Result : aliased Interfaces.C.Extensions.unsigned_long_long;
use type Interfaces.C.Extensions.bool;
begin
Success := z3_api_h.Z3_get_numeral_uint64 (c => Data.Context.Data,
v => Data.Data,
u => Result'Access);
if not Success then
raise Z3.Value_Error;
end if;
return Long_Long_Unsigned (Result);
end Value;
------------------------------------------------------------------------------------------------
function Size (Value : Bit_Vector_Type) return Natural
is
begin
return Natural (z3_api_h.Z3_get_bv_sort_size (c => Value.Context.Data,
t => z3_api_h.Z3_get_sort (c => Value.Context.Data,
a => Value.Data)));
end Size;
------------------------------------------------------------------------------------------------
function Add (Values : Bit_Vector_Array) return Bit_Vector_Type
is
Result : Bit_Vector_Type := Values (Values'First);
begin
for I in Values'First + 1 .. Values'Last loop
Result := Result + Values (I);
end loop;
return Result;
end Add;
------------------------------------------------------------------------------------------------
function "+" (Left : Bit_Vector_Type; Right : Bit_Vector_Type) return Bit_Vector_Type
is
begin
return (Data => z3_api_h.Z3_mk_bvadd (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end "+";
------------------------------------------------------------------------------------------------
function "-" (Left : Bit_Vector_Type; Right : Bit_Vector_Type) return Bit_Vector_Type
is
begin
return (Data => z3_api_h.Z3_mk_bvsub (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end "-";
------------------------------------------------------------------------------------------------
function Mul (Values : Bit_Vector_Array) return Bit_Vector_Type
is
Result : Bit_Vector_Type := Values (Values'First);
begin
for I in Values'First + 1 .. Values'Last loop
Result := Result * Values (I);
end loop;
return Result;
end Mul;
------------------------------------------------------------------------------------------------
function "*" (Left : Bit_Vector_Type; Right : Bit_Vector_Type) return Bit_Vector_Type
is
begin
return (Data => z3_api_h.Z3_mk_bvmul (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end "*";
------------------------------------------------------------------------------------------------
function "/" (Left : Bit_Vector_Type; Right : Bit_Vector_Type) return Bit_Vector_Type
is
begin
return (Data => z3_api_h.Z3_mk_bvsdiv (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end "/";
------------------------------------------------------------------------------------------------
function "mod" (Left : Bit_Vector_Type; Right : Bit_Vector_Type) return Bit_Vector_Type
is
begin
return (Data => z3_api_h.Z3_mk_bvsmod (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end "mod";
------------------------------------------------------------------------------------------------
function "-" (Value : Bit_Vector_Type) return Bit_Vector_Type
is
begin
return (Data => z3_api_h.Z3_mk_bvneg (c => Value.Context.Data,
t1 => Value.Data),
Context => Value.Context);
end "-";
------------------------------------------------------------------------------------------------
function "<" (Left : Bit_Vector_Type'Class; Right : Bit_Vector_Type'Class) return Bool_Type
is
begin
return (Data => z3_api_h.Z3_mk_bvslt (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end "<";
------------------------------------------------------------------------------------------------
function "<=" (Left : Bit_Vector_Type'Class; Right : Bit_Vector_Type'Class) return Bool_Type
is
begin
return (Data => z3_api_h.Z3_mk_bvsle (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end "<=";
------------------------------------------------------------------------------------------------
function ">" (Left : Bit_Vector_Type'Class; Right : Bit_Vector_Type'Class) return Bool_Type
is
begin
return (Data => z3_api_h.Z3_mk_bvsgt (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end ">";
------------------------------------------------------------------------------------------------
function ">=" (Left : Bit_Vector_Type'Class; Right : Bit_Vector_Type'Class) return Bool_Type
is
begin
return (Data => z3_api_h.Z3_mk_bvsge (c => Left.Context.Data,
t1 => Left.Data,
t2 => Right.Data),
Context => Left.Context);
end ">=";
end Z3;
|
-- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with Ada.Directories;
with Ada.Direct_IO;
with Ada.Unchecked_Deallocation;
with Interfaces.C.Strings;
with GL.API;
with GL.Types;
package body GL.Files is
use GL.Types;
procedure Load_Shader_Source_From_File (Object : Objects.Shaders.Shader;
File_Name : String) is
procedure Free is new Ada.Unchecked_Deallocation
(C.char_array, C.Strings.char_array_access);
File_Size : constant Int := Int (Ada.Directories.Size (File_Name));
-- File string *without* null termination
subtype File_String is C.char_array (1 .. C.size_t (File_Size));
package File_String_IO is new Ada.Direct_IO (File_String);
File : File_String_IO.File_Type;
Raw_Contents : C.Strings.char_array_access
:= new C.char_array (1 .. C.size_t (File_Size + 1));
begin
File_String_IO.Open (File, Mode => File_String_IO.In_File,
Name => File_Name);
File_String_IO.Read (File,
Item => Raw_Contents.all (1 .. C.size_t (File_Size)));
File_String_IO.Close (File);
Raw_Contents.all (C.size_t (File_Size + 1)) := C.nul;
API.Shader_Source (Object.Raw_Id, 1,
(1 => Raw_Contents (1)'Unchecked_Access),
(1 => File_Size));
Free (Raw_Contents);
Raise_Exception_On_OpenGL_Error;
end Load_Shader_Source_From_File;
end GL.Files;
|
with AUnit.Assertions; use AUnit.Assertions;
with Interfaces.C.Strings;
with Ada.Text_IO;
with ImageIO;
with PixelArray;
with ImageRegions;
with Histogram;
with HistogramGenerator;
use PixelArray;
package body HistogramTests is
procedure Register_Tests (T: in out TestCase) is
use AUnit.Test_Cases.Registration;
begin
Register_Routine (T, testBasicHistograms'Access, "basic histograms");
Register_Routine (T, testRescale'Access, "resizing histograms");
Register_Routine (T, testMultiplication'Access, "multiplication");
Register_Routine (T, testProjections'Access, "projecting images");
Register_Routine (T, testDistance'Access, "histogram distances");
end Register_Tests;
function Name(T: TestCase) return Test_String is
begin
return Format("Histogram Tests");
end Name;
procedure testBasicHistograms(T : in out Test_Cases.Test_Case'Class) is
d: Histogram.Data(5);
d1: Histogram.Data(5);
begin
Assert(d.sum = 0.0, "test 1");
Assert(d.size = 5, "test size");
d.set(0, 5.0);
d.set(1, 4.0);
d.set(2, 3.0);
d.set(3, 2.0);
d.set(4, 1.0);
Assert(d.get(3) = 2.0, "get");
Assert(d.sum = 15.0, "test sum");
Assert(d.average = 3.0, "avg");
d1 := d.normalized;
Assert(d1.sum = 1.0, "test normalized sum");
Assert(d.sum = 15.0, "control sum");
d.normalize;
Assert(d.sum = 1.0, "test normalized sum");
end testBasicHistograms;
procedure testRescale(T : in out Test_Cases.Test_Case'Class) is
d: Histogram.Data(3);
resized: Histogram.Data(4);
begin
d.set(0, 7.0);
d.set(1, 3.0);
d.set(2, 1.0);
resized := d.resized(4);
Assert(resized.get(0) = d.get(0), "0");
Assert(resized.get(1) < d.get(0) and resized.get(1) > d.get(1), "1");
Assert(resized.get(2) < d.get(1) and resized.get(2) > d.get(2), "2");
Assert(resized.get(3) = d.get(2), "3");
resized.set(0, 4.0);
resized.set(1, 1.0);
resized.set(2, 0.0);
resized.set(3, 4.0);
d := resized.resized(3);
Assert(d.get(0) = resized.get(0), "0");
Assert(d.get(1) < resized.get(0) and d.get(1) > resized.get(2), "1");
Assert(d.get(2) = resized.get(3), "2");
end testRescale;
procedure testMultiplication(T: in out Test_Cases.Test_Case'Class) is
h0, h1: Histogram.Data(3);
begin
h0.set(0, 1.0);
h0.set(1, 2.0);
h0.set(2, 3.0);
h1 := h0;
h1.multiply(1.5);
Assert(h1.get(0) = 1.5, "0");
Assert(h1.get(1) = 3.0, "1");
Assert(h1.get(2) = 4.5, "2");
Assert(h1.compare(h0, Histogram.ChiSquare) /= 0.0, "distance not equal");
Assert(h1.compare(h0.multiplied(1.5), Histogram.ChiSquare) = 0.0, "distance equal");
h1 := h0.add(h0);
Assert(h1.compare(h0.multiplied(2.0), Histogram.ChiSquare) = 0.0, "distance equal");
end testMultiplication;
procedure testProjections(T: in out Test_Cases.Test_Case'Class) is
image: PixelArray.ImagePlane := PixelArray.allocate(width => 5, height => 5);
r: ImageRegions.Rect;
begin
r.x := 0;
r.y := 0;
r.width := 5;
r.height := 5;
image.set(Pixel(255));
image.set(2, 0, 0);
image.set(2, 1, 0);
image.set(2, 2, 0);
image.set(2, 3, 0);
image.set(2, 4, 0);
-- horizontal and vertical projections of a straight vertical line
declare
hist: Histogram.Data := HistogramGenerator.horizontalProjection(image, r);
begin
Assert(hist.size = r.width, "hist w");
Assert(hist.sum = 5.0, "hist sum");
Assert(hist.get(0) = 0.0, "hist 0");
Assert(hist.get(1) = 0.0, "hist 1");
Assert(hist.get(2) = 5.0, "hist 2");
Assert(hist.get(3) = 0.0, "hist 3");
Assert(hist.get(4) = 0.0, "hist 4");
hist := HistogramGenerator.verticalProjection(image, r);
Assert(hist.size = r.height, "hist w");
Assert(hist.sum = 5.0, "hist sum");
Assert(hist.get(0) = 1.0, "hist 0");
Assert(hist.get(1) = 1.0, "hist 1");
Assert(hist.get(2) = 1.0, "hist 2");
Assert(hist.get(3) = 1.0, "hist 3");
Assert(hist.get(4) = 1.0, "hist 4");
end;
-- projections of y = x
image.set(Pixel(255));
image.set(0, 0, 0);
image.set(1, 1, 0);
image.set(2, 2, 0);
image.set(3, 3, 0);
image.set(4, 4, 0);
declare
hist: Histogram.Data := HistogramGenerator.horizontalProjection(image, r);
begin
Assert(hist.size = r.width, "hist w");
Assert(hist.sum = 5.0, "hist sum");
Assert(hist.get(0) = 1.0, "hist 0");
Assert(hist.get(1) = 1.0, "hist 1");
Assert(hist.get(2) = 1.0, "hist 2");
Assert(hist.get(3) = 1.0, "hist 3");
Assert(hist.get(4) = 1.0, "hist 4");
hist := HistogramGenerator.verticalProjection(image, r);
Assert(hist.size = r.height, "hist w");
Assert(hist.sum = 5.0, "hist sum");
Assert(hist.get(0) = 1.0, "hist 0");
Assert(hist.get(1) = 1.0, "hist 1");
Assert(hist.get(2) = 1.0, "hist 2");
Assert(hist.get(3) = 1.0, "hist 3");
Assert(hist.get(4) = 1.0, "hist 4");
end;
end testProjections;
procedure testDistance(T: in out Test_Cases.Test_Case'Class) is
h0, h1: Histogram.Data(5);
dist, dist2: Float := 0.0;
method: Histogram.CompareMethod;
begin
method := Histogram.Bhattacharyya;
dist := h0.compare(h1, method);
Assert(dist = 0.0, "compare id");
h0.set(0, 1.0);
h0.set(1, 2.0);
h0.set(2, 3.0);
h0.set(3, 4.0);
h0.set(4, 5.0);
dist := h0.compare(h1, method);
Assert(dist > 0.0, "compare different");
h1.set(0, 10.0);
h1.set(1, 10.0);
h1.set(2, 30.0);
h1.set(3, 40.0);
h1.set(4, 50.0);
dist2 := h0.compare(h1, method);
Assert(dist2 < dist, "similarity");
end testDistance;
end HistogramTests;
|
------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT INTERFACE COMPONENTS --
-- --
-- A S I S . A D A _ E N V I R O N M E N T S --
-- --
-- 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). --
-- --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- 8 package Asis.Ada_Environments
------------------------------------------------------------------------------
------------------------------------------------------------------------------
package Asis.Ada_Environments is
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Asis.Ada_Environments encapsulates a set of queries that map physical Ada
-- compilation and program execution environments to logical ASIS
-- environments.
--
------------------------------------------------------------------------------
-- 8.1 function Default_Name
------------------------------------------------------------------------------
function Default_Name return Wide_String;
------------------------------------------------------------------------------
-- Returns the default context name. If there is no default context name, a
-- null string is returned.
--
------------------------------------------------------------------------------
-- 8.2 function Default_Parameters
------------------------------------------------------------------------------
function Default_Parameters return Wide_String;
------------------------------------------------------------------------------
-- Returns the default context parameters. If there are no default context
-- parameters, a null string is returned.
--
------------------------------------------------------------------------------
-- 8.3 procedure Associate
------------------------------------------------------------------------------
procedure Associate
(The_Context : in out Asis.Context;
Name : Wide_String;
Parameters : Wide_String := Default_Parameters);
------------------------------------------------------------------------------
-- The_Context - Specifies the Context to associate
-- Name - Specifies the name for the Context association
-- Parameters - Specifies parameters to use when opening the Context
--
-- Used to give name and parameter associations to a Context. The
-- Has_Associations query is used to test whether or not a Context has
-- been given name and parameter associations. The Name and Parameters
-- queries are used to examine name and parameter associations.
--
-- A Context has at most one set of name/parameter values associated with
-- it at any time. Name and parameter associations cannot be modified while a
-- Context is open Previous name and parameters associations for this Context
-- are replaced by this call.
--
-- ASIS implementations are encouraged, but not required, to validate the
-- Parameters string immediately. It is recognized that some options cannot
-- be completely validated until the Open is performed. An invalid Parameters
-- value is reported by raising ASIS_Failed with a Status of Parameter_Error.
--
-- Raises ASIS_Inappropriate_Context if The_Context is open.
--
------------------------------------------------------------------------------
-- 8.4 procedure Open
------------------------------------------------------------------------------
procedure Open (The_Context : in out Asis.Context);
------------------------------------------------------------------------------
-- The_Context - Specifies the Context to open
--
-- Opens the ASIS Context using the Context's associated name and parameter
-- values.
--
-- Raises ASIS_Inappropriate_Context if The_Context is already open or if it
-- is uninitialized (does not have associated name and parameter values).
--
-- Raises ASIS_Failed if The_Context could not be opened for any reason. The
-- most likely Status values are Name_Error, Use_Error, Data_Error, and
-- Parameter_Error. Other possibilities include Storage_Error and
-- Capacity_Error.
--
------------------------------------------------------------------------------
-- 8.5 procedure Close
------------------------------------------------------------------------------
procedure Close (The_Context : in out Asis.Context);
------------------------------------------------------------------------------
-- The_Context - Specifies the Context to close
--
-- Closes the ASIS Context. Any previous Context name and parameter
-- associations are retained. This allows the same Context to be re-opened
-- later with the same associations.
--
-- All Compilation_Unit and Element values obtained from The_Context become
-- invalid when it is closed. Subsequent calls to ASIS services using such
-- invalid Compilation_Unit or Element values are erroneous. ASIS
-- implementations will attempt to detect such usage and raise ASIS_Failed in
-- response. Applications should be aware that the ability to detect the use
-- of such "dangling references" is implementation specific and not all
-- implementations are able to raise ASIS_Failed at the appropriate
-- points. Thus, applications that attempt to utilize invalid values may
-- exhibit unpredictable behavior.
--
-- Raises ASIS_Inappropriate_Context if The_Context is not open.
--
------------------------------------------------------------------------------
-- 8.6 procedure Dissociate
------------------------------------------------------------------------------
procedure Dissociate (The_Context : in out Asis.Context);
------------------------------------------------------------------------------
-- The_Context - Specifies the Context whose name and parameter associations
-- are to be cleared
--
-- Severs all previous associations for The_Context. A Context that does not
-- have associations (is uninitialized) is returned unchanged. The
-- variable The_Context is returned to its uninitialized state.
--
-- Contexts that have been given Names and Parameters should be Dissociated
-- when they are no longer necessary. Some amount of program storage can be
-- tied up by the stored Name and Parameter strings. This space is only
-- freed when a Context is Dissociated or when ASIS is Finalized.
--
-- This operation has no physical affect on any implementor's Ada environment.
--
-- Raises ASIS_Inappropriate_Context if The_Context is open.
--
------------------------------------------------------------------------------
-- 8.7 function Is_Equal
------------------------------------------------------------------------------
function Is_Equal
(Left : Asis.Context;
Right : Asis.Context)
return Boolean;
------------------------------------------------------------------------------
-- Left - Specifies the first Context
-- Right - Specifies the second Context
--
-- Returns True if Left and Right designate the same set of associated
-- compilation units. The Context variables may be open or closed.
--
-- Unless both Contexts are open, this operation is implemented as a pair of
-- simple string comparisons between the Name and Parameter associations for
-- the two Contexts. If both Contexts are open, this operation acts as a
-- set comparison and returns True if both sets contain the same units (all
-- unit versions are included in the comparison).
--
-- --|AN Application Note:
-- --|AN
-- --|AN With some implementations, Is_Equal may be True before the Contexts
-- --|AN are opened, but may be False after the Contexts are open.
-- --|AN One possible cause for this is a sequence of events such as:
-- --|AN
-- --|AN 1) ASIS program A opens the Left Context for READ,
-- --|AN 2) non-ASIS program B opens the Context for UPDATE, and creates
-- --|AN a new version of the implementor Context,
-- --|AN 3) ASIS program A opens the Right Context for READ, and gets the
-- --|AN new version.
--
------------------------------------------------------------------------------
-- 8.8 function Is_Identical
------------------------------------------------------------------------------
function Is_Identical
(Left : Asis.Context;
Right : Asis.Context)
return Boolean;
------------------------------------------------------------------------------
-- Left - Specifies the first Context
-- Right - Specifies the second Context
--
-- Returns True if Left and Right both designate the value associated with
-- one specific ASIS Context variable.
--
-- Returns False otherwise or if either Context is not open.
--
-- --|AN Application Note:
-- --|AN
-- --|AN No two physically separate open Context variables are ever
-- --|AN Is_Identical. The value associated with an open ASIS Context variable
-- --|AN is also directly associated with every Compilation_Unit or Element
-- --|AN derived from that Context. It is possible to obtain these Context
-- --|AN values by way of the Enclosing_Context and the
-- --|AN Enclosing_Compilation_Unit queries. These Context values can be
-- --|AN tested for identity with each other or with specific Context
-- --|AN variables. An open ASIS Context variable and an Enclosing_Context
-- --|AN value are only Is_Identical if the Compilation_Unit in question
-- --|AN was derived specifically from that open ASIS Context variable.
--
------------------------------------------------------------------------------
-- 8.9 function Exists
------------------------------------------------------------------------------
function Exists (The_Context : Asis.Context) return Boolean;
------------------------------------------------------------------------------
-- The_Context - Specifies a Context with associated name and parameter values
--
-- Returns True if The_Context is open or if The_Context designates an Ada
-- environment that can be determined to exist.
--
-- Returns False for any uninitialized The_Context variable.
--
-- --|IP Implementation Permissions:
-- --|IP
-- --|IP No guarantee is made that The_Context is readable or that an Open
-- --|IP operation on The_Context would succeed. The associated
-- --|IP parameter value for The_Context may not be fully validated by this
-- --|IP simple existence check. It may contain information that can only be
-- --|IP verified by an Open.
--
------------------------------------------------------------------------------
-- 8.10 function Is_Open
------------------------------------------------------------------------------
function Is_Open (The_Context : Asis.Context) return Boolean;
------------------------------------------------------------------------------
-- The_Context - Specifies the Context to check
--
-- Returns True if The_Context is currently open.
--
------------------------------------------------------------------------------
-- 8.11 function Has_Associations
------------------------------------------------------------------------------
function Has_Associations (The_Context : Asis.Context) return Boolean;
------------------------------------------------------------------------------
-- The_Context - Specifies the Context to check
--
-- Returns True if name and parameter values have been associated with
-- The_Context.
--
-- Returns False if The_Context is uninitialized.
--
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- 8.12 function Name
------------------------------------------------------------------------------
function Name (The_Context : Asis.Context) return Wide_String;
------------------------------------------------------------------------------
-- The_Context - Specifies the Context to check
--
-- Returns the Name value associated with The_Context.
--
-- Returns a null string if The_Context is uninitialized.
--
------------------------------------------------------------------------------
-- 8.13 function Parameter
------------------------------------------------------------------------------
function Parameters (The_Context : Asis.Context) return Wide_String;
------------------------------------------------------------------------------
-- The_Context - Specifies the Context to check
--
-- Returns the Parameters value associated with The_Context.
--
-- Returns a null string if The_Context is uninitialized.
--
------------------------------------------------------------------------------
-- 8.14 function Debug_Image
------------------------------------------------------------------------------
function Debug_Image (The_Context : Asis.Context) return Wide_String;
------------------------------------------------------------------------------
-- The_Context - Specifies the Context to represent
--
-- Returns a string value containing implementation-defined debugging
-- information associated with The_Context.
--
-- The return value uses Asis.Text.Delimiter_Image to separate lines in
-- multi-line results. The return value is not terminated with
-- Asis.Text.Delimiter_Image.
--
-- Returns a null string if The_Context is uninitialized.
--
-- These values are intended for two purposes. They are suitable for
-- inclusion in problem reports sent to the ASIS implementor. They can be
-- presumed to contain information useful when debugging the implementation
-- itself. They are also suitable for use by the ASIS application when
-- printing simple application debugging messages during application
-- development. They are intended to be, to some worthwhile degree,
-- intelligible to the user.
end Asis.Ada_Environments;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- ADA.NUMERICS.GENERIC_REAL_ARRAYS --
-- --
-- S p e c --
-- --
-- Copyright (C) 2009-2012, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
generic
type Real is digits <>;
package Ada.Numerics.Generic_Real_Arrays is
pragma Pure (Generic_Real_Arrays);
-- Types
type Real_Vector is array (Integer range <>) of Real'Base;
type Real_Matrix is array (Integer range <>, Integer range <>) of Real'Base;
-- Subprograms for Real_Vector types
-- Real_Vector arithmetic operations
function "+" (Right : Real_Vector) return Real_Vector;
function "-" (Right : Real_Vector) return Real_Vector;
function "abs" (Right : Real_Vector) return Real_Vector;
function "+" (Left, Right : Real_Vector) return Real_Vector;
function "-" (Left, Right : Real_Vector) return Real_Vector;
function "*" (Left, Right : Real_Vector) return Real'Base;
function "abs" (Right : Real_Vector) return Real'Base;
-- Real_Vector scaling operations
function "*" (Left : Real'Base; Right : Real_Vector) return Real_Vector;
function "*" (Left : Real_Vector; Right : Real'Base) return Real_Vector;
function "/" (Left : Real_Vector; Right : Real'Base) return Real_Vector;
-- Other Real_Vector operations
function Unit_Vector
(Index : Integer;
Order : Positive;
First : Integer := 1) return Real_Vector;
-- Subprograms for Real_Matrix types
-- Real_Matrix arithmetic operations
function "+" (Right : Real_Matrix) return Real_Matrix;
function "-" (Right : Real_Matrix) return Real_Matrix;
function "abs" (Right : Real_Matrix) return Real_Matrix;
function Transpose (X : Real_Matrix) return Real_Matrix;
function "+" (Left, Right : Real_Matrix) return Real_Matrix;
function "-" (Left, Right : Real_Matrix) return Real_Matrix;
function "*" (Left, Right : Real_Matrix) return Real_Matrix;
function "*" (Left, Right : Real_Vector) return Real_Matrix;
function "*" (Left : Real_Vector; Right : Real_Matrix) return Real_Vector;
function "*" (Left : Real_Matrix; Right : Real_Vector) return Real_Vector;
-- Real_Matrix scaling operations
function "*" (Left : Real'Base; Right : Real_Matrix) return Real_Matrix;
function "*" (Left : Real_Matrix; Right : Real'Base) return Real_Matrix;
function "/" (Left : Real_Matrix; Right : Real'Base) return Real_Matrix;
-- Real_Matrix inversion and related operations
function Solve (A : Real_Matrix; X : Real_Vector) return Real_Vector;
function Solve (A, X : Real_Matrix) return Real_Matrix;
function Inverse (A : Real_Matrix) return Real_Matrix;
function Determinant (A : Real_Matrix) return Real'Base;
-- Eigenvalues and vectors of a real symmetric matrix
function Eigenvalues (A : Real_Matrix) return Real_Vector;
procedure Eigensystem
(A : Real_Matrix;
Values : out Real_Vector;
Vectors : out Real_Matrix);
-- Other Real_Matrix operations
function Unit_Matrix
(Order : Positive;
First_1 : Integer := 1;
First_2 : Integer := 1) return Real_Matrix;
private
-- The following operations are either relatively simple compared to the
-- expense of returning unconstrained arrays, or are just function wrappers
-- calling procedures implementing the actual operation. By having the
-- front end inline these, the expense of the unconstrained returns
-- can be avoided.
-- Note: We use an extended return statement in their implementation to
-- allow the frontend to inline these functions.
pragma Inline ("+");
pragma Inline ("-");
pragma Inline ("*");
pragma Inline ("/");
pragma Inline ("abs");
pragma Inline (Eigenvalues);
pragma Inline (Inverse);
pragma Inline (Solve);
pragma Inline (Transpose);
pragma Inline (Unit_Matrix);
pragma Inline (Unit_Vector);
end Ada.Numerics.Generic_Real_Arrays;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.UML_Classifiers;
with AMF.String_Collections;
with AMF.UML.Association_Classes;
with AMF.UML.Behaviors.Collections;
with AMF.UML.Classes.Collections;
with AMF.UML.Classifier_Template_Parameters;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Collaboration_Uses.Collections;
with AMF.UML.Connectable_Elements.Collections;
with AMF.UML.Connectors.Collections;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Element_Imports.Collections;
with AMF.UML.Elements.Collections;
with AMF.UML.Extensions.Collections;
with AMF.UML.Features.Collections;
with AMF.UML.Generalization_Sets.Collections;
with AMF.UML.Generalizations.Collections;
with AMF.UML.Interface_Realizations.Collections;
with AMF.UML.Named_Elements.Collections;
with AMF.UML.Namespaces;
with AMF.UML.Operations.Collections;
with AMF.UML.Package_Imports.Collections;
with AMF.UML.Packageable_Elements.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.Parameterable_Elements.Collections;
with AMF.UML.Ports.Collections;
with AMF.UML.Properties.Collections;
with AMF.UML.Receptions.Collections;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.Redefinable_Template_Signatures;
with AMF.UML.String_Expressions;
with AMF.UML.Substitutions.Collections;
with AMF.UML.Template_Bindings.Collections;
with AMF.UML.Template_Parameters;
with AMF.UML.Template_Signatures;
with AMF.UML.Types.Collections;
with AMF.UML.Use_Cases.Collections;
with AMF.Visitors;
package AMF.Internals.UML_Association_Classes is
type UML_Association_Class_Proxy is
limited new AMF.Internals.UML_Classifiers.UML_Classifier_Proxy
and AMF.UML.Association_Classes.UML_Association_Class with null record;
overriding function Get_End_Type
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Types.Collections.Ordered_Set_Of_UML_Type;
-- Getter of Association::endType.
--
-- References the classifiers that are used as types of the ends of the
-- association.
overriding function Get_Is_Derived
(Self : not null access constant UML_Association_Class_Proxy)
return Boolean;
-- Getter of Association::isDerived.
--
-- Specifies whether the association is derived from other model elements
-- such as other associations or constraints.
overriding procedure Set_Is_Derived
(Self : not null access UML_Association_Class_Proxy;
To : Boolean);
-- Setter of Association::isDerived.
--
-- Specifies whether the association is derived from other model elements
-- such as other associations or constraints.
overriding function Get_Member_End
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Properties.Collections.Ordered_Set_Of_UML_Property;
-- Getter of Association::memberEnd.
--
-- Each end represents participation of instances of the classifier
-- connected to the end in links of the association.
overriding function Get_Navigable_Owned_End
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property;
-- Getter of Association::navigableOwnedEnd.
--
-- The navigable ends that are owned by the association itself.
overriding function Get_Owned_End
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Properties.Collections.Ordered_Set_Of_UML_Property;
-- Getter of Association::ownedEnd.
--
-- The ends that are owned by the association itself.
overriding function Get_Related_Element
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element;
-- Getter of Relationship::relatedElement.
--
-- Specifies the elements related by the Relationship.
overriding function Get_Attribute
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property;
-- Getter of Classifier::attribute.
--
-- Refers to all of the Properties that are direct (i.e. not inherited or
-- imported) attributes of the classifier.
overriding function Get_Collaboration_Use
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Collaboration_Uses.Collections.Set_Of_UML_Collaboration_Use;
-- Getter of Classifier::collaborationUse.
--
-- References the collaboration uses owned by the classifier.
overriding function Get_Feature
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature;
-- Getter of Classifier::feature.
--
-- Specifies each feature defined in the classifier.
-- Note that there may be members of the Classifier that are of the type
-- Feature but are not included in this association, e.g. inherited
-- features.
overriding function Get_General
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of Classifier::general.
--
-- Specifies the general Classifiers for this Classifier.
-- References the general classifier in the Generalization relationship.
overriding function Get_Generalization
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Generalizations.Collections.Set_Of_UML_Generalization;
-- Getter of Classifier::generalization.
--
-- Specifies the Generalization relationships for this Classifier. These
-- Generalizations navigaten to more general classifiers in the
-- generalization hierarchy.
overriding function Get_Inherited_Member
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Classifier::inheritedMember.
--
-- Specifies all elements inherited by this classifier from the general
-- classifiers.
overriding function Get_Is_Abstract
(Self : not null access constant UML_Association_Class_Proxy)
return Boolean;
-- Getter of Classifier::isAbstract.
--
-- If true, the Classifier does not provide a complete declaration and can
-- typically not be instantiated. An abstract classifier is intended to be
-- used by other classifiers e.g. as the target of general
-- metarelationships or generalization relationships.
overriding function Get_Is_Final_Specialization
(Self : not null access constant UML_Association_Class_Proxy)
return Boolean;
-- Getter of Classifier::isFinalSpecialization.
--
-- If true, the Classifier cannot be specialized by generalization. Note
-- that this property is preserved through package merge operations; that
-- is, the capability to specialize a Classifier (i.e.,
-- isFinalSpecialization =false) must be preserved in the resulting
-- Classifier of a package merge operation where a Classifier with
-- isFinalSpecialization =false is merged with a matching Classifier with
-- isFinalSpecialization =true: the resulting Classifier will have
-- isFinalSpecialization =false.
overriding procedure Set_Is_Final_Specialization
(Self : not null access UML_Association_Class_Proxy;
To : Boolean);
-- Setter of Classifier::isFinalSpecialization.
--
-- If true, the Classifier cannot be specialized by generalization. Note
-- that this property is preserved through package merge operations; that
-- is, the capability to specialize a Classifier (i.e.,
-- isFinalSpecialization =false) must be preserved in the resulting
-- Classifier of a package merge operation where a Classifier with
-- isFinalSpecialization =false is merged with a matching Classifier with
-- isFinalSpecialization =true: the resulting Classifier will have
-- isFinalSpecialization =false.
overriding function Get_Owned_Template_Signature
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access;
-- Getter of Classifier::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding procedure Set_Owned_Template_Signature
(Self : not null access UML_Association_Class_Proxy;
To : AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access);
-- Setter of Classifier::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding function Get_Owned_Use_Case
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case;
-- Getter of Classifier::ownedUseCase.
--
-- References the use cases owned by this classifier.
overriding function Get_Powertype_Extent
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Generalization_Sets.Collections.Set_Of_UML_Generalization_Set;
-- Getter of Classifier::powertypeExtent.
--
-- Designates the GeneralizationSet of which the associated Classifier is
-- a power type.
overriding function Get_Redefined_Classifier
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of Classifier::redefinedClassifier.
--
-- References the Classifiers that are redefined by this Classifier.
overriding function Get_Representation
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access;
-- Getter of Classifier::representation.
--
-- References a collaboration use which indicates the collaboration that
-- represents this classifier.
overriding procedure Set_Representation
(Self : not null access UML_Association_Class_Proxy;
To : AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access);
-- Setter of Classifier::representation.
--
-- References a collaboration use which indicates the collaboration that
-- represents this classifier.
overriding function Get_Substitution
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Substitutions.Collections.Set_Of_UML_Substitution;
-- Getter of Classifier::substitution.
--
-- References the substitutions that are owned by this Classifier.
overriding function Get_Template_Parameter
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access;
-- Getter of Classifier::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding procedure Set_Template_Parameter
(Self : not null access UML_Association_Class_Proxy;
To : AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access);
-- Setter of Classifier::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding function Get_Use_Case
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case;
-- Getter of Classifier::useCase.
--
-- The set of use cases for which this Classifier is the subject.
overriding function Get_Element_Import
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Element_Imports.Collections.Set_Of_UML_Element_Import;
-- Getter of Namespace::elementImport.
--
-- References the ElementImports owned by the Namespace.
overriding function Get_Imported_Member
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Getter of Namespace::importedMember.
--
-- References the PackageableElements that are members of this Namespace
-- as a result of either PackageImports or ElementImports.
overriding function Get_Member
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::member.
--
-- A collection of NamedElements identifiable within the Namespace, either
-- by being owned or by being introduced by importing or inheritance.
overriding function Get_Owned_Member
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::ownedMember.
--
-- A collection of NamedElements owned by the Namespace.
overriding function Get_Owned_Rule
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Namespace::ownedRule.
--
-- Specifies a set of Constraints owned by this Namespace.
overriding function Get_Package_Import
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Package_Imports.Collections.Set_Of_UML_Package_Import;
-- Getter of Namespace::packageImport.
--
-- References the PackageImports owned by the Namespace.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Association_Class_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Get_Package
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Packages.UML_Package_Access;
-- Getter of Type::package.
--
-- Specifies the owning package of this classifier, if any.
overriding procedure Set_Package
(Self : not null access UML_Association_Class_Proxy;
To : AMF.UML.Packages.UML_Package_Access);
-- Setter of Type::package.
--
-- Specifies the owning package of this classifier, if any.
overriding function Get_Owning_Template_Parameter
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access;
-- Getter of ParameterableElement::owningTemplateParameter.
--
-- The formal template parameter that owns this element.
overriding procedure Set_Owning_Template_Parameter
(Self : not null access UML_Association_Class_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access);
-- Setter of ParameterableElement::owningTemplateParameter.
--
-- The formal template parameter that owns this element.
overriding function Get_Template_Parameter
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access;
-- Getter of ParameterableElement::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding procedure Set_Template_Parameter
(Self : not null access UML_Association_Class_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access);
-- Setter of ParameterableElement::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding function Get_Owned_Template_Signature
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Template_Signatures.UML_Template_Signature_Access;
-- Getter of TemplateableElement::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding procedure Set_Owned_Template_Signature
(Self : not null access UML_Association_Class_Proxy;
To : AMF.UML.Template_Signatures.UML_Template_Signature_Access);
-- Setter of TemplateableElement::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding function Get_Template_Binding
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Template_Bindings.Collections.Set_Of_UML_Template_Binding;
-- Getter of TemplateableElement::templateBinding.
--
-- The optional bindings from this element to templates.
overriding function Get_Is_Leaf
(Self : not null access constant UML_Association_Class_Proxy)
return Boolean;
-- Getter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding procedure Set_Is_Leaf
(Self : not null access UML_Association_Class_Proxy;
To : Boolean);
-- Setter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding function Get_Redefined_Element
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element;
-- Getter of RedefinableElement::redefinedElement.
--
-- The redefinable element that is being redefined by this element.
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of RedefinableElement::redefinitionContext.
--
-- References the contexts that this element may be redefined from.
overriding function Get_Extension
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Extensions.Collections.Set_Of_UML_Extension;
-- Getter of Class::extension.
--
-- References the Extensions that specify additional properties of the
-- metaclass. The property is derived from the extensions whose memberEnds
-- are typed by the Class.
overriding function Get_Is_Active
(Self : not null access constant UML_Association_Class_Proxy)
return Boolean;
-- Getter of Class::isActive.
--
-- Determines whether an object specified by this class is active or not.
-- If true, then the owning class is referred to as an active class. If
-- false, then such a class is referred to as a passive class.
overriding procedure Set_Is_Active
(Self : not null access UML_Association_Class_Proxy;
To : Boolean);
-- Setter of Class::isActive.
--
-- Determines whether an object specified by this class is active or not.
-- If true, then the owning class is referred to as an active class. If
-- false, then such a class is referred to as a passive class.
overriding function Get_Nested_Classifier
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Classifiers.Collections.Ordered_Set_Of_UML_Classifier;
-- Getter of Class::nestedClassifier.
--
-- References all the Classifiers that are defined (nested) within the
-- Class.
overriding function Get_Owned_Attribute
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Properties.Collections.Ordered_Set_Of_UML_Property;
-- Getter of Class::ownedAttribute.
--
-- The attributes (i.e. the properties) owned by the class.
overriding function Get_Owned_Operation
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Operations.Collections.Ordered_Set_Of_UML_Operation;
-- Getter of Class::ownedOperation.
--
-- The operations owned by the class.
overriding function Get_Owned_Reception
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Receptions.Collections.Set_Of_UML_Reception;
-- Getter of Class::ownedReception.
--
-- Receptions that objects of this class are willing to accept.
overriding function Get_Super_Class
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Classes.Collections.Set_Of_UML_Class;
-- Getter of Class::superClass.
--
-- This gives the superclasses of a class.
overriding function Get_Classifier_Behavior
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Behaviors.UML_Behavior_Access;
-- Getter of BehavioredClassifier::classifierBehavior.
--
-- A behavior specification that specifies the behavior of the classifier
-- itself.
overriding procedure Set_Classifier_Behavior
(Self : not null access UML_Association_Class_Proxy;
To : AMF.UML.Behaviors.UML_Behavior_Access);
-- Setter of BehavioredClassifier::classifierBehavior.
--
-- A behavior specification that specifies the behavior of the classifier
-- itself.
overriding function Get_Interface_Realization
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Interface_Realizations.Collections.Set_Of_UML_Interface_Realization;
-- Getter of BehavioredClassifier::interfaceRealization.
--
-- The set of InterfaceRealizations owned by the BehavioredClassifier.
-- Interface realizations reference the Interfaces of which the
-- BehavioredClassifier is an implementation.
overriding function Get_Owned_Behavior
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Behaviors.Collections.Set_Of_UML_Behavior;
-- Getter of BehavioredClassifier::ownedBehavior.
--
-- References behavior specifications owned by a classifier.
overriding function Get_Owned_Port
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Ports.Collections.Set_Of_UML_Port;
-- Getter of EncapsulatedClassifier::ownedPort.
--
-- References a set of ports that an encapsulated classifier owns.
overriding function Get_Owned_Connector
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Connectors.Collections.Set_Of_UML_Connector;
-- Getter of StructuredClassifier::ownedConnector.
--
-- References the connectors owned by the classifier.
overriding function Get_Part
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property;
-- Getter of StructuredClassifier::part.
--
-- References the properties specifying instances that the classifier owns
-- by composition. This association is derived, selecting those owned
-- properties where isComposite is true.
overriding function Get_Role
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Connectable_Elements.Collections.Set_Of_UML_Connectable_Element;
-- Getter of StructuredClassifier::role.
--
-- References the roles that instances may play in this classifier.
overriding function End_Type
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Types.Collections.Ordered_Set_Of_UML_Type;
-- Operation Association::endType.
--
-- endType is derived from the types of the member ends.
overriding function All_Features
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature;
-- Operation Classifier::allFeatures.
--
-- The query allFeatures() gives all of the features in the namespace of
-- the classifier. In general, through mechanisms such as inheritance,
-- this will be a larger set than feature.
overriding function Conforms_To
(Self : not null access constant UML_Association_Class_Proxy;
Other : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean;
-- Operation Classifier::conformsTo.
--
-- The query conformsTo() gives true for a classifier that defines a type
-- that conforms to another. This is used, for example, in the
-- specification of signature conformance for operations.
overriding function General
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Operation Classifier::general.
--
-- The general classifiers are the classifiers referenced by the
-- generalization relationships.
overriding function Has_Visibility_Of
(Self : not null access constant UML_Association_Class_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access)
return Boolean;
-- Operation Classifier::hasVisibilityOf.
--
-- The query hasVisibilityOf() determines whether a named element is
-- visible in the classifier. By default all are visible. It is only
-- called when the argument is something owned by a parent.
overriding function Inherit
(Self : not null access constant UML_Association_Class_Proxy;
Inhs : AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Classifier::inherit.
--
-- The query inherit() defines how to inherit a set of elements. Here the
-- operation is defined to inherit them all. It is intended to be
-- redefined in circumstances where inheritance is affected by
-- redefinition.
-- The inherit operation is overridden to exclude redefined properties.
overriding function Inheritable_Members
(Self : not null access constant UML_Association_Class_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Classifier::inheritableMembers.
--
-- The query inheritableMembers() gives all of the members of a classifier
-- that may be inherited in one of its descendants, subject to whatever
-- visibility restrictions apply.
overriding function Inherited_Member
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Classifier::inheritedMember.
--
-- The inheritedMember association is derived by inheriting the
-- inheritable members of the parents.
-- The inheritedMember association is derived by inheriting the
-- inheritable members of the parents.
overriding function Is_Template
(Self : not null access constant UML_Association_Class_Proxy)
return Boolean;
-- Operation Classifier::isTemplate.
--
-- The query isTemplate() returns whether this templateable element is
-- actually a template.
overriding function May_Specialize_Type
(Self : not null access constant UML_Association_Class_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean;
-- Operation Classifier::maySpecializeType.
--
-- The query maySpecializeType() determines whether this classifier may
-- have a generalization relationship to classifiers of the specified
-- type. By default a classifier may specialize classifiers of the same or
-- a more general type. It is intended to be redefined by classifiers that
-- have different specialization constraints.
overriding function Exclude_Collisions
(Self : not null access constant UML_Association_Class_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::excludeCollisions.
--
-- The query excludeCollisions() excludes from a set of
-- PackageableElements any that would not be distinguishable from each
-- other in this namespace.
overriding function Get_Names_Of_Member
(Self : not null access constant UML_Association_Class_Proxy;
Element : AMF.UML.Named_Elements.UML_Named_Element_Access)
return AMF.String_Collections.Set_Of_String;
-- Operation Namespace::getNamesOfMember.
--
-- The query getNamesOfMember() takes importing into account. It gives
-- back the set of names that an element would have in an importing
-- namespace, either because it is owned, or if not owned then imported
-- individually, or if not individually then from a package.
-- The query getNamesOfMember() gives a set of all of the names that a
-- member would have in a Namespace. In general a member can have multiple
-- names in a Namespace if it is imported more than once with different
-- aliases. The query takes account of importing. It gives back the set of
-- names that an element would have in an importing namespace, either
-- because it is owned, or if not owned then imported individually, or if
-- not individually then from a package.
overriding function Import_Members
(Self : not null access constant UML_Association_Class_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importMembers.
--
-- The query importMembers() defines which of a set of PackageableElements
-- are actually imported into the namespace. This excludes hidden ones,
-- i.e., those which have names that conflict with names of owned members,
-- and also excludes elements which would have the same name when imported.
overriding function Imported_Member
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importedMember.
--
-- The importedMember property is derived from the ElementImports and the
-- PackageImports. References the PackageableElements that are members of
-- this Namespace as a result of either PackageImports or ElementImports.
overriding function Members_Are_Distinguishable
(Self : not null access constant UML_Association_Class_Proxy)
return Boolean;
-- Operation Namespace::membersAreDistinguishable.
--
-- The Boolean query membersAreDistinguishable() determines whether all of
-- the namespace's members are distinguishable within it.
overriding function Owned_Member
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Namespace::ownedMember.
--
-- Missing derivation for Namespace::/ownedMember : NamedElement
overriding function All_Owning_Packages
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Association_Class_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding function Conforms_To
(Self : not null access constant UML_Association_Class_Proxy;
Other : AMF.UML.Types.UML_Type_Access)
return Boolean;
-- Operation Type::conformsTo.
--
-- The query conformsTo() gives true for a type that conforms to another.
-- By default, two types do not conform to each other. This query is
-- intended to be redefined for specific conformance situations.
overriding function Is_Compatible_With
(Self : not null access constant UML_Association_Class_Proxy;
P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access)
return Boolean;
-- Operation ParameterableElement::isCompatibleWith.
--
-- The query isCompatibleWith() determines if this parameterable element
-- is compatible with the specified parameterable element. By default
-- parameterable element P is compatible with parameterable element Q if
-- the kind of P is the same or a subtype as the kind of Q. Subclasses
-- should override this operation to specify different compatibility
-- constraints.
overriding function Is_Template_Parameter
(Self : not null access constant UML_Association_Class_Proxy)
return Boolean;
-- Operation ParameterableElement::isTemplateParameter.
--
-- The query isTemplateParameter() determines if this parameterable
-- element is exposed as a formal template parameter.
overriding function Parameterable_Elements
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Parameterable_Elements.Collections.Set_Of_UML_Parameterable_Element;
-- Operation TemplateableElement::parameterableElements.
--
-- The query parameterableElements() returns the set of elements that may
-- be used as the parametered elements for a template parameter of this
-- templateable element. By default, this set includes all the owned
-- elements. Subclasses may override this operation if they choose to
-- restrict the set of parameterable elements.
overriding function Is_Consistent_With
(Self : not null access constant UML_Association_Class_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isConsistentWith.
--
-- The query isConsistentWith() specifies, for any two RedefinableElements
-- in a context in which redefinition is possible, whether redefinition
-- would be logically consistent. By default, this is false; this
-- operation must be overridden for subclasses of RedefinableElement to
-- define the consistency conditions.
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Association_Class_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isRedefinitionContextValid.
--
-- The query isRedefinitionContextValid() specifies whether the
-- redefinition contexts of this RedefinableElement are properly related
-- to the redefinition contexts of the specified RedefinableElement to
-- allow this element to redefine the other. By default at least one of
-- the redefinition contexts of this element must be a specialization of
-- at least one of the redefinition contexts of the specified element.
overriding function Extension
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Extensions.Collections.Set_Of_UML_Extension;
-- Operation Class::extension.
--
-- Missing derivation for Class::/extension : Extension
overriding function Super_Class
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Classes.Collections.Set_Of_UML_Class;
-- Operation Class::superClass.
--
-- Missing derivation for Class::/superClass : Class
overriding function Owned_Port
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Ports.Collections.Set_Of_UML_Port;
-- Operation EncapsulatedClassifier::ownedPort.
--
-- Missing derivation for EncapsulatedClassifier::/ownedPort : Port
overriding function Part
(Self : not null access constant UML_Association_Class_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property;
-- Operation StructuredClassifier::part.
--
-- Missing derivation for StructuredClassifier::/part : Property
overriding procedure Enter_Element
(Self : not null access constant UML_Association_Class_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Association_Class_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Association_Class_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Association_Classes;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.UML.Read_Variable_Actions.Collections is
pragma Preelaborate;
package UML_Read_Variable_Action_Collections is
new AMF.Generic_Collections
(UML_Read_Variable_Action,
UML_Read_Variable_Action_Access);
type Set_Of_UML_Read_Variable_Action is
new UML_Read_Variable_Action_Collections.Set with null record;
Empty_Set_Of_UML_Read_Variable_Action : constant Set_Of_UML_Read_Variable_Action;
type Ordered_Set_Of_UML_Read_Variable_Action is
new UML_Read_Variable_Action_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UML_Read_Variable_Action : constant Ordered_Set_Of_UML_Read_Variable_Action;
type Bag_Of_UML_Read_Variable_Action is
new UML_Read_Variable_Action_Collections.Bag with null record;
Empty_Bag_Of_UML_Read_Variable_Action : constant Bag_Of_UML_Read_Variable_Action;
type Sequence_Of_UML_Read_Variable_Action is
new UML_Read_Variable_Action_Collections.Sequence with null record;
Empty_Sequence_Of_UML_Read_Variable_Action : constant Sequence_Of_UML_Read_Variable_Action;
private
Empty_Set_Of_UML_Read_Variable_Action : constant Set_Of_UML_Read_Variable_Action
:= (UML_Read_Variable_Action_Collections.Set with null record);
Empty_Ordered_Set_Of_UML_Read_Variable_Action : constant Ordered_Set_Of_UML_Read_Variable_Action
:= (UML_Read_Variable_Action_Collections.Ordered_Set with null record);
Empty_Bag_Of_UML_Read_Variable_Action : constant Bag_Of_UML_Read_Variable_Action
:= (UML_Read_Variable_Action_Collections.Bag with null record);
Empty_Sequence_Of_UML_Read_Variable_Action : constant Sequence_Of_UML_Read_Variable_Action
:= (UML_Read_Variable_Action_Collections.Sequence with null record);
end AMF.UML.Read_Variable_Actions.Collections;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
-- A lifeline represents an individual participant in the interaction. While
-- parts and structural features may have multiplicity greater than 1,
-- lifelines represent only one interacting entity.
------------------------------------------------------------------------------
limited with AMF.UML.Connectable_Elements;
limited with AMF.UML.Interaction_Fragments.Collections;
limited with AMF.UML.Interactions;
with AMF.UML.Named_Elements;
limited with AMF.UML.Part_Decompositions;
limited with AMF.UML.Value_Specifications;
package AMF.UML.Lifelines is
pragma Preelaborate;
type UML_Lifeline is limited interface
and AMF.UML.Named_Elements.UML_Named_Element;
type UML_Lifeline_Access is
access all UML_Lifeline'Class;
for UML_Lifeline_Access'Storage_Size use 0;
not overriding function Get_Covered_By
(Self : not null access constant UML_Lifeline)
return AMF.UML.Interaction_Fragments.Collections.Set_Of_UML_Interaction_Fragment is abstract;
-- Getter of Lifeline::coveredBy.
--
-- References the InteractionFragments in which this Lifeline takes part.
not overriding function Get_Decomposed_As
(Self : not null access constant UML_Lifeline)
return AMF.UML.Part_Decompositions.UML_Part_Decomposition_Access is abstract;
-- Getter of Lifeline::decomposedAs.
--
-- References the Interaction that represents the decomposition.
not overriding procedure Set_Decomposed_As
(Self : not null access UML_Lifeline;
To : AMF.UML.Part_Decompositions.UML_Part_Decomposition_Access) is abstract;
-- Setter of Lifeline::decomposedAs.
--
-- References the Interaction that represents the decomposition.
not overriding function Get_Interaction
(Self : not null access constant UML_Lifeline)
return AMF.UML.Interactions.UML_Interaction_Access is abstract;
-- Getter of Lifeline::interaction.
--
-- References the Interaction enclosing this Lifeline.
not overriding procedure Set_Interaction
(Self : not null access UML_Lifeline;
To : AMF.UML.Interactions.UML_Interaction_Access) is abstract;
-- Setter of Lifeline::interaction.
--
-- References the Interaction enclosing this Lifeline.
not overriding function Get_Represents
(Self : not null access constant UML_Lifeline)
return AMF.UML.Connectable_Elements.UML_Connectable_Element_Access is abstract;
-- Getter of Lifeline::represents.
--
-- References the ConnectableElement within the classifier that contains
-- the enclosing interaction.
not overriding procedure Set_Represents
(Self : not null access UML_Lifeline;
To : AMF.UML.Connectable_Elements.UML_Connectable_Element_Access) is abstract;
-- Setter of Lifeline::represents.
--
-- References the ConnectableElement within the classifier that contains
-- the enclosing interaction.
not overriding function Get_Selector
(Self : not null access constant UML_Lifeline)
return AMF.UML.Value_Specifications.UML_Value_Specification_Access is abstract;
-- Getter of Lifeline::selector.
--
-- If the referenced ConnectableElement is multivalued, then this
-- specifies the specific individual part within that set.
not overriding procedure Set_Selector
(Self : not null access UML_Lifeline;
To : AMF.UML.Value_Specifications.UML_Value_Specification_Access) is abstract;
-- Setter of Lifeline::selector.
--
-- If the referenced ConnectableElement is multivalued, then this
-- specifies the specific individual part within that set.
end AMF.UML.Lifelines;
|
-----------------------------------------------------------------------
-- util-streams-buffered -- Buffered streams utilities
-- Copyright (C) 2010, 2011, 2013, 2014, 2016, 2017, 2018, 2019, 2020 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Interfaces;
with Ada.IO_Exceptions;
with Ada.Unchecked_Deallocation;
package body Util.Streams.Buffered is
procedure Free_Buffer is
new Ada.Unchecked_Deallocation (Object => Stream_Element_Array,
Name => Buffer_Access);
-- ------------------------------
-- Initialize the stream to read or write on the given streams.
-- An internal buffer is allocated for writing the stream.
-- ------------------------------
procedure Initialize (Stream : in out Output_Buffer_Stream;
Output : access Output_Stream'Class;
Size : in Positive) is
begin
Free_Buffer (Stream.Buffer);
Stream.Last := Stream_Element_Offset (Size);
Stream.Buffer := new Stream_Element_Array (1 .. Stream.Last);
Stream.Output := Output;
Stream.Write_Pos := 1;
Stream.Read_Pos := 1;
Stream.No_Flush := False;
end Initialize;
-- ------------------------------
-- Initialize the stream to read from the string.
-- ------------------------------
procedure Initialize (Stream : in out Input_Buffer_Stream;
Content : in String) is
begin
Free_Buffer (Stream.Buffer);
Stream.Last := Stream_Element_Offset (Content'Length);
Stream.Buffer := new Stream_Element_Array (1 .. Content'Length);
Stream.Input := null;
Stream.Write_Pos := Stream.Last + 1;
Stream.Read_Pos := 1;
for I in Content'Range loop
Stream.Buffer (Stream_Element_Offset (I - Content'First + 1))
:= Character'Pos (Content (I));
end loop;
end Initialize;
-- ------------------------------
-- Initialize the stream with a buffer of <b>Size</b> bytes.
-- ------------------------------
procedure Initialize (Stream : in out Output_Buffer_Stream;
Size : in Positive) is
begin
Stream.Initialize (Output => null, Size => Size);
Stream.No_Flush := True;
Stream.Read_Pos := 1;
end Initialize;
-- ------------------------------
-- Initialize the stream to read or write on the given streams.
-- An internal buffer is allocated for writing the stream.
-- ------------------------------
procedure Initialize (Stream : in out Input_Buffer_Stream;
Input : access Input_Stream'Class;
Size : in Positive) is
begin
Free_Buffer (Stream.Buffer);
Stream.Last := Stream_Element_Offset (Size);
Stream.Buffer := new Stream_Element_Array (1 .. Stream.Last);
Stream.Input := Input;
Stream.Write_Pos := 1;
Stream.Read_Pos := 1;
end Initialize;
-- ------------------------------
-- Initialize the stream from the buffer created for an output stream.
-- ------------------------------
procedure Initialize (Stream : in out Input_Buffer_Stream;
From : in out Output_Buffer_Stream'Class) is
begin
Free_Buffer (Stream.Buffer);
Stream.Buffer := From.Buffer;
From.Buffer := null;
Stream.Input := null;
Stream.Read_Pos := 1;
Stream.Write_Pos := From.Write_Pos + 1;
Stream.Last := From.Last;
end Initialize;
-- ------------------------------
-- Close the sink.
-- ------------------------------
overriding
procedure Close (Stream : in out Output_Buffer_Stream) is
begin
if Stream.Output /= null then
Output_Buffer_Stream'Class (Stream).Flush;
Stream.Output.Close;
Free_Buffer (Stream.Buffer);
end if;
end Close;
-- ------------------------------
-- Get the direct access to the buffer.
-- ------------------------------
function Get_Buffer (Stream : in Output_Buffer_Stream) return Buffer_Access is
begin
return Stream.Buffer;
end Get_Buffer;
-- ------------------------------
-- Get the number of element in the stream.
-- ------------------------------
function Get_Size (Stream : in Output_Buffer_Stream) return Natural is
begin
return Natural (Stream.Write_Pos - Stream.Read_Pos);
end Get_Size;
-- ------------------------------
-- Write the buffer array to the output stream.
-- ------------------------------
overriding
procedure Write (Stream : in out Output_Buffer_Stream;
Buffer : in Ada.Streams.Stream_Element_Array) is
Start : Stream_Element_Offset := Buffer'First;
Pos : Stream_Element_Offset := Stream.Write_Pos;
Avail : Stream_Element_Offset;
Size : Stream_Element_Offset;
begin
while Start <= Buffer'Last loop
Size := Buffer'Last - Start + 1;
Avail := Stream.Last - Pos + 1;
if Avail = 0 then
if Stream.Output = null then
raise Ada.IO_Exceptions.End_Error with "Buffer is full";
end if;
Stream.Output.Write (Stream.Buffer (1 .. Pos - 1));
Stream.Write_Pos := 1;
Pos := 1;
Avail := Stream.Last - Pos + 1;
end if;
if Avail < Size then
Size := Avail;
end if;
Stream.Buffer (Pos .. Pos + Size - 1) := Buffer (Start .. Start + Size - 1);
Start := Start + Size;
Pos := Pos + Size;
Stream.Write_Pos := Pos;
-- If we have still more data than the buffer size, flush and write
-- the buffer directly.
if Start < Buffer'Last and then Buffer'Last - Start > Stream.Buffer'Length then
if Stream.Output = null then
raise Ada.IO_Exceptions.End_Error with "Buffer is full";
end if;
Stream.Output.Write (Stream.Buffer (1 .. Pos - 1));
Stream.Write_Pos := 1;
Stream.Output.Write (Buffer (Start .. Buffer'Last));
return;
end if;
end loop;
end Write;
-- ------------------------------
-- Flush the stream.
-- ------------------------------
overriding
procedure Flush (Stream : in out Output_Buffer_Stream) is
begin
if not Stream.No_Flush then
if Stream.Write_Pos > 1 then
if Stream.Output /= null then
Stream.Output.Write (Stream.Buffer (1 .. Stream.Write_Pos - 1));
end if;
Stream.Write_Pos := 1;
end if;
if Stream.Output /= null then
Stream.Output.Flush;
end if;
end if;
end Flush;
-- ------------------------------
-- Flush the buffer in the <tt>Into</tt> array and return the index of the
-- last element (inclusive) in <tt>Last</tt>.
-- ------------------------------
procedure Flush (Stream : in out Output_Buffer_Stream;
Into : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset) is
begin
if Stream.Write_Pos > 1 then
Into (Into'First .. Into'First + Stream.Write_Pos - 1) :=
Stream.Buffer (Stream.Buffer'First .. Stream.Write_Pos - 1);
Stream.Write_Pos := 1;
Last := Into'First + Stream.Write_Pos - 1;
else
Last := Into'First - 1;
end if;
end Flush;
-- ------------------------------
-- Flush the buffer stream to the unbounded string.
-- ------------------------------
procedure Flush (Stream : in out Output_Buffer_Stream;
Into : out Ada.Strings.Unbounded.Unbounded_String) is
begin
Ada.Strings.Unbounded.Set_Unbounded_String (Into, "");
if Stream.Write_Pos > 1 then
for I in 1 .. Stream.Write_Pos - 1 loop
Ada.Strings.Unbounded.Append (Into, Character'Val (Stream.Buffer (I)));
end loop;
Stream.Write_Pos := 1;
end if;
end Flush;
-- ------------------------------
-- Fill the buffer by reading the input stream.
-- Raises Data_Error if there is no input stream;
-- ------------------------------
procedure Fill (Stream : in out Input_Buffer_Stream) is
begin
if Stream.Input = null then
Stream.Eof := True;
else
Stream.Input.Read (Stream.Buffer (1 .. Stream.Last - 1), Stream.Write_Pos);
Stream.Eof := Stream.Write_Pos < 1;
if not Stream.Eof then
Stream.Write_Pos := Stream.Write_Pos + 1;
end if;
Stream.Read_Pos := 1;
end if;
end Fill;
-- ------------------------------
-- Read one character from the input stream.
-- ------------------------------
procedure Read (Stream : in out Input_Buffer_Stream;
Char : out Character) is
begin
if Stream.Read_Pos >= Stream.Write_Pos then
Stream.Fill;
if Stream.Eof then
raise Ada.IO_Exceptions.Data_Error with "End of buffer";
end if;
end if;
Char := Character'Val (Stream.Buffer (Stream.Read_Pos));
Stream.Read_Pos := Stream.Read_Pos + 1;
end Read;
procedure Read (Stream : in out Input_Buffer_Stream;
Value : out Ada.Streams.Stream_Element) is
begin
if Stream.Read_Pos >= Stream.Write_Pos then
Stream.Fill;
if Stream.Eof then
raise Ada.IO_Exceptions.Data_Error with "End of buffer";
end if;
end if;
Value := Stream.Buffer (Stream.Read_Pos);
Stream.Read_Pos := Stream.Read_Pos + 1;
end Read;
-- ------------------------------
-- Read one character from the input stream.
-- ------------------------------
procedure Read (Stream : in out Input_Buffer_Stream;
Char : out Wide_Wide_Character) is
use Interfaces;
Val : Ada.Streams.Stream_Element;
Result : Unsigned_32;
begin
Stream.Read (Val);
-- UTF-8 conversion
-- 7 U+0000 U+007F 1 0xxxxxxx
if Val <= 16#7F# then
Char := Wide_Wide_Character'Val (Val);
-- 11 U+0080 U+07FF 2 110xxxxx 10xxxxxx
elsif Val <= 16#DF# then
Result := Shift_Left (Unsigned_32 (Val and 16#1F#), 6);
Stream.Read (Val);
Result := Result or Unsigned_32 (Val and 16#3F#);
Char := Wide_Wide_Character'Val (Result);
-- 16 U+0800 U+FFFF 3 1110xxxx 10xxxxxx 10xxxxxx
elsif Val <= 16#EF# then
Result := Shift_Left (Unsigned_32 (Val and 16#0F#), 12);
Stream.Read (Val);
Result := Result or Shift_Left (Unsigned_32 (Val and 16#3F#), 6);
Stream.Read (Val);
Result := Result or Unsigned_32 (Val and 16#3F#);
Char := Wide_Wide_Character'Val (Result);
-- 21 U+10000 U+1FFFFF 4 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
else
Result := Shift_Left (Unsigned_32 (Val and 16#07#), 18);
Stream.Read (Val);
Result := Result or Shift_Left (Unsigned_32 (Val and 16#3F#), 12);
Stream.Read (Val);
Result := Result or Shift_Left (Unsigned_32 (Val and 16#3F#), 6);
Stream.Read (Val);
Result := Result or Unsigned_32 (Val and 16#3F#);
Char := Wide_Wide_Character'Val (Result);
end if;
end Read;
-- ------------------------------
-- Read into the buffer as many bytes as possible and return in
-- <b>last</b> the position of the last byte read.
-- ------------------------------
overriding
procedure Read (Stream : in out Input_Buffer_Stream;
Into : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset) is
Start : Stream_Element_Offset := Into'First;
Pos : Stream_Element_Offset := Stream.Read_Pos;
Avail : Stream_Element_Offset;
Size : Stream_Element_Offset;
Total : Stream_Element_Offset := 0;
begin
while Start <= Into'Last loop
Size := Into'Last - Start + 1;
Avail := Stream.Write_Pos - Pos;
if Avail = 0 then
Stream.Fill;
Pos := Stream.Read_Pos;
Avail := Stream.Write_Pos - Pos;
exit when Avail <= 0;
end if;
if Avail < Size then
Size := Avail;
end if;
Into (Start .. Start + Size - 1) := Stream.Buffer (Pos .. Pos + Size - 1);
Start := Start + Size;
Pos := Pos + Size;
Total := Total + Size;
Stream.Read_Pos := Pos;
end loop;
Last := Total;
end Read;
-- ------------------------------
-- Read into the buffer as many bytes as possible and return in
-- <b>last</b> the position of the last byte read.
-- ------------------------------
procedure Read (Stream : in out Input_Buffer_Stream;
Into : in out Ada.Strings.Unbounded.Unbounded_String) is
Pos : Stream_Element_Offset := Stream.Read_Pos;
Avail : Stream_Element_Offset;
begin
loop
Avail := Stream.Write_Pos - Pos;
if Avail = 0 then
Stream.Fill;
if Stream.Eof then
return;
end if;
Pos := Stream.Read_Pos;
Avail := Stream.Write_Pos - Pos;
end if;
for I in 1 .. Avail loop
Ada.Strings.Unbounded.Append (Into, Character'Val (Stream.Buffer (Pos)));
Pos := Pos + 1;
end loop;
Stream.Read_Pos := Pos;
end loop;
end Read;
procedure Read (Stream : in out Input_Buffer_Stream;
Into : in out Ada.Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String) is
Pos : Stream_Element_Offset;
Avail : Stream_Element_Offset;
C : Wide_Wide_Character;
begin
loop
Pos := Stream.Read_Pos;
Avail := Stream.Write_Pos - Pos;
if Avail = 0 then
Stream.Fill;
if Stream.Eof then
return;
end if;
Pos := Stream.Read_Pos;
Avail := Stream.Write_Pos - Pos;
end if;
Stream.Read (C);
Ada.Strings.Wide_Wide_Unbounded.Append (Into, C);
end loop;
end Read;
-- ------------------------------
-- Flush the stream and release the buffer.
-- ------------------------------
overriding
procedure Finalize (Stream : in out Output_Buffer_Stream) is
begin
if Stream.Buffer /= null then
if Stream.Output /= null then
Stream.Flush;
end if;
Free_Buffer (Stream.Buffer);
end if;
end Finalize;
-- ------------------------------
-- Returns True if the end of the stream is reached.
-- ------------------------------
function Is_Eof (Stream : in Input_Buffer_Stream) return Boolean is
begin
return Stream.Eof;
end Is_Eof;
-- ------------------------------
-- Flush the stream and release the buffer.
-- ------------------------------
overriding
procedure Finalize (Object : in out Input_Buffer_Stream) is
begin
if Object.Buffer /= null then
Free_Buffer (Object.Buffer);
end if;
end Finalize;
end Util.Streams.Buffered;
|
--------------------------------------------------------------------------------
-- MIT License
--
-- Copyright (c) 2021 Zane Myers
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
--------------------------------------------------------------------------------
with Ada.Text_IO;
with Ada.Characters.Latin_1;
with Vulkan.Test.Framework;
with Vulkan.Math.GenDMatrix;
with Vulkan.Math.Dmat4x3;
with Vulkan.Math.Dmat2x2;
with Vulkan.Math.Dmat2x4;
with Vulkan.Math.GenDType;
with Vulkan.Math.Dvec4;
with Vulkan.Math.Dvec3;
use Ada.Text_IO;
use Ada.Characters.Latin_1;
use Vulkan.Math.Dmat2x2;
use Vulkan.Math.Dmat4x3;
use Vulkan.Math.Dmat2x4;
use Vulkan.Math.GenDType;
use Vulkan.Math.Dvec4;
use Vulkan.Math.Dvec3;
use Vulkan.Test.Framework;
--------------------------------------------------------------------------------
--< @group Vulkan Math Basic Types
--------------------------------------------------------------------------------
--< @summary
--< This package provides tests for single precision floating point mat4x3.
--------------------------------------------------------------------------------
package body Vulkan.Math.Dmat4x3.Test is
-- Test Mat4x3
procedure Test_Dmat4x3 is
vec1 : Vkm_Dvec4 :=
Make_Dvec4(1.0, 2.0, 3.0, 4.0);
vec2 : Vkm_Dvec3 :=
Make_Dvec3(1.0, 2.0, 3.0);
mat1 : Vkm_Dmat4x3 :=
Make_Dmat4x3;
mat2 : Vkm_Dmat4x3 :=
Make_Dmat4x3(0.0, 1.0, 2.0,
3.0, 4.0, 5.0,
6.0, 7.0, 8.0,
9.0, 10.0, 11.0);
mat3 : Vkm_Dmat4x3 :=
Make_Dmat4x3(vec2, - vec2, 2.0 * vec2, -2.0 * vec2);
mat4 : Vkm_Dmat4x3 :=
Make_Dmat4x3(mat2);
mat5 : Vkm_Dmat2x2 :=
Make_Dmat2x2(5.0);
mat6 : Vkm_Dmat4x3 :=
Make_Dmat4x3(mat5);
mat7 : Vkm_Dmat2x4 :=
Make_Dmat2x4( 1.0, -1.0, 0.5, 1.5,
-1.0, 2.0, 1.0, 1.0);
begin
Put_Line(LF & "Testing Mat4x3 Constructors...");
Put_Line("mat1 " & mat1.Image);
Assert_Dmat4x3_Equals(mat1, 0.0, 0.0, 0.0,
0.0, 0.0, 0.0,
0.0, 0.0, 0.0,
0.0, 0.0, 0.0);
Put_Line("mat2 " & mat2.Image);
Assert_Dmat4x3_Equals(mat2, 0.0, 1.0, 2.0,
3.0, 4.0, 5.0,
6.0, 7.0, 8.0,
9.0, 10.0, 11.0);
Put_Line("mat3 " & mat3.Image);
Assert_Dmat4x3_Equals(mat3, 1.0, 2.0, 3.0,
-1.0, -2.0, -3.0,
2.0, 4.0, 6.0,
-2.0, -4.0, -6.0);
Put_Line("mat4 " & mat4.Image);
Assert_Dmat4x3_Equals(mat4, 0.0, 1.0, 2.0,
3.0, 4.0, 5.0,
6.0, 7.0, 8.0,
9.0, 10.0, 11.0);
Put_Line("mat6 " & mat6.Image);
Assert_Dmat4x3_Equals(mat6, 5.0, 0.0, 0.0,
0.0, 5.0, 0.0,
0.0, 0.0, 0.0,
0.0, 0.0, 0.0);
Put_Line("Testing '=' operator...");
Put_Line(" mat2 != mat3");
Assert_Vkm_Bool_Equals(mat2 = mat3, False);
Put_Line(" mat4 != mat5");
Assert_Vkm_Bool_Equals(mat4 = mat5, False);
Put_Line(" mat4 = mat2");
Assert_Vkm_Bool_Equals(mat4 = mat2, True);
Put_Line(" Testing unary '+/-' operator");
Put_Line(" + mat4 = " & Image(+ mat4));
Assert_Dmat4x3_Equals(+mat4, 0.0, 1.0, 2.0,
3.0, 4.0, 5.0,
6.0, 7.0, 8.0,
9.0, 10.0, 11.0);
Put_Line(" - mat4 = " & Image(- mat4));
Assert_Dmat4x3_Equals(-mat4, 0.0, -1.0, -2.0,
-3.0, -4.0, -5.0,
-6.0, -7.0, -8.0,
-9.0, -10.0, -11.0);
Put_Line("+(- mat4) = " & Image(+(- mat4)));
Assert_Dmat4x3_Equals(+(-mat4), 0.0, -1.0, -2.0,
-3.0, -4.0, -5.0,
-6.0, -7.0, -8.0,
-9.0, -10.0, -11.0);
Put_Line("Testing 'abs' operator...");
Put_Line(" abs(- mat4) = " & Image(abs(-mat4)));
Assert_Dmat4x3_Equals(abs(-mat4), 0.0, 1.0, 2.0,
3.0, 4.0, 5.0,
6.0, 7.0, 8.0,
9.0, 10.0, 11.0);
Put_Line("Testing '+' operator...");
Put_Line(" mat4 + mat3 = " & Image(mat4 + mat3));
Assert_Dmat4x3_Equals(mat4 + mat3, 1.0, 3.0, 5.0,
2.0, 2.0, 2.0,
8.0, 11.0, 14.0,
7.0, 6.0, 5.0);
Put_Line("Testing '-' operator...");
Put_Line(" mat4 - mat3 = " & Image(mat4 -mat3));
Assert_Dmat4x3_Equals(mat4 - mat3, -1.0, -1.0, -1.0,
4.0, 6.0, 8.0,
4.0, 3.0, 2.0,
11.0, 14.0, 17.0);
Put_Line("Testing '*' operator...");
Put_Line(" mat7 * mat4 = " & Image(mat7 * mat4));
Assert_Dmat2x3_Equals(mat7 * mat4, 13.5, 15.5, 17.5,
21.0, 24.0, 27.0);
Put_Line(" mat4 * vec2 = " & Image(mat4 * vec2));
Assert_Dvec4_Equals(mat4 * vec2, 8.0, 26.0, 44.0, 62.0);
Put_Line(" vec1 * mat4 = " & Image(vec1 * mat4));
Assert_Dvec3_Equals(vec1 * mat4, 60.0, 70.0, 80.0);
end Test_Dmat4x3;
end Vulkan.Math.Dmat4x3.Test;
|
package body Generic_Unit_Vectors with SPARK_Mode is
function addition(Left, Right : Unit_Vector) return Unit_Vector is
begin
return (Left.x + Right.x, Left.y + Right.y, Left.z + Right.z);
end addition;
end Generic_Unit_Vectors;
|
-- AOC 2020, Day 6
with Ada.Text_IO; use Ada.Text_IO;
with Day; use Day;
procedure main is
anyone : constant Natural := anyone_sum("input.txt");
everyone : constant Natural := everyone_sum("input.txt");
begin
put_line("Part 1: " & Natural'Image(anyone));
put_line("Part 2: " & Natural'Image(everyone));
end main;
|
-----------------------------------------------------------------------
-- keystore-io-files -- Ada keystore IO for files
-- Copyright (C) 2019 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.IO_Exceptions;
with Ada.Unchecked_Deallocation;
with Ada.Directories;
with Interfaces.C.Strings;
with Util.Encoders.AES;
with Util.Log.Loggers;
with Util.Strings;
with Util.Systems.Os;
with Util.Systems.Constants;
-- File header
-- +------------------+
-- | 41 64 61 00 | 4b = Ada
-- | 00 9A 72 57 | 4b = 10/12/1815
-- | 01 9D B1 AC | 4b = 27/11/1852
-- | 00 00 00 01 | 4b = Version 1
-- +------------------+
-- | Keystore UUID | 16b
-- | Storage ID | 4b
-- | Block size | 4b
-- | PAD 0 | 4b
-- | Header HMAC-256 | 32b
-- +------------------+-----
package body Keystore.IO.Files is
use Ada.Strings.Unbounded;
use type Util.Systems.Types.File_Type;
use type Interfaces.C.int;
use Util.Systems.Constants;
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Keystore.IO.Files");
subtype off_t is Util.Systems.Types.off_t;
function Sys_Error return String;
function Get_Default_Data (Path : in String) return String;
procedure Free is
new Ada.Unchecked_Deallocation (Object => File_Stream,
Name => File_Stream_Access);
function Sys_Error return String is
Msg : constant Interfaces.C.Strings.chars_ptr
:= Util.Systems.Os.Strerror (Util.Systems.Os.Errno);
begin
return Interfaces.C.Strings.Value (Msg);
end Sys_Error;
function Hash (Value : Storage_Identifier) return Ada.Containers.Hash_Type is
begin
return Ada.Containers.Hash_Type (Value);
end Hash;
function Get_Default_Data (Path : in String) return String is
Pos : constant Natural := Util.Strings.Rindex (Path, '.');
begin
if Pos > 0 then
return Path (Path'First .. Pos - 1);
else
return Ada.Directories.Containing_Directory (Path);
end if;
end Get_Default_Data;
-- ------------------------------
-- Open the wallet stream.
-- ------------------------------
procedure Open (Stream : in out Wallet_Stream;
Path : in String;
Data_Path : in String) is
begin
if Data_Path'Length > 0 then
Stream.Descriptor.Open (Path, Data_Path, Stream.Sign);
else
Stream.Descriptor.Open (Path, Get_Default_Data (Path), Stream.Sign);
end if;
end Open;
procedure Create (Stream : in out Wallet_Stream;
Path : in String;
Data_Path : in String;
Config : in Wallet_Config) is
begin
if Data_Path'Length > 0 then
Stream.Descriptor.Create (Path, Data_Path, Config, Stream.Sign);
else
Stream.Descriptor.Create (Path, Get_Default_Data (Path), Config, Stream.Sign);
end if;
if Config.Storage_Count > 1 then
Stream.Add_Storage (Config.Storage_Count - 1);
end if;
end Create;
-- ------------------------------
-- Get information about the keystore file.
-- ------------------------------
function Get_Info (Stream : in out Wallet_Stream) return Wallet_Info is
File : File_Stream_Access;
begin
Stream.Descriptor.Get (DEFAULT_STORAGE_ID, File);
return File.Get_Info;
end Get_Info;
-- ------------------------------
-- Read from the wallet stream the block identified by the number and
-- call the `Process` procedure with the data block content.
-- ------------------------------
overriding
procedure Read (Stream : in out Wallet_Stream;
Block : in Storage_Block;
Process : not null access
procedure (Data : in IO_Block_Type)) is
File : File_Stream_Access;
begin
Stream.Descriptor.Get (Block.Storage, File);
File.Read (Block.Block, Process);
end Read;
-- ------------------------------
-- Write in the wallet stream the block identified by the block number.
-- ------------------------------
overriding
procedure Write (Stream : in out Wallet_Stream;
Block : in Storage_Block;
Process : not null access
procedure (Data : out IO_Block_Type)) is
File : File_Stream_Access;
begin
Stream.Descriptor.Get (Block.Storage, File);
File.Write (Block.Block, Process);
end Write;
-- ------------------------------
-- Allocate a new block and return the block number in `Block`.
-- ------------------------------
overriding
procedure Allocate (Stream : in out Wallet_Stream;
Kind : in Block_Kind;
Block : out Storage_Block) is
File : File_Stream_Access;
begin
Stream.Descriptor.Allocate (Kind, Block.Storage, File);
File.Allocate (Block.Block);
end Allocate;
-- ------------------------------
-- Release the block number.
-- ------------------------------
overriding
procedure Release (Stream : in out Wallet_Stream;
Block : in Storage_Block) is
File : File_Stream_Access;
begin
Stream.Descriptor.Get (Block.Storage, File);
File.Release (Block.Block);
end Release;
overriding
function Is_Used (Stream : in out Wallet_Stream;
Block : in Storage_Block) return Boolean is
File : File_Stream_Access;
begin
Stream.Descriptor.Get (Block.Storage, File);
return File.Is_Used (Block.Block);
end Is_Used;
overriding
procedure Set_Header_Data (Stream : in out Wallet_Stream;
Index : in Header_Slot_Index_Type;
Kind : in Header_Slot_Type;
Data : in Ada.Streams.Stream_Element_Array) is
File : File_Stream_Access;
begin
Stream.Descriptor.Get (DEFAULT_STORAGE_ID, File);
File.Set_Header_Data (Index, Kind, Data, Stream.Sign);
end Set_Header_Data;
overriding
procedure Get_Header_Data (Stream : in out Wallet_Stream;
Index : in Header_Slot_Index_Type;
Kind : out Header_Slot_Type;
Data : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset) is
File : File_Stream_Access;
begin
Stream.Descriptor.Get (DEFAULT_STORAGE_ID, File);
File.Get_Header_Data (Index, Kind, Data, Last);
end Get_Header_Data;
-- ------------------------------
-- Add up to Count data storage files associated with the wallet.
-- ------------------------------
procedure Add_Storage (Stream : in out Wallet_Stream;
Count : in Positive) is
begin
Stream.Descriptor.Add_Storage (Count, Stream.Sign);
end Add_Storage;
-- ------------------------------
-- Close the wallet stream and release any resource.
-- ------------------------------
procedure Close (Stream : in out Wallet_Stream) is
begin
Stream.Descriptor.Close;
end Close;
function Get_Block_Offset (Block : in Block_Number) return off_t is
(Util.Systems.Types.off_t (Block) * Block_Size);
protected body File_Stream is
procedure Open (File_Descriptor : in Util.Systems.Types.File_Type;
Storage : in Storage_Identifier;
Sign : in Secret_Key;
File_Size : in Block_Count;
UUID : out UUID_Type) is
begin
File.Initialize (File_Descriptor);
Size := File_Size;
Current_Pos := Block_Size;
Header.Buffer := Buffers.Allocate ((Storage, HEADER_BLOCK_NUM));
declare
Buf : constant Buffers.Buffer_Accessor := Header.Buffer.Data.Value;
Last : Ada.Streams.Stream_Element_Offset;
begin
File.Read (Data, Last);
if Last /= Data'Last then
Log.Warn ("Header block is too short");
raise Invalid_Keystore;
end if;
Buf.Data := Data (Buf.Data'Range);
Keystore.IO.Headers.Sign_Header (Header, Sign);
if Header.HMAC /= Data (BT_HMAC_HEADER_POS .. Data'Last) then
Log.Warn ("Header block HMAC signature is invalid");
raise Invalid_Block;
end if;
Keystore.IO.Headers.Read_Header (Header);
UUID := Header.UUID;
end;
end Open;
procedure Create (File_Descriptor : in Util.Systems.Types.File_Type;
Storage : in Storage_Identifier;
UUID : in UUID_Type;
Sign : in Secret_Key) is
begin
File.Initialize (File_Descriptor);
Size := 1;
Current_Pos := Block_Size;
Header.Buffer := Buffers.Allocate ((Storage, HEADER_BLOCK_NUM));
Header.UUID := UUID;
Keystore.IO.Headers.Build_Header (UUID, Storage, Header);
Keystore.IO.Headers.Sign_Header (Header, Sign);
declare
Buf : constant Buffers.Buffer_Accessor := Header.Buffer.Data.Value;
begin
File.Write (Buf.Data);
File.Write (Header.HMAC);
end;
end Create;
function Get_Info return Wallet_Info is
Result : Wallet_Info;
begin
Result.UUID := Header.UUID;
Result.Header_Count := Header.Data_Count;
Result.Storage_Count := Header.Storage_Count;
return Result;
end Get_Info;
-- Read from the wallet stream the block identified by the number and
-- call the `Process` procedure with the data block content.
procedure Read (Block : in Block_Number;
Process : not null access
procedure (Data : in IO_Block_Type)) is
Pos : constant off_t := Get_Block_Offset (Block);
Last : Ada.Streams.Stream_Element_Offset;
begin
if Pos /= Current_Pos then
File.Seek (Pos => Pos, Mode => Util.Systems.Types.SEEK_SET);
end if;
File.Read (Data, Last);
Process (Data);
Current_Pos := Pos + Block_Size;
end Read;
-- Write in the wallet stream the block identified by the block number.
procedure Write (Block : in Block_Number;
Process : not null access
procedure (Data : out IO_Block_Type)) is
Pos : constant off_t := Get_Block_Offset (Block);
begin
if Pos /= Current_Pos then
File.Seek (Pos => Pos, Mode => Util.Systems.Types.SEEK_SET);
end if;
Process (Data);
File.Write (Data);
Current_Pos := Pos + Block_Size;
end Write;
-- ------------------------------
-- Returns true if the block number is allocated.
-- ------------------------------
function Is_Used (Block : in Block_Number) return Boolean is
begin
return Block <= Size and not Free_Blocks.Contains (Block);
end Is_Used;
-- ------------------------------
-- Allocate a new block and return the block number in `Block`.
-- ------------------------------
procedure Allocate (Block : out Block_Number) is
begin
if not Free_Blocks.Is_Empty then
Block := Free_Blocks.First_Element;
Free_Blocks.Delete_First;
else
Block := Block_Number (Size);
Size := Size + 1;
end if;
end Allocate;
-- ------------------------------
-- Release the block number.
-- ------------------------------
procedure Release (Block : in Block_Number) is
begin
Free_Blocks.Insert (Block);
end Release;
procedure Save_Header (Sign : in Secret_Key) is
Buf : constant Buffers.Buffer_Accessor := Header.Buffer.Data.Value;
begin
Keystore.IO.Headers.Sign_Header (Header, Sign);
File.Seek (Pos => 0, Mode => Util.Systems.Types.SEEK_SET);
File.Write (Buf.Data);
File.Write (Header.HMAC);
Current_Pos := Block_Size;
end Save_Header;
procedure Set_Header_Data (Index : in Header_Slot_Index_Type;
Kind : in Header_Slot_Type;
Data : in Ada.Streams.Stream_Element_Array;
Sign : in Secret_Key) is
begin
IO.Headers.Set_Header_Data (Header, Index, Kind, Data);
Save_Header (Sign);
end Set_Header_Data;
procedure Get_Header_Data (Index : in Header_Slot_Index_Type;
Kind : out Header_Slot_Type;
Data : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset) is
begin
IO.Headers.Get_Header_Data (Header, Index, Kind, Data, Last);
end Get_Header_Data;
procedure Add_Storage (Identifier : in Storage_Identifier;
Sign : in Secret_Key) is
Pos : Block_Index;
begin
IO.Headers.Add_Storage (Header, Identifier, 1, Pos);
Save_Header (Sign);
end Add_Storage;
procedure Scan_Storage (Process : not null
access procedure (Storage : in Wallet_Storage)) is
begin
IO.Headers.Scan_Storage (Header, Process);
end Scan_Storage;
procedure Close is
Last : Block_Number := Size;
Free_Block : Block_Number;
Iter : Block_Number_Sets.Cursor := Free_Blocks.Last;
begin
-- Look at free blocks to see if we can truncate the file when
-- the last blocks are all deleted.
while Block_Number_Sets.Has_Element (Iter) loop
Free_Block := Block_Number_Sets.Element (Iter);
exit when Free_Block /= Last - 1;
Last := Last - 1;
Block_Number_Sets.Previous (Iter);
end loop;
-- We have the last deleted block and we can truncate the file to it inclusive.
if Last /= Size then
declare
Length : constant off_t := Get_Block_Offset (Last);
Result : Integer;
begin
Result := Util.Systems.Os.Sys_Ftruncate (File.Get_File, Length);
if Result /= 0 then
Log.Warn ("Truncate to drop deleted blocks failed: {0}", Sys_Error);
end if;
end;
end if;
File.Close;
end Close;
end File_Stream;
protected body Stream_Descriptor is
function Get_Storage_Path (Storage_Id : in Storage_Identifier) return String is
Prefix : constant String := To_String (UUID);
Index : constant String := Storage_Identifier'Image (Storage_Id);
Name : constant String := Prefix & "-" & Index (Index'First + 1 .. Index'Last);
begin
return Ada.Directories.Compose (To_String (Directory), Name & ".dkt");
end Get_Storage_Path;
procedure Open (Path : in String;
Identifier : in Storage_Identifier;
Sign : in Secret_Key;
Tag : out UUID_Type) is
Fd : Util.Systems.Types.File_Type := Util.Systems.Os.NO_FILE;
P : Interfaces.C.Strings.chars_ptr;
File : File_Stream_Access;
Flags : Interfaces.C.int;
Stat : aliased Util.Systems.Types.Stat_Type;
Size : Block_Count;
Result : Integer;
begin
Flags := O_CLOEXEC + O_RDWR;
P := Interfaces.C.Strings.New_String (Path);
Fd := Util.Systems.Os.Sys_Open (P, Flags, 8#600#);
Interfaces.C.Strings.Free (P);
if Fd = Util.Systems.Os.NO_FILE then
Log.Error ("Cannot open keystore '{0}': {1}", Path, Sys_Error);
raise Ada.IO_Exceptions.Name_Error with Path;
end if;
Result := Util.Systems.Os.Sys_Fstat (Fd, Stat'Access);
if Result /= 0 then
Result := Util.Systems.Os.Sys_Close (Fd);
Log.Error ("Invalid keystore file '{0}': {1}", Path, Sys_Error);
raise Ada.IO_Exceptions.Name_Error with Path;
end if;
if Stat.st_size mod IO.Block_Size /= 0 then
Result := Util.Systems.Os.Sys_Close (Fd);
Log.Error ("Invalid or truncated keystore file '{0}': size is incorrect", Path);
raise Ada.IO_Exceptions.Name_Error with Path;
end if;
Size := Block_Count (Stat.st_size / IO.Block_Size);
File := new File_Stream;
Files.Insert (Identifier, File);
File.Open (Fd, Identifier, Sign, Size, Tag);
end Open;
procedure Open (Path : in String;
Data_Path : in String;
Sign : in Secret_Key) is
procedure Open_Storage (Storage : in Wallet_Storage);
procedure Open_Storage (Storage : in Wallet_Storage) is
Path : constant String := Get_Storage_Path (Storage.Identifier);
Tag : UUID_Type;
begin
Open (Path, Storage.Identifier, Sign, Tag);
if Tag /= UUID then
Log.Error ("Invalid UUID for storage file {0}", Path);
end if;
if Storage.Identifier > Last_Id then
Last_Id := Storage.Identifier;
end if;
Alloc_Id := 1;
end Open_Storage;
File : File_Stream_Access;
begin
if Data_Path'Length > 0 then
Directory := To_Unbounded_String (Data_Path);
else
Directory := To_Unbounded_String (Ada.Directories.Containing_Directory (Path));
end if;
Open (Path, DEFAULT_STORAGE_ID, Sign, UUID);
Get (DEFAULT_STORAGE_ID, File);
Last_Id := DEFAULT_STORAGE_ID;
File.Scan_Storage (Open_Storage'Access);
end Open;
procedure Create (Path : in String;
Data_Path : in String;
Config : in Wallet_Config;
Sign : in Secret_Key) is
Fd : Util.Systems.Types.File_Type := Util.Systems.Os.NO_FILE;
P : Interfaces.C.Strings.chars_ptr;
File : File_Stream_Access;
Flags : Interfaces.C.int;
Result : Integer with Unreferenced => True;
begin
Directory := To_Unbounded_String (Data_Path);
Flags := O_CREAT + O_TRUNC + O_CLOEXEC + O_RDWR;
if not Config.Overwrite then
Flags := Flags + O_EXCL;
end if;
P := Interfaces.C.Strings.New_String (Path);
Fd := Util.Systems.Os.Sys_Open (P, Flags, 8#600#);
Interfaces.C.Strings.Free (P);
if Fd = Util.Systems.Os.NO_FILE then
Log.Error ("Cannot create keystore '{0}': {1}", Path, Sys_Error);
raise Ada.IO_Exceptions.Name_Error with Path;
end if;
File := new File_Stream;
Random.Generate (UUID);
File.Create (Fd, DEFAULT_STORAGE_ID, UUID, Sign);
Files.Insert (DEFAULT_STORAGE_ID, File);
Last_Id := DEFAULT_STORAGE_ID;
end Create;
procedure Create_Storage (Storage_Id : in Storage_Identifier;
Sign : in Secret_Key) is
Path : constant String := Get_Storage_Path (Storage_Id);
Fd : Util.Systems.Types.File_Type := Util.Systems.Os.NO_FILE;
P : Interfaces.C.Strings.chars_ptr;
File : File_Stream_Access;
Flags : Interfaces.C.int;
Result : Integer with Unreferenced => True;
begin
Flags := O_CREAT + O_TRUNC + O_CLOEXEC + O_RDWR;
P := Interfaces.C.Strings.New_String (Path);
Fd := Util.Systems.Os.Sys_Open (P, Flags, 8#600#);
Interfaces.C.Strings.Free (P);
if Fd = Util.Systems.Os.NO_FILE then
Log.Error ("Cannot create keystore storage '{0}': {1}", Path, Sys_Error);
raise Ada.IO_Exceptions.Name_Error with Path;
end if;
File := new File_Stream;
File.Create (Fd, Storage_Id, UUID, Sign);
Files.Insert (Storage_Id, File);
end Create_Storage;
procedure Add_Storage (Count : in Positive;
Sign : in Secret_Key) is
File : File_Stream_Access;
Dir : constant String := To_String (Directory);
begin
Get (DEFAULT_STORAGE_ID, File);
if not Ada.Directories.Exists (Dir) then
Ada.Directories.Create_Path (Dir);
end if;
for I in 1 .. Count loop
Last_Id := Last_Id + 1;
Create_Storage (Last_Id, Sign);
File.Add_Storage (Last_Id, Sign);
end loop;
if Alloc_Id = DEFAULT_STORAGE_ID then
Alloc_Id := 1;
end if;
end Add_Storage;
procedure Get (Storage : in Storage_Identifier;
File : out File_Stream_Access) is
Pos : constant File_Stream_Maps.Cursor := Files.Find (Storage);
begin
if not File_Stream_Maps.Has_Element (Pos) then
Log.Error ("Storage{0} not found", Storage_Identifier'Image (Storage));
raise Keystore.Invalid_Storage;
end if;
File := File_Stream_Maps.Element (Pos);
end Get;
procedure Allocate (Kind : in Block_Kind;
Storage : out Storage_Identifier;
File : out File_Stream_Access) is
begin
if Kind = IO.MASTER_BLOCK or Kind = IO.DIRECTORY_BLOCK
or Last_Id = DEFAULT_STORAGE_ID
then
Storage := DEFAULT_STORAGE_ID;
else
Storage := Alloc_Id;
Alloc_Id := Alloc_Id + 1;
if Alloc_Id > Last_Id then
Alloc_Id := 1;
end if;
end if;
Get (Storage, File);
end Allocate;
procedure Close is
First : File_Stream_Maps.Cursor;
File : File_Stream_Access;
begin
while not File_Stream_Maps.Is_Empty (Files) loop
First := Files.First;
File := File_Stream_Maps.Element (First);
Files.Delete (First);
File.Close;
Free (File);
end loop;
end Close;
end Stream_Descriptor;
end Keystore.IO.Files;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ P R A G --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This unit contains the semantic processing for all pragmas, both language
-- and implementation defined. For most pragmas, the parser only does the
-- most basic job of checking the syntax, so Sem_Prag also contains the code
-- to complete the syntax checks. Certain pragmas are handled partially or
-- completely by the parser (see Par.Prag for further details).
with Atree; use Atree;
with Casing; use Casing;
with Csets; use Csets;
with Debug; use Debug;
with Einfo; use Einfo;
with Elists; use Elists;
with Errout; use Errout;
with Expander; use Expander;
with Exp_Dist; use Exp_Dist;
with Fname; use Fname;
with Hostparm; use Hostparm;
with Lib; use Lib;
with Namet; use Namet;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Output; use Output;
with Restrict; use Restrict;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Ch8; use Sem_Ch8;
with Sem_Ch13; use Sem_Ch13;
with Sem_Disp; use Sem_Disp;
with Sem_Elim; use Sem_Elim;
with Sem_Eval; use Sem_Eval;
with Sem_Intr; use Sem_Intr;
with Sem_Mech; use Sem_Mech;
with Sem_Res; use Sem_Res;
with Sem_Type; use Sem_Type;
with Sem_Util; use Sem_Util;
with Sem_VFpt; use Sem_VFpt;
with Stand; use Stand;
with Sinfo; use Sinfo;
with Sinfo.CN; use Sinfo.CN;
with Sinput; use Sinput;
with Snames; use Snames;
with Stringt; use Stringt;
with Stylesw; use Stylesw;
with Targparm; use Targparm;
with Tbuild; use Tbuild;
with Ttypes;
with Uintp; use Uintp;
with Urealp; use Urealp;
with Validsw; use Validsw;
package body Sem_Prag is
----------------------------------------------
-- Common Handling of Import-Export Pragmas --
----------------------------------------------
-- In the following section, a number of Import_xxx and Export_xxx
-- pragmas are defined by GNAT. These are compatible with the DEC
-- pragmas of the same name, and all have the following common
-- form and processing:
-- pragma Export_xxx
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL]
-- [, other optional parameters ]);
-- pragma Import_xxx
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL]
-- [, other optional parameters ]);
-- EXTERNAL_SYMBOL ::=
-- IDENTIFIER
-- | static_string_EXPRESSION
-- The internal LOCAL_NAME designates the entity that is imported or
-- exported, and must refer to an entity in the current declarative
-- part (as required by the rules for LOCAL_NAME).
-- The external linker name is designated by the External parameter
-- if given, or the Internal parameter if not (if there is no External
-- parameter, the External parameter is a copy of the Internal name).
-- If the External parameter is given as a string, then this string
-- is treated as an external name (exactly as though it had been given
-- as an External_Name parameter for a normal Import pragma).
-- If the External parameter is given as an identifier (or there is no
-- External parameter, so that the Internal identifier is used), then
-- the external name is the characters of the identifier, translated
-- to all upper case letters for OpenVMS versions of GNAT, and to all
-- lower case letters for all other versions
-- Note: the external name specified or implied by any of these special
-- Import_xxx or Export_xxx pragmas override an external or link name
-- specified in a previous Import or Export pragma.
-- Note: these and all other DEC-compatible GNAT pragmas allow full
-- use of named notation, following the standard rules for subprogram
-- calls, i.e. parameters can be given in any order if named notation
-- is used, and positional and named notation can be mixed, subject to
-- the rule that all positional parameters must appear first.
-- Note: All these pragmas are implemented exactly following the DEC
-- design and implementation and are intended to be fully compatible
-- with the use of these pragmas in the DEC Ada compiler.
-------------------------------------
-- Local Subprograms and Variables --
-------------------------------------
function Adjust_External_Name_Case (N : Node_Id) return Node_Id;
-- This routine is used for possible casing adjustment of an explicit
-- external name supplied as a string literal (the node N), according
-- to the casing requirement of Opt.External_Name_Casing. If this is
-- set to As_Is, then the string literal is returned unchanged, but if
-- it is set to Uppercase or Lowercase, then a new string literal with
-- appropriate casing is constructed.
function Is_Generic_Subprogram (Id : Entity_Id) return Boolean;
-- Return True if Id is a generic procedure or a function
function Get_Base_Subprogram (Def_Id : Entity_Id) return Entity_Id;
-- If Def_Id refers to a renamed subprogram, then the base subprogram
-- (the original one, following the renaming chain) is returned.
-- Otherwise the entity is returned unchanged. Should be in Einfo???
procedure Set_Unit_Name (N : Node_Id; With_Item : Node_Id);
-- Place semantic information on the argument of an Elaborate or
-- Elaborate_All pragma. Entity name for unit and its parents is
-- taken from item in previous with_clause that mentions the unit.
Locking_Policy_Sloc : Source_Ptr := No_Location;
Queuing_Policy_Sloc : Source_Ptr := No_Location;
Task_Dispatching_Policy_Sloc : Source_Ptr := No_Location;
-- These global variables remember the location of a previous locking,
-- queuing or task dispatching policy pragma, so that appropriate error
-- messages can be generated for inconsistent pragmas. Note that it is
-- fine that these are global locations, because the check for consistency
-- is over the entire program.
-------------------------------
-- Adjust_External_Name_Case --
-------------------------------
function Adjust_External_Name_Case (N : Node_Id) return Node_Id is
CC : Char_Code;
begin
-- Adjust case of literal if required
if Opt.External_Name_Exp_Casing = As_Is then
return N;
else
-- Copy existing string
Start_String;
-- Set proper casing
for J in 1 .. String_Length (Strval (N)) loop
CC := Get_String_Char (Strval (N), J);
if Opt.External_Name_Exp_Casing = Uppercase
and then CC >= Get_Char_Code ('a')
and then CC <= Get_Char_Code ('z')
then
Store_String_Char (CC - 32);
elsif Opt.External_Name_Exp_Casing = Lowercase
and then CC >= Get_Char_Code ('A')
and then CC <= Get_Char_Code ('Z')
then
Store_String_Char (CC + 32);
else
Store_String_Char (CC);
end if;
end loop;
return
Make_String_Literal (Sloc (N),
Strval => End_String);
end if;
end Adjust_External_Name_Case;
--------------------
-- Analyze_Pragma --
--------------------
procedure Analyze_Pragma (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Prag_Id : Pragma_Id;
Pragma_Exit : exception;
-- This exception is used to exit pragma processing completely. It
-- is used when an error is detected, and in other situations where
-- it is known that no further processing is required.
Arg_Count : Nat;
-- Number of pragma argument associations
Arg1 : Node_Id;
Arg2 : Node_Id;
Arg3 : Node_Id;
Arg4 : Node_Id;
-- First four pragma arguments (pragma argument association nodes,
-- or Empty if the corresponding argument does not exist).
procedure Check_Ada_83_Warning;
-- Issues a warning message for the current pragma if operating in Ada
-- 83 mode (used for language pragmas that are not a standard part of
-- Ada 83). This procedure does not raise Error_Pragma. Also notes use
-- of 95 pragma.
procedure Check_Arg_Count (Required : Nat);
-- Check argument count for pragma is equal to given parameter.
-- If not, then issue an error message and raise Pragma_Exit.
-- Note: all routines whose name is Check_Arg_Is_xxx take an
-- argument Arg which can either be a pragma argument association,
-- in which case the check is applied to the expression of the
-- association or an expression directly.
procedure Check_Arg_Is_Identifier (Arg : Node_Id);
-- Check the specified argument Arg to make sure that it is an
-- identifier. If not give error and raise Pragma_Exit.
procedure Check_Arg_Is_Integer_Literal (Arg : Node_Id);
-- Check the specified argument Arg to make sure that it is an
-- integer literal. If not give error and raise Pragma_Exit.
procedure Check_Arg_Is_Library_Level_Local_Name (Arg : Node_Id);
-- Check the specified argument Arg to make sure that it has the
-- proper syntactic form for a local name and meets the semantic
-- requirements for a local name. The local name is analyzed as
-- part of the processing for this call. In addition, the local
-- name is required to represent an entity at the library level.
procedure Check_Arg_Is_Local_Name (Arg : Node_Id);
-- Check the specified argument Arg to make sure that it has the
-- proper syntactic form for a local name and meets the semantic
-- requirements for a local name. The local name is analyzed as
-- part of the processing for this call.
procedure Check_Arg_Is_Locking_Policy (Arg : Node_Id);
-- Check the specified argument Arg to make sure that it is a valid
-- locking policy name. If not give error and raise Pragma_Exit.
procedure Check_Arg_Is_One_Of (Arg : Node_Id; N1, N2 : Name_Id);
procedure Check_Arg_Is_One_Of (Arg : Node_Id; N1, N2, N3 : Name_Id);
-- Check the specified argument Arg to make sure that it is an
-- identifier whose name matches either N1 or N2 (or N3 if present).
-- If not then give error and raise Pragma_Exit.
procedure Check_Arg_Is_Queuing_Policy (Arg : Node_Id);
-- Check the specified argument Arg to make sure that it is a valid
-- queuing policy name. If not give error and raise Pragma_Exit.
procedure Check_Arg_Is_Static_Expression
(Arg : Node_Id;
Typ : Entity_Id);
-- Check the specified argument Arg to make sure that it is a static
-- expression of the given type (i.e. it will be analyzed and resolved
-- using this type, which can be any valid argument to Resolve, e.g.
-- Any_Integer is OK). If not, given error and raise Pragma_Exit.
procedure Check_Arg_Is_String_Literal (Arg : Node_Id);
-- Check the specified argument Arg to make sure that it is a
-- string literal. If not give error and raise Pragma_Exit
procedure Check_Arg_Is_Task_Dispatching_Policy (Arg : Node_Id);
-- Check the specified argument Arg to make sure that it is a valid
-- valid task dispatching policy name. If not give error and raise
-- Pragma_Exit.
procedure Check_At_Least_N_Arguments (N : Nat);
-- Check there are at least N arguments present
procedure Check_At_Most_N_Arguments (N : Nat);
-- Check there are no more than N arguments present
procedure Check_First_Subtype (Arg : Node_Id);
-- Checks that Arg, whose expression is an entity name referencing
-- a subtype, does not reference a type that is not a first subtype.
procedure Check_In_Main_Program;
-- Common checks for pragmas that appear within a main program
-- (Priority, Main_Storage, Time_Slice).
procedure Check_Interrupt_Or_Attach_Handler;
-- Common processing for first argument of pragma Interrupt_Handler
-- or pragma Attach_Handler.
procedure Check_Is_In_Decl_Part_Or_Package_Spec;
-- Check that pragma appears in a declarative part, or in a package
-- specification, i.e. that it does not occur in a statement sequence
-- in a body.
procedure Check_No_Identifier (Arg : Node_Id);
-- Checks that the given argument does not have an identifier. If
-- an identifier is present, then an error message is issued, and
-- Pragma_Exit is raised.
procedure Check_No_Identifiers;
-- Checks that none of the arguments to the pragma has an identifier.
-- If any argument has an identifier, then an error message is issued,
-- and Pragma_Exit is raised.
procedure Check_Non_Overloaded_Function (Arg : Node_Id);
-- Check that the given argument is the name of a local function of
-- one argument that is not overloaded in the current local scope.
procedure Check_Optional_Identifier (Arg : Node_Id; Id : Name_Id);
-- Checks if the given argument has an identifier, and if so, requires
-- it to match the given identifier name. If there is a non-matching
-- identifier, then an error message is given and Error_Pragmas raised.
procedure Check_Optional_Identifier (Arg : Node_Id; Id : String);
-- Checks if the given argument has an identifier, and if so, requires
-- it to match the given identifier name. If there is a non-matching
-- identifier, then an error message is given and Error_Pragmas raised.
-- In this version of the procedure, the identifier name is given as
-- a string with lower case letters.
procedure Check_Static_Constraint (Constr : Node_Id);
-- Constr is a constraint from an N_Subtype_Indication node from a
-- component constraint in an Unchecked_Union type. This routine checks
-- that the constraint is static as required by the restrictions for
-- Unchecked_Union.
procedure Check_Valid_Configuration_Pragma;
-- Legality checks for placement of a configuration pragma
procedure Check_Valid_Library_Unit_Pragma;
-- Legality checks for library unit pragmas. A special case arises for
-- pragmas in generic instances that come from copies of the original
-- library unit pragmas in the generic templates. In the case of other
-- than library level instantiations these can appear in contexts which
-- would normally be invalid (they only apply to the original template
-- and to library level instantiations), and they are simply ignored,
-- which is implemented by rewriting them as null statements.
procedure Error_Pragma (Msg : String);
pragma No_Return (Error_Pragma);
-- Outputs error message for current pragma. The message contains an %
-- that will be replaced with the pragma name, and the flag is placed
-- on the pragma itself. Pragma_Exit is then raised.
procedure Error_Pragma_Arg (Msg : String; Arg : Node_Id);
pragma No_Return (Error_Pragma_Arg);
-- Outputs error message for current pragma. The message may contain
-- a % that will be replaced with the pragma name. The parameter Arg
-- may either be a pragma argument association, in which case the flag
-- is placed on the expression of this association, or an expression,
-- in which case the flag is placed directly on the expression. The
-- message is placed using Error_Msg_N, so the message may also contain
-- an & insertion character which will reference the given Arg value.
-- After placing the message, Pragma_Exit is raised.
procedure Error_Pragma_Arg (Msg1, Msg2 : String; Arg : Node_Id);
pragma No_Return (Error_Pragma_Arg);
-- Similar to above form of Error_Pragma_Arg except that two messages
-- are provided, the second is a continuation comment starting with \.
procedure Error_Pragma_Arg_Ident (Msg : String; Arg : Node_Id);
pragma No_Return (Error_Pragma_Arg_Ident);
-- Outputs error message for current pragma. The message may contain
-- a % that will be replaced with the pragma name. The parameter Arg
-- must be a pragma argument association with a non-empty identifier
-- (i.e. its Chars field must be set), and the error message is placed
-- on the identifier. The message is placed using Error_Msg_N so
-- the message may also contain an & insertion character which will
-- reference the identifier. After placing the message, Pragma_Exit
-- is raised.
function Find_Lib_Unit_Name return Entity_Id;
-- Used for a library unit pragma to find the entity to which the
-- library unit pragma applies, returns the entity found.
procedure Find_Program_Unit_Name (Id : Node_Id);
-- If the pragma is a compilation unit pragma, the id must denote the
-- compilation unit in the same compilation, and the pragma must appear
-- in the list of preceding or trailing pragmas. If it is a program
-- unit pragma that is not a compilation unit pragma, then the
-- identifier must be visible.
type Name_List is array (Natural range <>) of Name_Id;
type Args_List is array (Natural range <>) of Node_Id;
procedure Gather_Associations
(Names : Name_List;
Args : out Args_List);
-- This procedure is used to gather the arguments for a pragma that
-- permits arbitrary ordering of parameters using the normal rules
-- for named and positional parameters. The Names argument is a list
-- of Name_Id values that corresponds to the allowed pragma argument
-- association identifiers in order. The result returned in Args is
-- a list of corresponding expressions that are the pragma arguments.
-- Note that this is a list of expressions, not of pragma argument
-- associations (Gather_Associations has completely checked all the
-- optional identifiers when it returns). An entry in Args is Empty
-- on return if the corresponding argument is not present.
function Get_Pragma_Arg (Arg : Node_Id) return Node_Id;
-- All the routines that check pragma arguments take either a pragma
-- argument association (in which case the expression of the argument
-- association is checked), or the expression directly. The function
-- Get_Pragma_Arg is a utility used to deal with these two cases. If
-- Arg is a pragma argument association node, then its expression is
-- returned, otherwise Arg is returned unchanged.
procedure GNAT_Pragma;
-- Called for all GNAT defined pragmas to note the use of the feature,
-- and also check the relevant restriction (No_Implementation_Pragmas).
function Is_Before_First_Decl
(Pragma_Node : Node_Id;
Decls : List_Id)
return Boolean;
-- Return True if Pragma_Node is before the first declarative item in
-- Decls where Decls is the list of declarative items.
function Is_Configuration_Pragma return Boolean;
-- Deterermines if the placement of the current pragma is appropriate
-- for a configuration pragma (precedes the current compilation unit)
procedure Pragma_Misplaced;
-- Issue fatal error message for misplaced pragma
procedure Process_Atomic_Shared_Volatile;
-- Common processing for pragmas Atomic, Shared, Volatile. Note that
-- Shared is an obsolete Ada 83 pragma, treated as being identical
-- in effect to pragma Atomic.
procedure Process_Convention (C : out Convention_Id; E : out Entity_Id);
-- Common procesing for Convention, Interface, Import and Export.
-- Checks first two arguments of pragma, and sets the appropriate
-- convention value in the specified entity or entities. On return
-- C is the convention, E is the referenced entity.
procedure Process_Extended_Import_Export_Exception_Pragma
(Arg_Internal : Node_Id;
Arg_External : Node_Id;
Arg_Form : Node_Id;
Arg_Code : Node_Id);
-- Common processing for the pragmas Import/Export_Exception.
-- The three arguments correspond to the three named parameters of
-- the pragma. An argument is empty if the corresponding parameter
-- is not present in the pragma.
procedure Process_Extended_Import_Export_Object_Pragma
(Arg_Internal : Node_Id;
Arg_External : Node_Id;
Arg_Size : Node_Id);
-- Common processing for the pragmass Import/Export_Object.
-- The three arguments correspond to the three named parameters
-- of the pragmas. An argument is empty if the corresponding
-- parameter is not present in the pragma.
procedure Process_Extended_Import_Export_Internal_Arg
(Arg_Internal : Node_Id := Empty);
-- Common processing for all extended Import and Export pragmas. The
-- argument is the pragma parameter for the Internal argument. If
-- Arg_Internal is empty or inappropriate, an error message is posted.
-- Otherwise, on normal return, the Entity_Field of Arg_Internal is
-- set to identify the referenced entity.
procedure Process_Extended_Import_Export_Subprogram_Pragma
(Arg_Internal : Node_Id;
Arg_External : Node_Id;
Arg_Parameter_Types : Node_Id;
Arg_Result_Type : Node_Id := Empty;
Arg_Mechanism : Node_Id;
Arg_Result_Mechanism : Node_Id := Empty;
Arg_First_Optional_Parameter : Node_Id := Empty);
-- Common processing for all extended Import and Export pragmas
-- applying to subprograms. The caller omits any arguments that do
-- bnot apply to the pragma in question (for example, Arg_Result_Type
-- can be non-Empty only in the Import_Function and Export_Function
-- cases). The argument names correspond to the allowed pragma
-- association identifiers.
procedure Process_Generic_List;
-- Common processing for Share_Generic and Inline_Generic
procedure Process_Import_Or_Interface;
-- Common processing for Import of Interface
procedure Process_Inline (Active : Boolean);
-- Common processing for Inline and Inline_Always. The parameter
-- indicates if the inline pragma is active, i.e. if it should
-- actually cause inlining to occur.
procedure Process_Interface_Name
(Subprogram_Def : Entity_Id;
Ext_Arg : Node_Id;
Link_Arg : Node_Id);
-- Given the last two arguments of pragma Import, pragma Export, or
-- pragma Interface_Name, performs validity checks and sets the
-- Interface_Name field of the given subprogram entity to the
-- appropriate external or link name, depending on the arguments
-- given. Ext_Arg is always present, but Link_Arg may be missing.
-- Note that Ext_Arg may represent the Link_Name if Link_Arg is
-- missing, and appropriate named notation is used for Ext_Arg.
-- If neither Ext_Arg nor Link_Arg is present, the interface name
-- is set to the default from the subprogram name.
procedure Process_Interrupt_Or_Attach_Handler;
-- Attach the pragmas to the rep item chain.
procedure Process_Suppress_Unsuppress (Suppress_Case : Boolean);
-- Common processing for Suppress and Unsuppress. The boolean parameter
-- Suppress_Case is True for the Suppress case, and False for the
-- Unsuppress case.
procedure Set_Exported (E : Entity_Id; Arg : Node_Id);
-- This procedure sets the Is_Exported flag for the given entity,
-- checking that the entity was not previously imported. Arg is
-- the argument that specified the entity.
procedure Set_Extended_Import_Export_External_Name
(Internal_Ent : Entity_Id;
Arg_External : Node_Id);
-- Common processing for all extended import export pragmas. The first
-- argument, Internal_Ent, is the internal entity, which has already
-- been checked for validity by the caller. Arg_External is from the
-- Import or Export pragma, and may be null if no External parameter
-- was present. If Arg_External is present and is a non-null string
-- (a null string is treated as the default), then the Interface_Name
-- field of Internal_Ent is set appropriately.
procedure Set_Imported (E : Entity_Id);
-- This procedure sets the Is_Imported flag for the given entity,
-- checking that it is not previously exported or imported.
procedure Set_Mechanism_Value (Ent : Entity_Id; Mech_Name : Node_Id);
-- Mech is a parameter passing mechanism (see Import_Function syntax
-- for MECHANISM_NAME). This routine checks that the mechanism argument
-- has the right form, and if not issues an error message. If the
-- argument has the right form then the Mechanism field of Ent is
-- set appropriately.
--------------------------
-- Check_Ada_83_Warning --
--------------------------
procedure Check_Ada_83_Warning is
begin
GNAT_Pragma;
if Ada_83 and then Comes_From_Source (N) then
Error_Msg_N ("(Ada 83) pragma& is non-standard?", N);
end if;
end Check_Ada_83_Warning;
---------------------
-- Check_Arg_Count --
---------------------
procedure Check_Arg_Count (Required : Nat) is
begin
if Arg_Count /= Required then
Error_Pragma ("wrong number of arguments for pragma%");
end if;
end Check_Arg_Count;
-----------------------------
-- Check_Arg_Is_Identifier --
-----------------------------
procedure Check_Arg_Is_Identifier (Arg : Node_Id) is
Argx : constant Node_Id := Get_Pragma_Arg (Arg);
begin
if Nkind (Argx) /= N_Identifier then
Error_Pragma_Arg
("argument for pragma% must be identifier", Argx);
end if;
end Check_Arg_Is_Identifier;
----------------------------------
-- Check_Arg_Is_Integer_Literal --
----------------------------------
procedure Check_Arg_Is_Integer_Literal (Arg : Node_Id) is
Argx : constant Node_Id := Get_Pragma_Arg (Arg);
begin
if Nkind (Argx) /= N_Integer_Literal then
Error_Pragma_Arg
("argument for pragma% must be integer literal", Argx);
end if;
end Check_Arg_Is_Integer_Literal;
-------------------------------------------
-- Check_Arg_Is_Library_Level_Local_Name --
-------------------------------------------
-- LOCAL_NAME ::=
-- DIRECT_NAME
-- | DIRECT_NAME'ATTRIBUTE_DESIGNATOR
-- | library_unit_NAME
procedure Check_Arg_Is_Library_Level_Local_Name (Arg : Node_Id) is
begin
Check_Arg_Is_Local_Name (Arg);
if not Is_Library_Level_Entity (Entity (Expression (Arg)))
and then Comes_From_Source (N)
then
Error_Pragma_Arg
("argument for pragma% must be library level entity", Arg);
end if;
end Check_Arg_Is_Library_Level_Local_Name;
-----------------------------
-- Check_Arg_Is_Local_Name --
-----------------------------
-- LOCAL_NAME ::=
-- DIRECT_NAME
-- | DIRECT_NAME'ATTRIBUTE_DESIGNATOR
-- | library_unit_NAME
procedure Check_Arg_Is_Local_Name (Arg : Node_Id) is
Argx : constant Node_Id := Get_Pragma_Arg (Arg);
begin
Analyze (Argx);
if Nkind (Argx) not in N_Direct_Name
and then (Nkind (Argx) /= N_Attribute_Reference
or else Present (Expressions (Argx))
or else Nkind (Prefix (Argx)) /= N_Identifier)
and then (not Is_Entity_Name (Argx)
or else not Is_Compilation_Unit (Entity (Argx)))
then
Error_Pragma_Arg ("argument for pragma% must be local name", Argx);
end if;
if Is_Entity_Name (Argx)
and then Scope (Entity (Argx)) /= Current_Scope
then
Error_Pragma_Arg
("pragma% argument must be in same declarative part", Arg);
end if;
end Check_Arg_Is_Local_Name;
---------------------------------
-- Check_Arg_Is_Locking_Policy --
---------------------------------
procedure Check_Arg_Is_Locking_Policy (Arg : Node_Id) is
Argx : constant Node_Id := Get_Pragma_Arg (Arg);
begin
Check_Arg_Is_Identifier (Argx);
if not Is_Locking_Policy_Name (Chars (Argx)) then
Error_Pragma_Arg
("& is not a valid locking policy name", Argx);
end if;
end Check_Arg_Is_Locking_Policy;
-------------------------
-- Check_Arg_Is_One_Of --
-------------------------
procedure Check_Arg_Is_One_Of (Arg : Node_Id; N1, N2 : Name_Id) is
Argx : constant Node_Id := Get_Pragma_Arg (Arg);
begin
Check_Arg_Is_Identifier (Argx);
if Chars (Argx) /= N1 and then Chars (Argx) /= N2 then
Error_Msg_Name_2 := N1;
Error_Msg_Name_3 := N2;
Error_Pragma_Arg ("argument for pragma% must be% or%", Argx);
end if;
end Check_Arg_Is_One_Of;
procedure Check_Arg_Is_One_Of
(Arg : Node_Id;
N1, N2, N3 : Name_Id)
is
Argx : constant Node_Id := Get_Pragma_Arg (Arg);
begin
Check_Arg_Is_Identifier (Argx);
if Chars (Argx) /= N1
and then Chars (Argx) /= N2
and then Chars (Argx) /= N3
then
Error_Pragma_Arg ("invalid argument for pragma%", Argx);
end if;
end Check_Arg_Is_One_Of;
---------------------------------
-- Check_Arg_Is_Queuing_Policy --
---------------------------------
procedure Check_Arg_Is_Queuing_Policy (Arg : Node_Id) is
Argx : constant Node_Id := Get_Pragma_Arg (Arg);
begin
Check_Arg_Is_Identifier (Argx);
if not Is_Queuing_Policy_Name (Chars (Argx)) then
Error_Pragma_Arg
("& is not a valid queuing policy name", Argx);
end if;
end Check_Arg_Is_Queuing_Policy;
------------------------------------
-- Check_Arg_Is_Static_Expression --
------------------------------------
procedure Check_Arg_Is_Static_Expression
(Arg : Node_Id;
Typ : Entity_Id)
is
Argx : constant Node_Id := Get_Pragma_Arg (Arg);
begin
Analyze_And_Resolve (Argx, Typ);
if Is_OK_Static_Expression (Argx) then
return;
elsif Etype (Argx) = Any_Type then
raise Pragma_Exit;
-- An interesting special case, if we have a string literal and
-- we are in Ada 83 mode, then we allow it even though it will
-- not be flagged as static. This allows the use of Ada 95
-- pragmas like Import in Ada 83 mode. They will of course be
-- flagged with warnings as usual, but will not cause errors.
elsif Ada_83 and then Nkind (Argx) = N_String_Literal then
return;
-- Static expression that raises Constraint_Error. This has
-- already been flagged, so just exit from pragma processing.
elsif Is_Static_Expression (Argx) then
raise Pragma_Exit;
-- Finally, we have a real error
else
Error_Pragma_Arg
("argument for pragma% must be a static expression", Argx);
end if;
end Check_Arg_Is_Static_Expression;
---------------------------------
-- Check_Arg_Is_String_Literal --
---------------------------------
procedure Check_Arg_Is_String_Literal (Arg : Node_Id) is
Argx : constant Node_Id := Get_Pragma_Arg (Arg);
begin
if Nkind (Argx) /= N_String_Literal then
Error_Pragma_Arg
("argument for pragma% must be string literal", Argx);
end if;
end Check_Arg_Is_String_Literal;
------------------------------------------
-- Check_Arg_Is_Task_Dispatching_Policy --
------------------------------------------
procedure Check_Arg_Is_Task_Dispatching_Policy (Arg : Node_Id) is
Argx : constant Node_Id := Get_Pragma_Arg (Arg);
begin
Check_Arg_Is_Identifier (Argx);
if not Is_Task_Dispatching_Policy_Name (Chars (Argx)) then
Error_Pragma_Arg
("& is not a valid task dispatching policy name", Argx);
end if;
end Check_Arg_Is_Task_Dispatching_Policy;
--------------------------------
-- Check_At_Least_N_Arguments --
--------------------------------
procedure Check_At_Least_N_Arguments (N : Nat) is
begin
if Arg_Count < N then
Error_Pragma ("too few arguments for pragma%");
end if;
end Check_At_Least_N_Arguments;
-------------------------------
-- Check_At_Most_N_Arguments --
-------------------------------
procedure Check_At_Most_N_Arguments (N : Nat) is
Arg : Node_Id;
begin
if Arg_Count > N then
Arg := Arg1;
for J in 1 .. N loop
Next (Arg);
Error_Pragma_Arg ("too many arguments for pragma%", Arg);
end loop;
end if;
end Check_At_Most_N_Arguments;
-------------------------
-- Check_First_Subtype --
-------------------------
procedure Check_First_Subtype (Arg : Node_Id) is
Argx : constant Node_Id := Get_Pragma_Arg (Arg);
begin
if not Is_First_Subtype (Entity (Argx)) then
Error_Pragma_Arg
("pragma% cannot apply to subtype", Argx);
end if;
end Check_First_Subtype;
---------------------------
-- Check_In_Main_Program --
---------------------------
procedure Check_In_Main_Program is
P : constant Node_Id := Parent (N);
begin
-- Must be at in subprogram body
if Nkind (P) /= N_Subprogram_Body then
Error_Pragma ("% pragma allowed only in subprogram");
-- Otherwise warn if obviously not main program
elsif Present (Parameter_Specifications (Specification (P)))
or else not Is_Library_Level_Entity (Defining_Entity (P))
then
Error_Msg_Name_1 := Chars (N);
Error_Msg_N
("?pragma% is only effective in main program", N);
end if;
end Check_In_Main_Program;
---------------------------------------
-- Check_Interrupt_Or_Attach_Handler --
---------------------------------------
procedure Check_Interrupt_Or_Attach_Handler is
Arg1_X : constant Node_Id := Expression (Arg1);
begin
Analyze (Arg1_X);
if not Is_Entity_Name (Arg1_X) then
Error_Pragma_Arg
("argument of pragma% must be entity name", Arg1);
elsif Prag_Id = Pragma_Interrupt_Handler then
Check_Restriction (No_Dynamic_Interrupts, N);
end if;
declare
Prot_Proc : Entity_Id := Empty;
Prot_Type : Entity_Id;
Found : Boolean := False;
begin
if not Is_Overloaded (Arg1_X) then
Prot_Proc := Entity (Arg1_X);
else
declare
It : Interp;
Index : Interp_Index;
begin
Get_First_Interp (Arg1_X, Index, It);
while Present (It.Nam) loop
Prot_Proc := It.Nam;
if Ekind (Prot_Proc) = E_Procedure
and then No (First_Formal (Prot_Proc))
then
if not Found then
Found := True;
Set_Entity (Arg1_X, Prot_Proc);
Set_Is_Overloaded (Arg1_X, False);
else
Error_Pragma_Arg
("ambiguous handler name for pragma% ", Arg1);
end if;
end if;
Get_Next_Interp (Index, It);
end loop;
if not Found then
Error_Pragma_Arg
("argument of pragma% must be parameterless procedure",
Arg1);
else
Prot_Proc := Entity (Arg1_X);
end if;
end;
end if;
Prot_Type := Scope (Prot_Proc);
if Ekind (Prot_Proc) /= E_Procedure
or else Ekind (Prot_Type) /= E_Protected_Type
then
Error_Pragma_Arg
("argument of pragma% must be protected procedure",
Arg1);
end if;
if not Is_Library_Level_Entity (Prot_Type) then
Error_Pragma_Arg
("pragma% requires library level entity", Arg1);
end if;
if Present (First_Formal (Prot_Proc)) then
Error_Pragma_Arg
("argument of pragma% must be parameterless procedure",
Arg1);
end if;
if Parent (N) /=
Protected_Definition (Parent (Prot_Type))
then
Error_Pragma ("pragma% must be in protected definition");
end if;
end;
end Check_Interrupt_Or_Attach_Handler;
-------------------------------------------
-- Check_Is_In_Decl_Part_Or_Package_Spec --
-------------------------------------------
procedure Check_Is_In_Decl_Part_Or_Package_Spec is
P : Node_Id;
begin
P := Parent (N);
loop
if No (P) then
exit;
elsif Nkind (P) = N_Handled_Sequence_Of_Statements then
exit;
elsif Nkind (P) = N_Package_Specification then
return;
elsif Nkind (P) = N_Block_Statement then
return;
-- Note: the following tests seem a little peculiar, because
-- they test for bodies, but if we were in the statement part
-- of the body, we would already have hit the handled statement
-- sequence, so the only way we get here is by being in the
-- declarative part of the body.
elsif Nkind (P) = N_Subprogram_Body
or else Nkind (P) = N_Package_Body
or else Nkind (P) = N_Task_Body
or else Nkind (P) = N_Entry_Body
then
return;
end if;
P := Parent (P);
end loop;
Error_Pragma ("pragma% is not in declarative part or package spec");
end Check_Is_In_Decl_Part_Or_Package_Spec;
-------------------------
-- Check_No_Identifier --
-------------------------
procedure Check_No_Identifier (Arg : Node_Id) is
begin
if Chars (Arg) /= No_Name then
Error_Pragma_Arg_Ident
("pragma% does not permit identifier& here", Arg);
end if;
end Check_No_Identifier;
--------------------------
-- Check_No_Identifiers --
--------------------------
procedure Check_No_Identifiers is
Arg_Node : Node_Id;
begin
if Arg_Count > 0 then
Arg_Node := Arg1;
while Present (Arg_Node) loop
Check_No_Identifier (Arg_Node);
Next (Arg_Node);
end loop;
end if;
end Check_No_Identifiers;
-----------------------------------
-- Check_Non_Overloaded_Function --
-----------------------------------
procedure Check_Non_Overloaded_Function (Arg : Node_Id) is
Ent : Entity_Id;
begin
Check_Arg_Is_Local_Name (Arg);
Ent := Entity (Expression (Arg));
if Present (Homonym (Ent))
and then Scope (Homonym (Ent)) = Current_Scope
then
Error_Pragma_Arg
("argument for pragma% may not be overloaded", Arg);
end if;
if Ekind (Ent) /= E_Function
or else No (First_Formal (Ent))
or else Present (Next_Formal (First_Formal (Ent)))
then
Error_Pragma_Arg
("argument for pragma% must be function of one argument", Arg);
end if;
end Check_Non_Overloaded_Function;
-------------------------------
-- Check_Optional_Identifier --
-------------------------------
procedure Check_Optional_Identifier (Arg : Node_Id; Id : Name_Id) is
begin
if Present (Arg) and then Chars (Arg) /= No_Name then
if Chars (Arg) /= Id then
Error_Msg_Name_1 := Chars (N);
Error_Msg_Name_2 := Id;
Error_Msg_N ("pragma% argument expects identifier%", Arg);
raise Pragma_Exit;
end if;
end if;
end Check_Optional_Identifier;
procedure Check_Optional_Identifier (Arg : Node_Id; Id : String) is
begin
Name_Buffer (1 .. Id'Length) := Id;
Name_Len := Id'Length;
Check_Optional_Identifier (Arg, Name_Find);
end Check_Optional_Identifier;
-----------------------------
-- Check_Static_Constraint --
-----------------------------
-- Note: for convenience in writing this procedure, in addition to
-- the officially (i.e. by spec) allowed argument which is always
-- a constraint, it also allows ranges and discriminant associations.
procedure Check_Static_Constraint (Constr : Node_Id) is
--------------------
-- Require_Static --
--------------------
procedure Require_Static (E : Node_Id);
-- Require given expression to be static expression
procedure Require_Static (E : Node_Id) is
begin
if not Is_OK_Static_Expression (E) then
Error_Msg_N
("non-static constraint not allowed in Unchecked_Union", E);
raise Pragma_Exit;
end if;
end Require_Static;
-- Start of processing for Check_Static_Constraint
begin
case Nkind (Constr) is
when N_Discriminant_Association =>
Require_Static (Expression (Constr));
when N_Range =>
Require_Static (Low_Bound (Constr));
Require_Static (High_Bound (Constr));
when N_Attribute_Reference =>
Require_Static (Type_Low_Bound (Etype (Prefix (Constr))));
Require_Static (Type_High_Bound (Etype (Prefix (Constr))));
when N_Range_Constraint =>
Check_Static_Constraint (Range_Expression (Constr));
when N_Index_Or_Discriminant_Constraint =>
declare
IDC : Entity_Id := First (Constraints (Constr));
begin
while Present (IDC) loop
Check_Static_Constraint (IDC);
Next (IDC);
end loop;
end;
when others =>
null;
end case;
end Check_Static_Constraint;
--------------------------------------
-- Check_Valid_Configuration_Pragma --
--------------------------------------
-- A configuration pragma must appear in the context clause of
-- a compilation unit, at the start of the list (i.e. only other
-- pragmas may precede it).
procedure Check_Valid_Configuration_Pragma is
begin
if not Is_Configuration_Pragma then
Error_Pragma ("incorrect placement for configuration pragma%");
end if;
end Check_Valid_Configuration_Pragma;
-------------------------------------
-- Check_Valid_Library_Unit_Pragma --
-------------------------------------
procedure Check_Valid_Library_Unit_Pragma is
Plist : List_Id;
Parent_Node : Node_Id;
Unit_Name : Entity_Id;
Valid : Boolean := True;
Unit_Kind : Node_Kind;
Unit_Node : Node_Id;
Sindex : Source_File_Index;
begin
if not Is_List_Member (N) then
Pragma_Misplaced;
Valid := False;
else
Plist := List_Containing (N);
Parent_Node := Parent (Plist);
if Parent_Node = Empty then
Pragma_Misplaced;
-- Case of pragma appearing after a compilation unit. In this
-- case it must have an argument with the corresponding name
-- and must be part of the following pragmas of its parent.
elsif Nkind (Parent_Node) = N_Compilation_Unit_Aux then
if Plist /= Pragmas_After (Parent_Node) then
Pragma_Misplaced;
elsif Arg_Count = 0 then
Error_Pragma
("argument required if outside compilation unit");
else
Check_No_Identifiers;
Check_Arg_Count (1);
Unit_Node := Unit (Parent (Parent_Node));
Unit_Kind := Nkind (Unit_Node);
Analyze (Expression (Arg1));
if Unit_Kind = N_Generic_Subprogram_Declaration
or else Unit_Kind = N_Subprogram_Declaration
then
Unit_Name := Defining_Entity (Unit_Node);
elsif Unit_Kind = N_Function_Instantiation
or else Unit_Kind = N_Package_Instantiation
or else Unit_Kind = N_Procedure_Instantiation
then
Unit_Name := Defining_Entity (Unit_Node);
else
Unit_Name := Cunit_Entity (Current_Sem_Unit);
end if;
if Chars (Unit_Name) /=
Chars (Entity (Expression (Arg1)))
then
Error_Pragma_Arg
("pragma% argument is not current unit name", Arg1);
end if;
if Ekind (Unit_Name) = E_Package
and then Present (Renamed_Entity (Unit_Name))
then
Error_Pragma ("pragma% not allowed for renamed package");
end if;
end if;
-- Pragma appears other than after a compilation unit
else
-- Here we check for the generic instantiation case and also
-- for the case of processing a generic formal package. We
-- detect these cases by noting that the Sloc on the node
-- does not belong to the current compilation unit.
Sindex := Source_Index (Current_Sem_Unit);
if Loc not in Source_First (Sindex) .. Source_Last (Sindex) then
Rewrite (N, Make_Null_Statement (Loc));
return;
-- If before first declaration, the pragma applies to the
-- enclosing unit, and the name if present must be this name.
elsif Is_Before_First_Decl (N, Plist) then
Unit_Node := Unit_Declaration_Node (Current_Scope);
Unit_Kind := Nkind (Unit_Node);
if Nkind (Parent (Unit_Node)) /= N_Compilation_Unit then
Pragma_Misplaced;
elsif Unit_Kind = N_Subprogram_Body
and then not Acts_As_Spec (Unit_Node)
then
Pragma_Misplaced;
elsif Nkind (Parent_Node) = N_Package_Body then
Pragma_Misplaced;
elsif Nkind (Parent_Node) = N_Package_Specification
and then Plist = Private_Declarations (Parent_Node)
then
Pragma_Misplaced;
elsif (Nkind (Parent_Node) = N_Generic_Package_Declaration
or else Nkind (Parent_Node)
= N_Generic_Subprogram_Declaration)
and then Plist = Generic_Formal_Declarations (Parent_Node)
then
Pragma_Misplaced;
elsif Arg_Count > 0 then
Analyze (Expression (Arg1));
if Entity (Expression (Arg1)) /= Current_Scope then
Error_Pragma_Arg
("name in pragma% must be enclosing unit", Arg1);
end if;
-- It is legal to have no argument in this context
else
return;
end if;
-- Error if not before first declaration. This is because a
-- library unit pragma argument must be the name of a library
-- unit (RM 10.1.5(7)), but the only names permitted in this
-- context are (RM 10.1.5(6)) names of subprogram declarations,
-- generic subprogram declarations or generic instantiations.
else
Error_Pragma
("pragma% misplaced, must be before first declaration");
end if;
end if;
end if;
end Check_Valid_Library_Unit_Pragma;
------------------
-- Error_Pragma --
------------------
procedure Error_Pragma (Msg : String) is
begin
Error_Msg_Name_1 := Chars (N);
Error_Msg_N (Msg, N);
raise Pragma_Exit;
end Error_Pragma;
----------------------
-- Error_Pragma_Arg --
----------------------
procedure Error_Pragma_Arg (Msg : String; Arg : Node_Id) is
begin
Error_Msg_Name_1 := Chars (N);
Error_Msg_N (Msg, Get_Pragma_Arg (Arg));
raise Pragma_Exit;
end Error_Pragma_Arg;
procedure Error_Pragma_Arg (Msg1, Msg2 : String; Arg : Node_Id) is
begin
Error_Msg_Name_1 := Chars (N);
Error_Msg_N (Msg1, Get_Pragma_Arg (Arg));
Error_Pragma_Arg (Msg2, Arg);
end Error_Pragma_Arg;
----------------------------
-- Error_Pragma_Arg_Ident --
----------------------------
procedure Error_Pragma_Arg_Ident (Msg : String; Arg : Node_Id) is
begin
Error_Msg_Name_1 := Chars (N);
Error_Msg_N (Msg, Arg);
raise Pragma_Exit;
end Error_Pragma_Arg_Ident;
------------------------
-- Find_Lib_Unit_Name --
------------------------
function Find_Lib_Unit_Name return Entity_Id is
begin
-- Return inner compilation unit entity, for case of nested
-- categorization pragmas. This happens in generic unit.
if Nkind (Parent (N)) = N_Package_Specification
and then Defining_Entity (Parent (N)) /= Current_Scope
then
return Defining_Entity (Parent (N));
else
return Current_Scope;
end if;
end Find_Lib_Unit_Name;
----------------------------
-- Find_Program_Unit_Name --
----------------------------
procedure Find_Program_Unit_Name (Id : Node_Id) is
Unit_Name : Entity_Id;
Unit_Kind : Node_Kind;
P : constant Node_Id := Parent (N);
begin
if Nkind (P) = N_Compilation_Unit then
Unit_Kind := Nkind (Unit (P));
if Unit_Kind = N_Subprogram_Declaration
or else Unit_Kind = N_Package_Declaration
or else Unit_Kind in N_Generic_Declaration
then
Unit_Name := Defining_Entity (Unit (P));
if Chars (Id) = Chars (Unit_Name) then
Set_Entity (Id, Unit_Name);
Set_Etype (Id, Etype (Unit_Name));
else
Set_Etype (Id, Any_Type);
Error_Pragma
("cannot find program unit referenced by pragma%");
end if;
else
Set_Etype (Id, Any_Type);
Error_Pragma ("pragma% inapplicable to this unit");
end if;
else
Analyze (Id);
end if;
end Find_Program_Unit_Name;
-------------------------
-- Gather_Associations --
-------------------------
procedure Gather_Associations
(Names : Name_List;
Args : out Args_List)
is
Arg : Node_Id;
begin
-- Initialize all parameters to Empty
for J in Args'Range loop
Args (J) := Empty;
end loop;
-- That's all we have to do if there are no argument associations
if No (Pragma_Argument_Associations (N)) then
return;
end if;
-- Otherwise first deal with any positional parameters present
Arg := First (Pragma_Argument_Associations (N));
for Index in Args'Range loop
exit when No (Arg) or else Chars (Arg) /= No_Name;
Args (Index) := Expression (Arg);
Next (Arg);
end loop;
-- Positional parameters all processed, if any left, then we
-- have too many positional parameters.
if Present (Arg) and then Chars (Arg) = No_Name then
Error_Pragma_Arg
("too many positional associations for pragma%", Arg);
end if;
-- Process named parameters if any are present
while Present (Arg) loop
if Chars (Arg) = No_Name then
Error_Pragma_Arg
("positional association cannot follow named association",
Arg);
else
for Index in Names'Range loop
if Names (Index) = Chars (Arg) then
if Present (Args (Index)) then
Error_Pragma_Arg
("duplicate argument association for pragma%", Arg);
else
Args (Index) := Expression (Arg);
exit;
end if;
end if;
if Index = Names'Last then
Error_Pragma_Arg_Ident
("pragma% does not allow & argument", Arg);
end if;
end loop;
end if;
Next (Arg);
end loop;
end Gather_Associations;
--------------------
-- Get_Pragma_Arg --
--------------------
function Get_Pragma_Arg (Arg : Node_Id) return Node_Id is
begin
if Nkind (Arg) = N_Pragma_Argument_Association then
return Expression (Arg);
else
return Arg;
end if;
end Get_Pragma_Arg;
-----------------
-- GNAT_Pragma --
-----------------
procedure GNAT_Pragma is
begin
Check_Restriction (No_Implementation_Pragmas, N);
end GNAT_Pragma;
--------------------------
-- Is_Before_First_Decl --
--------------------------
function Is_Before_First_Decl
(Pragma_Node : Node_Id;
Decls : List_Id)
return Boolean
is
Item : Node_Id := First (Decls);
begin
-- Only other pragmas can come before this pragma
loop
if No (Item) or else Nkind (Item) /= N_Pragma then
return False;
elsif Item = Pragma_Node then
return True;
end if;
Next (Item);
end loop;
end Is_Before_First_Decl;
-----------------------------
-- Is_Configuration_Pragma --
-----------------------------
-- A configuration pragma must appear in the context clause of
-- a compilation unit, at the start of the list (i.e. only other
-- pragmas may precede it).
function Is_Configuration_Pragma return Boolean is
Lis : constant List_Id := List_Containing (N);
Par : constant Node_Id := Parent (N);
Prg : Node_Id;
begin
-- If no parent, then we are in the configuration pragma file,
-- so the placement is definitely appropriate.
if No (Par) then
return True;
-- Otherwise we must be in the context clause of a compilation unit
-- and the only thing allowed before us in the context list is more
-- configuration pragmas.
elsif Nkind (Par) = N_Compilation_Unit
and then Context_Items (Par) = Lis
then
Prg := First (Lis);
loop
if Prg = N then
return True;
elsif Nkind (Prg) /= N_Pragma then
return False;
end if;
Next (Prg);
end loop;
else
return False;
end if;
end Is_Configuration_Pragma;
----------------------
-- Pragma_Misplaced --
----------------------
procedure Pragma_Misplaced is
begin
Error_Pragma ("incorrect placement of pragma%");
end Pragma_Misplaced;
------------------------------------
-- Process Atomic_Shared_Volatile --
------------------------------------
procedure Process_Atomic_Shared_Volatile is
E_Id : Node_Id;
E : Entity_Id;
D : Node_Id;
K : Node_Kind;
begin
GNAT_Pragma;
Check_Ada_83_Warning;
Check_No_Identifiers;
Check_Arg_Count (1);
Check_Arg_Is_Local_Name (Arg1);
E_Id := Expression (Arg1);
if Etype (E_Id) = Any_Type then
return;
end if;
E := Entity (E_Id);
D := Declaration_Node (E);
K := Nkind (D);
if Is_Type (E) then
if Rep_Item_Too_Early (E, N)
or else
Rep_Item_Too_Late (E, N)
then
return;
else
Check_First_Subtype (Arg1);
end if;
if Prag_Id /= Pragma_Volatile then
Set_Is_Atomic (E);
Set_Is_Atomic (Underlying_Type (E));
end if;
Set_Is_Volatile (E);
Set_Is_Volatile (Underlying_Type (E));
elsif K = N_Object_Declaration
or else (K = N_Component_Declaration
and then Original_Record_Component (E) = E)
then
if Rep_Item_Too_Late (E, N) then
return;
end if;
if Prag_Id /= Pragma_Volatile then
Set_Is_Atomic (E);
end if;
Set_Is_Volatile (E);
else
Error_Pragma_Arg
("inappropriate entity for pragma%", Arg1);
end if;
end Process_Atomic_Shared_Volatile;
------------------------
-- Process_Convention --
------------------------
procedure Process_Convention
(C : out Convention_Id;
E : out Entity_Id)
is
Id : Node_Id;
E1 : Entity_Id;
Comp_Unit : Unit_Number_Type;
Cname : Name_Id;
procedure Set_Convention_From_Pragma (E : Entity_Id);
-- Set convention in entity E, and also flag that the entity has a
-- convention pragma. If entity is for a private or incomplete type,
-- also set convention and flag on underlying type. This procedure
-- also deals with the special case of C_Pass_By_Copy convention.
--------------------------------
-- Set_Convention_From_Pragma --
--------------------------------
procedure Set_Convention_From_Pragma (E : Entity_Id) is
begin
Set_Convention (E, C);
Set_Has_Convention_Pragma (E);
if Is_Incomplete_Or_Private_Type (E) then
Set_Convention (Underlying_Type (E), C);
Set_Has_Convention_Pragma (Underlying_Type (E), True);
end if;
-- A class-wide type should inherit the convention of
-- the specific root type (although this isn't specified
-- clearly by the RM).
if Is_Type (E) and then Present (Class_Wide_Type (E)) then
Set_Convention (Class_Wide_Type (E), C);
end if;
-- If the entity is a record type, then check for special case
-- of C_Pass_By_Copy, which is treated the same as C except that
-- the special record flag is set. This convention is also only
-- permitted on record types (see AI95-00131).
if Cname = Name_C_Pass_By_Copy then
if Is_Record_Type (E) then
Set_C_Pass_By_Copy (Base_Type (E));
elsif Is_Incomplete_Or_Private_Type (E)
and then Is_Record_Type (Underlying_Type (E))
then
Set_C_Pass_By_Copy (Base_Type (Underlying_Type (E)));
else
Error_Pragma_Arg
("C_Pass_By_Copy convention allowed only for record type",
Arg2);
end if;
end if;
-- If the entity is a derived boolean type, check for the
-- special case of convention C, C++, or Fortran, where we
-- consider any nonzero value to represent true.
if Is_Discrete_Type (E)
and then Root_Type (Etype (E)) = Standard_Boolean
and then
(C = Convention_C
or else
C = Convention_CPP
or else
C = Convention_Fortran)
then
Set_Nonzero_Is_True (Base_Type (E));
end if;
end Set_Convention_From_Pragma;
-- Start of processing for Process_Convention
begin
Check_At_Least_N_Arguments (2);
Check_Arg_Is_Identifier (Arg1);
Check_Optional_Identifier (Arg1, Name_Convention);
Cname := Chars (Expression (Arg1));
-- C_Pass_By_Copy is treated as a synonym for convention C
-- (this is tested again below to set the critical flag)
if Cname = Name_C_Pass_By_Copy then
C := Convention_C;
-- Otherwise we must have something in the standard convention list
elsif Is_Convention_Name (Cname) then
C := Get_Convention_Id (Chars (Expression (Arg1)));
-- In DEC VMS, it seems that there is an undocumented feature
-- that any unrecognized convention is treated as the default,
-- which for us is convention C. It does not seem so terrible
-- to do this unconditionally, silently in the VMS case, and
-- with a warning in the non-VMS case.
else
if not OpenVMS_On_Target then
Error_Msg_N
("?unrecognized convention name, C assumed",
Expression (Arg1));
end if;
C := Convention_C;
end if;
Check_Arg_Is_Local_Name (Arg2);
Check_Optional_Identifier (Arg2, Name_Entity);
Id := Expression (Arg2);
Analyze (Id);
if not Is_Entity_Name (Id) then
Error_Pragma_Arg ("entity name required", Arg2);
end if;
E := Entity (Id);
-- Go to renamed subprogram if present, since convention applies
-- to the actual renamed entity, not to the renaming entity.
if Is_Subprogram (E)
and then Present (Alias (E))
and then Nkind (Parent (Declaration_Node (E))) =
N_Subprogram_Renaming_Declaration
then
E := Alias (E);
end if;
-- Check that we not applying this to a specless body
if Is_Subprogram (E)
and then Nkind (Parent (Declaration_Node (E))) = N_Subprogram_Body
then
Error_Pragma
("pragma% requires separate spec and must come before body");
end if;
-- Check that we are not applying this to a named constant
if Ekind (E) = E_Named_Integer
or else
Ekind (E) = E_Named_Real
then
Error_Msg_Name_1 := Chars (N);
Error_Msg_N
("cannot apply pragma% to named constant!",
Get_Pragma_Arg (Arg2));
Error_Pragma_Arg
("\supply appropriate type for&!", Arg2);
end if;
if Etype (E) = Any_Type
or else Rep_Item_Too_Early (E, N)
then
raise Pragma_Exit;
else
E := Underlying_Type (E);
end if;
if Rep_Item_Too_Late (E, N) then
raise Pragma_Exit;
end if;
if Has_Convention_Pragma (E) then
Error_Pragma_Arg
("at most one Convention/Export/Import pragma is allowed", Arg2);
elsif Convention (E) = Convention_Protected
or else Ekind (Scope (E)) = E_Protected_Type
then
Error_Pragma_Arg
("a protected operation cannot be given a different convention",
Arg2);
end if;
-- For Intrinsic, a subprogram is required
if C = Convention_Intrinsic
and then not Is_Subprogram (E)
and then not Is_Generic_Subprogram (E)
then
Error_Pragma_Arg
("second argument of pragma% must be a subprogram", Arg2);
end if;
-- For Stdcall, a subprogram, variable or subprogram type is required
if C = Convention_Stdcall
and then not Is_Subprogram (E)
and then not Is_Generic_Subprogram (E)
and then Ekind (E) /= E_Variable
and then not
(Is_Access_Type (E)
and then Ekind (Designated_Type (E)) = E_Subprogram_Type)
then
Error_Pragma_Arg
("second argument of pragma% must be subprogram (type)",
Arg2);
end if;
if not Is_Subprogram (E)
and then not Is_Generic_Subprogram (E)
then
Set_Convention_From_Pragma (E);
if Is_Type (E) then
Check_First_Subtype (Arg2);
Set_Convention_From_Pragma (Base_Type (E));
-- For subprograms, we must set the convention on the
-- internally generated directly designated type as well.
if Ekind (E) = E_Access_Subprogram_Type then
Set_Convention_From_Pragma (Directly_Designated_Type (E));
end if;
end if;
-- For the subprogram case, set proper convention for all homonyms
-- in same compilation unit.
-- Is the test of compilation unit really necessary ???
-- What about subprogram renamings here???
else
Comp_Unit := Get_Source_Unit (E);
Set_Convention_From_Pragma (E);
E1 := E;
loop
E1 := Homonym (E1);
exit when No (E1) or else Scope (E1) /= Current_Scope;
-- Note: below we are missing a check for Rep_Item_Too_Late.
-- That is deliberate, we cannot chain the rep item on more
-- than one Rep_Item chain, to be fixed later ???
if Comp_Unit = Get_Source_Unit (E1) then
Set_Convention_From_Pragma (E1);
end if;
end loop;
end if;
end Process_Convention;
-----------------------------------------------------
-- Process_Extended_Import_Export_Exception_Pragma --
-----------------------------------------------------
procedure Process_Extended_Import_Export_Exception_Pragma
(Arg_Internal : Node_Id;
Arg_External : Node_Id;
Arg_Form : Node_Id;
Arg_Code : Node_Id)
is
Def_Id : Entity_Id;
Code_Val : Uint;
begin
Process_Extended_Import_Export_Internal_Arg (Arg_Internal);
Def_Id := Entity (Arg_Internal);
if Ekind (Def_Id) /= E_Exception then
Error_Pragma_Arg
("pragma% must refer to declared exception", Arg_Internal);
end if;
Set_Extended_Import_Export_External_Name (Def_Id, Arg_External);
if Present (Arg_Form) then
Check_Arg_Is_One_Of (Arg_Form, Name_Ada, Name_VMS);
end if;
if Present (Arg_Form)
and then Chars (Arg_Form) = Name_Ada
then
null;
else
Set_Is_VMS_Exception (Def_Id);
Set_Exception_Code (Def_Id, No_Uint);
end if;
if Present (Arg_Code) then
if not Is_VMS_Exception (Def_Id) then
Error_Pragma_Arg
("Code option for pragma% not allowed for Ada case",
Arg_Code);
end if;
Check_Arg_Is_Static_Expression (Arg_Code, Any_Integer);
Code_Val := Expr_Value (Arg_Code);
if not UI_Is_In_Int_Range (Code_Val) then
Error_Pragma_Arg
("Code option for pragma% must be in 32-bit range",
Arg_Code);
else
Set_Exception_Code (Def_Id, Code_Val);
end if;
end if;
end Process_Extended_Import_Export_Exception_Pragma;
-------------------------------------------------
-- Process_Extended_Import_Export_Internal_Arg --
-------------------------------------------------
procedure Process_Extended_Import_Export_Internal_Arg
(Arg_Internal : Node_Id := Empty)
is
begin
GNAT_Pragma;
if No (Arg_Internal) then
Error_Pragma ("Internal parameter required for pragma%");
end if;
if Nkind (Arg_Internal) = N_Identifier then
null;
elsif Nkind (Arg_Internal) = N_Operator_Symbol
and then (Prag_Id = Pragma_Import_Function
or else
Prag_Id = Pragma_Export_Function)
then
null;
else
Error_Pragma_Arg
("wrong form for Internal parameter for pragma%", Arg_Internal);
end if;
Check_Arg_Is_Local_Name (Arg_Internal);
end Process_Extended_Import_Export_Internal_Arg;
--------------------------------------------------
-- Process_Extended_Import_Export_Object_Pragma --
--------------------------------------------------
procedure Process_Extended_Import_Export_Object_Pragma
(Arg_Internal : Node_Id;
Arg_External : Node_Id;
Arg_Size : Node_Id)
is
Def_Id : Entity_Id;
begin
Process_Extended_Import_Export_Internal_Arg (Arg_Internal);
Def_Id := Entity (Arg_Internal);
if Ekind (Def_Id) /= E_Constant
and then Ekind (Def_Id) /= E_Variable
then
Error_Pragma_Arg
("pragma% must designate an object", Arg_Internal);
end if;
if Is_Psected (Def_Id) then
Error_Pragma_Arg
("previous Psect_Object applies, pragma % not permitted",
Arg_Internal);
end if;
if Rep_Item_Too_Late (Def_Id, N) then
raise Pragma_Exit;
end if;
Set_Extended_Import_Export_External_Name (Def_Id, Arg_External);
if Present (Arg_Size)
and then Nkind (Arg_Size) /= N_Identifier
and then Nkind (Arg_Size) /= N_String_Literal
then
Error_Pragma_Arg
("pragma% Size argument must be identifier or string literal",
Arg_Size);
end if;
-- Export_Object case
if Prag_Id = Pragma_Export_Object then
if not Is_Library_Level_Entity (Def_Id) then
Error_Pragma_Arg
("argument for pragma% must be library level entity",
Arg_Internal);
end if;
if Ekind (Current_Scope) = E_Generic_Package then
Error_Pragma ("pragma& cannot appear in a generic unit");
end if;
if not Size_Known_At_Compile_Time (Etype (Def_Id)) then
Error_Pragma_Arg
("exported object must have compile time known size",
Arg_Internal);
end if;
if Is_Exported (Def_Id) then
Error_Msg_N
("?duplicate Export_Object pragma", N);
else
Set_Exported (Def_Id, Arg_Internal);
end if;
-- Import_Object case
else
if Is_Concurrent_Type (Etype (Def_Id)) then
Error_Pragma_Arg
("cannot use pragma% for task/protected object",
Arg_Internal);
end if;
if Ekind (Def_Id) = E_Constant then
Error_Pragma_Arg
("cannot import a constant", Arg_Internal);
end if;
if Has_Discriminants (Etype (Def_Id)) then
Error_Msg_N
("imported value must be initialized?", Arg_Internal);
end if;
if Is_Access_Type (Etype (Def_Id)) then
Error_Pragma_Arg
("cannot import object of an access type?", Arg_Internal);
end if;
if Is_Imported (Def_Id) then
Error_Msg_N
("?duplicate Import_Object pragma", N);
else
Set_Imported (Def_Id);
end if;
end if;
end Process_Extended_Import_Export_Object_Pragma;
------------------------------------------------------
-- Process_Extended_Import_Export_Subprogram_Pragma --
------------------------------------------------------
procedure Process_Extended_Import_Export_Subprogram_Pragma
(Arg_Internal : Node_Id;
Arg_External : Node_Id;
Arg_Parameter_Types : Node_Id;
Arg_Result_Type : Node_Id := Empty;
Arg_Mechanism : Node_Id;
Arg_Result_Mechanism : Node_Id := Empty;
Arg_First_Optional_Parameter : Node_Id := Empty)
is
Ent : Entity_Id;
Def_Id : Entity_Id;
Hom_Id : Entity_Id;
Formal : Entity_Id;
Ambiguous : Boolean;
Match : Boolean;
Dval : Node_Id;
function Same_Base_Type (Ptype, Formal : Entity_Id) return Boolean;
-- Determines if Ptype references the type of Formal. Note that
-- only the base types need to match according to the spec.
function Same_Base_Type (Ptype, Formal : Entity_Id) return Boolean is
begin
Find_Type (Ptype);
if not Is_Entity_Name (Ptype)
or else Entity (Ptype) = Any_Type
then
raise Pragma_Exit;
end if;
return Base_Type (Entity (Ptype)) = Base_Type (Etype (Formal));
end Same_Base_Type;
-- Start of processing for
-- Process_Extended_Import_Export_Subprogram_Pragma
begin
Process_Extended_Import_Export_Internal_Arg (Arg_Internal);
Hom_Id := Entity (Arg_Internal);
Ent := Empty;
Ambiguous := False;
-- Loop through homonyms (overloadings) of Hom_Id
while Present (Hom_Id) loop
Def_Id := Get_Base_Subprogram (Hom_Id);
-- We need a subprogram in the current scope
if not Is_Subprogram (Def_Id)
or else Scope (Def_Id) /= Current_Scope
then
null;
else
Match := True;
-- Pragma cannot apply to subprogram body
if Is_Subprogram (Def_Id)
and then
Nkind (Parent
(Declaration_Node (Def_Id))) = N_Subprogram_Body
then
Error_Pragma
("pragma% requires separate spec"
& " and must come before body");
end if;
-- Test result type if given, note that the result type
-- parameter can only be present for the function cases.
if Present (Arg_Result_Type)
and then not Same_Base_Type (Arg_Result_Type, Def_Id)
then
Match := False;
-- Test parameter types if given. Note that this parameter
-- has not been analyzed (and must not be, since it is
-- semantic nonsense), so we get it as the parser left it.
elsif Present (Arg_Parameter_Types) then
Check_Matching_Types : declare
Formal : Entity_Id;
Ptype : Node_Id;
begin
Formal := First_Formal (Def_Id);
if Nkind (Arg_Parameter_Types) = N_Null then
if Present (Formal) then
Match := False;
end if;
-- A list of one type, e.g. (List) is parsed as
-- a parenthesized expression.
elsif Nkind (Arg_Parameter_Types) /= N_Aggregate
and then Paren_Count (Arg_Parameter_Types) = 1
then
if No (Formal)
or else Present (Next_Formal (Formal))
then
Match := False;
else
Match :=
Same_Base_Type (Arg_Parameter_Types, Formal);
end if;
-- A list of more than one type is parsed as a aggregate
elsif Nkind (Arg_Parameter_Types) = N_Aggregate
and then Paren_Count (Arg_Parameter_Types) = 0
then
Ptype := First (Expressions (Arg_Parameter_Types));
while Present (Ptype) or else Present (Formal) loop
if No (Ptype)
or else No (Formal)
or else not Same_Base_Type (Ptype, Formal)
then
Match := False;
exit;
else
Next_Formal (Formal);
Next (Ptype);
end if;
end loop;
-- Anything else is of the wrong form
else
Error_Pragma_Arg
("wrong form for Parameter_Types parameter",
Arg_Parameter_Types);
end if;
end Check_Matching_Types;
end if;
-- Match is now False if the entry we found did not match
-- either a supplied Parameter_Types or Result_Types argument
if Match then
if No (Ent) then
Ent := Def_Id;
-- Ambiguous case, the flag Ambiguous shows if we already
-- detected this and output the initial messages.
else
if not Ambiguous then
Ambiguous := True;
Error_Msg_Name_1 := Chars (N);
Error_Msg_N
("pragma% does not uniquely identify subprogram!",
N);
Error_Msg_Sloc := Sloc (Ent);
Error_Msg_N ("matching subprogram #!", N);
Ent := Empty;
end if;
Error_Msg_Sloc := Sloc (Def_Id);
Error_Msg_N ("matching subprogram #!", N);
end if;
end if;
end if;
Hom_Id := Homonym (Hom_Id);
end loop;
-- See if we found an entry
if No (Ent) then
if not Ambiguous then
if Is_Generic_Subprogram (Entity (Arg_Internal)) then
Error_Pragma
("pragma% cannot be given for generic subprogram");
else
Error_Pragma
("pragma% does not identify local subprogram");
end if;
end if;
return;
end if;
-- Import pragmas must be be for imported entities
if (Prag_Id = Pragma_Import_Function
or else
Prag_Id = Pragma_Import_Procedure
or else
Prag_Id = Pragma_Import_Valued_Procedure)
then
if not Is_Imported (Ent) then
Error_Pragma
("pragma Import or Interface must precede pragma%");
end if;
-- For the Export cases, the pragma Export is sufficient to set
-- the entity as exported, if it is not exported already. We
-- leave the default Ada convention in this case.
else
Set_Exported (Ent, Arg_Internal);
end if;
-- Special processing for Valued_Procedure cases
if Prag_Id = Pragma_Import_Valued_Procedure
or else
Prag_Id = Pragma_Export_Valued_Procedure
then
Formal := First_Formal (Ent);
if No (Formal) then
Error_Pragma
("at least one parameter required for pragma%");
elsif Ekind (Formal) /= E_Out_Parameter then
Error_Pragma
("first parameter must have mode out for pragma%");
else
Set_Is_Valued_Procedure (Ent);
end if;
end if;
Set_Extended_Import_Export_External_Name (Ent, Arg_External);
-- Process Result_Mechanism argument if present. We have already
-- checked that this is only allowed for the function case.
if Present (Arg_Result_Mechanism) then
Set_Mechanism_Value (Ent, Arg_Result_Mechanism);
end if;
-- Process Mechanism parameter if present. Note that this parameter
-- is not analyzed, and must not be analyzed since it is semantic
-- nonsense, so we get it in exactly as the parser left it.
if Present (Arg_Mechanism) then
declare
Formal : Entity_Id;
Massoc : Node_Id;
Mname : Node_Id;
Choice : Node_Id;
begin
-- A single mechanism association without a formal parameter
-- name is parsed as a parenthesized expression. All other
-- cases are parsed as aggregates, so we rewrite the single
-- parameter case as an aggregate for consistency.
if Nkind (Arg_Mechanism) /= N_Aggregate
and then Paren_Count (Arg_Mechanism) = 1
then
Rewrite (Arg_Mechanism,
Make_Aggregate (Sloc (Arg_Mechanism),
Expressions => New_List (
Relocate_Node (Arg_Mechanism))));
end if;
-- Case of only mechanism name given, applies to all formals
if Nkind (Arg_Mechanism) /= N_Aggregate then
Formal := First_Formal (Ent);
while Present (Formal) loop
Set_Mechanism_Value (Formal, Arg_Mechanism);
Next_Formal (Formal);
end loop;
-- Case of list of mechanism associations given
else
if Null_Record_Present (Arg_Mechanism) then
Error_Pragma_Arg
("inappropriate form for Mechanism parameter",
Arg_Mechanism);
end if;
-- Deal with positional ones first
Formal := First_Formal (Ent);
if Present (Expressions (Arg_Mechanism)) then
Mname := First (Expressions (Arg_Mechanism));
while Present (Mname) loop
if No (Formal) then
Error_Pragma_Arg
("too many mechanism associations", Mname);
end if;
Set_Mechanism_Value (Formal, Mname);
Next_Formal (Formal);
Next (Mname);
end loop;
end if;
-- Deal with named entries
if Present (Component_Associations (Arg_Mechanism)) then
Massoc := First (Component_Associations (Arg_Mechanism));
while Present (Massoc) loop
Choice := First (Choices (Massoc));
if Nkind (Choice) /= N_Identifier
or else Present (Next (Choice))
then
Error_Pragma_Arg
("incorrect form for mechanism association",
Massoc);
end if;
Formal := First_Formal (Ent);
loop
if No (Formal) then
Error_Pragma_Arg
("parameter name & not present", Choice);
end if;
if Chars (Choice) = Chars (Formal) then
Set_Mechanism_Value
(Formal, Expression (Massoc));
exit;
end if;
Next_Formal (Formal);
end loop;
Next (Massoc);
end loop;
end if;
end if;
end;
end if;
-- Process First_Optional_Parameter argument if present. We have
-- already checked that this is only allowed for the Import case.
if Present (Arg_First_Optional_Parameter) then
if Nkind (Arg_First_Optional_Parameter) /= N_Identifier then
Error_Pragma_Arg
("first optional parameter must be formal parameter name",
Arg_First_Optional_Parameter);
end if;
Formal := First_Formal (Ent);
loop
if No (Formal) then
Error_Pragma_Arg
("specified formal parameter& not found",
Arg_First_Optional_Parameter);
end if;
exit when Chars (Formal) =
Chars (Arg_First_Optional_Parameter);
Next_Formal (Formal);
end loop;
Set_First_Optional_Parameter (Ent, Formal);
-- Check specified and all remaining formals have right form
while Present (Formal) loop
if Ekind (Formal) /= E_In_Parameter then
Error_Msg_NE
("optional formal& is not of mode in!",
Arg_First_Optional_Parameter, Formal);
else
Dval := Default_Value (Formal);
if not Present (Dval) then
Error_Msg_NE
("optional formal& does not have default value!",
Arg_First_Optional_Parameter, Formal);
elsif Compile_Time_Known_Value_Or_Aggr (Dval) then
null;
else
Error_Msg_NE
("default value for optional formal& is non-static!",
Arg_First_Optional_Parameter, Formal);
end if;
end if;
Set_Is_Optional_Parameter (Formal);
Next_Formal (Formal);
end loop;
end if;
end Process_Extended_Import_Export_Subprogram_Pragma;
--------------------------
-- Process_Generic_List --
--------------------------
procedure Process_Generic_List is
Arg : Node_Id;
Exp : Node_Id;
begin
GNAT_Pragma;
Check_No_Identifiers;
Check_At_Least_N_Arguments (1);
Arg := Arg1;
while Present (Arg) loop
Exp := Expression (Arg);
Analyze (Exp);
if not Is_Entity_Name (Exp)
or else
(not Is_Generic_Instance (Entity (Exp))
and then
not Is_Generic_Unit (Entity (Exp)))
then
Error_Pragma_Arg
("pragma% argument must be name of generic unit/instance",
Arg);
end if;
Next (Arg);
end loop;
end Process_Generic_List;
---------------------------------
-- Process_Import_Or_Interface --
---------------------------------
procedure Process_Import_Or_Interface is
C : Convention_Id;
Def_Id : Entity_Id;
Hom_Id : Entity_Id;
begin
Process_Convention (C, Def_Id);
Kill_Size_Check_Code (Def_Id);
Note_Possible_Modification (Expression (Arg2));
if Ekind (Def_Id) = E_Variable
or else
Ekind (Def_Id) = E_Constant
then
-- User initialization is not allowed for imported object, but
-- the object declaration may contain a default initialization,
-- that will be discarded.
if Present (Expression (Parent (Def_Id)))
and then Comes_From_Source (Expression (Parent (Def_Id)))
then
Error_Msg_Sloc := Sloc (Def_Id);
Error_Pragma_Arg
("no initialization allowed for declaration of& #",
"\imported entities cannot be initialized ('R'M' 'B.1(24))",
Arg2);
else
Set_Imported (Def_Id);
Set_Is_Public (Def_Id);
Process_Interface_Name (Def_Id, Arg3, Arg4);
end if;
elsif Is_Subprogram (Def_Id)
or else Is_Generic_Subprogram (Def_Id)
then
-- If the name is overloaded, pragma applies to all of the
-- denoted entities in the same declarative part.
Hom_Id := Def_Id;
while Present (Hom_Id) loop
Def_Id := Get_Base_Subprogram (Hom_Id);
-- Ignore inherited subprograms because the pragma will
-- apply to the parent operation, which is the one called.
if Is_Overloadable (Def_Id)
and then Present (Alias (Def_Id))
then
null;
-- Verify that the homonym is in the same declarative
-- part (not just the same scope).
elsif Parent (Unit_Declaration_Node (Def_Id)) /= Parent (N)
and then Nkind (Parent (N)) /= N_Compilation_Unit_Aux
then
exit;
else
Set_Imported (Def_Id);
-- If Import intrinsic, set intrinsic flag
-- and verify that it is known as such.
if C = Convention_Intrinsic then
Set_Is_Intrinsic_Subprogram (Def_Id);
Check_Intrinsic_Subprogram
(Def_Id, Expression (Arg2));
end if;
-- All interfaced procedures need an external
-- symbol created for them since they are
-- always referenced from another object file.
Set_Is_Public (Def_Id);
Set_Has_Completion (Def_Id);
Process_Interface_Name (Def_Id, Arg3, Arg4);
end if;
if Is_Compilation_Unit (Hom_Id) then
-- Its possible homonyms are not affected by the pragma.
-- Such homonyms might be present in the context of other
-- units being compiled.
exit;
else
Hom_Id := Homonym (Hom_Id);
end if;
end loop;
-- When the convention is Java, we also allow Import to be given
-- for packages, exceptions, and record components.
elsif C = Convention_Java
and then (Ekind (Def_Id) = E_Package
or else Ekind (Def_Id) = E_Exception
or else Nkind (Parent (Def_Id)) = N_Component_Declaration)
then
Set_Imported (Def_Id);
Set_Is_Public (Def_Id);
Process_Interface_Name (Def_Id, Arg3, Arg4);
else
Error_Pragma_Arg
("second argument of pragma% must be object or subprogram",
Arg2);
end if;
-- If this pragma applies to a compilation unit, then the unit,
-- which is a subprogram, does not require (or allow) a body.
-- We also do not need to elaborate imported procedures.
if Nkind (Parent (N)) = N_Compilation_Unit_Aux then
declare
Cunit : constant Node_Id := Parent (Parent (N));
begin
Set_Body_Required (Cunit, False);
end;
end if;
end Process_Import_Or_Interface;
--------------------
-- Process_Inline --
--------------------
procedure Process_Inline (Active : Boolean) is
Assoc : Node_Id;
Decl : Node_Id;
Subp_Id : Node_Id;
Subp : Entity_Id;
Applies : Boolean;
procedure Make_Inline (Subp : Entity_Id);
-- Subp is the defining unit name of the subprogram
-- declaration. Set the flag, as well as the flag in the
-- corresponding body, if there is one present.
procedure Set_Inline_Flags (Subp : Entity_Id);
-- Sets Is_Inlined and Has_Pragma_Inline flags for Subp
-----------------
-- Make_Inline --
-----------------
procedure Make_Inline (Subp : Entity_Id) is
Kind : Entity_Kind := Ekind (Subp);
Inner_Subp : Entity_Id := Subp;
begin
if Etype (Subp) = Any_Type then
return;
-- Here we have a candidate for inlining, but we must exclude
-- derived operations. Otherwise we will end up trying to
-- inline a phantom declaration, and the result would be to
-- drag in a body which has no direct inlining associated with
-- it. That would not only be inefficient but would also result
-- in the backend doing cross-unit inlining in cases where it
-- was definitely inappropriate to do so.
-- However, a simple Comes_From_Source test is insufficient,
-- since we do want to allow inlining of generic instances,
-- which also do not come from source. Predefined operators do
-- not come from source but are not inlineable either.
elsif not Comes_From_Source (Subp)
and then not Is_Generic_Instance (Subp)
and then Scope (Subp) /= Standard_Standard
then
Applies := True;
return;
-- The referenced entity must either be the enclosing entity,
-- or an entity declared within the current open scope.
elsif Present (Scope (Subp))
and then Scope (Subp) /= Current_Scope
and then Subp /= Current_Scope
then
Error_Pragma_Arg
("argument of% must be entity in current scope", Assoc);
return;
end if;
-- Processing for procedure, operator or function.
-- If subprogram is aliased (as for an instance) indicate
-- that the renamed entity is inlined.
if Kind = E_Procedure
or else Kind = E_Function
or else Kind = E_Operator
then
while Present (Alias (Inner_Subp)) loop
Inner_Subp := Alias (Inner_Subp);
end loop;
Set_Inline_Flags (Inner_Subp);
Decl := Parent (Parent (Inner_Subp));
if Nkind (Decl) = N_Subprogram_Declaration
and then Present (Corresponding_Body (Decl))
then
Set_Inline_Flags (Corresponding_Body (Decl));
end if;
Applies := True;
-- For a generic subprogram set flag as well, for use at
-- the point of instantiation, to determine whether the
-- body should be generated.
elsif Kind = E_Generic_Procedure
or else Kind = E_Generic_Function
then
Set_Inline_Flags (Subp);
Applies := True;
-- Literals are by definition inlined.
elsif Kind = E_Enumeration_Literal then
null;
-- Anything else is an error
else
Error_Pragma_Arg
("expect subprogram name for pragma%", Assoc);
end if;
end Make_Inline;
----------------------
-- Set_Inline_Flags --
----------------------
procedure Set_Inline_Flags (Subp : Entity_Id) is
begin
if Active then
Set_Is_Inlined (Subp, True);
end if;
if not Has_Pragma_Inline (Subp) then
Set_Has_Pragma_Inline (Subp);
Set_Next_Rep_Item (N, First_Rep_Item (Subp));
Set_First_Rep_Item (Subp, N);
end if;
end Set_Inline_Flags;
-- Start of processing for Process_Inline
begin
Check_No_Identifiers;
Check_At_Least_N_Arguments (1);
if Active then
Inline_Processing_Required := True;
end if;
Assoc := Arg1;
while Present (Assoc) loop
Subp_Id := Expression (Assoc);
Analyze (Subp_Id);
Applies := False;
if Is_Entity_Name (Subp_Id) then
Subp := Entity (Subp_Id);
if Subp = Any_Id then
Applies := True;
else
Make_Inline (Subp);
while Present (Homonym (Subp))
and then Scope (Homonym (Subp)) = Current_Scope
loop
Make_Inline (Homonym (Subp));
Subp := Homonym (Subp);
end loop;
end if;
end if;
if not Applies then
Error_Pragma_Arg
("inappropriate argument for pragma%", Assoc);
end if;
Next (Assoc);
end loop;
end Process_Inline;
----------------------------
-- Process_Interface_Name --
----------------------------
procedure Process_Interface_Name
(Subprogram_Def : Entity_Id;
Ext_Arg : Node_Id;
Link_Arg : Node_Id)
is
Ext_Nam : Node_Id;
Link_Nam : Node_Id;
String_Val : String_Id;
procedure Check_Form_Of_Interface_Name (SN : Node_Id);
-- SN is a string literal node for an interface name. This routine
-- performs some minimal checks that the name is reasonable. In
-- particular that no spaces or other obviously incorrect characters
-- appear. This is only a warning, since any characters are allowed.
procedure Check_Form_Of_Interface_Name (SN : Node_Id) is
S : constant String_Id := Strval (Expr_Value_S (SN));
SL : constant Nat := String_Length (S);
C : Char_Code;
begin
if SL = 0 then
Error_Msg_N ("interface name cannot be null string", SN);
end if;
for J in 1 .. SL loop
C := Get_String_Char (S, J);
if not In_Character_Range (C)
or else Get_Character (C) = ' '
or else Get_Character (C) = ','
then
Error_Msg_N
("?interface name contains illegal character", SN);
end if;
end loop;
end Check_Form_Of_Interface_Name;
-- Start of processing for Process_Interface_Name
begin
if No (Link_Arg) then
if No (Ext_Arg) then
return;
elsif Chars (Ext_Arg) = Name_Link_Name then
Ext_Nam := Empty;
Link_Nam := Expression (Ext_Arg);
else
Check_Optional_Identifier (Ext_Arg, Name_External_Name);
Ext_Nam := Expression (Ext_Arg);
Link_Nam := Empty;
end if;
else
Check_Optional_Identifier (Ext_Arg, Name_External_Name);
Check_Optional_Identifier (Link_Arg, Name_Link_Name);
Ext_Nam := Expression (Ext_Arg);
Link_Nam := Expression (Link_Arg);
end if;
-- Check expressions for external name and link name are static
if Present (Ext_Nam) then
Check_Arg_Is_Static_Expression (Ext_Nam, Standard_String);
Check_Form_Of_Interface_Name (Ext_Nam);
-- Verify that the external name is not the name of a local
-- entity, which would hide the imported one and lead to
-- run-time surprises. The problem can only arise for entities
-- declared in a package body (otherwise the external name is
-- fully qualified and won't conflict).
declare
Nam : Name_Id;
E : Entity_Id;
Par : Node_Id;
begin
if Prag_Id = Pragma_Import then
String_To_Name_Buffer (Strval (Expr_Value_S (Ext_Nam)));
Nam := Name_Find;
E := Entity_Id (Get_Name_Table_Info (Nam));
if Nam /= Chars (Subprogram_Def)
and then Present (E)
and then not Is_Overloadable (E)
and then Is_Immediately_Visible (E)
and then not Is_Imported (E)
and then Ekind (Scope (E)) = E_Package
then
Par := Parent (E);
while Present (Par) loop
if Nkind (Par) = N_Package_Body then
Error_Msg_Sloc := Sloc (E);
Error_Msg_NE
("imported entity is hidden by & declared#",
Ext_Arg, E);
exit;
end if;
Par := Parent (Par);
end loop;
end if;
end if;
end;
end if;
if Present (Link_Nam) then
Check_Arg_Is_Static_Expression (Link_Nam, Standard_String);
Check_Form_Of_Interface_Name (Link_Nam);
end if;
-- If there is no link name, just set the external name
if No (Link_Nam) then
Set_Encoded_Interface_Name
(Get_Base_Subprogram (Subprogram_Def),
Adjust_External_Name_Case (Expr_Value_S (Ext_Nam)));
-- For the Link_Name case, the given literal is preceded by an
-- asterisk, which indicates to GCC that the given name should
-- be taken literally, and in particular that no prepending of
-- underlines should occur, even in systems where this is the
-- normal default.
else
Start_String;
Store_String_Char (Get_Char_Code ('*'));
String_Val := Strval (Expr_Value_S (Link_Nam));
for J in 1 .. String_Length (String_Val) loop
Store_String_Char (Get_String_Char (String_Val, J));
end loop;
Link_Nam :=
Make_String_Literal (Sloc (Link_Nam), End_String);
Set_Encoded_Interface_Name
(Get_Base_Subprogram (Subprogram_Def), Link_Nam);
end if;
end Process_Interface_Name;
-----------------------------------------
-- Process_Interrupt_Or_Attach_Handler --
-----------------------------------------
procedure Process_Interrupt_Or_Attach_Handler is
Arg1_X : constant Node_Id := Expression (Arg1);
Prot_Proc : constant Entity_Id := Entity (Arg1_X);
Prot_Type : constant Entity_Id := Scope (Prot_Proc);
begin
Set_Is_Interrupt_Handler (Prot_Proc);
if Prag_Id = Pragma_Interrupt_Handler
or Prag_Id = Pragma_Attach_Handler
then
Record_Rep_Item (Prot_Type, N);
end if;
end Process_Interrupt_Or_Attach_Handler;
---------------------------------
-- Process_Suppress_Unsuppress --
---------------------------------
procedure Process_Suppress_Unsuppress (Suppress_Case : Boolean) is
C : Check_Id;
E_Id : Node_Id;
E : Entity_Id;
Effective : Boolean;
procedure Suppress_Unsuppress_Echeck (E : Entity_Id; C : Check_Id);
-- Used to suppress a single check on the given entity
procedure Suppress_Unsuppress_Echeck (E : Entity_Id; C : Check_Id) is
begin
-- First set appropriate suppress flags in the entity
case C is
when Access_Check =>
Effective := Suppress_Access_Checks (E);
Set_Suppress_Access_Checks (E, Suppress_Case);
when Accessibility_Check =>
Effective := Suppress_Accessibility_Checks (E);
Set_Suppress_Accessibility_Checks (E, Suppress_Case);
when Discriminant_Check =>
Effective := Suppress_Discriminant_Checks (E);
Set_Suppress_Discriminant_Checks (E, Suppress_Case);
when Division_Check =>
Effective := Suppress_Division_Checks (E);
Set_Suppress_Division_Checks (E, Suppress_Case);
when Elaboration_Check =>
Effective := Suppress_Elaboration_Checks (E);
Set_Suppress_Elaboration_Checks (E, Suppress_Case);
when Index_Check =>
Effective := Suppress_Index_Checks (E);
Set_Suppress_Index_Checks (E, Suppress_Case);
when Length_Check =>
Effective := Suppress_Length_Checks (E);
Set_Suppress_Length_Checks (E, Suppress_Case);
when Overflow_Check =>
Effective := Suppress_Overflow_Checks (E);
Set_Suppress_Overflow_Checks (E, Suppress_Case);
when Range_Check =>
Effective := Suppress_Range_Checks (E);
Set_Suppress_Range_Checks (E, Suppress_Case);
when Storage_Check =>
Effective := Suppress_Storage_Checks (E);
Set_Suppress_Storage_Checks (E, Suppress_Case);
when Tag_Check =>
Effective := Suppress_Tag_Checks (E);
Set_Suppress_Tag_Checks (E, Suppress_Case);
when All_Checks =>
Suppress_Unsuppress_Echeck (E, Access_Check);
Suppress_Unsuppress_Echeck (E, Accessibility_Check);
Suppress_Unsuppress_Echeck (E, Discriminant_Check);
Suppress_Unsuppress_Echeck (E, Division_Check);
Suppress_Unsuppress_Echeck (E, Elaboration_Check);
Suppress_Unsuppress_Echeck (E, Index_Check);
Suppress_Unsuppress_Echeck (E, Length_Check);
Suppress_Unsuppress_Echeck (E, Overflow_Check);
Suppress_Unsuppress_Echeck (E, Range_Check);
Suppress_Unsuppress_Echeck (E, Storage_Check);
Suppress_Unsuppress_Echeck (E, Tag_Check);
end case;
-- If the entity is not declared in the current scope, then we
-- make an entry in the Entity_Suppress table so that the flag
-- will be removed on exit. This entry is only made if the
-- suppress did something (i.e. the flag was not already set).
if Effective and then Scope (E) /= Current_Scope then
Entity_Suppress.Increment_Last;
Entity_Suppress.Table
(Entity_Suppress.Last).Entity := E;
Entity_Suppress.Table
(Entity_Suppress.Last).Check := C;
end if;
-- If this is a first subtype, and the base type is distinct,
-- then also set the suppress flags on the base type.
if Is_First_Subtype (E)
and then Etype (E) /= E
then
Suppress_Unsuppress_Echeck (Etype (E), C);
end if;
end Suppress_Unsuppress_Echeck;
-- Start of processing for Process_Suppress_Unsuppress
begin
-- Suppress/Unsuppress can appear as a configuration pragma,
-- or in a declarative part or a package spec (RM 11.5(5))
if not Is_Configuration_Pragma then
Check_Is_In_Decl_Part_Or_Package_Spec;
end if;
Check_At_Least_N_Arguments (1);
Check_At_Most_N_Arguments (2);
Check_No_Identifier (Arg1);
Check_Arg_Is_Identifier (Arg1);
if not Is_Check_Name (Chars (Expression (Arg1))) then
Error_Pragma_Arg
("argument of pragma% is not valid check name", Arg1);
else
C := Get_Check_Id (Chars (Expression (Arg1)));
end if;
if Arg_Count = 1 then
case C is
when Access_Check =>
Scope_Suppress.Access_Checks := Suppress_Case;
when Accessibility_Check =>
Scope_Suppress.Accessibility_Checks := Suppress_Case;
when Discriminant_Check =>
Scope_Suppress.Discriminant_Checks := Suppress_Case;
when Division_Check =>
Scope_Suppress.Division_Checks := Suppress_Case;
when Elaboration_Check =>
Scope_Suppress.Elaboration_Checks := Suppress_Case;
when Index_Check =>
Scope_Suppress.Index_Checks := Suppress_Case;
when Length_Check =>
Scope_Suppress.Length_Checks := Suppress_Case;
when Overflow_Check =>
Scope_Suppress.Overflow_Checks := Suppress_Case;
when Range_Check =>
Scope_Suppress.Range_Checks := Suppress_Case;
when Storage_Check =>
Scope_Suppress.Storage_Checks := Suppress_Case;
when Tag_Check =>
Scope_Suppress.Tag_Checks := Suppress_Case;
when All_Checks =>
Scope_Suppress := (others => Suppress_Case);
end case;
-- Case of two arguments present, where the check is
-- suppressed for a specified entity (given as the second
-- argument of the pragma)
else
Check_Optional_Identifier (Arg2, Name_On);
E_Id := Expression (Arg2);
Analyze (E_Id);
if not Is_Entity_Name (E_Id) then
Error_Pragma_Arg
("second argument of pragma% must be entity name", Arg2);
end if;
E := Entity (E_Id);
if E = Any_Id then
return;
else
loop
Suppress_Unsuppress_Echeck (E, C);
if Is_Generic_Instance (E)
and then Is_Subprogram (E)
and then Present (Alias (E))
then
Suppress_Unsuppress_Echeck (Alias (E), C);
end if;
if C = Elaboration_Check and then Suppress_Case then
Set_Suppress_Elaboration_Warnings (E);
end if;
-- If we are within a package specification, the
-- pragma only applies to homonyms in the same scope.
exit when No (Homonym (E))
or else (Scope (Homonym (E)) /= Current_Scope
and then Ekind (Current_Scope) = E_Package
and then not In_Package_Body (Current_Scope));
E := Homonym (E);
end loop;
end if;
end if;
end Process_Suppress_Unsuppress;
------------------
-- Set_Exported --
------------------
procedure Set_Exported (E : Entity_Id; Arg : Node_Id) is
begin
if Is_Imported (E) then
Error_Pragma_Arg
("cannot export entity& that was previously imported", Arg);
elsif Present (Address_Clause (E)) then
Error_Pragma_Arg
("cannot export entity& that has an address clause", Arg);
end if;
Set_Is_Exported (E);
-- Deal with exporting non-library level entity
if not Is_Library_Level_Entity (E) then
-- Not allowed at all for subprograms
if Is_Subprogram (E) then
Error_Pragma_Arg ("local subprogram& cannot be exported", Arg);
-- Otherwise set public and statically allocated
else
Set_Is_Public (E);
Set_Is_Statically_Allocated (E);
end if;
end if;
if Inside_A_Generic then
Error_Msg_NE
("all instances of& will have the same external name?", Arg, E);
end if;
end Set_Exported;
----------------------------------------------
-- Set_Extended_Import_Export_External_Name --
----------------------------------------------
procedure Set_Extended_Import_Export_External_Name
(Internal_Ent : Entity_Id;
Arg_External : Node_Id)
is
Old_Name : constant Node_Id := Interface_Name (Internal_Ent);
New_Name : Node_Id;
begin
if No (Arg_External) then
return;
elsif Nkind (Arg_External) = N_String_Literal then
if String_Length (Strval (Arg_External)) = 0 then
return;
else
New_Name := Adjust_External_Name_Case (Arg_External);
end if;
elsif Nkind (Arg_External) = N_Identifier then
New_Name := Get_Default_External_Name (Arg_External);
else
Error_Pragma_Arg
("incorrect form for External parameter for pragma%",
Arg_External);
end if;
-- If we already have an external name set (by a prior normal
-- Import or Export pragma), then the external names must match
if Present (Interface_Name (Internal_Ent)) then
declare
S1 : constant String_Id := Strval (Old_Name);
S2 : constant String_Id := Strval (New_Name);
procedure Mismatch;
-- Called if names do not match
procedure Mismatch is
begin
Error_Msg_Sloc := Sloc (Old_Name);
Error_Pragma_Arg
("external name does not match that given #",
Arg_External);
end Mismatch;
begin
if String_Length (S1) /= String_Length (S2) then
Mismatch;
else
for J in 1 .. String_Length (S1) loop
if Get_String_Char (S1, J) /= Get_String_Char (S2, J) then
Mismatch;
end if;
end loop;
end if;
end;
-- Otherwise set the given name
else
Set_Encoded_Interface_Name (Internal_Ent, New_Name);
end if;
end Set_Extended_Import_Export_External_Name;
------------------
-- Set_Imported --
------------------
procedure Set_Imported (E : Entity_Id) is
begin
Error_Msg_Sloc := Sloc (E);
if Is_Exported (E) or else Is_Imported (E) then
Error_Msg_NE ("import of& declared# not allowed", N, E);
if Is_Exported (E) then
Error_Msg_N ("\entity was previously exported", N);
else
Error_Msg_N ("\entity was previously imported", N);
end if;
Error_Pragma ("\(pragma% applies to all previous entities)");
else
Set_Is_Imported (E);
-- If the entity is an object that is not at the library
-- level, then it is statically allocated. We do not worry
-- about objects with address clauses in this context since
-- they are not really imported in the linker sense.
if Is_Object (E)
and then not Is_Library_Level_Entity (E)
and then No (Address_Clause (E))
then
Set_Is_Statically_Allocated (E);
end if;
end if;
end Set_Imported;
-------------------------
-- Set_Mechanism_Value --
-------------------------
-- Note: the mechanism name has not been analyzed (and cannot indeed
-- be analyzed, since it is semantic nonsense), so we get it in the
-- exact form created by the parser.
procedure Set_Mechanism_Value (Ent : Entity_Id; Mech_Name : Node_Id) is
Class : Node_Id;
Param : Node_Id;
procedure Bad_Class;
-- Signal bad descriptor class name
procedure Bad_Mechanism;
-- Signal bad mechanism name
procedure Bad_Class is
begin
Error_Pragma_Arg ("unrecognized descriptor class name", Class);
end Bad_Class;
procedure Bad_Mechanism is
begin
Error_Pragma_Arg ("unrecognized mechanism name", Mech_Name);
end Bad_Mechanism;
-- Start of processing for Set_Mechanism_Value
begin
if Mechanism (Ent) /= Default_Mechanism then
Error_Msg_NE
("mechanism for & has already been set", Mech_Name, Ent);
end if;
-- MECHANISM_NAME ::= value | reference | descriptor
if Nkind (Mech_Name) = N_Identifier then
if Chars (Mech_Name) = Name_Value then
Set_Mechanism (Ent, By_Copy);
return;
elsif Chars (Mech_Name) = Name_Reference then
Set_Mechanism (Ent, By_Reference);
return;
elsif Chars (Mech_Name) = Name_Descriptor then
Check_VMS (Mech_Name);
Set_Mechanism (Ent, By_Descriptor);
return;
elsif Chars (Mech_Name) = Name_Copy then
Error_Pragma_Arg
("bad mechanism name, Value assumed", Mech_Name);
else
Bad_Mechanism;
end if;
-- MECHANISM_NAME ::= descriptor (CLASS_NAME)
-- CLASS_NAME ::= ubs | ubsb | uba | s | sb | a | nca
-- Note: this form is parsed as an indexed component
elsif Nkind (Mech_Name) = N_Indexed_Component then
Class := First (Expressions (Mech_Name));
if Nkind (Prefix (Mech_Name)) /= N_Identifier
or else Chars (Prefix (Mech_Name)) /= Name_Descriptor
or else Present (Next (Class))
then
Bad_Mechanism;
end if;
-- MECHANISM_NAME ::= descriptor (Class => CLASS_NAME)
-- CLASS_NAME ::= ubs | ubsb | uba | s | sb | a | nca
-- Note: this form is parsed as a function call
elsif Nkind (Mech_Name) = N_Function_Call then
Param := First (Parameter_Associations (Mech_Name));
if Nkind (Name (Mech_Name)) /= N_Identifier
or else Chars (Name (Mech_Name)) /= Name_Descriptor
or else Present (Next (Param))
or else No (Selector_Name (Param))
or else Chars (Selector_Name (Param)) /= Name_Class
then
Bad_Mechanism;
else
Class := Explicit_Actual_Parameter (Param);
end if;
else
Bad_Mechanism;
end if;
-- Fall through here with Class set to descriptor class name
Check_VMS (Mech_Name);
if Nkind (Class) /= N_Identifier then
Bad_Class;
elsif Chars (Class) = Name_UBS then
Set_Mechanism (Ent, By_Descriptor_UBS);
elsif Chars (Class) = Name_UBSB then
Set_Mechanism (Ent, By_Descriptor_UBSB);
elsif Chars (Class) = Name_UBA then
Set_Mechanism (Ent, By_Descriptor_UBA);
elsif Chars (Class) = Name_S then
Set_Mechanism (Ent, By_Descriptor_S);
elsif Chars (Class) = Name_SB then
Set_Mechanism (Ent, By_Descriptor_SB);
elsif Chars (Class) = Name_A then
Set_Mechanism (Ent, By_Descriptor_A);
elsif Chars (Class) = Name_NCA then
Set_Mechanism (Ent, By_Descriptor_NCA);
else
Bad_Class;
end if;
end Set_Mechanism_Value;
-- Start of processing for Analyze_Pragma
begin
if not Is_Pragma_Name (Chars (N)) then
Error_Pragma ("unrecognized pragma%!?");
else
Prag_Id := Get_Pragma_Id (Chars (N));
end if;
-- Preset arguments
Arg1 := Empty;
Arg2 := Empty;
Arg3 := Empty;
Arg4 := Empty;
if Present (Pragma_Argument_Associations (N)) then
Arg1 := First (Pragma_Argument_Associations (N));
if Present (Arg1) then
Arg2 := Next (Arg1);
if Present (Arg2) then
Arg3 := Next (Arg2);
if Present (Arg3) then
Arg4 := Next (Arg3);
end if;
end if;
end if;
end if;
-- Count number of arguments
declare
Arg_Node : Node_Id;
begin
Arg_Count := 0;
Arg_Node := Arg1;
while Present (Arg_Node) loop
Arg_Count := Arg_Count + 1;
Next (Arg_Node);
end loop;
end;
-- An enumeration type defines the pragmas that are supported by the
-- implementation. Get_Pragma_Id (in package Prag) transorms a name
-- into the corresponding enumeration value for the following case.
case Prag_Id is
-----------------
-- Abort_Defer --
-----------------
-- pragma Abort_Defer;
when Pragma_Abort_Defer =>
GNAT_Pragma;
Check_Arg_Count (0);
-- The only required semantic processing is to check the
-- placement. This pragma must appear at the start of the
-- statement sequence of a handled sequence of statements.
if Nkind (Parent (N)) /= N_Handled_Sequence_Of_Statements
or else N /= First (Statements (Parent (N)))
then
Pragma_Misplaced;
end if;
------------
-- Ada_83 --
------------
-- pragma Ada_83;
-- Note: this pragma also has some specific processing in Par.Prag
-- because we want to set the Ada 83 mode switch during parsing.
when Pragma_Ada_83 =>
GNAT_Pragma;
Ada_83 := True;
Ada_95 := False;
Check_Arg_Count (0);
------------
-- Ada_95 --
------------
-- pragma Ada_95;
-- Note: this pragma also has some specific processing in Par.Prag
-- because we want to set the Ada 83 mode switch during parsing.
when Pragma_Ada_95 =>
GNAT_Pragma;
Ada_83 := False;
Ada_95 := True;
Check_Arg_Count (0);
----------------------
-- All_Calls_Remote --
----------------------
-- pragma All_Calls_Remote [(library_package_NAME)];
when Pragma_All_Calls_Remote => All_Calls_Remote : declare
Lib_Entity : Entity_Id;
begin
Check_Ada_83_Warning;
Check_Valid_Library_Unit_Pragma;
if Nkind (N) = N_Null_Statement then
return;
end if;
Lib_Entity := Find_Lib_Unit_Name;
-- This pragma should only apply to a RCI unit (RM E.2.3(23)).
if Present (Lib_Entity)
and then not Debug_Flag_U
then
if not Is_Remote_Call_Interface (Lib_Entity) then
Error_Pragma ("pragma% only apply to rci unit");
-- Set flag for entity of the library unit
else
Set_Has_All_Calls_Remote (Lib_Entity);
end if;
end if;
end All_Calls_Remote;
--------------
-- Annotate --
--------------
-- pragma Annotate (IDENTIFIER {, ARG});
-- ARG ::= NAME | EXPRESSION
when Pragma_Annotate => Annotate : begin
GNAT_Pragma;
Check_At_Least_N_Arguments (1);
Check_Arg_Is_Identifier (Arg1);
declare
Arg : Node_Id := Arg2;
Exp : Node_Id;
begin
while Present (Arg) loop
Exp := Expression (Arg);
Analyze (Exp);
if Is_Entity_Name (Exp) then
null;
elsif Nkind (Exp) = N_String_Literal then
Resolve (Exp, Standard_String);
elsif Is_Overloaded (Exp) then
Error_Pragma_Arg ("ambiguous argument for pragma%", Exp);
else
Resolve (Exp, Etype (Exp));
end if;
Next (Arg);
end loop;
end;
end Annotate;
------------
-- Assert --
------------
-- pragma Assert (Boolean_EXPRESSION [, static_string_EXPRESSION]);
when Pragma_Assert =>
GNAT_Pragma;
Check_No_Identifiers;
if Arg_Count > 1 then
Check_Arg_Count (2);
Check_Arg_Is_Static_Expression (Arg2, Standard_String);
end if;
-- If expansion is active and assertions are inactive, then
-- we rewrite the Assertion as:
-- if False and then condition then
-- null;
-- end if;
-- The reason we do this rewriting during semantic analysis
-- rather than as part of normal expansion is that we cannot
-- analyze and expand the code for the boolean expression
-- directly, or it may cause insertion of actions that would
-- escape the attempt to suppress the assertion code.
if Expander_Active and not Assertions_Enabled then
Rewrite (N,
Make_If_Statement (Loc,
Condition =>
Make_And_Then (Loc,
Left_Opnd => New_Occurrence_Of (Standard_False, Loc),
Right_Opnd => Get_Pragma_Arg (Arg1)),
Then_Statements => New_List (
Make_Null_Statement (Loc))));
Analyze (N);
-- Otherwise (if assertions are enabled, or if we are not
-- operating with expansion active), then we just analyze
-- and resolve the expression.
else
Analyze_And_Resolve (Expression (Arg1), Any_Boolean);
end if;
---------------
-- AST_Entry --
---------------
-- pragma AST_Entry (entry_IDENTIFIER);
when Pragma_AST_Entry => AST_Entry : declare
Ent : Node_Id;
begin
GNAT_Pragma;
Check_VMS (N);
Check_Arg_Count (1);
Check_No_Identifiers;
Check_Arg_Is_Local_Name (Arg1);
Ent := Entity (Expression (Arg1));
-- Note: the implementation of the AST_Entry pragma could handle
-- the entry family case fine, but for now we are consistent with
-- the DEC rules, and do not allow the pragma, which of course
-- has the effect of also forbidding the attribute.
if Ekind (Ent) /= E_Entry then
Error_Pragma_Arg
("pragma% argument must be simple entry name", Arg1);
elsif Is_AST_Entry (Ent) then
Error_Pragma_Arg
("duplicate % pragma for entry", Arg1);
elsif Has_Homonym (Ent) then
Error_Pragma_Arg
("pragma% argument cannot specify overloaded entry", Arg1);
else
declare
FF : constant Entity_Id := First_Formal (Ent);
begin
if Present (FF) then
if Present (Next_Formal (FF)) then
Error_Pragma_Arg
("entry for pragma% can have only one argument",
Arg1);
elsif Parameter_Mode (FF) /= E_In_Parameter then
Error_Pragma_Arg
("entry parameter for pragma% must have mode IN",
Arg1);
end if;
end if;
end;
Set_Is_AST_Entry (Ent);
end if;
end AST_Entry;
------------------
-- Asynchronous --
------------------
-- pragma Asynchronous (LOCAL_NAME);
when Pragma_Asynchronous => Asynchronous : declare
Nm : Entity_Id;
C_Ent : Entity_Id;
L : List_Id;
S : Node_Id;
N : Node_Id;
Formal : Entity_Id;
procedure Process_Async_Pragma;
-- Common processing for procedure and access-to-procedure case
--------------------------
-- Process_Async_Pragma --
--------------------------
procedure Process_Async_Pragma is
begin
if not Present (L) then
Set_Is_Asynchronous (Nm);
return;
end if;
-- The formals should be of mode IN (RM E.4.1(6))
S := First (L);
while Present (S) loop
Formal := Defining_Identifier (S);
if Nkind (Formal) = N_Defining_Identifier
and then Ekind (Formal) /= E_In_Parameter
then
Error_Pragma_Arg
("pragma% procedure can only have IN parameter",
Arg1);
end if;
Next (S);
end loop;
Set_Is_Asynchronous (Nm);
end Process_Async_Pragma;
-- Start of processing for pragma Asynchronous
begin
Check_Ada_83_Warning;
Check_No_Identifiers;
Check_Arg_Count (1);
Check_Arg_Is_Local_Name (Arg1);
if Debug_Flag_U then
return;
end if;
C_Ent := Cunit_Entity (Current_Sem_Unit);
Analyze (Expression (Arg1));
Nm := Entity (Expression (Arg1));
if not Is_Remote_Call_Interface (C_Ent)
and then not Is_Remote_Types (C_Ent)
then
-- This pragma should only appear in an RCI or Remote Types
-- unit (RM E.4.1(4))
Error_Pragma
("pragma% not in Remote_Call_Interface or " &
"Remote_Types unit");
end if;
if Ekind (Nm) = E_Procedure
and then Nkind (Parent (Nm)) = N_Procedure_Specification
then
if not Is_Remote_Call_Interface (Nm) then
Error_Pragma_Arg
("pragma% cannot be applied on non-remote procedure",
Arg1);
end if;
L := Parameter_Specifications (Parent (Nm));
Process_Async_Pragma;
return;
elsif Ekind (Nm) = E_Function then
Error_Pragma_Arg
("pragma% cannot be applied to function", Arg1);
elsif Ekind (Nm) = E_Record_Type
and then Present (Corresponding_Remote_Type (Nm))
then
N := Declaration_Node (Corresponding_Remote_Type (Nm));
if Nkind (N) = N_Full_Type_Declaration
and then Nkind (Type_Definition (N)) =
N_Access_Procedure_Definition
then
L := Parameter_Specifications (Type_Definition (N));
Process_Async_Pragma;
else
Error_Pragma_Arg
("pragma% cannot reference access-to-function type",
Arg1);
end if;
-- Only other possibility is Access-to-class-wide type
elsif Is_Access_Type (Nm)
and then Is_Class_Wide_Type (Designated_Type (Nm))
then
Check_First_Subtype (Arg1);
Set_Is_Asynchronous (Nm);
if Expander_Active then
RACW_Type_Is_Asynchronous (Nm);
end if;
else
Error_Pragma_Arg ("inappropriate argument for pragma%", Arg1);
end if;
end Asynchronous;
------------
-- Atomic --
------------
-- pragma Atomic (LOCAL_NAME);
when Pragma_Atomic =>
Process_Atomic_Shared_Volatile;
-----------------------
-- Atomic_Components --
-----------------------
-- pragma Atomic_Components (array_LOCAL_NAME);
-- This processing is shared by Volatile_Components
when Pragma_Atomic_Components |
Pragma_Volatile_Components =>
Atomic_Components : declare
E_Id : Node_Id;
E : Entity_Id;
D : Node_Id;
K : Node_Kind;
begin
GNAT_Pragma;
Check_Ada_83_Warning;
Check_No_Identifiers;
Check_Arg_Count (1);
Check_Arg_Is_Local_Name (Arg1);
E_Id := Expression (Arg1);
if Etype (E_Id) = Any_Type then
return;
end if;
E := Entity (E_Id);
if Rep_Item_Too_Early (E, N)
or else
Rep_Item_Too_Late (E, N)
then
return;
end if;
D := Declaration_Node (E);
K := Nkind (D);
if (K = N_Full_Type_Declaration and then Is_Array_Type (E))
or else
((Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
and then Nkind (D) = N_Object_Declaration
and then Nkind (Object_Definition (D)) =
N_Constrained_Array_Definition)
then
-- The flag is set on the object, or on the base type
if Nkind (D) /= N_Object_Declaration then
E := Base_Type (E);
end if;
Set_Has_Volatile_Components (E);
if Prag_Id = Pragma_Atomic_Components then
Set_Has_Atomic_Components (E);
if Is_Packed (E) then
Set_Is_Packed (E, False);
Error_Pragma_Arg
("?Pack canceled, cannot pack atomic components",
Arg1);
end if;
end if;
else
Error_Pragma_Arg ("inappropriate entity for pragma%", Arg1);
end if;
end Atomic_Components;
--------------------
-- Attach_Handler --
--------------------
-- pragma Attach_Handler (handler_NAME, EXPRESSION);
when Pragma_Attach_Handler =>
Check_Ada_83_Warning;
Check_No_Identifiers;
Check_Arg_Count (2);
Check_Interrupt_Or_Attach_Handler;
Analyze_And_Resolve (Expression (Arg2), RTE (RE_Interrupt_Id));
Process_Interrupt_Or_Attach_Handler;
--------------------
-- C_Pass_By_Copy --
--------------------
-- pragma C_Pass_By_Copy ([Max_Size =>] static_integer_EXPRESSION);
when Pragma_C_Pass_By_Copy => C_Pass_By_Copy : declare
Arg : Node_Id;
Val : Uint;
begin
GNAT_Pragma;
Check_Valid_Configuration_Pragma;
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, "max_size");
Arg := Expression (Arg1);
Check_Arg_Is_Static_Expression (Arg, Any_Integer);
Val := Expr_Value (Arg);
if Val <= 0 then
Error_Pragma_Arg
("maximum size for pragma% must be positive", Arg1);
elsif UI_Is_In_Int_Range (Val) then
Default_C_Record_Mechanism := UI_To_Int (Val);
-- If a giant value is given, Int'Last will do well enough.
-- If sometime someone complains that a record larger than
-- two gigabytes is not copied, we will worry about it then!
else
Default_C_Record_Mechanism := Mechanism_Type'Last;
end if;
end C_Pass_By_Copy;
-------------
-- Comment --
-------------
-- pragma Comment (static_string_EXPRESSION)
-- Processing for pragma Comment shares the circuitry for
-- pragma Ident. The only differences are that Ident enforces
-- a limit of 31 characters on its argument, and also enforces
-- limitations on placement for DEC compatibility. Pragma
-- Comment shares neither of these restrictions.
-------------------
-- Common_Object --
-------------------
-- pragma Common_Object (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL]
-- [, [Size =>] EXTERNAL_SYMBOL]);
-- Processing for this pragma is shared with Psect_Object
----------------------------
-- Complex_Representation --
----------------------------
-- pragma Complex_Representation ([Entity =>] LOCAL_NAME);
when Pragma_Complex_Representation => Complex_Representation : declare
E_Id : Entity_Id;
E : Entity_Id;
Ent : Entity_Id;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Arg_Is_Local_Name (Arg1);
E_Id := Expression (Arg1);
if Etype (E_Id) = Any_Type then
return;
end if;
E := Entity (E_Id);
if not Is_Record_Type (E) then
Error_Pragma_Arg
("argument for pragma% must be record type", Arg1);
end if;
Ent := First_Entity (E);
if No (Ent)
or else No (Next_Entity (Ent))
or else Present (Next_Entity (Next_Entity (Ent)))
or else not Is_Floating_Point_Type (Etype (Ent))
or else Etype (Ent) /= Etype (Next_Entity (Ent))
then
Error_Pragma_Arg
("record for pragma% must have two fields of same fpt type",
Arg1);
else
Set_Has_Complex_Representation (Base_Type (E));
end if;
end Complex_Representation;
-------------------------
-- Component_Alignment --
-------------------------
-- pragma Component_Alignment (
-- [Form =>] ALIGNMENT_CHOICE
-- [, [Name =>] type_LOCAL_NAME]);
--
-- ALIGNMENT_CHOICE ::=
-- Component_Size
-- | Component_Size_4
-- | Storage_Unit
-- | Default
when Pragma_Component_Alignment => Component_AlignmentP : declare
Args : Args_List (1 .. 2);
Names : Name_List (1 .. 2) := (
Name_Form,
Name_Name);
Form : Node_Id renames Args (1);
Name : Node_Id renames Args (2);
Atype : Component_Alignment_Kind;
Typ : Entity_Id;
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
if No (Form) then
Error_Pragma ("missing Form argument for pragma%");
end if;
Check_Arg_Is_Identifier (Form);
-- Get proper alignment, note that Default = Component_Size
-- on all machines we have so far, and we want to set this
-- value rather than the default value to indicate that it
-- has been explicitly set (and thus will not get overridden
-- by the default component alignment for the current scope)
if Chars (Form) = Name_Component_Size then
Atype := Calign_Component_Size;
elsif Chars (Form) = Name_Component_Size_4 then
Atype := Calign_Component_Size_4;
elsif Chars (Form) = Name_Default then
Atype := Calign_Component_Size;
elsif Chars (Form) = Name_Storage_Unit then
Atype := Calign_Storage_Unit;
else
Error_Pragma_Arg
("invalid Form parameter for pragma%", Form);
end if;
-- Case with no name, supplied, affects scope table entry
if No (Name) then
Scope_Stack.Table
(Scope_Stack.Last).Component_Alignment_Default := Atype;
-- Case of name supplied
else
Check_Arg_Is_Local_Name (Name);
Find_Type (Name);
Typ := Entity (Name);
if Typ = Any_Type
or else Rep_Item_Too_Early (Typ, N)
then
return;
else
Typ := Underlying_Type (Typ);
end if;
if not Is_Record_Type (Typ)
and then not Is_Array_Type (Typ)
then
Error_Pragma_Arg
("Name parameter of pragma% must identify record or " &
"array type", Name);
end if;
-- An explicit Component_Alignment pragma overrides an
-- implicit pragma Pack, but not an explicit one.
if not Has_Pragma_Pack (Base_Type (Typ)) then
Set_Is_Packed (Base_Type (Typ), False);
Set_Component_Alignment (Base_Type (Typ), Atype);
end if;
end if;
end Component_AlignmentP;
----------------
-- Controlled --
----------------
-- pragma Controlled (first_subtype_LOCAL_NAME);
when Pragma_Controlled => Controlled : declare
Arg : Node_Id;
begin
Check_No_Identifiers;
Check_Arg_Count (1);
Check_Arg_Is_Local_Name (Arg1);
Arg := Expression (Arg1);
if not Is_Entity_Name (Arg)
or else not Is_Access_Type (Entity (Arg))
then
Error_Pragma_Arg ("pragma% requires access type", Arg1);
else
Set_Has_Pragma_Controlled (Base_Type (Entity (Arg)));
end if;
end Controlled;
----------------
-- Convention --
----------------
-- pragma Convention ([Convention =>] convention_IDENTIFIER,
-- [Entity =>] LOCAL_NAME);
when Pragma_Convention => Convention : declare
C : Convention_Id;
E : Entity_Id;
begin
Check_Ada_83_Warning;
Check_Arg_Count (2);
Process_Convention (C, E);
end Convention;
---------------
-- CPP_Class --
---------------
-- pragma CPP_Class ([Entity =>] local_NAME)
when Pragma_CPP_Class => CPP_Class : declare
Arg : Node_Id;
Typ : Entity_Id;
Default_DTC : Entity_Id := Empty;
VTP_Type : constant Entity_Id := RTE (RE_Vtable_Ptr);
C : Entity_Id;
Tag_C : Entity_Id;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Arg_Is_Local_Name (Arg1);
Arg := Expression (Arg1);
Analyze (Arg);
if Etype (Arg) = Any_Type then
return;
end if;
if not Is_Entity_Name (Arg)
or else not Is_Type (Entity (Arg))
then
Error_Pragma_Arg ("pragma% requires a type mark", Arg1);
end if;
Typ := Entity (Arg);
if not Is_Record_Type (Typ) then
Error_Pragma_Arg ("pragma% applicable to a record, "
& "tagged record or record extension", Arg1);
end if;
Default_DTC := First_Component (Typ);
while Present (Default_DTC)
and then Etype (Default_DTC) /= VTP_Type
loop
Next_Component (Default_DTC);
end loop;
-- Case of non tagged type
if not Is_Tagged_Type (Typ) then
Set_Is_CPP_Class (Typ);
if Present (Default_DTC) then
Error_Pragma_Arg
("only tagged records can contain vtable pointers", Arg1);
end if;
-- Case of tagged type with no vtable ptr
-- What is test for Typ = Root_Typ (Typ) about here ???
elsif Is_Tagged_Type (Typ)
and then Typ = Root_Type (Typ)
and then No (Default_DTC)
then
Error_Pragma_Arg
("a cpp_class must contain a vtable pointer", Arg1);
-- Tagged type that has a vtable ptr
elsif Present (Default_DTC) then
Set_Is_CPP_Class (Typ);
Set_Is_Limited_Record (Typ);
Set_Is_Tag (Default_DTC);
Set_DT_Entry_Count (Default_DTC, No_Uint);
-- Since a CPP type has no direct link to its associated tag
-- most tags checks cannot be performed
Set_Suppress_Tag_Checks (Typ);
Set_Suppress_Tag_Checks (Class_Wide_Type (Typ));
-- Get rid of the _tag component when there was one.
-- It is only useful for regular tagged types
if Expander_Active and then Typ = Root_Type (Typ) then
Tag_C := Tag_Component (Typ);
C := First_Entity (Typ);
if C = Tag_C then
Set_First_Entity (Typ, Next_Entity (Tag_C));
else
while Next_Entity (C) /= Tag_C loop
Next_Entity (C);
end loop;
Set_Next_Entity (C, Next_Entity (Tag_C));
end if;
end if;
end if;
end CPP_Class;
---------------------
-- CPP_Constructor --
---------------------
-- pragma CPP_Constructor ([Entity =>] LOCAL_NAME);
when Pragma_CPP_Constructor => CPP_Constructor : declare
Id : Entity_Id;
Def_Id : Entity_Id;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Arg_Is_Local_Name (Arg1);
Id := Expression (Arg1);
Find_Program_Unit_Name (Id);
-- If we did not find the name, we are done
if Etype (Id) = Any_Type then
return;
end if;
Def_Id := Entity (Id);
if Ekind (Def_Id) = E_Function
and then Is_Class_Wide_Type (Etype (Def_Id))
and then Is_CPP_Class (Etype (Etype (Def_Id)))
then
-- What the heck is this??? this pragma allows only 1 arg
if Arg_Count >= 2 then
Check_At_Most_N_Arguments (3);
Process_Interface_Name (Def_Id, Arg2, Arg3);
end if;
if No (Parameter_Specifications (Parent (Def_Id))) then
Set_Has_Completion (Def_Id);
Set_Is_Constructor (Def_Id);
else
Error_Pragma_Arg
("non-default constructors not implemented", Arg1);
end if;
else
Error_Pragma_Arg
("pragma% requires function returning a 'C'P'P_Class type",
Arg1);
end if;
end CPP_Constructor;
-----------------
-- CPP_Virtual --
-----------------
-- pragma CPP_Virtual
-- [Entity =>] LOCAL_NAME
-- [ [Vtable_Ptr =>] LOCAL_NAME,
-- [Position =>] static_integer_EXPRESSION]);
when Pragma_CPP_Virtual => CPP_Virtual : declare
Arg : Node_Id;
Typ : Entity_Id;
Subp : Entity_Id;
VTP_Type : constant Entity_Id := RTE (RE_Vtable_Ptr);
DTC : Entity_Id;
V : Uint;
begin
GNAT_Pragma;
if Arg_Count = 3 then
Check_Optional_Identifier (Arg2, "vtable_ptr");
-- We allow Entry_Count as well as Position for the third
-- parameter for back compatibility with versions of GNAT
-- before version 3.12. The documentation has always said
-- Position, but the code up to 3.12 said Entry_Count.
if Chars (Arg3) /= Name_Position then
Check_Optional_Identifier (Arg3, "entry_count");
end if;
else
Check_Arg_Count (1);
end if;
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Arg_Is_Local_Name (Arg1);
-- First argument must be a subprogram name
Arg := Expression (Arg1);
Find_Program_Unit_Name (Arg);
if Etype (Arg) = Any_Type then
return;
else
Subp := Entity (Arg);
end if;
if not (Is_Subprogram (Subp)
and then Is_Dispatching_Operation (Subp))
then
Error_Pragma_Arg
("pragma% must reference a primitive operation", Arg1);
end if;
Typ := Find_Dispatching_Type (Subp);
-- If only one Argument defaults are :
-- . DTC_Entity is the default Vtable pointer
-- . DT_Position will be set at the freezing point
if Arg_Count = 1 then
Set_DTC_Entity (Subp, Tag_Component (Typ));
return;
end if;
-- Second argument is a component name of type Vtable_Ptr
Arg := Expression (Arg2);
if Nkind (Arg) /= N_Identifier then
Error_Msg_NE ("must be a& component name", Arg, Typ);
raise Pragma_Exit;
end if;
DTC := First_Component (Typ);
while Present (DTC) and then Chars (DTC) /= Chars (Arg) loop
Next_Component (DTC);
end loop;
if No (DTC) then
Error_Msg_NE ("must be a& component name", Arg, Typ);
raise Pragma_Exit;
elsif Etype (DTC) /= VTP_Type then
Wrong_Type (Arg, VTP_Type);
return;
end if;
-- Third argument is an integer (DT_Position)
Arg := Expression (Arg3);
Analyze_And_Resolve (Arg, Any_Integer);
if not Is_Static_Expression (Arg) then
Error_Pragma_Arg
("third argument of pragma% must be a static expression",
Arg3);
else
V := Expr_Value (Expression (Arg3));
if V <= 0 then
Error_Pragma_Arg
("third argument of pragma% must be positive",
Arg3);
else
Set_DTC_Entity (Subp, DTC);
Set_DT_Position (Subp, V);
end if;
end if;
end CPP_Virtual;
----------------
-- CPP_Vtable --
----------------
-- pragma CPP_Vtable (
-- [Entity =>] LOCAL_NAME
-- [Vtable_Ptr =>] LOCAL_NAME,
-- [Entry_Count =>] static_integer_EXPRESSION);
when Pragma_CPP_Vtable => CPP_Vtable : declare
Arg : Node_Id;
Typ : Entity_Id;
VTP_Type : constant Entity_Id := RTE (RE_Vtable_Ptr);
DTC : Entity_Id;
V : Uint;
Elmt : Elmt_Id;
begin
GNAT_Pragma;
Check_Arg_Count (3);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Optional_Identifier (Arg2, "vtable_ptr");
Check_Optional_Identifier (Arg3, "entry_count");
Check_Arg_Is_Local_Name (Arg1);
-- First argument is a record type name
Arg := Expression (Arg1);
Analyze (Arg);
if Etype (Arg) = Any_Type then
return;
else
Typ := Entity (Arg);
end if;
if not (Is_Tagged_Type (Typ) and then Is_CPP_Class (Typ)) then
Error_Pragma_Arg ("'C'P'P_Class tagged type expected", Arg1);
end if;
-- Second argument is a component name of type Vtable_Ptr
Arg := Expression (Arg2);
if Nkind (Arg) /= N_Identifier then
Error_Msg_NE ("must be a& component name", Arg, Typ);
raise Pragma_Exit;
end if;
DTC := First_Component (Typ);
while Present (DTC) and then Chars (DTC) /= Chars (Arg) loop
Next_Component (DTC);
end loop;
if No (DTC) then
Error_Msg_NE ("must be a& component name", Arg, Typ);
raise Pragma_Exit;
elsif Etype (DTC) /= VTP_Type then
Wrong_Type (DTC, VTP_Type);
return;
-- If it is the first pragma Vtable, This becomes the default tag
elsif (not Is_Tag (DTC))
and then DT_Entry_Count (Tag_Component (Typ)) = No_Uint
then
Set_Is_Tag (Tag_Component (Typ), False);
Set_Is_Tag (DTC, True);
Set_DT_Entry_Count (DTC, No_Uint);
end if;
-- Those pragmas must appear before any primitive operation
-- definition (except inherited ones) otherwise the default
-- may be wrong
Elmt := First_Elmt (Primitive_Operations (Typ));
while Present (Elmt) loop
if No (Alias (Node (Elmt))) then
Error_Msg_Sloc := Sloc (Node (Elmt));
Error_Pragma
("pragma% must appear before this primitive operation");
end if;
Next_Elmt (Elmt);
end loop;
-- Third argument is an integer (DT_Entry_Count)
Arg := Expression (Arg3);
Analyze_And_Resolve (Arg, Any_Integer);
if not Is_Static_Expression (Arg) then
Error_Pragma_Arg
("entry count for pragma% must be a static expression", Arg3);
else
V := Expr_Value (Expression (Arg3));
if V <= 0 then
Error_Pragma_Arg
("entry count for pragma% must be positive", Arg3);
else
Set_DT_Entry_Count (DTC, V);
end if;
end if;
end CPP_Vtable;
-----------
-- Debug --
-----------
-- pragma Debug (PROCEDURE_CALL_STATEMENT);
when Pragma_Debug => Debug : begin
GNAT_Pragma;
-- If assertions are enabled, and we are expanding code, then
-- we rewrite the pragma with its corresponding procedure call
-- and then analyze the call.
if Assertions_Enabled and Expander_Active then
Rewrite (N, Relocate_Node (Debug_Statement (N)));
Analyze (N);
-- Otherwise we work a bit to get a tree that makes sense
-- for ASIS purposes, namely a pragma with an analyzed
-- argument that looks like a procedure call.
else
Expander_Mode_Save_And_Set (False);
Rewrite (N, Relocate_Node (Debug_Statement (N)));
Analyze (N);
Rewrite (N,
Make_Pragma (Loc,
Chars => Name_Debug,
Pragma_Argument_Associations =>
New_List (Relocate_Node (N))));
Expander_Mode_Restore;
end if;
end Debug;
-------------------
-- Discard_Names --
-------------------
-- pragma Discard_Names [([On =>] LOCAL_NAME)];
when Pragma_Discard_Names => Discard_Names : declare
E_Id : Entity_Id;
E : Entity_Id;
begin
GNAT_Pragma;
Check_Ada_83_Warning;
-- Deal with configuration pragma case
if Arg_Count = 0 and then Is_Configuration_Pragma then
Global_Discard_Names := True;
return;
-- Otherwise, check correct appropriate context
else
Check_Is_In_Decl_Part_Or_Package_Spec;
if Arg_Count = 0 then
-- If there is no parameter, then from now on this pragma
-- applies to any enumeration, exception or tagged type
-- defined in the current declarative part.
Set_Discard_Names (Current_Scope);
return;
else
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, Name_On);
Check_Arg_Is_Local_Name (Arg1);
E_Id := Expression (Arg1);
if Etype (E_Id) = Any_Type then
return;
else
E := Entity (E_Id);
end if;
if (Is_First_Subtype (E)
and then (Is_Enumeration_Type (E)
or else Is_Tagged_Type (E)))
or else Ekind (E) = E_Exception
then
Set_Discard_Names (E);
else
Error_Pragma_Arg
("inappropriate entity for pragma%", Arg1);
end if;
end if;
end if;
end Discard_Names;
---------------
-- Elaborate --
---------------
-- pragma Elaborate (library_unit_NAME {, library_unit_NAME});
when Pragma_Elaborate => Elaborate : declare
Plist : List_Id;
Parent_Node : Node_Id;
Arg : Node_Id;
Citem : Node_Id;
begin
-- Pragma must be in context items list of a compilation unit
if not Is_List_Member (N) then
Pragma_Misplaced;
return;
else
Plist := List_Containing (N);
Parent_Node := Parent (Plist);
if Parent_Node = Empty
or else Nkind (Parent_Node) /= N_Compilation_Unit
or else Context_Items (Parent_Node) /= Plist
then
Pragma_Misplaced;
return;
end if;
end if;
-- Must be at least one argument
if Arg_Count = 0 then
Error_Pragma ("pragma% requires at least one argument");
end if;
-- In Ada 83 mode, there can be no items following it in the
-- context list except other pragmas and implicit with clauses
-- (e.g. those added by use of Rtsfind). In Ada 95 mode, this
-- placement rule does not apply.
if Ada_83 and then Comes_From_Source (N) then
Citem := Next (N);
while Present (Citem) loop
if Nkind (Citem) = N_Pragma
or else (Nkind (Citem) = N_With_Clause
and then Implicit_With (Citem))
then
null;
else
Error_Pragma
("(Ada 83) pragma% must be at end of context clause");
end if;
Next (Citem);
end loop;
end if;
-- Finally, the arguments must all be units mentioned in a with
-- clause in the same context clause. Note we already checked
-- (in Par.Prag) that the arguments are either identifiers or
Arg := Arg1;
Outer : while Present (Arg) loop
Citem := First (Plist);
Inner : while Citem /= N loop
if Nkind (Citem) = N_With_Clause
and then Same_Name (Name (Citem), Expression (Arg))
then
Set_Elaborate_Present (Citem, True);
Set_Unit_Name (Expression (Arg), Name (Citem));
Set_Suppress_Elaboration_Warnings (Entity (Name (Citem)));
exit Inner;
end if;
Next (Citem);
end loop Inner;
if Citem = N then
Error_Pragma_Arg
("argument of pragma% is not with'ed unit", Arg);
end if;
Next (Arg);
end loop Outer;
end Elaborate;
-------------------
-- Elaborate_All --
-------------------
-- pragma Elaborate_All (library_unit_NAME {, library_unit_NAME});
when Pragma_Elaborate_All => Elaborate_All : declare
Plist : List_Id;
Parent_Node : Node_Id;
Arg : Node_Id;
Citem : Node_Id;
begin
Check_Ada_83_Warning;
-- Pragma must be in context items list of a compilation unit
if not Is_List_Member (N) then
Pragma_Misplaced;
return;
else
Plist := List_Containing (N);
Parent_Node := Parent (Plist);
if Parent_Node = Empty
or else Nkind (Parent_Node) /= N_Compilation_Unit
or else Context_Items (Parent_Node) /= Plist
then
Pragma_Misplaced;
return;
end if;
end if;
-- Must be at least one argument
if Arg_Count = 0 then
Error_Pragma ("pragma% requires at least one argument");
end if;
-- Note: unlike pragma Elaborate, pragma Elaborate_All does not
-- have to appear at the end of the context clause, but may
-- appear mixed in with other items, even in Ada 83 mode.
-- Final check: the arguments must all be units mentioned in
-- a with clause in the same context clause. Note that we
-- already checked (in Par.Prag) that all the arguments are
-- either identifiers or selected components.
Arg := Arg1;
Outr : while Present (Arg) loop
Citem := First (Plist);
Innr : while Citem /= N loop
if Nkind (Citem) = N_With_Clause
and then Same_Name (Name (Citem), Expression (Arg))
then
Set_Elaborate_All_Present (Citem, True);
Set_Unit_Name (Expression (Arg), Name (Citem));
Set_Suppress_Elaboration_Warnings (Entity (Name (Citem)));
exit Innr;
end if;
Next (Citem);
end loop Innr;
if Citem = N then
Error_Pragma_Arg
("argument of pragma% is not with'ed unit", Arg);
end if;
Next (Arg);
end loop Outr;
end Elaborate_All;
--------------------
-- Elaborate_Body --
--------------------
-- pragma Elaborate_Body [( library_unit_NAME )];
when Pragma_Elaborate_Body => Elaborate_Body : declare
Cunit_Node : Node_Id;
Cunit_Ent : Entity_Id;
begin
Check_Ada_83_Warning;
Check_Valid_Library_Unit_Pragma;
if Nkind (N) = N_Null_Statement then
return;
end if;
Cunit_Node := Cunit (Current_Sem_Unit);
Cunit_Ent := Cunit_Entity (Current_Sem_Unit);
if Nkind (Unit (Cunit_Node)) = N_Package_Body
or else
Nkind (Unit (Cunit_Node)) = N_Subprogram_Body
then
Error_Pragma ("pragma% must refer to a spec, not a body");
else
Set_Body_Required (Cunit_Node, True);
Set_Has_Pragma_Elaborate_Body (Cunit_Ent);
-- If we are in dynamic elaboration mode, then we suppress
-- elaboration warnings for the unit, since it is definitely
-- fine NOT to do dynamic checks at the first level (and such
-- checks will be suppressed because no elaboration boolean
-- is created for Elaborate_Body packages).
-- But in the static model of elaboration, Elaborate_Body is
-- definitely NOT good enough to ensure elaboration safety on
-- its own, since the body may WITH other units that are not
-- safe from an elaboration point of view, so a client must
-- still do an Elaborate_All on such units.
-- Debug flag -gnatdD restores the old behavior of 3.13,
-- where Elaborate_Body always suppressed elab warnings.
if Dynamic_Elaboration_Checks or Debug_Flag_DD then
Set_Suppress_Elaboration_Warnings (Cunit_Ent);
end if;
end if;
end Elaborate_Body;
------------------------
-- Elaboration_Checks --
------------------------
-- pragma Elaboration_Checks (Static | Dynamic);
when Pragma_Elaboration_Checks =>
GNAT_Pragma;
Check_Arg_Count (1);
Check_Arg_Is_One_Of (Arg1, Name_Static, Name_Dynamic);
Dynamic_Elaboration_Checks :=
(Chars (Get_Pragma_Arg (Arg1)) = Name_Dynamic);
---------------
-- Eliminate --
---------------
-- pragma Eliminate (
-- [Unit_Name =>] IDENTIFIER |
-- SELECTED_COMPONENT
-- [,[Entity =>] IDENTIFIER |
-- SELECTED_COMPONENT |
-- STRING_LITERAL]
-- [,[Parameter_Types =>] PARAMETER_TYPES]
-- [,[Result_Type =>] result_SUBTYPE_MARK]);
-- PARAMETER_TYPES ::=
-- null
-- (SUBTYPE_MARK, SUBTYPE_MARK, ...)
when Pragma_Eliminate => Eliminate : begin
GNAT_Pragma;
Check_Ada_83_Warning;
Check_Valid_Configuration_Pragma;
Check_At_Least_N_Arguments (1);
Check_At_Most_N_Arguments (4);
if Arg_Count = 3
and then Chars (Arg3) = Name_Result_Type
then
Arg4 := Arg3;
Arg3 := Empty;
else
Check_Optional_Identifier (Arg1, "unit_name");
Check_Optional_Identifier (Arg2, Name_Entity);
Check_Optional_Identifier (Arg3, Name_Parameter_Types);
Check_Optional_Identifier (Arg4, Name_Result_Type);
end if;
Process_Eliminate_Pragma (Arg1, Arg2, Arg3, Arg4);
end Eliminate;
------------
-- Export --
------------
-- pragma Export (
-- [ Convention =>] convention_IDENTIFIER,
-- [ Entity =>] local_NAME
-- [, [External_Name =>] static_string_EXPRESSION ]
-- [, [Link_Name =>] static_string_EXPRESSION ]);
when Pragma_Export => Export : declare
C : Convention_Id;
Def_Id : Entity_Id;
begin
Check_Ada_83_Warning;
Check_At_Least_N_Arguments (2);
Check_At_Most_N_Arguments (4);
Process_Convention (C, Def_Id);
if Ekind (Def_Id) /= E_Constant then
Note_Possible_Modification (Expression (Arg2));
end if;
Process_Interface_Name (Def_Id, Arg3, Arg4);
Set_Exported (Def_Id, Arg2);
end Export;
----------------------
-- Export_Exception --
----------------------
-- pragma Export_Exception (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL,]
-- [, [Form =>] Ada | VMS]
-- [, [Code =>] static_integer_EXPRESSION]);
when Pragma_Export_Exception => Export_Exception : declare
Args : Args_List (1 .. 4);
Names : Name_List (1 .. 4) := (
Name_Internal,
Name_External,
Name_Form,
Name_Code);
Internal : Node_Id renames Args (1);
External : Node_Id renames Args (2);
Form : Node_Id renames Args (3);
Code : Node_Id renames Args (4);
begin
GNAT_Pragma;
if Inside_A_Generic then
Error_Pragma ("pragma% cannot be used for generic entities");
end if;
Gather_Associations (Names, Args);
Process_Extended_Import_Export_Exception_Pragma (
Arg_Internal => Internal,
Arg_External => External,
Arg_Form => Form,
Arg_Code => Code);
if not Is_VMS_Exception (Entity (Internal)) then
Set_Exported (Entity (Internal), Internal);
end if;
end Export_Exception;
---------------------
-- Export_Function --
---------------------
-- pragma Export_Function (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL,]
-- [, [Parameter_Types =>] (PARAMETER_TYPES)]
-- [, [Result_Type =>] SUBTYPE_MARK]
-- [, [Mechanism =>] MECHANISM]
-- [, [Result_Mechanism =>] MECHANISM_NAME]);
when Pragma_Export_Function => Export_Function : declare
Args : Args_List (1 .. 6);
Names : Name_List (1 .. 6) := (
Name_Internal,
Name_External,
Name_Parameter_Types,
Name_Result_Type,
Name_Mechanism,
Name_Result_Mechanism);
Internal : Node_Id renames Args (1);
External : Node_Id renames Args (2);
Parameter_Types : Node_Id renames Args (3);
Result_Type : Node_Id renames Args (4);
Mechanism : Node_Id renames Args (5);
Result_Mechanism : Node_Id renames Args (6);
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
Process_Extended_Import_Export_Subprogram_Pragma (
Arg_Internal => Internal,
Arg_External => External,
Arg_Parameter_Types => Parameter_Types,
Arg_Result_Type => Result_Type,
Arg_Mechanism => Mechanism,
Arg_Result_Mechanism => Result_Mechanism);
end Export_Function;
-------------------
-- Export_Object --
-------------------
-- pragma Export_Object (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL]
-- [, [Size =>] EXTERNAL_SYMBOL]);
when Pragma_Export_Object => Export_Object : declare
Args : Args_List (1 .. 3);
Names : Name_List (1 .. 3) := (
Name_Internal,
Name_External,
Name_Size);
Internal : Node_Id renames Args (1);
External : Node_Id renames Args (2);
Size : Node_Id renames Args (3);
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
Process_Extended_Import_Export_Object_Pragma (
Arg_Internal => Internal,
Arg_External => External,
Arg_Size => Size);
end Export_Object;
----------------------
-- Export_Procedure --
----------------------
-- pragma Export_Procedure (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL,]
-- [, [Parameter_Types =>] (PARAMETER_TYPES)]
-- [, [Mechanism =>] MECHANISM]);
when Pragma_Export_Procedure => Export_Procedure : declare
Args : Args_List (1 .. 4);
Names : Name_List (1 .. 4) := (
Name_Internal,
Name_External,
Name_Parameter_Types,
Name_Mechanism);
Internal : Node_Id renames Args (1);
External : Node_Id renames Args (2);
Parameter_Types : Node_Id renames Args (3);
Mechanism : Node_Id renames Args (4);
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
Process_Extended_Import_Export_Subprogram_Pragma (
Arg_Internal => Internal,
Arg_External => External,
Arg_Parameter_Types => Parameter_Types,
Arg_Mechanism => Mechanism);
end Export_Procedure;
-----------------------------
-- Export_Valued_Procedure --
-----------------------------
-- pragma Export_Valued_Procedure (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL,]
-- [, [Parameter_Types =>] (PARAMETER_TYPES)]
-- [, [Mechanism =>] MECHANISM]);
when Pragma_Export_Valued_Procedure =>
Export_Valued_Procedure : declare
Args : Args_List (1 .. 4);
Names : Name_List (1 .. 4) := (
Name_Internal,
Name_External,
Name_Parameter_Types,
Name_Mechanism);
Internal : Node_Id renames Args (1);
External : Node_Id renames Args (2);
Parameter_Types : Node_Id renames Args (3);
Mechanism : Node_Id renames Args (4);
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
Process_Extended_Import_Export_Subprogram_Pragma (
Arg_Internal => Internal,
Arg_External => External,
Arg_Parameter_Types => Parameter_Types,
Arg_Mechanism => Mechanism);
end Export_Valued_Procedure;
-------------------
-- Extend_System --
-------------------
-- pragma Extend_System ([Name =>] Identifier);
when Pragma_Extend_System => Extend_System : declare
begin
GNAT_Pragma;
Check_Valid_Configuration_Pragma;
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, Name_Name);
Check_Arg_Is_Identifier (Arg1);
Get_Name_String (Chars (Expression (Arg1)));
if Name_Len > 4
and then Name_Buffer (1 .. 4) = "aux_"
then
if Present (System_Extend_Pragma_Arg) then
if Chars (Expression (Arg1)) =
Chars (Expression (System_Extend_Pragma_Arg))
then
null;
else
Error_Msg_Sloc := Sloc (System_Extend_Pragma_Arg);
Error_Pragma ("pragma% conflicts with that at#");
end if;
else
System_Extend_Pragma_Arg := Arg1;
end if;
else
Error_Pragma ("incorrect name for pragma%, must be Aux_xxx");
end if;
end Extend_System;
------------------------
-- Extensions_Allowed --
------------------------
-- pragma Extensions_Allowed (ON | OFF);
when Pragma_Extensions_Allowed =>
GNAT_Pragma;
Check_Arg_Count (1);
Check_No_Identifiers;
Check_Arg_Is_One_Of (Arg1, Name_On, Name_Off);
Extensions_Allowed := (Chars (Expression (Arg1)) = Name_On);
--------------
-- External --
--------------
-- pragma External (
-- [ Convention =>] convention_IDENTIFIER,
-- [ Entity =>] local_NAME
-- [, [External_Name =>] static_string_EXPRESSION ]
-- [, [Link_Name =>] static_string_EXPRESSION ]);
when Pragma_External => External : declare
C : Convention_Id;
Def_Id : Entity_Id;
begin
GNAT_Pragma;
Check_At_Least_N_Arguments (2);
Check_At_Most_N_Arguments (4);
Process_Convention (C, Def_Id);
Note_Possible_Modification (Expression (Arg2));
Process_Interface_Name (Def_Id, Arg3, Arg4);
Set_Exported (Def_Id, Arg2);
end External;
--------------------------
-- External_Name_Casing --
--------------------------
-- pragma External_Name_Casing (
-- UPPERCASE | LOWERCASE
-- [, AS_IS | UPPERCASE | LOWERCASE]);
when Pragma_External_Name_Casing =>
External_Name_Casing : declare
begin
GNAT_Pragma;
Check_No_Identifiers;
if Arg_Count = 2 then
Check_Arg_Is_One_Of
(Arg2, Name_As_Is, Name_Uppercase, Name_Lowercase);
case Chars (Get_Pragma_Arg (Arg2)) is
when Name_As_Is =>
Opt.External_Name_Exp_Casing := As_Is;
when Name_Uppercase =>
Opt.External_Name_Exp_Casing := Uppercase;
when Name_Lowercase =>
Opt.External_Name_Exp_Casing := Lowercase;
when others =>
null;
end case;
else
Check_Arg_Count (1);
end if;
Check_Arg_Is_One_Of (Arg1, Name_Uppercase, Name_Lowercase);
case Chars (Get_Pragma_Arg (Arg1)) is
when Name_Uppercase =>
Opt.External_Name_Imp_Casing := Uppercase;
when Name_Lowercase =>
Opt.External_Name_Imp_Casing := Lowercase;
when others =>
null;
end case;
end External_Name_Casing;
---------------------------
-- Finalize_Storage_Only --
---------------------------
-- pragma Finalize_Storage_Only (first_subtype_LOCAL_NAME);
when Pragma_Finalize_Storage_Only => Finalize_Storage : declare
Assoc : Node_Id := Arg1;
Type_Id : Node_Id := Expression (Assoc);
Typ : Entity_Id;
begin
Check_No_Identifiers;
Check_Arg_Count (1);
Check_Arg_Is_Local_Name (Arg1);
Find_Type (Type_Id);
Typ := Entity (Type_Id);
if Typ = Any_Type
or else Rep_Item_Too_Early (Typ, N)
then
return;
else
Typ := Underlying_Type (Typ);
end if;
if not Is_Controlled (Typ) then
Error_Pragma ("pragma% must specify controlled type");
end if;
Check_First_Subtype (Arg1);
if Finalize_Storage_Only (Typ) then
Error_Pragma ("duplicate pragma%, only one allowed");
elsif not Rep_Item_Too_Late (Typ, N) then
Set_Finalize_Storage_Only (Typ, True);
end if;
end Finalize_Storage;
--------------------------
-- Float_Representation --
--------------------------
-- pragma Float_Representation (VAX_Float | IEEE_Float);
when Pragma_Float_Representation => Float_Representation : declare
Argx : Node_Id;
Digs : Nat;
Ent : Entity_Id;
begin
GNAT_Pragma;
if Arg_Count = 1 then
Check_Valid_Configuration_Pragma;
else
Check_Arg_Count (2);
Check_Optional_Identifier (Arg2, Name_Entity);
Check_Arg_Is_Local_Name (Arg2);
end if;
Check_No_Identifier (Arg1);
Check_Arg_Is_One_Of (Arg1, Name_VAX_Float, Name_IEEE_Float);
if not OpenVMS_On_Target then
if Chars (Expression (Arg1)) = Name_VAX_Float then
Error_Pragma
("?pragma% ignored (applies only to Open'V'M'S)");
end if;
return;
end if;
-- One argument case
if Arg_Count = 1 then
if Chars (Expression (Arg1)) = Name_VAX_Float then
if Opt.Float_Format = 'I' then
Error_Pragma ("'I'E'E'E format previously specified");
end if;
Opt.Float_Format := 'V';
else
if Opt.Float_Format = 'V' then
Error_Pragma ("'V'A'X format previously specified");
end if;
Opt.Float_Format := 'I';
end if;
Set_Standard_Fpt_Formats;
-- Two argument case
else
Argx := Get_Pragma_Arg (Arg2);
if not Is_Entity_Name (Argx)
or else not Is_Floating_Point_Type (Entity (Argx))
then
Error_Pragma_Arg
("second argument of% pragma must be floating-point type",
Arg2);
end if;
Ent := Entity (Argx);
Digs := UI_To_Int (Digits_Value (Ent));
-- Two arguments, VAX_Float case
if Chars (Expression (Arg1)) = Name_VAX_Float then
case Digs is
when 6 => Set_F_Float (Ent);
when 9 => Set_D_Float (Ent);
when 15 => Set_G_Float (Ent);
when others =>
Error_Pragma_Arg
("wrong digits value, must be 6,9 or 15", Arg2);
end case;
-- Two arguments, IEEE_Float case
else
case Digs is
when 6 => Set_IEEE_Short (Ent);
when 15 => Set_IEEE_Long (Ent);
when others =>
Error_Pragma_Arg
("wrong digits value, must be 6 or 15", Arg2);
end case;
end if;
end if;
end Float_Representation;
-----------
-- Ident --
-----------
-- pragma Ident (static_string_EXPRESSION)
-- Note: pragma Comment shares this processing. Pragma Comment
-- is identical to Ident, except that the restriction of the
-- argument to 31 characters and the placement restrictions
-- are not enforced for pragma Comment.
when Pragma_Ident | Pragma_Comment => Ident : declare
Str : Node_Id;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_No_Identifiers;
Check_Arg_Is_Static_Expression (Arg1, Standard_String);
-- For pragma Ident, preserve DEC compatibility by requiring
-- the pragma to appear in a declarative part or package spec.
if Prag_Id = Pragma_Ident then
Check_Is_In_Decl_Part_Or_Package_Spec;
end if;
Str := Expr_Value_S (Expression (Arg1));
-- For pragma Ident, preserve DEC compatibility by limiting
-- the length to 31 characters.
if Prag_Id = Pragma_Ident
and then String_Length (Strval (Str)) > 31
then
Error_Pragma_Arg
("argument for pragma% is too long, maximum is 31", Arg1);
end if;
declare
CS : Node_Id;
GP : Node_Id;
begin
GP := Parent (Parent (N));
if Nkind (GP) = N_Package_Declaration
or else
Nkind (GP) = N_Generic_Package_Declaration
then
GP := Parent (GP);
end if;
-- If we have a compilation unit, then record the ident
-- value, checking for improper duplication.
if Nkind (GP) = N_Compilation_Unit then
CS := Ident_String (Current_Sem_Unit);
if Present (CS) then
-- For Ident, we do not permit multiple instances
if Prag_Id = Pragma_Ident then
Error_Pragma ("duplicate% pragma not permitted");
-- For Comment, we concatenate the string, unless we
-- want to preserve the tree structure for ASIS.
elsif not Tree_Output then
Start_String (Strval (CS));
Store_String_Char (' ');
Store_String_Chars (Strval (Str));
Set_Strval (CS, End_String);
end if;
else
-- In VMS, the effect of IDENT is achieved by passing
-- IDENTIFICATION=name as a --for-linker switch.
if OpenVMS_On_Target then
Start_String;
Store_String_Chars
("--for-linker=IDENTIFICATION=");
String_To_Name_Buffer (Strval (Str));
Store_String_Chars (Name_Buffer (1 .. Name_Len));
-- Only the last processed IDENT is saved. The main
-- purpose is so an IDENT associated with a main
-- procedure will be used in preference to an IDENT
-- associated with a with'd package.
Replace_Linker_Option_String
(End_String, "--for-linker=IDENTIFICATION=");
end if;
Set_Ident_String (Current_Sem_Unit, Str);
end if;
-- For subunits, we just ignore the Ident, since in GNAT
-- these are not separate object files, and hence not
-- separate units in the unit table.
elsif Nkind (GP) = N_Subunit then
null;
-- Otherwise we have a misplaced pragma Ident, but we ignore
-- this if we are in an instantiation, since it comes from
-- a generic, and has no relevance to the instantiation.
elsif Prag_Id = Pragma_Ident then
if Instantiation_Location (Loc) = No_Location then
Error_Pragma ("pragma% only allowed at outer level");
end if;
end if;
end;
end Ident;
------------
-- Import --
------------
-- pragma Import (
-- [ Convention =>] convention_IDENTIFIER,
-- [ Entity =>] local_NAME
-- [, [External_Name =>] static_string_EXPRESSION ]
-- [, [Link_Name =>] static_string_EXPRESSION ]);
when Pragma_Import =>
Check_Ada_83_Warning;
Check_At_Least_N_Arguments (2);
Check_At_Most_N_Arguments (4);
Process_Import_Or_Interface;
----------------------
-- Import_Exception --
----------------------
-- pragma Import_Exception (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL,]
-- [, [Form =>] Ada | VMS]
-- [, [Code =>] static_integer_EXPRESSION]);
when Pragma_Import_Exception => Import_Exception : declare
Args : Args_List (1 .. 4);
Names : Name_List (1 .. 4) := (
Name_Internal,
Name_External,
Name_Form,
Name_Code);
Internal : Node_Id renames Args (1);
External : Node_Id renames Args (2);
Form : Node_Id renames Args (3);
Code : Node_Id renames Args (4);
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
if Present (External) and then Present (Code) then
Error_Pragma
("cannot give both External and Code options for pragma%");
end if;
Process_Extended_Import_Export_Exception_Pragma (
Arg_Internal => Internal,
Arg_External => External,
Arg_Form => Form,
Arg_Code => Code);
if not Is_VMS_Exception (Entity (Internal)) then
Set_Imported (Entity (Internal));
end if;
end Import_Exception;
---------------------
-- Import_Function --
---------------------
-- pragma Import_Function (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL]
-- [, [Parameter_Types =>] (PARAMETER_TYPES)]
-- [, [Result_Type =>] SUBTYPE_MARK]
-- [, [Mechanism =>] MECHANISM]
-- [, [Result_Mechanism =>] MECHANISM_NAME]
-- [, [First_Optional_Parameter =>] IDENTIFIER]);
when Pragma_Import_Function => Import_Function : declare
Args : Args_List (1 .. 7);
Names : Name_List (1 .. 7) := (
Name_Internal,
Name_External,
Name_Parameter_Types,
Name_Result_Type,
Name_Mechanism,
Name_Result_Mechanism,
Name_First_Optional_Parameter);
Internal : Node_Id renames Args (1);
External : Node_Id renames Args (2);
Parameter_Types : Node_Id renames Args (3);
Result_Type : Node_Id renames Args (4);
Mechanism : Node_Id renames Args (5);
Result_Mechanism : Node_Id renames Args (6);
First_Optional_Parameter : Node_Id renames Args (7);
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
Process_Extended_Import_Export_Subprogram_Pragma (
Arg_Internal => Internal,
Arg_External => External,
Arg_Parameter_Types => Parameter_Types,
Arg_Result_Type => Result_Type,
Arg_Mechanism => Mechanism,
Arg_Result_Mechanism => Result_Mechanism,
Arg_First_Optional_Parameter => First_Optional_Parameter);
end Import_Function;
-------------------
-- Import_Object --
-------------------
-- pragma Import_Object (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL]
-- [, [Size =>] EXTERNAL_SYMBOL]);
when Pragma_Import_Object => Import_Object : declare
Args : Args_List (1 .. 3);
Names : Name_List (1 .. 3) := (
Name_Internal,
Name_External,
Name_Size);
Internal : Node_Id renames Args (1);
External : Node_Id renames Args (2);
Size : Node_Id renames Args (3);
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
Process_Extended_Import_Export_Object_Pragma (
Arg_Internal => Internal,
Arg_External => External,
Arg_Size => Size);
end Import_Object;
----------------------
-- Import_Procedure --
----------------------
-- pragma Import_Procedure (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL]
-- [, [Parameter_Types =>] (PARAMETER_TYPES)]
-- [, [Mechanism =>] MECHANISM]
-- [, [First_Optional_Parameter =>] IDENTIFIER]);
when Pragma_Import_Procedure => Import_Procedure : declare
Args : Args_List (1 .. 5);
Names : Name_List (1 .. 5) := (
Name_Internal,
Name_External,
Name_Parameter_Types,
Name_Mechanism,
Name_First_Optional_Parameter);
Internal : Node_Id renames Args (1);
External : Node_Id renames Args (2);
Parameter_Types : Node_Id renames Args (3);
Mechanism : Node_Id renames Args (4);
First_Optional_Parameter : Node_Id renames Args (5);
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
Process_Extended_Import_Export_Subprogram_Pragma (
Arg_Internal => Internal,
Arg_External => External,
Arg_Parameter_Types => Parameter_Types,
Arg_Mechanism => Mechanism,
Arg_First_Optional_Parameter => First_Optional_Parameter);
end Import_Procedure;
-----------------------------
-- Import_Valued_Procedure --
-----------------------------
-- pragma Import_Valued_Procedure (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL]
-- [, [Parameter_Types =>] (PARAMETER_TYPES)]
-- [, [Mechanism =>] MECHANISM]
-- [, [First_Optional_Parameter =>] IDENTIFIER]);
when Pragma_Import_Valued_Procedure =>
Import_Valued_Procedure : declare
Args : Args_List (1 .. 5);
Names : Name_List (1 .. 5) := (
Name_Internal,
Name_External,
Name_Parameter_Types,
Name_Mechanism,
Name_First_Optional_Parameter);
Internal : Node_Id renames Args (1);
External : Node_Id renames Args (2);
Parameter_Types : Node_Id renames Args (3);
Mechanism : Node_Id renames Args (4);
First_Optional_Parameter : Node_Id renames Args (5);
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
Process_Extended_Import_Export_Subprogram_Pragma (
Arg_Internal => Internal,
Arg_External => External,
Arg_Parameter_Types => Parameter_Types,
Arg_Mechanism => Mechanism,
Arg_First_Optional_Parameter => First_Optional_Parameter);
end Import_Valued_Procedure;
------------------------
-- Initialize_Scalars --
------------------------
-- pragma Initialize_Scalars;
when Pragma_Initialize_Scalars =>
GNAT_Pragma;
Check_Arg_Count (0);
Check_Valid_Configuration_Pragma;
Init_Or_Norm_Scalars := True;
Initialize_Scalars := True;
------------
-- Inline --
------------
-- pragma Inline ( NAME {, NAME} );
when Pragma_Inline =>
-- Pragma is active if inlining option is active
if Inline_Active then
Process_Inline (True);
-- Pragma is active in a predefined file in no run time mode
elsif No_Run_Time
and then
Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit))
then
Process_Inline (True);
else
Process_Inline (False);
end if;
-------------------
-- Inline_Always --
-------------------
-- pragma Inline_Always ( NAME {, NAME} );
when Pragma_Inline_Always =>
Process_Inline (True);
--------------------
-- Inline_Generic --
--------------------
-- pragma Inline_Generic (NAME {, NAME});
when Pragma_Inline_Generic =>
Process_Generic_List;
----------------------
-- Inspection_Point --
----------------------
-- pragma Inspection_Point [(object_NAME {, object_NAME})];
when Pragma_Inspection_Point => Inspection_Point : declare
Arg : Node_Id;
Exp : Node_Id;
begin
if Arg_Count > 0 then
Arg := Arg1;
loop
Exp := Expression (Arg);
Analyze (Exp);
if not Is_Entity_Name (Exp)
or else not Is_Object (Entity (Exp))
then
Error_Pragma_Arg ("object name required", Arg);
end if;
Next (Arg);
exit when No (Arg);
end loop;
end if;
end Inspection_Point;
---------------
-- Interface --
---------------
-- pragma Interface (
-- convention_IDENTIFIER,
-- local_NAME );
when Pragma_Interface =>
GNAT_Pragma;
Check_Arg_Count (2);
Check_No_Identifiers;
Process_Import_Or_Interface;
--------------------
-- Interface_Name --
--------------------
-- pragma Interface_Name (
-- [ Entity =>] local_NAME
-- [,[External_Name =>] static_string_EXPRESSION ]
-- [,[Link_Name =>] static_string_EXPRESSION ]);
when Pragma_Interface_Name => Interface_Name : declare
Id : Node_Id;
Def_Id : Entity_Id;
Hom_Id : Entity_Id;
Found : Boolean;
begin
GNAT_Pragma;
Check_At_Least_N_Arguments (2);
Check_At_Most_N_Arguments (3);
Id := Expression (Arg1);
Analyze (Id);
if not Is_Entity_Name (Id) then
Error_Pragma_Arg
("first argument for pragma% must be entity name", Arg1);
elsif Etype (Id) = Any_Type then
return;
else
Def_Id := Entity (Id);
end if;
-- Special DEC-compatible processing for the object case,
-- forces object to be imported.
if Ekind (Def_Id) = E_Variable then
Kill_Size_Check_Code (Def_Id);
Note_Possible_Modification (Id);
-- Initialization is not allowed for imported variable
if Present (Expression (Parent (Def_Id)))
and then Comes_From_Source (Expression (Parent (Def_Id)))
then
Error_Msg_Sloc := Sloc (Def_Id);
Error_Pragma_Arg
("no initialization allowed for declaration of& #",
Arg2);
else
-- For compatibility, support VADS usage of providing both
-- pragmas Interface and Interface_Name to obtain the effect
-- of a single Import pragma.
if Is_Imported (Def_Id)
and then Present (First_Rep_Item (Def_Id))
and then Nkind (First_Rep_Item (Def_Id)) = N_Pragma
and then Chars (First_Rep_Item (Def_Id)) = Name_Interface
then
null;
else
Set_Imported (Def_Id);
end if;
Set_Is_Public (Def_Id);
Process_Interface_Name (Def_Id, Arg2, Arg3);
end if;
-- Otherwise must be subprogram
elsif not Is_Subprogram (Def_Id) then
Error_Pragma_Arg
("argument of pragma% is not subprogram", Arg1);
else
Check_At_Most_N_Arguments (3);
Hom_Id := Def_Id;
Found := False;
-- Loop through homonyms
loop
Def_Id := Get_Base_Subprogram (Hom_Id);
if Is_Imported (Def_Id) then
Process_Interface_Name (Def_Id, Arg2, Arg3);
Found := True;
end if;
Hom_Id := Homonym (Hom_Id);
exit when No (Hom_Id)
or else Scope (Hom_Id) /= Current_Scope;
end loop;
if not Found then
Error_Pragma_Arg
("argument of pragma% is not imported subprogram",
Arg1);
end if;
end if;
end Interface_Name;
-----------------------
-- Interrupt_Handler --
-----------------------
-- pragma Interrupt_Handler (handler_NAME);
when Pragma_Interrupt_Handler =>
Check_Ada_83_Warning;
Check_Arg_Count (1);
Check_No_Identifiers;
Check_Interrupt_Or_Attach_Handler;
Process_Interrupt_Or_Attach_Handler;
------------------------
-- Interrupt_Priority --
------------------------
-- pragma Interrupt_Priority [(EXPRESSION)];
when Pragma_Interrupt_Priority => Interrupt_Priority : declare
P : constant Node_Id := Parent (N);
Arg : Node_Id;
begin
Check_Ada_83_Warning;
if Arg_Count /= 0 then
Arg := Expression (Arg1);
Check_Arg_Count (1);
Check_No_Identifiers;
-- Set In_Default_Expression for per-object case???
Analyze_And_Resolve (Arg, Standard_Integer);
if Expander_Active then
Rewrite (Arg,
Convert_To (RTE (RE_Interrupt_Priority), Arg));
end if;
end if;
if Nkind (P) /= N_Task_Definition
and then Nkind (P) /= N_Protected_Definition
then
Pragma_Misplaced;
return;
elsif Has_Priority_Pragma (P) then
Error_Pragma ("duplicate pragma% not allowed");
else
Set_Has_Priority_Pragma (P, True);
Record_Rep_Item (Defining_Identifier (Parent (P)), N);
end if;
end Interrupt_Priority;
----------------------
-- Java_Constructor --
----------------------
-- pragma Java_Constructor ([Entity =>] LOCAL_NAME);
when Pragma_Java_Constructor => Java_Constructor : declare
Id : Entity_Id;
Def_Id : Entity_Id;
Hom_Id : Entity_Id;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Arg_Is_Local_Name (Arg1);
Id := Expression (Arg1);
Find_Program_Unit_Name (Id);
-- If we did not find the name, we are done
if Etype (Id) = Any_Type then
return;
end if;
Hom_Id := Entity (Id);
-- Loop through homonyms
loop
Def_Id := Get_Base_Subprogram (Hom_Id);
-- The constructor is required to be a function returning
-- an access type whose designated type has convention Java.
if Ekind (Def_Id) = E_Function
and then Ekind (Etype (Def_Id)) in Access_Kind
and then
(Atree.Convention
(Designated_Type (Etype (Def_Id))) = Convention_Java
or else
Atree.Convention
(Root_Type (Designated_Type (Etype (Def_Id))))
= Convention_Java)
then
Set_Is_Constructor (Def_Id);
Set_Convention (Def_Id, Convention_Java);
else
Error_Pragma_Arg
("pragma% requires function returning a 'Java access type",
Arg1);
end if;
Hom_Id := Homonym (Hom_Id);
exit when No (Hom_Id) or else Scope (Hom_Id) /= Current_Scope;
end loop;
end Java_Constructor;
----------------------
-- Java_Interface --
----------------------
-- pragma Java_Interface ([Entity =>] LOCAL_NAME);
when Pragma_Java_Interface => Java_Interface : declare
Arg : Node_Id;
Typ : Entity_Id;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Arg_Is_Local_Name (Arg1);
Arg := Expression (Arg1);
Analyze (Arg);
if Etype (Arg) = Any_Type then
return;
end if;
if not Is_Entity_Name (Arg)
or else not Is_Type (Entity (Arg))
then
Error_Pragma_Arg ("pragma% requires a type mark", Arg1);
end if;
Typ := Underlying_Type (Entity (Arg));
-- For now we simply check some of the semantic constraints
-- on the type. This currently leaves out some restrictions
-- on interface types, namely that the parent type must be
-- java.lang.Object.Typ and that all primitives of the type
-- should be declared abstract. ???
if not Is_Tagged_Type (Typ) or else not Is_Abstract (Typ) then
Error_Pragma_Arg ("pragma% requires an abstract "
& "tagged type", Arg1);
elsif not Has_Discriminants (Typ)
or else Ekind (Etype (First_Discriminant (Typ)))
/= E_Anonymous_Access_Type
or else
not Is_Class_Wide_Type
(Designated_Type (Etype (First_Discriminant (Typ))))
then
Error_Pragma_Arg
("type must have a class-wide access discriminant", Arg1);
end if;
end Java_Interface;
-------------
-- License --
-------------
-- pragma License (RESTRICTED | UNRESRICTED | GPL | MODIFIED_GPL);
when Pragma_License =>
GNAT_Pragma;
Check_Arg_Count (1);
Check_No_Identifiers;
Check_Valid_Configuration_Pragma;
Check_Arg_Is_Identifier (Arg1);
declare
Sind : constant Source_File_Index :=
Source_Index (Current_Sem_Unit);
begin
case Chars (Get_Pragma_Arg (Arg1)) is
when Name_GPL =>
Set_License (Sind, GPL);
when Name_Modified_GPL =>
Set_License (Sind, Modified_GPL);
when Name_Restricted =>
Set_License (Sind, Restricted);
when Name_Unrestricted =>
Set_License (Sind, Unrestricted);
when others =>
Error_Pragma_Arg ("invalid license name", Arg1);
end case;
end;
---------------
-- Link_With --
---------------
-- pragma Link_With (string_EXPRESSION {, string_EXPRESSION});
when Pragma_Link_With => Link_With : declare
Arg : Node_Id;
begin
GNAT_Pragma;
if Operating_Mode = Generate_Code
and then In_Extended_Main_Source_Unit (N)
then
Check_At_Least_N_Arguments (1);
Check_No_Identifiers;
Check_Is_In_Decl_Part_Or_Package_Spec;
Check_Arg_Is_Static_Expression (Arg1, Standard_String);
Start_String;
Arg := Arg1;
while Present (Arg) loop
Check_Arg_Is_Static_Expression (Arg, Standard_String);
-- Store argument, converting sequences of spaces to
-- a single null character (this is the difference in
-- processing between Link_With, and Linker_Options).
declare
C : constant Char_Code := Get_Char_Code (' ');
S : constant String_Id :=
Strval (Expr_Value_S (Expression (Arg)));
F : Nat := 1;
L : Nat := String_Length (S);
procedure Skip_Spaces;
-- Advance F past any spaces
procedure Skip_Spaces is
begin
while F <= L and then Get_String_Char (S, F) = C loop
F := F + 1;
end loop;
end Skip_Spaces;
begin
Skip_Spaces; -- skip leading spaces
-- Loop through characters, changing any embedded
-- sequence of spaces to a single null character
-- (this is how Link_With/Linker_Options differ)
while F <= L loop
if Get_String_Char (S, F) = C then
Skip_Spaces;
exit when F > L;
Store_String_Char (ASCII.NUL);
else
Store_String_Char (Get_String_Char (S, F));
F := F + 1;
end if;
end loop;
end;
Arg := Next (Arg);
if Present (Arg) then
Store_String_Char (ASCII.NUL);
end if;
end loop;
Store_Linker_Option_String (End_String);
end if;
end Link_With;
------------------
-- Linker_Alias --
------------------
-- pragma Linker_Alias (
-- [Entity =>] LOCAL_NAME
-- [Alias =>] static_string_EXPRESSION);
when Pragma_Linker_Alias =>
GNAT_Pragma;
Check_Arg_Count (2);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Optional_Identifier (Arg2, "alias");
Check_Arg_Is_Library_Level_Local_Name (Arg1);
Check_Arg_Is_Static_Expression (Arg2, Standard_String);
-- The only processing required is to link this item on to the
-- list of rep items for the given entity. This is accomplished
-- by the call to Rep_Item_Too_Late (when no error is detected
-- and False is returned).
if Rep_Item_Too_Late (Entity (Expression (Arg1)), N) then
return;
else
Set_Has_Gigi_Rep_Item (Entity (Expression (Arg1)));
end if;
--------------------
-- Linker_Options --
--------------------
-- pragma Linker_Options (string_EXPRESSION {, string_EXPRESSION});
-- Note: the use of multiple arguments is a GNAT extension
when Pragma_Linker_Options => Linker_Options : declare
Arg : Node_Id;
begin
if Operating_Mode = Generate_Code
and then In_Extended_Main_Source_Unit (N)
then
Check_Ada_83_Warning;
Check_At_Least_N_Arguments (1);
Check_No_Identifiers;
Check_Is_In_Decl_Part_Or_Package_Spec;
Check_Arg_Is_Static_Expression (Arg1, Standard_String);
Start_String (Strval (Expr_Value_S (Expression (Arg1))));
Arg := Arg2;
while Present (Arg) loop
Check_Arg_Is_Static_Expression (Arg, Standard_String);
Store_String_Char (ASCII.NUL);
Store_String_Chars
(Strval (Expr_Value_S (Expression (Arg))));
Arg := Next (Arg);
end loop;
Store_Linker_Option_String (End_String);
end if;
end Linker_Options;
--------------------
-- Linker_Section --
--------------------
-- pragma Linker_Section (
-- [Entity =>] LOCAL_NAME
-- [Section =>] static_string_EXPRESSION);
when Pragma_Linker_Section =>
GNAT_Pragma;
Check_Arg_Count (2);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Optional_Identifier (Arg2, Name_Section);
Check_Arg_Is_Library_Level_Local_Name (Arg1);
Check_Arg_Is_Static_Expression (Arg2, Standard_String);
-- The only processing required is to link this item on to the
-- list of rep items for the given entity. This is accomplished
-- by the call to Rep_Item_Too_Late (when no error is detected
-- and False is returned).
if Rep_Item_Too_Late (Entity (Expression (Arg1)), N) then
return;
else
Set_Has_Gigi_Rep_Item (Entity (Expression (Arg1)));
end if;
----------
-- List --
----------
-- pragma List (On | Off)
-- There is nothing to do here, since we did all the processing
-- for this pragma in Par.Prag (so that it works properly even in
-- syntax only mode)
when Pragma_List =>
null;
--------------------
-- Locking_Policy --
--------------------
-- pragma Locking_Policy (policy_IDENTIFIER);
when Pragma_Locking_Policy => declare
LP : Character;
begin
Check_Ada_83_Warning;
Check_Arg_Count (1);
Check_No_Identifiers;
Check_Arg_Is_Locking_Policy (Arg1);
Check_Valid_Configuration_Pragma;
Get_Name_String (Chars (Expression (Arg1)));
LP := Fold_Upper (Name_Buffer (1));
if Locking_Policy /= ' '
and then Locking_Policy /= LP
then
Error_Msg_Sloc := Locking_Policy_Sloc;
Error_Pragma ("locking policy incompatible with policy#");
else
Locking_Policy := LP;
Locking_Policy_Sloc := Loc;
end if;
end;
----------------
-- Long_Float --
----------------
-- pragma Long_Float (D_Float | G_Float);
when Pragma_Long_Float =>
GNAT_Pragma;
Check_Valid_Configuration_Pragma;
Check_Arg_Count (1);
Check_No_Identifier (Arg1);
Check_Arg_Is_One_Of (Arg1, Name_D_Float, Name_G_Float);
if not OpenVMS_On_Target then
Error_Pragma ("?pragma% ignored (applies only to Open'V'M'S)");
end if;
-- D_Float case
if Chars (Expression (Arg1)) = Name_D_Float then
if Opt.Float_Format_Long = 'G' then
Error_Pragma ("G_Float previously specified");
end if;
Opt.Float_Format_Long := 'D';
-- G_Float case (this is the default, does not need overriding)
else
if Opt.Float_Format_Long = 'D' then
Error_Pragma ("D_Float previously specified");
end if;
Opt.Float_Format_Long := 'G';
end if;
Set_Standard_Fpt_Formats;
-----------------------
-- Machine_Attribute --
-----------------------
-- pragma Machine_Attribute (
-- [Entity =>] LOCAL_NAME,
-- [Attribute_Name =>] static_string_EXPRESSION
-- [,[Info =>] static_string_EXPRESSION] );
when Pragma_Machine_Attribute => Machine_Attribute : declare
Def_Id : Entity_Id;
begin
GNAT_Pragma;
if Arg_Count = 3 then
Check_Optional_Identifier (Arg3, "info");
Check_Arg_Is_Static_Expression (Arg3, Standard_String);
else
Check_Arg_Count (2);
end if;
Check_Arg_Is_Local_Name (Arg1);
Check_Optional_Identifier (Arg2, "attribute_name");
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Arg_Is_Static_Expression (Arg2, Standard_String);
Def_Id := Entity (Expression (Arg1));
if Is_Access_Type (Def_Id) then
Def_Id := Designated_Type (Def_Id);
end if;
if Rep_Item_Too_Early (Def_Id, N) then
return;
end if;
Def_Id := Underlying_Type (Def_Id);
-- The only processing required is to link this item on to the
-- list of rep items for the given entity. This is accomplished
-- by the call to Rep_Item_Too_Late (when no error is detected
-- and False is returned).
if Rep_Item_Too_Late (Def_Id, N) then
return;
else
Set_Has_Gigi_Rep_Item (Entity (Expression (Arg1)));
end if;
end Machine_Attribute;
----------
-- Main --
----------
-- pragma Main_Storage
-- (MAIN_STORAGE_OPTION [, MAIN_STORAGE_OPTION]);
-- MAIN_STORAGE_OPTION ::=
-- [WORKING_STORAGE =>] static_SIMPLE_EXPRESSION
-- | [TOP_GUARD =>] static_SIMPLE_EXPRESSION
when Pragma_Main => Main : declare
Args : Args_List (1 .. 3);
Names : Name_List (1 .. 3) := (
Name_Stack_Size,
Name_Task_Stack_Size_Default,
Name_Time_Slicing_Enabled);
Nod : Node_Id;
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
for J in 1 .. 2 loop
if Present (Args (J)) then
Check_Arg_Is_Static_Expression (Args (J), Any_Integer);
end if;
end loop;
if Present (Args (3)) then
Check_Arg_Is_Static_Expression (Args (3), Standard_Boolean);
end if;
Nod := Next (N);
while Present (Nod) loop
if Nkind (Nod) = N_Pragma
and then Chars (Nod) = Name_Main
then
Error_Msg_Name_1 := Chars (N);
Error_Msg_N ("duplicate pragma% not permitted", Nod);
end if;
Next (Nod);
end loop;
end Main;
------------------
-- Main_Storage --
------------------
-- pragma Main_Storage
-- (MAIN_STORAGE_OPTION [, MAIN_STORAGE_OPTION]);
-- MAIN_STORAGE_OPTION ::=
-- [WORKING_STORAGE =>] static_SIMPLE_EXPRESSION
-- | [TOP_GUARD =>] static_SIMPLE_EXPRESSION
when Pragma_Main_Storage => Main_Storage : declare
Args : Args_List (1 .. 2);
Names : Name_List (1 .. 2) := (
Name_Working_Storage,
Name_Top_Guard);
Nod : Node_Id;
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
for J in 1 .. 2 loop
if Present (Args (J)) then
Check_Arg_Is_Static_Expression (Args (J), Any_Integer);
end if;
end loop;
Check_In_Main_Program;
Nod := Next (N);
while Present (Nod) loop
if Nkind (Nod) = N_Pragma
and then Chars (Nod) = Name_Main_Storage
then
Error_Msg_Name_1 := Chars (N);
Error_Msg_N ("duplicate pragma% not permitted", Nod);
end if;
Next (Nod);
end loop;
end Main_Storage;
-----------------
-- Memory_Size --
-----------------
-- pragma Memory_Size (NUMERIC_LITERAL)
when Pragma_Memory_Size =>
GNAT_Pragma;
-- Memory size is simply ignored
Check_No_Identifiers;
Check_Arg_Count (1);
Check_Arg_Is_Integer_Literal (Arg1);
---------------
-- No_Return --
---------------
-- pragma No_Return (procedure_LOCAL_NAME);
when Pragma_No_Return => declare
Id : Node_Id;
E : Entity_Id;
Found : Boolean;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_No_Identifiers;
Check_Arg_Is_Local_Name (Arg1);
Id := Expression (Arg1);
Analyze (Id);
if not Is_Entity_Name (Id) then
Error_Pragma_Arg ("entity name required", Arg1);
end if;
if Etype (Id) = Any_Type then
raise Pragma_Exit;
end if;
E := Entity (Id);
Found := False;
while Present (E)
and then Scope (E) = Current_Scope
loop
if Ekind (E) = E_Procedure
or else Ekind (E) = E_Generic_Procedure
then
Set_No_Return (E);
Found := True;
end if;
E := Homonym (E);
end loop;
if not Found then
Error_Pragma ("no procedures found for pragma%");
end if;
end;
-----------------
-- No_Run_Time --
-----------------
-- pragma No_Run_Time
when Pragma_No_Run_Time =>
GNAT_Pragma;
Check_Valid_Configuration_Pragma;
Check_Arg_Count (0);
Set_No_Run_Time_Mode;
-----------------------
-- Normalize_Scalars --
-----------------------
-- pragma Normalize_Scalars;
when Pragma_Normalize_Scalars =>
Check_Ada_83_Warning;
Check_Arg_Count (0);
Check_Valid_Configuration_Pragma;
Normalize_Scalars := True;
Init_Or_Norm_Scalars := True;
--------------
-- Optimize --
--------------
-- pragma Optimize (Time | Space);
-- The actual check for optimize is done in Gigi. Note that this
-- pragma does not actually change the optimization setting, it
-- simply checks that it is consistent with the pragma.
when Pragma_Optimize =>
Check_No_Identifiers;
Check_Arg_Count (1);
Check_Arg_Is_One_Of (Arg1, Name_Time, Name_Space, Name_Off);
----------
-- Pack --
----------
-- pragma Pack (first_subtype_LOCAL_NAME);
when Pragma_Pack => Pack : declare
Assoc : Node_Id := Arg1;
Type_Id : Node_Id;
Typ : Entity_Id;
begin
Check_No_Identifiers;
Check_Arg_Count (1);
Check_Arg_Is_Local_Name (Arg1);
Type_Id := Expression (Assoc);
Find_Type (Type_Id);
Typ := Entity (Type_Id);
if Typ = Any_Type
or else Rep_Item_Too_Early (Typ, N)
then
return;
else
Typ := Underlying_Type (Typ);
end if;
if not Is_Array_Type (Typ) and then not Is_Record_Type (Typ) then
Error_Pragma ("pragma% must specify array or record type");
end if;
Check_First_Subtype (Arg1);
if Has_Pragma_Pack (Typ) then
Error_Pragma ("duplicate pragma%, only one allowed");
-- Array type. We set the Has_Pragma_Pack flag, and Is_Packed,
-- but not Has_Non_Standard_Rep, because we don't actually know
-- till freeze time if the array can have packed representation.
-- That's because in the general case we do not know enough about
-- the component type until it in turn is frozen, which certainly
-- happens before the array type is frozen, but not necessarily
-- till that point (i.e. right now it may be unfrozen).
elsif Is_Array_Type (Typ) then
if Has_Aliased_Components (Base_Type (Typ)) then
Error_Pragma
("pragma% ignored, cannot pack aliased components?");
elsif Has_Atomic_Components (Typ) then
Error_Pragma
("?pragma% ignored, cannot pack atomic components");
elsif not Rep_Item_Too_Late (Typ, N) then
Set_Is_Packed (Base_Type (Typ));
Set_Has_Pragma_Pack (Base_Type (Typ));
Set_Has_Non_Standard_Rep (Base_Type (Typ));
end if;
-- Record type. For record types, the pack is always effective
else -- Is_Record_Type (Typ)
if not Rep_Item_Too_Late (Typ, N) then
Set_Has_Pragma_Pack (Base_Type (Typ));
Set_Is_Packed (Base_Type (Typ));
Set_Has_Non_Standard_Rep (Base_Type (Typ));
end if;
end if;
end Pack;
----------
-- Page --
----------
-- pragma Page;
-- There is nothing to do here, since we did all the processing
-- for this pragma in Par.Prag (so that it works properly even in
-- syntax only mode)
when Pragma_Page =>
null;
-------------
-- Passive --
-------------
-- pragma Passive [(PASSIVE_FORM)];
-- PASSIVE_FORM ::= Semaphore | No
when Pragma_Passive =>
GNAT_Pragma;
if Nkind (Parent (N)) /= N_Task_Definition then
Error_Pragma ("pragma% must be within task definition");
end if;
if Arg_Count /= 0 then
Check_Arg_Count (1);
Check_Arg_Is_One_Of (Arg1, Name_Semaphore, Name_No);
end if;
-------------
-- Polling --
-------------
-- pragma Polling (ON | OFF);
when Pragma_Polling =>
GNAT_Pragma;
Check_Arg_Count (1);
Check_No_Identifiers;
Check_Arg_Is_One_Of (Arg1, Name_On, Name_Off);
Polling_Required := (Chars (Expression (Arg1)) = Name_On);
------------------
-- Preelaborate --
------------------
-- pragma Preelaborate [(library_unit_NAME)];
-- Set the flag Is_Preelaborated of program unit name entity
when Pragma_Preelaborate => Preelaborate : declare
Ent : Entity_Id;
Pa : Node_Id := Parent (N);
Pk : Node_Kind := Nkind (Pa);
begin
Check_Ada_83_Warning;
Check_Valid_Library_Unit_Pragma;
if Nkind (N) = N_Null_Statement then
return;
end if;
Ent := Find_Lib_Unit_Name;
-- This filters out pragmas inside generic parent then
-- show up inside instantiation
if Present (Ent)
and then not (Pk = N_Package_Specification
and then Present (Generic_Parent (Pa)))
then
if not Debug_Flag_U then
Set_Is_Preelaborated (Ent);
Set_Suppress_Elaboration_Warnings (Ent);
end if;
end if;
end Preelaborate;
--------------
-- Priority --
--------------
-- pragma Priority (EXPRESSION);
when Pragma_Priority => Priority : declare
P : constant Node_Id := Parent (N);
Arg : Node_Id;
begin
Check_No_Identifiers;
Check_Arg_Count (1);
Arg := Expression (Arg1);
Analyze_And_Resolve (Arg, Standard_Integer);
if not Is_Static_Expression (Arg) then
Check_Restriction (Static_Priorities, Arg);
end if;
-- Subprogram case
if Nkind (P) = N_Subprogram_Body then
Check_In_Main_Program;
-- Must be static
if not Is_Static_Expression (Arg) then
Error_Pragma_Arg
("main subprogram priority is not static", Arg1);
-- If constraint error, then we already signalled an error
elsif Raises_Constraint_Error (Arg) then
null;
-- Otherwise check in range
else
declare
Val : constant Uint := Expr_Value (Arg);
begin
if Val < 0
or else Val > Expr_Value (Expression
(Parent (RTE (RE_Max_Priority))))
then
Error_Pragma_Arg
("main subprogram priority is out of range", Arg1);
end if;
end;
end if;
Set_Main_Priority
(Current_Sem_Unit, UI_To_Int (Expr_Value (Arg)));
-- Task or Protected, must be of type Integer
elsif Nkind (P) = N_Protected_Definition
or else
Nkind (P) = N_Task_Definition
then
if Expander_Active then
Rewrite (Arg,
Convert_To (RTE (RE_Any_Priority), Arg));
end if;
-- Anything else is incorrect
else
Pragma_Misplaced;
end if;
if Has_Priority_Pragma (P) then
Error_Pragma ("duplicate pragma% not allowed");
else
Set_Has_Priority_Pragma (P, True);
if Nkind (P) = N_Protected_Definition
or else
Nkind (P) = N_Task_Definition
then
Record_Rep_Item (Defining_Identifier (Parent (P)), N);
-- exp_ch9 should use this ???
end if;
end if;
end Priority;
--------------------------
-- Propagate_Exceptions --
--------------------------
-- pragma Propagate_Exceptions;
when Pragma_Propagate_Exceptions =>
GNAT_Pragma;
Check_Arg_Count (0);
if In_Extended_Main_Source_Unit (N) then
Propagate_Exceptions := True;
end if;
------------------
-- Psect_Object --
------------------
-- pragma Psect_Object (
-- [Internal =>] LOCAL_NAME,
-- [, [External =>] EXTERNAL_SYMBOL]
-- [, [Size =>] EXTERNAL_SYMBOL]);
when Pragma_Psect_Object | Pragma_Common_Object =>
Psect_Object : declare
Args : Args_List (1 .. 3);
Names : Name_List (1 .. 3) := (
Name_Internal,
Name_External,
Name_Size);
Internal : Node_Id renames Args (1);
External : Node_Id renames Args (2);
Size : Node_Id renames Args (3);
R_Internal : Node_Id;
R_External : Node_Id;
MA : Node_Id;
Str : String_Id;
Def_Id : Entity_Id;
procedure Check_Too_Long (Arg : Node_Id);
-- Posts message if the argument is an identifier with more
-- than 31 characters, or a string literal with more than
-- 31 characters, and we are operating under VMS
procedure Check_Too_Long (Arg : Node_Id) is
X : Node_Id := Original_Node (Arg);
begin
if Nkind (X) /= N_String_Literal
and then
Nkind (X) /= N_Identifier
then
Error_Pragma_Arg
("inappropriate argument for pragma %", Arg);
end if;
if OpenVMS_On_Target then
if (Nkind (X) = N_String_Literal
and then String_Length (Strval (X)) > 31)
or else
(Nkind (X) = N_Identifier
and then Length_Of_Name (Chars (X)) > 31)
then
Error_Pragma_Arg
("argument for pragma % is longer than 31 characters",
Arg);
end if;
end if;
end Check_Too_Long;
-- Start of processing for Common_Object/Psect_Object
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
Process_Extended_Import_Export_Internal_Arg (Internal);
R_Internal := Relocate_Node (Internal);
Def_Id := Entity (R_Internal);
if Ekind (Def_Id) /= E_Constant
and then Ekind (Def_Id) /= E_Variable
then
Error_Pragma_Arg
("pragma% must designate an object", Internal);
end if;
Check_Too_Long (R_Internal);
if Is_Imported (Def_Id) or else Is_Exported (Def_Id) then
Error_Pragma_Arg
("cannot use pragma% for imported/exported object",
R_Internal);
end if;
if Is_Concurrent_Type (Etype (R_Internal)) then
Error_Pragma_Arg
("cannot specify pragma % for task/protected object",
R_Internal);
end if;
if Is_Psected (Def_Id) then
Error_Msg_N ("?duplicate Psect_Object pragma", N);
else
Set_Is_Psected (Def_Id);
end if;
if Ekind (Def_Id) = E_Constant then
Error_Pragma_Arg
("cannot specify pragma % for a constant", R_Internal);
end if;
if Is_Record_Type (Etype (R_Internal)) then
declare
Ent : Entity_Id;
Decl : Entity_Id;
begin
Ent := First_Entity (Etype (R_Internal));
while Present (Ent) loop
Decl := Declaration_Node (Ent);
if Ekind (Ent) = E_Component
and then Nkind (Decl) = N_Component_Declaration
and then Present (Expression (Decl))
then
Error_Msg_N
("?object for pragma % has defaults", R_Internal);
exit;
else
Next_Entity (Ent);
end if;
end loop;
end;
end if;
if Present (Size) then
Check_Too_Long (Size);
end if;
-- Make Psect case-insensitive.
if Present (External) then
Check_Too_Long (External);
if Nkind (External) = N_String_Literal then
String_To_Name_Buffer (Strval (External));
else
Get_Name_String (Chars (External));
end if;
Set_All_Upper_Case;
Start_String;
Store_String_Chars (Name_Buffer (1 .. Name_Len));
Str := End_String;
R_External := Make_String_Literal
(Sloc => Sloc (External), Strval => Str);
else
Get_Name_String (Chars (Internal));
Set_All_Upper_Case;
Start_String;
Store_String_Chars (Name_Buffer (1 .. Name_Len));
Str := End_String;
R_External := Make_String_Literal
(Sloc => Sloc (Internal), Strval => Str);
end if;
-- Transform into pragma Linker_Section, add attributes to
-- match what DEC Ada does. Ignore size for now?
Rewrite (N,
Make_Pragma
(Sloc (N),
Name_Linker_Section,
New_List
(Make_Pragma_Argument_Association
(Sloc => Sloc (R_Internal),
Expression => R_Internal),
Make_Pragma_Argument_Association
(Sloc => Sloc (R_External),
Expression => R_External))));
Analyze (N);
-- Add Machine_Attribute of "overlaid", so the section overlays
-- other sections of the same name.
Start_String;
Store_String_Chars ("overlaid");
Str := End_String;
MA :=
Make_Pragma
(Sloc (N),
Name_Machine_Attribute,
New_List
(Make_Pragma_Argument_Association
(Sloc => Sloc (R_Internal),
Expression => R_Internal),
Make_Pragma_Argument_Association
(Sloc => Sloc (R_External),
Expression =>
Make_String_Literal
(Sloc => Sloc (R_External),
Strval => Str))));
Analyze (MA);
-- Add Machine_Attribute of "global", so the section is visible
-- everywhere
Start_String;
Store_String_Chars ("global");
Str := End_String;
MA :=
Make_Pragma
(Sloc (N),
Name_Machine_Attribute,
New_List
(Make_Pragma_Argument_Association
(Sloc => Sloc (R_Internal),
Expression => R_Internal),
Make_Pragma_Argument_Association
(Sloc => Sloc (R_External),
Expression =>
Make_String_Literal
(Sloc => Sloc (R_External),
Strval => Str))));
Analyze (MA);
-- Add Machine_Attribute of "initialize", so the section is
-- demand zeroed.
Start_String;
Store_String_Chars ("initialize");
Str := End_String;
MA :=
Make_Pragma
(Sloc (N),
Name_Machine_Attribute,
New_List
(Make_Pragma_Argument_Association
(Sloc => Sloc (R_Internal),
Expression => R_Internal),
Make_Pragma_Argument_Association
(Sloc => Sloc (R_External),
Expression =>
Make_String_Literal
(Sloc => Sloc (R_External),
Strval => Str))));
Analyze (MA);
end Psect_Object;
----------
-- Pure --
----------
-- pragma Pure [(library_unit_NAME)];
when Pragma_Pure => Pure : declare
Ent : Entity_Id;
begin
Check_Ada_83_Warning;
Check_Valid_Library_Unit_Pragma;
if Nkind (N) = N_Null_Statement then
return;
end if;
Ent := Find_Lib_Unit_Name;
Set_Is_Pure (Ent);
Set_Suppress_Elaboration_Warnings (Ent);
end Pure;
-------------------
-- Pure_Function --
-------------------
-- pragma Pure_Function ([Entity =>] function_LOCAL_NAME);
when Pragma_Pure_Function => Pure_Function : declare
E_Id : Node_Id;
E : Entity_Id;
Def_Id : Entity_Id;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Arg_Is_Local_Name (Arg1);
E_Id := Expression (Arg1);
if Error_Posted (E_Id) then
return;
end if;
-- Loop through homonyms (overloadings) of referenced entity
E := Entity (E_Id);
while Present (E) loop
Def_Id := Get_Base_Subprogram (E);
if Ekind (Def_Id) /= E_Function
and then Ekind (Def_Id) /= E_Generic_Function
and then Ekind (Def_Id) /= E_Operator
then
Error_Pragma_Arg ("pragma% requires a function name", Arg1);
end if;
Set_Is_Pure (Def_Id);
Set_Has_Pragma_Pure_Function (Def_Id);
E := Homonym (E);
end loop;
end Pure_Function;
--------------------
-- Queuing_Policy --
--------------------
-- pragma Queuing_Policy (policy_IDENTIFIER);
when Pragma_Queuing_Policy => declare
QP : Character;
begin
Check_Ada_83_Warning;
Check_Arg_Count (1);
Check_No_Identifiers;
Check_Arg_Is_Queuing_Policy (Arg1);
Check_Valid_Configuration_Pragma;
Get_Name_String (Chars (Expression (Arg1)));
QP := Fold_Upper (Name_Buffer (1));
if Queuing_Policy /= ' '
and then Queuing_Policy /= QP
then
Error_Msg_Sloc := Queuing_Policy_Sloc;
Error_Pragma ("queuing policy incompatible with policy#");
else
Queuing_Policy := QP;
Queuing_Policy_Sloc := Loc;
end if;
end;
---------------------------
-- Remote_Call_Interface --
---------------------------
-- pragma Remote_Call_Interface [(library_unit_NAME)];
when Pragma_Remote_Call_Interface => Remote_Call_Interface : declare
Cunit_Node : Node_Id;
Cunit_Ent : Entity_Id;
K : Node_Kind;
begin
Check_Ada_83_Warning;
Check_Valid_Library_Unit_Pragma;
if Nkind (N) = N_Null_Statement then
return;
end if;
Cunit_Node := Cunit (Current_Sem_Unit);
K := Nkind (Unit (Cunit_Node));
Cunit_Ent := Cunit_Entity (Current_Sem_Unit);
if K = N_Package_Declaration
or else K = N_Generic_Package_Declaration
or else K = N_Subprogram_Declaration
or else K = N_Generic_Subprogram_Declaration
or else (K = N_Subprogram_Body
and then Acts_As_Spec (Unit (Cunit_Node)))
then
null;
else
Error_Pragma (
"pragma% must apply to package or subprogram declaration");
end if;
Set_Is_Remote_Call_Interface (Cunit_Ent);
end Remote_Call_Interface;
------------------
-- Remote_Types --
------------------
-- pragma Remote_Types [(library_unit_NAME)];
when Pragma_Remote_Types => Remote_Types : declare
Cunit_Node : Node_Id;
Cunit_Ent : Entity_Id;
begin
Check_Ada_83_Warning;
Check_Valid_Library_Unit_Pragma;
if Nkind (N) = N_Null_Statement then
return;
end if;
Cunit_Node := Cunit (Current_Sem_Unit);
Cunit_Ent := Cunit_Entity (Current_Sem_Unit);
if Nkind (Unit (Cunit_Node)) /= N_Package_Declaration
and then
Nkind (Unit (Cunit_Node)) /= N_Generic_Package_Declaration
then
Error_Pragma (
"pragma% can only apply to a package declaration");
end if;
Set_Is_Remote_Types (Cunit_Ent);
end Remote_Types;
---------------
-- Ravenscar --
---------------
when Pragma_Ravenscar =>
GNAT_Pragma;
Check_Arg_Count (0);
Check_Valid_Configuration_Pragma;
Set_Ravenscar;
-------------------------
-- Restricted_Run_Time --
-------------------------
when Pragma_Restricted_Run_Time =>
GNAT_Pragma;
Check_Arg_Count (0);
Check_Valid_Configuration_Pragma;
Set_Restricted_Profile;
------------------
-- Restrictions --
------------------
-- pragma Restrictions (RESTRICTION {, RESTRICTION});
-- RESTRICTION ::=
-- restriction_IDENTIFIER
-- | restriction_parameter_IDENTIFIER => EXPRESSION
when Pragma_Restrictions => Restrictions_Pragma : declare
Arg : Node_Id;
R_Id : Restriction_Id;
RP_Id : Restriction_Parameter_Id;
Id : Name_Id;
Expr : Node_Id;
Val : Uint;
begin
Check_Ada_83_Warning;
Check_At_Least_N_Arguments (1);
Check_Valid_Configuration_Pragma;
Arg := Arg1;
while Present (Arg) loop
Id := Chars (Arg);
Expr := Expression (Arg);
-- Case of no restriction identifier
if Id = No_Name then
if Nkind (Expr) /= N_Identifier then
Error_Pragma_Arg
("invalid form for restriction", Arg);
else
R_Id := Get_Restriction_Id (Chars (Expr));
if R_Id = Not_A_Restriction_Id then
Error_Pragma_Arg
("invalid restriction identifier", Arg);
-- Restriction is active
else
Restrictions (R_Id) := True;
Restrictions_Loc (R_Id) := Sloc (N);
-- Record the restriction if we are in the main unit,
-- or in the extended main unit. The reason that we
-- test separately for Main_Unit is that gnat.adc is
-- processed with Current_Sem_Unit = Main_Unit, but
-- nodes in gnat.adc do not appear to be the extended
-- main source unit (they probably should do ???)
if Current_Sem_Unit = Main_Unit
or else In_Extended_Main_Source_Unit (N)
then
Main_Restrictions (R_Id) := True;
end if;
-- A very special case that must be processed here:
-- pragma Restrictions (No_Exceptions) turns off all
-- run-time checking. This is a bit dubious in terms
-- of the formal language definition, but it is what
-- is intended by the wording of RM H.4(12).
if R_Id = No_Exceptions then
Scope_Suppress := (others => True);
end if;
end if;
end if;
-- Case of restriction identifier present
else
RP_Id := Get_Restriction_Parameter_Id (Id);
Analyze_And_Resolve (Expr, Any_Integer);
if RP_Id = Not_A_Restriction_Parameter_Id then
Error_Pragma_Arg
("invalid restriction parameter identifier", Arg);
elsif not Is_OK_Static_Expression (Expr)
or else not Is_Integer_Type (Etype (Expr))
or else Expr_Value (Expr) < 0
then
Error_Pragma_Arg
("value must be non-negative static integer", Arg);
-- Restriction pragma is active
else
Val := Expr_Value (Expr);
-- Record pragma if most restrictive so far
if Restriction_Parameters (RP_Id) = No_Uint
or else Val < Restriction_Parameters (RP_Id)
then
Restriction_Parameters (RP_Id) := Expr_Value (Expr);
Restriction_Parameters_Loc (RP_Id) := Sloc (N);
end if;
end if;
end if;
Next (Arg);
end loop;
end Restrictions_Pragma;
----------------
-- Reviewable --
----------------
-- pragma Reviewable;
when Pragma_Reviewable =>
Check_Ada_83_Warning;
Check_Arg_Count (0);
-------------------
-- Share_Generic --
-------------------
-- pragma Share_Generic (NAME {, NAME});
when Pragma_Share_Generic =>
GNAT_Pragma;
Process_Generic_List;
------------
-- Shared --
------------
-- pragma Shared (LOCAL_NAME);
when Pragma_Shared =>
Process_Atomic_Shared_Volatile;
--------------------
-- Shared_Passive --
--------------------
-- pragma Shared_Passive [(library_unit_NAME)];
-- Set the flag Is_Shared_Passive of program unit name entity
when Pragma_Shared_Passive => Shared_Passive : declare
Cunit_Node : Node_Id;
Cunit_Ent : Entity_Id;
begin
Check_Ada_83_Warning;
Check_Valid_Library_Unit_Pragma;
if Nkind (N) = N_Null_Statement then
return;
end if;
Cunit_Node := Cunit (Current_Sem_Unit);
Cunit_Ent := Cunit_Entity (Current_Sem_Unit);
if Nkind (Unit (Cunit_Node)) /= N_Package_Declaration
and then
Nkind (Unit (Cunit_Node)) /= N_Generic_Package_Declaration
then
Error_Pragma (
"pragma% can only apply to a package declaration");
end if;
Set_Is_Shared_Passive (Cunit_Ent);
end Shared_Passive;
----------------------
-- Source_File_Name --
----------------------
-- pragma Source_File_Name (
-- [UNIT_NAME =>] unit_NAME,
-- [BODY_FILE_NAME | SPEC_FILE_NAME] => STRING_LITERAL);
-- No processing here. Processing was completed during parsing,
-- since we need to have file names set as early as possible.
-- Units are loaded well before semantic processing starts.
-- The only processing we defer to this point is the check
-- for correct placement.
when Pragma_Source_File_Name =>
GNAT_Pragma;
Check_Valid_Configuration_Pragma;
----------------------
-- Source_Reference --
----------------------
-- pragma Source_Reference (INTEGER_LITERAL [, STRING_LITERAL]);
-- Nothing to do, all processing completed in Par.Prag, since we
-- need the information for possible parser messages that are output
when Pragma_Source_Reference =>
GNAT_Pragma;
------------------
-- Storage_Size --
------------------
-- pragma Storage_Size (EXPRESSION);
when Pragma_Storage_Size => Storage_Size : declare
P : constant Node_Id := Parent (N);
X : Node_Id;
begin
Check_No_Identifiers;
Check_Arg_Count (1);
-- Set In_Default_Expression for per-object case???
X := Expression (Arg1);
Analyze_And_Resolve (X, Any_Integer);
if not Is_Static_Expression (X) then
Check_Restriction (Static_Storage_Size, X);
end if;
if Nkind (P) /= N_Task_Definition then
Pragma_Misplaced;
return;
else
if Has_Storage_Size_Pragma (P) then
Error_Pragma ("duplicate pragma% not allowed");
else
Set_Has_Storage_Size_Pragma (P, True);
end if;
Record_Rep_Item (Defining_Identifier (Parent (P)), N);
-- ??? exp_ch9 should use this!
end if;
end Storage_Size;
------------------
-- Storage_Unit --
------------------
-- pragma Storage_Unit (NUMERIC_LITERAL);
-- Only permitted argument is System'Storage_Unit value
when Pragma_Storage_Unit =>
Check_No_Identifiers;
Check_Arg_Count (1);
Check_Arg_Is_Integer_Literal (Arg1);
if Intval (Expression (Arg1)) /=
UI_From_Int (Ttypes.System_Storage_Unit)
then
Error_Msg_Uint_1 := UI_From_Int (Ttypes.System_Storage_Unit);
Error_Pragma_Arg
("the only allowed argument for pragma% is ^", Arg1);
end if;
--------------------
-- Stream_Convert --
--------------------
-- pragma Stream_Convert (
-- [Entity =>] type_LOCAL_NAME,
-- [Read =>] function_NAME,
-- [Write =>] function NAME);
when Pragma_Stream_Convert => Stream_Convert : begin
GNAT_Pragma;
Check_Arg_Count (3);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Optional_Identifier (Arg2, Name_Read);
Check_Optional_Identifier (Arg3, Name_Write);
Check_Arg_Is_Local_Name (Arg1);
Check_Non_Overloaded_Function (Arg2);
Check_Non_Overloaded_Function (Arg3);
declare
Typ : constant Entity_Id :=
Underlying_Type (Entity (Expression (Arg1)));
Read : constant Entity_Id := Entity (Expression (Arg2));
Write : constant Entity_Id := Entity (Expression (Arg3));
begin
if Etype (Typ) = Any_Type
or else
Etype (Read) = Any_Type
or else
Etype (Write) = Any_Type
then
return;
end if;
Check_First_Subtype (Arg1);
if Rep_Item_Too_Early (Typ, N)
or else
Rep_Item_Too_Late (Typ, N)
then
return;
end if;
if Underlying_Type (Etype (Read)) /= Typ then
Error_Pragma_Arg
("incorrect return type for function&", Arg2);
end if;
if Underlying_Type (Etype (First_Formal (Write))) /= Typ then
Error_Pragma_Arg
("incorrect parameter type for function&", Arg3);
end if;
if Underlying_Type (Etype (First_Formal (Read))) /=
Underlying_Type (Etype (Write))
then
Error_Pragma_Arg
("result type of & does not match Read parameter type",
Arg3);
end if;
end;
end Stream_Convert;
-------------------------
-- Style_Checks (GNAT) --
-------------------------
-- pragma Style_Checks (On | Off | ALL_CHECKS | STRING_LITERAL);
-- This is processed by the parser since some of the style
-- checks take place during source scanning and parsing. This
-- means that we don't need to issue error messages here.
when Pragma_Style_Checks => Style_Checks : declare
A : constant Node_Id := Expression (Arg1);
S : String_Id;
C : Char_Code;
begin
GNAT_Pragma;
Check_No_Identifiers;
-- Two argument form
if Arg_Count = 2 then
Check_Arg_Is_One_Of (Arg1, Name_On, Name_Off);
declare
E_Id : Node_Id;
E : Entity_Id;
begin
E_Id := Expression (Arg2);
Analyze (E_Id);
if not Is_Entity_Name (E_Id) then
Error_Pragma_Arg
("second argument of pragma% must be entity name",
Arg2);
end if;
E := Entity (E_Id);
if E = Any_Id then
return;
else
loop
Set_Suppress_Style_Checks (E,
(Chars (Expression (Arg1)) = Name_Off));
exit when No (Homonym (E));
E := Homonym (E);
end loop;
end if;
end;
-- One argument form
else
Check_Arg_Count (1);
if Nkind (A) = N_String_Literal then
S := Strval (A);
declare
Slen : Natural := Natural (String_Length (S));
Options : String (1 .. Slen);
J : Natural;
begin
J := 1;
loop
C := Get_String_Char (S, Int (J));
exit when not In_Character_Range (C);
Options (J) := Get_Character (C);
if J = Slen then
Set_Style_Check_Options (Options);
exit;
else
J := J + 1;
end if;
end loop;
end;
elsif Nkind (A) = N_Identifier then
if Chars (A) = Name_All_Checks then
Set_Default_Style_Check_Options;
elsif Chars (A) = Name_On then
Style_Check := True;
elsif Chars (A) = Name_Off then
Style_Check := False;
end if;
end if;
end if;
end Style_Checks;
--------------
-- Subtitle --
--------------
-- pragma Subtitle ([Subtitle =>] STRING_LITERAL);
when Pragma_Subtitle =>
GNAT_Pragma;
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, Name_Subtitle);
Check_Arg_Is_String_Literal (Arg1);
--------------
-- Suppress --
--------------
-- pragma Suppress (IDENTIFIER [, [On =>] NAME]);
when Pragma_Suppress =>
Process_Suppress_Unsuppress (True);
------------------
-- Suppress_All --
------------------
-- pragma Suppress_All;
-- The only check made here is that the pragma appears in the
-- proper place, i.e. following a compilation unit. If indeed
-- it appears in this context, then the parser has already
-- inserted an equivalent pragma Suppress (All_Checks) to get
-- the required effect.
when Pragma_Suppress_All =>
GNAT_Pragma;
Check_Arg_Count (0);
if Nkind (Parent (N)) /= N_Compilation_Unit_Aux
or else not Is_List_Member (N)
or else List_Containing (N) /= Pragmas_After (Parent (N))
then
Error_Pragma
("misplaced pragma%, must follow compilation unit");
end if;
-------------------------
-- Suppress_Debug_Info --
-------------------------
-- pragma Suppress_Debug_Info ([Entity =>] LOCAL_NAME);
when Pragma_Suppress_Debug_Info =>
GNAT_Pragma;
Check_Arg_Count (1);
Check_Arg_Is_Local_Name (Arg1);
Check_Optional_Identifier (Arg1, Name_Entity);
Set_Debug_Info_Off (Entity (Get_Pragma_Arg (Arg1)));
-----------------------------
-- Suppress_Initialization --
-----------------------------
-- pragma Suppress_Initialization ([Entity =>] type_Name);
when Pragma_Suppress_Initialization => Suppress_Init : declare
E_Id : Node_Id;
E : Entity_Id;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Arg_Is_Local_Name (Arg1);
E_Id := Expression (Arg1);
if Etype (E_Id) = Any_Type then
return;
end if;
E := Entity (E_Id);
if Is_Type (E) then
if Is_Incomplete_Or_Private_Type (E) then
if No (Full_View (Base_Type (E))) then
Error_Pragma_Arg
("argument of pragma% cannot be an incomplete type",
Arg1);
else
Set_Suppress_Init_Proc (Full_View (Base_Type (E)));
end if;
else
Set_Suppress_Init_Proc (Base_Type (E));
end if;
else
Error_Pragma_Arg
("pragma% requires argument that is a type name", Arg1);
end if;
end Suppress_Init;
-----------------
-- System_Name --
-----------------
-- pragma System_Name (DIRECT_NAME);
-- Syntax check: one argument, which must be the identifier GNAT
-- or the identifier GCC, no other identifiers are acceptable.
when Pragma_System_Name =>
Check_No_Identifiers;
Check_Arg_Count (1);
Check_Arg_Is_One_Of (Arg1, Name_Gcc, Name_Gnat);
-----------------------------
-- Task_Dispatching_Policy --
-----------------------------
-- pragma Task_Dispatching_Policy (policy_IDENTIFIER);
when Pragma_Task_Dispatching_Policy => declare
DP : Character;
begin
Check_Ada_83_Warning;
Check_Arg_Count (1);
Check_No_Identifiers;
Check_Arg_Is_Task_Dispatching_Policy (Arg1);
Check_Valid_Configuration_Pragma;
Get_Name_String (Chars (Expression (Arg1)));
DP := Fold_Upper (Name_Buffer (1));
if Task_Dispatching_Policy /= ' '
and then Task_Dispatching_Policy /= DP
then
Error_Msg_Sloc := Task_Dispatching_Policy_Sloc;
Error_Pragma
("task dispatching policy incompatible with policy#");
else
Task_Dispatching_Policy := DP;
Task_Dispatching_Policy_Sloc := Loc;
end if;
end;
--------------
-- Task_Info --
--------------
-- pragma Task_Info (EXPRESSION);
when Pragma_Task_Info => Task_Info : declare
P : constant Node_Id := Parent (N);
begin
GNAT_Pragma;
if Nkind (P) /= N_Task_Definition then
Error_Pragma ("pragma% must appear in task definition");
end if;
Check_No_Identifiers;
Check_Arg_Count (1);
Analyze_And_Resolve (Expression (Arg1), RTE (RE_Task_Info_Type));
if Etype (Expression (Arg1)) = Any_Type then
return;
end if;
if Has_Task_Info_Pragma (P) then
Error_Pragma ("duplicate pragma% not allowed");
else
Set_Has_Task_Info_Pragma (P, True);
end if;
end Task_Info;
---------------
-- Task_Name --
---------------
-- pragma Task_Name (string_EXPRESSION);
when Pragma_Task_Name => Task_Name : declare
-- pragma Priority (EXPRESSION);
P : constant Node_Id := Parent (N);
Arg : Node_Id;
begin
Check_No_Identifiers;
Check_Arg_Count (1);
Arg := Expression (Arg1);
Analyze_And_Resolve (Arg, Standard_String);
if Nkind (P) /= N_Task_Definition then
Pragma_Misplaced;
end if;
if Has_Task_Name_Pragma (P) then
Error_Pragma ("duplicate pragma% not allowed");
else
Set_Has_Task_Name_Pragma (P, True);
Record_Rep_Item (Defining_Identifier (Parent (P)), N);
end if;
end Task_Name;
------------------
-- Task_Storage --
------------------
-- pragma Task_Storage (
-- [Task_Type =>] LOCAL_NAME,
-- [Top_Guard =>] static_integer_EXPRESSION);
when Pragma_Task_Storage => Task_Storage : declare
Args : Args_List (1 .. 2);
Names : Name_List (1 .. 2) := (
Name_Task_Type,
Name_Top_Guard);
Task_Type : Node_Id renames Args (1);
Top_Guard : Node_Id renames Args (2);
Ent : Entity_Id;
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
Check_Arg_Is_Local_Name (Task_Type);
Ent := Entity (Task_Type);
if not Is_Task_Type (Ent) then
Error_Pragma_Arg
("argument for pragma% must be task type", Task_Type);
end if;
if No (Top_Guard) then
Error_Pragma_Arg
("pragma% takes two arguments", Task_Type);
else
Check_Arg_Is_Static_Expression (Top_Guard, Any_Integer);
end if;
Check_First_Subtype (Task_Type);
if Rep_Item_Too_Late (Ent, N) then
raise Pragma_Exit;
end if;
end Task_Storage;
----------------
-- Time_Slice --
----------------
-- pragma Time_Slice (static_duration_EXPRESSION);
when Pragma_Time_Slice => Time_Slice : declare
Val : Ureal;
Nod : Node_Id;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_No_Identifiers;
Check_In_Main_Program;
Check_Arg_Is_Static_Expression (Arg1, Standard_Duration);
if not Error_Posted (Arg1) then
Nod := Next (N);
while Present (Nod) loop
if Nkind (Nod) = N_Pragma
and then Chars (Nod) = Name_Time_Slice
then
Error_Msg_Name_1 := Chars (N);
Error_Msg_N ("duplicate pragma% not permitted", Nod);
end if;
Next (Nod);
end loop;
end if;
-- Process only if in main unit
if Get_Source_Unit (Loc) = Main_Unit then
Opt.Time_Slice_Set := True;
Val := Expr_Value_R (Expression (Arg1));
if Val <= Ureal_0 then
Opt.Time_Slice_Value := 0;
elsif Val > UR_From_Uint (UI_From_Int (1000)) then
Opt.Time_Slice_Value := 1_000_000_000;
else
Opt.Time_Slice_Value :=
UI_To_Int (UR_To_Uint (Val * UI_From_Int (1_000_000)));
end if;
end if;
end Time_Slice;
-----------
-- Title --
-----------
-- pragma Title (TITLING_OPTION [, TITLING OPTION]);
-- TITLING_OPTION ::=
-- [Title =>] STRING_LITERAL
-- | [Subtitle =>] STRING_LITERAL
when Pragma_Title => Title : declare
Args : Args_List (1 .. 2);
Names : Name_List (1 .. 2) := (
Name_Title,
Name_Subtitle);
begin
GNAT_Pragma;
Gather_Associations (Names, Args);
for J in 1 .. 2 loop
if Present (Args (J)) then
Check_Arg_Is_String_Literal (Args (J));
end if;
end loop;
end Title;
---------------------
-- Unchecked_Union --
---------------------
-- pragma Unchecked_Union (first_subtype_LOCAL_NAME)
when Pragma_Unchecked_Union => Unchecked_Union : declare
Assoc : Node_Id := Arg1;
Type_Id : Node_Id := Expression (Assoc);
Typ : Entity_Id;
Discr : Entity_Id;
Tdef : Node_Id;
Clist : Node_Id;
Vpart : Node_Id;
Comp : Node_Id;
Variant : Node_Id;
begin
GNAT_Pragma;
Check_No_Identifiers;
Check_Arg_Count (1);
Check_Arg_Is_Local_Name (Arg1);
Find_Type (Type_Id);
Typ := Entity (Type_Id);
if Typ = Any_Type
or else Rep_Item_Too_Early (Typ, N)
then
return;
else
Typ := Underlying_Type (Typ);
end if;
if Rep_Item_Too_Late (Typ, N) then
return;
end if;
Check_First_Subtype (Arg1);
-- Note remaining cases are references to a type in the current
-- declarative part. If we find an error, we post the error on
-- the relevant type declaration at an appropriate point.
if not Is_Record_Type (Typ) then
Error_Msg_N ("Unchecked_Union must be record type", Typ);
return;
elsif Is_Tagged_Type (Typ) then
Error_Msg_N ("Unchecked_Union must not be tagged", Typ);
return;
elsif Is_Limited_Type (Typ) then
Error_Msg_N
("Unchecked_Union must not be limited record type", Typ);
return;
else
if not Has_Discriminants (Typ) then
Error_Msg_N
("Unchecked_Union must have one discriminant", Typ);
return;
end if;
Discr := First_Discriminant (Typ);
if Present (Next_Discriminant (Discr)) then
Error_Msg_N
("Unchecked_Union must have exactly one discriminant",
Next_Discriminant (Discr));
return;
end if;
if No (Discriminant_Default_Value (Discr)) then
Error_Msg_N
("Unchecked_Union discriminant must have default value",
Discr);
end if;
Tdef := Type_Definition (Declaration_Node (Typ));
Clist := Component_List (Tdef);
if No (Clist) or else No (Variant_Part (Clist)) then
Error_Msg_N
("Unchecked_Union must have variant part",
Tdef);
return;
end if;
Vpart := Variant_Part (Clist);
if Is_Non_Empty_List (Component_Items (Clist)) then
Error_Msg_N
("components before variant not allowed " &
"in Unchecked_Union",
First (Component_Items (Clist)));
end if;
Variant := First (Variants (Vpart));
while Present (Variant) loop
Clist := Component_List (Variant);
if Present (Variant_Part (Clist)) then
Error_Msg_N
("Unchecked_Union may not have nested variants",
Variant_Part (Clist));
end if;
if not Is_Non_Empty_List (Component_Items (Clist)) then
Error_Msg_N
("Unchecked_Union may not have empty component list",
Variant);
return;
end if;
Comp := First (Component_Items (Clist));
if Nkind (Comp) = N_Component_Declaration then
if Present (Expression (Comp)) then
Error_Msg_N
("default initialization not allowed " &
"in Unchecked_Union",
Expression (Comp));
end if;
declare
Sindic : constant Node_Id :=
Subtype_Indication (Comp);
begin
if Nkind (Sindic) = N_Subtype_Indication then
Check_Static_Constraint (Constraint (Sindic));
end if;
end;
end if;
if Present (Next (Comp)) then
Error_Msg_N
("Unchecked_Union variant can have only one component",
Next (Comp));
end if;
Next (Variant);
end loop;
end if;
Set_Is_Unchecked_Union (Typ, True);
Set_Suppress_Discriminant_Checks (Typ, True);
Set_Convention (Typ, Convention_C);
Set_Has_Unchecked_Union (Base_Type (Typ), True);
Set_Is_Unchecked_Union (Base_Type (Typ), True);
end Unchecked_Union;
------------------------
-- Unimplemented_Unit --
------------------------
-- pragma Unimplemented_Unit;
-- Note: this only gives an error if we are generating code,
-- or if we are in a generic library unit (where the pragma
-- appears in the body, not in the spec).
when Pragma_Unimplemented_Unit => Unimplemented_Unit : declare
Cunitent : Entity_Id := Cunit_Entity (Get_Source_Unit (Loc));
Ent_Kind : Entity_Kind := Ekind (Cunitent);
begin
GNAT_Pragma;
Check_Arg_Count (0);
if Operating_Mode = Generate_Code
or else Ent_Kind = E_Generic_Function
or else Ent_Kind = E_Generic_Procedure
or else Ent_Kind = E_Generic_Package
then
Get_Name_String (Chars (Cunitent));
Set_Casing (Mixed_Case);
Write_Str (Name_Buffer (1 .. Name_Len));
Write_Str (" is not implemented");
Write_Eol;
raise Unrecoverable_Error;
end if;
end Unimplemented_Unit;
------------------------------
-- Unreserve_All_Interrupts --
------------------------------
-- pragma Unreserve_All_Interrupts;
when Pragma_Unreserve_All_Interrupts =>
GNAT_Pragma;
Check_Arg_Count (0);
if In_Extended_Main_Code_Unit (Main_Unit_Entity) then
Unreserve_All_Interrupts := True;
end if;
----------------
-- Unsuppress --
----------------
-- pragma Unsuppress (IDENTIFIER [, [On =>] NAME]);
when Pragma_Unsuppress =>
GNAT_Pragma;
Process_Suppress_Unsuppress (False);
-------------------
-- Use_VADS_Size --
-------------------
-- pragma Use_VADS_Size;
when Pragma_Use_VADS_Size =>
GNAT_Pragma;
Check_Arg_Count (0);
Check_Valid_Configuration_Pragma;
Use_VADS_Size := True;
---------------------
-- Validity_Checks --
---------------------
-- pragma Validity_Checks (On | Off | ALL_CHECKS | STRING_LITERAL);
when Pragma_Validity_Checks => Validity_Checks : declare
A : constant Node_Id := Expression (Arg1);
S : String_Id;
C : Char_Code;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_No_Identifiers;
if Nkind (A) = N_String_Literal then
S := Strval (A);
declare
Slen : Natural := Natural (String_Length (S));
Options : String (1 .. Slen);
J : Natural;
begin
J := 1;
loop
C := Get_String_Char (S, Int (J));
exit when not In_Character_Range (C);
Options (J) := Get_Character (C);
if J = Slen then
Set_Validity_Check_Options (Options);
exit;
else
J := J + 1;
end if;
end loop;
end;
elsif Nkind (A) = N_Identifier then
if Chars (A) = Name_All_Checks then
Set_Validity_Check_Options ("a");
elsif Chars (A) = Name_On then
Validity_Checks_On := True;
elsif Chars (A) = Name_Off then
Validity_Checks_On := False;
end if;
end if;
end Validity_Checks;
--------------
-- Volatile --
--------------
-- pragma Volatile (LOCAL_NAME);
when Pragma_Volatile =>
Process_Atomic_Shared_Volatile;
-------------------------
-- Volatile_Components --
-------------------------
-- pragma Volatile_Components (array_LOCAL_NAME);
-- Volatile is handled by the same circuit as Atomic_Components
--------------
-- Warnings --
--------------
-- pragma Warnings (On | Off, [LOCAL_NAME])
when Pragma_Warnings =>
GNAT_Pragma;
Check_At_Least_N_Arguments (1);
Check_At_Most_N_Arguments (2);
Check_No_Identifiers;
-- One argument case was processed by parser in Par.Prag
if Arg_Count /= 1 then
Check_Arg_Is_One_Of (Arg1, Name_On, Name_Off);
Check_Arg_Count (2);
declare
E_Id : Node_Id;
E : Entity_Id;
begin
E_Id := Expression (Arg2);
Analyze (E_Id);
if not Is_Entity_Name (E_Id) then
Error_Pragma_Arg
("second argument of pragma% must be entity name",
Arg2);
end if;
E := Entity (E_Id);
if E = Any_Id then
return;
else
loop
Set_Warnings_Off (E,
(Chars (Expression (Arg1)) = Name_Off));
if Is_Enumeration_Type (E) then
declare
Lit : Entity_Id := First_Literal (E);
begin
while Present (Lit) loop
Set_Warnings_Off (Lit);
Next_Literal (Lit);
end loop;
end;
end if;
exit when No (Homonym (E));
E := Homonym (E);
end loop;
end if;
end;
end if;
-------------------
-- Weak_External --
-------------------
-- pragma Weak_External ([Entity =>] LOCAL_NAME);
when Pragma_Weak_External => Weak_External : declare
Ent : Entity_Id;
begin
GNAT_Pragma;
Check_Arg_Count (1);
Check_Optional_Identifier (Arg1, Name_Entity);
Check_Arg_Is_Library_Level_Local_Name (Arg1);
Ent := Entity (Expression (Arg1));
if Rep_Item_Too_Early (Ent, N) then
return;
else
Ent := Underlying_Type (Ent);
end if;
-- The only processing required is to link this item on to the
-- list of rep items for the given entity. This is accomplished
-- by the call to Rep_Item_Too_Late (when no error is detected
-- and False is returned).
if Rep_Item_Too_Late (Ent, N) then
return;
else
Set_Has_Gigi_Rep_Item (Ent);
end if;
end Weak_External;
end case;
exception
when Pragma_Exit => null;
end Analyze_Pragma;
-------------------------
-- Get_Base_Subprogram --
-------------------------
function Get_Base_Subprogram (Def_Id : Entity_Id) return Entity_Id is
Result : Entity_Id;
begin
Result := Def_Id;
-- Follow subprogram renaming chain
while Is_Subprogram (Result)
and then
(Is_Generic_Instance (Result)
or else Nkind (Parent (Declaration_Node (Result))) =
N_Subprogram_Renaming_Declaration)
and then Present (Alias (Result))
loop
Result := Alias (Result);
end loop;
return Result;
end Get_Base_Subprogram;
---------------------------
-- Is_Generic_Subprogram --
---------------------------
function Is_Generic_Subprogram (Id : Entity_Id) return Boolean is
begin
return Ekind (Id) = E_Generic_Procedure
or else Ekind (Id) = E_Generic_Function;
end Is_Generic_Subprogram;
------------------------------
-- Is_Pragma_String_Literal --
------------------------------
-- This function returns true if the corresponding pragma argument is
-- a static string expression. These are the only cases in which string
-- literals can appear as pragma arguments. We also allow a string
-- literal as the first argument to pragma Assert (although it will
-- of course always generate a type error).
function Is_Pragma_String_Literal (Par : Node_Id) return Boolean is
Pragn : constant Node_Id := Parent (Par);
Assoc : constant List_Id := Pragma_Argument_Associations (Pragn);
Pname : constant Name_Id := Chars (Pragn);
Argn : Natural;
N : Node_Id;
begin
Argn := 1;
N := First (Assoc);
loop
exit when N = Par;
Argn := Argn + 1;
Next (N);
end loop;
if Pname = Name_Assert then
return True;
elsif Pname = Name_Export then
return Argn > 2;
elsif Pname = Name_Ident then
return Argn = 1;
elsif Pname = Name_Import then
return Argn > 2;
elsif Pname = Name_Interface_Name then
return Argn > 1;
elsif Pname = Name_Linker_Alias then
return Argn = 2;
elsif Pname = Name_Linker_Section then
return Argn = 2;
elsif Pname = Name_Machine_Attribute then
return Argn = 2;
elsif Pname = Name_Source_File_Name then
return True;
elsif Pname = Name_Source_Reference then
return Argn = 2;
elsif Pname = Name_Title then
return True;
elsif Pname = Name_Subtitle then
return True;
else
return False;
end if;
end Is_Pragma_String_Literal;
--------------------------------------
-- Process_Compilation_Unit_Pragmas --
--------------------------------------
procedure Process_Compilation_Unit_Pragmas (N : Node_Id) is
begin
-- A special check for pragma Suppress_All. This is a strange DEC
-- pragma, strange because it comes at the end of the unit. If we
-- have a pragma Suppress_All in the Pragmas_After of the current
-- unit, then we insert a pragma Suppress (All_Checks) at the start
-- of the context clause to ensure the correct processing.
declare
PA : constant List_Id := Pragmas_After (Aux_Decls_Node (N));
P : Node_Id;
begin
if Present (PA) then
P := First (PA);
while Present (P) loop
if Chars (P) = Name_Suppress_All then
Prepend_To (Context_Items (N),
Make_Pragma (Sloc (P),
Chars => Name_Suppress,
Pragma_Argument_Associations => New_List (
Make_Pragma_Argument_Association (Sloc (P),
Expression =>
Make_Identifier (Sloc (P),
Chars => Name_All_Checks)))));
exit;
end if;
Next (P);
end loop;
end if;
end;
end Process_Compilation_Unit_Pragmas;
--------------------------------
-- Set_Encoded_Interface_Name --
--------------------------------
procedure Set_Encoded_Interface_Name (E : Entity_Id; S : Node_Id) is
Str : constant String_Id := Strval (S);
Len : constant Int := String_Length (Str);
CC : Char_Code;
C : Character;
J : Int;
Hex : constant array (0 .. 15) of Character := "0123456789abcdef";
procedure Encode;
-- Stores encoded value of character code CC. The encoding we
-- use an underscore followed by four lower case hex digits.
procedure Encode is
begin
Store_String_Char (Get_Char_Code ('_'));
Store_String_Char
(Get_Char_Code (Hex (Integer (CC / 2 ** 12))));
Store_String_Char
(Get_Char_Code (Hex (Integer (CC / 2 ** 8 and 16#0F#))));
Store_String_Char
(Get_Char_Code (Hex (Integer (CC / 2 ** 4 and 16#0F#))));
Store_String_Char
(Get_Char_Code (Hex (Integer (CC and 16#0F#))));
end Encode;
-- Start of processing for Set_Encoded_Interface_Name
begin
-- If first character is asterisk, this is a link name, and we
-- leave it completely unmodified. We also ignore null strings
-- (the latter case happens only in error cases) and no encoding
-- should occur for Java interface names.
if Len = 0
or else Get_String_Char (Str, 1) = Get_Char_Code ('*')
or else Java_VM
then
Set_Interface_Name (E, S);
else
J := 1;
loop
CC := Get_String_Char (Str, J);
exit when not In_Character_Range (CC);
C := Get_Character (CC);
exit when C /= '_' and then C /= '$'
and then C not in '0' .. '9'
and then C not in 'a' .. 'z'
and then C not in 'A' .. 'Z';
if J = Len then
Set_Interface_Name (E, S);
return;
else
J := J + 1;
end if;
end loop;
-- Here we need to encode. The encoding we use as follows:
-- three underscores + four hex digits (lower case)
Start_String;
for J in 1 .. String_Length (Str) loop
CC := Get_String_Char (Str, J);
if not In_Character_Range (CC) then
Encode;
else
C := Get_Character (CC);
if C = '_' or else C = '$'
or else C in '0' .. '9'
or else C in 'a' .. 'z'
or else C in 'A' .. 'Z'
then
Store_String_Char (CC);
else
Encode;
end if;
end if;
end loop;
Set_Interface_Name (E,
Make_String_Literal (Sloc (S),
Strval => End_String));
end if;
end Set_Encoded_Interface_Name;
-------------------
-- Set_Unit_Name --
-------------------
procedure Set_Unit_Name (N : Node_Id; With_Item : Node_Id) is
Pref : Node_Id;
Scop : Entity_Id;
begin
if Nkind (N) = N_Identifier
and then Nkind (With_Item) = N_Identifier
then
Set_Entity (N, Entity (With_Item));
elsif Nkind (N) = N_Selected_Component then
Change_Selected_Component_To_Expanded_Name (N);
Set_Entity (N, Entity (With_Item));
Set_Entity (Selector_Name (N), Entity (N));
Pref := Prefix (N);
Scop := Scope (Entity (N));
while Nkind (Pref) = N_Selected_Component loop
Change_Selected_Component_To_Expanded_Name (Pref);
Set_Entity (Selector_Name (Pref), Scop);
Set_Entity (Pref, Scop);
Pref := Prefix (Pref);
Scop := Scope (Scop);
end loop;
Set_Entity (Pref, Scop);
end if;
end Set_Unit_Name;
end Sem_Prag;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ P R A G --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Expand routines for pragmas
with Types; use Types;
package Exp_Prag is
procedure Expand_N_Pragma (N : Node_Id);
end Exp_Prag;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Ada.Characters.Wide_Wide_Latin_1;
with Ada.Wide_Wide_Text_IO;
with League.Text_Codecs;
with Slim.Message_Visiters;
package body Slim.Messages.RESP is
-------------
-- Headers --
-------------
not overriding function Headers (Self : RESP_Message)
return League.String_Vectors.Universal_String_Vector
is
Result : League.String_Vectors.Universal_String_Vector;
Split : constant League.String_Vectors.Universal_String_Vector :=
Self.Value.Split (Ada.Characters.Wide_Wide_Latin_1.LF);
Line : League.Strings.Universal_String;
begin
for J in 1 .. Split.Length loop
Line := Split.Element (J);
Ada.Wide_Wide_Text_IO.Put_Line (Line.To_Wide_Wide_String);
if not Line.Is_Empty then
Result.Append (Line.Head_To (Line.Length - 1));
end if;
end loop;
return Result;
end Headers;
----------
-- Read --
----------
overriding function Read
(Data : not null access
League.Stream_Element_Vectors.Stream_Element_Vector)
return RESP_Message
is
begin
return Result : RESP_Message do
Result.Value := League.Text_Codecs.Codec_For_Application_Locale.Decode
(Data.all);
end return;
end Read;
-----------
-- Visit --
-----------
overriding procedure Visit
(Self : not null access RESP_Message;
Visiter : in out Slim.Message_Visiters.Visiter'Class) is
begin
Visiter.RESP (Self);
end Visit;
-----------
-- Write --
-----------
overriding procedure Write
(Self : RESP_Message;
Tag : out Message_Tag;
Data : out League.Stream_Element_Vectors.Stream_Element_Vector) is
begin
Tag := "RESP";
Data := League.Text_Codecs.Codec_For_Application_Locale.Encode
(Self.Value);
end Write;
end Slim.Messages.RESP;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.Formal_Signed_Integer_Type_Definitions is
function Create
(Range_Token : not null Program.Lexical_Elements.Lexical_Element_Access;
Box_Token : not null Program.Lexical_Elements.Lexical_Element_Access)
return Formal_Signed_Integer_Type_Definition is
begin
return Result : Formal_Signed_Integer_Type_Definition :=
(Range_Token => Range_Token, Box_Token => Box_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_Formal_Signed_Integer_Type_Definition is
begin
return Result : Implicit_Formal_Signed_Integer_Type_Definition :=
(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 Range_Token
(Self : Formal_Signed_Integer_Type_Definition)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Range_Token;
end Range_Token;
overriding function Box_Token
(Self : Formal_Signed_Integer_Type_Definition)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Box_Token;
end Box_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Formal_Signed_Integer_Type_Definition)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Formal_Signed_Integer_Type_Definition)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Formal_Signed_Integer_Type_Definition)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize
(Self : aliased in out Base_Formal_Signed_Integer_Type_Definition'Class) is
begin
null;
end Initialize;
overriding function Is_Formal_Signed_Integer_Type_Definition_Element
(Self : Base_Formal_Signed_Integer_Type_Definition)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Formal_Signed_Integer_Type_Definition_Element;
overriding function Is_Formal_Type_Definition_Element
(Self : Base_Formal_Signed_Integer_Type_Definition)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Formal_Type_Definition_Element;
overriding function Is_Definition_Element
(Self : Base_Formal_Signed_Integer_Type_Definition)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Definition_Element;
overriding procedure Visit
(Self : not null access Base_Formal_Signed_Integer_Type_Definition;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Formal_Signed_Integer_Type_Definition (Self);
end Visit;
overriding function To_Formal_Signed_Integer_Type_Definition_Text
(Self : aliased in out Formal_Signed_Integer_Type_Definition)
return Program.Elements.Formal_Signed_Integer_Type_Definitions
.Formal_Signed_Integer_Type_Definition_Text_Access is
begin
return Self'Unchecked_Access;
end To_Formal_Signed_Integer_Type_Definition_Text;
overriding function To_Formal_Signed_Integer_Type_Definition_Text
(Self : aliased in out Implicit_Formal_Signed_Integer_Type_Definition)
return Program.Elements.Formal_Signed_Integer_Type_Definitions
.Formal_Signed_Integer_Type_Definition_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Formal_Signed_Integer_Type_Definition_Text;
end Program.Nodes.Formal_Signed_Integer_Type_Definitions;
|
-- This spec has been automatically generated from STM32F427x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
with System;
with HAL;
package STM32_SVD.DCMI is
pragma Preelaborate;
---------------
-- Registers --
---------------
-----------------
-- CR_Register --
-----------------
subtype CR_FCRC_Field is HAL.UInt2;
subtype CR_EDM_Field is HAL.UInt2;
-- control register 1
type CR_Register is record
-- Capture enable
CAPTURE : Boolean := False;
-- Capture mode
CM : Boolean := False;
-- Crop feature
CROP : Boolean := False;
-- JPEG format
JPEG : Boolean := False;
-- Embedded synchronization select
ESS : Boolean := False;
-- Pixel clock polarity
PCKPOL : Boolean := False;
-- Horizontal synchronization polarity
HSPOL : Boolean := False;
-- Vertical synchronization polarity
VSPOL : Boolean := False;
-- Frame capture rate control
FCRC : CR_FCRC_Field := 16#0#;
-- Extended data mode
EDM : CR_EDM_Field := 16#0#;
-- unspecified
Reserved_12_13 : HAL.UInt2 := 16#0#;
-- DCMI enable
ENABLE : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
CAPTURE at 0 range 0 .. 0;
CM at 0 range 1 .. 1;
CROP at 0 range 2 .. 2;
JPEG at 0 range 3 .. 3;
ESS at 0 range 4 .. 4;
PCKPOL at 0 range 5 .. 5;
HSPOL at 0 range 6 .. 6;
VSPOL at 0 range 7 .. 7;
FCRC at 0 range 8 .. 9;
EDM at 0 range 10 .. 11;
Reserved_12_13 at 0 range 12 .. 13;
ENABLE at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-----------------
-- SR_Register --
-----------------
-- status register
type SR_Register is record
-- Read-only. HSYNC
HSYNC : Boolean;
-- Read-only. VSYNC
VSYNC : Boolean;
-- Read-only. FIFO not empty
FNE : Boolean;
-- unspecified
Reserved_3_31 : HAL.UInt29;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
HSYNC at 0 range 0 .. 0;
VSYNC at 0 range 1 .. 1;
FNE at 0 range 2 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
------------------
-- RIS_Register --
------------------
-- raw interrupt status register
type RIS_Register is record
-- Read-only. Capture complete raw interrupt status
FRAME_RIS : Boolean;
-- Read-only. Overrun raw interrupt status
OVR_RIS : Boolean;
-- Read-only. Synchronization error raw interrupt status
ERR_RIS : Boolean;
-- Read-only. VSYNC raw interrupt status
VSYNC_RIS : Boolean;
-- Read-only. Line raw interrupt status
LINE_RIS : Boolean;
-- unspecified
Reserved_5_31 : HAL.UInt27;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for RIS_Register use record
FRAME_RIS at 0 range 0 .. 0;
OVR_RIS at 0 range 1 .. 1;
ERR_RIS at 0 range 2 .. 2;
VSYNC_RIS at 0 range 3 .. 3;
LINE_RIS at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
------------------
-- IER_Register --
------------------
-- interrupt enable register
type IER_Register is record
-- Capture complete interrupt enable
FRAME_IE : Boolean := False;
-- Overrun interrupt enable
OVR_IE : Boolean := False;
-- Synchronization error interrupt enable
ERR_IE : Boolean := False;
-- VSYNC interrupt enable
VSYNC_IE : Boolean := False;
-- Line interrupt enable
LINE_IE : Boolean := False;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IER_Register use record
FRAME_IE at 0 range 0 .. 0;
OVR_IE at 0 range 1 .. 1;
ERR_IE at 0 range 2 .. 2;
VSYNC_IE at 0 range 3 .. 3;
LINE_IE at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
------------------
-- MIS_Register --
------------------
-- masked interrupt status register
type MIS_Register is record
-- Read-only. Capture complete masked interrupt status
FRAME_MIS : Boolean;
-- Read-only. Overrun masked interrupt status
OVR_MIS : Boolean;
-- Read-only. Synchronization error masked interrupt status
ERR_MIS : Boolean;
-- Read-only. VSYNC masked interrupt status
VSYNC_MIS : Boolean;
-- Read-only. Line masked interrupt status
LINE_MIS : Boolean;
-- unspecified
Reserved_5_31 : HAL.UInt27;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for MIS_Register use record
FRAME_MIS at 0 range 0 .. 0;
OVR_MIS at 0 range 1 .. 1;
ERR_MIS at 0 range 2 .. 2;
VSYNC_MIS at 0 range 3 .. 3;
LINE_MIS at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
------------------
-- ICR_Register --
------------------
-- interrupt clear register
type ICR_Register is record
-- Write-only. Capture complete interrupt status clear
FRAME_ISC : Boolean := False;
-- Write-only. Overrun interrupt status clear
OVR_ISC : Boolean := False;
-- Write-only. Synchronization error interrupt status clear
ERR_ISC : Boolean := False;
-- Write-only. Vertical synch interrupt status clear
VSYNC_ISC : Boolean := False;
-- Write-only. line interrupt status clear
LINE_ISC : Boolean := False;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ICR_Register use record
FRAME_ISC at 0 range 0 .. 0;
OVR_ISC at 0 range 1 .. 1;
ERR_ISC at 0 range 2 .. 2;
VSYNC_ISC at 0 range 3 .. 3;
LINE_ISC at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
-------------------
-- ESCR_Register --
-------------------
subtype ESCR_FSC_Field is HAL.Byte;
subtype ESCR_LSC_Field is HAL.Byte;
subtype ESCR_LEC_Field is HAL.Byte;
subtype ESCR_FEC_Field is HAL.Byte;
-- embedded synchronization code register
type ESCR_Register is record
-- Frame start delimiter code
FSC : ESCR_FSC_Field := 16#0#;
-- Line start delimiter code
LSC : ESCR_LSC_Field := 16#0#;
-- Line end delimiter code
LEC : ESCR_LEC_Field := 16#0#;
-- Frame end delimiter code
FEC : ESCR_FEC_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ESCR_Register use record
FSC at 0 range 0 .. 7;
LSC at 0 range 8 .. 15;
LEC at 0 range 16 .. 23;
FEC at 0 range 24 .. 31;
end record;
-------------------
-- ESUR_Register --
-------------------
subtype ESUR_FSU_Field is HAL.Byte;
subtype ESUR_LSU_Field is HAL.Byte;
subtype ESUR_LEU_Field is HAL.Byte;
subtype ESUR_FEU_Field is HAL.Byte;
-- embedded synchronization unmask register
type ESUR_Register is record
-- Frame start delimiter unmask
FSU : ESUR_FSU_Field := 16#0#;
-- Line start delimiter unmask
LSU : ESUR_LSU_Field := 16#0#;
-- Line end delimiter unmask
LEU : ESUR_LEU_Field := 16#0#;
-- Frame end delimiter unmask
FEU : ESUR_FEU_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ESUR_Register use record
FSU at 0 range 0 .. 7;
LSU at 0 range 8 .. 15;
LEU at 0 range 16 .. 23;
FEU at 0 range 24 .. 31;
end record;
---------------------
-- CWSTRT_Register --
---------------------
subtype CWSTRT_HOFFCNT_Field is HAL.UInt14;
subtype CWSTRT_VST_Field is HAL.UInt13;
-- crop window start
type CWSTRT_Register is record
-- Horizontal offset count
HOFFCNT : CWSTRT_HOFFCNT_Field := 16#0#;
-- unspecified
Reserved_14_15 : HAL.UInt2 := 16#0#;
-- Vertical start line count
VST : CWSTRT_VST_Field := 16#0#;
-- unspecified
Reserved_29_31 : HAL.UInt3 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CWSTRT_Register use record
HOFFCNT at 0 range 0 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
VST at 0 range 16 .. 28;
Reserved_29_31 at 0 range 29 .. 31;
end record;
---------------------
-- CWSIZE_Register --
---------------------
subtype CWSIZE_CAPCNT_Field is HAL.UInt14;
subtype CWSIZE_VLINE_Field is HAL.UInt14;
-- crop window size
type CWSIZE_Register is record
-- Capture count
CAPCNT : CWSIZE_CAPCNT_Field := 16#0#;
-- unspecified
Reserved_14_15 : HAL.UInt2 := 16#0#;
-- Vertical line count
VLINE : CWSIZE_VLINE_Field := 16#0#;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CWSIZE_Register use record
CAPCNT at 0 range 0 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
VLINE at 0 range 16 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-----------------
-- DR_Register --
-----------------
-- DR_Byte array element
subtype DR_Byte_Element is HAL.Byte;
-- DR_Byte array
type DR_Byte_Field_Array is array (0 .. 3) of DR_Byte_Element
with Component_Size => 8, Size => 32;
-- data register
type DR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- Byte as a value
Val : HAL.Word;
when True =>
-- Byte as an array
Arr : DR_Byte_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for DR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Digital camera interface
type DCMI_Peripheral is record
-- control register 1
CR : CR_Register;
-- status register
SR : SR_Register;
-- raw interrupt status register
RIS : RIS_Register;
-- interrupt enable register
IER : IER_Register;
-- masked interrupt status register
MIS : MIS_Register;
-- interrupt clear register
ICR : ICR_Register;
-- embedded synchronization code register
ESCR : ESCR_Register;
-- embedded synchronization unmask register
ESUR : ESUR_Register;
-- crop window start
CWSTRT : CWSTRT_Register;
-- crop window size
CWSIZE : CWSIZE_Register;
-- data register
DR : DR_Register;
end record
with Volatile;
for DCMI_Peripheral use record
CR at 0 range 0 .. 31;
SR at 4 range 0 .. 31;
RIS at 8 range 0 .. 31;
IER at 12 range 0 .. 31;
MIS at 16 range 0 .. 31;
ICR at 20 range 0 .. 31;
ESCR at 24 range 0 .. 31;
ESUR at 28 range 0 .. 31;
CWSTRT at 32 range 0 .. 31;
CWSIZE at 36 range 0 .. 31;
DR at 40 range 0 .. 31;
end record;
-- Digital camera interface
DCMI_Periph : aliased DCMI_Peripheral
with Import, Address => DCMI_Base;
end STM32_SVD.DCMI;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 6 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 46
package System.Pack_46 is
pragma Preelaborate;
Bits : constant := 46;
type Bits_46 is mod 2 ** Bits;
for Bits_46'Size use Bits;
-- In all subprograms below, Rev_SSO is set True if the array has the
-- non-default scalar storage order.
function Get_46
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_46 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_46
(Arr : System.Address;
N : Natural;
E : Bits_46;
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_46
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_46 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_46
(Arr : System.Address;
N : Natural;
E : Bits_46;
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_46;
|
-----------------------------------------------------------------------
-- EL.Methods.Proc_1 -- Procedure Binding with 1 argument
-- Copyright (C) 2010, 2011, 2012, 2013, 2015 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with EL.Expressions;
with EL.Contexts;
with Util.Beans.Methods;
with Util.Beans.Basic;
generic
type Param1_Type (<>) is limited private;
package EL.Methods.Proc_1 is
use Util.Beans.Methods;
-- Returns True if the method is a valid method which accepts the arguments
-- defined by the package instantiation.
function Is_Valid (Method : in EL.Expressions.Method_Info) return Boolean;
-- Execute the method describe by the method expression
-- and with the given context. The method signature is:
--
-- procedure F (Obj : in out <Bean>;
-- Param : in out Param1_Type);
--
-- where <Bean> inherits from <b>Readonly_Bean</b>
-- (See <b>Bind</b> package)
--
-- Raises <b>Invalid_Method</b> if the method referenced by
-- the method expression does not exist or does not match
-- the signature.
procedure Execute (Method : in EL.Expressions.Method_Expression'Class;
Param : in out Param1_Type;
Context : in EL.Contexts.ELContext'Class);
-- Execute the method describe by the method binding object.
-- The method signature is:
--
-- procedure F (Obj : in out <Bean>;
-- Param : in out Param1_Type);
--
-- where <Bean> inherits from <b>Readonly_Bean</b>
-- (See <b>Bind</b> package)
--
-- Raises <b>Invalid_Method</b> if the method referenced by
-- the method expression does not exist or does not match
-- the signature.
procedure Execute (Method : in EL.Expressions.Method_Info;
Param : in out Param1_Type);
-- Function access to the proxy.
type Proxy_Access is
access procedure (O : access Util.Beans.Basic.Readonly_Bean'Class;
P : in out Param1_Type);
-- The binding record which links the method name
-- to the proxy function.
type Binding is new Method_Binding with record
Method : Proxy_Access;
end record;
type Binding_Access is access constant Binding;
-- Proxy for the binding.
-- The proxy declares the binding definition that links
-- the name to the function and it implements the necessary
-- object conversion to translate the <b>Readonly_Bean</b>
-- object to the target object type.
generic
-- Name of the method (as exposed in the EL expression)
Name : String;
-- The bean type
type Bean is abstract limited new Util.Beans.Basic.Readonly_Bean with private;
-- The bean method to invoke
with procedure Method (O : in out Bean;
P1 : in out Param1_Type);
package Bind is
-- Method that <b>Execute</b> will invoke.
procedure Method_Access (O : access Util.Beans.Basic.Readonly_Bean'Class;
P1 : in out Param1_Type);
F_NAME : aliased constant String := Name;
-- The proxy binding that can be exposed through
-- the <b>Method_Bean</b> interface.
Proxy : aliased constant Binding
:= Binding '(Name => F_NAME'Access,
Method => Method_Access'Access);
end Bind;
end EL.Methods.Proc_1;
|
package body System.Tasking.Async_Delays is
function Enqueue_Duration (
T : Duration;
D : not null access Delay_Block)
return Boolean is
begin
raise Program_Error; -- unimplemented
return Enqueue_Duration (T, D);
end Enqueue_Duration;
procedure Cancel_Async_Delay (D : not null access Delay_Block) is
begin
raise Program_Error; -- unimplemented
end Cancel_Async_Delay;
function Timed_Out (D : not null access Delay_Block) return Boolean is
begin
raise Program_Error; -- unimplemented
return Timed_Out (D);
end Timed_Out;
end System.Tasking.Async_Delays;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . C U R R E N T _ E X C E P T I O N --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1996-2000 Ada Core Technologies, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This package provides routines for obtaining the current exception
-- information in Ada 83 style. In Ada 83, there was no official method
-- for obtaining exception information, but a number of vendors supplied
-- routines for this purpose, and this package closely approximates the
-- interfaces supplied by DEC Ada 83 and VADS Ada.
-- The routines in this package are associated with a particular exception
-- handler, and can only be called from within an exception handler. See
-- also the package GNAT.Most_Recent_Exception, which provides access to
-- the most recently raised exception, and is not limited to static calls
-- from an exception handler.
package GNAT.Current_Exception is
pragma Pure (Current_Exception);
-----------------
-- Subprograms --
-----------------
function Exception_Information return String;
-- Returns the result of calling Ada.Exceptions.Exception_Information
-- with an argument that is the Exception_Occurrence corresponding to
-- the current exception. Returns the null string if called from outside
-- an exception handler.
function Exception_Message return String;
-- Returns the result of calling Ada.Exceptions.Exception_Message with
-- an argument that is the Exception_Occurrence corresponding to the
-- current exception. Returns the null string if called from outside an
-- exception handler.
function Exception_Name return String;
-- Returns the result of calling Ada.Exceptions.Exception_Name with
-- an argument that is the Exception_Occurrence corresponding to the
-- current exception. Returns the null string if called from outside
-- an exception handler.
-- Note: all these functions return useful information only if
-- called statically from within an exception handler, and they
-- return information about the exception corresponding to the
-- handler in which they appear. This is NOT the same as the most
-- recently raised exception. Consider the example:
-- exception
-- when Constraint_Error =>
-- begin
-- ...
-- exception
-- when Tasking_Error => ...
-- end;
--
-- -- Exception_xxx at this point returns the information about
-- -- the constraint error, not about any exception raised within
-- -- the nested block since it is the static nesting that counts.
-----------------------------------
-- Use of Library Level Renaming --
-----------------------------------
-- For greater compatibility with existing legacy software, library
-- level renaming may be used to create a function with a name matching
-- one that is in use. For example, some versions of VADS Ada provided
-- a functin called Current_Exception whose semantics was identical to
-- that of GNAT. The following library level renaming declaration:
-- with GNAT.Current_Exception;
-- function Current_Exception
-- renames GNAT.Current_Exception.Exception_Name;
-- placed in a file called current_exception.ads and compiled into the
-- application compilation environment, will make the function available
-- in a manner exactly compatible with that in VADS Ada 83.
private
pragma Import (Intrinsic, Exception_Information);
pragma Import (intrinsic, Exception_Message);
pragma Import (Intrinsic, Exception_Name);
end GNAT.Current_Exception;
|
with Ada.Unchecked_Deallocation;
package body GNAT.Sockets is
procedure Free is
new Ada.Unchecked_Deallocation (
Ada.Streams.Stream_IO.File_Type,
Socket_Type);
function Addresses (E : Host_Entry_Type; N : Positive := 1)
return Inet_Addr_Type
is
pragma Unreferenced (N);
begin
return (
Family => Family_Inet,
Host_Name =>
Ada.Strings.Unbounded_Strings.To_Unbounded_String (String (E)));
end Addresses;
function Get_Host_By_Name (Name : String) return Host_Entry_Type is
begin
return Host_Entry_Type (Name);
end Get_Host_By_Name;
procedure Create_Socket (
Socket : out Socket_Type;
Family : Family_Type := Family_Inet;
Mode : Mode_Type := Socket_Stream)
is
pragma Unreferenced (Family);
pragma Unreferenced (Mode);
begin
Socket := new Ada.Streams.Stream_IO.File_Type;
end Create_Socket;
procedure Close_Socket (Socket : in out Socket_Type) is
begin
Ada.Streams.Stream_IO.Close (Socket.all);
Free (Socket);
end Close_Socket;
procedure Connect_Socket (
Socket : Socket_Type;
Server : in out Sock_Addr_Type)
is
End_Point : constant Ada.Streams.Stream_IO.Sockets.End_Point :=
Ada.Streams.Stream_IO.Sockets.Resolve (
Ada.Strings.Unbounded_Strings.Constant_Reference (
Server.Addr.Host_Name).Element.all,
Server.Port);
begin
Ada.Streams.Stream_IO.Sockets.Connect (Socket.all, End_Point);
end Connect_Socket;
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)
is
pragma Unreferenced (Flags);
begin
Ada.Streams.Stream_IO.Read (Socket.all, Item, Last);
end Receive_Socket;
function Stream (Socket : Socket_Type) return Stream_Access is
begin
return Ada.Streams.Stream_IO.Stream (Socket.all);
end Stream;
end GNAT.Sockets;
|
------------------------------------------------------------------------------
-- --
-- Hardware Abstraction Layer for STM32 Targets --
-- --
-- Copyright (C) 2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- 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 STM32F4.RCC; use STM32F4.RCC;
with Ada.Real_Time; use Ada.Real_Time;
package body STM32F4.I2C is
subtype I2C_SR1_Flag is I2C_Status_Flag range Start_Bit .. SMB_Alert;
subtype I2C_SR2_Flag is I2C_Status_Flag range Master_Slave_Mode .. Dual_Flag;
SR1_Flag_Pos : constant array (I2C_SR1_Flag) of Natural :=
(0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 14, 15);
SR2_Flag_Pos : constant array (I2C_SR2_Flag) of Natural :=
(0, 1, 2, 4, 5, 6, 7);
---------------
-- Configure --
---------------
procedure Configure
(Port : in out I2C_Port;
Clock_Speed : Word;
Mode : I2C_Device_Mode;
Duty_Cycle : I2C_Duty_Cycle;
Own_Address : Half_Word;
Ack : I2C_Acknowledgement;
Ack_Address : I2C_Acknowledge_Address)
is
CR2, CR1 : Half_Word;
CCR : Half_Word := 0;
PCLK1 : constant Word := System_Clock_Frequencies.PCLK1;
Freq_Range : constant Half_Word := Half_Word (PCLK1 / 1_000_000);
begin
-- Load CR2 and clear FREQ
CR2 := Port.CR2 and (not CR2_FREQ);
Port.CR2 := CR2 or Freq_Range;
Set_State (Port, Disabled);
if Clock_Speed <= 100_000 then
CCR := Half_Word (PCLK1 / (Clock_Speed * 2));
if CCR < 4 then
CCR := 4;
end if;
Port.TRISE := Freq_Range + 1;
else
-- Fast mode
if Duty_Cycle = DutyCycle_2 then
CCR := Half_Word (PCLK1 / (Clock_Speed * 3));
else
CCR := Half_Word (PCLK1 / (Clock_Speed * 25));
CCR := CCR or DutyCycle_16_9'Enum_Rep;
end if;
if (CCR and CCR_CCR) = 0 then
CCR := 1;
end if;
CCR := CCR or CCR_FS;
Port.TRISE := (Freq_Range * 300) / 1000 + 1;
end if;
Port.CCR := CCR;
Set_State (Port, Enabled);
CR1 := Port.CR1;
CR1 := CR1 and CR1_Clear_Mask;
CR1 := CR1 or Mode'Enum_Rep or Ack'Enum_Rep;
Port.CR1 := CR1;
Port.OAR1 := Ack_Address'Enum_Rep or Own_Address'Enum_Rep;
end Configure;
---------------
-- Set_State --
---------------
procedure Set_State (Port : in out I2C_Port; State : I2C_State) is
begin
if State = Enabled then
Port.CR1 := Port.CR1 or CR1_PE;
else
Port.CR1 := Port.CR1 and (not CR1_PE);
end if;
end Set_State;
------------------
-- Port_Enabled --
------------------
function Port_Enabled (Port : I2C_Port) return Boolean is
begin
return (Port.CR1 and CR1_PE) /= 0;
end Port_Enabled;
--------------------
-- Generate_Start --
--------------------
procedure Generate_Start (Port : in out I2C_Port; State : I2C_State) is
begin
if State = Enabled then
Port.CR1 := Port.CR1 or CR1_START;
else
Port.CR1 := Port.CR1 and (not CR1_START);
end if;
end Generate_Start;
-------------------
-- Generate_Stop --
-------------------
procedure Generate_Stop (Port : in out I2C_Port; State : I2C_State) is
begin
if State = Enabled then
Port.CR1 := Port.CR1 or CR1_STOP;
else
Port.CR1 := Port.CR1 and (not CR1_STOP);
end if;
end Generate_Stop;
--------------------
-- Send_7Bit_Addr --
--------------------
procedure Send_7Bit_Address
(Port : in out I2C_Port;
Address : Byte;
Direction : I2C_Direction)
is
Destination : Half_Word := Half_Word (Address);
begin
if Direction = Receiver then
Destination := Destination or I2C_OAR1_ADD0;
else
Destination := Destination and (not I2C_OAR1_ADD0);
end if;
Port.DR := Destination;
end Send_7Bit_Address;
--------------
-- Get_Flag --
--------------
function Status (Port : I2C_Port; Flag : I2C_Status_Flag) return Boolean is
begin
if Flag in I2C_SR1_Flag then
return (Port.SR1 and (2**SR1_Flag_Pos (Flag))) /= 0;
else
return (Port.SR2 and (2**SR2_Flag_Pos (Flag))) /= 0;
end if;
end Status;
----------------
-- Clear_Flag --
----------------
procedure Clear_Status
(Port : in out I2C_Port;
Target : Clearable_I2C_Status_Flag)
is
begin
-- note that only a subset of the status flags can be cleared
Port.SR1 := not (2 ** SR1_Flag_Pos (Target));
-- we do not logically AND status bits
end Clear_Status;
-------------------------------
-- Clear_Address_Sent_Status --
-------------------------------
procedure Clear_Address_Sent_Status (Port : in out I2C_Port) is
Temp : Half_Word with Volatile;
ADDR_Mask : constant Half_Word := 2 ** SR1_Flag_Pos (Address_Sent);
STOP_Mask : constant Half_Word := 2 ** SR1_Flag_Pos (Stop_Detection);
begin
-- To clear the ADDR flag we have to read SR2 after reading SR1.
-- However, per the RM, section 27.6.7, page 850, we should only read
-- SR2 if the Address_Sent flag is set in SR1, or if the Stop_Detection
-- flag is cleared, because the Address_Sent flag could be set in
-- the middle of reading SR1 and SR2 but will be cleared by the
-- read sequence nonetheless.
Temp := Port.SR1;
if ((Temp and ADDR_Mask) = 1) or ((Temp and STOP_Mask) = 0) then
Temp := Port.SR2;
end if;
end Clear_Address_Sent_Status;
---------------------------------
-- Clear_Stop_Detection_Status --
---------------------------------
procedure Clear_Stop_Detection_Status (Port : in out I2C_Port) is
Temp : Half_Word with Volatile, Unreferenced;
begin
Temp := Port.SR1;
Port.CR1 := Port.CR1 or CR1_PE;
end Clear_Stop_Detection_Status;
-------------------
-- Wait_For_Flag --
-------------------
procedure Wait_For_State
(Port : I2C_Port;
Queried : I2C_Status_Flag;
State : I2C_State;
Time_Out : Natural := 1_000_000)
is
Expected : constant Boolean := State = Enabled;
Deadline : constant Time := Clock + Milliseconds (Time_Out);
begin
while Status (Port, Queried) /= Expected loop
if Clock >= Deadline then
raise I2C_Timeout;
end if;
end loop;
end Wait_For_State;
---------------
-- Send_Data --
---------------
procedure Send_Data (Port : in out I2C_Port; Data : Byte) is
begin
Port.DR := Half_Word (Data);
end Send_Data;
---------------
-- Read_Data --
---------------
function Read_Data (Port : I2C_Port) return Byte is
begin
return Byte (Port.DR);
end Read_Data;
--------------------
-- Set_Ack_Config --
--------------------
procedure Set_Ack_Config (Port : in out I2C_Port; State : I2C_State) is
begin
if State = Enabled then
Port.CR1 := Port.CR1 or CR1_ACK;
else
Port.CR1 := Port.CR1 and (not CR1_ACK);
end if;
end Set_Ack_Config;
---------------------
-- Set_Nack_Config --
---------------------
procedure Set_Nack_Config
(Port : in out I2C_Port;
Pos : I2C_Nack_Position)
is
begin
if Pos = Next then
Port.CR1 := Port.CR1 or CR1_POS;
else
Port.CR1 := Port.CR1 and (not CR1_POS);
end if;
end Set_Nack_Config;
-----------
-- Start --
-----------
procedure Start
(Port : in out I2C_Port;
Address : Byte;
Direction : I2C_Direction)
is
begin
Generate_Start (Port, Enabled);
Wait_For_State (Port, Start_Bit, Enabled);
Set_Ack_Config (Port, Enabled);
Send_7Bit_Address (Port, Address, Direction);
while not Status (Port, Address_Sent) loop
if Status (Port, Ack_Failure) then
raise Program_Error;
end if;
end loop;
Clear_Address_Sent_Status (Port);
end Start;
--------------
-- Read_Ack --
--------------
function Read_Ack (Port : in out I2C_Port) return Byte is
begin
Set_Ack_Config (Port, Enabled);
Wait_For_State (Port, Rx_Data_Register_Not_Empty, Enabled);
return Read_Data (Port);
end Read_Ack;
---------------
-- Read_Nack --
---------------
function Read_Nack (Port : in out I2C_Port) return Byte is
begin
Set_Ack_Config (Port, Disabled);
Generate_Stop (Port, Enabled);
Wait_For_State (Port, Rx_Data_Register_Not_Empty, Enabled);
return Read_Data (Port);
end Read_Nack;
-----------
-- Write --
-----------
procedure Write (Port : in out I2C_Port; Data : Byte) is
begin
Wait_For_State (Port, Tx_Data_Register_Empty, Enabled);
Send_Data (Port, Data);
while
not Status (Port, Tx_Data_Register_Empty) or else
not Status (Port, Byte_Transfer_Finished)
loop
null;
end loop;
end Write;
----------
-- Stop --
----------
procedure Stop (Port : in out I2C_Port) is
begin
Generate_Stop (Port, Enabled);
end Stop;
----------------------
-- Enable_Interrupt --
----------------------
procedure Enable_Interrupt
(Port : in out I2C_Port;
Source : I2C_Interrupt)
is
begin
Port.CR2 := Port.CR2 or Source'Enum_Rep;
end Enable_Interrupt;
-----------------------
-- Disable_Interrupt --
-----------------------
procedure Disable_Interrupt
(Port : in out I2C_Port;
Source : I2C_Interrupt)
is
begin
Port.CR2 := Port.CR2 and not Source'Enum_Rep;
end Disable_Interrupt;
-------------
-- Enabled --
-------------
function Enabled
(Port : in out I2C_Port;
Source : I2C_Interrupt)
return Boolean
is
begin
return (Port.CR2 and Source'Enum_Rep) = Source'Enum_Rep;
end Enabled;
end STM32F4.I2C;
|
pragma Ada_2012;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
package bits_byteswap_h is
-- Macros and inline functions to swap the order of bytes in integer values.
-- Copyright (C) 1997-2021 Free Software Foundation, Inc.
-- This file is part of the GNU C Library.
-- The GNU C Library is free software; you can redistribute it and/or
-- modify it under the terms of the GNU Lesser General Public
-- License as published by the Free Software Foundation; either
-- version 2.1 of the License, or (at your option) any later version.
-- The GNU C Library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- Lesser General Public License for more details.
-- You should have received a copy of the GNU Lesser General Public
-- License along with the GNU C Library; if not, see
-- <https://www.gnu.org/licenses/>.
-- Swap bytes in 16-bit value.
-- skipped func __bswap_16
-- Swap bytes in 32-bit value.
-- skipped func __bswap_32
-- Swap bytes in 64-bit value.
-- skipped func __bswap_64
end bits_byteswap_h;
|
-- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with Glfw.API;
package body Glfw.Events.Joysticks is
function Index (Source : Joystick) return Joystick_Index is
begin
return Enums.Joystick_ID'Pos (Source.Raw_Index) + 1;
end Index;
procedure Set_Index (Target : in out Joystick; Value : Joystick_Index) is
begin
Target.Raw_Index := Enums.Joystick_ID'Val (Value - 1);
end Set_Index;
function Present (Source : Joystick) return Boolean is
begin
return API.Get_Joystick_Param (Source.Raw_Index, Enums.Present) /= 0;
end Present;
function Num_Axis (Source : Joystick) return Natural is
begin
return Natural (API.Get_Joystick_Param (Source.Raw_Index, Enums.Axis));
end Num_Axis;
function Num_Buttons (Source : Joystick) return Natural is
begin
return Natural (API.Get_Joystick_Param (Source.Raw_Index, Enums.Buttons));
end Num_Buttons;
procedure Get_Positions (Source : Joystick; Values : in out Axis_Positions) is
Unused : Interfaces.C.int := API.Get_Joystick_Pos (
Source.Raw_Index, Values,
Interfaces.C.int (Values'Last - Values'First + 1));
begin
null;
end Get_Positions;
procedure Get_Buttons (Source : Joystick; Values : in out Button_States) is
Unused : Interfaces.C.int := API.Get_Joystick_Buttons (
Source.Raw_Index, Values,
Interfaces.C.int (Values'Last - Values'First + 1));
begin
null;
end Get_Buttons;
end Glfw.Events.Joysticks;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2015, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Asis;
with Engines.Contexts;
with League.Strings;
package Properties.Declarations.Element_Iterator_Specification is
function Initialize
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Text_Property) return League.Strings.Universal_String;
function Code
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Text_Property) return League.Strings.Universal_String;
function Condition
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Text_Property) return League.Strings.Universal_String;
end Properties.Declarations.Element_Iterator_Specification;
|
-----------------------------------------------------------------------
-- awa-mail-components-messages -- Mail UI Message
-- Copyright (C) 2012, 2020 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Ada.Strings.Unbounded;
with Util.Beans.Objects;
with ASF.Components.Base;
with AWA.Mail.Clients;
package body AWA.Mail.Components.Messages is
use Ada.Strings.Unbounded;
use type ASF.Components.Base.UIComponent_Access;
-- ------------------------------
-- Set the mail message instance.
-- ------------------------------
procedure Set_Message (UI : in out UIMailMessage;
Message : in AWA.Mail.Clients.Mail_Message_Access) is
begin
UI.Message := Message;
end Set_Message;
-- ------------------------------
-- Get the mail message instance.
-- ------------------------------
overriding
function Get_Message (UI : in UIMailMessage) return AWA.Mail.Clients.Mail_Message_Access is
begin
return UI.Message;
end Get_Message;
-- ------------------------------
-- Render the end of the input component. Closes the DL/DD list.
-- ------------------------------
overriding
procedure Encode_End (UI : in UIMailMessage;
Context : in out ASF.Contexts.Faces.Faces_Context'Class) is
use type AWA.Mail.Clients.Mail_Message_Access;
begin
if UI.Message /= null and UI.Is_Rendered (Context) then
UI.Message.Send;
end if;
end Encode_End;
-- ------------------------------
-- Finalize and release the mail message.
-- ------------------------------
overriding
procedure Finalize (UI : in out UIMailMessage) is
procedure Free is
new Ada.Unchecked_Deallocation (Object => AWA.Mail.Clients.Mail_Message'Class,
Name => AWA.Mail.Clients.Mail_Message_Access);
begin
Free (UI.Message);
UIMailComponent (UI).Finalize;
end Finalize;
-- ------------------------------
-- Render the mail subject and initializes the message with its content.
-- ------------------------------
overriding
procedure Encode_Children (UI : in UIMailSubject;
Context : in out ASF.Contexts.Faces.Faces_Context'Class) is
procedure Process (Content : in String);
procedure Process (Content : in String) is
Msg : constant AWA.Mail.Clients.Mail_Message_Access := UI.Get_Message;
begin
Msg.Set_Subject (Content);
end Process;
begin
UI.Wrap_Encode_Children (Context, Process'Access);
end Encode_Children;
-- ------------------------------
-- Render the mail body and initializes the message with its content.
-- ------------------------------
overriding
procedure Encode_Children (UI : in UIMailBody;
Context : in out ASF.Contexts.Faces.Faces_Context'Class) is
procedure Process (Content : in Unbounded_String);
procedure Process_Alternative (Content : in Unbounded_String);
Body_Type : Util.Beans.Objects.Object;
Alternative_Content : Unbounded_String;
procedure Process_Alternative (Content : in Unbounded_String) is
begin
Alternative_Content := Content;
end Process_Alternative;
procedure Process (Content : in Unbounded_String) is
Msg : constant AWA.Mail.Clients.Mail_Message_Access := UI.Get_Message;
Typ : constant String := Util.Beans.Objects.To_String (Body_Type);
begin
if not Util.Beans.Objects.Is_Empty (Body_Type) then
Msg.Set_Body (Content, Alternative_Content, Typ);
else
Msg.Set_Body (Content, Alternative_Content);
end if;
end Process;
Alternative_Facet : ASF.Components.Base.UIComponent_Access;
begin
Body_Type := UI.Get_Attribute (Name => "type", Context => Context);
Alternative_Facet := UI.Get_Facet (ALTERNATIVE_NAME);
if Alternative_Facet /= null then
Alternative_Facet.Wrap_Encode_Children (Context, Process_Alternative'Access);
end if;
UI.Wrap_Encode_Children (Context, Process'Access);
end Encode_Children;
end AWA.Mail.Components.Messages;
|
-- 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/>.
package body Pck is
procedure Do_Nothing (Val : in out Integer) is
begin
null;
end Do_Nothing;
end Pck;
|
-- MIT License
-- Copyright (c) 2021 Stephen Merrony
-- 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.
package Processor.Eagle_Op_P is
procedure Do_Eagle_Op (I : in Decoded_Instr_T; CPU : in out CPU_T);
end Processor.Eagle_Op_P; |
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.DG.Images.Hash is
new AMF.Elements.Generic_Hash (DG_Image, DG_Image_Access);
|
with Ada.Numerics.Discrete_Random;
function lanzar_dado (dado: in out Integer) return Integer is
subtype rango is Integer range 1..6;
package miRango is new Ada.Numerics.Discrete_Random(rango);
semilla : miRango.generator;
begin
miRango.reset(semilla);
dado:= miRango.random(semilla);
return dado;
end lanzar_dado;
|
--A procedure to sort an array of integers into ascending order using Shuffle Sorting
type Array_type is array (Positive range <>) of Integer;
procedure Shuffle_Sort (X: in out Array_type) is
Position: Positive;
Value : Integer;
begin
for I in X'First+1 .. X'Last loop
if X(I) < X(I-1) then
--Misplaced item found: copy it
Value := X(I);
--Scan backwards until correct position found
for J in reverse X'First .. I-1 loop
exit when X(J) < Value;
Position := J;
end loop;
--Move intervening value along
X(Position+1 .. I) := X(Position .. I-1);
--Put saved copy of item in correct position
X(Position) := Value;
end if;
end loop;
end Shuffle_Sort; |
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2015, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with GNAT.Regexp;
package body Configure.Tests.Operating_System is
Operating_System_Name : constant Ada.Strings.Unbounded.Unbounded_String
:= Ada.Strings.Unbounded.To_Unbounded_String ("OPERATING_SYSTEM");
--------------------------
-- Get_Operating_System --
--------------------------
function Get_Operating_System
(Self : Operating_System_Test) return Operating_Systems is
begin
if Self.Executed then
return Self.Operating_System;
else
raise Program_Error with "operating system test was not executed";
end if;
end Get_Operating_System;
-------------
-- Execute --
-------------
overriding procedure Execute
(Self : in out Operating_System_Test;
Arguments : in out Unbounded_String_Vector)
is
use GNAT.Regexp;
begin
-- Command line parameter has preference other automatic detection.
Self.Report_Check ("detecting target operating system");
if Match
(+Target_Triplet, Compile ("[a-zA-Z0-9_]*-[a-zA-Z0-9_]*-mingw.*"))
then
Self.Operating_System := Windows;
Substitutions.Insert (Operating_System_Name, +"Windows");
Is_Windows := True;
Self.Report_Status ("Windows");
elsif Match
(+Target_Triplet, Compile ("[a-zA-Z0-9_]*-[a-zA-Z0-9_]*-darwin.*"))
then
Self.Operating_System := MacOS;
Substitutions.Insert (Operating_System_Name, +"MacOS");
Is_Windows := True;
Self.Report_Status ("MacOS");
else
Self.Operating_System := POSIX;
Substitutions.Insert (Operating_System_Name, +"POSIX");
Self.Report_Status ("POSIX");
end if;
Self.Executed := True;
end Execute;
----------
-- Help --
----------
overriding function Help
(Self : Operating_System_Test) return Unbounded_String_Vector is
begin
return Result : Unbounded_String_Vector;
end Help;
----------
-- Name --
----------
overriding function Name (Self : Operating_System_Test) return String is
begin
return "os";
end Name;
end Configure.Tests.Operating_System;
|
with STM_Board; use STM_Board;
with Inverter_PWM;
package body Error_Handling is
procedure Make_Safe is
begin
if not STM_Board.Is_Initialized then
STM_Board.Initialize_GPIO;
end if;
-- Force the gate driver into a safe state
Inverter_PWM.Safe_State;
-- Signal error to the user
STM_Board.Turn_On (Red_LED);
STM_Board.Turn_Off (Green_LED);
end Make_Safe;
end Error_Handling;
|
<?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>convolution_filter</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>in_img_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_img.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs 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_img_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_img.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>343</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>in_temp_V_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_temp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>563</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>window_V_5_6_loc_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>564</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>window_V_4_6_loc_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>565</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>window_V_3_6_loc_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>566</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>window_V_2_6_loc_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>567</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>window_V_1_6_loc_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>568</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>window_V_0_6_loc_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>569</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>window_V_0_6_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</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>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>570</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>window_V_1_6_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>571</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>window_V_2_6_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>572</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>window_V_3_6_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>573</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>window_V_4_6_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>574</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>window_V_5_6_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>575</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>window_V_6_6_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>576</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>577</item>
<item>578</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>579</item>
<item>580</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>581</item>
<item>582</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>583</item>
<item>584</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>585</item>
<item>586</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>587</item>
<item>588</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>589</item>
<item>590</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>87</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>591</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>indvar_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>19</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>593</item>
<item>594</item>
<item>595</item>
<item>596</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>row</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>598</item>
<item>599</item>
<item>600</item>
<item>601</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>col</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>col</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>603</item>
<item>604</item>
<item>605</item>
<item>606</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>in_temp_V_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>607</item>
<item>2143</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>window_V_5_6_loc_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>608</item>
<item>2142</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>window_V_4_6_loc_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>609</item>
<item>2141</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>window_V_3_6_loc_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>610</item>
<item>2140</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>window_V_2_6_loc_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>611</item>
<item>2139</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>window_V_1_6_loc_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>612</item>
<item>2138</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>window_V_0_6_loc_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>613</item>
<item>2137</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>exitcond_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>614</item>
<item>616</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>indvar_flatten_next</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>19</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>617</item>
<item>619</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>620</item>
<item>621</item>
<item>622</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>exitcond</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>88</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>1042</item>
<item>1044</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>col_mid2</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1045</item>
<item>1046</item>
<item>1047</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>row_s</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1048</item>
<item>1050</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name>tmp_mid1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>127</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>127</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>1051</item>
<item>1053</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>tmp</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>127</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>127</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>1054</item>
<item>1055</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>tmp_mid2</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>127</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>127</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>1056</item>
<item>1057</item>
<item>1058</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>tmp_2_mid1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>135</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>135</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>1059</item>
<item>1061</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>tmp_2</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>135</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>135</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>1062</item>
<item>1063</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>tmp_2_mid2</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>135</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>135</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>1064</item>
<item>1065</item>
<item>1066</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name>row_mid2</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1067</item>
<item>1068</item>
<item>1069</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>108</id>
<name>window_V_0_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1070</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>109</id>
<name>window_V_0_2_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1071</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1072</item>
<item>1073</item>
<item>2136</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>window_V_0_3_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1074</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1075</item>
<item>1076</item>
<item>2135</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name>window_V_0_4_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1077</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>114</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1078</item>
<item>1079</item>
<item>2134</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name>window_V_0_5_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1080</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1081</item>
<item>1082</item>
<item>2133</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>117</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1083</item>
<item>1084</item>
<item>2132</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name>window_V_1_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1085</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>119</id>
<name>window_V_1_2_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1086</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>120</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1087</item>
<item>1088</item>
<item>2131</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name>window_V_1_3_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1089</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>122</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1090</item>
<item>1091</item>
<item>2130</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>123</id>
<name>window_V_1_4_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1092</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1093</item>
<item>1094</item>
<item>2129</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>125</id>
<name>window_V_1_5_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1095</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>126</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1096</item>
<item>1097</item>
<item>2128</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>127</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1098</item>
<item>1099</item>
<item>2127</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>128</id>
<name>window_V_2_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1100</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>129</id>
<name>window_V_2_2_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1101</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>130</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1102</item>
<item>1103</item>
<item>2126</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>131</id>
<name>window_V_2_3_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1104</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>132</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1105</item>
<item>1106</item>
<item>2125</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>133</id>
<name>window_V_2_4_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1107</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>134</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1108</item>
<item>1109</item>
<item>2124</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>135</id>
<name>window_V_2_5_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1110</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>136</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1111</item>
<item>1112</item>
<item>2123</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>137</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1113</item>
<item>1114</item>
<item>2122</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>138</id>
<name>window_V_3_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1115</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>139</id>
<name>window_V_3_2_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1116</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>140</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1117</item>
<item>1118</item>
<item>2121</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>141</id>
<name>window_V_3_3_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1119</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>142</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1120</item>
<item>1121</item>
<item>2120</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>143</id>
<name>window_V_3_4_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1122</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>144</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1123</item>
<item>1124</item>
<item>2119</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>145</id>
<name>window_V_3_5_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1125</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>146</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1126</item>
<item>1127</item>
<item>2118</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>147</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1128</item>
<item>1129</item>
<item>2117</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>148</id>
<name>window_V_4_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1130</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>149</id>
<name>window_V_4_2_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1131</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>150</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1132</item>
<item>1133</item>
<item>2116</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>151</id>
<name>window_V_4_3_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1134</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>152</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1135</item>
<item>1136</item>
<item>2115</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>153</id>
<name>window_V_4_4_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1137</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_94">
<Value>
<Obj>
<type>0</type>
<id>154</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1138</item>
<item>1139</item>
<item>2114</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_95">
<Value>
<Obj>
<type>0</type>
<id>155</id>
<name>window_V_4_5_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1140</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_96">
<Value>
<Obj>
<type>0</type>
<id>156</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1141</item>
<item>1142</item>
<item>2113</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>157</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1143</item>
<item>1144</item>
<item>2112</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>158</id>
<name>window_V_5_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1145</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_99">
<Value>
<Obj>
<type>0</type>
<id>159</id>
<name>window_V_5_2_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1146</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_100">
<Value>
<Obj>
<type>0</type>
<id>160</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1147</item>
<item>1148</item>
<item>2111</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_101">
<Value>
<Obj>
<type>0</type>
<id>161</id>
<name>window_V_5_3_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1149</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_102">
<Value>
<Obj>
<type>0</type>
<id>162</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1150</item>
<item>1151</item>
<item>2110</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_103">
<Value>
<Obj>
<type>0</type>
<id>163</id>
<name>window_V_5_4_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1152</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_104">
<Value>
<Obj>
<type>0</type>
<id>164</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1153</item>
<item>1154</item>
<item>2109</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_105">
<Value>
<Obj>
<type>0</type>
<id>165</id>
<name>window_V_5_5_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1155</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_106">
<Value>
<Obj>
<type>0</type>
<id>166</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1156</item>
<item>1157</item>
<item>2108</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_107">
<Value>
<Obj>
<type>0</type>
<id>167</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1158</item>
<item>1159</item>
<item>2107</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_108">
<Value>
<Obj>
<type>0</type>
<id>168</id>
<name>window_V_6_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1160</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_109">
<Value>
<Obj>
<type>0</type>
<id>169</id>
<name>window_V_6_2_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1161</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_110">
<Value>
<Obj>
<type>0</type>
<id>170</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1162</item>
<item>1163</item>
<item>2106</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_111">
<Value>
<Obj>
<type>0</type>
<id>171</id>
<name>window_V_6_3_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1164</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_112">
<Value>
<Obj>
<type>0</type>
<id>172</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1165</item>
<item>1166</item>
<item>2105</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_113">
<Value>
<Obj>
<type>0</type>
<id>173</id>
<name>window_V_6_4_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1167</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_114">
<Value>
<Obj>
<type>0</type>
<id>174</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1168</item>
<item>1169</item>
<item>2104</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_115">
<Value>
<Obj>
<type>0</type>
<id>175</id>
<name>window_V_6_5_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</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>1170</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_116">
<Value>
<Obj>
<type>0</type>
<id>176</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1171</item>
<item>1172</item>
<item>2103</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_117">
<Value>
<Obj>
<type>0</type>
<id>177</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1173</item>
<item>1174</item>
<item>2102</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_118">
<Value>
<Obj>
<type>0</type>
<id>178</id>
<name>tmp_4</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>116</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>116</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>1175</item>
<item>1177</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_119">
<Value>
<Obj>
<type>0</type>
<id>179</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>116</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>116</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1178</item>
<item>1179</item>
<item>1180</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_120">
<Value>
<Obj>
<type>0</type>
<id>181</id>
<name>tmp_6</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</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>623</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_121">
<Value>
<Obj>
<type>0</type>
<id>182</id>
<name>line_buffer_V_0_addr</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>624</item>
<item>626</item>
<item>627</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_122">
<Value>
<Obj>
<type>0</type>
<id>183</id>
<name>line_buffer_V_0_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</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>628</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_123">
<Value>
<Obj>
<type>0</type>
<id>184</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>629</item>
<item>630</item>
<item>2144</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_124">
<Value>
<Obj>
<type>0</type>
<id>185</id>
<name>line_buffer_V_1_addr</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>631</item>
<item>632</item>
<item>633</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_125">
<Value>
<Obj>
<type>0</type>
<id>186</id>
<name>line_buffer_V_1_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>634</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_126">
<Value>
<Obj>
<type>0</type>
<id>187</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>635</item>
<item>636</item>
<item>2100</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_127">
<Value>
<Obj>
<type>0</type>
<id>188</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>637</item>
<item>638</item>
<item>2145</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_128">
<Value>
<Obj>
<type>0</type>
<id>189</id>
<name>line_buffer_V_2_addr</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>639</item>
<item>640</item>
<item>641</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_129">
<Value>
<Obj>
<type>0</type>
<id>190</id>
<name>line_buffer_V_2_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>642</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_130">
<Value>
<Obj>
<type>0</type>
<id>191</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>643</item>
<item>644</item>
<item>2099</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_131">
<Value>
<Obj>
<type>0</type>
<id>192</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>645</item>
<item>646</item>
<item>2146</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_132">
<Value>
<Obj>
<type>0</type>
<id>193</id>
<name>line_buffer_V_3_addr</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>647</item>
<item>648</item>
<item>649</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_133">
<Value>
<Obj>
<type>0</type>
<id>194</id>
<name>line_buffer_V_3_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>650</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_134">
<Value>
<Obj>
<type>0</type>
<id>195</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>651</item>
<item>652</item>
<item>2098</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_135">
<Value>
<Obj>
<type>0</type>
<id>196</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>653</item>
<item>654</item>
<item>2147</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_136">
<Value>
<Obj>
<type>0</type>
<id>197</id>
<name>line_buffer_V_4_addr</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>655</item>
<item>656</item>
<item>657</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_137">
<Value>
<Obj>
<type>0</type>
<id>198</id>
<name>line_buffer_V_4_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>658</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_138">
<Value>
<Obj>
<type>0</type>
<id>199</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>659</item>
<item>660</item>
<item>2097</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_139">
<Value>
<Obj>
<type>0</type>
<id>200</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>661</item>
<item>662</item>
<item>2148</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_140">
<Value>
<Obj>
<type>0</type>
<id>201</id>
<name>line_buffer_V_5_addr</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>663</item>
<item>664</item>
<item>665</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_141">
<Value>
<Obj>
<type>0</type>
<id>202</id>
<name>line_buffer_V_5_load</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>666</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_142">
<Value>
<Obj>
<type>0</type>
<id>203</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>667</item>
<item>668</item>
<item>2096</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_143">
<Value>
<Obj>
<type>0</type>
<id>204</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>669</item>
<item>670</item>
<item>2149</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_144">
<Value>
<Obj>
<type>0</type>
<id>205</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>120</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>671</item>
<item>672</item>
<item>2150</item>
<item>2170</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_145">
<Value>
<Obj>
<type>0</type>
<id>206</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>673</item>
<item>674</item>
<item>2151</item>
<item>2169</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_146">
<Value>
<Obj>
<type>0</type>
<id>207</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>675</item>
<item>676</item>
<item>2152</item>
<item>2168</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_147">
<Value>
<Obj>
<type>0</type>
<id>208</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>677</item>
<item>678</item>
<item>2153</item>
<item>2167</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_148">
<Value>
<Obj>
<type>0</type>
<id>209</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>679</item>
<item>680</item>
<item>2154</item>
<item>2166</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_149">
<Value>
<Obj>
<type>0</type>
<id>210</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>122</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>681</item>
<item>682</item>
<item>2155</item>
<item>2165</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_150">
<Value>
<Obj>
<type>0</type>
<id>211</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>683</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_151">
<Value>
<Obj>
<type>0</type>
<id>213</id>
<name>or_cond</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>127</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>127</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>684</item>
<item>685</item>
</oprand_edges>
<opcode>and</opcode>
</item>
<item class_id_reference="9" object_id="_152">
<Value>
<Obj>
<type>0</type>
<id>214</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>127</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>127</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>686</item>
<item>687</item>
<item>688</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_153">
<Value>
<Obj>
<type>0</type>
<id>216</id>
<name>in_temp_V</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>129</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>in_temp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>690</item>
<item>691</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_154">
<Value>
<Obj>
<type>0</type>
<id>217</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>130</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</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>692</item>
<item>693</item>
<item>2156</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_155">
<Value>
<Obj>
<type>0</type>
<id>218</id>
<name>tmp_8</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>131</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>694</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_156">
<Value>
<Obj>
<type>0</type>
<id>219</id>
<name>line_buffer_V_5_addr_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>131</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>695</item>
<item>696</item>
<item>697</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_157">
<Value>
<Obj>
<type>0</type>
<id>220</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>131</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>698</item>
<item>699</item>
<item>2101</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_158">
<Value>
<Obj>
<type>0</type>
<id>221</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>129</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>700</item>
<item>701</item>
<item>2157</item>
<item>2171</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_159">
<Value>
<Obj>
<type>0</type>
<id>222</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>132</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>132</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>702</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_160">
<Value>
<Obj>
<type>0</type>
<id>224</id>
<name>tmp_9</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>135</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>135</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>703</item>
<item>705</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_161">
<Value>
<Obj>
<type>0</type>
<id>225</id>
<name>or_cond1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>135</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>135</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>706</item>
<item>707</item>
</oprand_edges>
<opcode>and</opcode>
</item>
<item class_id_reference="9" object_id="_162">
<Value>
<Obj>
<type>0</type>
<id>226</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>135</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>135</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>708</item>
<item>709</item>
<item>710</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_163">
<Value>
<Obj>
<type>0</type>
<id>228</id>
<name>in_temp_V_1_load_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>711</item>
<item>2164</item>
<item>2178</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_164">
<Value>
<Obj>
<type>0</type>
<id>229</id>
<name>window_V_5_6_loc_1_load_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>712</item>
<item>2163</item>
<item>2177</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_165">
<Value>
<Obj>
<type>0</type>
<id>230</id>
<name>window_V_4_6_loc_1_load_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>713</item>
<item>2162</item>
<item>2176</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_166">
<Value>
<Obj>
<type>0</type>
<id>231</id>
<name>window_V_3_6_loc_1_load_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>714</item>
<item>2161</item>
<item>2175</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_167">
<Value>
<Obj>
<type>0</type>
<id>232</id>
<name>window_V_2_6_loc_1_load_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>715</item>
<item>2160</item>
<item>2174</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_168">
<Value>
<Obj>
<type>0</type>
<id>233</id>
<name>window_V_1_6_loc_1_load_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>716</item>
<item>2159</item>
<item>2173</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_169">
<Value>
<Obj>
<type>0</type>
<id>234</id>
<name>window_V_0_6_loc_1_load_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>717</item>
<item>2158</item>
<item>2172</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_170">
<Value>
<Obj>
<type>0</type>
<id>236</id>
<name>lhs_V_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>718</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_171">
<Value>
<Obj>
<type>0</type>
<id>237</id>
<name>r_V</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>719</item>
<item>721</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_172">
<Value>
<Obj>
<type>0</type>
<id>241</id>
<name>lhs_V_0_1_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>722</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_173">
<Value>
<Obj>
<type>0</type>
<id>242</id>
<name>r_V_0_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>723</item>
<item>725</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_174">
<Value>
<Obj>
<type>0</type>
<id>246</id>
<name>lhs_V_0_2_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>726</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_175">
<Value>
<Obj>
<type>0</type>
<id>247</id>
<name>r_V_0_2</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>727</item>
<item>729</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_176">
<Value>
<Obj>
<type>0</type>
<id>254</id>
<name>lhs_V_0_4_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>730</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_177">
<Value>
<Obj>
<type>0</type>
<id>255</id>
<name>r_V_0_4</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>731</item>
<item>733</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_178">
<Value>
<Obj>
<type>0</type>
<id>259</id>
<name>lhs_V_0_5_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>734</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_179">
<Value>
<Obj>
<type>0</type>
<id>260</id>
<name>r_V_0_5</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>735</item>
<item>737</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_180">
<Value>
<Obj>
<type>0</type>
<id>264</id>
<name>lhs_V_0_6_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>738</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_181">
<Value>
<Obj>
<type>0</type>
<id>265</id>
<name>r_V_0_6</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>739</item>
<item>741</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_182">
<Value>
<Obj>
<type>0</type>
<id>269</id>
<name>lhs_V_1_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>742</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_183">
<Value>
<Obj>
<type>0</type>
<id>270</id>
<name>r_V_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>743</item>
<item>745</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_184">
<Value>
<Obj>
<type>0</type>
<id>274</id>
<name>lhs_V_1_1_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>746</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_185">
<Value>
<Obj>
<type>0</type>
<id>275</id>
<name>r_V_1_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>747</item>
<item>749</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_186">
<Value>
<Obj>
<type>0</type>
<id>278</id>
<name>tmp_56</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>750</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_187">
<Value>
<Obj>
<type>0</type>
<id>280</id>
<name>lhs_V_1_2_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>751</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_188">
<Value>
<Obj>
<type>0</type>
<id>281</id>
<name>r_V_1_2</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>752</item>
<item>754</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_189">
<Value>
<Obj>
<type>0</type>
<id>284</id>
<name>tmp_57</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>755</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_190">
<Value>
<Obj>
<type>0</type>
<id>286</id>
<name>lhs_V_1_3_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>756</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_191">
<Value>
<Obj>
<type>0</type>
<id>287</id>
<name>r_V_1_3</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>757</item>
<item>759</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_192">
<Value>
<Obj>
<type>0</type>
<id>291</id>
<name>lhs_V_1_4_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>760</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_193">
<Value>
<Obj>
<type>0</type>
<id>292</id>
<name>r_V_1_4</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>761</item>
<item>763</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_194">
<Value>
<Obj>
<type>0</type>
<id>296</id>
<name>lhs_V_1_5_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>764</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_195">
<Value>
<Obj>
<type>0</type>
<id>297</id>
<name>r_V_1_5</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>765</item>
<item>767</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_196">
<Value>
<Obj>
<type>0</type>
<id>301</id>
<name>lhs_V_1_6_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>768</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_197">
<Value>
<Obj>
<type>0</type>
<id>302</id>
<name>r_V_1_6</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>769</item>
<item>771</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_198">
<Value>
<Obj>
<type>0</type>
<id>305</id>
<name>tmp_58</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</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>772</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_199">
<Value>
<Obj>
<type>0</type>
<id>307</id>
<name>lhs_V_2_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>773</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_200">
<Value>
<Obj>
<type>0</type>
<id>308</id>
<name>r_V_2</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>774</item>
<item>776</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_201">
<Value>
<Obj>
<type>0</type>
<id>311</id>
<name>tmp_59</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</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>777</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_202">
<Value>
<Obj>
<type>0</type>
<id>313</id>
<name>lhs_V_2_1_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>778</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_203">
<Value>
<Obj>
<type>0</type>
<id>314</id>
<name>r_V_2_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>779</item>
<item>781</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_204">
<Value>
<Obj>
<type>0</type>
<id>317</id>
<name>tmp_60</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</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>782</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_205">
<Value>
<Obj>
<type>0</type>
<id>322</id>
<name>lhs_V_2_3_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>783</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_206">
<Value>
<Obj>
<type>0</type>
<id>323</id>
<name>r_V_2_3</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>784</item>
<item>786</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_207">
<Value>
<Obj>
<type>0</type>
<id>327</id>
<name>lhs_V_2_4_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>787</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_208">
<Value>
<Obj>
<type>0</type>
<id>328</id>
<name>r_V_2_4</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>788</item>
<item>790</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_209">
<Value>
<Obj>
<type>0</type>
<id>332</id>
<name>lhs_V_2_5_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>791</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_210">
<Value>
<Obj>
<type>0</type>
<id>333</id>
<name>r_V_2_5</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>792</item>
<item>794</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_211">
<Value>
<Obj>
<type>0</type>
<id>337</id>
<name>lhs_V_2_6_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>795</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_212">
<Value>
<Obj>
<type>0</type>
<id>338</id>
<name>r_V_2_6</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>796</item>
<item>798</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_213">
<Value>
<Obj>
<type>0</type>
<id>341</id>
<name>tmp_61</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>799</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_214">
<Value>
<Obj>
<type>0</type>
<id>343</id>
<name>lhs_V_3_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>800</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_215">
<Value>
<Obj>
<type>0</type>
<id>344</id>
<name>r_V_3</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>801</item>
<item>803</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_216">
<Value>
<Obj>
<type>0</type>
<id>347</id>
<name>tmp_62</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>804</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_217">
<Value>
<Obj>
<type>0</type>
<id>349</id>
<name>lhs_V_3_1_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>805</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_218">
<Value>
<Obj>
<type>0</type>
<id>350</id>
<name>r_V_3_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>806</item>
<item>808</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_219">
<Value>
<Obj>
<type>0</type>
<id>357</id>
<name>lhs_V_3_3_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>809</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_220">
<Value>
<Obj>
<type>0</type>
<id>358</id>
<name>r_V_3_3</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>810</item>
<item>812</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_221">
<Value>
<Obj>
<type>0</type>
<id>362</id>
<name>lhs_V_3_4_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>813</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_222">
<Value>
<Obj>
<type>0</type>
<id>363</id>
<name>r_V_3_4</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>814</item>
<item>816</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_223">
<Value>
<Obj>
<type>0</type>
<id>367</id>
<name>lhs_V_3_5_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>817</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_224">
<Value>
<Obj>
<type>0</type>
<id>368</id>
<name>r_V_3_5</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>818</item>
<item>820</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_225">
<Value>
<Obj>
<type>0</type>
<id>372</id>
<name>lhs_V_3_6_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>821</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_226">
<Value>
<Obj>
<type>0</type>
<id>373</id>
<name>r_V_3_6</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>822</item>
<item>824</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_227">
<Value>
<Obj>
<type>0</type>
<id>377</id>
<name>lhs_V_4_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>825</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_228">
<Value>
<Obj>
<type>0</type>
<id>378</id>
<name>r_V_4</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>826</item>
<item>828</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_229">
<Value>
<Obj>
<type>0</type>
<id>382</id>
<name>lhs_V_4_1_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>829</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_230">
<Value>
<Obj>
<type>0</type>
<id>383</id>
<name>r_V_4_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>830</item>
<item>832</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_231">
<Value>
<Obj>
<type>0</type>
<id>387</id>
<name>lhs_V_4_2_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>833</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_232">
<Value>
<Obj>
<type>0</type>
<id>388</id>
<name>r_V_4_2</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>834</item>
<item>836</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_233">
<Value>
<Obj>
<type>0</type>
<id>392</id>
<name>lhs_V_4_3_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>837</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_234">
<Value>
<Obj>
<type>0</type>
<id>393</id>
<name>r_V_4_3</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>838</item>
<item>840</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_235">
<Value>
<Obj>
<type>0</type>
<id>397</id>
<name>lhs_V_4_4_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>841</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_236">
<Value>
<Obj>
<type>0</type>
<id>398</id>
<name>r_V_4_4</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>842</item>
<item>844</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_237">
<Value>
<Obj>
<type>0</type>
<id>402</id>
<name>lhs_V_4_5_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>845</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_238">
<Value>
<Obj>
<type>0</type>
<id>403</id>
<name>r_V_4_5</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>846</item>
<item>848</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_239">
<Value>
<Obj>
<type>0</type>
<id>410</id>
<name>lhs_V_5_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>849</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_240">
<Value>
<Obj>
<type>0</type>
<id>411</id>
<name>r_V_5</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>850</item>
<item>852</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_241">
<Value>
<Obj>
<type>0</type>
<id>415</id>
<name>lhs_V_5_1_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>853</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_242">
<Value>
<Obj>
<type>0</type>
<id>416</id>
<name>r_V_5_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>854</item>
<item>856</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_243">
<Value>
<Obj>
<type>0</type>
<id>423</id>
<name>lhs_V_5_3_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>857</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_244">
<Value>
<Obj>
<type>0</type>
<id>424</id>
<name>r_V_5_3</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>858</item>
<item>860</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_245">
<Value>
<Obj>
<type>0</type>
<id>428</id>
<name>lhs_V_5_4_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>861</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_246">
<Value>
<Obj>
<type>0</type>
<id>429</id>
<name>r_V_5_4</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>862</item>
<item>864</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_247">
<Value>
<Obj>
<type>0</type>
<id>433</id>
<name>lhs_V_5_5_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>865</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_248">
<Value>
<Obj>
<type>0</type>
<id>434</id>
<name>r_V_5_5</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>866</item>
<item>868</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_249">
<Value>
<Obj>
<type>0</type>
<id>438</id>
<name>lhs_V_5_6_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>869</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_250">
<Value>
<Obj>
<type>0</type>
<id>439</id>
<name>r_V_5_6</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>870</item>
<item>872</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_251">
<Value>
<Obj>
<type>0</type>
<id>443</id>
<name>lhs_V_6_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>873</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_252">
<Value>
<Obj>
<type>0</type>
<id>444</id>
<name>r_V_6</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>874</item>
<item>876</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_253">
<Value>
<Obj>
<type>0</type>
<id>448</id>
<name>lhs_V_6_1_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>877</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_254">
<Value>
<Obj>
<type>0</type>
<id>449</id>
<name>r_V_6_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>878</item>
<item>880</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_255">
<Value>
<Obj>
<type>0</type>
<id>453</id>
<name>lhs_V_6_2_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>881</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_256">
<Value>
<Obj>
<type>0</type>
<id>454</id>
<name>r_V_6_2</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>882</item>
<item>884</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_257">
<Value>
<Obj>
<type>0</type>
<id>458</id>
<name>lhs_V_6_3_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>885</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_258">
<Value>
<Obj>
<type>0</type>
<id>459</id>
<name>r_V_6_3</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>886</item>
<item>888</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_259">
<Value>
<Obj>
<type>0</type>
<id>465</id>
<name>tmp_63</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>889</item>
<item>891</item>
</oprand_edges>
<opcode>shl</opcode>
</item>
<item class_id_reference="9" object_id="_260">
<Value>
<Obj>
<type>0</type>
<id>467</id>
<name>lhs_V_6_5_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>892</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_261">
<Value>
<Obj>
<type>0</type>
<id>468</id>
<name>r_V_6_5</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>893</item>
<item>895</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_262">
<Value>
<Obj>
<type>0</type>
<id>471</id>
<name>tmp_64</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</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>896</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_263">
<Value>
<Obj>
<type>0</type>
<id>473</id>
<name>lhs_V_6_6_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>897</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_264">
<Value>
<Obj>
<type>0</type>
<id>474</id>
<name>r_V_6_6</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>Mul_LUT</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>898</item>
<item>900</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_265">
<Value>
<Obj>
<type>0</type>
<id>477</id>
<name>tmp_65</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</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>901</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_266">
<Value>
<Obj>
<type>0</type>
<id>478</id>
<name>tmp5</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>902</item>
<item>903</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_267">
<Value>
<Obj>
<type>0</type>
<id>479</id>
<name>tmp_66</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>904</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_268">
<Value>
<Obj>
<type>0</type>
<id>480</id>
<name>tmp_67</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>905</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_269">
<Value>
<Obj>
<type>0</type>
<id>481</id>
<name>tmp4_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>906</item>
<item>907</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_270">
<Value>
<Obj>
<type>0</type>
<id>482</id>
<name>tmp7</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>908</item>
<item>909</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_271">
<Value>
<Obj>
<type>0</type>
<id>483</id>
<name>tmp_68</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>910</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_272">
<Value>
<Obj>
<type>0</type>
<id>484</id>
<name>tmp_69</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>911</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_273">
<Value>
<Obj>
<type>0</type>
<id>485</id>
<name>tmp6_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>912</item>
<item>913</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_274">
<Value>
<Obj>
<type>0</type>
<id>486</id>
<name>tmp3</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>914</item>
<item>915</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_275">
<Value>
<Obj>
<type>0</type>
<id>487</id>
<name>tmp10</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>916</item>
<item>917</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_276">
<Value>
<Obj>
<type>0</type>
<id>488</id>
<name>tmp_70</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>918</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_277">
<Value>
<Obj>
<type>0</type>
<id>489</id>
<name>tmp9_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>919</item>
<item>920</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_278">
<Value>
<Obj>
<type>0</type>
<id>490</id>
<name>tmp12</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>921</item>
<item>922</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_279">
<Value>
<Obj>
<type>0</type>
<id>491</id>
<name>tmp_71</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>923</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_280">
<Value>
<Obj>
<type>0</type>
<id>492</id>
<name>tmp_72</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>924</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_281">
<Value>
<Obj>
<type>0</type>
<id>493</id>
<name>tmp11_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>925</item>
<item>926</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_282">
<Value>
<Obj>
<type>0</type>
<id>494</id>
<name>tmp8</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>927</item>
<item>928</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_283">
<Value>
<Obj>
<type>0</type>
<id>495</id>
<name>tmp2</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>929</item>
<item>930</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_284">
<Value>
<Obj>
<type>0</type>
<id>496</id>
<name>tmp16</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>931</item>
<item>932</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_285">
<Value>
<Obj>
<type>0</type>
<id>497</id>
<name>tmp15</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>933</item>
<item>934</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_286">
<Value>
<Obj>
<type>0</type>
<id>498</id>
<name>tmp18</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>935</item>
<item>936</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_287">
<Value>
<Obj>
<type>0</type>
<id>499</id>
<name>tmp_73</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>937</item>
<item>939</item>
</oprand_edges>
<opcode>shl</opcode>
</item>
<item class_id_reference="9" object_id="_288">
<Value>
<Obj>
<type>0</type>
<id>500</id>
<name>tmp_74</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>940</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_289">
<Value>
<Obj>
<type>0</type>
<id>501</id>
<name>tmp17_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>941</item>
<item>942</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_290">
<Value>
<Obj>
<type>0</type>
<id>502</id>
<name>tmp14</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>943</item>
<item>944</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_291">
<Value>
<Obj>
<type>0</type>
<id>503</id>
<name>tmp21</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>945</item>
<item>946</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_292">
<Value>
<Obj>
<type>0</type>
<id>504</id>
<name>tmp_75</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>947</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_293">
<Value>
<Obj>
<type>0</type>
<id>505</id>
<name>tmp20_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>948</item>
<item>949</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_294">
<Value>
<Obj>
<type>0</type>
<id>506</id>
<name>tmp_76</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>950</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_295">
<Value>
<Obj>
<type>0</type>
<id>507</id>
<name>tmp_77</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>951</item>
<item>953</item>
</oprand_edges>
<opcode>shl</opcode>
</item>
<item class_id_reference="9" object_id="_296">
<Value>
<Obj>
<type>0</type>
<id>508</id>
<name>tmp_78</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>954</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_297">
<Value>
<Obj>
<type>0</type>
<id>509</id>
<name>tmp_79</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>955</item>
<item>956</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_298">
<Value>
<Obj>
<type>0</type>
<id>510</id>
<name>tmp22_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>957</item>
<item>958</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_299">
<Value>
<Obj>
<type>0</type>
<id>511</id>
<name>tmp19</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>959</item>
<item>960</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_300">
<Value>
<Obj>
<type>0</type>
<id>512</id>
<name>tmp13</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>961</item>
<item>962</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_301">
<Value>
<Obj>
<type>0</type>
<id>513</id>
<name>tmp1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>963</item>
<item>964</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_302">
<Value>
<Obj>
<type>0</type>
<id>514</id>
<name>tmp28</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>965</item>
<item>966</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_303">
<Value>
<Obj>
<type>0</type>
<id>515</id>
<name>tmp27</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>967</item>
<item>968</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_304">
<Value>
<Obj>
<type>0</type>
<id>516</id>
<name>tmp_80</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</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>969</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_305">
<Value>
<Obj>
<type>0</type>
<id>517</id>
<name>tmp_81</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>970</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_306">
<Value>
<Obj>
<type>0</type>
<id>518</id>
<name>tmp_82</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>971</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_307">
<Value>
<Obj>
<type>0</type>
<id>519</id>
<name>tmp_83</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>972</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_308">
<Value>
<Obj>
<type>0</type>
<id>520</id>
<name>tmp_84</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>973</item>
<item>974</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_309">
<Value>
<Obj>
<type>0</type>
<id>521</id>
<name>tmp29_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>975</item>
<item>976</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_310">
<Value>
<Obj>
<type>0</type>
<id>522</id>
<name>tmp26</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>977</item>
<item>978</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_311">
<Value>
<Obj>
<type>0</type>
<id>523</id>
<name>tmp33</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>979</item>
<item>980</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_312">
<Value>
<Obj>
<type>0</type>
<id>524</id>
<name>tmp32</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>981</item>
<item>982</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_313">
<Value>
<Obj>
<type>0</type>
<id>525</id>
<name>tmp_85</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</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>983</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_314">
<Value>
<Obj>
<type>0</type>
<id>526</id>
<name>tmp35</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>984</item>
<item>985</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_315">
<Value>
<Obj>
<type>0</type>
<id>527</id>
<name>tmp_86</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>986</item>
<item>988</item>
</oprand_edges>
<opcode>shl</opcode>
</item>
<item class_id_reference="9" object_id="_316">
<Value>
<Obj>
<type>0</type>
<id>528</id>
<name>tmp_87</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>989</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_317">
<Value>
<Obj>
<type>0</type>
<id>529</id>
<name>tmp34_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>990</item>
<item>991</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_318">
<Value>
<Obj>
<type>0</type>
<id>530</id>
<name>tmp31</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>992</item>
<item>993</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_319">
<Value>
<Obj>
<type>0</type>
<id>531</id>
<name>tmp25</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>994</item>
<item>995</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_320">
<Value>
<Obj>
<type>0</type>
<id>532</id>
<name>tmp39</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>996</item>
<item>997</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_321">
<Value>
<Obj>
<type>0</type>
<id>533</id>
<name>tmp_88</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>998</item>
<item>1000</item>
</oprand_edges>
<opcode>shl</opcode>
</item>
<item class_id_reference="9" object_id="_322">
<Value>
<Obj>
<type>0</type>
<id>534</id>
<name>tmp_89</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>1001</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_323">
<Value>
<Obj>
<type>0</type>
<id>535</id>
<name>tmp38_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1002</item>
<item>1003</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_324">
<Value>
<Obj>
<type>0</type>
<id>536</id>
<name>tmp_90</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>1004</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_325">
<Value>
<Obj>
<type>0</type>
<id>537</id>
<name>tmp_91</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>1005</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_326">
<Value>
<Obj>
<type>0</type>
<id>538</id>
<name>tmp_92</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>1006</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_327">
<Value>
<Obj>
<type>0</type>
<id>539</id>
<name>tmp_93</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1007</item>
<item>1008</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_328">
<Value>
<Obj>
<type>0</type>
<id>540</id>
<name>tmp40_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1009</item>
<item>1010</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_329">
<Value>
<Obj>
<type>0</type>
<id>541</id>
<name>tmp37</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1011</item>
<item>1012</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_330">
<Value>
<Obj>
<type>0</type>
<id>542</id>
<name>tmp44</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1013</item>
<item>1014</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_331">
<Value>
<Obj>
<type>0</type>
<id>543</id>
<name>tmp_94</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>1015</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_332">
<Value>
<Obj>
<type>0</type>
<id>544</id>
<name>tmp_95</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>21</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>1016</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_333">
<Value>
<Obj>
<type>0</type>
<id>545</id>
<name>tmp43_cast</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1017</item>
<item>1018</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_334">
<Value>
<Obj>
<type>0</type>
<id>546</id>
<name>tmp46</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1019</item>
<item>1020</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_335">
<Value>
<Obj>
<type>0</type>
<id>547</id>
<name>tmp47</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1021</item>
<item>1022</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_336">
<Value>
<Obj>
<type>0</type>
<id>548</id>
<name>tmp45</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1023</item>
<item>1024</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_337">
<Value>
<Obj>
<type>0</type>
<id>549</id>
<name>tmp42</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1025</item>
<item>1026</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_338">
<Value>
<Obj>
<type>0</type>
<id>550</id>
<name>tmp36</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1027</item>
<item>1028</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_339">
<Value>
<Obj>
<type>0</type>
<id>551</id>
<name>tmp24</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1029</item>
<item>1030</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_340">
<Value>
<Obj>
<type>0</type>
<id>552</id>
<name>tmp_55</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>pixel_weighted_average</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>137</second>
</item>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>pixel_weighted_average</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1031</item>
<item>1032</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_341">
<Value>
<Obj>
<type>0</type>
<id>553</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>138</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>138</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>1034</item>
<item>1035</item>
<item>1036</item>
</oprand_edges>
<opcode>write</opcode>
</item>
<item class_id_reference="9" object_id="_342">
<Value>
<Obj>
<type>0</type>
<id>554</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>139</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>139</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>1037</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_343">
<Value>
<Obj>
<type>0</type>
<id>557</id>
<name>col_1</name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1038</item>
<item>1040</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_344">
<Value>
<Obj>
<type>0</type>
<id>558</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>1041</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_345">
<Value>
<Obj>
<type>0</type>
<id>560</id>
<name></name>
<fileName>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>147</lineNumber>
<contextFuncName>convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Configurable_Convolution_Filter/configurable_convolution_filter.cpp</first>
<second>convolution_filter</second>
</first>
<second>147</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>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>62</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_346">
<Value>
<Obj>
<type>2</type>
<id>562</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="_347">
<Value>
<Obj>
<type>2</type>
<id>592</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>19</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_348">
<Value>
<Obj>
<type>2</type>
<id>597</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="_349">
<Value>
<Obj>
<type>2</type>
<id>602</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="_350">
<Value>
<Obj>
<type>2</type>
<id>615</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>19</bitwidth>
</Value>
<const_type>0</const_type>
<content>310569</content>
</item>
<item class_id_reference="16" object_id="_351">
<Value>
<Obj>
<type>2</type>
<id>618</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>19</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_352">
<Value>
<Obj>
<type>2</type>
<id>625</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_353">
<Value>
<Obj>
<type>2</type>
<id>704</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>2</content>
</item>
<item class_id_reference="16" object_id="_354">
<Value>
<Obj>
<type>2</type>
<id>720</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>30</content>
</item>
<item class_id_reference="16" object_id="_355">
<Value>
<Obj>
<type>2</type>
<id>724</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>39</content>
</item>
<item class_id_reference="16" object_id="_356">
<Value>
<Obj>
<type>2</type>
<id>728</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>48</content>
</item>
<item class_id_reference="16" object_id="_357">
<Value>
<Obj>
<type>2</type>
<id>732</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>10</content>
</item>
<item class_id_reference="16" object_id="_358">
<Value>
<Obj>
<type>2</type>
<id>736</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>19</content>
</item>
<item class_id_reference="16" object_id="_359">
<Value>
<Obj>
<type>2</type>
<id>740</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>28</content>
</item>
<item class_id_reference="16" object_id="_360">
<Value>
<Obj>
<type>2</type>
<id>744</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>38</content>
</item>
<item class_id_reference="16" object_id="_361">
<Value>
<Obj>
<type>2</type>
<id>748</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>47</content>
</item>
<item class_id_reference="16" object_id="_362">
<Value>
<Obj>
<type>2</type>
<id>753</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<const_type>0</const_type>
<content>7</content>
</item>
<item class_id_reference="16" object_id="_363">
<Value>
<Obj>
<type>2</type>
<id>758</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>9</content>
</item>
<item class_id_reference="16" object_id="_364">
<Value>
<Obj>
<type>2</type>
<id>762</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>18</content>
</item>
<item class_id_reference="16" object_id="_365">
<Value>
<Obj>
<type>2</type>
<id>766</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>27</content>
</item>
<item class_id_reference="16" object_id="_366">
<Value>
<Obj>
<type>2</type>
<id>770</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>29</content>
</item>
<item class_id_reference="16" object_id="_367">
<Value>
<Obj>
<type>2</type>
<id>775</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>46</content>
</item>
<item class_id_reference="16" object_id="_368">
<Value>
<Obj>
<type>2</type>
<id>780</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<const_type>0</const_type>
<content>6</content>
</item>
<item class_id_reference="16" object_id="_369">
<Value>
<Obj>
<type>2</type>
<id>785</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>17</content>
</item>
<item class_id_reference="16" object_id="_370">
<Value>
<Obj>
<type>2</type>
<id>789</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>26</content>
</item>
<item class_id_reference="16" object_id="_371">
<Value>
<Obj>
<type>2</type>
<id>793</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>35</content>
</item>
<item class_id_reference="16" object_id="_372">
<Value>
<Obj>
<type>2</type>
<id>797</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>37</content>
</item>
<item class_id_reference="16" object_id="_373">
<Value>
<Obj>
<type>2</type>
<id>802</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<const_type>0</const_type>
<content>5</content>
</item>
<item class_id_reference="16" object_id="_374">
<Value>
<Obj>
<type>2</type>
<id>807</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>14</content>
</item>
<item class_id_reference="16" object_id="_375">
<Value>
<Obj>
<type>2</type>
<id>811</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>25</content>
</item>
<item class_id_reference="16" object_id="_376">
<Value>
<Obj>
<type>2</type>
<id>815</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>34</content>
</item>
<item class_id_reference="16" object_id="_377">
<Value>
<Obj>
<type>2</type>
<id>819</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>36</content>
</item>
<item class_id_reference="16" object_id="_378">
<Value>
<Obj>
<type>2</type>
<id>823</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>45</content>
</item>
<item class_id_reference="16" object_id="_379">
<Value>
<Obj>
<type>2</type>
<id>827</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>13</content>
</item>
<item class_id_reference="16" object_id="_380">
<Value>
<Obj>
<type>2</type>
<id>831</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>15</content>
</item>
<item class_id_reference="16" object_id="_381">
<Value>
<Obj>
<type>2</type>
<id>835</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>24</content>
</item>
<item class_id_reference="16" object_id="_382">
<Value>
<Obj>
<type>2</type>
<id>839</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>33</content>
</item>
<item class_id_reference="16" object_id="_383">
<Value>
<Obj>
<type>2</type>
<id>843</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>42</content>
</item>
<item class_id_reference="16" object_id="_384">
<Value>
<Obj>
<type>2</type>
<id>847</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>44</content>
</item>
<item class_id_reference="16" object_id="_385">
<Value>
<Obj>
<type>2</type>
<id>851</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>21</content>
</item>
<item class_id_reference="16" object_id="_386">
<Value>
<Obj>
<type>2</type>
<id>855</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>23</content>
</item>
<item class_id_reference="16" object_id="_387">
<Value>
<Obj>
<type>2</type>
<id>859</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>41</content>
</item>
<item class_id_reference="16" object_id="_388">
<Value>
<Obj>
<type>2</type>
<id>863</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>43</content>
</item>
<item class_id_reference="16" object_id="_389">
<Value>
<Obj>
<type>2</type>
<id>867</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>3</content>
</item>
<item class_id_reference="16" object_id="_390">
<Value>
<Obj>
<type>2</type>
<id>871</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>12</content>
</item>
<item class_id_reference="16" object_id="_391">
<Value>
<Obj>
<type>2</type>
<id>875</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>22</content>
</item>
<item class_id_reference="16" object_id="_392">
<Value>
<Obj>
<type>2</type>
<id>879</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>31</content>
</item>
<item class_id_reference="16" object_id="_393">
<Value>
<Obj>
<type>2</type>
<id>883</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>40</content>
</item>
<item class_id_reference="16" object_id="_394">
<Value>
<Obj>
<type>2</type>
<id>887</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>15</bitwidth>
</Value>
<const_type>0</const_type>
<content>49</content>
</item>
<item class_id_reference="16" object_id="_395">
<Value>
<Obj>
<type>2</type>
<id>890</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_396">
<Value>
<Obj>
<type>2</type>
<id>894</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>11</content>
</item>
<item class_id_reference="16" object_id="_397">
<Value>
<Obj>
<type>2</type>
<id>899</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>20</content>
</item>
<item class_id_reference="16" object_id="_398">
<Value>
<Obj>
<type>2</type>
<id>938</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>3</content>
</item>
<item class_id_reference="16" object_id="_399">
<Value>
<Obj>
<type>2</type>
<id>952</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_400">
<Value>
<Obj>
<type>2</type>
<id>987</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_401">
<Value>
<Obj>
<type>2</type>
<id>999</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>5</content>
</item>
<item class_id_reference="16" object_id="_402">
<Value>
<Obj>
<type>2</type>
<id>1039</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>1</content>
</item>
<item class_id_reference="16" object_id="_403">
<Value>
<Obj>
<type>2</type>
<id>1043</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>643</content>
</item>
<item class_id_reference="16" object_id="_404">
<Value>
<Obj>
<type>2</type>
<id>1049</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="_405">
<Value>
<Obj>
<type>2</type>
<id>1052</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>480</content>
</item>
<item class_id_reference="16" object_id="_406">
<Value>
<Obj>
<type>2</type>
<id>1060</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>2</content>
</item>
<item class_id_reference="16" object_id="_407">
<Value>
<Obj>
<type>2</type>
<id>1176</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>640</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_408">
<Obj>
<type>3</type>
<id>78</id>
<name>.preheader245.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>22</count>
<item_version>0</item_version>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_409">
<Obj>
<type>3</type>
<id>92</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>13</count>
<item_version>0</item_version>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
<item>85</item>
<item>86</item>
<item>87</item>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_410">
<Obj>
<type>3</type>
<id>180</id>
<name>.reset</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>82</count>
<item_version>0</item_version>
<item>95</item>
<item>96</item>
<item>97</item>
<item>98</item>
<item>99</item>
<item>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
<item>104</item>
<item>108</item>
<item>109</item>
<item>110</item>
<item>111</item>
<item>112</item>
<item>113</item>
<item>114</item>
<item>115</item>
<item>116</item>
<item>117</item>
<item>118</item>
<item>119</item>
<item>120</item>
<item>121</item>
<item>122</item>
<item>123</item>
<item>124</item>
<item>125</item>
<item>126</item>
<item>127</item>
<item>128</item>
<item>129</item>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
<item>134</item>
<item>135</item>
<item>136</item>
<item>137</item>
<item>138</item>
<item>139</item>
<item>140</item>
<item>141</item>
<item>142</item>
<item>143</item>
<item>144</item>
<item>145</item>
<item>146</item>
<item>147</item>
<item>148</item>
<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>
<item>159</item>
<item>160</item>
<item>161</item>
<item>162</item>
<item>163</item>
<item>164</item>
<item>165</item>
<item>166</item>
<item>167</item>
<item>168</item>
<item>169</item>
<item>170</item>
<item>171</item>
<item>172</item>
<item>173</item>
<item>174</item>
<item>175</item>
<item>176</item>
<item>177</item>
<item>178</item>
<item>179</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_411">
<Obj>
<type>3</type>
<id>212</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>31</count>
<item_version>0</item_version>
<item>181</item>
<item>182</item>
<item>183</item>
<item>184</item>
<item>185</item>
<item>186</item>
<item>187</item>
<item>188</item>
<item>189</item>
<item>190</item>
<item>191</item>
<item>192</item>
<item>193</item>
<item>194</item>
<item>195</item>
<item>196</item>
<item>197</item>
<item>198</item>
<item>199</item>
<item>200</item>
<item>201</item>
<item>202</item>
<item>203</item>
<item>204</item>
<item>205</item>
<item>206</item>
<item>207</item>
<item>208</item>
<item>209</item>
<item>210</item>
<item>211</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_412">
<Obj>
<type>3</type>
<id>215</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>2</count>
<item_version>0</item_version>
<item>213</item>
<item>214</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_413">
<Obj>
<type>3</type>
<id>223</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>216</item>
<item>217</item>
<item>218</item>
<item>219</item>
<item>220</item>
<item>221</item>
<item>222</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_414">
<Obj>
<type>3</type>
<id>227</id>
<name>.loopexit._crit_edge</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>224</item>
<item>225</item>
<item>226</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_415">
<Obj>
<type>3</type>
<id>555</id>
<name>.preheader6</name>
<fileName></fileName>
<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>180</count>
<item_version>0</item_version>
<item>228</item>
<item>229</item>
<item>230</item>
<item>231</item>
<item>232</item>
<item>233</item>
<item>234</item>
<item>236</item>
<item>237</item>
<item>241</item>
<item>242</item>
<item>246</item>
<item>247</item>
<item>254</item>
<item>255</item>
<item>259</item>
<item>260</item>
<item>264</item>
<item>265</item>
<item>269</item>
<item>270</item>
<item>274</item>
<item>275</item>
<item>278</item>
<item>280</item>
<item>281</item>
<item>284</item>
<item>286</item>
<item>287</item>
<item>291</item>
<item>292</item>
<item>296</item>
<item>297</item>
<item>301</item>
<item>302</item>
<item>305</item>
<item>307</item>
<item>308</item>
<item>311</item>
<item>313</item>
<item>314</item>
<item>317</item>
<item>322</item>
<item>323</item>
<item>327</item>
<item>328</item>
<item>332</item>
<item>333</item>
<item>337</item>
<item>338</item>
<item>341</item>
<item>343</item>
<item>344</item>
<item>347</item>
<item>349</item>
<item>350</item>
<item>357</item>
<item>358</item>
<item>362</item>
<item>363</item>
<item>367</item>
<item>368</item>
<item>372</item>
<item>373</item>
<item>377</item>
<item>378</item>
<item>382</item>
<item>383</item>
<item>387</item>
<item>388</item>
<item>392</item>
<item>393</item>
<item>397</item>
<item>398</item>
<item>402</item>
<item>403</item>
<item>410</item>
<item>411</item>
<item>415</item>
<item>416</item>
<item>423</item>
<item>424</item>
<item>428</item>
<item>429</item>
<item>433</item>
<item>434</item>
<item>438</item>
<item>439</item>
<item>443</item>
<item>444</item>
<item>448</item>
<item>449</item>
<item>453</item>
<item>454</item>
<item>458</item>
<item>459</item>
<item>465</item>
<item>467</item>
<item>468</item>
<item>471</item>
<item>473</item>
<item>474</item>
<item>477</item>
<item>478</item>
<item>479</item>
<item>480</item>
<item>481</item>
<item>482</item>
<item>483</item>
<item>484</item>
<item>485</item>
<item>486</item>
<item>487</item>
<item>488</item>
<item>489</item>
<item>490</item>
<item>491</item>
<item>492</item>
<item>493</item>
<item>494</item>
<item>495</item>
<item>496</item>
<item>497</item>
<item>498</item>
<item>499</item>
<item>500</item>
<item>501</item>
<item>502</item>
<item>503</item>
<item>504</item>
<item>505</item>
<item>506</item>
<item>507</item>
<item>508</item>
<item>509</item>
<item>510</item>
<item>511</item>
<item>512</item>
<item>513</item>
<item>514</item>
<item>515</item>
<item>516</item>
<item>517</item>
<item>518</item>
<item>519</item>
<item>520</item>
<item>521</item>
<item>522</item>
<item>523</item>
<item>524</item>
<item>525</item>
<item>526</item>
<item>527</item>
<item>528</item>
<item>529</item>
<item>530</item>
<item>531</item>
<item>532</item>
<item>533</item>
<item>534</item>
<item>535</item>
<item>536</item>
<item>537</item>
<item>538</item>
<item>539</item>
<item>540</item>
<item>541</item>
<item>542</item>
<item>543</item>
<item>544</item>
<item>545</item>
<item>546</item>
<item>547</item>
<item>548</item>
<item>549</item>
<item>550</item>
<item>551</item>
<item>552</item>
<item>553</item>
<item>554</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_416">
<Obj>
<type>3</type>
<id>559</id>
<name>._crit_edge251</name>
<fileName></fileName>
<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>557</item>
<item>558</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_417">
<Obj>
<type>3</type>
<id>561</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>560</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>649</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_418">
<id>563</id>
<edge_type>1</edge_type>
<source_obj>562</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_419">
<id>564</id>
<edge_type>1</edge_type>
<source_obj>562</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_420">
<id>565</id>
<edge_type>1</edge_type>
<source_obj>562</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_421">
<id>566</id>
<edge_type>1</edge_type>
<source_obj>562</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_422">
<id>567</id>
<edge_type>1</edge_type>
<source_obj>562</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_423">
<id>568</id>
<edge_type>1</edge_type>
<source_obj>562</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_424">
<id>569</id>
<edge_type>1</edge_type>
<source_obj>562</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_425">
<id>570</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_426">
<id>571</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_427">
<id>572</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_428">
<id>573</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_429">
<id>574</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_430">
<id>575</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_431">
<id>576</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_432">
<id>577</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_433">
<id>578</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_434">
<id>579</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_435">
<id>580</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_436">
<id>581</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_437">
<id>582</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_438">
<id>583</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_439">
<id>584</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_440">
<id>585</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_441">
<id>586</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_442">
<id>587</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_443">
<id>588</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_444">
<id>589</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_445">
<id>590</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_446">
<id>591</id>
<edge_type>2</edge_type>
<source_obj>92</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_447">
<id>593</id>
<edge_type>1</edge_type>
<source_obj>592</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_448">
<id>594</id>
<edge_type>2</edge_type>
<source_obj>78</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_449">
<id>595</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_450">
<id>596</id>
<edge_type>2</edge_type>
<source_obj>559</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_451">
<id>598</id>
<edge_type>1</edge_type>
<source_obj>597</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_452">
<id>599</id>
<edge_type>2</edge_type>
<source_obj>78</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_453">
<id>600</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_454">
<id>601</id>
<edge_type>2</edge_type>
<source_obj>559</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_455">
<id>603</id>
<edge_type>1</edge_type>
<source_obj>602</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_456">
<id>604</id>
<edge_type>2</edge_type>
<source_obj>78</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_457">
<id>605</id>
<edge_type>1</edge_type>
<source_obj>557</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_458">
<id>606</id>
<edge_type>2</edge_type>
<source_obj>559</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_459">
<id>607</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_460">
<id>608</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_461">
<id>609</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_462">
<id>610</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_463">
<id>611</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_464">
<id>612</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_465">
<id>613</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_466">
<id>614</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_467">
<id>616</id>
<edge_type>1</edge_type>
<source_obj>615</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_468">
<id>617</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_469">
<id>619</id>
<edge_type>1</edge_type>
<source_obj>618</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_470">
<id>620</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_471">
<id>621</id>
<edge_type>2</edge_type>
<source_obj>180</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_472">
<id>622</id>
<edge_type>2</edge_type>
<source_obj>561</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_473">
<id>623</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>181</sink_obj>
</item>
<item class_id_reference="20" object_id="_474">
<id>624</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>182</sink_obj>
</item>
<item class_id_reference="20" object_id="_475">
<id>626</id>
<edge_type>1</edge_type>
<source_obj>625</source_obj>
<sink_obj>182</sink_obj>
</item>
<item class_id_reference="20" object_id="_476">
<id>627</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>182</sink_obj>
</item>
<item class_id_reference="20" object_id="_477">
<id>628</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>183</sink_obj>
</item>
<item class_id_reference="20" object_id="_478">
<id>629</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>184</sink_obj>
</item>
<item class_id_reference="20" object_id="_479">
<id>630</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>184</sink_obj>
</item>
<item class_id_reference="20" object_id="_480">
<id>631</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>185</sink_obj>
</item>
<item class_id_reference="20" object_id="_481">
<id>632</id>
<edge_type>1</edge_type>
<source_obj>625</source_obj>
<sink_obj>185</sink_obj>
</item>
<item class_id_reference="20" object_id="_482">
<id>633</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>185</sink_obj>
</item>
<item class_id_reference="20" object_id="_483">
<id>634</id>
<edge_type>1</edge_type>
<source_obj>185</source_obj>
<sink_obj>186</sink_obj>
</item>
<item class_id_reference="20" object_id="_484">
<id>635</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>187</sink_obj>
</item>
<item class_id_reference="20" object_id="_485">
<id>636</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>187</sink_obj>
</item>
<item class_id_reference="20" object_id="_486">
<id>637</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>188</sink_obj>
</item>
<item class_id_reference="20" object_id="_487">
<id>638</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>188</sink_obj>
</item>
<item class_id_reference="20" object_id="_488">
<id>639</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>189</sink_obj>
</item>
<item class_id_reference="20" object_id="_489">
<id>640</id>
<edge_type>1</edge_type>
<source_obj>625</source_obj>
<sink_obj>189</sink_obj>
</item>
<item class_id_reference="20" object_id="_490">
<id>641</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>189</sink_obj>
</item>
<item class_id_reference="20" object_id="_491">
<id>642</id>
<edge_type>1</edge_type>
<source_obj>189</source_obj>
<sink_obj>190</sink_obj>
</item>
<item class_id_reference="20" object_id="_492">
<id>643</id>
<edge_type>1</edge_type>
<source_obj>190</source_obj>
<sink_obj>191</sink_obj>
</item>
<item class_id_reference="20" object_id="_493">
<id>644</id>
<edge_type>1</edge_type>
<source_obj>185</source_obj>
<sink_obj>191</sink_obj>
</item>
<item class_id_reference="20" object_id="_494">
<id>645</id>
<edge_type>1</edge_type>
<source_obj>190</source_obj>
<sink_obj>192</sink_obj>
</item>
<item class_id_reference="20" object_id="_495">
<id>646</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>192</sink_obj>
</item>
<item class_id_reference="20" object_id="_496">
<id>647</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>193</sink_obj>
</item>
<item class_id_reference="20" object_id="_497">
<id>648</id>
<edge_type>1</edge_type>
<source_obj>625</source_obj>
<sink_obj>193</sink_obj>
</item>
<item class_id_reference="20" object_id="_498">
<id>649</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>193</sink_obj>
</item>
<item class_id_reference="20" object_id="_499">
<id>650</id>
<edge_type>1</edge_type>
<source_obj>193</source_obj>
<sink_obj>194</sink_obj>
</item>
<item class_id_reference="20" object_id="_500">
<id>651</id>
<edge_type>1</edge_type>
<source_obj>194</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_501">
<id>652</id>
<edge_type>1</edge_type>
<source_obj>189</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_502">
<id>653</id>
<edge_type>1</edge_type>
<source_obj>194</source_obj>
<sink_obj>196</sink_obj>
</item>
<item class_id_reference="20" object_id="_503">
<id>654</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>196</sink_obj>
</item>
<item class_id_reference="20" object_id="_504">
<id>655</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>197</sink_obj>
</item>
<item class_id_reference="20" object_id="_505">
<id>656</id>
<edge_type>1</edge_type>
<source_obj>625</source_obj>
<sink_obj>197</sink_obj>
</item>
<item class_id_reference="20" object_id="_506">
<id>657</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>197</sink_obj>
</item>
<item class_id_reference="20" object_id="_507">
<id>658</id>
<edge_type>1</edge_type>
<source_obj>197</source_obj>
<sink_obj>198</sink_obj>
</item>
<item class_id_reference="20" object_id="_508">
<id>659</id>
<edge_type>1</edge_type>
<source_obj>198</source_obj>
<sink_obj>199</sink_obj>
</item>
<item class_id_reference="20" object_id="_509">
<id>660</id>
<edge_type>1</edge_type>
<source_obj>193</source_obj>
<sink_obj>199</sink_obj>
</item>
<item class_id_reference="20" object_id="_510">
<id>661</id>
<edge_type>1</edge_type>
<source_obj>198</source_obj>
<sink_obj>200</sink_obj>
</item>
<item class_id_reference="20" object_id="_511">
<id>662</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>200</sink_obj>
</item>
<item class_id_reference="20" object_id="_512">
<id>663</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>201</sink_obj>
</item>
<item class_id_reference="20" object_id="_513">
<id>664</id>
<edge_type>1</edge_type>
<source_obj>625</source_obj>
<sink_obj>201</sink_obj>
</item>
<item class_id_reference="20" object_id="_514">
<id>665</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>201</sink_obj>
</item>
<item class_id_reference="20" object_id="_515">
<id>666</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>202</sink_obj>
</item>
<item class_id_reference="20" object_id="_516">
<id>667</id>
<edge_type>1</edge_type>
<source_obj>202</source_obj>
<sink_obj>203</sink_obj>
</item>
<item class_id_reference="20" object_id="_517">
<id>668</id>
<edge_type>1</edge_type>
<source_obj>197</source_obj>
<sink_obj>203</sink_obj>
</item>
<item class_id_reference="20" object_id="_518">
<id>669</id>
<edge_type>1</edge_type>
<source_obj>202</source_obj>
<sink_obj>204</sink_obj>
</item>
<item class_id_reference="20" object_id="_519">
<id>670</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>204</sink_obj>
</item>
<item class_id_reference="20" object_id="_520">
<id>671</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>205</sink_obj>
</item>
<item class_id_reference="20" object_id="_521">
<id>672</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>205</sink_obj>
</item>
<item class_id_reference="20" object_id="_522">
<id>673</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>206</sink_obj>
</item>
<item class_id_reference="20" object_id="_523">
<id>674</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>206</sink_obj>
</item>
<item class_id_reference="20" object_id="_524">
<id>675</id>
<edge_type>1</edge_type>
<source_obj>190</source_obj>
<sink_obj>207</sink_obj>
</item>
<item class_id_reference="20" object_id="_525">
<id>676</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>207</sink_obj>
</item>
<item class_id_reference="20" object_id="_526">
<id>677</id>
<edge_type>1</edge_type>
<source_obj>194</source_obj>
<sink_obj>208</sink_obj>
</item>
<item class_id_reference="20" object_id="_527">
<id>678</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>208</sink_obj>
</item>
<item class_id_reference="20" object_id="_528">
<id>679</id>
<edge_type>1</edge_type>
<source_obj>198</source_obj>
<sink_obj>209</sink_obj>
</item>
<item class_id_reference="20" object_id="_529">
<id>680</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>209</sink_obj>
</item>
<item class_id_reference="20" object_id="_530">
<id>681</id>
<edge_type>1</edge_type>
<source_obj>202</source_obj>
<sink_obj>210</sink_obj>
</item>
<item class_id_reference="20" object_id="_531">
<id>682</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>210</sink_obj>
</item>
<item class_id_reference="20" object_id="_532">
<id>683</id>
<edge_type>2</edge_type>
<source_obj>215</source_obj>
<sink_obj>211</sink_obj>
</item>
<item class_id_reference="20" object_id="_533">
<id>684</id>
<edge_type>1</edge_type>
<source_obj>178</source_obj>
<sink_obj>213</sink_obj>
</item>
<item class_id_reference="20" object_id="_534">
<id>685</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>213</sink_obj>
</item>
<item class_id_reference="20" object_id="_535">
<id>686</id>
<edge_type>1</edge_type>
<source_obj>213</source_obj>
<sink_obj>214</sink_obj>
</item>
<item class_id_reference="20" object_id="_536">
<id>687</id>
<edge_type>2</edge_type>
<source_obj>227</source_obj>
<sink_obj>214</sink_obj>
</item>
<item class_id_reference="20" object_id="_537">
<id>688</id>
<edge_type>2</edge_type>
<source_obj>223</source_obj>
<sink_obj>214</sink_obj>
</item>
<item class_id_reference="20" object_id="_538">
<id>691</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>216</sink_obj>
</item>
<item class_id_reference="20" object_id="_539">
<id>692</id>
<edge_type>1</edge_type>
<source_obj>216</source_obj>
<sink_obj>217</sink_obj>
</item>
<item class_id_reference="20" object_id="_540">
<id>693</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>217</sink_obj>
</item>
<item class_id_reference="20" object_id="_541">
<id>694</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>218</sink_obj>
</item>
<item class_id_reference="20" object_id="_542">
<id>695</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>219</sink_obj>
</item>
<item class_id_reference="20" object_id="_543">
<id>696</id>
<edge_type>1</edge_type>
<source_obj>625</source_obj>
<sink_obj>219</sink_obj>
</item>
<item class_id_reference="20" object_id="_544">
<id>697</id>
<edge_type>1</edge_type>
<source_obj>218</source_obj>
<sink_obj>219</sink_obj>
</item>
<item class_id_reference="20" object_id="_545">
<id>698</id>
<edge_type>1</edge_type>
<source_obj>216</source_obj>
<sink_obj>220</sink_obj>
</item>
<item class_id_reference="20" object_id="_546">
<id>699</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>220</sink_obj>
</item>
<item class_id_reference="20" object_id="_547">
<id>700</id>
<edge_type>1</edge_type>
<source_obj>216</source_obj>
<sink_obj>221</sink_obj>
</item>
<item class_id_reference="20" object_id="_548">
<id>701</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>221</sink_obj>
</item>
<item class_id_reference="20" object_id="_549">
<id>702</id>
<edge_type>2</edge_type>
<source_obj>227</source_obj>
<sink_obj>222</sink_obj>
</item>
<item class_id_reference="20" object_id="_550">
<id>703</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>224</sink_obj>
</item>
<item class_id_reference="20" object_id="_551">
<id>705</id>
<edge_type>1</edge_type>
<source_obj>704</source_obj>
<sink_obj>224</sink_obj>
</item>
<item class_id_reference="20" object_id="_552">
<id>706</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>225</sink_obj>
</item>
<item class_id_reference="20" object_id="_553">
<id>707</id>
<edge_type>1</edge_type>
<source_obj>224</source_obj>
<sink_obj>225</sink_obj>
</item>
<item class_id_reference="20" object_id="_554">
<id>708</id>
<edge_type>1</edge_type>
<source_obj>225</source_obj>
<sink_obj>226</sink_obj>
</item>
<item class_id_reference="20" object_id="_555">
<id>709</id>
<edge_type>2</edge_type>
<source_obj>559</source_obj>
<sink_obj>226</sink_obj>
</item>
<item class_id_reference="20" object_id="_556">
<id>710</id>
<edge_type>2</edge_type>
<source_obj>555</source_obj>
<sink_obj>226</sink_obj>
</item>
<item class_id_reference="20" object_id="_557">
<id>711</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>228</sink_obj>
</item>
<item class_id_reference="20" object_id="_558">
<id>712</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>229</sink_obj>
</item>
<item class_id_reference="20" object_id="_559">
<id>713</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>230</sink_obj>
</item>
<item class_id_reference="20" object_id="_560">
<id>714</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>231</sink_obj>
</item>
<item class_id_reference="20" object_id="_561">
<id>715</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>232</sink_obj>
</item>
<item class_id_reference="20" object_id="_562">
<id>716</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>233</sink_obj>
</item>
<item class_id_reference="20" object_id="_563">
<id>717</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>234</sink_obj>
</item>
<item class_id_reference="20" object_id="_564">
<id>718</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>236</sink_obj>
</item>
<item class_id_reference="20" object_id="_565">
<id>719</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>237</sink_obj>
</item>
<item class_id_reference="20" object_id="_566">
<id>721</id>
<edge_type>1</edge_type>
<source_obj>720</source_obj>
<sink_obj>237</sink_obj>
</item>
<item class_id_reference="20" object_id="_567">
<id>722</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>241</sink_obj>
</item>
<item class_id_reference="20" object_id="_568">
<id>723</id>
<edge_type>1</edge_type>
<source_obj>241</source_obj>
<sink_obj>242</sink_obj>
</item>
<item class_id_reference="20" object_id="_569">
<id>725</id>
<edge_type>1</edge_type>
<source_obj>724</source_obj>
<sink_obj>242</sink_obj>
</item>
<item class_id_reference="20" object_id="_570">
<id>726</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>246</sink_obj>
</item>
<item class_id_reference="20" object_id="_571">
<id>727</id>
<edge_type>1</edge_type>
<source_obj>246</source_obj>
<sink_obj>247</sink_obj>
</item>
<item class_id_reference="20" object_id="_572">
<id>729</id>
<edge_type>1</edge_type>
<source_obj>728</source_obj>
<sink_obj>247</sink_obj>
</item>
<item class_id_reference="20" object_id="_573">
<id>730</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>254</sink_obj>
</item>
<item class_id_reference="20" object_id="_574">
<id>731</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>255</sink_obj>
</item>
<item class_id_reference="20" object_id="_575">
<id>733</id>
<edge_type>1</edge_type>
<source_obj>732</source_obj>
<sink_obj>255</sink_obj>
</item>
<item class_id_reference="20" object_id="_576">
<id>734</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>259</sink_obj>
</item>
<item class_id_reference="20" object_id="_577">
<id>735</id>
<edge_type>1</edge_type>
<source_obj>259</source_obj>
<sink_obj>260</sink_obj>
</item>
<item class_id_reference="20" object_id="_578">
<id>737</id>
<edge_type>1</edge_type>
<source_obj>736</source_obj>
<sink_obj>260</sink_obj>
</item>
<item class_id_reference="20" object_id="_579">
<id>738</id>
<edge_type>1</edge_type>
<source_obj>234</source_obj>
<sink_obj>264</sink_obj>
</item>
<item class_id_reference="20" object_id="_580">
<id>739</id>
<edge_type>1</edge_type>
<source_obj>264</source_obj>
<sink_obj>265</sink_obj>
</item>
<item class_id_reference="20" object_id="_581">
<id>741</id>
<edge_type>1</edge_type>
<source_obj>740</source_obj>
<sink_obj>265</sink_obj>
</item>
<item class_id_reference="20" object_id="_582">
<id>742</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>269</sink_obj>
</item>
<item class_id_reference="20" object_id="_583">
<id>743</id>
<edge_type>1</edge_type>
<source_obj>269</source_obj>
<sink_obj>270</sink_obj>
</item>
<item class_id_reference="20" object_id="_584">
<id>745</id>
<edge_type>1</edge_type>
<source_obj>744</source_obj>
<sink_obj>270</sink_obj>
</item>
<item class_id_reference="20" object_id="_585">
<id>746</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>274</sink_obj>
</item>
<item class_id_reference="20" object_id="_586">
<id>747</id>
<edge_type>1</edge_type>
<source_obj>274</source_obj>
<sink_obj>275</sink_obj>
</item>
<item class_id_reference="20" object_id="_587">
<id>749</id>
<edge_type>1</edge_type>
<source_obj>748</source_obj>
<sink_obj>275</sink_obj>
</item>
<item class_id_reference="20" object_id="_588">
<id>750</id>
<edge_type>1</edge_type>
<source_obj>275</source_obj>
<sink_obj>278</sink_obj>
</item>
<item class_id_reference="20" object_id="_589">
<id>751</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>280</sink_obj>
</item>
<item class_id_reference="20" object_id="_590">
<id>752</id>
<edge_type>1</edge_type>
<source_obj>280</source_obj>
<sink_obj>281</sink_obj>
</item>
<item class_id_reference="20" object_id="_591">
<id>754</id>
<edge_type>1</edge_type>
<source_obj>753</source_obj>
<sink_obj>281</sink_obj>
</item>
<item class_id_reference="20" object_id="_592">
<id>755</id>
<edge_type>1</edge_type>
<source_obj>281</source_obj>
<sink_obj>284</sink_obj>
</item>
<item class_id_reference="20" object_id="_593">
<id>756</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>286</sink_obj>
</item>
<item class_id_reference="20" object_id="_594">
<id>757</id>
<edge_type>1</edge_type>
<source_obj>286</source_obj>
<sink_obj>287</sink_obj>
</item>
<item class_id_reference="20" object_id="_595">
<id>759</id>
<edge_type>1</edge_type>
<source_obj>758</source_obj>
<sink_obj>287</sink_obj>
</item>
<item class_id_reference="20" object_id="_596">
<id>760</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>291</sink_obj>
</item>
<item class_id_reference="20" object_id="_597">
<id>761</id>
<edge_type>1</edge_type>
<source_obj>291</source_obj>
<sink_obj>292</sink_obj>
</item>
<item class_id_reference="20" object_id="_598">
<id>763</id>
<edge_type>1</edge_type>
<source_obj>762</source_obj>
<sink_obj>292</sink_obj>
</item>
<item class_id_reference="20" object_id="_599">
<id>764</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>296</sink_obj>
</item>
<item class_id_reference="20" object_id="_600">
<id>765</id>
<edge_type>1</edge_type>
<source_obj>296</source_obj>
<sink_obj>297</sink_obj>
</item>
<item class_id_reference="20" object_id="_601">
<id>767</id>
<edge_type>1</edge_type>
<source_obj>766</source_obj>
<sink_obj>297</sink_obj>
</item>
<item class_id_reference="20" object_id="_602">
<id>768</id>
<edge_type>1</edge_type>
<source_obj>233</source_obj>
<sink_obj>301</sink_obj>
</item>
<item class_id_reference="20" object_id="_603">
<id>769</id>
<edge_type>1</edge_type>
<source_obj>301</source_obj>
<sink_obj>302</sink_obj>
</item>
<item class_id_reference="20" object_id="_604">
<id>771</id>
<edge_type>1</edge_type>
<source_obj>770</source_obj>
<sink_obj>302</sink_obj>
</item>
<item class_id_reference="20" object_id="_605">
<id>772</id>
<edge_type>1</edge_type>
<source_obj>302</source_obj>
<sink_obj>305</sink_obj>
</item>
<item class_id_reference="20" object_id="_606">
<id>773</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>307</sink_obj>
</item>
<item class_id_reference="20" object_id="_607">
<id>774</id>
<edge_type>1</edge_type>
<source_obj>307</source_obj>
<sink_obj>308</sink_obj>
</item>
<item class_id_reference="20" object_id="_608">
<id>776</id>
<edge_type>1</edge_type>
<source_obj>775</source_obj>
<sink_obj>308</sink_obj>
</item>
<item class_id_reference="20" object_id="_609">
<id>777</id>
<edge_type>1</edge_type>
<source_obj>308</source_obj>
<sink_obj>311</sink_obj>
</item>
<item class_id_reference="20" object_id="_610">
<id>778</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>313</sink_obj>
</item>
<item class_id_reference="20" object_id="_611">
<id>779</id>
<edge_type>1</edge_type>
<source_obj>313</source_obj>
<sink_obj>314</sink_obj>
</item>
<item class_id_reference="20" object_id="_612">
<id>781</id>
<edge_type>1</edge_type>
<source_obj>780</source_obj>
<sink_obj>314</sink_obj>
</item>
<item class_id_reference="20" object_id="_613">
<id>782</id>
<edge_type>1</edge_type>
<source_obj>314</source_obj>
<sink_obj>317</sink_obj>
</item>
<item class_id_reference="20" object_id="_614">
<id>783</id>
<edge_type>1</edge_type>
<source_obj>133</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_615">
<id>784</id>
<edge_type>1</edge_type>
<source_obj>322</source_obj>
<sink_obj>323</sink_obj>
</item>
<item class_id_reference="20" object_id="_616">
<id>786</id>
<edge_type>1</edge_type>
<source_obj>785</source_obj>
<sink_obj>323</sink_obj>
</item>
<item class_id_reference="20" object_id="_617">
<id>787</id>
<edge_type>1</edge_type>
<source_obj>135</source_obj>
<sink_obj>327</sink_obj>
</item>
<item class_id_reference="20" object_id="_618">
<id>788</id>
<edge_type>1</edge_type>
<source_obj>327</source_obj>
<sink_obj>328</sink_obj>
</item>
<item class_id_reference="20" object_id="_619">
<id>790</id>
<edge_type>1</edge_type>
<source_obj>789</source_obj>
<sink_obj>328</sink_obj>
</item>
<item class_id_reference="20" object_id="_620">
<id>791</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>332</sink_obj>
</item>
<item class_id_reference="20" object_id="_621">
<id>792</id>
<edge_type>1</edge_type>
<source_obj>332</source_obj>
<sink_obj>333</sink_obj>
</item>
<item class_id_reference="20" object_id="_622">
<id>794</id>
<edge_type>1</edge_type>
<source_obj>793</source_obj>
<sink_obj>333</sink_obj>
</item>
<item class_id_reference="20" object_id="_623">
<id>795</id>
<edge_type>1</edge_type>
<source_obj>232</source_obj>
<sink_obj>337</sink_obj>
</item>
<item class_id_reference="20" object_id="_624">
<id>796</id>
<edge_type>1</edge_type>
<source_obj>337</source_obj>
<sink_obj>338</sink_obj>
</item>
<item class_id_reference="20" object_id="_625">
<id>798</id>
<edge_type>1</edge_type>
<source_obj>797</source_obj>
<sink_obj>338</sink_obj>
</item>
<item class_id_reference="20" object_id="_626">
<id>799</id>
<edge_type>1</edge_type>
<source_obj>338</source_obj>
<sink_obj>341</sink_obj>
</item>
<item class_id_reference="20" object_id="_627">
<id>800</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>343</sink_obj>
</item>
<item class_id_reference="20" object_id="_628">
<id>801</id>
<edge_type>1</edge_type>
<source_obj>343</source_obj>
<sink_obj>344</sink_obj>
</item>
<item class_id_reference="20" object_id="_629">
<id>803</id>
<edge_type>1</edge_type>
<source_obj>802</source_obj>
<sink_obj>344</sink_obj>
</item>
<item class_id_reference="20" object_id="_630">
<id>804</id>
<edge_type>1</edge_type>
<source_obj>344</source_obj>
<sink_obj>347</sink_obj>
</item>
<item class_id_reference="20" object_id="_631">
<id>805</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>349</sink_obj>
</item>
<item class_id_reference="20" object_id="_632">
<id>806</id>
<edge_type>1</edge_type>
<source_obj>349</source_obj>
<sink_obj>350</sink_obj>
</item>
<item class_id_reference="20" object_id="_633">
<id>808</id>
<edge_type>1</edge_type>
<source_obj>807</source_obj>
<sink_obj>350</sink_obj>
</item>
<item class_id_reference="20" object_id="_634">
<id>809</id>
<edge_type>1</edge_type>
<source_obj>143</source_obj>
<sink_obj>357</sink_obj>
</item>
<item class_id_reference="20" object_id="_635">
<id>810</id>
<edge_type>1</edge_type>
<source_obj>357</source_obj>
<sink_obj>358</sink_obj>
</item>
<item class_id_reference="20" object_id="_636">
<id>812</id>
<edge_type>1</edge_type>
<source_obj>811</source_obj>
<sink_obj>358</sink_obj>
</item>
<item class_id_reference="20" object_id="_637">
<id>813</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>362</sink_obj>
</item>
<item class_id_reference="20" object_id="_638">
<id>814</id>
<edge_type>1</edge_type>
<source_obj>362</source_obj>
<sink_obj>363</sink_obj>
</item>
<item class_id_reference="20" object_id="_639">
<id>816</id>
<edge_type>1</edge_type>
<source_obj>815</source_obj>
<sink_obj>363</sink_obj>
</item>
<item class_id_reference="20" object_id="_640">
<id>817</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>367</sink_obj>
</item>
<item class_id_reference="20" object_id="_641">
<id>818</id>
<edge_type>1</edge_type>
<source_obj>367</source_obj>
<sink_obj>368</sink_obj>
</item>
<item class_id_reference="20" object_id="_642">
<id>820</id>
<edge_type>1</edge_type>
<source_obj>819</source_obj>
<sink_obj>368</sink_obj>
</item>
<item class_id_reference="20" object_id="_643">
<id>821</id>
<edge_type>1</edge_type>
<source_obj>231</source_obj>
<sink_obj>372</sink_obj>
</item>
<item class_id_reference="20" object_id="_644">
<id>822</id>
<edge_type>1</edge_type>
<source_obj>372</source_obj>
<sink_obj>373</sink_obj>
</item>
<item class_id_reference="20" object_id="_645">
<id>824</id>
<edge_type>1</edge_type>
<source_obj>823</source_obj>
<sink_obj>373</sink_obj>
</item>
<item class_id_reference="20" object_id="_646">
<id>825</id>
<edge_type>1</edge_type>
<source_obj>148</source_obj>
<sink_obj>377</sink_obj>
</item>
<item class_id_reference="20" object_id="_647">
<id>826</id>
<edge_type>1</edge_type>
<source_obj>377</source_obj>
<sink_obj>378</sink_obj>
</item>
<item class_id_reference="20" object_id="_648">
<id>828</id>
<edge_type>1</edge_type>
<source_obj>827</source_obj>
<sink_obj>378</sink_obj>
</item>
<item class_id_reference="20" object_id="_649">
<id>829</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>382</sink_obj>
</item>
<item class_id_reference="20" object_id="_650">
<id>830</id>
<edge_type>1</edge_type>
<source_obj>382</source_obj>
<sink_obj>383</sink_obj>
</item>
<item class_id_reference="20" object_id="_651">
<id>832</id>
<edge_type>1</edge_type>
<source_obj>831</source_obj>
<sink_obj>383</sink_obj>
</item>
<item class_id_reference="20" object_id="_652">
<id>833</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>387</sink_obj>
</item>
<item class_id_reference="20" object_id="_653">
<id>834</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>388</sink_obj>
</item>
<item class_id_reference="20" object_id="_654">
<id>836</id>
<edge_type>1</edge_type>
<source_obj>835</source_obj>
<sink_obj>388</sink_obj>
</item>
<item class_id_reference="20" object_id="_655">
<id>837</id>
<edge_type>1</edge_type>
<source_obj>153</source_obj>
<sink_obj>392</sink_obj>
</item>
<item class_id_reference="20" object_id="_656">
<id>838</id>
<edge_type>1</edge_type>
<source_obj>392</source_obj>
<sink_obj>393</sink_obj>
</item>
<item class_id_reference="20" object_id="_657">
<id>840</id>
<edge_type>1</edge_type>
<source_obj>839</source_obj>
<sink_obj>393</sink_obj>
</item>
<item class_id_reference="20" object_id="_658">
<id>841</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>397</sink_obj>
</item>
<item class_id_reference="20" object_id="_659">
<id>842</id>
<edge_type>1</edge_type>
<source_obj>397</source_obj>
<sink_obj>398</sink_obj>
</item>
<item class_id_reference="20" object_id="_660">
<id>844</id>
<edge_type>1</edge_type>
<source_obj>843</source_obj>
<sink_obj>398</sink_obj>
</item>
<item class_id_reference="20" object_id="_661">
<id>845</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>402</sink_obj>
</item>
<item class_id_reference="20" object_id="_662">
<id>846</id>
<edge_type>1</edge_type>
<source_obj>402</source_obj>
<sink_obj>403</sink_obj>
</item>
<item class_id_reference="20" object_id="_663">
<id>848</id>
<edge_type>1</edge_type>
<source_obj>847</source_obj>
<sink_obj>403</sink_obj>
</item>
<item class_id_reference="20" object_id="_664">
<id>849</id>
<edge_type>1</edge_type>
<source_obj>158</source_obj>
<sink_obj>410</sink_obj>
</item>
<item class_id_reference="20" object_id="_665">
<id>850</id>
<edge_type>1</edge_type>
<source_obj>410</source_obj>
<sink_obj>411</sink_obj>
</item>
<item class_id_reference="20" object_id="_666">
<id>852</id>
<edge_type>1</edge_type>
<source_obj>851</source_obj>
<sink_obj>411</sink_obj>
</item>
<item class_id_reference="20" object_id="_667">
<id>853</id>
<edge_type>1</edge_type>
<source_obj>159</source_obj>
<sink_obj>415</sink_obj>
</item>
<item class_id_reference="20" object_id="_668">
<id>854</id>
<edge_type>1</edge_type>
<source_obj>415</source_obj>
<sink_obj>416</sink_obj>
</item>
<item class_id_reference="20" object_id="_669">
<id>856</id>
<edge_type>1</edge_type>
<source_obj>855</source_obj>
<sink_obj>416</sink_obj>
</item>
<item class_id_reference="20" object_id="_670">
<id>857</id>
<edge_type>1</edge_type>
<source_obj>163</source_obj>
<sink_obj>423</sink_obj>
</item>
<item class_id_reference="20" object_id="_671">
<id>858</id>
<edge_type>1</edge_type>
<source_obj>423</source_obj>
<sink_obj>424</sink_obj>
</item>
<item class_id_reference="20" object_id="_672">
<id>860</id>
<edge_type>1</edge_type>
<source_obj>859</source_obj>
<sink_obj>424</sink_obj>
</item>
<item class_id_reference="20" object_id="_673">
<id>861</id>
<edge_type>1</edge_type>
<source_obj>165</source_obj>
<sink_obj>428</sink_obj>
</item>
<item class_id_reference="20" object_id="_674">
<id>862</id>
<edge_type>1</edge_type>
<source_obj>428</source_obj>
<sink_obj>429</sink_obj>
</item>
<item class_id_reference="20" object_id="_675">
<id>864</id>
<edge_type>1</edge_type>
<source_obj>863</source_obj>
<sink_obj>429</sink_obj>
</item>
<item class_id_reference="20" object_id="_676">
<id>865</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>433</sink_obj>
</item>
<item class_id_reference="20" object_id="_677">
<id>866</id>
<edge_type>1</edge_type>
<source_obj>433</source_obj>
<sink_obj>434</sink_obj>
</item>
<item class_id_reference="20" object_id="_678">
<id>868</id>
<edge_type>1</edge_type>
<source_obj>867</source_obj>
<sink_obj>434</sink_obj>
</item>
<item class_id_reference="20" object_id="_679">
<id>869</id>
<edge_type>1</edge_type>
<source_obj>229</source_obj>
<sink_obj>438</sink_obj>
</item>
<item class_id_reference="20" object_id="_680">
<id>870</id>
<edge_type>1</edge_type>
<source_obj>438</source_obj>
<sink_obj>439</sink_obj>
</item>
<item class_id_reference="20" object_id="_681">
<id>872</id>
<edge_type>1</edge_type>
<source_obj>871</source_obj>
<sink_obj>439</sink_obj>
</item>
<item class_id_reference="20" object_id="_682">
<id>873</id>
<edge_type>1</edge_type>
<source_obj>168</source_obj>
<sink_obj>443</sink_obj>
</item>
<item class_id_reference="20" object_id="_683">
<id>874</id>
<edge_type>1</edge_type>
<source_obj>443</source_obj>
<sink_obj>444</sink_obj>
</item>
<item class_id_reference="20" object_id="_684">
<id>876</id>
<edge_type>1</edge_type>
<source_obj>875</source_obj>
<sink_obj>444</sink_obj>
</item>
<item class_id_reference="20" object_id="_685">
<id>877</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>448</sink_obj>
</item>
<item class_id_reference="20" object_id="_686">
<id>878</id>
<edge_type>1</edge_type>
<source_obj>448</source_obj>
<sink_obj>449</sink_obj>
</item>
<item class_id_reference="20" object_id="_687">
<id>880</id>
<edge_type>1</edge_type>
<source_obj>879</source_obj>
<sink_obj>449</sink_obj>
</item>
<item class_id_reference="20" object_id="_688">
<id>881</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>453</sink_obj>
</item>
<item class_id_reference="20" object_id="_689">
<id>882</id>
<edge_type>1</edge_type>
<source_obj>453</source_obj>
<sink_obj>454</sink_obj>
</item>
<item class_id_reference="20" object_id="_690">
<id>884</id>
<edge_type>1</edge_type>
<source_obj>883</source_obj>
<sink_obj>454</sink_obj>
</item>
<item class_id_reference="20" object_id="_691">
<id>885</id>
<edge_type>1</edge_type>
<source_obj>173</source_obj>
<sink_obj>458</sink_obj>
</item>
<item class_id_reference="20" object_id="_692">
<id>886</id>
<edge_type>1</edge_type>
<source_obj>458</source_obj>
<sink_obj>459</sink_obj>
</item>
<item class_id_reference="20" object_id="_693">
<id>888</id>
<edge_type>1</edge_type>
<source_obj>887</source_obj>
<sink_obj>459</sink_obj>
</item>
<item class_id_reference="20" object_id="_694">
<id>889</id>
<edge_type>1</edge_type>
<source_obj>175</source_obj>
<sink_obj>465</sink_obj>
</item>
<item class_id_reference="20" object_id="_695">
<id>891</id>
<edge_type>1</edge_type>
<source_obj>890</source_obj>
<sink_obj>465</sink_obj>
</item>
<item class_id_reference="20" object_id="_696">
<id>892</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>467</sink_obj>
</item>
<item class_id_reference="20" object_id="_697">
<id>893</id>
<edge_type>1</edge_type>
<source_obj>467</source_obj>
<sink_obj>468</sink_obj>
</item>
<item class_id_reference="20" object_id="_698">
<id>895</id>
<edge_type>1</edge_type>
<source_obj>894</source_obj>
<sink_obj>468</sink_obj>
</item>
<item class_id_reference="20" object_id="_699">
<id>896</id>
<edge_type>1</edge_type>
<source_obj>468</source_obj>
<sink_obj>471</sink_obj>
</item>
<item class_id_reference="20" object_id="_700">
<id>897</id>
<edge_type>1</edge_type>
<source_obj>228</source_obj>
<sink_obj>473</sink_obj>
</item>
<item class_id_reference="20" object_id="_701">
<id>898</id>
<edge_type>1</edge_type>
<source_obj>473</source_obj>
<sink_obj>474</sink_obj>
</item>
<item class_id_reference="20" object_id="_702">
<id>900</id>
<edge_type>1</edge_type>
<source_obj>899</source_obj>
<sink_obj>474</sink_obj>
</item>
<item class_id_reference="20" object_id="_703">
<id>901</id>
<edge_type>1</edge_type>
<source_obj>474</source_obj>
<sink_obj>477</sink_obj>
</item>
<item class_id_reference="20" object_id="_704">
<id>902</id>
<edge_type>1</edge_type>
<source_obj>247</source_obj>
<sink_obj>478</sink_obj>
</item>
<item class_id_reference="20" object_id="_705">
<id>903</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>478</sink_obj>
</item>
<item class_id_reference="20" object_id="_706">
<id>904</id>
<edge_type>1</edge_type>
<source_obj>237</source_obj>
<sink_obj>479</sink_obj>
</item>
<item class_id_reference="20" object_id="_707">
<id>905</id>
<edge_type>1</edge_type>
<source_obj>478</source_obj>
<sink_obj>480</sink_obj>
</item>
<item class_id_reference="20" object_id="_708">
<id>906</id>
<edge_type>1</edge_type>
<source_obj>479</source_obj>
<sink_obj>481</sink_obj>
</item>
<item class_id_reference="20" object_id="_709">
<id>907</id>
<edge_type>1</edge_type>
<source_obj>480</source_obj>
<sink_obj>481</sink_obj>
</item>
<item class_id_reference="20" object_id="_710">
<id>908</id>
<edge_type>1</edge_type>
<source_obj>265</source_obj>
<sink_obj>482</sink_obj>
</item>
<item class_id_reference="20" object_id="_711">
<id>909</id>
<edge_type>1</edge_type>
<source_obj>260</source_obj>
<sink_obj>482</sink_obj>
</item>
<item class_id_reference="20" object_id="_712">
<id>910</id>
<edge_type>1</edge_type>
<source_obj>255</source_obj>
<sink_obj>483</sink_obj>
</item>
<item class_id_reference="20" object_id="_713">
<id>911</id>
<edge_type>1</edge_type>
<source_obj>482</source_obj>
<sink_obj>484</sink_obj>
</item>
<item class_id_reference="20" object_id="_714">
<id>912</id>
<edge_type>1</edge_type>
<source_obj>483</source_obj>
<sink_obj>485</sink_obj>
</item>
<item class_id_reference="20" object_id="_715">
<id>913</id>
<edge_type>1</edge_type>
<source_obj>484</source_obj>
<sink_obj>485</sink_obj>
</item>
<item class_id_reference="20" object_id="_716">
<id>914</id>
<edge_type>1</edge_type>
<source_obj>481</source_obj>
<sink_obj>486</sink_obj>
</item>
<item class_id_reference="20" object_id="_717">
<id>915</id>
<edge_type>1</edge_type>
<source_obj>485</source_obj>
<sink_obj>486</sink_obj>
</item>
<item class_id_reference="20" object_id="_718">
<id>916</id>
<edge_type>1</edge_type>
<source_obj>284</source_obj>
<sink_obj>487</sink_obj>
</item>
<item class_id_reference="20" object_id="_719">
<id>917</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>487</sink_obj>
</item>
<item class_id_reference="20" object_id="_720">
<id>918</id>
<edge_type>1</edge_type>
<source_obj>270</source_obj>
<sink_obj>488</sink_obj>
</item>
<item class_id_reference="20" object_id="_721">
<id>919</id>
<edge_type>1</edge_type>
<source_obj>488</source_obj>
<sink_obj>489</sink_obj>
</item>
<item class_id_reference="20" object_id="_722">
<id>920</id>
<edge_type>1</edge_type>
<source_obj>487</source_obj>
<sink_obj>489</sink_obj>
</item>
<item class_id_reference="20" object_id="_723">
<id>921</id>
<edge_type>1</edge_type>
<source_obj>297</source_obj>
<sink_obj>490</sink_obj>
</item>
<item class_id_reference="20" object_id="_724">
<id>922</id>
<edge_type>1</edge_type>
<source_obj>292</source_obj>
<sink_obj>490</sink_obj>
</item>
<item class_id_reference="20" object_id="_725">
<id>923</id>
<edge_type>1</edge_type>
<source_obj>287</source_obj>
<sink_obj>491</sink_obj>
</item>
<item class_id_reference="20" object_id="_726">
<id>924</id>
<edge_type>1</edge_type>
<source_obj>490</source_obj>
<sink_obj>492</sink_obj>
</item>
<item class_id_reference="20" object_id="_727">
<id>925</id>
<edge_type>1</edge_type>
<source_obj>491</source_obj>
<sink_obj>493</sink_obj>
</item>
<item class_id_reference="20" object_id="_728">
<id>926</id>
<edge_type>1</edge_type>
<source_obj>492</source_obj>
<sink_obj>493</sink_obj>
</item>
<item class_id_reference="20" object_id="_729">
<id>927</id>
<edge_type>1</edge_type>
<source_obj>489</source_obj>
<sink_obj>494</sink_obj>
</item>
<item class_id_reference="20" object_id="_730">
<id>928</id>
<edge_type>1</edge_type>
<source_obj>493</source_obj>
<sink_obj>494</sink_obj>
</item>
<item class_id_reference="20" object_id="_731">
<id>929</id>
<edge_type>1</edge_type>
<source_obj>486</source_obj>
<sink_obj>495</sink_obj>
</item>
<item class_id_reference="20" object_id="_732">
<id>930</id>
<edge_type>1</edge_type>
<source_obj>494</source_obj>
<sink_obj>495</sink_obj>
</item>
<item class_id_reference="20" object_id="_733">
<id>931</id>
<edge_type>1</edge_type>
<source_obj>317</source_obj>
<sink_obj>496</sink_obj>
</item>
<item class_id_reference="20" object_id="_734">
<id>932</id>
<edge_type>1</edge_type>
<source_obj>311</source_obj>
<sink_obj>496</sink_obj>
</item>
<item class_id_reference="20" object_id="_735">
<id>933</id>
<edge_type>1</edge_type>
<source_obj>305</source_obj>
<sink_obj>497</sink_obj>
</item>
<item class_id_reference="20" object_id="_736">
<id>934</id>
<edge_type>1</edge_type>
<source_obj>496</source_obj>
<sink_obj>497</sink_obj>
</item>
<item class_id_reference="20" object_id="_737">
<id>935</id>
<edge_type>1</edge_type>
<source_obj>328</source_obj>
<sink_obj>498</sink_obj>
</item>
<item class_id_reference="20" object_id="_738">
<id>936</id>
<edge_type>1</edge_type>
<source_obj>323</source_obj>
<sink_obj>498</sink_obj>
</item>
<item class_id_reference="20" object_id="_739">
<id>937</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>499</sink_obj>
</item>
<item class_id_reference="20" object_id="_740">
<id>939</id>
<edge_type>1</edge_type>
<source_obj>938</source_obj>
<sink_obj>499</sink_obj>
</item>
<item class_id_reference="20" object_id="_741">
<id>940</id>
<edge_type>1</edge_type>
<source_obj>498</source_obj>
<sink_obj>500</sink_obj>
</item>
<item class_id_reference="20" object_id="_742">
<id>941</id>
<edge_type>1</edge_type>
<source_obj>499</source_obj>
<sink_obj>501</sink_obj>
</item>
<item class_id_reference="20" object_id="_743">
<id>942</id>
<edge_type>1</edge_type>
<source_obj>500</source_obj>
<sink_obj>501</sink_obj>
</item>
<item class_id_reference="20" object_id="_744">
<id>943</id>
<edge_type>1</edge_type>
<source_obj>497</source_obj>
<sink_obj>502</sink_obj>
</item>
<item class_id_reference="20" object_id="_745">
<id>944</id>
<edge_type>1</edge_type>
<source_obj>501</source_obj>
<sink_obj>502</sink_obj>
</item>
<item class_id_reference="20" object_id="_746">
<id>945</id>
<edge_type>1</edge_type>
<source_obj>347</source_obj>
<sink_obj>503</sink_obj>
</item>
<item class_id_reference="20" object_id="_747">
<id>946</id>
<edge_type>1</edge_type>
<source_obj>341</source_obj>
<sink_obj>503</sink_obj>
</item>
<item class_id_reference="20" object_id="_748">
<id>947</id>
<edge_type>1</edge_type>
<source_obj>333</source_obj>
<sink_obj>504</sink_obj>
</item>
<item class_id_reference="20" object_id="_749">
<id>948</id>
<edge_type>1</edge_type>
<source_obj>504</source_obj>
<sink_obj>505</sink_obj>
</item>
<item class_id_reference="20" object_id="_750">
<id>949</id>
<edge_type>1</edge_type>
<source_obj>503</source_obj>
<sink_obj>505</sink_obj>
</item>
<item class_id_reference="20" object_id="_751">
<id>950</id>
<edge_type>1</edge_type>
<source_obj>358</source_obj>
<sink_obj>506</sink_obj>
</item>
<item class_id_reference="20" object_id="_752">
<id>951</id>
<edge_type>1</edge_type>
<source_obj>141</source_obj>
<sink_obj>507</sink_obj>
</item>
<item class_id_reference="20" object_id="_753">
<id>953</id>
<edge_type>1</edge_type>
<source_obj>952</source_obj>
<sink_obj>507</sink_obj>
</item>
<item class_id_reference="20" object_id="_754">
<id>954</id>
<edge_type>1</edge_type>
<source_obj>350</source_obj>
<sink_obj>508</sink_obj>
</item>
<item class_id_reference="20" object_id="_755">
<id>955</id>
<edge_type>1</edge_type>
<source_obj>506</source_obj>
<sink_obj>509</sink_obj>
</item>
<item class_id_reference="20" object_id="_756">
<id>956</id>
<edge_type>1</edge_type>
<source_obj>507</source_obj>
<sink_obj>509</sink_obj>
</item>
<item class_id_reference="20" object_id="_757">
<id>957</id>
<edge_type>1</edge_type>
<source_obj>508</source_obj>
<sink_obj>510</sink_obj>
</item>
<item class_id_reference="20" object_id="_758">
<id>958</id>
<edge_type>1</edge_type>
<source_obj>509</source_obj>
<sink_obj>510</sink_obj>
</item>
<item class_id_reference="20" object_id="_759">
<id>959</id>
<edge_type>1</edge_type>
<source_obj>505</source_obj>
<sink_obj>511</sink_obj>
</item>
<item class_id_reference="20" object_id="_760">
<id>960</id>
<edge_type>1</edge_type>
<source_obj>510</source_obj>
<sink_obj>511</sink_obj>
</item>
<item class_id_reference="20" object_id="_761">
<id>961</id>
<edge_type>1</edge_type>
<source_obj>502</source_obj>
<sink_obj>512</sink_obj>
</item>
<item class_id_reference="20" object_id="_762">
<id>962</id>
<edge_type>1</edge_type>
<source_obj>511</source_obj>
<sink_obj>512</sink_obj>
</item>
<item class_id_reference="20" object_id="_763">
<id>963</id>
<edge_type>1</edge_type>
<source_obj>495</source_obj>
<sink_obj>513</sink_obj>
</item>
<item class_id_reference="20" object_id="_764">
<id>964</id>
<edge_type>1</edge_type>
<source_obj>512</source_obj>
<sink_obj>513</sink_obj>
</item>
<item class_id_reference="20" object_id="_765">
<id>965</id>
<edge_type>1</edge_type>
<source_obj>373</source_obj>
<sink_obj>514</sink_obj>
</item>
<item class_id_reference="20" object_id="_766">
<id>966</id>
<edge_type>1</edge_type>
<source_obj>368</source_obj>
<sink_obj>514</sink_obj>
</item>
<item class_id_reference="20" object_id="_767">
<id>967</id>
<edge_type>1</edge_type>
<source_obj>363</source_obj>
<sink_obj>515</sink_obj>
</item>
<item class_id_reference="20" object_id="_768">
<id>968</id>
<edge_type>1</edge_type>
<source_obj>514</source_obj>
<sink_obj>515</sink_obj>
</item>
<item class_id_reference="20" object_id="_769">
<id>969</id>
<edge_type>1</edge_type>
<source_obj>515</source_obj>
<sink_obj>516</sink_obj>
</item>
<item class_id_reference="20" object_id="_770">
<id>970</id>
<edge_type>1</edge_type>
<source_obj>388</source_obj>
<sink_obj>517</sink_obj>
</item>
<item class_id_reference="20" object_id="_771">
<id>971</id>
<edge_type>1</edge_type>
<source_obj>383</source_obj>
<sink_obj>518</sink_obj>
</item>
<item class_id_reference="20" object_id="_772">
<id>972</id>
<edge_type>1</edge_type>
<source_obj>378</source_obj>
<sink_obj>519</sink_obj>
</item>
<item class_id_reference="20" object_id="_773">
<id>973</id>
<edge_type>1</edge_type>
<source_obj>517</source_obj>
<sink_obj>520</sink_obj>
</item>
<item class_id_reference="20" object_id="_774">
<id>974</id>
<edge_type>1</edge_type>
<source_obj>518</source_obj>
<sink_obj>520</sink_obj>
</item>
<item class_id_reference="20" object_id="_775">
<id>975</id>
<edge_type>1</edge_type>
<source_obj>519</source_obj>
<sink_obj>521</sink_obj>
</item>
<item class_id_reference="20" object_id="_776">
<id>976</id>
<edge_type>1</edge_type>
<source_obj>520</source_obj>
<sink_obj>521</sink_obj>
</item>
<item class_id_reference="20" object_id="_777">
<id>977</id>
<edge_type>1</edge_type>
<source_obj>516</source_obj>
<sink_obj>522</sink_obj>
</item>
<item class_id_reference="20" object_id="_778">
<id>978</id>
<edge_type>1</edge_type>
<source_obj>521</source_obj>
<sink_obj>522</sink_obj>
</item>
<item class_id_reference="20" object_id="_779">
<id>979</id>
<edge_type>1</edge_type>
<source_obj>403</source_obj>
<sink_obj>523</sink_obj>
</item>
<item class_id_reference="20" object_id="_780">
<id>980</id>
<edge_type>1</edge_type>
<source_obj>398</source_obj>
<sink_obj>523</sink_obj>
</item>
<item class_id_reference="20" object_id="_781">
<id>981</id>
<edge_type>1</edge_type>
<source_obj>393</source_obj>
<sink_obj>524</sink_obj>
</item>
<item class_id_reference="20" object_id="_782">
<id>982</id>
<edge_type>1</edge_type>
<source_obj>523</source_obj>
<sink_obj>524</sink_obj>
</item>
<item class_id_reference="20" object_id="_783">
<id>983</id>
<edge_type>1</edge_type>
<source_obj>524</source_obj>
<sink_obj>525</sink_obj>
</item>
<item class_id_reference="20" object_id="_784">
<id>984</id>
<edge_type>1</edge_type>
<source_obj>416</source_obj>
<sink_obj>526</sink_obj>
</item>
<item class_id_reference="20" object_id="_785">
<id>985</id>
<edge_type>1</edge_type>
<source_obj>411</source_obj>
<sink_obj>526</sink_obj>
</item>
<item class_id_reference="20" object_id="_786">
<id>986</id>
<edge_type>1</edge_type>
<source_obj>230</source_obj>
<sink_obj>527</sink_obj>
</item>
<item class_id_reference="20" object_id="_787">
<id>988</id>
<edge_type>1</edge_type>
<source_obj>987</source_obj>
<sink_obj>527</sink_obj>
</item>
<item class_id_reference="20" object_id="_788">
<id>989</id>
<edge_type>1</edge_type>
<source_obj>526</source_obj>
<sink_obj>528</sink_obj>
</item>
<item class_id_reference="20" object_id="_789">
<id>990</id>
<edge_type>1</edge_type>
<source_obj>527</source_obj>
<sink_obj>529</sink_obj>
</item>
<item class_id_reference="20" object_id="_790">
<id>991</id>
<edge_type>1</edge_type>
<source_obj>528</source_obj>
<sink_obj>529</sink_obj>
</item>
<item class_id_reference="20" object_id="_791">
<id>992</id>
<edge_type>1</edge_type>
<source_obj>525</source_obj>
<sink_obj>530</sink_obj>
</item>
<item class_id_reference="20" object_id="_792">
<id>993</id>
<edge_type>1</edge_type>
<source_obj>529</source_obj>
<sink_obj>530</sink_obj>
</item>
<item class_id_reference="20" object_id="_793">
<id>994</id>
<edge_type>1</edge_type>
<source_obj>522</source_obj>
<sink_obj>531</sink_obj>
</item>
<item class_id_reference="20" object_id="_794">
<id>995</id>
<edge_type>1</edge_type>
<source_obj>530</source_obj>
<sink_obj>531</sink_obj>
</item>
<item class_id_reference="20" object_id="_795">
<id>996</id>
<edge_type>1</edge_type>
<source_obj>429</source_obj>
<sink_obj>532</sink_obj>
</item>
<item class_id_reference="20" object_id="_796">
<id>997</id>
<edge_type>1</edge_type>
<source_obj>424</source_obj>
<sink_obj>532</sink_obj>
</item>
<item class_id_reference="20" object_id="_797">
<id>998</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>533</sink_obj>
</item>
<item class_id_reference="20" object_id="_798">
<id>1000</id>
<edge_type>1</edge_type>
<source_obj>999</source_obj>
<sink_obj>533</sink_obj>
</item>
<item class_id_reference="20" object_id="_799">
<id>1001</id>
<edge_type>1</edge_type>
<source_obj>532</source_obj>
<sink_obj>534</sink_obj>
</item>
<item class_id_reference="20" object_id="_800">
<id>1002</id>
<edge_type>1</edge_type>
<source_obj>533</source_obj>
<sink_obj>535</sink_obj>
</item>
<item class_id_reference="20" object_id="_801">
<id>1003</id>
<edge_type>1</edge_type>
<source_obj>534</source_obj>
<sink_obj>535</sink_obj>
</item>
<item class_id_reference="20" object_id="_802">
<id>1004</id>
<edge_type>1</edge_type>
<source_obj>444</source_obj>
<sink_obj>536</sink_obj>
</item>
<item class_id_reference="20" object_id="_803">
<id>1005</id>
<edge_type>1</edge_type>
<source_obj>439</source_obj>
<sink_obj>537</sink_obj>
</item>
<item class_id_reference="20" object_id="_804">
<id>1006</id>
<edge_type>1</edge_type>
<source_obj>434</source_obj>
<sink_obj>538</sink_obj>
</item>
<item class_id_reference="20" object_id="_805">
<id>1007</id>
<edge_type>1</edge_type>
<source_obj>536</source_obj>
<sink_obj>539</sink_obj>
</item>
<item class_id_reference="20" object_id="_806">
<id>1008</id>
<edge_type>1</edge_type>
<source_obj>537</source_obj>
<sink_obj>539</sink_obj>
</item>
<item class_id_reference="20" object_id="_807">
<id>1009</id>
<edge_type>1</edge_type>
<source_obj>538</source_obj>
<sink_obj>540</sink_obj>
</item>
<item class_id_reference="20" object_id="_808">
<id>1010</id>
<edge_type>1</edge_type>
<source_obj>539</source_obj>
<sink_obj>540</sink_obj>
</item>
<item class_id_reference="20" object_id="_809">
<id>1011</id>
<edge_type>1</edge_type>
<source_obj>535</source_obj>
<sink_obj>541</sink_obj>
</item>
<item class_id_reference="20" object_id="_810">
<id>1012</id>
<edge_type>1</edge_type>
<source_obj>540</source_obj>
<sink_obj>541</sink_obj>
</item>
<item class_id_reference="20" object_id="_811">
<id>1013</id>
<edge_type>1</edge_type>
<source_obj>459</source_obj>
<sink_obj>542</sink_obj>
</item>
<item class_id_reference="20" object_id="_812">
<id>1014</id>
<edge_type>1</edge_type>
<source_obj>454</source_obj>
<sink_obj>542</sink_obj>
</item>
<item class_id_reference="20" object_id="_813">
<id>1015</id>
<edge_type>1</edge_type>
<source_obj>449</source_obj>
<sink_obj>543</sink_obj>
</item>
<item class_id_reference="20" object_id="_814">
<id>1016</id>
<edge_type>1</edge_type>
<source_obj>542</source_obj>
<sink_obj>544</sink_obj>
</item>
<item class_id_reference="20" object_id="_815">
<id>1017</id>
<edge_type>1</edge_type>
<source_obj>543</source_obj>
<sink_obj>545</sink_obj>
</item>
<item class_id_reference="20" object_id="_816">
<id>1018</id>
<edge_type>1</edge_type>
<source_obj>544</source_obj>
<sink_obj>545</sink_obj>
</item>
<item class_id_reference="20" object_id="_817">
<id>1019</id>
<edge_type>1</edge_type>
<source_obj>471</source_obj>
<sink_obj>546</sink_obj>
</item>
<item class_id_reference="20" object_id="_818">
<id>1020</id>
<edge_type>1</edge_type>
<source_obj>465</source_obj>
<sink_obj>546</sink_obj>
</item>
<item class_id_reference="20" object_id="_819">
<id>1021</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>547</sink_obj>
</item>
<item class_id_reference="20" object_id="_820">
<id>1022</id>
<edge_type>1</edge_type>
<source_obj>477</source_obj>
<sink_obj>547</sink_obj>
</item>
<item class_id_reference="20" object_id="_821">
<id>1023</id>
<edge_type>1</edge_type>
<source_obj>546</source_obj>
<sink_obj>548</sink_obj>
</item>
<item class_id_reference="20" object_id="_822">
<id>1024</id>
<edge_type>1</edge_type>
<source_obj>547</source_obj>
<sink_obj>548</sink_obj>
</item>
<item class_id_reference="20" object_id="_823">
<id>1025</id>
<edge_type>1</edge_type>
<source_obj>545</source_obj>
<sink_obj>549</sink_obj>
</item>
<item class_id_reference="20" object_id="_824">
<id>1026</id>
<edge_type>1</edge_type>
<source_obj>548</source_obj>
<sink_obj>549</sink_obj>
</item>
<item class_id_reference="20" object_id="_825">
<id>1027</id>
<edge_type>1</edge_type>
<source_obj>541</source_obj>
<sink_obj>550</sink_obj>
</item>
<item class_id_reference="20" object_id="_826">
<id>1028</id>
<edge_type>1</edge_type>
<source_obj>549</source_obj>
<sink_obj>550</sink_obj>
</item>
<item class_id_reference="20" object_id="_827">
<id>1029</id>
<edge_type>1</edge_type>
<source_obj>531</source_obj>
<sink_obj>551</sink_obj>
</item>
<item class_id_reference="20" object_id="_828">
<id>1030</id>
<edge_type>1</edge_type>
<source_obj>550</source_obj>
<sink_obj>551</sink_obj>
</item>
<item class_id_reference="20" object_id="_829">
<id>1031</id>
<edge_type>1</edge_type>
<source_obj>551</source_obj>
<sink_obj>552</sink_obj>
</item>
<item class_id_reference="20" object_id="_830">
<id>1032</id>
<edge_type>1</edge_type>
<source_obj>513</source_obj>
<sink_obj>552</sink_obj>
</item>
<item class_id_reference="20" object_id="_831">
<id>1035</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>553</sink_obj>
</item>
<item class_id_reference="20" object_id="_832">
<id>1036</id>
<edge_type>1</edge_type>
<source_obj>552</source_obj>
<sink_obj>553</sink_obj>
</item>
<item class_id_reference="20" object_id="_833">
<id>1037</id>
<edge_type>2</edge_type>
<source_obj>559</source_obj>
<sink_obj>554</sink_obj>
</item>
<item class_id_reference="20" object_id="_834">
<id>1038</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>557</sink_obj>
</item>
<item class_id_reference="20" object_id="_835">
<id>1040</id>
<edge_type>1</edge_type>
<source_obj>1039</source_obj>
<sink_obj>557</sink_obj>
</item>
<item class_id_reference="20" object_id="_836">
<id>1041</id>
<edge_type>2</edge_type>
<source_obj>92</source_obj>
<sink_obj>558</sink_obj>
</item>
<item class_id_reference="20" object_id="_837">
<id>1042</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_838">
<id>1044</id>
<edge_type>1</edge_type>
<source_obj>1043</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_839">
<id>1045</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_840">
<id>1046</id>
<edge_type>1</edge_type>
<source_obj>602</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_841">
<id>1047</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_842">
<id>1048</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>97</sink_obj>
</item>
<item class_id_reference="20" object_id="_843">
<id>1050</id>
<edge_type>1</edge_type>
<source_obj>1049</source_obj>
<sink_obj>97</sink_obj>
</item>
<item class_id_reference="20" object_id="_844">
<id>1051</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_845">
<id>1053</id>
<edge_type>1</edge_type>
<source_obj>1052</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_846">
<id>1054</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>99</sink_obj>
</item>
<item class_id_reference="20" object_id="_847">
<id>1055</id>
<edge_type>1</edge_type>
<source_obj>1052</source_obj>
<sink_obj>99</sink_obj>
</item>
<item class_id_reference="20" object_id="_848">
<id>1056</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_849">
<id>1057</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_850">
<id>1058</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_851">
<id>1059</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>101</sink_obj>
</item>
<item class_id_reference="20" object_id="_852">
<id>1061</id>
<edge_type>1</edge_type>
<source_obj>1060</source_obj>
<sink_obj>101</sink_obj>
</item>
<item class_id_reference="20" object_id="_853">
<id>1062</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_854">
<id>1063</id>
<edge_type>1</edge_type>
<source_obj>1060</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_855">
<id>1064</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_856">
<id>1065</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_857">
<id>1066</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_858">
<id>1067</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_859">
<id>1068</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_860">
<id>1069</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_861">
<id>1070</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>108</sink_obj>
</item>
<item class_id_reference="20" object_id="_862">
<id>1071</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>109</sink_obj>
</item>
<item class_id_reference="20" object_id="_863">
<id>1072</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_864">
<id>1073</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_865">
<id>1074</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>111</sink_obj>
</item>
<item class_id_reference="20" object_id="_866">
<id>1075</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>112</sink_obj>
</item>
<item class_id_reference="20" object_id="_867">
<id>1076</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>112</sink_obj>
</item>
<item class_id_reference="20" object_id="_868">
<id>1077</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_869">
<id>1078</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>114</sink_obj>
</item>
<item class_id_reference="20" object_id="_870">
<id>1079</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>114</sink_obj>
</item>
<item class_id_reference="20" object_id="_871">
<id>1080</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_872">
<id>1081</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>116</sink_obj>
</item>
<item class_id_reference="20" object_id="_873">
<id>1082</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>116</sink_obj>
</item>
<item class_id_reference="20" object_id="_874">
<id>1083</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_875">
<id>1084</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_876">
<id>1085</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>118</sink_obj>
</item>
<item class_id_reference="20" object_id="_877">
<id>1086</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>119</sink_obj>
</item>
<item class_id_reference="20" object_id="_878">
<id>1087</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>120</sink_obj>
</item>
<item class_id_reference="20" object_id="_879">
<id>1088</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>120</sink_obj>
</item>
<item class_id_reference="20" object_id="_880">
<id>1089</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>121</sink_obj>
</item>
<item class_id_reference="20" object_id="_881">
<id>1090</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_882">
<id>1091</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_883">
<id>1092</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>123</sink_obj>
</item>
<item class_id_reference="20" object_id="_884">
<id>1093</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_885">
<id>1094</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_886">
<id>1095</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>125</sink_obj>
</item>
<item class_id_reference="20" object_id="_887">
<id>1096</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>126</sink_obj>
</item>
<item class_id_reference="20" object_id="_888">
<id>1097</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>126</sink_obj>
</item>
<item class_id_reference="20" object_id="_889">
<id>1098</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>127</sink_obj>
</item>
<item class_id_reference="20" object_id="_890">
<id>1099</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>127</sink_obj>
</item>
<item class_id_reference="20" object_id="_891">
<id>1100</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>128</sink_obj>
</item>
<item class_id_reference="20" object_id="_892">
<id>1101</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>129</sink_obj>
</item>
<item class_id_reference="20" object_id="_893">
<id>1102</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>130</sink_obj>
</item>
<item class_id_reference="20" object_id="_894">
<id>1103</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>130</sink_obj>
</item>
<item class_id_reference="20" object_id="_895">
<id>1104</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>131</sink_obj>
</item>
<item class_id_reference="20" object_id="_896">
<id>1105</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>132</sink_obj>
</item>
<item class_id_reference="20" object_id="_897">
<id>1106</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>132</sink_obj>
</item>
<item class_id_reference="20" object_id="_898">
<id>1107</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>133</sink_obj>
</item>
<item class_id_reference="20" object_id="_899">
<id>1108</id>
<edge_type>1</edge_type>
<source_obj>133</source_obj>
<sink_obj>134</sink_obj>
</item>
<item class_id_reference="20" object_id="_900">
<id>1109</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>134</sink_obj>
</item>
<item class_id_reference="20" object_id="_901">
<id>1110</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>135</sink_obj>
</item>
<item class_id_reference="20" object_id="_902">
<id>1111</id>
<edge_type>1</edge_type>
<source_obj>135</source_obj>
<sink_obj>136</sink_obj>
</item>
<item class_id_reference="20" object_id="_903">
<id>1112</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>136</sink_obj>
</item>
<item class_id_reference="20" object_id="_904">
<id>1113</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_905">
<id>1114</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_906">
<id>1115</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>138</sink_obj>
</item>
<item class_id_reference="20" object_id="_907">
<id>1116</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>139</sink_obj>
</item>
<item class_id_reference="20" object_id="_908">
<id>1117</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>140</sink_obj>
</item>
<item class_id_reference="20" object_id="_909">
<id>1118</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>140</sink_obj>
</item>
<item class_id_reference="20" object_id="_910">
<id>1119</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>141</sink_obj>
</item>
<item class_id_reference="20" object_id="_911">
<id>1120</id>
<edge_type>1</edge_type>
<source_obj>141</source_obj>
<sink_obj>142</sink_obj>
</item>
<item class_id_reference="20" object_id="_912">
<id>1121</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>142</sink_obj>
</item>
<item class_id_reference="20" object_id="_913">
<id>1122</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>143</sink_obj>
</item>
<item class_id_reference="20" object_id="_914">
<id>1123</id>
<edge_type>1</edge_type>
<source_obj>143</source_obj>
<sink_obj>144</sink_obj>
</item>
<item class_id_reference="20" object_id="_915">
<id>1124</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>144</sink_obj>
</item>
<item class_id_reference="20" object_id="_916">
<id>1125</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>145</sink_obj>
</item>
<item class_id_reference="20" object_id="_917">
<id>1126</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>146</sink_obj>
</item>
<item class_id_reference="20" object_id="_918">
<id>1127</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>146</sink_obj>
</item>
<item class_id_reference="20" object_id="_919">
<id>1128</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>147</sink_obj>
</item>
<item class_id_reference="20" object_id="_920">
<id>1129</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>147</sink_obj>
</item>
<item class_id_reference="20" object_id="_921">
<id>1130</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>148</sink_obj>
</item>
<item class_id_reference="20" object_id="_922">
<id>1131</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>149</sink_obj>
</item>
<item class_id_reference="20" object_id="_923">
<id>1132</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>150</sink_obj>
</item>
<item class_id_reference="20" object_id="_924">
<id>1133</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>150</sink_obj>
</item>
<item class_id_reference="20" object_id="_925">
<id>1134</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>151</sink_obj>
</item>
<item class_id_reference="20" object_id="_926">
<id>1135</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>152</sink_obj>
</item>
<item class_id_reference="20" object_id="_927">
<id>1136</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>152</sink_obj>
</item>
<item class_id_reference="20" object_id="_928">
<id>1137</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>153</sink_obj>
</item>
<item class_id_reference="20" object_id="_929">
<id>1138</id>
<edge_type>1</edge_type>
<source_obj>153</source_obj>
<sink_obj>154</sink_obj>
</item>
<item class_id_reference="20" object_id="_930">
<id>1139</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>154</sink_obj>
</item>
<item class_id_reference="20" object_id="_931">
<id>1140</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>155</sink_obj>
</item>
<item class_id_reference="20" object_id="_932">
<id>1141</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>156</sink_obj>
</item>
<item class_id_reference="20" object_id="_933">
<id>1142</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>156</sink_obj>
</item>
<item class_id_reference="20" object_id="_934">
<id>1143</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>157</sink_obj>
</item>
<item class_id_reference="20" object_id="_935">
<id>1144</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>157</sink_obj>
</item>
<item class_id_reference="20" object_id="_936">
<id>1145</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>158</sink_obj>
</item>
<item class_id_reference="20" object_id="_937">
<id>1146</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>159</sink_obj>
</item>
<item class_id_reference="20" object_id="_938">
<id>1147</id>
<edge_type>1</edge_type>
<source_obj>159</source_obj>
<sink_obj>160</sink_obj>
</item>
<item class_id_reference="20" object_id="_939">
<id>1148</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>160</sink_obj>
</item>
<item class_id_reference="20" object_id="_940">
<id>1149</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>161</sink_obj>
</item>
<item class_id_reference="20" object_id="_941">
<id>1150</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>162</sink_obj>
</item>
<item class_id_reference="20" object_id="_942">
<id>1151</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>162</sink_obj>
</item>
<item class_id_reference="20" object_id="_943">
<id>1152</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>163</sink_obj>
</item>
<item class_id_reference="20" object_id="_944">
<id>1153</id>
<edge_type>1</edge_type>
<source_obj>163</source_obj>
<sink_obj>164</sink_obj>
</item>
<item class_id_reference="20" object_id="_945">
<id>1154</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>164</sink_obj>
</item>
<item class_id_reference="20" object_id="_946">
<id>1155</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>165</sink_obj>
</item>
<item class_id_reference="20" object_id="_947">
<id>1156</id>
<edge_type>1</edge_type>
<source_obj>165</source_obj>
<sink_obj>166</sink_obj>
</item>
<item class_id_reference="20" object_id="_948">
<id>1157</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>166</sink_obj>
</item>
<item class_id_reference="20" object_id="_949">
<id>1158</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>167</sink_obj>
</item>
<item class_id_reference="20" object_id="_950">
<id>1159</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>167</sink_obj>
</item>
<item class_id_reference="20" object_id="_951">
<id>1160</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>168</sink_obj>
</item>
<item class_id_reference="20" object_id="_952">
<id>1161</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>169</sink_obj>
</item>
<item class_id_reference="20" object_id="_953">
<id>1162</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>170</sink_obj>
</item>
<item class_id_reference="20" object_id="_954">
<id>1163</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>170</sink_obj>
</item>
<item class_id_reference="20" object_id="_955">
<id>1164</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>171</sink_obj>
</item>
<item class_id_reference="20" object_id="_956">
<id>1165</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>172</sink_obj>
</item>
<item class_id_reference="20" object_id="_957">
<id>1166</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>172</sink_obj>
</item>
<item class_id_reference="20" object_id="_958">
<id>1167</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>173</sink_obj>
</item>
<item class_id_reference="20" object_id="_959">
<id>1168</id>
<edge_type>1</edge_type>
<source_obj>173</source_obj>
<sink_obj>174</sink_obj>
</item>
<item class_id_reference="20" object_id="_960">
<id>1169</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>174</sink_obj>
</item>
<item class_id_reference="20" object_id="_961">
<id>1170</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>175</sink_obj>
</item>
<item class_id_reference="20" object_id="_962">
<id>1171</id>
<edge_type>1</edge_type>
<source_obj>175</source_obj>
<sink_obj>176</sink_obj>
</item>
<item class_id_reference="20" object_id="_963">
<id>1172</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>176</sink_obj>
</item>
<item class_id_reference="20" object_id="_964">
<id>1173</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>177</sink_obj>
</item>
<item class_id_reference="20" object_id="_965">
<id>1174</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>177</sink_obj>
</item>
<item class_id_reference="20" object_id="_966">
<id>1175</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>178</sink_obj>
</item>
<item class_id_reference="20" object_id="_967">
<id>1177</id>
<edge_type>1</edge_type>
<source_obj>1176</source_obj>
<sink_obj>178</sink_obj>
</item>
<item class_id_reference="20" object_id="_968">
<id>1178</id>
<edge_type>1</edge_type>
<source_obj>178</source_obj>
<sink_obj>179</sink_obj>
</item>
<item class_id_reference="20" object_id="_969">
<id>1179</id>
<edge_type>2</edge_type>
<source_obj>215</source_obj>
<sink_obj>179</sink_obj>
</item>
<item class_id_reference="20" object_id="_970">
<id>1180</id>
<edge_type>2</edge_type>
<source_obj>212</source_obj>
<sink_obj>179</sink_obj>
</item>
<item class_id_reference="20" object_id="_971">
<id>2083</id>
<edge_type>2</edge_type>
<source_obj>78</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_972">
<id>2084</id>
<edge_type>2</edge_type>
<source_obj>92</source_obj>
<sink_obj>561</sink_obj>
</item>
<item class_id_reference="20" object_id="_973">
<id>2085</id>
<edge_type>2</edge_type>
<source_obj>92</source_obj>
<sink_obj>180</sink_obj>
</item>
<item class_id_reference="20" object_id="_974">
<id>2086</id>
<edge_type>2</edge_type>
<source_obj>180</source_obj>
<sink_obj>212</sink_obj>
</item>
<item class_id_reference="20" object_id="_975">
<id>2087</id>
<edge_type>2</edge_type>
<source_obj>180</source_obj>
<sink_obj>215</sink_obj>
</item>
<item class_id_reference="20" object_id="_976">
<id>2088</id>
<edge_type>2</edge_type>
<source_obj>212</source_obj>
<sink_obj>215</sink_obj>
</item>
<item class_id_reference="20" object_id="_977">
<id>2089</id>
<edge_type>2</edge_type>
<source_obj>215</source_obj>
<sink_obj>223</sink_obj>
</item>
<item class_id_reference="20" object_id="_978">
<id>2090</id>
<edge_type>2</edge_type>
<source_obj>215</source_obj>
<sink_obj>227</sink_obj>
</item>
<item class_id_reference="20" object_id="_979">
<id>2091</id>
<edge_type>2</edge_type>
<source_obj>223</source_obj>
<sink_obj>227</sink_obj>
</item>
<item class_id_reference="20" object_id="_980">
<id>2092</id>
<edge_type>2</edge_type>
<source_obj>227</source_obj>
<sink_obj>555</sink_obj>
</item>
<item class_id_reference="20" object_id="_981">
<id>2093</id>
<edge_type>2</edge_type>
<source_obj>227</source_obj>
<sink_obj>559</sink_obj>
</item>
<item class_id_reference="20" object_id="_982">
<id>2094</id>
<edge_type>2</edge_type>
<source_obj>555</source_obj>
<sink_obj>559</sink_obj>
</item>
<item class_id_reference="20" object_id="_983">
<id>2095</id>
<edge_type>2</edge_type>
<source_obj>559</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_984">
<id>2096</id>
<edge_type>4</edge_type>
<source_obj>198</source_obj>
<sink_obj>203</sink_obj>
</item>
<item class_id_reference="20" object_id="_985">
<id>2097</id>
<edge_type>4</edge_type>
<source_obj>194</source_obj>
<sink_obj>199</sink_obj>
</item>
<item class_id_reference="20" object_id="_986">
<id>2098</id>
<edge_type>4</edge_type>
<source_obj>190</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_987">
<id>2099</id>
<edge_type>4</edge_type>
<source_obj>186</source_obj>
<sink_obj>191</sink_obj>
</item>
<item class_id_reference="20" object_id="_988">
<id>2100</id>
<edge_type>4</edge_type>
<source_obj>183</source_obj>
<sink_obj>187</sink_obj>
</item>
<item class_id_reference="20" object_id="_989">
<id>2101</id>
<edge_type>4</edge_type>
<source_obj>202</source_obj>
<sink_obj>220</sink_obj>
</item>
<item class_id_reference="20" object_id="_990">
<id>2102</id>
<edge_type>4</edge_type>
<source_obj>175</source_obj>
<sink_obj>177</sink_obj>
</item>
<item class_id_reference="20" object_id="_991">
<id>2103</id>
<edge_type>4</edge_type>
<source_obj>173</source_obj>
<sink_obj>176</sink_obj>
</item>
<item class_id_reference="20" object_id="_992">
<id>2104</id>
<edge_type>4</edge_type>
<source_obj>171</source_obj>
<sink_obj>174</sink_obj>
</item>
<item class_id_reference="20" object_id="_993">
<id>2105</id>
<edge_type>4</edge_type>
<source_obj>169</source_obj>
<sink_obj>172</sink_obj>
</item>
<item class_id_reference="20" object_id="_994">
<id>2106</id>
<edge_type>4</edge_type>
<source_obj>168</source_obj>
<sink_obj>170</sink_obj>
</item>
<item class_id_reference="20" object_id="_995">
<id>2107</id>
<edge_type>4</edge_type>
<source_obj>165</source_obj>
<sink_obj>167</sink_obj>
</item>
<item class_id_reference="20" object_id="_996">
<id>2108</id>
<edge_type>4</edge_type>
<source_obj>163</source_obj>
<sink_obj>166</sink_obj>
</item>
<item class_id_reference="20" object_id="_997">
<id>2109</id>
<edge_type>4</edge_type>
<source_obj>161</source_obj>
<sink_obj>164</sink_obj>
</item>
<item class_id_reference="20" object_id="_998">
<id>2110</id>
<edge_type>4</edge_type>
<source_obj>159</source_obj>
<sink_obj>162</sink_obj>
</item>
<item class_id_reference="20" object_id="_999">
<id>2111</id>
<edge_type>4</edge_type>
<source_obj>158</source_obj>
<sink_obj>160</sink_obj>
</item>
<item class_id_reference="20" object_id="_1000">
<id>2112</id>
<edge_type>4</edge_type>
<source_obj>155</source_obj>
<sink_obj>157</sink_obj>
</item>
<item class_id_reference="20" object_id="_1001">
<id>2113</id>
<edge_type>4</edge_type>
<source_obj>153</source_obj>
<sink_obj>156</sink_obj>
</item>
<item class_id_reference="20" object_id="_1002">
<id>2114</id>
<edge_type>4</edge_type>
<source_obj>151</source_obj>
<sink_obj>154</sink_obj>
</item>
<item class_id_reference="20" object_id="_1003">
<id>2115</id>
<edge_type>4</edge_type>
<source_obj>149</source_obj>
<sink_obj>152</sink_obj>
</item>
<item class_id_reference="20" object_id="_1004">
<id>2116</id>
<edge_type>4</edge_type>
<source_obj>148</source_obj>
<sink_obj>150</sink_obj>
</item>
<item class_id_reference="20" object_id="_1005">
<id>2117</id>
<edge_type>4</edge_type>
<source_obj>145</source_obj>
<sink_obj>147</sink_obj>
</item>
<item class_id_reference="20" object_id="_1006">
<id>2118</id>
<edge_type>4</edge_type>
<source_obj>143</source_obj>
<sink_obj>146</sink_obj>
</item>
<item class_id_reference="20" object_id="_1007">
<id>2119</id>
<edge_type>4</edge_type>
<source_obj>141</source_obj>
<sink_obj>144</sink_obj>
</item>
<item class_id_reference="20" object_id="_1008">
<id>2120</id>
<edge_type>4</edge_type>
<source_obj>139</source_obj>
<sink_obj>142</sink_obj>
</item>
<item class_id_reference="20" object_id="_1009">
<id>2121</id>
<edge_type>4</edge_type>
<source_obj>138</source_obj>
<sink_obj>140</sink_obj>
</item>
<item class_id_reference="20" object_id="_1010">
<id>2122</id>
<edge_type>4</edge_type>
<source_obj>135</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_1011">
<id>2123</id>
<edge_type>4</edge_type>
<source_obj>133</source_obj>
<sink_obj>136</sink_obj>
</item>
<item class_id_reference="20" object_id="_1012">
<id>2124</id>
<edge_type>4</edge_type>
<source_obj>131</source_obj>
<sink_obj>134</sink_obj>
</item>
<item class_id_reference="20" object_id="_1013">
<id>2125</id>
<edge_type>4</edge_type>
<source_obj>129</source_obj>
<sink_obj>132</sink_obj>
</item>
<item class_id_reference="20" object_id="_1014">
<id>2126</id>
<edge_type>4</edge_type>
<source_obj>128</source_obj>
<sink_obj>130</sink_obj>
</item>
<item class_id_reference="20" object_id="_1015">
<id>2127</id>
<edge_type>4</edge_type>
<source_obj>125</source_obj>
<sink_obj>127</sink_obj>
</item>
<item class_id_reference="20" object_id="_1016">
<id>2128</id>
<edge_type>4</edge_type>
<source_obj>123</source_obj>
<sink_obj>126</sink_obj>
</item>
<item class_id_reference="20" object_id="_1017">
<id>2129</id>
<edge_type>4</edge_type>
<source_obj>121</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_1018">
<id>2130</id>
<edge_type>4</edge_type>
<source_obj>119</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_1019">
<id>2131</id>
<edge_type>4</edge_type>
<source_obj>118</source_obj>
<sink_obj>120</sink_obj>
</item>
<item class_id_reference="20" object_id="_1020">
<id>2132</id>
<edge_type>4</edge_type>
<source_obj>115</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_1021">
<id>2133</id>
<edge_type>4</edge_type>
<source_obj>113</source_obj>
<sink_obj>116</sink_obj>
</item>
<item class_id_reference="20" object_id="_1022">
<id>2134</id>
<edge_type>4</edge_type>
<source_obj>111</source_obj>
<sink_obj>114</sink_obj>
</item>
<item class_id_reference="20" object_id="_1023">
<id>2135</id>
<edge_type>4</edge_type>
<source_obj>109</source_obj>
<sink_obj>112</sink_obj>
</item>
<item class_id_reference="20" object_id="_1024">
<id>2136</id>
<edge_type>4</edge_type>
<source_obj>108</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_1025">
<id>2137</id>
<edge_type>4</edge_type>
<source_obj>70</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_1026">
<id>2138</id>
<edge_type>4</edge_type>
<source_obj>71</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_1027">
<id>2139</id>
<edge_type>4</edge_type>
<source_obj>72</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_1028">
<id>2140</id>
<edge_type>4</edge_type>
<source_obj>73</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_1029">
<id>2141</id>
<edge_type>4</edge_type>
<source_obj>74</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_1030">
<id>2142</id>
<edge_type>4</edge_type>
<source_obj>75</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_1031">
<id>2143</id>
<edge_type>4</edge_type>
<source_obj>76</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_1032">
<id>2144</id>
<edge_type>4</edge_type>
<source_obj>63</source_obj>
<sink_obj>184</sink_obj>
</item>
<item class_id_reference="20" object_id="_1033">
<id>2145</id>
<edge_type>4</edge_type>
<source_obj>64</source_obj>
<sink_obj>188</sink_obj>
</item>
<item class_id_reference="20" object_id="_1034">
<id>2146</id>
<edge_type>4</edge_type>
<source_obj>65</source_obj>
<sink_obj>192</sink_obj>
</item>
<item class_id_reference="20" object_id="_1035">
<id>2147</id>
<edge_type>4</edge_type>
<source_obj>66</source_obj>
<sink_obj>196</sink_obj>
</item>
<item class_id_reference="20" object_id="_1036">
<id>2148</id>
<edge_type>4</edge_type>
<source_obj>67</source_obj>
<sink_obj>200</sink_obj>
</item>
<item class_id_reference="20" object_id="_1037">
<id>2149</id>
<edge_type>4</edge_type>
<source_obj>68</source_obj>
<sink_obj>204</sink_obj>
</item>
<item class_id_reference="20" object_id="_1038">
<id>2150</id>
<edge_type>4</edge_type>
<source_obj>70</source_obj>
<sink_obj>205</sink_obj>
</item>
<item class_id_reference="20" object_id="_1039">
<id>2151</id>
<edge_type>4</edge_type>
<source_obj>71</source_obj>
<sink_obj>206</sink_obj>
</item>
<item class_id_reference="20" object_id="_1040">
<id>2152</id>
<edge_type>4</edge_type>
<source_obj>72</source_obj>
<sink_obj>207</sink_obj>
</item>
<item class_id_reference="20" object_id="_1041">
<id>2153</id>
<edge_type>4</edge_type>
<source_obj>73</source_obj>
<sink_obj>208</sink_obj>
</item>
<item class_id_reference="20" object_id="_1042">
<id>2154</id>
<edge_type>4</edge_type>
<source_obj>74</source_obj>
<sink_obj>209</sink_obj>
</item>
<item class_id_reference="20" object_id="_1043">
<id>2155</id>
<edge_type>4</edge_type>
<source_obj>75</source_obj>
<sink_obj>210</sink_obj>
</item>
<item class_id_reference="20" object_id="_1044">
<id>2156</id>
<edge_type>4</edge_type>
<source_obj>69</source_obj>
<sink_obj>217</sink_obj>
</item>
<item class_id_reference="20" object_id="_1045">
<id>2157</id>
<edge_type>4</edge_type>
<source_obj>76</source_obj>
<sink_obj>221</sink_obj>
</item>
<item class_id_reference="20" object_id="_1046">
<id>2158</id>
<edge_type>4</edge_type>
<source_obj>70</source_obj>
<sink_obj>234</sink_obj>
</item>
<item class_id_reference="20" object_id="_1047">
<id>2159</id>
<edge_type>4</edge_type>
<source_obj>71</source_obj>
<sink_obj>233</sink_obj>
</item>
<item class_id_reference="20" object_id="_1048">
<id>2160</id>
<edge_type>4</edge_type>
<source_obj>72</source_obj>
<sink_obj>232</sink_obj>
</item>
<item class_id_reference="20" object_id="_1049">
<id>2161</id>
<edge_type>4</edge_type>
<source_obj>73</source_obj>
<sink_obj>231</sink_obj>
</item>
<item class_id_reference="20" object_id="_1050">
<id>2162</id>
<edge_type>4</edge_type>
<source_obj>74</source_obj>
<sink_obj>230</sink_obj>
</item>
<item class_id_reference="20" object_id="_1051">
<id>2163</id>
<edge_type>4</edge_type>
<source_obj>75</source_obj>
<sink_obj>229</sink_obj>
</item>
<item class_id_reference="20" object_id="_1052">
<id>2164</id>
<edge_type>4</edge_type>
<source_obj>76</source_obj>
<sink_obj>228</sink_obj>
</item>
<item class_id_reference="20" object_id="_1053">
<id>2165</id>
<edge_type>4</edge_type>
<source_obj>83</source_obj>
<sink_obj>210</sink_obj>
</item>
<item class_id_reference="20" object_id="_1054">
<id>2166</id>
<edge_type>4</edge_type>
<source_obj>84</source_obj>
<sink_obj>209</sink_obj>
</item>
<item class_id_reference="20" object_id="_1055">
<id>2167</id>
<edge_type>4</edge_type>
<source_obj>85</source_obj>
<sink_obj>208</sink_obj>
</item>
<item class_id_reference="20" object_id="_1056">
<id>2168</id>
<edge_type>4</edge_type>
<source_obj>86</source_obj>
<sink_obj>207</sink_obj>
</item>
<item class_id_reference="20" object_id="_1057">
<id>2169</id>
<edge_type>4</edge_type>
<source_obj>87</source_obj>
<sink_obj>206</sink_obj>
</item>
<item class_id_reference="20" object_id="_1058">
<id>2170</id>
<edge_type>4</edge_type>
<source_obj>88</source_obj>
<sink_obj>205</sink_obj>
</item>
<item class_id_reference="20" object_id="_1059">
<id>2171</id>
<edge_type>4</edge_type>
<source_obj>82</source_obj>
<sink_obj>221</sink_obj>
</item>
<item class_id_reference="20" object_id="_1060">
<id>2172</id>
<edge_type>4</edge_type>
<source_obj>205</source_obj>
<sink_obj>234</sink_obj>
</item>
<item class_id_reference="20" object_id="_1061">
<id>2173</id>
<edge_type>4</edge_type>
<source_obj>206</source_obj>
<sink_obj>233</sink_obj>
</item>
<item class_id_reference="20" object_id="_1062">
<id>2174</id>
<edge_type>4</edge_type>
<source_obj>207</source_obj>
<sink_obj>232</sink_obj>
</item>
<item class_id_reference="20" object_id="_1063">
<id>2175</id>
<edge_type>4</edge_type>
<source_obj>208</source_obj>
<sink_obj>231</sink_obj>
</item>
<item class_id_reference="20" object_id="_1064">
<id>2176</id>
<edge_type>4</edge_type>
<source_obj>209</source_obj>
<sink_obj>230</sink_obj>
</item>
<item class_id_reference="20" object_id="_1065">
<id>2177</id>
<edge_type>4</edge_type>
<source_obj>210</source_obj>
<sink_obj>229</sink_obj>
</item>
<item class_id_reference="20" object_id="_1066">
<id>2178</id>
<edge_type>4</edge_type>
<source_obj>221</source_obj>
<sink_obj>228</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="_1067">
<mId>1</mId>
<mTag>convolution_filter</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>310572</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_1068">
<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>78</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="_1069">
<mId>3</mId>
<mTag>Loop_row_Loop_col</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>8</count>
<item_version>0</item_version>
<item>92</item>
<item>180</item>
<item>212</item>
<item>215</item>
<item>223</item>
<item>227</item>
<item>555</item>
<item>559</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>310569</mMinTripCount>
<mMaxTripCount>310569</mMaxTripCount>
<mMinLatency>310570</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_1070">
<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>561</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_1071">
<states class_id="25" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_1072">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>27</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_1073">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1074">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1075">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1076">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1077">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1078">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1079">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1080">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1081">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1082">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1083">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1084">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1085">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1086">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1087">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1088">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1089">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1090">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1091">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1092">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1093">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1094">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1095">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1096">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1097">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1098">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1099">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_1100">
<id>2</id>
<operations>
<count>42</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_1101">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1102">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1103">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1104">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1105">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1106">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1107">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1108">
<id>96</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1109">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1110">
<id>98</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1111">
<id>99</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1112">
<id>100</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1113">
<id>101</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1114">
<id>102</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1115">
<id>103</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1116">
<id>104</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1117">
<id>106</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1118">
<id>178</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1119">
<id>179</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1120">
<id>181</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1121">
<id>182</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1122">
<id>183</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1123">
<id>185</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1124">
<id>186</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1125">
<id>189</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1126">
<id>190</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1127">
<id>193</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1128">
<id>194</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1129">
<id>197</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1130">
<id>198</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1131">
<id>201</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1132">
<id>202</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1133">
<id>213</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1134">
<id>214</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1135">
<id>216</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1136">
<id>217</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1137">
<id>224</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1138">
<id>225</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1139">
<id>226</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1140">
<id>556</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1141">
<id>557</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1142">
<id>558</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_1143">
<id>3</id>
<operations>
<count>36</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_1144">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1145">
<id>83</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1146">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1147">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1148">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1149">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1150">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1151">
<id>183</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1152">
<id>184</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1153">
<id>186</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1154">
<id>187</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1155">
<id>188</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1156">
<id>190</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1157">
<id>191</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1158">
<id>192</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1159">
<id>194</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1160">
<id>195</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1161">
<id>196</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1162">
<id>198</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1163">
<id>199</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1164">
<id>200</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1165">
<id>202</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_1166">
<id>203</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1167">
<id>204</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1168">
<id>205</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1169">
<id>206</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1170">
<id>207</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1171">
<id>208</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1172">
<id>209</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1173">
<id>210</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1174">
<id>211</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1175">
<id>218</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1176">
<id>219</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1177">
<id>220</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1178">
<id>221</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1179">
<id>222</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_1180">
<id>4</id>
<operations>
<count>401</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_1181">
<id>93</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1182">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1183">
<id>105</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1184">
<id>107</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1185">
<id>108</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1186">
<id>109</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1187">
<id>110</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1188">
<id>111</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1189">
<id>112</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1190">
<id>113</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1191">
<id>114</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1192">
<id>115</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1193">
<id>116</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1194">
<id>117</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1195">
<id>118</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1196">
<id>119</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1197">
<id>120</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1198">
<id>121</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1199">
<id>122</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1200">
<id>123</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1201">
<id>124</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1202">
<id>125</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1203">
<id>126</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1204">
<id>127</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1205">
<id>128</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1206">
<id>129</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1207">
<id>130</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1208">
<id>131</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1209">
<id>132</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1210">
<id>133</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1211">
<id>134</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1212">
<id>135</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1213">
<id>136</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1214">
<id>137</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1215">
<id>138</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1216">
<id>139</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1217">
<id>140</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1218">
<id>141</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1219">
<id>142</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1220">
<id>143</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1221">
<id>144</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1222">
<id>145</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1223">
<id>146</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1224">
<id>147</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1225">
<id>148</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1226">
<id>149</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1227">
<id>150</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1228">
<id>151</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1229">
<id>152</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1230">
<id>153</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1231">
<id>154</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1232">
<id>155</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1233">
<id>156</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1234">
<id>157</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1235">
<id>158</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1236">
<id>159</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1237">
<id>160</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1238">
<id>161</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1239">
<id>162</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1240">
<id>163</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1241">
<id>164</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1242">
<id>165</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1243">
<id>166</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1244">
<id>167</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1245">
<id>168</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1246">
<id>169</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1247">
<id>170</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1248">
<id>171</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1249">
<id>172</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1250">
<id>173</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1251">
<id>174</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1252">
<id>175</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1253">
<id>176</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1254">
<id>177</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1255">
<id>228</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1256">
<id>229</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1257">
<id>230</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1258">
<id>231</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1259">
<id>232</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1260">
<id>233</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1261">
<id>234</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1262">
<id>235</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1263">
<id>236</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1264">
<id>237</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1265">
<id>238</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1266">
<id>239</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1267">
<id>240</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1268">
<id>241</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1269">
<id>242</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1270">
<id>243</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1271">
<id>244</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1272">
<id>245</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1273">
<id>246</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1274">
<id>247</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1275">
<id>248</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1276">
<id>249</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1277">
<id>250</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1278">
<id>251</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1279">
<id>252</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1280">
<id>253</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1281">
<id>254</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1282">
<id>255</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1283">
<id>256</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1284">
<id>257</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1285">
<id>258</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1286">
<id>259</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1287">
<id>260</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1288">
<id>261</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1289">
<id>262</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1290">
<id>263</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1291">
<id>264</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1292">
<id>265</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1293">
<id>266</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1294">
<id>267</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1295">
<id>268</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1296">
<id>269</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1297">
<id>270</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1298">
<id>271</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1299">
<id>272</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1300">
<id>273</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1301">
<id>274</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1302">
<id>275</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1303">
<id>276</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1304">
<id>277</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1305">
<id>278</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1306">
<id>279</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1307">
<id>280</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1308">
<id>281</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1309">
<id>282</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1310">
<id>283</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1311">
<id>284</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1312">
<id>285</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1313">
<id>286</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1314">
<id>287</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1315">
<id>288</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1316">
<id>289</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1317">
<id>290</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1318">
<id>291</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1319">
<id>292</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1320">
<id>293</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1321">
<id>294</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1322">
<id>295</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1323">
<id>296</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1324">
<id>297</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1325">
<id>298</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1326">
<id>299</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1327">
<id>300</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1328">
<id>301</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1329">
<id>302</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1330">
<id>303</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1331">
<id>304</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1332">
<id>305</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1333">
<id>306</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1334">
<id>307</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1335">
<id>308</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1336">
<id>309</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1337">
<id>310</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1338">
<id>311</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1339">
<id>312</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1340">
<id>313</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1341">
<id>314</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1342">
<id>315</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1343">
<id>316</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1344">
<id>317</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1345">
<id>318</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1346">
<id>319</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1347">
<id>320</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1348">
<id>321</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1349">
<id>322</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1350">
<id>323</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1351">
<id>324</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1352">
<id>325</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1353">
<id>326</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1354">
<id>327</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1355">
<id>328</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1356">
<id>329</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1357">
<id>330</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1358">
<id>331</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1359">
<id>332</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1360">
<id>333</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1361">
<id>334</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1362">
<id>335</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1363">
<id>336</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1364">
<id>337</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1365">
<id>338</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1366">
<id>339</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1367">
<id>340</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1368">
<id>341</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1369">
<id>342</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1370">
<id>343</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1371">
<id>344</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1372">
<id>345</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1373">
<id>346</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1374">
<id>347</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1375">
<id>348</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1376">
<id>349</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1377">
<id>350</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1378">
<id>351</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1379">
<id>352</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1380">
<id>353</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1381">
<id>354</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1382">
<id>355</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1383">
<id>356</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1384">
<id>357</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1385">
<id>358</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1386">
<id>359</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1387">
<id>360</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1388">
<id>361</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1389">
<id>362</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1390">
<id>363</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1391">
<id>364</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1392">
<id>365</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1393">
<id>366</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1394">
<id>367</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1395">
<id>368</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1396">
<id>369</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1397">
<id>370</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1398">
<id>371</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1399">
<id>372</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1400">
<id>373</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1401">
<id>374</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1402">
<id>375</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1403">
<id>376</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1404">
<id>377</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1405">
<id>378</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1406">
<id>379</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1407">
<id>380</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1408">
<id>381</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1409">
<id>382</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1410">
<id>383</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1411">
<id>384</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1412">
<id>385</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1413">
<id>386</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1414">
<id>387</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1415">
<id>388</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1416">
<id>389</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1417">
<id>390</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1418">
<id>391</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1419">
<id>392</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1420">
<id>393</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1421">
<id>394</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1422">
<id>395</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1423">
<id>396</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1424">
<id>397</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1425">
<id>398</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1426">
<id>399</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1427">
<id>400</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1428">
<id>401</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1429">
<id>402</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1430">
<id>403</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1431">
<id>404</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1432">
<id>405</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1433">
<id>406</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1434">
<id>407</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1435">
<id>408</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1436">
<id>409</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1437">
<id>410</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1438">
<id>411</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1439">
<id>412</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1440">
<id>413</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1441">
<id>414</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1442">
<id>415</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1443">
<id>416</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1444">
<id>417</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1445">
<id>418</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1446">
<id>419</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1447">
<id>420</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1448">
<id>421</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1449">
<id>422</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1450">
<id>423</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1451">
<id>424</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1452">
<id>425</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1453">
<id>426</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1454">
<id>427</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1455">
<id>428</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1456">
<id>429</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1457">
<id>430</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1458">
<id>431</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1459">
<id>432</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1460">
<id>433</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1461">
<id>434</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1462">
<id>435</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1463">
<id>436</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1464">
<id>437</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1465">
<id>438</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1466">
<id>439</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1467">
<id>440</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1468">
<id>441</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1469">
<id>442</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1470">
<id>443</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1471">
<id>444</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1472">
<id>445</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1473">
<id>446</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1474">
<id>447</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1475">
<id>448</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1476">
<id>449</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1477">
<id>450</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1478">
<id>451</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1479">
<id>452</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1480">
<id>453</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1481">
<id>454</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1482">
<id>455</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1483">
<id>456</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1484">
<id>457</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1485">
<id>458</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1486">
<id>459</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1487">
<id>460</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1488">
<id>461</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1489">
<id>462</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1490">
<id>463</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1491">
<id>464</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1492">
<id>465</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1493">
<id>466</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1494">
<id>467</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1495">
<id>468</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1496">
<id>469</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1497">
<id>470</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1498">
<id>471</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1499">
<id>472</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1500">
<id>473</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1501">
<id>474</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1502">
<id>475</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1503">
<id>476</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1504">
<id>477</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1505">
<id>478</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1506">
<id>479</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1507">
<id>480</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1508">
<id>481</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1509">
<id>482</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1510">
<id>483</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1511">
<id>484</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1512">
<id>485</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1513">
<id>486</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1514">
<id>487</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1515">
<id>488</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1516">
<id>489</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1517">
<id>490</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1518">
<id>491</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1519">
<id>492</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1520">
<id>493</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1521">
<id>494</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1522">
<id>495</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1523">
<id>496</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1524">
<id>497</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1525">
<id>498</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1526">
<id>499</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1527">
<id>500</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1528">
<id>501</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1529">
<id>502</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1530">
<id>503</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1531">
<id>504</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1532">
<id>505</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1533">
<id>506</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1534">
<id>507</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1535">
<id>508</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1536">
<id>509</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1537">
<id>510</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1538">
<id>511</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1539">
<id>512</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1540">
<id>513</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1541">
<id>514</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1542">
<id>515</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1543">
<id>516</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1544">
<id>517</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1545">
<id>518</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1546">
<id>519</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1547">
<id>520</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1548">
<id>521</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1549">
<id>522</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1550">
<id>523</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1551">
<id>524</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1552">
<id>525</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1553">
<id>526</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1554">
<id>527</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1555">
<id>528</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1556">
<id>529</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1557">
<id>530</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1558">
<id>531</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1559">
<id>532</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1560">
<id>533</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1561">
<id>534</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1562">
<id>535</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1563">
<id>536</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1564">
<id>537</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1565">
<id>538</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1566">
<id>539</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1567">
<id>540</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1568">
<id>541</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1569">
<id>542</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1570">
<id>543</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1571">
<id>544</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1572">
<id>545</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1573">
<id>546</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1574">
<id>547</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1575">
<id>548</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1576">
<id>549</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1577">
<id>550</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1578">
<id>551</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1579">
<id>552</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1580">
<id>553</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_1581">
<id>554</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_1582">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_1583">
<id>560</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_1584">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>56</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="_1585">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>69</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="_1586">
<inState>4</inState>
<outState>2</outState>
<condition>
<id>71</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="_1587">
<inState>3</inState>
<outState>5</outState>
<condition>
<id>70</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>89</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_1588">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>72</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>89</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="37" tracking_level="0" version="0">
<count>343</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>51</first>
<second class_id="39" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>120</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>121</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>126</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>127</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>128</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>129</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>130</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>131</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>132</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>133</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>134</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>135</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>136</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>137</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>138</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>139</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>140</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>141</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>142</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>143</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>144</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>145</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>146</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>147</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>148</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>149</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>150</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>151</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>152</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>153</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>154</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>155</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>156</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>157</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>158</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>159</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>160</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>161</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>162</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>163</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>164</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>165</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>166</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>167</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>168</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>169</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>170</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>171</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>172</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>173</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>174</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>175</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>176</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>177</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>178</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>179</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>181</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>182</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>183</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>184</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>185</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>186</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>187</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>188</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>189</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>190</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>191</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>192</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>193</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>194</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>195</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>196</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>197</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>198</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>199</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>200</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>201</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>202</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>203</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>204</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>205</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>206</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>207</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>208</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>209</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>210</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>211</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>213</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>214</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>216</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>217</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>218</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>219</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>220</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>221</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>222</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>224</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>225</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>226</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>228</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>229</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>230</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>231</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>232</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>233</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>234</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>236</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>237</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>241</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>242</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>246</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>247</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>254</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>255</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>259</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>260</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>264</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>265</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>269</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>270</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>274</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>275</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>278</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>280</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>281</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>284</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>286</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>287</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>291</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>292</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>296</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>297</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>301</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>302</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>305</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>307</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>308</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>311</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>313</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>314</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>317</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>322</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>323</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>327</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>328</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>332</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>333</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>337</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>338</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>341</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>343</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>344</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>347</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>349</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>350</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>357</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>358</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>362</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>363</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>367</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>368</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>372</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>373</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>377</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>378</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>382</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>383</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>387</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>388</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>392</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>393</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>397</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>398</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>402</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>403</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>410</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>411</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>415</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>416</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>423</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>424</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>428</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>429</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>433</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>434</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>438</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>439</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>443</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>444</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>448</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>449</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>453</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>454</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>458</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>459</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>465</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>467</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>468</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>471</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>473</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>474</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>477</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>478</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>479</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>480</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>481</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>482</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>483</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>484</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>485</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>486</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>487</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>488</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>489</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>490</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>491</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>492</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>493</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>494</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>495</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>496</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>497</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>498</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>499</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>500</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>501</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>502</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>503</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>504</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>505</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>506</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>507</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>508</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>509</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>510</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>511</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>512</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>513</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>514</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>515</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>516</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>517</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>518</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>519</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>520</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>521</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>522</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>523</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>524</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>525</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>526</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>527</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>528</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>529</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>530</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>531</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>532</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>533</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>534</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>535</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>536</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>537</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>538</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>539</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>540</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>541</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>542</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>543</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>544</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>545</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>546</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>547</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>548</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>549</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>550</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>551</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>552</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>553</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>554</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>557</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>558</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>560</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>78</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>180</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>212</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>215</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>223</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>227</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>555</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>559</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>561</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="43" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="1" version="0" object_id="_1589">
<region_name>Loop_row_Loop_col</region_name>
<basic_blocks>
<count>8</count>
<item_version>0</item_version>
<item>92</item>
<item>180</item>
<item>212</item>
<item>215</item>
<item>223</item>
<item>227</item>
<item>555</item>
<item>559</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>3</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="45" tracking_level="0" version="0">
<count>327</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>274</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>278</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>286</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>290</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>216</item>
</second>
</item>
<item>
<first>300</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>553</item>
</second>
</item>
<item>
<first>307</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>182</item>
</second>
</item>
<item>
<first>314</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>183</item>
<item>183</item>
<item>187</item>
</second>
</item>
<item>
<first>319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>185</item>
</second>
</item>
<item>
<first>326</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>186</item>
<item>186</item>
<item>191</item>
</second>
</item>
<item>
<first>331</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>189</item>
</second>
</item>
<item>
<first>338</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>190</item>
<item>190</item>
<item>195</item>
</second>
</item>
<item>
<first>343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>193</item>
</second>
</item>
<item>
<first>350</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>194</item>
<item>194</item>
<item>199</item>
</second>
</item>
<item>
<first>355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>197</item>
</second>
</item>
<item>
<first>362</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>198</item>
<item>198</item>
<item>203</item>
</second>
</item>
<item>
<first>367</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>201</item>
</second>
</item>
<item>
<first>374</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>202</item>
<item>202</item>
<item>220</item>
</second>
</item>
<item>
<first>399</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>219</item>
</second>
</item>
<item>
<first>414</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>425</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>436</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>443</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>447</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>451</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>455</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>459</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>463</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>467</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>471</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>476</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>481</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>486</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>491</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>496</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>501</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>512</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>518</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>524</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>532</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</second>
</item>
<item>
<first>538</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</second>
</item>
<item>
<first>544</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>550</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>558</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>564</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</second>
</item>
<item>
<first>570</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>578</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>586</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</second>
</item>
<item>
<first>592</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>181</item>
</second>
</item>
<item>
<first>602</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>213</item>
</second>
</item>
<item>
<first>608</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>217</item>
</second>
</item>
<item>
<first>614</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>224</item>
</second>
</item>
<item>
<first>620</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>225</item>
</second>
</item>
<item>
<first>626</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>557</item>
</second>
</item>
<item>
<first>632</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>635</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>638</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>641</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>644</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>647</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>650</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>653</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>184</item>
</second>
</item>
<item>
<first>659</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>188</item>
</second>
</item>
<item>
<first>665</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>192</item>
</second>
</item>
<item>
<first>671</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>196</item>
</second>
</item>
<item>
<first>677</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>200</item>
</second>
</item>
<item>
<first>683</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>204</item>
</second>
</item>
<item>
<first>689</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>205</item>
</second>
</item>
<item>
<first>694</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>206</item>
</second>
</item>
<item>
<first>699</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>207</item>
</second>
</item>
<item>
<first>704</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>208</item>
</second>
</item>
<item>
<first>709</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>209</item>
</second>
</item>
<item>
<first>714</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>210</item>
</second>
</item>
<item>
<first>719</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>218</item>
</second>
</item>
<item>
<first>723</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>221</item>
</second>
</item>
<item>
<first>727</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>731</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</second>
</item>
<item>
<first>735</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>741</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>745</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>112</item>
</second>
</item>
<item>
<first>751</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>755</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>761</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>765</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</second>
</item>
<item>
<first>771</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</second>
</item>
<item>
<first>776</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</second>
</item>
<item>
<first>780</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>119</item>
</second>
</item>
<item>
<first>784</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>120</item>
</second>
</item>
<item>
<first>790</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>121</item>
</second>
</item>
<item>
<first>794</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>122</item>
</second>
</item>
<item>
<first>800</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>804</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>810</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</second>
</item>
<item>
<first>814</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>126</item>
</second>
</item>
<item>
<first>820</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>127</item>
</second>
</item>
<item>
<first>825</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</second>
</item>
<item>
<first>829</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>833</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</second>
</item>
<item>
<first>839</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</second>
</item>
<item>
<first>843</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>849</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</second>
</item>
<item>
<first>853</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</second>
</item>
<item>
<first>859</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>863</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</second>
</item>
<item>
<first>869</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>137</item>
</second>
</item>
<item>
<first>874</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>138</item>
</second>
</item>
<item>
<first>878</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>139</item>
</second>
</item>
<item>
<first>882</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</second>
</item>
<item>
<first>888</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>141</item>
</second>
</item>
<item>
<first>892</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>142</item>
</second>
</item>
<item>
<first>898</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>143</item>
</second>
</item>
<item>
<first>902</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
<item>
<first>908</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>145</item>
</second>
</item>
<item>
<first>912</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>146</item>
</second>
</item>
<item>
<first>918</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>147</item>
</second>
</item>
<item>
<first>923</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</second>
</item>
<item>
<first>927</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>149</item>
</second>
</item>
<item>
<first>931</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>150</item>
</second>
</item>
<item>
<first>937</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>151</item>
</second>
</item>
<item>
<first>941</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>152</item>
</second>
</item>
<item>
<first>947</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>153</item>
</second>
</item>
<item>
<first>951</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</second>
</item>
<item>
<first>957</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>155</item>
</second>
</item>
<item>
<first>961</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>156</item>
</second>
</item>
<item>
<first>967</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>157</item>
</second>
</item>
<item>
<first>972</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>158</item>
</second>
</item>
<item>
<first>976</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</second>
</item>
<item>
<first>980</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>160</item>
</second>
</item>
<item>
<first>986</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>161</item>
</second>
</item>
<item>
<first>990</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>162</item>
</second>
</item>
<item>
<first>996</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>163</item>
</second>
</item>
<item>
<first>1000</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>164</item>
</second>
</item>
<item>
<first>1006</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</second>
</item>
<item>
<first>1010</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>166</item>
</second>
</item>
<item>
<first>1016</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>167</item>
</second>
</item>
<item>
<first>1021</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>168</item>
</second>
</item>
<item>
<first>1025</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>169</item>
</second>
</item>
<item>
<first>1029</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>170</item>
</second>
</item>
<item>
<first>1035</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>171</item>
</second>
</item>
<item>
<first>1039</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>172</item>
</second>
</item>
<item>
<first>1045</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>173</item>
</second>
</item>
<item>
<first>1049</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>174</item>
</second>
</item>
<item>
<first>1055</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>175</item>
</second>
</item>
<item>
<first>1059</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>176</item>
</second>
</item>
<item>
<first>1065</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>177</item>
</second>
</item>
<item>
<first>1070</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>228</item>
</second>
</item>
<item>
<first>1073</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>229</item>
</second>
</item>
<item>
<first>1076</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>230</item>
</second>
</item>
<item>
<first>1079</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>231</item>
</second>
</item>
<item>
<first>1082</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>232</item>
</second>
</item>
<item>
<first>1085</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>233</item>
</second>
</item>
<item>
<first>1088</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>234</item>
</second>
</item>
<item>
<first>1091</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>236</item>
</second>
</item>
<item>
<first>1095</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>237</item>
</second>
</item>
<item>
<first>1101</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>241</item>
</second>
</item>
<item>
<first>1105</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>242</item>
</second>
</item>
<item>
<first>1111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>246</item>
</second>
</item>
<item>
<first>1115</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>247</item>
</second>
</item>
<item>
<first>1121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>254</item>
</second>
</item>
<item>
<first>1125</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>255</item>
</second>
</item>
<item>
<first>1131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>259</item>
</second>
</item>
<item>
<first>1134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>260</item>
</second>
</item>
<item>
<first>1140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>264</item>
</second>
</item>
<item>
<first>1144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>265</item>
</second>
</item>
<item>
<first>1150</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>269</item>
</second>
</item>
<item>
<first>1154</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>270</item>
</second>
</item>
<item>
<first>1160</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>274</item>
</second>
</item>
<item>
<first>1164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>275</item>
</second>
</item>
<item>
<first>1170</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>278</item>
</second>
</item>
<item>
<first>1174</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>280</item>
</second>
</item>
<item>
<first>1178</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>281</item>
</second>
</item>
<item>
<first>1184</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>284</item>
</second>
</item>
<item>
<first>1188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>286</item>
</second>
</item>
<item>
<first>1192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>287</item>
</second>
</item>
<item>
<first>1198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>291</item>
</second>
</item>
<item>
<first>1202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>292</item>
</second>
</item>
<item>
<first>1208</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>296</item>
</second>
</item>
<item>
<first>1211</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>297</item>
</second>
</item>
<item>
<first>1217</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>301</item>
</second>
</item>
<item>
<first>1221</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>302</item>
</second>
</item>
<item>
<first>1227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>305</item>
</second>
</item>
<item>
<first>1231</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>307</item>
</second>
</item>
<item>
<first>1235</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>308</item>
</second>
</item>
<item>
<first>1241</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>311</item>
</second>
</item>
<item>
<first>1245</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>313</item>
</second>
</item>
<item>
<first>1249</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>314</item>
</second>
</item>
<item>
<first>1255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>317</item>
</second>
</item>
<item>
<first>1259</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>322</item>
</second>
</item>
<item>
<first>1263</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>323</item>
</second>
</item>
<item>
<first>1269</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>327</item>
</second>
</item>
<item>
<first>1273</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>328</item>
</second>
</item>
<item>
<first>1279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>332</item>
</second>
</item>
<item>
<first>1282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>333</item>
</second>
</item>
<item>
<first>1288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>337</item>
</second>
</item>
<item>
<first>1292</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>338</item>
</second>
</item>
<item>
<first>1298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>341</item>
</second>
</item>
<item>
<first>1302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>343</item>
</second>
</item>
<item>
<first>1306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>344</item>
</second>
</item>
<item>
<first>1312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>347</item>
</second>
</item>
<item>
<first>1316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>349</item>
</second>
</item>
<item>
<first>1320</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>350</item>
</second>
</item>
<item>
<first>1326</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>357</item>
</second>
</item>
<item>
<first>1330</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>358</item>
</second>
</item>
<item>
<first>1336</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>362</item>
</second>
</item>
<item>
<first>1340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>363</item>
</second>
</item>
<item>
<first>1346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>367</item>
</second>
</item>
<item>
<first>1349</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>368</item>
</second>
</item>
<item>
<first>1355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>372</item>
</second>
</item>
<item>
<first>1359</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>373</item>
</second>
</item>
<item>
<first>1365</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>377</item>
</second>
</item>
<item>
<first>1369</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>378</item>
</second>
</item>
<item>
<first>1375</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>382</item>
</second>
</item>
<item>
<first>1379</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>383</item>
</second>
</item>
<item>
<first>1385</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>387</item>
</second>
</item>
<item>
<first>1389</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>388</item>
</second>
</item>
<item>
<first>1395</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>392</item>
</second>
</item>
<item>
<first>1399</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>393</item>
</second>
</item>
<item>
<first>1405</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>397</item>
</second>
</item>
<item>
<first>1409</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>398</item>
</second>
</item>
<item>
<first>1415</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>402</item>
</second>
</item>
<item>
<first>1418</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>403</item>
</second>
</item>
<item>
<first>1424</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>410</item>
</second>
</item>
<item>
<first>1428</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>411</item>
</second>
</item>
<item>
<first>1434</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>415</item>
</second>
</item>
<item>
<first>1438</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>416</item>
</second>
</item>
<item>
<first>1444</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>423</item>
</second>
</item>
<item>
<first>1448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>424</item>
</second>
</item>
<item>
<first>1454</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>428</item>
</second>
</item>
<item>
<first>1458</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>429</item>
</second>
</item>
<item>
<first>1464</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>433</item>
</second>
</item>
<item>
<first>1467</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>434</item>
</second>
</item>
<item>
<first>1473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>438</item>
</second>
</item>
<item>
<first>1477</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>439</item>
</second>
</item>
<item>
<first>1483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>443</item>
</second>
</item>
<item>
<first>1487</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>444</item>
</second>
</item>
<item>
<first>1493</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>448</item>
</second>
</item>
<item>
<first>1497</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>449</item>
</second>
</item>
<item>
<first>1503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>453</item>
</second>
</item>
<item>
<first>1507</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>454</item>
</second>
</item>
<item>
<first>1513</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>458</item>
</second>
</item>
<item>
<first>1517</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>459</item>
</second>
</item>
<item>
<first>1523</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>465</item>
</second>
</item>
<item>
<first>1529</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>467</item>
</second>
</item>
<item>
<first>1532</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>468</item>
</second>
</item>
<item>
<first>1538</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>471</item>
</second>
</item>
<item>
<first>1542</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>473</item>
</second>
</item>
<item>
<first>1546</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>474</item>
</second>
</item>
<item>
<first>1552</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>477</item>
</second>
</item>
<item>
<first>1556</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>478</item>
</second>
</item>
<item>
<first>1562</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>479</item>
</second>
</item>
<item>
<first>1566</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>480</item>
</second>
</item>
<item>
<first>1570</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>481</item>
</second>
</item>
<item>
<first>1576</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>482</item>
</second>
</item>
<item>
<first>1582</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>483</item>
</second>
</item>
<item>
<first>1586</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>484</item>
</second>
</item>
<item>
<first>1590</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>485</item>
</second>
</item>
<item>
<first>1596</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>486</item>
</second>
</item>
<item>
<first>1602</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>487</item>
</second>
</item>
<item>
<first>1608</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>488</item>
</second>
</item>
<item>
<first>1612</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>489</item>
</second>
</item>
<item>
<first>1618</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>490</item>
</second>
</item>
<item>
<first>1624</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>491</item>
</second>
</item>
<item>
<first>1628</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>492</item>
</second>
</item>
<item>
<first>1632</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>493</item>
</second>
</item>
<item>
<first>1638</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>494</item>
</second>
</item>
<item>
<first>1644</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>495</item>
</second>
</item>
<item>
<first>1650</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>496</item>
</second>
</item>
<item>
<first>1656</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>497</item>
</second>
</item>
<item>
<first>1662</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>498</item>
</second>
</item>
<item>
<first>1668</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>499</item>
</second>
</item>
<item>
<first>1674</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>500</item>
</second>
</item>
<item>
<first>1678</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>501</item>
</second>
</item>
<item>
<first>1684</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>502</item>
</second>
</item>
<item>
<first>1690</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>503</item>
</second>
</item>
<item>
<first>1696</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>504</item>
</second>
</item>
<item>
<first>1700</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>505</item>
</second>
</item>
<item>
<first>1706</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>506</item>
</second>
</item>
<item>
<first>1710</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>507</item>
</second>
</item>
<item>
<first>1716</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>508</item>
</second>
</item>
<item>
<first>1720</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>509</item>
</second>
</item>
<item>
<first>1726</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>510</item>
</second>
</item>
<item>
<first>1732</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>511</item>
</second>
</item>
<item>
<first>1738</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>512</item>
</second>
</item>
<item>
<first>1744</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>513</item>
</second>
</item>
<item>
<first>1750</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>514</item>
</second>
</item>
<item>
<first>1756</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>515</item>
</second>
</item>
<item>
<first>1762</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>516</item>
</second>
</item>
<item>
<first>1766</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>517</item>
</second>
</item>
<item>
<first>1770</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>518</item>
</second>
</item>
<item>
<first>1774</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>519</item>
</second>
</item>
<item>
<first>1778</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>520</item>
</second>
</item>
<item>
<first>1784</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>521</item>
</second>
</item>
<item>
<first>1790</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>522</item>
</second>
</item>
<item>
<first>1796</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>523</item>
</second>
</item>
<item>
<first>1802</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>524</item>
</second>
</item>
<item>
<first>1808</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>525</item>
</second>
</item>
<item>
<first>1812</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>526</item>
</second>
</item>
<item>
<first>1818</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>527</item>
</second>
</item>
<item>
<first>1824</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>528</item>
</second>
</item>
<item>
<first>1828</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>529</item>
</second>
</item>
<item>
<first>1834</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>530</item>
</second>
</item>
<item>
<first>1840</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>531</item>
</second>
</item>
<item>
<first>1846</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>532</item>
</second>
</item>
<item>
<first>1852</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>533</item>
</second>
</item>
<item>
<first>1858</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>534</item>
</second>
</item>
<item>
<first>1862</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>535</item>
</second>
</item>
<item>
<first>1868</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>536</item>
</second>
</item>
<item>
<first>1872</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>537</item>
</second>
</item>
<item>
<first>1876</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>538</item>
</second>
</item>
<item>
<first>1880</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>539</item>
</second>
</item>
<item>
<first>1886</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>540</item>
</second>
</item>
<item>
<first>1892</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>541</item>
</second>
</item>
<item>
<first>1898</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>542</item>
</second>
</item>
<item>
<first>1904</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>543</item>
</second>
</item>
<item>
<first>1908</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>544</item>
</second>
</item>
<item>
<first>1912</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>545</item>
</second>
</item>
<item>
<first>1918</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>546</item>
</second>
</item>
<item>
<first>1924</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>547</item>
</second>
</item>
<item>
<first>1930</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>548</item>
</second>
</item>
<item>
<first>1936</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>549</item>
</second>
</item>
<item>
<first>1942</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>550</item>
</second>
</item>
<item>
<first>1948</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>551</item>
</second>
</item>
<item>
<first>1954</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>552</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="48" tracking_level="0" version="0">
<count>207</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>col_1_fu_626</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>557</item>
</second>
</item>
<item>
<first>col_mid2_fu_524</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>col_phi_fu_436</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>exitcond_fu_518</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>in_temp_V_1_fu_266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_512</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_414</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>lhs_V_0_1_cast_fu_1101</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>241</item>
</second>
</item>
<item>
<first>lhs_V_0_2_cast_fu_1111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>246</item>
</second>
</item>
<item>
<first>lhs_V_0_4_cast_fu_1121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>254</item>
</second>
</item>
<item>
<first>lhs_V_0_5_cast_fu_1131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>259</item>
</second>
</item>
<item>
<first>lhs_V_0_6_cast_fu_1140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>264</item>
</second>
</item>
<item>
<first>lhs_V_1_1_cast_fu_1160</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>274</item>
</second>
</item>
<item>
<first>lhs_V_1_2_cast_fu_1174</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>280</item>
</second>
</item>
<item>
<first>lhs_V_1_3_cast_fu_1188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>286</item>
</second>
</item>
<item>
<first>lhs_V_1_4_cast_fu_1198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>291</item>
</second>
</item>
<item>
<first>lhs_V_1_5_cast_fu_1208</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>296</item>
</second>
</item>
<item>
<first>lhs_V_1_6_cast_fu_1217</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>301</item>
</second>
</item>
<item>
<first>lhs_V_1_cast_fu_1150</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>269</item>
</second>
</item>
<item>
<first>lhs_V_2_1_cast_fu_1245</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>313</item>
</second>
</item>
<item>
<first>lhs_V_2_3_cast_fu_1259</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>322</item>
</second>
</item>
<item>
<first>lhs_V_2_4_cast_fu_1269</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>327</item>
</second>
</item>
<item>
<first>lhs_V_2_5_cast_fu_1279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>332</item>
</second>
</item>
<item>
<first>lhs_V_2_6_cast_fu_1288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>337</item>
</second>
</item>
<item>
<first>lhs_V_2_cast_fu_1231</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>307</item>
</second>
</item>
<item>
<first>lhs_V_3_1_cast_fu_1316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>349</item>
</second>
</item>
<item>
<first>lhs_V_3_3_cast_fu_1326</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>357</item>
</second>
</item>
<item>
<first>lhs_V_3_4_cast_fu_1336</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>362</item>
</second>
</item>
<item>
<first>lhs_V_3_5_cast_fu_1346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>367</item>
</second>
</item>
<item>
<first>lhs_V_3_6_cast_fu_1355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>372</item>
</second>
</item>
<item>
<first>lhs_V_3_cast_fu_1302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>343</item>
</second>
</item>
<item>
<first>lhs_V_4_1_cast_fu_1375</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>382</item>
</second>
</item>
<item>
<first>lhs_V_4_2_cast_fu_1385</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>387</item>
</second>
</item>
<item>
<first>lhs_V_4_3_cast_fu_1395</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>392</item>
</second>
</item>
<item>
<first>lhs_V_4_4_cast_fu_1405</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>397</item>
</second>
</item>
<item>
<first>lhs_V_4_5_cast_fu_1415</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>402</item>
</second>
</item>
<item>
<first>lhs_V_4_cast_fu_1365</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>377</item>
</second>
</item>
<item>
<first>lhs_V_5_1_cast_fu_1434</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>415</item>
</second>
</item>
<item>
<first>lhs_V_5_3_cast_fu_1444</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>423</item>
</second>
</item>
<item>
<first>lhs_V_5_4_cast_fu_1454</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>428</item>
</second>
</item>
<item>
<first>lhs_V_5_5_cast_fu_1464</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>433</item>
</second>
</item>
<item>
<first>lhs_V_5_6_cast_fu_1473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>438</item>
</second>
</item>
<item>
<first>lhs_V_5_cast_fu_1424</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>410</item>
</second>
</item>
<item>
<first>lhs_V_6_1_cast_fu_1493</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>448</item>
</second>
</item>
<item>
<first>lhs_V_6_2_cast_fu_1503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>453</item>
</second>
</item>
<item>
<first>lhs_V_6_3_cast_fu_1513</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>458</item>
</second>
</item>
<item>
<first>lhs_V_6_5_cast_fu_1529</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>467</item>
</second>
</item>
<item>
<first>lhs_V_6_6_cast_fu_1542</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>473</item>
</second>
</item>
<item>
<first>lhs_V_6_cast_fu_1483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>443</item>
</second>
</item>
<item>
<first>lhs_V_cast_fu_1091</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>236</item>
</second>
</item>
<item>
<first>line_buffer_V_0_addr_gep_fu_307</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>182</item>
</second>
</item>
<item>
<first>line_buffer_V_1_addr_gep_fu_319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>185</item>
</second>
</item>
<item>
<first>line_buffer_V_2_addr_gep_fu_331</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>189</item>
</second>
</item>
<item>
<first>line_buffer_V_3_addr_gep_fu_343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>193</item>
</second>
</item>
<item>
<first>line_buffer_V_4_addr_gep_fu_355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>197</item>
</second>
</item>
<item>
<first>line_buffer_V_5_addr_1_gep_fu_399</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>219</item>
</second>
</item>
<item>
<first>line_buffer_V_5_addr_gep_fu_367</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>201</item>
</second>
</item>
<item>
<first>or_cond1_fu_620</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>225</item>
</second>
</item>
<item>
<first>or_cond_fu_602</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>213</item>
</second>
</item>
<item>
<first>r_V_0_1_fu_1105</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>242</item>
</second>
</item>
<item>
<first>r_V_0_2_fu_1115</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>247</item>
</second>
</item>
<item>
<first>r_V_0_4_fu_1125</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>255</item>
</second>
</item>
<item>
<first>r_V_0_5_fu_1134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>260</item>
</second>
</item>
<item>
<first>r_V_0_6_fu_1144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>265</item>
</second>
</item>
<item>
<first>r_V_1_1_fu_1164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>275</item>
</second>
</item>
<item>
<first>r_V_1_2_fu_1178</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>281</item>
</second>
</item>
<item>
<first>r_V_1_3_fu_1192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>287</item>
</second>
</item>
<item>
<first>r_V_1_4_fu_1202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>292</item>
</second>
</item>
<item>
<first>r_V_1_5_fu_1211</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>297</item>
</second>
</item>
<item>
<first>r_V_1_6_fu_1221</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>302</item>
</second>
</item>
<item>
<first>r_V_1_fu_1154</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>270</item>
</second>
</item>
<item>
<first>r_V_2_1_fu_1249</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>314</item>
</second>
</item>
<item>
<first>r_V_2_3_fu_1263</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>323</item>
</second>
</item>
<item>
<first>r_V_2_4_fu_1273</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>328</item>
</second>
</item>
<item>
<first>r_V_2_5_fu_1282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>333</item>
</second>
</item>
<item>
<first>r_V_2_6_fu_1292</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>338</item>
</second>
</item>
<item>
<first>r_V_2_fu_1235</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>308</item>
</second>
</item>
<item>
<first>r_V_3_1_fu_1320</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>350</item>
</second>
</item>
<item>
<first>r_V_3_3_fu_1330</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>358</item>
</second>
</item>
<item>
<first>r_V_3_4_fu_1340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>363</item>
</second>
</item>
<item>
<first>r_V_3_5_fu_1349</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>368</item>
</second>
</item>
<item>
<first>r_V_3_6_fu_1359</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>373</item>
</second>
</item>
<item>
<first>r_V_3_fu_1306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>344</item>
</second>
</item>
<item>
<first>r_V_4_1_fu_1379</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>383</item>
</second>
</item>
<item>
<first>r_V_4_2_fu_1389</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>388</item>
</second>
</item>
<item>
<first>r_V_4_3_fu_1399</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>393</item>
</second>
</item>
<item>
<first>r_V_4_4_fu_1409</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>398</item>
</second>
</item>
<item>
<first>r_V_4_5_fu_1418</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>403</item>
</second>
</item>
<item>
<first>r_V_4_fu_1369</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>378</item>
</second>
</item>
<item>
<first>r_V_5_1_fu_1438</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>416</item>
</second>
</item>
<item>
<first>r_V_5_3_fu_1448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>424</item>
</second>
</item>
<item>
<first>r_V_5_4_fu_1458</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>429</item>
</second>
</item>
<item>
<first>r_V_5_5_fu_1467</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>434</item>
</second>
</item>
<item>
<first>r_V_5_6_fu_1477</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>439</item>
</second>
</item>
<item>
<first>r_V_5_fu_1428</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>411</item>
</second>
</item>
<item>
<first>r_V_6_1_fu_1497</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>449</item>
</second>
</item>
<item>
<first>r_V_6_2_fu_1507</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>454</item>
</second>
</item>
<item>
<first>r_V_6_3_fu_1517</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>459</item>
</second>
</item>
<item>
<first>r_V_6_5_fu_1532</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>468</item>
</second>
</item>
<item>
<first>r_V_6_6_fu_1546</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>474</item>
</second>
</item>
<item>
<first>r_V_6_fu_1487</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>444</item>
</second>
</item>
<item>
<first>r_V_fu_1095</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>237</item>
</second>
</item>
<item>
<first>row_mid2_fu_578</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>row_phi_fu_425</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>row_s_fu_532</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</second>
</item>
<item>
<first>tmp10_fu_1602</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>487</item>
</second>
</item>
<item>
<first>tmp11_cast_fu_1632</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>493</item>
</second>
</item>
<item>
<first>tmp12_fu_1618</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>490</item>
</second>
</item>
<item>
<first>tmp13_fu_1738</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>512</item>
</second>
</item>
<item>
<first>tmp14_fu_1684</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>502</item>
</second>
</item>
<item>
<first>tmp15_fu_1656</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>497</item>
</second>
</item>
<item>
<first>tmp16_fu_1650</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>496</item>
</second>
</item>
<item>
<first>tmp17_cast_fu_1678</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>501</item>
</second>
</item>
<item>
<first>tmp18_fu_1662</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>498</item>
</second>
</item>
<item>
<first>tmp19_fu_1732</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>511</item>
</second>
</item>
<item>
<first>tmp1_fu_1744</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>513</item>
</second>
</item>
<item>
<first>tmp20_cast_fu_1700</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>505</item>
</second>
</item>
<item>
<first>tmp21_fu_1690</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>503</item>
</second>
</item>
<item>
<first>tmp22_cast_fu_1726</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>510</item>
</second>
</item>
<item>
<first>tmp24_fu_1948</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>551</item>
</second>
</item>
<item>
<first>tmp25_fu_1840</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>531</item>
</second>
</item>
<item>
<first>tmp26_fu_1790</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>522</item>
</second>
</item>
<item>
<first>tmp27_fu_1756</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>515</item>
</second>
</item>
<item>
<first>tmp28_fu_1750</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>514</item>
</second>
</item>
<item>
<first>tmp29_cast_fu_1784</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>521</item>
</second>
</item>
<item>
<first>tmp2_fu_1644</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>495</item>
</second>
</item>
<item>
<first>tmp31_fu_1834</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>530</item>
</second>
</item>
<item>
<first>tmp32_fu_1802</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>524</item>
</second>
</item>
<item>
<first>tmp33_fu_1796</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>523</item>
</second>
</item>
<item>
<first>tmp34_cast_fu_1828</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>529</item>
</second>
</item>
<item>
<first>tmp35_fu_1812</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>526</item>
</second>
</item>
<item>
<first>tmp36_fu_1942</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>550</item>
</second>
</item>
<item>
<first>tmp37_fu_1892</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>541</item>
</second>
</item>
<item>
<first>tmp38_cast_fu_1862</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>535</item>
</second>
</item>
<item>
<first>tmp39_fu_1846</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>532</item>
</second>
</item>
<item>
<first>tmp3_fu_1596</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>486</item>
</second>
</item>
<item>
<first>tmp40_cast_fu_1886</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>540</item>
</second>
</item>
<item>
<first>tmp42_fu_1936</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>549</item>
</second>
</item>
<item>
<first>tmp43_cast_fu_1912</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>545</item>
</second>
</item>
<item>
<first>tmp44_fu_1898</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>542</item>
</second>
</item>
<item>
<first>tmp45_fu_1930</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>548</item>
</second>
</item>
<item>
<first>tmp46_fu_1918</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>546</item>
</second>
</item>
<item>
<first>tmp47_fu_1924</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>547</item>
</second>
</item>
<item>
<first>tmp4_cast_fu_1570</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>481</item>
</second>
</item>
<item>
<first>tmp5_fu_1556</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>478</item>
</second>
</item>
<item>
<first>tmp6_cast_fu_1590</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>485</item>
</second>
</item>
<item>
<first>tmp7_fu_1576</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>482</item>
</second>
</item>
<item>
<first>tmp8_fu_1638</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>494</item>
</second>
</item>
<item>
<first>tmp9_cast_fu_1612</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>489</item>
</second>
</item>
<item>
<first>tmp_2_fu_564</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</second>
</item>
<item>
<first>tmp_2_mid1_fu_558</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>tmp_2_mid2_fu_570</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>tmp_4_fu_586</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</second>
</item>
<item>
<first>tmp_55_fu_1954</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>552</item>
</second>
</item>
<item>
<first>tmp_56_fu_1170</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>278</item>
</second>
</item>
<item>
<first>tmp_57_fu_1184</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>284</item>
</second>
</item>
<item>
<first>tmp_58_fu_1227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>305</item>
</second>
</item>
<item>
<first>tmp_59_fu_1241</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>311</item>
</second>
</item>
<item>
<first>tmp_60_fu_1255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>317</item>
</second>
</item>
<item>
<first>tmp_61_fu_1298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>341</item>
</second>
</item>
<item>
<first>tmp_62_fu_1312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>347</item>
</second>
</item>
<item>
<first>tmp_63_fu_1523</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>465</item>
</second>
</item>
<item>
<first>tmp_64_fu_1538</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>471</item>
</second>
</item>
<item>
<first>tmp_65_fu_1552</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>477</item>
</second>
</item>
<item>
<first>tmp_66_fu_1562</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>479</item>
</second>
</item>
<item>
<first>tmp_67_fu_1566</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>480</item>
</second>
</item>
<item>
<first>tmp_68_fu_1582</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>483</item>
</second>
</item>
<item>
<first>tmp_69_fu_1586</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>484</item>
</second>
</item>
<item>
<first>tmp_6_fu_592</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>181</item>
</second>
</item>
<item>
<first>tmp_70_fu_1608</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>488</item>
</second>
</item>
<item>
<first>tmp_71_fu_1624</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>491</item>
</second>
</item>
<item>
<first>tmp_72_fu_1628</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>492</item>
</second>
</item>
<item>
<first>tmp_73_fu_1668</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>499</item>
</second>
</item>
<item>
<first>tmp_74_fu_1674</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>500</item>
</second>
</item>
<item>
<first>tmp_75_fu_1696</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>504</item>
</second>
</item>
<item>
<first>tmp_76_fu_1706</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>506</item>
</second>
</item>
<item>
<first>tmp_77_fu_1710</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>507</item>
</second>
</item>
<item>
<first>tmp_78_fu_1716</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>508</item>
</second>
</item>
<item>
<first>tmp_79_fu_1720</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>509</item>
</second>
</item>
<item>
<first>tmp_80_fu_1762</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>516</item>
</second>
</item>
<item>
<first>tmp_81_fu_1766</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>517</item>
</second>
</item>
<item>
<first>tmp_82_fu_1770</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>518</item>
</second>
</item>
<item>
<first>tmp_83_fu_1774</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>519</item>
</second>
</item>
<item>
<first>tmp_84_fu_1778</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>520</item>
</second>
</item>
<item>
<first>tmp_85_fu_1808</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>525</item>
</second>
</item>
<item>
<first>tmp_86_fu_1818</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>527</item>
</second>
</item>
<item>
<first>tmp_87_fu_1824</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>528</item>
</second>
</item>
<item>
<first>tmp_88_fu_1852</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>533</item>
</second>
</item>
<item>
<first>tmp_89_fu_1858</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>534</item>
</second>
</item>
<item>
<first>tmp_8_fu_719</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>218</item>
</second>
</item>
<item>
<first>tmp_90_fu_1868</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>536</item>
</second>
</item>
<item>
<first>tmp_91_fu_1872</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>537</item>
</second>
</item>
<item>
<first>tmp_92_fu_1876</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>538</item>
</second>
</item>
<item>
<first>tmp_93_fu_1880</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>539</item>
</second>
</item>
<item>
<first>tmp_94_fu_1904</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>543</item>
</second>
</item>
<item>
<first>tmp_95_fu_1908</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>544</item>
</second>
</item>
<item>
<first>tmp_9_fu_614</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>224</item>
</second>
</item>
<item>
<first>tmp_fu_544</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>tmp_mid1_fu_538</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</second>
</item>
<item>
<first>tmp_mid2_fu_550</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>window_V_0_6_loc_1_fu_290</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>window_V_1_6_loc_1_fu_286</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>window_V_2_6_loc_1_fu_282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>window_V_3_6_loc_1_fu_278</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>window_V_4_6_loc_1_fu_274</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>window_V_5_6_loc_1_fu_270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>114</count>
<item_version>0</item_version>
<item>
<first>in_temp_V_1_load_1_load_fu_1070</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>228</item>
</second>
</item>
<item>
<first>in_temp_V_1_load_load_fu_632</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>in_temp_V_read_fu_294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>216</item>
</second>
</item>
<item>
<first>stg_100_store_fu_694</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>206</item>
</second>
</item>
<item>
<first>stg_101_store_fu_699</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>207</item>
</second>
</item>
<item>
<first>stg_102_store_fu_704</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>208</item>
</second>
</item>
<item>
<first>stg_103_store_fu_709</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>209</item>
</second>
</item>
<item>
<first>stg_104_store_fu_714</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>210</item>
</second>
</item>
<item>
<first>stg_109_store_fu_723</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>221</item>
</second>
</item>
<item>
<first>stg_117_store_fu_735</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>stg_119_store_fu_745</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>112</item>
</second>
</item>
<item>
<first>stg_121_store_fu_755</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>stg_123_store_fu_765</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</second>
</item>
<item>
<first>stg_124_store_fu_771</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</second>
</item>
<item>
<first>stg_127_store_fu_784</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>120</item>
</second>
</item>
<item>
<first>stg_129_store_fu_794</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>122</item>
</second>
</item>
<item>
<first>stg_131_store_fu_804</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>stg_133_store_fu_814</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>126</item>
</second>
</item>
<item>
<first>stg_134_store_fu_820</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>127</item>
</second>
</item>
<item>
<first>stg_137_store_fu_833</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</second>
</item>
<item>
<first>stg_139_store_fu_843</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>stg_141_store_fu_853</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</second>
</item>
<item>
<first>stg_143_store_fu_863</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</second>
</item>
<item>
<first>stg_144_store_fu_869</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>137</item>
</second>
</item>
<item>
<first>stg_147_store_fu_882</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</second>
</item>
<item>
<first>stg_149_store_fu_892</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>142</item>
</second>
</item>
<item>
<first>stg_151_store_fu_902</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
<item>
<first>stg_153_store_fu_912</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>146</item>
</second>
</item>
<item>
<first>stg_154_store_fu_918</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>147</item>
</second>
</item>
<item>
<first>stg_157_store_fu_931</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>150</item>
</second>
</item>
<item>
<first>stg_159_store_fu_941</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>152</item>
</second>
</item>
<item>
<first>stg_161_store_fu_951</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</second>
</item>
<item>
<first>stg_163_store_fu_961</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>156</item>
</second>
</item>
<item>
<first>stg_164_store_fu_967</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>157</item>
</second>
</item>
<item>
<first>stg_167_store_fu_980</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>160</item>
</second>
</item>
<item>
<first>stg_169_store_fu_990</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>162</item>
</second>
</item>
<item>
<first>stg_171_store_fu_1000</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>164</item>
</second>
</item>
<item>
<first>stg_173_store_fu_1010</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>166</item>
</second>
</item>
<item>
<first>stg_174_store_fu_1016</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>167</item>
</second>
</item>
<item>
<first>stg_177_store_fu_1029</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>170</item>
</second>
</item>
<item>
<first>stg_179_store_fu_1039</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>172</item>
</second>
</item>
<item>
<first>stg_181_store_fu_1049</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>174</item>
</second>
</item>
<item>
<first>stg_183_store_fu_1059</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>176</item>
</second>
</item>
<item>
<first>stg_184_store_fu_1065</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>177</item>
</second>
</item>
<item>
<first>stg_25_store_fu_471</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>stg_26_store_fu_476</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>stg_27_store_fu_481</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>stg_28_store_fu_486</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>stg_29_store_fu_491</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>stg_30_store_fu_496</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>stg_31_store_fu_501</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>stg_510_write_fu_300</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>553</item>
</second>
</item>
<item>
<first>stg_68_store_fu_608</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>217</item>
</second>
</item>
<item>
<first>stg_83_store_fu_653</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>184</item>
</second>
</item>
<item>
<first>stg_86_store_fu_659</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>188</item>
</second>
</item>
<item>
<first>stg_89_store_fu_665</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>192</item>
</second>
</item>
<item>
<first>stg_92_store_fu_671</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>196</item>
</second>
</item>
<item>
<first>stg_95_store_fu_677</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>200</item>
</second>
</item>
<item>
<first>stg_98_store_fu_683</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>204</item>
</second>
</item>
<item>
<first>stg_99_store_fu_689</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>205</item>
</second>
</item>
<item>
<first>window_V_0_1_load_load_fu_727</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>window_V_0_2_load_load_fu_731</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</second>
</item>
<item>
<first>window_V_0_3_load_load_fu_741</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>window_V_0_4_load_load_fu_751</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>window_V_0_5_load_load_fu_761</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>window_V_0_6_load_load_fu_443</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>window_V_0_6_loc_1_load_1_load_fu_1088</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>234</item>
</second>
</item>
<item>
<first>window_V_0_6_loc_1_load_load_fu_650</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>window_V_1_1_load_load_fu_776</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</second>
</item>
<item>
<first>window_V_1_2_load_load_fu_780</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>119</item>
</second>
</item>
<item>
<first>window_V_1_3_load_load_fu_790</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>121</item>
</second>
</item>
<item>
<first>window_V_1_4_load_load_fu_800</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>window_V_1_5_load_load_fu_810</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</second>
</item>
<item>
<first>window_V_1_6_load_load_fu_447</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>window_V_1_6_loc_1_load_1_load_fu_1085</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>233</item>
</second>
</item>
<item>
<first>window_V_1_6_loc_1_load_load_fu_647</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>window_V_2_1_load_load_fu_825</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</second>
</item>
<item>
<first>window_V_2_2_load_load_fu_829</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>window_V_2_3_load_load_fu_839</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</second>
</item>
<item>
<first>window_V_2_4_load_load_fu_849</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</second>
</item>
<item>
<first>window_V_2_5_load_load_fu_859</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>window_V_2_6_load_load_fu_451</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>window_V_2_6_loc_1_load_1_load_fu_1082</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>232</item>
</second>
</item>
<item>
<first>window_V_2_6_loc_1_load_load_fu_644</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>window_V_3_1_load_load_fu_874</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>138</item>
</second>
</item>
<item>
<first>window_V_3_2_load_load_fu_878</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>139</item>
</second>
</item>
<item>
<first>window_V_3_3_load_load_fu_888</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>141</item>
</second>
</item>
<item>
<first>window_V_3_4_load_load_fu_898</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>143</item>
</second>
</item>
<item>
<first>window_V_3_5_load_load_fu_908</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>145</item>
</second>
</item>
<item>
<first>window_V_3_6_load_load_fu_455</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>window_V_3_6_loc_1_load_1_load_fu_1079</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>231</item>
</second>
</item>
<item>
<first>window_V_3_6_loc_1_load_load_fu_641</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>window_V_4_1_load_load_fu_923</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</second>
</item>
<item>
<first>window_V_4_2_load_load_fu_927</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>149</item>
</second>
</item>
<item>
<first>window_V_4_3_load_load_fu_937</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>151</item>
</second>
</item>
<item>
<first>window_V_4_4_load_load_fu_947</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>153</item>
</second>
</item>
<item>
<first>window_V_4_5_load_load_fu_957</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>155</item>
</second>
</item>
<item>
<first>window_V_4_6_load_load_fu_459</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>window_V_4_6_loc_1_load_1_load_fu_1076</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>230</item>
</second>
</item>
<item>
<first>window_V_4_6_loc_1_load_load_fu_638</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>window_V_5_1_load_load_fu_972</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>158</item>
</second>
</item>
<item>
<first>window_V_5_2_load_load_fu_976</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</second>
</item>
<item>
<first>window_V_5_3_load_load_fu_986</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>161</item>
</second>
</item>
<item>
<first>window_V_5_4_load_load_fu_996</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>163</item>
</second>
</item>
<item>
<first>window_V_5_5_load_load_fu_1006</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</second>
</item>
<item>
<first>window_V_5_6_load_load_fu_463</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>window_V_5_6_loc_1_load_1_load_fu_1073</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>229</item>
</second>
</item>
<item>
<first>window_V_5_6_loc_1_load_load_fu_635</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>window_V_6_1_load_load_fu_1021</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>168</item>
</second>
</item>
<item>
<first>window_V_6_2_load_load_fu_1025</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>169</item>
</second>
</item>
<item>
<first>window_V_6_3_load_load_fu_1035</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>171</item>
</second>
</item>
<item>
<first>window_V_6_4_load_load_fu_1045</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>173</item>
</second>
</item>
<item>
<first>window_V_6_5_load_load_fu_1055</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>175</item>
</second>
</item>
<item>
<first>window_V_6_6_load_load_fu_467</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="50" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first class_id="52" tracking_level="0" version="0">
<first>line_buffer_V_0</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>183</item>
<item>183</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_0</first>
<second>1</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>187</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_1</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>186</item>
<item>186</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_1</first>
<second>1</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>191</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_2</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>190</item>
<item>190</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_2</first>
<second>1</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>195</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_3</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>194</item>
<item>194</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_3</first>
<second>1</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>199</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_4</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>198</item>
<item>198</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_4</first>
<second>1</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>203</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_5</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>202</item>
<item>202</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_5</first>
<second>1</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>220</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>32</count>
<item_version>0</item_version>
<item>
<first>410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>432</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>1961</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>1969</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>1977</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>1985</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>1993</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>2001</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>2009</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>2017</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>2021</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>2026</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>2031</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>2036</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</second>
</item>
<item>
<first>2040</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>182</item>
</second>
</item>
<item>
<first>2046</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>185</item>
</second>
</item>
<item>
<first>2052</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>189</item>
</second>
</item>
<item>
<first>2058</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>193</item>
</second>
</item>
<item>
<first>2064</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>197</item>
</second>
</item>
<item>
<first>2070</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>201</item>
</second>
</item>
<item>
<first>2075</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>213</item>
</second>
</item>
<item>
<first>2079</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>216</item>
</second>
</item>
<item>
<first>2085</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>225</item>
</second>
</item>
<item>
<first>2089</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>557</item>
</second>
</item>
<item>
<first>2094</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>2100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>2106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>2112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>2118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>2124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>2130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>32</count>
<item_version>0</item_version>
<item>
<first>col_1_reg_2089</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>557</item>
</second>
</item>
<item>
<first>col_mid2_reg_2026</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>col_reg_432</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_2017</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>in_temp_V_1_load_reg_2094</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>in_temp_V_1_reg_1961</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>in_temp_V_reg_2079</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>216</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_2021</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>line_buffer_V_0_addr_reg_2040</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>182</item>
</second>
</item>
<item>
<first>line_buffer_V_1_addr_reg_2046</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>185</item>
</second>
</item>
<item>
<first>line_buffer_V_2_addr_reg_2052</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>189</item>
</second>
</item>
<item>
<first>line_buffer_V_3_addr_reg_2058</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>193</item>
</second>
</item>
<item>
<first>line_buffer_V_4_addr_reg_2064</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>197</item>
</second>
</item>
<item>
<first>line_buffer_V_5_addr_reg_2070</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>201</item>
</second>
</item>
<item>
<first>or_cond1_reg_2085</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>225</item>
</second>
</item>
<item>
<first>or_cond_reg_2075</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>213</item>
</second>
</item>
<item>
<first>row_mid2_reg_2031</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>row_reg_421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>tmp_4_reg_2036</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</second>
</item>
<item>
<first>window_V_0_6_loc_1_load_reg_2130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>window_V_0_6_loc_1_reg_2009</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>window_V_1_6_loc_1_load_reg_2124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>window_V_1_6_loc_1_reg_2001</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>window_V_2_6_loc_1_load_reg_2118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>window_V_2_6_loc_1_reg_1993</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>window_V_3_6_loc_1_load_reg_2112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>window_V_3_6_loc_1_reg_1985</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>window_V_4_6_loc_1_load_reg_2106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>window_V_4_6_loc_1_reg_1977</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>window_V_5_6_loc_1_load_reg_2100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>window_V_5_6_loc_1_reg_1969</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>432</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>col_reg_432</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>row_reg_421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="53" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>in_img_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>216</item>
</second>
</item>
</second>
</item>
<item>
<first>out_img_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>553</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="55" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>43</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first>237</first>
<second>Mul_LUT</second>
</item>
<item>
<first>242</first>
<second>Mul_LUT</second>
</item>
<item>
<first>247</first>
<second>Mul_LUT</second>
</item>
<item>
<first>255</first>
<second>Mul_LUT</second>
</item>
<item>
<first>260</first>
<second>Mul_LUT</second>
</item>
<item>
<first>265</first>
<second>Mul_LUT</second>
</item>
<item>
<first>270</first>
<second>Mul_LUT</second>
</item>
<item>
<first>275</first>
<second>Mul_LUT</second>
</item>
<item>
<first>281</first>
<second>Mul_LUT</second>
</item>
<item>
<first>287</first>
<second>Mul_LUT</second>
</item>
<item>
<first>292</first>
<second>Mul_LUT</second>
</item>
<item>
<first>297</first>
<second>Mul_LUT</second>
</item>
<item>
<first>302</first>
<second>Mul_LUT</second>
</item>
<item>
<first>308</first>
<second>Mul_LUT</second>
</item>
<item>
<first>314</first>
<second>Mul_LUT</second>
</item>
<item>
<first>323</first>
<second>Mul_LUT</second>
</item>
<item>
<first>328</first>
<second>Mul_LUT</second>
</item>
<item>
<first>333</first>
<second>Mul_LUT</second>
</item>
<item>
<first>338</first>
<second>Mul_LUT</second>
</item>
<item>
<first>344</first>
<second>Mul_LUT</second>
</item>
<item>
<first>350</first>
<second>Mul_LUT</second>
</item>
<item>
<first>358</first>
<second>Mul_LUT</second>
</item>
<item>
<first>363</first>
<second>Mul_LUT</second>
</item>
<item>
<first>368</first>
<second>Mul_LUT</second>
</item>
<item>
<first>373</first>
<second>Mul_LUT</second>
</item>
<item>
<first>378</first>
<second>Mul_LUT</second>
</item>
<item>
<first>383</first>
<second>Mul_LUT</second>
</item>
<item>
<first>388</first>
<second>Mul_LUT</second>
</item>
<item>
<first>393</first>
<second>Mul_LUT</second>
</item>
<item>
<first>398</first>
<second>Mul_LUT</second>
</item>
<item>
<first>403</first>
<second>Mul_LUT</second>
</item>
<item>
<first>411</first>
<second>Mul_LUT</second>
</item>
<item>
<first>416</first>
<second>Mul_LUT</second>
</item>
<item>
<first>424</first>
<second>Mul_LUT</second>
</item>
<item>
<first>429</first>
<second>Mul_LUT</second>
</item>
<item>
<first>434</first>
<second>Mul_LUT</second>
</item>
<item>
<first>439</first>
<second>Mul_LUT</second>
</item>
<item>
<first>444</first>
<second>Mul_LUT</second>
</item>
<item>
<first>449</first>
<second>Mul_LUT</second>
</item>
<item>
<first>454</first>
<second>Mul_LUT</second>
</item>
<item>
<first>459</first>
<second>Mul_LUT</second>
</item>
<item>
<first>468</first>
<second>Mul_LUT</second>
</item>
<item>
<first>474</first>
<second>Mul_LUT</second>
</item>
</node2core>
</syndb>
</boost_serialization>
|
pragma Ada_2005;
pragma Style_Checks (Off);
pragma Warnings (Off);
with Interfaces.C; use Interfaces.C;
with glib;
with glib.Values;
with System;
with glib;
with System;
package GStreamer.GST_Low_Level.gstreamer_0_10_gst_interfaces_videoorientation_h is
-- unsupported macro: GST_TYPE_VIDEO_ORIENTATION (gst_video_orientation_get_type ())
-- arg-macro: function GST_VIDEO_ORIENTATION (obj)
-- return GST_IMPLEMENTS_INTERFACE_CHECK_INSTANCE_CAST ((obj), GST_TYPE_VIDEO_ORIENTATION, GstVideoOrientation);
-- arg-macro: function GST_IS_VIDEO_ORIENTATION (obj)
-- return GST_IMPLEMENTS_INTERFACE_CHECK_INSTANCE_TYPE ((obj), GST_TYPE_VIDEO_ORIENTATION);
-- arg-macro: function GST_VIDEO_ORIENTATION_GET_IFACE (inst)
-- return G_TYPE_INSTANCE_GET_INTERFACE ((inst), GST_TYPE_VIDEO_ORIENTATION, GstVideoOrientationInterface);
-- GStreamer
-- * Copyright (C) 2006 Nokia <stefan.kost@nokia.com
-- *
-- * videoorientation.h: video flipping and centering interface
-- *
-- * This library is free software; you can redistribute it and/or
-- * modify it under the terms of the GNU Library General Public
-- * License as published by the Free Software Foundation; either
-- * version 2 of the License, or (at your option) any later version.
-- *
-- * This library is distributed in the hope that it will be useful,
-- * but WITHOUT ANY WARRANTY; without even the implied warranty of
-- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- * Library General Public License for more details.
-- *
-- * You should have received a copy of the GNU Library General Public
-- * License along with this library; if not, write to the
-- * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-- * Boston, MA 02111-1307, USA.
--
--*
-- * GstVideoOrientation:
-- *
-- * Opaque #GstVideoOrientation data structure.
--
-- skipped empty struct u_GstVideoOrientation
-- skipped empty struct GstVideoOrientation
type GstVideoOrientationInterface;
type u_GstVideoOrientationInterface_u_gst_reserved_array is array (0 .. 3) of System.Address;
--subtype GstVideoOrientationInterface is u_GstVideoOrientationInterface; -- gst/interfaces/videoorientation.h:45
--*
-- * GstVideoOrientationInterface:
-- * @parent: parent interface type.
-- * @get_hflip: virtual method to get horizontal flipping state
-- * @get_vflip: virtual method to get vertical flipping state
-- * @get_hcenter: virtual method to get horizontal centering state
-- * @get_vcenter: virtual method to get vertical centering state
-- * @set_hflip: virtual method to set horizontal flipping state
-- * @set_vflip: virtual method to set vertical flipping state
-- * @set_hcenter: virtual method to set horizontal centering state
-- * @set_vcenter: virtual method to set vertical centering state
-- *
-- * #GstVideoOrientationInterface interface.
--
type GstVideoOrientationInterface is record
parent : aliased GStreamer.GST_Low_Level.glib_2_0_gobject_gtype_h.GTypeInterface; -- gst/interfaces/videoorientation.h:62
get_hflip : access function (arg1 : System.Address; arg2 : access GLIB.gboolean) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:65
get_vflip : access function (arg1 : System.Address; arg2 : access GLIB.gboolean) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:66
get_hcenter : access function (arg1 : System.Address; arg2 : access GLIB.gint) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:67
get_vcenter : access function (arg1 : System.Address; arg2 : access GLIB.gint) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:68
set_hflip : access function (arg1 : System.Address; arg2 : GLIB.gboolean) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:70
set_vflip : access function (arg1 : System.Address; arg2 : GLIB.gboolean) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:71
set_hcenter : access function (arg1 : System.Address; arg2 : GLIB.gint) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:72
set_vcenter : access function (arg1 : System.Address; arg2 : GLIB.gint) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:73
u_gst_reserved : u_GstVideoOrientationInterface_u_gst_reserved_array; -- gst/interfaces/videoorientation.h:76
end record;
pragma Convention (C_Pass_By_Copy, GstVideoOrientationInterface); -- gst/interfaces/videoorientation.h:61
-- virtual functions
--< private >
function gst_video_orientation_get_type return GLIB.GType; -- gst/interfaces/videoorientation.h:79
pragma Import (C, gst_video_orientation_get_type, "gst_video_orientation_get_type");
-- virtual class function wrappers
function gst_video_orientation_get_hflip (video_orientation : System.Address; flip : access GLIB.gboolean) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:82
pragma Import (C, gst_video_orientation_get_hflip, "gst_video_orientation_get_hflip");
function gst_video_orientation_get_vflip (video_orientation : System.Address; flip : access GLIB.gboolean) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:83
pragma Import (C, gst_video_orientation_get_vflip, "gst_video_orientation_get_vflip");
function gst_video_orientation_get_hcenter (video_orientation : System.Address; center : access GLIB.gint) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:84
pragma Import (C, gst_video_orientation_get_hcenter, "gst_video_orientation_get_hcenter");
function gst_video_orientation_get_vcenter (video_orientation : System.Address; center : access GLIB.gint) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:85
pragma Import (C, gst_video_orientation_get_vcenter, "gst_video_orientation_get_vcenter");
function gst_video_orientation_set_hflip (video_orientation : System.Address; flip : GLIB.gboolean) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:87
pragma Import (C, gst_video_orientation_set_hflip, "gst_video_orientation_set_hflip");
function gst_video_orientation_set_vflip (video_orientation : System.Address; flip : GLIB.gboolean) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:88
pragma Import (C, gst_video_orientation_set_vflip, "gst_video_orientation_set_vflip");
function gst_video_orientation_set_hcenter (video_orientation : System.Address; center : GLIB.gint) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:89
pragma Import (C, gst_video_orientation_set_hcenter, "gst_video_orientation_set_hcenter");
function gst_video_orientation_set_vcenter (video_orientation : System.Address; center : GLIB.gint) return GLIB.gboolean; -- gst/interfaces/videoorientation.h:90
pragma Import (C, gst_video_orientation_set_vcenter, "gst_video_orientation_set_vcenter");
end GStreamer.GST_Low_Level.gstreamer_0_10_gst_interfaces_videoorientation_h;
|
-- Euler1 in Ada
with Ada.Integer_Text_IO,
Ada.Numerics.Elementary_Functions;
procedure Euler1_5 is
type Integers is array (Natural range <>) of Integer;
function aRange(size : in Integer; ints : in out Integers) return Integers is
begin
if size > 0 then
ints(size) := size;
return aRange(size-1, ints);
end if;
return ints;
end;
function myRange(size : in Integer) return Integers is
ints : Integers(1..size);
begin
return aRange(size, ints);
end;
function aMap(x : in Integer) return Integer is (if x mod 3 = 0 or x mod 5 = 0 then x else 0);
function myMap(
begin
Ada.Integer_Text_IO.Put (Integer( Euler(999) ));
end Euler1_5;
|
------------------------------------------------------------------------------
-- --
-- Ada binding for OpenGL/WebGL --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2016-2018, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with OpenGL.Contexts.Internals;
package body OpenGL.Shaders is
-------------------------
-- Compile_Source_Code --
-------------------------
function Compile_Source_Code
(Self : in out OpenGL_Shader'Class;
Source : League.Strings.Universal_String) return Boolean
is
use type WebAPI.WebGL.Shaders.WebGL_Shader_Access;
use type WebAPI.WebGL.Rendering_Contexts.WebGL_Rendering_Context_Access;
begin
if Self.Context = null then
Self.Context := OpenGL.Contexts.Internals.Current_WebGL_Context;
if Self.Context = null then
return False;
end if;
end if;
if Self.Shader = null then
Self.Shader :=
Self.Context.Create_Shader
((case Self.Shader_Type is
when Vertex => WebAPI.WebGL.Rendering_Contexts.VERTEX_SHADER,
when Fragment =>
WebAPI.WebGL.Rendering_Contexts.FRAGMENT_SHADER));
if Self.Shader = null then
return False;
end if;
end if;
Self.Context.Shader_Source (Self.Shader, Source);
Self.Context.Compile_Shader (Self.Shader);
if not Self.Context.Get_Shader_Parameter
(Self.Shader, WebAPI.WebGL.Rendering_Contexts.COMPILE_STATUS)
then
Self.Context.Delete_Shader (Self.Shader);
Self.Shader := null;
Self.Context := null;
-- XXX Error handling must be implemented.
raise Program_Error;
end if;
return True;
end Compile_Source_Code;
end OpenGL.Shaders;
|
-- generated parser support file.
-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c PROCESS gpr.wy
--
-- Copyright (C) 2013 - 2019 Free Software Foundation, Inc.
-- This program is free software; you can redistribute it and/or
-- modify it under the terms of the GNU General Public License as
-- published by the Free Software Foundation; either version 3, or (at
-- your option) any later version.
--
-- This software 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 GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
with WisiToken.Syntax_Trees;
with WisiToken.Parse.LR.Parser;
package Gpr_Process_Main is
procedure Create_Parser
(Parser : out WisiToken.Parse.LR.Parser.Parser;
Language_Fixes : in WisiToken.Parse.LR.Parser.Language_Fixes_Access;
Language_Matching_Begin_Tokens : in WisiToken.Parse.LR.Parser.Language_Matching_Begin_Tokens_Access;
Language_String_ID_Set : in WisiToken.Parse.LR.Parser.Language_String_ID_Set_Access;
Trace : not null access WisiToken.Trace'Class;
User_Data : in WisiToken.Syntax_Trees.User_Data_Access);
end Gpr_Process_Main;
|
-- Copyright 2015-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Reprod; use Reprod;
procedure Reprod_Main is
O : Obj_T (Len => 1);
begin
O.Data := (others => (I => 1));
Do_Nothing (O);
end Reprod_Main;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-2017, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with Matreshka.Internals.Strings;
package AMF.Internals.Tables.Utp_String_Data_00 is
-- "extension_FinishAction"
MS_0000 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0046#, 16#0069#,
16#006E#, 16#0069#, 16#0073#, 16#0068#,
16#0041#, 16#0063#, 16#0074#, 16#0069#,
16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "extension_TestLog"
MS_0001 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0054#, 16#0065#,
16#0073#, 16#0074#, 16#004C#, 16#006F#,
16#0067#,
others => 16#0000#),
others => <>);
-- "SetTimezoneAction"
MS_0002 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0053#, 16#0065#, 16#0074#, 16#0054#,
16#0069#, 16#006D#, 16#0065#, 16#007A#,
16#006F#, 16#006E#, 16#0065#, 16#0041#,
16#0063#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "tester"
MS_0003 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0074#, 16#0065#, 16#0073#, 16#0074#,
16#0065#, 16#0072#,
others => 16#0000#),
others => <>);
-- "ReadTimerAction"
MS_0004 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 15,
Length => 15,
Value =>
(16#0052#, 16#0065#, 16#0061#, 16#0064#,
16#0054#, 16#0069#, 16#006D#, 16#0065#,
16#0072#, 16#0041#, 16#0063#, 16#0074#,
16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "testCase"
MS_0005 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0074#, 16#0065#, 16#0073#, 16#0074#,
16#0043#, 16#0061#, 16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- "inconclusive"
MS_0006 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#006E#, 16#0063#, 16#006F#,
16#006E#, 16#0063#, 16#006C#, 16#0075#,
16#0073#, 16#0069#, 16#0076#, 16#0065#,
others => 16#0000#),
others => <>);
-- "extension_ManagedElement"
MS_0007 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 24,
Length => 24,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#004D#, 16#0061#,
16#006E#, 16#0061#, 16#0067#, 16#0065#,
16#0064#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "extension_TestSuite"
MS_0008 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0054#, 16#0065#,
16#0073#, 16#0074#, 16#0053#, 16#0075#,
16#0069#, 16#0074#, 16#0065#,
others => 16#0000#),
others => <>);
-- "base_AcceptEventAction"
MS_0009 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0041#, 16#0063#, 16#0063#,
16#0065#, 16#0070#, 16#0074#, 16#0045#,
16#0076#, 16#0065#, 16#006E#, 16#0074#,
16#0041#, 16#0063#, 16#0074#, 16#0069#,
16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "base_WriteStructuralFeatureAction"
MS_000A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 33,
Length => 33,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0057#, 16#0072#, 16#0069#,
16#0074#, 16#0065#, 16#0053#, 16#0074#,
16#0072#, 16#0075#, 16#0063#, 16#0074#,
16#0075#, 16#0072#, 16#0061#, 16#006C#,
16#0046#, 16#0065#, 16#0061#, 16#0074#,
16#0075#, 16#0072#, 16#0065#, 16#0041#,
16#0063#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "extension_LiteralAny"
MS_000B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#004C#, 16#0069#,
16#0074#, 16#0065#, 16#0072#, 16#0061#,
16#006C#, 16#0041#, 16#006E#, 16#0079#,
others => 16#0000#),
others => <>);
-- "Time"
MS_000C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0054#, 16#0069#, 16#006D#, 16#0065#,
others => 16#0000#),
others => <>);
-- "CodingRule"
MS_000D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0043#, 16#006F#, 16#0064#, 16#0069#,
16#006E#, 16#0067#, 16#0052#, 16#0075#,
16#006C#, 16#0065#,
others => 16#0000#),
others => <>);
-- "error"
MS_000E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0065#, 16#0072#, 16#0072#, 16#006F#,
16#0072#,
others => 16#0000#),
others => <>);
-- "extension_TestContext"
MS_000F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0054#, 16#0065#,
16#0073#, 16#0074#, 16#0043#, 16#006F#,
16#006E#, 16#0074#, 16#0065#, 16#0078#,
16#0074#,
others => 16#0000#),
others => <>);
-- "extension_StopTimerAction"
MS_0010 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 25,
Length => 25,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0053#, 16#0074#,
16#006F#, 16#0070#, 16#0054#, 16#0069#,
16#006D#, 16#0065#, 16#0072#, 16#0041#,
16#0063#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "compatibleSUTVersion"
MS_0011 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0063#, 16#006F#, 16#006D#, 16#0070#,
16#0061#, 16#0074#, 16#0069#, 16#0062#,
16#006C#, 16#0065#, 16#0053#, 16#0055#,
16#0054#, 16#0056#, 16#0065#, 16#0072#,
16#0073#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "extension_ValidationAction"
MS_0012 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 26,
Length => 26,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0056#, 16#0061#,
16#006C#, 16#0069#, 16#0064#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0041#, 16#0063#, 16#0074#, 16#0069#,
16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "base_StructuredClassifier"
MS_0013 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 25,
Length => 25,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0053#, 16#0074#, 16#0072#,
16#0075#, 16#0063#, 16#0074#, 16#0075#,
16#0072#, 16#0065#, 16#0064#, 16#0043#,
16#006C#, 16#0061#, 16#0073#, 16#0073#,
16#0069#, 16#0066#, 16#0069#, 16#0065#,
16#0072#,
others => 16#0000#),
others => <>);
-- "duration"
MS_0014 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0064#, 16#0075#, 16#0072#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "TimeOutMessage"
MS_0015 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0054#, 16#0069#, 16#006D#, 16#0065#,
16#004F#, 16#0075#, 16#0074#, 16#004D#,
16#0065#, 16#0073#, 16#0073#, 16#0061#,
16#0067#, 16#0065#,
others => 16#0000#),
others => <>);
-- "extension_TimeOutAction"
MS_0016 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 23,
Length => 23,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0054#, 16#0069#,
16#006D#, 16#0065#, 16#004F#, 16#0075#,
16#0074#, 16#0041#, 16#0063#, 16#0074#,
16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "TestCase"
MS_0017 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0054#, 16#0065#, 16#0073#, 16#0074#,
16#0043#, 16#0061#, 16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- "base_CallOperationAction"
MS_0018 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 24,
Length => 24,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0043#, 16#0061#, 16#006C#,
16#006C#, 16#004F#, 16#0070#, 16#0065#,
16#0072#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0041#, 16#0063#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "DataPartition"
MS_0019 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0044#, 16#0061#, 16#0074#, 16#0061#,
16#0050#, 16#0061#, 16#0072#, 16#0074#,
16#0069#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "base_Element"
MS_001A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "TestLogApplication"
MS_001B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0054#, 16#0065#, 16#0073#, 16#0074#,
16#004C#, 16#006F#, 16#0067#, 16#0041#,
16#0070#, 16#0070#, 16#006C#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "base_ValueSpecification"
MS_001C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 23,
Length => 23,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0056#, 16#0061#, 16#006C#,
16#0075#, 16#0065#, 16#0053#, 16#0070#,
16#0065#, 16#0063#, 16#0069#, 16#0066#,
16#0069#, 16#0063#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "extension_StartTimerAction"
MS_001D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 26,
Length => 26,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0053#, 16#0074#,
16#0061#, 16#0072#, 16#0074#, 16#0054#,
16#0069#, 16#006D#, 16#0065#, 16#0072#,
16#0041#, 16#0063#, 16#0074#, 16#0069#,
16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "base_OpaqueAction"
MS_001E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#004F#, 16#0070#, 16#0061#,
16#0071#, 16#0075#, 16#0065#, 16#0041#,
16#0063#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "Default"
MS_001F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#0044#, 16#0065#, 16#0066#, 16#0061#,
16#0075#, 16#006C#, 16#0074#,
others => 16#0000#),
others => <>);
-- "owner"
MS_0020 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#006F#, 16#0077#, 16#006E#, 16#0065#,
16#0072#,
others => 16#0000#),
others => <>);
-- "extension_Default"
MS_0021 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0044#, 16#0065#,
16#0066#, 16#0061#, 16#0075#, 16#006C#,
16#0074#,
others => 16#0000#),
others => <>);
-- "criticality"
MS_0022 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0072#, 16#0069#, 16#0074#,
16#0069#, 16#0063#, 16#0061#, 16#006C#,
16#0069#, 16#0074#, 16#0079#,
others => 16#0000#),
others => <>);
-- "LogAction"
MS_0023 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#004C#, 16#006F#, 16#0067#, 16#0041#,
16#0063#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "extension_LogAction"
MS_0024 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#004C#, 16#006F#,
16#0067#, 16#0041#, 16#0063#, 16#0074#,
16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "extension_DefaultApplication"
MS_0025 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 28,
Length => 28,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0044#, 16#0065#,
16#0066#, 16#0061#, 16#0075#, 16#006C#,
16#0074#, 16#0041#, 16#0070#, 16#0070#,
16#006C#, 16#0069#, 16#0063#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "base_Property"
MS_0026 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0050#, 16#0072#, 16#006F#,
16#0070#, 16#0065#, 16#0072#, 16#0074#,
16#0079#,
others => 16#0000#),
others => <>);
-- "http://www.omg.org/UTPSA"
MS_0027 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 24,
Length => 24,
Value =>
(16#0068#, 16#0074#, 16#0074#, 16#0070#,
16#003A#, 16#002F#, 16#002F#, 16#0077#,
16#0077#, 16#0077#, 16#002E#, 16#006F#,
16#006D#, 16#0067#, 16#002E#, 16#006F#,
16#0072#, 16#0067#, 16#002F#, 16#0055#,
16#0054#, 16#0050#, 16#0053#, 16#0041#,
others => 16#0000#),
others => <>);
-- "LiteralAny"
MS_0028 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#004C#, 16#0069#, 16#0074#, 16#0065#,
16#0072#, 16#0061#, 16#006C#, 16#0041#,
16#006E#, 16#0079#,
others => 16#0000#),
others => <>);
-- "pass"
MS_0029 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0070#, 16#0061#, 16#0073#, 16#0073#,
others => 16#0000#),
others => <>);
-- "extension_TimeOut"
MS_002A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0054#, 16#0069#,
16#006D#, 16#0065#, 16#004F#, 16#0075#,
16#0074#,
others => 16#0000#),
others => <>);
-- "extension_GetTimezoneAction"
MS_002B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 27,
Length => 27,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0047#, 16#0065#,
16#0074#, 16#0054#, 16#0069#, 16#006D#,
16#0065#, 16#007A#, 16#006F#, 16#006E#,
16#0065#, 16#0041#, 16#0063#, 16#0074#,
16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "base_BehavioredClassifier"
MS_002C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 25,
Length => 25,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0042#, 16#0065#, 16#0068#,
16#0061#, 16#0076#, 16#0069#, 16#006F#,
16#0072#, 16#0065#, 16#0064#, 16#0043#,
16#006C#, 16#0061#, 16#0073#, 16#0073#,
16#0069#, 16#0066#, 16#0069#, 16#0065#,
16#0072#,
others => 16#0000#),
others => <>);
-- "DataPool"
MS_002D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0044#, 16#0061#, 16#0074#, 16#0061#,
16#0050#, 16#006F#, 16#006F#, 16#006C#,
others => 16#0000#),
others => <>);
-- "extension_DetermAlt"
MS_002E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0044#, 16#0065#,
16#0074#, 16#0065#, 16#0072#, 16#006D#,
16#0041#, 16#006C#, 16#0074#,
others => 16#0000#),
others => <>);
-- "extension_TestObjective"
MS_002F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 23,
Length => 23,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0054#, 16#0065#,
16#0073#, 16#0074#, 16#004F#, 16#0062#,
16#006A#, 16#0065#, 16#0063#, 16#0074#,
16#0069#, 16#0076#, 16#0065#,
others => 16#0000#),
others => <>);
-- "extension_ReadTimerAction"
MS_0030 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 25,
Length => 25,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0052#, 16#0065#,
16#0061#, 16#0064#, 16#0054#, 16#0069#,
16#006D#, 16#0065#, 16#0072#, 16#0041#,
16#0063#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "base_SendObjectAction"
MS_0031 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0053#, 16#0065#, 16#006E#,
16#0064#, 16#004F#, 16#0062#, 16#006A#,
16#0065#, 16#0063#, 16#0074#, 16#0041#,
16#0063#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "version"
MS_0032 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#0076#, 16#0065#, 16#0072#, 16#0073#,
16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "base_TimeEvent"
MS_0033 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0054#, 16#0069#, 16#006D#,
16#0065#, 16#0045#, 16#0076#, 16#0065#,
16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "Verdict"
MS_0034 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#0056#, 16#0065#, 16#0072#, 16#0064#,
16#0069#, 16#0063#, 16#0074#,
others => 16#0000#),
others => <>);
-- "TestObjective"
MS_0035 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0054#, 16#0065#, 16#0073#, 16#0074#,
16#004F#, 16#0062#, 16#006A#, 16#0065#,
16#0063#, 16#0074#, 16#0069#, 16#0076#,
16#0065#,
others => 16#0000#),
others => <>);
-- "base_Namespace"
MS_0036 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#004E#, 16#0061#, 16#006D#,
16#0065#, 16#0073#, 16#0070#, 16#0061#,
16#0063#, 16#0065#,
others => 16#0000#),
others => <>);
-- "testLevel"
MS_0037 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0074#, 16#0065#, 16#0073#, 16#0074#,
16#004C#, 16#0065#, 16#0076#, 16#0065#,
16#006C#,
others => 16#0000#),
others => <>);
-- "compatibleSUTVariant"
MS_0038 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0063#, 16#006F#, 16#006D#, 16#0070#,
16#0061#, 16#0074#, 16#0069#, 16#0062#,
16#006C#, 16#0065#, 16#0053#, 16#0055#,
16#0054#, 16#0056#, 16#0061#, 16#0072#,
16#0069#, 16#0061#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "base_CombinedFragment"
MS_0039 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0043#, 16#006F#, 16#006D#,
16#0062#, 16#0069#, 16#006E#, 16#0065#,
16#0064#, 16#0046#, 16#0072#, 16#0061#,
16#0067#, 16#006D#, 16#0065#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
-- "repetition"
MS_003A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0072#, 16#0065#, 16#0070#, 16#0065#,
16#0074#, 16#0069#, 16#0074#, 16#0069#,
16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "base_ReadStructuralFeatureAction"
MS_003B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 32,
Length => 32,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0052#, 16#0065#, 16#0061#,
16#0064#, 16#0053#, 16#0074#, 16#0072#,
16#0075#, 16#0063#, 16#0074#, 16#0075#,
16#0072#, 16#0061#, 16#006C#, 16#0046#,
16#0065#, 16#0061#, 16#0074#, 16#0075#,
16#0072#, 16#0065#, 16#0041#, 16#0063#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "base_InvocationAction"
MS_003C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0049#, 16#006E#, 16#0076#,
16#006F#, 16#0063#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0041#,
16#0063#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "extension_SetTimezoneAction"
MS_003D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 27,
Length => 27,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0053#, 16#0065#,
16#0074#, 16#0054#, 16#0069#, 16#006D#,
16#0065#, 16#007A#, 16#006F#, 16#006E#,
16#0065#, 16#0041#, 16#0063#, 16#0074#,
16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "SUT"
MS_003E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0053#, 16#0055#, 16#0054#,
others => 16#0000#),
others => <>);
-- "org.omg.xmi.nsPrefix"
MS_003F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#006F#, 16#0072#, 16#0067#, 16#002E#,
16#006F#, 16#006D#, 16#0067#, 16#002E#,
16#0078#, 16#006D#, 16#0069#, 16#002E#,
16#006E#, 16#0073#, 16#0050#, 16#0072#,
16#0065#, 16#0066#, 16#0069#, 16#0078#,
others => 16#0000#),
others => <>);
-- "extension_SUT"
MS_0040 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0053#, 16#0055#,
16#0054#,
others => 16#0000#),
others => <>);
-- "extension_TestCase"
MS_0041 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0054#, 16#0065#,
16#0073#, 16#0074#, 16#0043#, 16#0061#,
16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- "executedAt"
MS_0042 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0078#, 16#0065#, 16#0063#,
16#0075#, 16#0074#, 16#0065#, 16#0064#,
16#0041#, 16#0074#,
others => 16#0000#),
others => <>);
-- "extension_TimerRunningAction"
MS_0043 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 28,
Length => 28,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0054#, 16#0069#,
16#006D#, 16#0065#, 16#0072#, 16#0052#,
16#0075#, 16#006E#, 16#006E#, 16#0069#,
16#006E#, 16#0067#, 16#0041#, 16#0063#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "verdict"
MS_0044 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#0076#, 16#0065#, 16#0072#, 16#0064#,
16#0069#, 16#0063#, 16#0074#,
others => 16#0000#),
others => <>);
-- "extension_LiteralAnyOrNull"
MS_0045 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 26,
Length => 26,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#004C#, 16#0069#,
16#0074#, 16#0065#, 16#0072#, 16#0061#,
16#006C#, 16#0041#, 16#006E#, 16#0079#,
16#004F#, 16#0072#, 16#004E#, 16#0075#,
16#006C#, 16#006C#,
others => 16#0000#),
others => <>);
-- "priority"
MS_0046 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0070#, 16#0072#, 16#0069#, 16#006F#,
16#0072#, 16#0069#, 16#0074#, 16#0079#,
others => 16#0000#),
others => <>);
-- "extension_DataSelector"
MS_0047 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0044#, 16#0061#,
16#0074#, 16#0061#, 16#0053#, 16#0065#,
16#006C#, 16#0065#, 16#0063#, 16#0074#,
16#006F#, 16#0072#,
others => 16#0000#),
others => <>);
-- "TestSuite"
MS_0048 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0054#, 16#0065#, 16#0073#, 16#0074#,
16#0053#, 16#0075#, 16#0069#, 16#0074#,
16#0065#,
others => 16#0000#),
others => <>);
-- "extension_CodingRule"
MS_0049 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0043#, 16#006F#,
16#0064#, 16#0069#, 16#006E#, 16#0067#,
16#0052#, 16#0075#, 16#006C#, 16#0065#,
others => 16#0000#),
others => <>);
-- "base_Classifier"
MS_004A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 15,
Length => 15,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0043#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0069#, 16#0066#,
16#0069#, 16#0065#, 16#0072#,
others => 16#0000#),
others => <>);
-- "verdictReason"
MS_004B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0076#, 16#0065#, 16#0072#, 16#0064#,
16#0069#, 16#0063#, 16#0074#, 16#0052#,
16#0065#, 16#0061#, 16#0073#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "extension_DataPartition"
MS_004C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 23,
Length => 23,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0044#, 16#0061#,
16#0074#, 16#0061#, 16#0050#, 16#0061#,
16#0072#, 16#0074#, 16#0069#, 16#0074#,
16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "GetTimezoneAction"
MS_004D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0047#, 16#0065#, 16#0074#, 16#0054#,
16#0069#, 16#006D#, 16#0065#, 16#007A#,
16#006F#, 16#006E#, 16#0065#, 16#0041#,
16#0063#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "TestComponent"
MS_004E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0054#, 16#0065#, 16#0073#, 16#0074#,
16#0043#, 16#006F#, 16#006D#, 16#0070#,
16#006F#, 16#006E#, 16#0065#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
-- "extension_TestLogApplication"
MS_004F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 28,
Length => 28,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0054#, 16#0065#,
16#0073#, 16#0074#, 16#004C#, 16#006F#,
16#0067#, 16#0041#, 16#0070#, 16#0070#,
16#006C#, 16#0069#, 16#0063#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "LiteralAnyOrNull"
MS_0050 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#004C#, 16#0069#, 16#0074#, 16#0065#,
16#0072#, 16#0061#, 16#006C#, 16#0041#,
16#006E#, 16#0079#, 16#004F#, 16#0072#,
16#004E#, 16#0075#, 16#006C#, 16#006C#,
others => 16#0000#),
others => <>);
-- "extension_TestComponent"
MS_0051 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 23,
Length => 23,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0054#, 16#0065#,
16#0073#, 16#0074#, 16#0043#, 16#006F#,
16#006D#, 16#0070#, 16#006F#, 16#006E#,
16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "Duration"
MS_0052 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0044#, 16#0075#, 16#0072#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "Timezone"
MS_0053 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0054#, 16#0069#, 16#006D#, 16#0065#,
16#007A#, 16#006F#, 16#006E#, 16#0065#,
others => 16#0000#),
others => <>);
-- "StopTimerAction"
MS_0054 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 15,
Length => 15,
Value =>
(16#0053#, 16#0074#, 16#006F#, 16#0070#,
16#0054#, 16#0069#, 16#006D#, 16#0065#,
16#0072#, 16#0041#, 16#0063#, 16#0074#,
16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "TimeOut"
MS_0055 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#0054#, 16#0069#, 16#006D#, 16#0065#,
16#004F#, 16#0075#, 16#0074#,
others => 16#0000#),
others => <>);
-- "coding"
MS_0056 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#006F#, 16#0064#, 16#0069#,
16#006E#, 16#0067#,
others => 16#0000#),
others => <>);
-- "DefaultApplication"
MS_0057 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0044#, 16#0065#, 16#0066#, 16#0061#,
16#0075#, 16#006C#, 16#0074#, 16#0041#,
16#0070#, 16#0070#, 16#006C#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "ManagedElement"
MS_0058 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#004D#, 16#0061#, 16#006E#, 16#0061#,
16#0067#, 16#0065#, 16#0064#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "base_Operation"
MS_0059 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#004F#, 16#0070#, 16#0065#,
16#0072#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "TimeOutAction"
MS_005A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0054#, 16#0069#, 16#006D#, 16#0065#,
16#004F#, 16#0075#, 16#0074#, 16#0041#,
16#0063#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "base_Behavior"
MS_005B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0042#, 16#0065#, 16#0068#,
16#0061#, 16#0076#, 16#0069#, 16#006F#,
16#0072#,
others => 16#0000#),
others => <>);
-- "ValidationAction"
MS_005C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0056#, 16#0061#, 16#006C#, 16#0069#,
16#0064#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0041#, 16#0063#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "sutVersion"
MS_005D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0073#, 16#0075#, 16#0074#, 16#0056#,
16#0065#, 16#0072#, 16#0073#, 16#0069#,
16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "base_Message"
MS_005E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#004D#, 16#0065#, 16#0073#,
16#0073#, 16#0061#, 16#0067#, 16#0065#,
others => 16#0000#),
others => <>);
-- "extension_DataPool"
MS_005F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0044#, 16#0061#,
16#0074#, 16#0061#, 16#0050#, 16#006F#,
16#006F#, 16#006C#,
others => 16#0000#),
others => <>);
-- "FinishAction"
MS_0060 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0046#, 16#0069#, 16#006E#, 16#0069#,
16#0073#, 16#0068#, 16#0041#, 16#0063#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "DetermAlt"
MS_0061 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0044#, 16#0065#, 16#0074#, 16#0065#,
16#0072#, 16#006D#, 16#0041#, 16#006C#,
16#0074#,
others => 16#0000#),
others => <>);
-- "StartTimerAction"
MS_0062 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0053#, 16#0074#, 16#0061#, 16#0072#,
16#0074#, 16#0054#, 16#0069#, 16#006D#,
16#0065#, 16#0072#, 16#0041#, 16#0063#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "fail"
MS_0063 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0066#, 16#0061#, 16#0069#, 16#006C#,
others => 16#0000#),
others => <>);
-- "extension_TimeOutMessage"
MS_0064 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 24,
Length => 24,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0073#, 16#0069#, 16#006F#,
16#006E#, 16#005F#, 16#0054#, 16#0069#,
16#006D#, 16#0065#, 16#004F#, 16#0075#,
16#0074#, 16#004D#, 16#0065#, 16#0073#,
16#0073#, 16#0061#, 16#0067#, 16#0065#,
others => 16#0000#),
others => <>);
-- "DataSelector"
MS_0065 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0044#, 16#0061#, 16#0074#, 16#0061#,
16#0053#, 16#0065#, 16#006C#, 16#0065#,
16#0063#, 16#0074#, 16#006F#, 16#0072#,
others => 16#0000#),
others => <>);
-- "base_LiteralSpecification"
MS_0066 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 25,
Length => 25,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#004C#, 16#0069#, 16#0074#,
16#0065#, 16#0072#, 16#0061#, 16#006C#,
16#0053#, 16#0070#, 16#0065#, 16#0063#,
16#0069#, 16#0066#, 16#0069#, 16#0063#,
16#0061#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "TestContext"
MS_0067 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0054#, 16#0065#, 16#0073#, 16#0074#,
16#0043#, 16#006F#, 16#006E#, 16#0074#,
16#0065#, 16#0078#, 16#0074#,
others => 16#0000#),
others => <>);
-- "TimerRunningAction"
MS_0068 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0054#, 16#0069#, 16#006D#, 16#0065#,
16#0072#, 16#0052#, 16#0075#, 16#006E#,
16#006E#, 16#0069#, 16#006E#, 16#0067#,
16#0041#, 16#0063#, 16#0074#, 16#0069#,
16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "description"
MS_0069 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0064#, 16#0065#, 16#0073#, 16#0063#,
16#0072#, 16#0069#, 16#0070#, 16#0074#,
16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "base_Dependency"
MS_006A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 15,
Length => 15,
Value =>
(16#0062#, 16#0061#, 16#0073#, 16#0065#,
16#005F#, 16#0044#, 16#0065#, 16#0070#,
16#0065#, 16#006E#, 16#0064#, 16#0065#,
16#006E#, 16#0063#, 16#0079#,
others => 16#0000#),
others => <>);
-- "utp"
MS_006B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0075#, 16#0074#, 16#0070#,
others => 16#0000#),
others => <>);
-- "TestLog"
MS_006C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#0054#, 16#0065#, 16#0073#, 16#0074#,
16#004C#, 16#006F#, 16#0067#,
others => 16#0000#),
others => <>);
-- "none"
MS_006D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#006E#, 16#006F#, 16#006E#, 16#0065#,
others => 16#0000#),
others => <>);
end AMF.Internals.Tables.Utp_String_Data_00;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . C G I --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-2005, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is a package to interface a GNAT program with a Web server via the
-- Common Gateway Interface (CGI).
-- Other related packages are:
-- GNAT.CGI.Cookie which deal with Web HTTP Cookies.
-- GNAT.CGI.Debug which output complete CGI runtime environment
-- Basically this package parse the CGI parameter which are a set of key/value
-- pairs. It builds a table whose index is the key and provides some services
-- to deal with this table.
-- Example:
-- Consider the following simple HTML form to capture a client name:
-- <!DOCTYPE HTML PUBLIC "-//W3C//DTD W3 HTML 3.2//EN">
-- <html>
-- <head>
-- <title>My Web Page</title>
-- </head>
-- <body>
-- <form action="/cgi-bin/new_client" method="POST">
-- <input type=text name=client_name>
-- <input type=submit name="Enter">
-- </form>
-- </body>
-- </html>
-- The following program will retrieve the client's name:
-- with GNAT.CGI;
-- procedure New_Client is
-- use GNAT;
-- procedure Add_Client_To_Database (Name : in String) is
-- begin
-- ...
-- end Add_Client_To_Database;
-- begin
-- -- Check that we have 2 arguments (there is two inputs tag in
-- -- the HTML form) and that one of them is called "client_name".
-- if CGI.Argument_Count = 2
-- and the CGI.Key_Exists ("client_name")
-- then
-- Add_Client_To_Database (CGI.Value ("client_name"));
-- end if;
-- ...
-- CGI.Put_Header;
-- Text_IO.Put_Line ("<html><body>< ... Ok ... >");
-- exception
-- when CGI.Data_Error =>
-- CGI.Put_Header ("Location: /htdocs/error.html");
-- -- This returns the address of a Web page to be displayed
-- -- using a "Location:" header style.
-- end New_Client;
-- Note that the names in this package interface have been designed so that
-- they read nicely with the CGI prefix. The recommended style is to avoid
-- a use clause for GNAT.CGI, but to include a use clause for GNAT.
-- This package builds up a table of CGI parameters whose memory is not
-- released. A CGI program is expected to be a short lived program and
-- so it is adequate to have the underlying OS free the program on exit.
package GNAT.CGI is
Data_Error : exception;
-- This is raised when there is a problem with the CGI protocol. Either
-- the data could not be retrieved or the CGI environment is invalid.
--
-- The package will initialize itself by parsing the runtime CGI
-- environment during elaboration but we do not want to raise an
-- exception at this time, so the exception Data_Error is deferred
-- and will be raised when calling any services below (except for Ok).
Parameter_Not_Found : exception;
-- This exception is raised when a specific parameter is not found
Default_Header : constant String := "Content-type: text/html";
-- This is the default header returned by Put_Header. If the CGI program
-- returned data is not an HTML page, this header must be change to a
-- valid MIME type.
type Method_Type is (Get, Post);
-- The method used to pass parameter from the Web client to the
-- server. With the GET method parameters are passed via the command
-- line, with the POST method parameters are passed via environment
-- variables. Others methods are not supported by this implementation.
type Metavariable_Name is
(Auth_Type,
Content_Length,
Content_Type,
Document_Root, -- Web server dependent
Gateway_Interface,
HTTP_Accept,
HTTP_Accept_Encoding,
HTTP_Accept_Language,
HTTP_Connection,
HTTP_Cookie,
HTTP_Extension,
HTTP_From,
HTTP_Host,
HTTP_Referer,
HTTP_User_Agent,
Path,
Path_Info,
Path_Translated,
Query_String,
Remote_Addr,
Remote_Host,
Remote_Port, -- Web server dependent
Remote_Ident,
Remote_User,
Request_Method,
Request_URI, -- Web server dependent
Script_Filename, -- Web server dependent
Script_Name,
Server_Addr, -- Web server dependent
Server_Admin, -- Web server dependent
Server_Name,
Server_Port,
Server_Protocol,
Server_Signature, -- Web server dependent
Server_Software);
-- CGI metavariables that are set by the Web server during program
-- execution. All these variables are part of the restricted CGI runtime
-- environment and can be read using Metavariable service. The detailed
-- meanings of these metavariables are out of the scope of this
-- description. Please refer to http://www.w3.org/CGI/ for a description
-- of the CGI specification. Some metavariables are Web server dependent
-- and are not described in the cited document.
procedure Put_Header
(Header : String := Default_Header;
Force : Boolean := False);
-- Output standard CGI header by default. The header string is followed by
-- an empty line. This header must be the first answer sent back to the
-- server. Do nothing if this function has already been called and Force
-- is False.
function Ok return Boolean;
-- Returns True if the CGI environment is valid and False otherwise.
-- Every service used when the CGI environment is not valid will raise
-- the exception Data_Error.
function Method return Method_Type;
-- Returns the method used to call the CGI
function Metavariable
(Name : Metavariable_Name;
Required : Boolean := False) return String;
-- Returns parameter Name value. Returns the null string if Name
-- environment variable is not defined or raises Data_Error if
-- Required is set to True.
function Metavariable_Exists (Name : Metavariable_Name) return Boolean;
-- Returns True if the environment variable Name is defined in
-- the CGI runtime environment and False otherwise.
function URL return String;
-- Returns the URL used to call this script without the parameters.
-- The URL form is: http://<server_name>[:<server_port>]<script_name>
function Argument_Count return Natural;
-- Returns the number of parameters passed to the client. This is the
-- number of input tags in a form or the number of parameters passed to
-- the CGI via the command line.
---------------------------------------------------
-- Services to retrieve key/value CGI parameters --
---------------------------------------------------
function Value
(Key : String;
Required : Boolean := False) return String;
-- Returns the parameter value associated to the parameter named Key.
-- If parameter does not exist, returns an empty string if Required
-- is False and raises the exception Parameter_Not_Found otherwise.
function Value (Position : Positive) return String;
-- Returns the parameter value associated with the CGI parameter number
-- Position. Raises Parameter_Not_Found if there is no such parameter
-- (i.e. Position > Argument_Count)
function Key_Exists (Key : String) return Boolean;
-- Returns True if the parameter named Key exists and False otherwise
function Key (Position : Positive) return String;
-- Returns the parameter key associated with the CGI parameter number
-- Position. Raises the exception Parameter_Not_Found if there is no
-- such parameter (i.e. Position > Argument_Count)
generic
with procedure
Action
(Key : String;
Value : String;
Position : Positive;
Quit : in out Boolean);
procedure For_Every_Parameter;
-- Iterate through all existing key/value pairs and call the Action
-- supplied procedure. The Key and Value are set appropriately, Position
-- is the parameter order in the list, Quit is set to True by default.
-- Quit can be set to False to control the iterator termination.
private
function Decode (S : String) return String;
-- Decode Web string S. A string when passed to a CGI is encoded,
-- this function will decode the string to return the original
-- string's content. Every triplet of the form %HH (where H is an
-- hexadecimal number) is translated into the character such that:
-- Hex (Character'Pos (C)) = HH.
end GNAT.CGI;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 9 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 49
package System.Pack_49 is
pragma Preelaborate;
Bits : constant := 49;
type Bits_49 is mod 2 ** Bits;
for Bits_49'Size use Bits;
-- In all subprograms below, Rev_SSO is set True if the array has the
-- non-default scalar storage order.
function Get_49
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_49 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_49
(Arr : System.Address;
N : Natural;
E : Bits_49;
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.
end System.Pack_49;
|
--
-- Copyright (C) 2021, AdaCore
--
pragma Style_Checks (Off);
-- This spec has been automatically generated from STM32G474xx.svd
with System;
package Interfaces.STM32.GPIO is
pragma Preelaborate;
pragma No_Elaboration_Code_All;
---------------
-- Registers --
---------------
-- MODER array element
subtype MODER_Element is Interfaces.STM32.UInt2;
-- MODER array
type MODER_Field_Array is array (0 .. 15) of MODER_Element
with Component_Size => 2, Size => 32;
-- GPIO port mode register
type MODER_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- MODER as a value
Val : Interfaces.STM32.UInt32;
when True =>
-- MODER as an array
Arr : MODER_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for MODER_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- OTYPER_OT array element
subtype OTYPER_OT_Element is Interfaces.STM32.Bit;
-- OTYPER_OT array
type OTYPER_OT_Field_Array is array (0 .. 15) of OTYPER_OT_Element
with Component_Size => 1, Size => 16;
-- Type definition for OTYPER_OT
type OTYPER_OT_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OT as a value
Val : Interfaces.STM32.UInt16;
when True =>
-- OT as an array
Arr : OTYPER_OT_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for OTYPER_OT_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port output type register
type OTYPER_Register is record
-- Port x configuration bits (y = 0..15)
OT : OTYPER_OT_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : Interfaces.STM32.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OTYPER_Register use record
OT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- OSPEEDR array element
subtype OSPEEDR_Element is Interfaces.STM32.UInt2;
-- OSPEEDR array
type OSPEEDR_Field_Array is array (0 .. 15) of OSPEEDR_Element
with Component_Size => 2, Size => 32;
-- GPIO port output speed register
type OSPEEDR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OSPEEDR as a value
Val : Interfaces.STM32.UInt32;
when True =>
-- OSPEEDR as an array
Arr : OSPEEDR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OSPEEDR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- PUPDR array element
subtype PUPDR_Element is Interfaces.STM32.UInt2;
-- PUPDR array
type PUPDR_Field_Array is array (0 .. 15) of PUPDR_Element
with Component_Size => 2, Size => 32;
-- GPIO port pull-up/pull-down register
type PUPDR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- PUPDR as a value
Val : Interfaces.STM32.UInt32;
when True =>
-- PUPDR as an array
Arr : PUPDR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for PUPDR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- IDR array element
subtype IDR_Element is Interfaces.STM32.Bit;
-- IDR array
type IDR_Field_Array is array (0 .. 15) of IDR_Element
with Component_Size => 1, Size => 16;
-- Type definition for IDR
type IDR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- IDR as a value
Val : Interfaces.STM32.UInt16;
when True =>
-- IDR as an array
Arr : IDR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for IDR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port input data register
type IDR_Register is record
-- Read-only. Port input data (y = 0..15)
IDR : IDR_Field;
-- unspecified
Reserved_16_31 : Interfaces.STM32.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for IDR_Register use record
IDR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- ODR array element
subtype ODR_Element is Interfaces.STM32.Bit;
-- ODR array
type ODR_Field_Array is array (0 .. 15) of ODR_Element
with Component_Size => 1, Size => 16;
-- Type definition for ODR
type ODR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- ODR as a value
Val : Interfaces.STM32.UInt16;
when True =>
-- ODR as an array
Arr : ODR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for ODR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port output data register
type ODR_Register is record
-- Port output data (y = 0..15)
ODR : ODR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : Interfaces.STM32.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ODR_Register use record
ODR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- BSRR_BS array element
subtype BSRR_BS_Element is Interfaces.STM32.Bit;
-- BSRR_BS array
type BSRR_BS_Field_Array is array (0 .. 15) of BSRR_BS_Element
with Component_Size => 1, Size => 16;
-- Type definition for BSRR_BS
type BSRR_BS_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BS as a value
Val : Interfaces.STM32.UInt16;
when True =>
-- BS as an array
Arr : BSRR_BS_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BSRR_BS_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- BSRR_BR array element
subtype BSRR_BR_Element is Interfaces.STM32.Bit;
-- BSRR_BR array
type BSRR_BR_Field_Array is array (0 .. 15) of BSRR_BR_Element
with Component_Size => 1, Size => 16;
-- Type definition for BSRR_BR
type BSRR_BR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BR as a value
Val : Interfaces.STM32.UInt16;
when True =>
-- BR as an array
Arr : BSRR_BR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BSRR_BR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port bit set/reset register
type BSRR_Register is record
-- Write-only. Port x set bit y (y= 0..15)
BS : BSRR_BS_Field := (As_Array => False, Val => 16#0#);
-- Write-only. Port x set bit y (y= 0..15)
BR : BSRR_BR_Field := (As_Array => False, Val => 16#0#);
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for BSRR_Register use record
BS at 0 range 0 .. 15;
BR at 0 range 16 .. 31;
end record;
-- LCKR_LCK array element
subtype LCKR_LCK_Element is Interfaces.STM32.Bit;
-- LCKR_LCK array
type LCKR_LCK_Field_Array is array (0 .. 15) of LCKR_LCK_Element
with Component_Size => 1, Size => 16;
-- Type definition for LCKR_LCK
type LCKR_LCK_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- LCK as a value
Val : Interfaces.STM32.UInt16;
when True =>
-- LCK as an array
Arr : LCKR_LCK_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for LCKR_LCK_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
subtype LCKR_LCKK_Field is Interfaces.STM32.Bit;
-- GPIO port configuration lock register
type LCKR_Register is record
-- Port x lock bit y (y= 0..15)
LCK : LCKR_LCK_Field := (As_Array => False, Val => 16#0#);
-- Port x lock bit y (y= 0..15)
LCKK : LCKR_LCKK_Field := 16#0#;
-- unspecified
Reserved_17_31 : Interfaces.STM32.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for LCKR_Register use record
LCK at 0 range 0 .. 15;
LCKK at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- AFRL array element
subtype AFRL_Element is Interfaces.STM32.UInt4;
-- AFRL array
type AFRL_Field_Array is array (0 .. 7) of AFRL_Element
with Component_Size => 4, Size => 32;
-- GPIO alternate function low register
type AFRL_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AFRL as a value
Val : Interfaces.STM32.UInt32;
when True =>
-- AFRL as an array
Arr : AFRL_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for AFRL_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- AFRH array element
subtype AFRH_Element is Interfaces.STM32.UInt4;
-- AFRH array
type AFRH_Field_Array is array (8 .. 15) of AFRH_Element
with Component_Size => 4, Size => 32;
-- GPIO alternate function high register
type AFRH_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AFRH as a value
Val : Interfaces.STM32.UInt32;
when True =>
-- AFRH as an array
Arr : AFRH_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for AFRH_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- BRR_BR array element
subtype BRR_BR_Element is Interfaces.STM32.Bit;
-- BRR_BR array
type BRR_BR_Field_Array is array (0 .. 15) of BRR_BR_Element
with Component_Size => 1, Size => 16;
-- Type definition for BRR_BR
type BRR_BR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BR as a value
Val : Interfaces.STM32.UInt16;
when True =>
-- BR as an array
Arr : BRR_BR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BRR_BR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port bit reset register
type BRR_Register is record
-- Write-only. Port Reset bit
BR : BRR_BR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : Interfaces.STM32.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for BRR_Register use record
BR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- General-purpose I/Os
type GPIO_Peripheral is record
-- GPIO port mode register
MODER : aliased MODER_Register;
-- GPIO port output type register
OTYPER : aliased OTYPER_Register;
-- GPIO port output speed register
OSPEEDR : aliased OSPEEDR_Register;
-- GPIO port pull-up/pull-down register
PUPDR : aliased PUPDR_Register;
-- GPIO port input data register
IDR : aliased IDR_Register;
-- GPIO port output data register
ODR : aliased ODR_Register;
-- GPIO port bit set/reset register
BSRR : aliased BSRR_Register;
-- GPIO port configuration lock register
LCKR : aliased LCKR_Register;
-- GPIO alternate function low register
AFRL : aliased AFRL_Register;
-- GPIO alternate function high register
AFRH : aliased AFRH_Register;
-- GPIO port bit reset register
BRR : aliased BRR_Register;
end record
with Volatile;
for GPIO_Peripheral use record
MODER at 16#0# range 0 .. 31;
OTYPER at 16#4# range 0 .. 31;
OSPEEDR at 16#8# range 0 .. 31;
PUPDR at 16#C# range 0 .. 31;
IDR at 16#10# range 0 .. 31;
ODR at 16#14# range 0 .. 31;
BSRR at 16#18# range 0 .. 31;
LCKR at 16#1C# range 0 .. 31;
AFRL at 16#20# range 0 .. 31;
AFRH at 16#24# range 0 .. 31;
BRR at 16#28# range 0 .. 31;
end record;
-- General-purpose I/Os
GPIOA_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOA_Base;
-- General-purpose I/Os
GPIOB_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOB_Base;
-- General-purpose I/Os
GPIOC_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOC_Base;
-- General-purpose I/Os
GPIOD_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOD_Base;
-- General-purpose I/Os
GPIOE_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOE_Base;
-- General-purpose I/Os
GPIOF_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOF_Base;
-- General-purpose I/Os
GPIOG_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOG_Base;
end Interfaces.STM32.GPIO;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>xFGradientX3x3_0_0_s</name>
<ret_bitwidth>8</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>t0_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/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</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>t2_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>m0_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>m2_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>b0_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>b2_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>31</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>b2_V_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>40</item>
<item>41</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>b0_V_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>42</item>
<item>43</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>m2_V_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>44</item>
<item>45</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>m0_V_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>t2_V_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>48</item>
<item>49</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>t0_V_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>50</item>
<item>51</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>M00</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>C:/Users/yakup/workspace/bitirme_v4/Release</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>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>68</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>M00</originalName>
<rtlName>M00_fu_70_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>53</item>
<item>54</item>
<item>56</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>M00_cast</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>68</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>M00_cast_fu_78_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>M01</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>M01</originalName>
<rtlName>M01_fu_82_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>58</item>
<item>59</item>
<item>60</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>M01_cast</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>M01_cast_fu_90_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>lhs_V</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>lhs.V</originalName>
<rtlName>lhs_V_fu_94_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>rhs_V</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>rhs.V</originalName>
<rtlName>rhs_V_fu_98_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>r_V</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName>r_V_fu_102_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>65</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>1.91</m_delay>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>A00_cast</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>A00_cast_fu_128_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>lhs_V_2</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>lhs.V</originalName>
<rtlName>lhs_V_2_fu_108_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>rhs_V_2</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>rhs.V</originalName>
<rtlName>rhs_V_2_fu_112_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>r_V_2</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName>r_V_2_fu_116_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>1.91</m_delay>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>S00_cast</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>S00_cast_fu_131_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>out_pix</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>out_pix_fu_122_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>72</item>
<item>73</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>1.82</m_delay>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>out_pix_cast</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>out_pix_cast_fu_134_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>out_pix_3</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>out_pix_3_fu_137_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>75</item>
<item>76</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>out_pix_4</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>out_pix</originalName>
<rtlName>out_pix_4_fu_143_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>77</item>
<item>78</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>3.75</m_delay>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>g_x_V</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>g_x.V</originalName>
<rtlName>g_x_V_fu_149_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp_8</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_8_fu_153_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>81</item>
<item>82</item>
<item>84</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_9</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_9_fu_161_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>86</item>
<item>87</item>
<item>89</item>
<item>90</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>icmp</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>icmp_fu_171_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>93</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>1.13</m_delay>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>not_tmp_s</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>not_tmp_s_fu_177_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>94</item>
<item>96</item>
</oprand_edges>
<opcode>xor</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>p_cast</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_cast_fu_183_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>97</item>
<item>99</item>
<item>101</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_fu_191_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>102</item>
<item>103</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>agg_result_V_1</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>ap_return</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>104</item>
<item>105</item>
<item>106</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>1.24</m_delay>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name/>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>../../..</fileDirectory>
<lineNumber>91</lineNumber>
<contextFuncName>xFGradientX3x3&lt;0, 0&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>xFGradientX3x3&lt;0, 0&gt;</second>
</first>
<second>91</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_38">
<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>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_39">
<Value>
<Obj>
<type>2</type>
<id>83</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>10</content>
</item>
<item class_id_reference="16" object_id="_40">
<Value>
<Obj>
<type>2</type>
<id>88</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_41">
<Value>
<Obj>
<type>2</type>
<id>92</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_42">
<Value>
<Obj>
<type>2</type>
<id>95</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_43">
<Value>
<Obj>
<type>2</type>
<id>98</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>255</content>
</item>
<item class_id_reference="16" object_id="_44">
<Value>
<Obj>
<type>2</type>
<id>100</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</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="_45">
<Obj>
<type>3</type>
<id>38</id>
<name>xFGradientX3x3<0, 0></name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>31</count>
<item_version>0</item_version>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>48</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_46">
<id>41</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>7</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_47">
<id>43</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_48">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_49">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_50">
<id>49</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_51">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_52">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_53">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_54">
<id>57</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_55">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_56">
<id>60</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_57">
<id>61</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="_58">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_59">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_60">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_61">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_62">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_63">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_64">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_65">
<id>69</id>
<edge_type>1</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="_66">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_67">
<id>71</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="_68">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_69">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_70">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_71">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_72">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_73">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_74">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_75">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_76">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_77">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_78">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_79">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_80">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_81">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_82">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_83">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_84">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_85">
<id>97</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="_86">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_87">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_89">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_90">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_91">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</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="_94">
<mId>1</mId>
<mTag>xFGradientX3x3<0, 0></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>38</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>1</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="_95">
<states 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="_96">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>17</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_97">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_98">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_99">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_100">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_101">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_102">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_103">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_104">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_105">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_106">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_107">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_108">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_109">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_110">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_111">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_112">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_113">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_114">
<id>2</id>
<operations>
<count>14</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_115">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_116">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_117">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_118">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_119">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_120">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_121">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_122">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_123">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_124">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_125">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_126">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_127">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_128">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_129">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>6</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>
</transitions>
</fsm>
<res class_id="34" tracking_level="1" version="0" object_id="_130">
<dp_component_resource class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>10</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>ap_return ( select ) </first>
<second class_id="37" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>(2P2)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>icmp_fu_171_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>3</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>not_tmp_s_fu_177_p2 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>out_pix_3_fu_137_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>11</second>
</item>
<item>
<first>(1P1)</first>
<second>11</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>out_pix_4_fu_143_p2 ( - ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>11</second>
</item>
<item>
<first>(1P1)</first>
<second>11</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>out_pix_fu_122_p2 ( - ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>10</second>
</item>
<item>
<first>(1P1)</first>
<second>10</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>14</second>
</item>
</second>
</item>
<item>
<first>p_cast_fu_183_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>(2P2)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>r_V_2_fu_116_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>9</second>
</item>
<item>
<first>(1P1)</first>
<second>9</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>r_V_fu_102_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>9</second>
</item>
<item>
<first>(1P1)</first>
<second>9</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>tmp_fu_191_p2 ( 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>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>0</count>
<item_version>0</item_version>
</dp_multiplexer_resource>
<dp_register_resource>
<count>3</count>
<item_version>0</item_version>
<item>
<first>out_pix_reg_215</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>10</second>
</item>
<item>
<first>(Consts)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>r_V_2_reg_210</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>9</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>r_V_reg_205</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>9</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>9</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_dsp_resource>
<count>0</count>
<item_version>0</item_version>
</dp_dsp_resource>
<dp_component_map class_id="39" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>10</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>ap_return ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>icmp_fu_171_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>not_tmp_s_fu_177_p2 ( xor ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>out_pix_3_fu_137_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>out_pix_4_fu_143_p2 ( - ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>out_pix_fu_122_p2 ( - ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>p_cast_fu_183_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>r_V_2_fu_116_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>r_V_fu_102_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_fu_191_p2 ( or ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="41" tracking_level="0" version="0">
<count>31</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>7</first>
<second class_id="43" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="44" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="45" tracking_level="0" version="0">
<first>38</first>
<second class_id="46" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="47" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="1" version="0" object_id="_131">
<region_name>xFGradientX3x3<0, 0></region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>38</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="49" tracking_level="0" version="0">
<count>30</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="0" version="0">
<first>34</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>70</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>78</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>82</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>137</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>143</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>149</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>161</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>177</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>183</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="52" tracking_level="0" version="0">
<count>24</count>
<item_version>0</item_version>
<item class_id="53" tracking_level="0" version="0">
<first>A00_cast_fu_128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>M00_cast_fu_78</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>M00_fu_70</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>M01_cast_fu_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>M01_fu_82</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>S00_cast_fu_131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>agg_result_V_1_fu_197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>g_x_V_fu_149</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>icmp_fu_171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>lhs_V_2_fu_108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>lhs_V_fu_94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>not_tmp_s_fu_177</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>out_pix_3_fu_137</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>out_pix_4_fu_143</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>out_pix_cast_fu_134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>out_pix_fu_122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>p_cast_fu_183</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>r_V_2_fu_116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>r_V_fu_102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>rhs_V_2_fu_112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>rhs_V_fu_98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_8_fu_153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>tmp_9_fu_161</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_fu_191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>6</count>
<item_version>0</item_version>
<item>
<first>b0_V_read_read_fu_40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>b2_V_read_read_fu_34</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>m0_V_read_read_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>m2_V_read_read_fu_46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>t0_V_read_read_fu_64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>t2_V_read_read_fu_58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>1</count>
<item_version>0</item_version>
<item>
<first>ap_return</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
</return_ports>
<dp_mem_port_nodes class_id="54" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>3</count>
<item_version>0</item_version>
<item>
<first>205</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>215</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>3</count>
<item_version>0</item_version>
<item>
<first>out_pix_reg_215</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>r_V_2_reg_210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>r_V_reg_205</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</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="55" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first>b0_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</second>
</item>
<item>
<first>b2_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
</second>
</item>
<item>
<first>m0_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</second>
</item>
<item>
<first>m2_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</second>
</item>
<item>
<first>t0_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</second>
</item>
<item>
<first>t2_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="57" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
------------------------------------------------------------------------------
-- --
-- GNAT SYSTEM UTILITIES --
-- --
-- S P A R K _ X R E F S _ T E S T --
-- --
-- B o d y --
-- --
-- Copyright (C) 2011-2013, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This utility program is used to test proper operation of the
-- Get_SPARK_Xrefs and Put_SPARK_Xrefs units. To run it, compile any source
-- file with switch -gnatd.E or -gnatd.F to get an ALI file file.ALI
-- containing SPARK information. Then run this utility using:
-- spark_xrefs_test file.ali
-- This test will read the SPARK cross-reference information from the ALI
-- file, and use Get_SPARK_Xrefs to store this in binary form in the internal
-- tables in SPARK_Xrefs. Then Put_SPARK_Xrefs is used to write the
-- information from these tables back into text form. This output is compared
-- with the original SPARK cross-reference information in the ALI file and the
-- two should be identical. If not an error message is output.
with Get_SPARK_Xrefs;
with Put_SPARK_Xrefs;
with SPARK_Xrefs; use SPARK_Xrefs;
with Types; use Types;
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Streams; use Ada.Streams;
with Ada.Streams.Stream_IO; use Ada.Streams.Stream_IO;
with Ada.Text_IO;
with GNAT.OS_Lib; use GNAT.OS_Lib;
procedure SPARK_Xrefs_Test is
Infile : File_Type;
Name1 : String_Access;
Outfile_1 : File_Type;
Name2 : String_Access;
Outfile_2 : File_Type;
C : Character;
Stop : exception;
-- Terminate execution
Diff_Exec : constant String_Access := Locate_Exec_On_Path ("diff");
Diff_Result : Integer;
use ASCII;
begin
if Argument_Count /= 1 then
Ada.Text_IO.Put_Line ("Usage: spark_xrefs_test FILE.ali");
raise Stop;
end if;
Name1 := new String'(Argument (1) & ".1");
Name2 := new String'(Argument (1) & ".2");
Open (Infile, In_File, Argument (1));
Create (Outfile_1, Out_File, Name1.all);
Create (Outfile_2, Out_File, Name2.all);
-- Read input file till we get to first 'F' line
Process : declare
Output_Col : Positive := 1;
function Get_Char (F : File_Type) return Character;
-- Read one character from specified file
procedure Put_Char (F : File_Type; C : Character);
-- Write one character to specified file
function Get_Output_Col return Positive;
-- Return current column in output file, where each line starts at
-- column 1 and terminate with LF, and HT is at columns 1, 9, etc.
-- All output is supposed to be carried through Put_Char.
--------------
-- Get_Char --
--------------
function Get_Char (F : File_Type) return Character is
Item : Stream_Element_Array (1 .. 1);
Last : Stream_Element_Offset;
begin
Read (F, Item, Last);
if Last /= 1 then
return Types.EOF;
else
return Character'Val (Item (1));
end if;
end Get_Char;
--------------------
-- Get_Output_Col --
--------------------
function Get_Output_Col return Positive is
begin
return Output_Col;
end Get_Output_Col;
--------------
-- Put_Char --
--------------
procedure Put_Char (F : File_Type; C : Character) is
Item : Stream_Element_Array (1 .. 1);
begin
if C /= CR and then C /= EOF then
if C = LF then
Output_Col := 1;
elsif C = HT then
Output_Col := ((Output_Col + 6) / 8) * 8 + 1;
else
Output_Col := Output_Col + 1;
end if;
Item (1) := Character'Pos (C);
Write (F, Item);
end if;
end Put_Char;
-- Subprograms used by Get_SPARK_Xrefs (these also copy the output to
-- Outfile_1 for later comparison with the output generated by
-- Put_SPARK_Xrefs).
function Getc return Character;
function Nextc return Character;
procedure Skipc;
----------
-- Getc --
----------
function Getc return Character is
C : Character;
begin
C := Get_Char (Infile);
Put_Char (Outfile_1, C);
return C;
end Getc;
-----------
-- Nextc --
-----------
function Nextc return Character is
C : Character;
begin
C := Get_Char (Infile);
if C /= EOF then
Set_Index (Infile, Index (Infile) - 1);
end if;
return C;
end Nextc;
-----------
-- Skipc --
-----------
procedure Skipc is
C : Character;
pragma Unreferenced (C);
begin
C := Getc;
end Skipc;
-- Subprograms used by Put_SPARK_Xrefs, which write information to
-- Outfile_2.
function Write_Info_Col return Positive;
procedure Write_Info_Char (C : Character);
procedure Write_Info_Initiate (Key : Character);
procedure Write_Info_Nat (N : Nat);
procedure Write_Info_Terminate;
--------------------
-- Write_Info_Col --
--------------------
function Write_Info_Col return Positive is
begin
return Get_Output_Col;
end Write_Info_Col;
---------------------
-- Write_Info_Char --
---------------------
procedure Write_Info_Char (C : Character) is
begin
Put_Char (Outfile_2, C);
end Write_Info_Char;
-------------------------
-- Write_Info_Initiate --
-------------------------
procedure Write_Info_Initiate (Key : Character) is
begin
Write_Info_Char (Key);
end Write_Info_Initiate;
--------------------
-- Write_Info_Nat --
--------------------
procedure Write_Info_Nat (N : Nat) is
begin
if N > 9 then
Write_Info_Nat (N / 10);
end if;
Write_Info_Char (Character'Val (48 + N mod 10));
end Write_Info_Nat;
--------------------------
-- Write_Info_Terminate --
--------------------------
procedure Write_Info_Terminate is
begin
Write_Info_Char (LF);
end Write_Info_Terminate;
-- Local instantiations of Put_SPARK_Xrefs and Get_SPARK_Xrefs
procedure Get_SPARK_Xrefs_Info is new Get_SPARK_Xrefs;
procedure Put_SPARK_Xrefs_Info is new Put_SPARK_Xrefs;
-- Start of processing for Process
begin
-- Loop to skip till first 'F' line
loop
C := Get_Char (Infile);
if C = EOF then
raise Stop;
elsif C = LF or else C = CR then
loop
C := Get_Char (Infile);
exit when C /= LF and then C /= CR;
end loop;
exit when C = 'F';
end if;
end loop;
-- Position back to initial 'F' of first 'F' line
Set_Index (Infile, Index (Infile) - 1);
-- Read SPARK cross-reference information to internal SPARK tables, also
-- copying SPARK xrefs info to Outfile_1.
Initialize_SPARK_Tables;
Get_SPARK_Xrefs_Info;
-- Write SPARK cross-reference information from internal SPARK tables to
-- Outfile_2.
Put_SPARK_Xrefs_Info;
-- Junk blank line (see comment at end of Lib.Writ)
Write_Info_Terminate;
-- Flush to disk
Close (Outfile_1);
Close (Outfile_2);
-- Now Outfile_1 and Outfile_2 should be identical
Diff_Result :=
Spawn (Diff_Exec.all,
Argument_String_To_List
("-u " & Name1.all & " " & Name2.all).all);
if Diff_Result /= 0 then
Ada.Text_IO.Put_Line ("diff(1) exit status" & Diff_Result'Img);
end if;
OS_Exit (Diff_Result);
end Process;
exception
when Stop =>
null;
end SPARK_Xrefs_Test;
|
with Ada.Text_IO;
with Ada.Calendar;
with Pendulums;
procedure Main is
package Float_Pendulum is new Pendulums (Float, -9.81);
use Float_Pendulum;
use type Ada.Calendar.Time;
My_Pendulum : Pendulum := New_Pendulum (10.0, 30.0);
Now, Before : Ada.Calendar.Time;
begin
Before := Ada.Calendar.Clock;
loop
Delay 0.1;
Now := Ada.Calendar.Clock;
Update_Pendulum (My_Pendulum, Now - Before);
Before := Now;
-- output positions relative to origin
-- replace with graphical output if wanted
Ada.Text_IO.Put_Line (" X: " & Float'Image (Get_X (My_Pendulum)) &
" Y: " & Float'Image (Get_Y (My_Pendulum)));
end loop;
end Main; |
-----------------------------------------------------------------------
-- util-http-rest -- REST API support
-- Copyright (C) 2012, 2013 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Serialize.IO.JSON;
-- -----------------------
-- Execute an HTTP GET operation on the given <b>URI</b> and parse the JSON response
-- into the target object refered to by <b>Into</b> by using the mapping described
-- in <b>Mapping</b>.
-- -----------------------
procedure Util.Http.Rest.Rest_Get_Vector (URI : in String;
Mapping : in Util.Serialize.Mappers.Mapper_Access;
Path : in String := "";
Into : in Vector_Mapper.Vector_Type_Access) is
Http : Util.Http.Rest.Client;
Reader : Util.Serialize.IO.JSON.Parser;
begin
Reader.Add_Mapping (Path, Mapping.all'Access);
Vector_Mapper.Set_Context (Reader, Into);
Http.Get (URI, Reader);
end Util.Http.Rest.Rest_Get_Vector;
|
package estado_casillero is
type t_estado_casillero is (Limpio,Sucio);
function random_estado return t_estado_casillero;
procedure put_estado_casillero (c : in t_estado_casillero);
end estado_casillero;
|
with Ada.Text_IO;
procedure Hello is
begin
Ada.Text_IO.Put_Line("Hello, world!");
end Hello;
|
with Ada.Text_IO; use Ada.Text_IO;
procedure Day20 is
type Position is record
X : Integer;
Y : Integer;
end record;
function Next_Pos (Pos : Position; Dir : Character) return Position is
begin
case Dir is
when 'N' => return (Pos.X, Pos.Y + 1);
when 'S' => return (Pos.X, Pos.Y - 1);
when 'W' => return (Pos.X - 1, Pos.Y);
when 'E' => return (Pos.X + 1, Pos.Y);
when others =>
raise Constraint_Error with "Invalid direction: " & Dir;
end case;
end Next_Pos;
Grid : array
(Integer range -1000 .. 1000, Integer range -1000 .. 1000) of Natural :=
(0 => (0 => 0,
others => Natural'Last),
others => (others => Natural'Last));
Global_Pos : Position := (0, 0);
procedure Parse (Regex : String; Old_Pos : Position) is
Pos : Position := Old_Pos;
I, J, K : Positive := Regex'First;
Depth : Natural := 0;
begin
while I <= Regex'Last loop
exit when Regex (I) = '(';
declare
New_Pos : constant Position := Next_Pos (Pos, Regex (I));
New_Value : constant Natural := Grid (New_Pos.X, New_Pos.Y);
Old_Value : constant Natural := Grid (Pos.X, Pos.Y);
begin
Pos := New_Pos;
Grid (Pos.X, Pos.Y) := Natural'Min (New_Value, Old_Value + 1);
end;
I := I + 1;
end loop;
Global_Pos := Pos;
if I > Regex'Last then
return;
end if;
J := I + 1;
Depth := 1; -- only reachable if Regex (I) = '('
loop
if Regex (J) = '(' then
Depth := Depth + 1;
elsif Regex (J) = ')' then
Depth := Depth - 1;
end if;
exit when Depth = 0;
J := J + 1;
end loop;
K := I;
loop
declare
Sub_Regex : constant String := Regex (K + 1 .. J - 1);
begin
Depth := 0;
K := Sub_Regex'First;
while K <= Sub_Regex'Last loop
if Sub_Regex (K) = '(' then
Depth := Depth + 1;
elsif Sub_Regex (K) = ')' then
Depth := Depth - 1;
end if;
exit when Depth = 0 and Sub_Regex (K) = '|';
K := K + 1;
end loop;
Parse (Sub_Regex (Sub_Regex'First .. K - 1), Pos);
exit when K > Sub_Regex'Last;
end;
end loop;
if J < Regex'Last then
Parse (Regex (J + 1 .. Regex'Last), Global_Pos);
end if;
end Parse;
File : File_Type;
begin
Open (File, In_File, "input.txt");
declare
Input : constant String := Get_Line (File);
begin
Parse (Input (Input'First + 1 .. Input'Last - 1), (0, 0));
end;
Close (File);
declare
Room_Count : Natural := 0;
Max_Doors : Natural := 0;
begin
for X in Grid'Range (1) loop
for Y in Grid'Range (2) loop
if Grid (X, Y) < Natural'Last then
Max_Doors := Natural'Max (Max_Doors, Grid (X, Y));
if Grid (X, Y) >= 1000 then
Room_Count := Room_Count + 1;
end if;
end if;
end loop;
end loop;
Put_Line ("Part 1 =" & Natural'Image (Max_Doors));
Put_Line ("Part 2 =" & Natural'Image (Room_Count));
end;
end Day20;
|
--------------------------------------------------------------------------------------------------------------------
-- 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.
--------------------------------------------------------------------------------------------------------------------
with Interfaces.C;
with Ada.Unchecked_Conversion;
with SDL.Error;
package body SDL.Video.Textures is
package C renames Interfaces.C;
use type C.int;
use type SDL.C_Pointers.Texture_Pointer;
procedure Destroy (Self : in out Texture) is
procedure SDL_Destroy_Texture (T : in SDL.C_Pointers.Texture_Pointer) with
Import => True,
Convention => C,
External_Name => "SDL_DestroyTexture";
begin
SDL_Destroy_Texture (Self.Internal);
Self.Internal := null;
end Destroy;
function Get_Alpha (Self : in Texture) return SDL.Video.Palettes.Colour_Component is
function SDL_Get_Texture_Alpha_Mod (T : in SDL.C_Pointers.Texture_Pointer;
Alpha : out SDL.Video.Palettes.Colour_Component) return C.int with
Import => True,
Convention => C,
External_Name => "SDL_GetTextureAlphaMod";
Data : SDL.Video.Palettes.Colour_Component;
Result : C.int := SDL_Get_Texture_Alpha_Mod (Self.Internal, Data);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
return Data;
end Get_Alpha;
procedure Set_Alpha (Self : in out Texture; Alpha : in SDL.Video.Palettes.Colour_Component) is
function SDL_Set_Texture_Alpha_Mod (T : in SDL.C_Pointers.Texture_Pointer;
Alpha : in SDL.Video.Palettes.Colour_Component) return C.int with
Import => True,
Convention => C,
External_Name => "SDL_SetTextureAlphaMod";
Result : C.int := SDL_Set_Texture_Alpha_Mod (Self.Internal, Alpha);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
end Set_Alpha;
function Get_Blend_Mode (Self : in Texture) return Blend_Modes is
function SDL_Get_Texture_Blend_Mode (T : in SDL.C_Pointers.Texture_Pointer;
Blend : out Blend_Modes) return C.int with
Import => True,
Convention => C,
External_Name => "SDL_GetTextureBlendMode";
Data : Blend_Modes;
Result : C.int := SDL_Get_Texture_Blend_Mode (Self.Internal, Data);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
return Data;
end Get_Blend_Mode;
procedure Set_Blend_Mode (Self : in out Texture; Mode : in Blend_Modes) is
function SDL_Set_Texture_Blend_Mode (T : in SDL.C_Pointers.Texture_Pointer;
Mode : in Blend_Modes) return C.int with
Import => True,
Convention => C,
External_Name => "SDL_SetTextureBlendMode";
Result : C.int := SDL_Set_Texture_Blend_Mode (Self.Internal, Mode);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
end Set_Blend_Mode;
function Get_Modulate_Colour (Self : in Texture) return SDL.Video.Palettes.RGB_Colour is
function SDL_Get_Texture_Color_Mod (T : in SDL.C_Pointers.Texture_Pointer;
R, G, B : out SDL.Video.Palettes.Colour_Component) return C.int with
Import => True,
Convention => C,
External_Name => "SDL_GetTextureColorMod";
Data : SDL.Video.Palettes.RGB_Colour;
Result : C.int := SDL_Get_Texture_Color_Mod (Self.Internal, Data.Red, Data.Green, Data.Blue);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
return Data;
end Get_Modulate_Colour;
procedure Set_Modulate_Colour (Self : in out Texture; Colour : in SDL.Video.Palettes.RGB_Colour) is
function SDL_Set_Texture_Color_Mod (T : in SDL.C_Pointers.Texture_Pointer;
R, G, B : in SDL.Video.Palettes.Colour_Component) return C.int with
Import => True,
Convention => C,
External_Name => "SDL_SetTextureColorMod";
Result : C.int := SDL_Set_Texture_Color_Mod (Self.Internal, Colour.Red, Colour.Green, Colour.Blue);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
end Set_Modulate_Colour;
-- procedure Lock_Texture (Self : in out Texture;
-- Pixels : out SDL.Video.Pixels.Pixel_ARGB_8888_Array_Access) is
-- type Int_Ptr is access C.int with
-- Convention => C;
--
-- function SDL_Lock_Texture (T : in System.Address;
-- Area : in System.Address;
-- Pixels : out SDL.Video.Pixels.C_Pixel_Ptr;
-- Pitch : out Int_Ptr) return C.int with
-- Import => True,
-- Convention => C,
-- External_Name => "SDL_LockTexture";
--
-- C_Pixels : SDL.Video.Pixels.C_Pixel_Ptr := null;
-- C_Pitch : Int_Ptr := null;
-- Result : C.int := SDL_Lock_Texture (Self.Internal, System.Null_Address, C_Pixels, C_Pitch);
-- begin
-- if Result /= Success then
-- raise Texture_Error with SDL.Error.Get;
-- end if;
--
-- Self.Locked := True;
--
-- Pixels := SDL.Video.Pixels.Create (C_Pixels, C_Pitch.all, Self.Size);
-- end Lock_Texture;
procedure Lock (Self : in out Texture;
Pixels : out Pixel_Pointer_Type) is
function SDL_Lock_Texture (T : in SDL.C_Pointers.Texture_Pointer;
Area : in System.Address;
Pixels : out Pixel_Pointer_Type;
Pitch : out SDL.Video.Pixels.Pitches) return C.int with
Import => True,
Convention => C,
External_Name => "SDL_LockTexture";
-- Don't care about Pitch value.
Dummy : SDL.Video.Pixels.Pitches := 0;
Result : C.int := SDL_Lock_Texture (Self.Internal, System.Null_Address, Pixels, Dummy);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
Self.Locked := True;
end Lock;
procedure Lock_Area (Self : in out Texture;
Area : in SDL.Video.Rectangles.Rectangle;
Pixels : out Pixel_Pointer_Type;
Pitch : out SDL.Video.Pixels.Pitches) is
function SDL_Lock_Texture (T : in SDL.C_Pointers.Texture_Pointer;
Area : in SDL.Video.Rectangles.Rectangle;
Pixels : out Pixel_Pointer_Type;
Pitch : out SDL.Video.Pixels.Pitches) return C.int with
Import => True,
Convention => C,
External_Name => "SDL_LockTexture";
Result : C.int := SDL_Lock_Texture (Self.Internal, Area, Pixels, Pitch);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
Self.Locked := True;
end Lock_Area;
procedure Unlock (Self : in out Texture) is
procedure SDL_Unlock_Texture (T : in SDL.C_Pointers.Texture_Pointer) with
Import => True,
Convention => C,
External_Name => "SDL_UnlockTexture";
begin
if Self.Locked then
SDL_Unlock_Texture (Self.Internal);
Self.Locked := False;
end if;
end Unlock;
procedure Query (Self : in Texture;
Pixel_Format_Name : out SDL.Video.Pixel_Formats.Pixel_Format_Names;
Kind : out Kinds;
Size : out SDL.Sizes) is
function SDL_Query_Texture (T : in SDL.C_Pointers.Texture_Pointer;
Pixel_Format_Name : out SDL.Video.Pixel_Formats.Pixel_Format_Names;
Kind : out Kinds;
Width : out SDL.Dimension;
Height : out SDL.Dimension) return C.int with
import => True,
Convention => C,
External_Name => "SDL_QueryTexture";
W : SDL.Dimension := 0;
H : SDL.Dimension := 0;
Result : C.int := SDL_Query_Texture (Self.Internal, Pixel_Format_Name, Kind, W, H);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
Size := SDL.Sizes'(W, H);
end Query;
function Get_Pixel_Format (Self : in Texture) return SDL.Video.Pixel_Formats.Pixel_Format_Names is
function SDL_Query_Texture (T : in SDL.C_Pointers.Texture_Pointer;
Pixel_Format_Name : out SDL.Video.Pixel_Formats.Pixel_Format_Names;
Kind : in System.Address := System.Null_Address;
Width : in System.Address := System.Null_Address;
Height : in System.Address := System.Null_Address) return C.int with
import => True,
Convention => C,
External_Name => "SDL_QueryTexture";
Format_Name : SDL.Video.Pixel_Formats.Pixel_Format_Names;
Result : C.int := SDL_Query_Texture (T => Self.Internal, Pixel_Format_Name => Format_Name);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
return Format_Name;
end Get_Pixel_Format;
function Get_Kind (Self : in Texture) return Kinds is
function SDL_Query_Texture (T : in SDL.C_Pointers.Texture_Pointer;
Pixel_Format_Name : in System.Address := System.Null_Address;
Kind : out Kinds;
Width : in System.Address := System.Null_Address;
Height : in System.Address := System.Null_Address) return C.int with
import => True,
Convention => C,
External_Name => "SDL_QueryTexture";
Kind : Kinds;
Result : C.int := SDL_Query_Texture (T => Self.Internal, Kind => Kind);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
return Kind;
end Get_Kind;
function Get_Size (Self : in Texture) return SDL.Sizes is
function SDL_Query_Texture (T : in SDL.C_Pointers.Texture_Pointer;
Pixel_Format_Name : in System.Address := System.Null_Address;
Kind : in System.Address := System.Null_Address;
Width : out SDL.Dimension;
Height : out SDL.Dimension) return C.int with
import => True,
Convention => C,
External_Name => "SDL_QueryTexture";
Size : SDL.Sizes := SDL.Zero_Size;
Result : C.int := SDL_Query_Texture (T => Self.Internal, Width => Size.Width, Height => Size.Height);
begin
if Result /= Success then
raise Texture_Error with SDL.Error.Get;
end if;
return Size;
end Get_Size;
procedure Update_YUV_Texture (Self : in out Texture;
Y_Plane : in Pixel_Pointer_Type;
Y_Pitch : in Natural;
U_Plane : in Pixel_Pointer_Type;
U_Pitch : in Natural;
V_Plane : in Pixel_Pointer_Type;
V_Pitch : in Natural) is
procedure SDL_UpdateYUVTexture (T : in SDL.C_Pointers.Texture_Pointer;
Area : in System.Address;
YPlane : in Pixel_Pointer_Type;
YPitch : in Natural;
UPlane : in Pixel_Pointer_Type;
UPitch : in Natural;
VPlane : in Pixel_Pointer_Type;
VPitch : in Natural) with
Import => True,
Convention => C,
External_Name => "SDL_UpdateYUVTexture";
-- extern DECLSPEC int SDLCALL SDL_UpdateYUVTexture (SDL_Texture * texture,
-- const SDL_Rect * rect,
-- const Uint8 * Yplane, int Ypitch,
-- const Uint8 * Uplane, int Upitch,
-- const Uint8 *Vplane, int Vpitch);
begin
SDL_UpdateYUVTexture (T => Self.Internal, Area => System.Null_Address,
YPlane => Y_Plane, YPitch => Y_Pitch,
UPlane => U_Plane, UPitch => U_Pitch,
VPlane => V_Plane, VPitch => V_Pitch);
end Update_YUV_Texture;
overriding
procedure Finalize (Self : in out Texture) is
begin
if Self.Internal /= null and then Self.Owns then
Destroy (Self);
end if;
end Finalize;
function Get_Internal_Texture (Self : in Texture) return SDL.C_Pointers.Texture_Pointer is
begin
return Self.Internal;
end Get_Internal_Texture;
end SDL.Video.Textures;
|
with
openGL.Tasks,
openGL.Errors,
GL.Binding,
GL.Pointers,
freetype_c.Binding,
freetype_c.FT_Bitmap,
interfaces.C;
package body openGL.GlyphImpl.texture
is
-----------
-- Globals
--
activeTextureID : openGL.texture.texture_Name; -- TODO: Check C source for how this is used.
--
-- The texture index of the currently active texture
--
-- We keep track of the currently active texture to try to reduce the
-- number of texture bind operations.
procedure ResetActiveTexture
is
begin
activeTextureID := 0;
end ResetActiveTexture;
---------
-- Forge
--
function new_GlyphImpl (glyth_Slot : in freetype_c.FT_GlyphSlot.item;
texture_Id : in openGL.Texture.texture_Name;
xOffset, yOffset : in Integer;
Width, Height : in Integer) return GlyphImpl.texture.view
is
use freetype_C,
freetype_C.Binding,
GL,
GL.Binding;
use type interfaces.C.unsigned,
GLint;
Self : constant GlyphImpl.texture.view := new GlyphImpl.texture.item;
begin
Tasks.check;
Self.define (glyth_Slot);
Self.destWidth := 0;
Self.destHeight := 0;
Self.glTextureID := texture_Id;
Self.Err := FT_Render_Glyph (glyth_Slot,
FT_RENDER_MODE_NORMAL);
if Self.Err /= no_Error
then
raise openGL.Error with "FT_Render_Glyph failed with error code: " & Self.Err'Image;
end if;
if FT_GlyphSlot_Get_Format (glyth_Slot) /= get_FT_GLYPH_FORMAT_BITMAP
then
raise openGL.Error with "Glyph is not a bitmap format.";
end if;
declare
use GL.Pointers;
Bitmap : constant freetype_C.FT_Bitmap.item := FT_GlyphSlot_Get_Bitmap (glyth_Slot);
begin
Self.destWidth := Bitmap.Width;
Self.destHeight := Bitmap.Rows;
if Self.destWidth /= 0
and then Self.destHeight /= 0
then
glPixelStorei (GL_UNPACK_ALIGNMENT, 1);
glBindTexture (GL_TEXTURE_2D, Self.glTextureID);
Errors.log;
glTexSubImage2D (GL_TEXTURE_2D, 0,
GLint (xOffset), GLint (yOffset),
Self.destWidth, Self.destHeight,
GL_ALPHA,
GL_UNSIGNED_BYTE,
to_GLvoid_access (Bitmap.Buffer));
Errors.log;
end if;
end;
-- 0
-- +----+
-- | |
-- | |
-- | |
-- +----+
-- 1
Self.UV (1).S := Real (xOffset) / Real (Width);
Self.UV (1).T := Real (yOffset) / Real (Height);
Self.UV (2).S := Real (GLint (xOffset) + Self.destWidth) / Real (Width);
Self.UV (2).T := Real (GLint (yOffset) + Self.destHeight) / Real (Height);
Self.Corner := (Real (FT_GlyphSlot_Get_bitmap_left (glyth_Slot)),
Real (FT_GlyphSlot_Get_bitmap_top (glyth_Slot)),
0.0);
declare
use openGL.Primitive;
the_Indices : constant openGL.Indices := (1, 2, 3, 4);
begin
Self.Primitive := Primitive.indexed.new_Primitive (triangle_Fan, the_Indices);
end;
return Self;
end new_GlyphImpl;
--------------
-- Attributes
--
function Quad (Self : in Item; Pen : in Vector_3) return Quad_t
is
dx : constant Real := Real'Floor (Pen (1) + Self.Corner (1));
dy : constant Real := Real'Floor (Pen (2) + Self.Corner (2));
the_Quad : aliased constant Quad_t := (NW => (Site => (dx,
dy,
0.0),
Coords => (S => Self.UV (1).S,
T => Self.UV (1).T)),
SW => (Site => (dx,
dy - Real (Self.destHeight),
0.0),
Coords => (S => Self.UV (1).S,
T => Self.UV (2).T)),
SE => (Site => (dx + Real (Self.destWidth),
dy - Real (Self.destHeight),
0.0),
Coords => (S => Self.UV (2).S,
T => Self.UV (2).T)),
NE => (Site => (dx + Real (Self.destWidth),
dy,
0.0),
Coords => (S => Self.UV (2).S,
T => Self.UV (1).T)),
Advance => Self.Advance);
begin
return the_Quad;
end Quad;
--------------
-- Operations
--
function renderImpl (Self : in Item; Pen : in Vector_3;
renderMode : in Integer) return Vector_3
is
pragma unreferenced (renderMode);
begin
return Self.Advance;
end renderImpl;
end openGL.GlyphImpl.Texture;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . C G I . C O O K I E --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 2000-2001 Ada Core Technologies, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT is maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This is a package to interface a GNAT program with a Web server via the
-- Common Gateway Interface (CGI). It exports services to deal with Web
-- cookies (piece of information kept in the Web client software).
-- The complete CGI Cookie specification can be found in the RFC2109 at:
-- http://www.ics.uci.edu/pub/ietf/http/rfc2109.txt
-- This package builds up data tables whose memory is not released.
-- A CGI program is expected to be a short lived program and so it
-- is adequate to have the underlying OS free the program on exit.
package GNAT.CGI.Cookie is
-- The package will initialize itself by parsing the HTTP_Cookie runtime
-- CGI environment variable during elaboration but we do not want to raise
-- an exception at this time, so the exception Data_Error is deferred and
-- will be raised when calling any services below (except for Ok).
Cookie_Not_Found : exception;
-- This exception is raised when a specific parameter is not found.
procedure Put_Header
(Header : String := Default_Header;
Force : Boolean := False);
-- Output standard CGI header by default. This header must be returned
-- back to the server at the very beginning and will be output only for
-- the first call to Put_Header if Force is set to False. This procedure
-- also outputs the Cookies that have been defined. If the program uses
-- the GNAT.CGI.Put_Header service, cookies will not be set.
--
-- Cookies are passed back to the server in the header, the format is:
--
-- Set-Cookie: <key>=<value>; comment=<comment>; domain=<domain>;
-- max_age=<max_age>; path=<path>[; secured]
function Ok return Boolean;
-- Returns True if the CGI cookie environment is valid and False
-- otherwise. Every service used when the CGI environment is not valid
-- will raise the exception Data_Error.
function Count return Natural;
-- Returns the number of cookies received by the CGI.
function Value
(Key : String;
Required : Boolean := False)
return String;
-- Returns the cookie value associated with the cookie named Key. If
-- cookie does not exist, returns an empty string if Required is
-- False and raises the exception Cookie_Not_Found otherwise.
function Value (Position : Positive) return String;
-- Returns the value associated with the cookie number Position
-- of the CGI. It raises Cookie_Not_Found if there is no such
-- cookie (i.e. Position > Count)
function Exists (Key : String) return Boolean;
-- Returns True if the cookie named Key exist and False otherwise.
function Key (Position : Positive) return String;
-- Returns the key associated with the cookie number Position of
-- the CGI. It raises Cookie_Not_Found if there is no such cookie
-- (i.e. Position > Count)
procedure Set
(Key : String;
Value : String;
Comment : String := "";
Domain : String := "";
Max_Age : Natural := Natural'Last;
Path : String := "/";
Secure : Boolean := False);
-- Add a cookie to the list of cookies. This will be sent back
-- to the server by the Put_Header service above.
generic
with procedure
Action
(Key : String;
Value : String;
Position : Positive;
Quit : in out Boolean);
procedure For_Every_Cookie;
-- Iterate through all cookies received from the server and call
-- the Action supplied procedure. The Key, Value parameters are set
-- appropriately, Position is the cookie order in the list, Quit is set to
-- True by default. Quit can be set to False to control the iterator
-- termination.
end GNAT.CGI.Cookie;
|
-----------------------------------------------------------------------
-- Test_Bean - A simple bean ffor unit tests
-- Copyright (C) 2009, 2010 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with EL.Objects;
with Util.Beans.Basic;
with Ada.Strings.Unbounded;
with Ada.Calendar;
with Ada.Unchecked_Deallocation;
package Test_Bean is
use Ada.Strings.Unbounded;
type Person is new Util.Beans.Basic.Bean with record
Last_Name : Unbounded_String;
First_Name : Unbounded_String;
Age : Natural;
Date : Ada.Calendar.Time;
Weight : Long_Long_Float;
end record;
type Person_Access is access all Person'Class;
function Create_Person (First_Name, Last_Name : String;
Age : Natural) return Person_Access;
-- Get the value identified by the name.
function Get_Value (From : Person; Name : String) return EL.Objects.Object;
-- Set the value identified by the name.
procedure Set_Value (From : in out Person;
Name : in String;
Value : in EL.Objects.Object);
-- Function to format a string
function Format (Arg : EL.Objects.Object) return EL.Objects.Object;
procedure Free is new Ada.Unchecked_Deallocation (Object => Person'Class,
Name => Person_Access);
end Test_Bean;
|
------------------------------------------------------------------------------
-- A d a r u n - t i m e s p e c i f i c a t i o n --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of ada.ads file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
with Ada.Text_IO;
package Ada.Float_Text_IO is new Ada.Text_IO.Float_IO (Float);
|
with Geo3x3; use Geo3x3;
with Ada.Text_IO; use Ada.Text_IO;
procedure Simple_Geo3x3 is
T: WGS84;
begin
Put_Line(Encode(35.65858, 139.745433, 14));
T := Decode("E9139659937288");
Put_Line (Long_Float'Image(T.Lat) & " " & Long_Float'Image(T.Lng) & " " & Integer'Image(T.Level) & " " & Long_Float'Image(T.Unit));
end Simple_Geo3x3;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>linebuffer</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>in_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_stream.V.value.V</originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>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>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>2</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>403</lineNumber>
<contextFuncName>linebuffer_2D&lt;1920, 1080, 1, 1, 1, 1, 3, 3, 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/sharpen</first>
<second class_id="11" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>530</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_2D&lt;1920, 1080, 1, 1, 1, 1, 3, 3, unsigned int&gt;</second>
</first>
<second>403</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_3D&lt;1920, 1080, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>492</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_4D&lt;1920, 1080, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>505</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
<item>18</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>531</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/sharpen</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>531</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_5">
<Value>
<Obj>
<type>2</type>
<id>15</id>
<name>call</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:call></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_6">
<Obj>
<type>3</type>
<id>14</id>
<name>linebuffer</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>13</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_7">
<id>16</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_8">
<id>17</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_9">
<id>18</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>12</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_10">
<mId>1</mId>
<mTag>linebuffer</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2077921</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>1</mIsDfPipe>
<mDfPipe class_id="23" tracking_level="1" version="0" object_id="_11">
<port_list class_id="24" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port_list>
<process_list class_id="25" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_12">
<type>0</type>
<name>call_U0</name>
<ssdmobj_id>12</ssdmobj_id>
<pins class_id="27" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_13">
<port class_id="29" tracking_level="1" version="0" object_id="_14">
<name>in_stream_V_value_V</name>
<dir>0</dir>
<type>0</type>
</port>
<inst class_id="30" tracking_level="1" version="0" object_id="_15">
<type>0</type>
<name>call_U0</name>
<ssdmobj_id>12</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_16">
<port class_id_reference="29" object_id="_17">
<name>out_stream_V_value_V</name>
<dir>0</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_15"></inst>
</item>
</pins>
</item>
</process_list>
<channel_list class_id="31" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</channel_list>
<net_list class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</net_list>
</mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="33" tracking_level="1" version="0" object_id="_18">
<states class_id="34" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="35" tracking_level="1" version="0" object_id="_19">
<id>1</id>
<operations class_id="36" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="37" tracking_level="1" version="0" object_id="_20">
<id>12</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="35" object_id="_21">
<id>2</id>
<operations>
<count>11</count>
<item_version>0</item_version>
<item class_id_reference="37" object_id="_22">
<id>3</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="37" object_id="_23">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="37" object_id="_24">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="37" object_id="_25">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="37" object_id="_26">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="37" object_id="_27">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="37" object_id="_28">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="37" object_id="_29">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="37" object_id="_30">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="37" object_id="_31">
<id>12</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="37" object_id="_32">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="38" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="1" version="0" object_id="_33">
<inState>1</inState>
<outState>2</outState>
<condition class_id="40" tracking_level="0" version="0">
<id>0</id>
<sop 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">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="44" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="45" tracking_level="0" version="0">
<first>12</first>
<second class_id="46" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="47" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="0" version="0">
<first>14</first>
<second class_id="49" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="50" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="1" version="0" object_id="_34">
<region_name>linebuffer</region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</basic_blocks>
<nodes>
<count>11</count>
<item_version>0</item_version>
<item>3</item>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>16</region_type>
<interval>0</interval>
<pipe_depth>0</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="52" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="53" tracking_level="0" version="0">
<first>36</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>12</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="55" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>1</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first>grp_call_fu_36</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="57" 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="58" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="59" tracking_level="0" version="0">
<first>in_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>
<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="60" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="61" tracking_level="0" version="0">
<first>1</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>2</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.