da4ml 0.2.0__py3-none-any.whl → 0.3.0__py3-none-any.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Potentially problematic release.
This version of da4ml might be problematic. Click here for more details.
- da4ml/_version.py +2 -2
- da4ml/cmvm/api.py +2 -6
- da4ml/cmvm/core/__init__.py +0 -1
- da4ml/cmvm/types.py +99 -19
- da4ml/codegen/__init__.py +5 -4
- da4ml/codegen/cpp/__init__.py +2 -1
- da4ml/codegen/cpp/cpp_codegen.py +58 -25
- da4ml/codegen/cpp/hls_model.py +252 -0
- da4ml/codegen/cpp/source/ap_types/ap_binary.h +78 -0
- da4ml/codegen/cpp/source/ap_types/ap_common.h +376 -0
- da4ml/codegen/cpp/source/ap_types/ap_decl.h +212 -0
- da4ml/codegen/cpp/source/ap_types/ap_fixed.h +360 -0
- da4ml/codegen/cpp/source/ap_types/ap_fixed_base.h +2354 -0
- da4ml/codegen/cpp/source/ap_types/ap_fixed_ref.h +718 -0
- da4ml/codegen/cpp/source/ap_types/ap_fixed_special.h +230 -0
- da4ml/codegen/cpp/source/ap_types/ap_int.h +330 -0
- da4ml/codegen/cpp/source/ap_types/ap_int_base.h +1885 -0
- da4ml/codegen/cpp/source/ap_types/ap_int_ref.h +1346 -0
- da4ml/codegen/cpp/source/ap_types/ap_int_special.h +223 -0
- da4ml/codegen/cpp/source/ap_types/ap_shift_reg.h +138 -0
- da4ml/codegen/cpp/source/ap_types/etc/ap_private.h +7199 -0
- da4ml/codegen/cpp/source/ap_types/hls_math.h +27 -0
- da4ml/codegen/cpp/source/ap_types/hls_stream.h +263 -0
- da4ml/codegen/cpp/source/ap_types/utils/x_hls_utils.h +80 -0
- da4ml/codegen/cpp/source/binder_util.hh +56 -0
- da4ml/codegen/cpp/source/build_binder.mk +24 -0
- da4ml/codegen/cpp/source/{vitis.h → vitis_bitshift.hh} +1 -1
- da4ml/codegen/verilog/__init__.py +2 -3
- da4ml/codegen/verilog/comb.py +65 -24
- da4ml/codegen/verilog/io_wrapper.py +36 -141
- da4ml/codegen/verilog/pipeline.py +21 -3
- da4ml/codegen/verilog/source/binder_util.hh +72 -0
- da4ml/codegen/verilog/source/build_prj.tcl +0 -1
- da4ml/codegen/verilog/source/mux.v +58 -0
- da4ml/codegen/verilog/source/negative.v +28 -0
- da4ml/codegen/verilog/source/shift_adder.v +4 -1
- da4ml/codegen/verilog/source/template.xdc +3 -0
- da4ml/codegen/verilog/verilog_model.py +42 -15
- da4ml/converter/__init__.py +0 -0
- da4ml/converter/hgq2/parser.py +105 -0
- da4ml/converter/hgq2/replica.py +383 -0
- da4ml/trace/__init__.py +2 -2
- da4ml/trace/fixed_variable.py +177 -18
- da4ml/trace/fixed_variable_array.py +124 -9
- da4ml/trace/ops/__init__.py +22 -6
- da4ml/trace/ops/conv_utils.py +146 -14
- da4ml/trace/ops/einsum_utils.py +9 -6
- da4ml/trace/ops/reduce_utils.py +103 -0
- da4ml/trace/pipeline.py +36 -34
- da4ml/trace/tracer.py +37 -5
- da4ml-0.3.0.dist-info/METADATA +107 -0
- da4ml-0.3.0.dist-info/RECORD +64 -0
- da4ml/codegen/cpp/source/vitis_bridge.h +0 -17
- da4ml-0.2.0.dist-info/METADATA +0 -65
- da4ml-0.2.0.dist-info/RECORD +0 -39
- /da4ml/codegen/verilog/source/{ioutils.hh → ioutil.hh} +0 -0
- {da4ml-0.2.0.dist-info → da4ml-0.3.0.dist-info}/WHEEL +0 -0
- {da4ml-0.2.0.dist-info → da4ml-0.3.0.dist-info}/licenses/LICENSE +0 -0
- {da4ml-0.2.0.dist-info → da4ml-0.3.0.dist-info}/top_level.txt +0 -0
|
@@ -0,0 +1,223 @@
|
|
|
1
|
+
/*
|
|
2
|
+
* Copyright 2011-2019 Xilinx, Inc.
|
|
3
|
+
*
|
|
4
|
+
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
5
|
+
* you may not use this file except in compliance with the License.
|
|
6
|
+
* You may obtain a copy of the License at
|
|
7
|
+
*
|
|
8
|
+
* http://www.apache.org/licenses/LICENSE-2.0
|
|
9
|
+
*
|
|
10
|
+
* Unless required by applicable law or agreed to in writing, software
|
|
11
|
+
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
12
|
+
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
13
|
+
* See the License for the specific language governing permissions and
|
|
14
|
+
* limitations under the License.
|
|
15
|
+
*/
|
|
16
|
+
|
|
17
|
+
#ifndef __AP_INT_SPECIAL_H__
|
|
18
|
+
#define __AP_INT_SPECIAL_H__
|
|
19
|
+
|
|
20
|
+
#ifndef __AP_INT_H__
|
|
21
|
+
#error "Only ap_fixed.h and ap_int.h can be included directly in user code."
|
|
22
|
+
#endif
|
|
23
|
+
|
|
24
|
+
#ifndef __SYNTHESIS__
|
|
25
|
+
#include <cstdio>
|
|
26
|
+
#include <cstdlib>
|
|
27
|
+
#endif
|
|
28
|
+
// FIXME AP_AUTOCC cannot handle many standard headers, so declare instead of
|
|
29
|
+
// include.
|
|
30
|
+
// #include <complex>
|
|
31
|
+
namespace std {
|
|
32
|
+
template<typename _Tp> class complex;
|
|
33
|
+
}
|
|
34
|
+
|
|
35
|
+
/*
|
|
36
|
+
TODO: Modernize the code using C++11/C++14
|
|
37
|
+
1. constexpr http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0415r0.html
|
|
38
|
+
2. move constructor
|
|
39
|
+
*/
|
|
40
|
+
|
|
41
|
+
namespace std {
|
|
42
|
+
/*
|
|
43
|
+
Specialize std::complex<ap_int> to zero initialization ap_int.
|
|
44
|
+
|
|
45
|
+
To reduce the area cost, ap_int is not zero initialized, just like basic
|
|
46
|
+
types float or double. However, libstdc++ provides specialization for float,
|
|
47
|
+
double and long double, initializing image part to 0 when not specified.
|
|
48
|
+
|
|
49
|
+
This has become a difficulty in switching legacy code from these C types to
|
|
50
|
+
ap_int. To ease the tranform of legacy code, we have to implement
|
|
51
|
+
specialization of std::complex<> for our type.
|
|
52
|
+
|
|
53
|
+
As ap_int is a template, it is impossible to specialize only the methods
|
|
54
|
+
that causes default initialization of value type in std::complex<>. An
|
|
55
|
+
explicit full specialization of the template class has to be done, covering
|
|
56
|
+
all the member functions and operators of std::complex<> as specified
|
|
57
|
+
in standard 26.2.4 and 26.2.5.
|
|
58
|
+
*/
|
|
59
|
+
template <int _AP_W>
|
|
60
|
+
class complex<ap_int<_AP_W> > {
|
|
61
|
+
public:
|
|
62
|
+
typedef ap_int<_AP_W> _Tp;
|
|
63
|
+
typedef _Tp value_type;
|
|
64
|
+
|
|
65
|
+
// 26.2.4/1
|
|
66
|
+
// Constructor without argument
|
|
67
|
+
// Default initialize, so that in dataflow, the variable is only written once.
|
|
68
|
+
complex() : _M_real(_Tp()), _M_imag(_Tp()) {}
|
|
69
|
+
// Constructor with ap_int.
|
|
70
|
+
// Zero initialize image part when not specified, so that `C(1) == C(1,0)`
|
|
71
|
+
complex(const _Tp &__r, const _Tp &__i = _Tp(0))
|
|
72
|
+
: _M_real(__r), _M_imag(__i) {}
|
|
73
|
+
|
|
74
|
+
// Constructor with another complex number
|
|
75
|
+
template <typename _Up>
|
|
76
|
+
complex(const complex<_Up> &__z) : _M_real(__z.real()), _M_imag(__z.imag()) {}
|
|
77
|
+
|
|
78
|
+
#if __cplusplus >= 201103L
|
|
79
|
+
const _Tp& real() const { return _M_real; }
|
|
80
|
+
const _Tp& imag() const { return _M_imag; }
|
|
81
|
+
#else
|
|
82
|
+
_Tp& real() { return _M_real; }
|
|
83
|
+
const _Tp& real() const { return _M_real; }
|
|
84
|
+
_Tp& imag() { return _M_imag; }
|
|
85
|
+
const _Tp& imag() const { return _M_imag; }
|
|
86
|
+
#endif
|
|
87
|
+
|
|
88
|
+
void real(_Tp __val) { _M_real = __val; }
|
|
89
|
+
|
|
90
|
+
void imag(_Tp __val) { _M_imag = __val; }
|
|
91
|
+
|
|
92
|
+
// Assign this complex number with ap_int.
|
|
93
|
+
// Zero initialize image poarrt, so that `C c; c = 1; c == C(1,0);`
|
|
94
|
+
complex<_Tp> &operator=(const _Tp __t) {
|
|
95
|
+
_M_real = __t;
|
|
96
|
+
_M_imag = _Tp(0);
|
|
97
|
+
return *this;
|
|
98
|
+
}
|
|
99
|
+
|
|
100
|
+
// 26.2.5/1
|
|
101
|
+
// Add ap_int to this complex number.
|
|
102
|
+
complex<_Tp> &operator+=(const _Tp &__t) {
|
|
103
|
+
_M_real += __t;
|
|
104
|
+
return *this;
|
|
105
|
+
}
|
|
106
|
+
|
|
107
|
+
// 26.2.5/3
|
|
108
|
+
// Subtract ap_int from this complex number.
|
|
109
|
+
complex<_Tp> &operator-=(const _Tp &__t) {
|
|
110
|
+
_M_real -= __t;
|
|
111
|
+
return *this;
|
|
112
|
+
}
|
|
113
|
+
|
|
114
|
+
// 26.2.5/5
|
|
115
|
+
// Multiply this complex number by ap_int.
|
|
116
|
+
complex<_Tp> &operator*=(const _Tp &__t) {
|
|
117
|
+
_M_real *= __t;
|
|
118
|
+
_M_imag *= __t;
|
|
119
|
+
return *this;
|
|
120
|
+
}
|
|
121
|
+
|
|
122
|
+
// 26.2.5/7
|
|
123
|
+
// Divide this complex number by ap_int.
|
|
124
|
+
complex<_Tp> &operator/=(const _Tp &__t) {
|
|
125
|
+
_M_real /= __t;
|
|
126
|
+
_M_imag /= __t;
|
|
127
|
+
return *this;
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
// Assign complex number to this complex number.
|
|
131
|
+
template <typename _Up>
|
|
132
|
+
complex<_Tp> &operator=(const complex<_Up> &__z) {
|
|
133
|
+
_M_real = __z.real();
|
|
134
|
+
_M_imag = __z.imag();
|
|
135
|
+
return *this;
|
|
136
|
+
}
|
|
137
|
+
|
|
138
|
+
// 26.2.5/9
|
|
139
|
+
// Add complex number to this.
|
|
140
|
+
template <typename _Up>
|
|
141
|
+
complex<_Tp> &operator+=(const complex<_Up> &__z) {
|
|
142
|
+
_M_real += __z.real();
|
|
143
|
+
_M_imag += __z.imag();
|
|
144
|
+
return *this;
|
|
145
|
+
}
|
|
146
|
+
|
|
147
|
+
// 26.2.5/11
|
|
148
|
+
// Subtract complex number from this.
|
|
149
|
+
template <typename _Up>
|
|
150
|
+
complex<_Tp> &operator-=(const complex<_Up> &__z) {
|
|
151
|
+
_M_real -= __z.real();
|
|
152
|
+
_M_imag -= __z.imag();
|
|
153
|
+
return *this;
|
|
154
|
+
}
|
|
155
|
+
|
|
156
|
+
// 26.2.5/13
|
|
157
|
+
// Multiply this by complex number.
|
|
158
|
+
template <typename _Up>
|
|
159
|
+
complex<_Tp> &operator*=(const complex<_Up> &__z) {
|
|
160
|
+
const _Tp __r = _M_real * __z.real() - _M_imag * __z.imag();
|
|
161
|
+
_M_imag = _M_real * __z.imag() + _M_imag * __z.real();
|
|
162
|
+
_M_real = __r;
|
|
163
|
+
return *this;
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
// 26.2.5/15
|
|
167
|
+
// Divide this by complex number.
|
|
168
|
+
template <typename _Up>
|
|
169
|
+
complex<_Tp> &operator/=(const complex<_Up> &__z) {
|
|
170
|
+
complex<_Tp> cj (__z.real(), -__z.imag());
|
|
171
|
+
complex<_Tp> a = (*this) * cj;
|
|
172
|
+
complex<_Tp> b = cj * __z;
|
|
173
|
+
_M_real = a.real() / b.real();
|
|
174
|
+
_M_imag = a.imag() / b.real();
|
|
175
|
+
return *this;
|
|
176
|
+
}
|
|
177
|
+
|
|
178
|
+
private:
|
|
179
|
+
_Tp _M_real;
|
|
180
|
+
_Tp _M_imag;
|
|
181
|
+
|
|
182
|
+
}; // class complex<ap_int<_AP_W> >
|
|
183
|
+
|
|
184
|
+
|
|
185
|
+
/*
|
|
186
|
+
Non-member operations
|
|
187
|
+
These operations are not required by standard in 26.2.6, but libstdc++
|
|
188
|
+
defines them for
|
|
189
|
+
float, double or long double's specialization.
|
|
190
|
+
*/
|
|
191
|
+
// Compare complex number with ap_int.
|
|
192
|
+
template <int _AP_W>
|
|
193
|
+
inline bool operator==(const complex<ap_int<_AP_W> > &__x, const ap_int<_AP_W> &__y) {
|
|
194
|
+
return __x.real() == __y &&
|
|
195
|
+
__x.imag() == 0;
|
|
196
|
+
}
|
|
197
|
+
|
|
198
|
+
// Compare ap_int with complex number.
|
|
199
|
+
template <int _AP_W>
|
|
200
|
+
inline bool operator==(const ap_int<_AP_W> &__x, const complex<ap_int<_AP_W> > &__y) {
|
|
201
|
+
return __x == __y.real() &&
|
|
202
|
+
0 == __y.imag();
|
|
203
|
+
}
|
|
204
|
+
|
|
205
|
+
// Compare complex number with ap_int.
|
|
206
|
+
template <int _AP_W>
|
|
207
|
+
inline bool operator!=(const complex<ap_int<_AP_W> > &__x, const ap_int<_AP_W> &__y) {
|
|
208
|
+
return __x.real() != __y ||
|
|
209
|
+
__x.imag() != 0;
|
|
210
|
+
}
|
|
211
|
+
|
|
212
|
+
// Compare ap_int with complex number.
|
|
213
|
+
template <int _AP_W>
|
|
214
|
+
inline bool operator!=(const ap_int<_AP_W> &__x, const complex<ap_int<_AP_W> > &__y) {
|
|
215
|
+
return __x != __y.real() ||
|
|
216
|
+
0 != __y.imag();
|
|
217
|
+
}
|
|
218
|
+
|
|
219
|
+
} // namespace std
|
|
220
|
+
|
|
221
|
+
#endif // ifndef __AP_INT_SPECIAL_H__
|
|
222
|
+
|
|
223
|
+
// -*- cpp -*-
|
|
@@ -0,0 +1,138 @@
|
|
|
1
|
+
/*
|
|
2
|
+
#- (c) Copyright 2011-2019 Xilinx, Inc. All rights reserved.
|
|
3
|
+
#-
|
|
4
|
+
#- This file contains confidential and proprietary information
|
|
5
|
+
#- of Xilinx, Inc. and is protected under U.S. and
|
|
6
|
+
#- international copyright and other intellectual property
|
|
7
|
+
#- laws.
|
|
8
|
+
#-
|
|
9
|
+
#- DISCLAIMER
|
|
10
|
+
#- This disclaimer is not a license and does not grant any
|
|
11
|
+
#- rights to the materials distributed herewith. Except as
|
|
12
|
+
#- otherwise provided in a valid license issued to you by
|
|
13
|
+
#- Xilinx, and to the maximum extent permitted by applicable
|
|
14
|
+
#- law: (1) THESE MATERIALS ARE MADE AVAILABLE "AS IS" AND
|
|
15
|
+
#- WITH ALL FAULTS, AND XILINX HEREBY DISCLAIMS ALL WARRANTIES
|
|
16
|
+
#- AND CONDITIONS, EXPRESS, IMPLIED, OR STATUTORY, INCLUDING
|
|
17
|
+
#- BUT NOT LIMITED TO WARRANTIES OF MERCHANTABILITY, NON-
|
|
18
|
+
#- INFRINGEMENT, OR FITNESS FOR ANY PARTICULAR PURPOSE; and
|
|
19
|
+
#- (2) Xilinx shall not be liable (whether in contract or tort,
|
|
20
|
+
#- including negligence, or under any other theory of
|
|
21
|
+
#- liability) for any loss or damage of any kind or nature
|
|
22
|
+
#- related to, arising under or in connection with these
|
|
23
|
+
#- materials, including for any direct, or any indirect,
|
|
24
|
+
#- special, incidental, or consequential loss or damage
|
|
25
|
+
#- (including loss of data, profits, goodwill, or any type of
|
|
26
|
+
#- loss or damage suffered as a result of any action brought
|
|
27
|
+
#- by a third party) even if such damage or loss was
|
|
28
|
+
#- reasonably foreseeable or Xilinx had been advised of the
|
|
29
|
+
#- possibility of the same.
|
|
30
|
+
#-
|
|
31
|
+
#- CRITICAL APPLICATIONS
|
|
32
|
+
#- Xilinx products are not designed or intended to be fail-
|
|
33
|
+
#- safe, or for use in any application requiring fail-safe
|
|
34
|
+
#- performance, such as life-support or safety devices or
|
|
35
|
+
#- systems, Class III medical devices, nuclear facilities,
|
|
36
|
+
#- applications related to the deployment of airbags, or any
|
|
37
|
+
#- other applications that could lead to death, personal
|
|
38
|
+
#- injury, or severe property or environmental damage
|
|
39
|
+
#- (individually and collectively, "Critical
|
|
40
|
+
#- Applications"). Customer assumes the sole risk and
|
|
41
|
+
#- liability of any use of Xilinx products in Critical
|
|
42
|
+
#- Applications, subject only to applicable laws and
|
|
43
|
+
#- regulations governing limitations on product liability.
|
|
44
|
+
#-
|
|
45
|
+
#- THIS COPYRIGHT NOTICE AND DISCLAIMER MUST BE RETAINED AS
|
|
46
|
+
#- PART OF THIS FILE AT ALL TIMES.
|
|
47
|
+
#- ************************************************************************
|
|
48
|
+
|
|
49
|
+
|
|
50
|
+
Licensed under the Apache License, Version 2.0 (the "License");
|
|
51
|
+
you may not use this file except in compliance with the License.
|
|
52
|
+
You may obtain a copy of the License at
|
|
53
|
+
|
|
54
|
+
http://www.apache.org/licenses/LICENSE-2.0
|
|
55
|
+
|
|
56
|
+
Unless required by applicable law or agreed to in writing, software
|
|
57
|
+
distributed under the License is distributed on an "AS IS" BASIS,
|
|
58
|
+
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
59
|
+
See the License for the specific language governing permissions and
|
|
60
|
+
limitations under the License.
|
|
61
|
+
*/
|
|
62
|
+
|
|
63
|
+
#ifndef __SIM_AP_SHIFT_REG_H__
|
|
64
|
+
#define __SIM_AP_SHIFT_REG_H__
|
|
65
|
+
|
|
66
|
+
|
|
67
|
+
/*
|
|
68
|
+
* This file contains a C++ model of shift register.
|
|
69
|
+
* It defines C level simulation model.
|
|
70
|
+
*/
|
|
71
|
+
#ifndef __cplusplus
|
|
72
|
+
#error C++ is required to include this header file
|
|
73
|
+
#else
|
|
74
|
+
|
|
75
|
+
#include <cassert>
|
|
76
|
+
|
|
77
|
+
//////////////////////////////////////////////
|
|
78
|
+
// C level simulation model for ap_shift_reg
|
|
79
|
+
//////////////////////////////////////////////
|
|
80
|
+
template<typename __SHIFT_T__, unsigned int __SHIFT_DEPTH__ = 32>
|
|
81
|
+
class ap_shift_reg
|
|
82
|
+
{
|
|
83
|
+
public:
|
|
84
|
+
/// Constructors
|
|
85
|
+
ap_shift_reg() { }
|
|
86
|
+
ap_shift_reg(const char* name) { }
|
|
87
|
+
/// Destructor
|
|
88
|
+
virtual ~ap_shift_reg() { }
|
|
89
|
+
|
|
90
|
+
private:
|
|
91
|
+
/// Make copy constructor and assignment operator private
|
|
92
|
+
ap_shift_reg(const ap_shift_reg< __SHIFT_T__, __SHIFT_DEPTH__ >& shreg)
|
|
93
|
+
{
|
|
94
|
+
for (unsigned i = 0; i < __SHIFT_DEPTH__; ++i)
|
|
95
|
+
Array[i] = shreg.Array[i];
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
ap_shift_reg& operator = (const ap_shift_reg< __SHIFT_T__,
|
|
99
|
+
__SHIFT_DEPTH__ >& shreg)
|
|
100
|
+
{
|
|
101
|
+
for (unsigned i = 0; i < __SHIFT_DEPTH__; ++i)
|
|
102
|
+
Array[i] = shreg.Array[i];
|
|
103
|
+
return *this;
|
|
104
|
+
}
|
|
105
|
+
|
|
106
|
+
public:
|
|
107
|
+
// Shift the queue, push to back and read from a given address.
|
|
108
|
+
__SHIFT_T__ shift(__SHIFT_T__ DataIn,
|
|
109
|
+
unsigned int Addr = __SHIFT_DEPTH__ - 1, bool Enable = true)
|
|
110
|
+
{
|
|
111
|
+
assert(Addr < __SHIFT_DEPTH__ &&
|
|
112
|
+
"Out-of-bound shift is found in ap_shift_reg.");
|
|
113
|
+
__SHIFT_T__ ret = Array[Addr];
|
|
114
|
+
if (Enable) {
|
|
115
|
+
for (unsigned int i = __SHIFT_DEPTH__ - 1; i > 0; --i)
|
|
116
|
+
Array[i] = Array[i-1];
|
|
117
|
+
Array[0] = DataIn;
|
|
118
|
+
}
|
|
119
|
+
return ret;
|
|
120
|
+
}
|
|
121
|
+
|
|
122
|
+
// Read from a given address.
|
|
123
|
+
__SHIFT_T__ read(unsigned int Addr = __SHIFT_DEPTH__ - 1) const
|
|
124
|
+
{
|
|
125
|
+
assert(Addr < __SHIFT_DEPTH__ &&
|
|
126
|
+
"Out-of-bound read is found in ap_shift_reg.");
|
|
127
|
+
return Array[Addr];
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
protected:
|
|
131
|
+
__SHIFT_T__ Array[__SHIFT_DEPTH__];
|
|
132
|
+
};
|
|
133
|
+
|
|
134
|
+
#endif //__cplusplus
|
|
135
|
+
|
|
136
|
+
#endif //__SIM_AP_SHIFT_REG_H__
|
|
137
|
+
|
|
138
|
+
|