1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
/*
* Copyright (c) 2007, Michael Lehn
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1) Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2) Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* 3) Neither the name of the FLENS development group nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef FLENS_BLAS_CLOSURES_DEBUGCLOSURE_TCC
#define FLENS_BLAS_CLOSURES_DEBUGCLOSURE_TCC 1
#include <flens/auxiliary/auxiliary.h>
#include <flens/blas/closures/auxiliary/debugclosure.h>
#include <flens/vectortypes/vectortypes.h>
//
// Default implementation and specializations of DEBUGCLOSURE::identical
//
namespace flens { namespace DEBUGCLOSURE {
template <typename X, typename Y>
typename RestrictTo<!(HasFullStorage<X>::value && HasFullStorage<Y>::value)
&& !(HasPackedStorage<X>::value && HasPackedStorage<Y>::value)
&& !(HasArrayStorage<X>::value && HasArrayStorage<Y>::value),
bool>::Type
identical(const X &x, const Y &y)
{
return ADDRESS(x)==ADDRESS(y);
}
//
// Two DenseVectors are identical if they reference the same memory
//
template <typename VX, typename VY>
typename RestrictTo<HasArrayStorage<VX>::value
&& HasArrayStorage<VY>::value,
bool>::Type
identical(const VX &x, const VY &y)
{
//
// Quick return if possible
//
if (ADDRESS(x)==ADDRESS(y)) {
return true;
}
typedef typename DenseVector<VX>::ElementType TX;
typedef typename DenseVector<VY>::ElementType TY;
if (! IsSame<TX, TY>::value) {
return false;
}
//
// Compare referenced memory
//
if (RAWPOINTER(x.data())!=RAWPOINTER(y.data())) {
return false;
}
if (x.length()==0) {
// no memory referenced by x
return false;
}
if (y.length()==0) {
// no memory referenced by y
return false;
}
if (x.stride()!=y.stride()) {
return false;
}
if (x.length()!=y.length()) {
return false;
}
return true;
}
//
// Two matrices with full storage are identical if they reference the
// same memory region
//
template <typename MA, typename MB>
typename RestrictTo<HasFullStorage<MA>::value
&& HasFullStorage<MB>::value,
bool>::Type
identical(const MA &A, const MB &B)
{
//
// Quick return if possible
//
if (ADDRESS(A)==ADDRESS(B)) {
return true;
}
typedef typename MA::ElementType TA;
typedef typename MB::ElementType TB;
if (! IsSame<TA, TB>::value) {
return false;
}
//
// Compare referenced memory
//
if (RAWPOINTER(A.data())!=RAWPOINTER(B.data())) {
return false;
}
if (A.numRows()==0 || A.numCols()==0) {
// no memory referenced by A
return false;
}
if (B.numRows()==0 || B.numCols()==0) {
// no memory referenced by A
return false;
}
if (A.strideRow()!=B.strideRow()) {
return false;
}
if (A.strideCol()!=B.strideCol()) {
return false;
}
if (A.numRows()!=B.numRows()) {
return false;
}
if (A.numCols()!=B.numCols()) {
return false;
}
return true;
}
template <typename MA, typename MB>
typename RestrictTo<HasPackedStorage<MA>::value
&& HasPackedStorage<MB>::value,
bool>::Type
identical(const MA &A, const MB &B)
{
//
// Quick return if possible
//
if (ADDRESS(A)==ADDRESS(B)) {
return true;
}
typedef typename MA::ElementType TA;
typedef typename MB::ElementType TB;
if (! IsSame<TA, TB>::value) {
return false;
}
//
// Compare referenced memory
//
if (RAWPOINTER(A.data())!=RAWPOINTER(B.data())) {
return false;
}
if (A.dim()==0) {
// no memory referenced by A
return 0;
}
if (B.dim()==0) {
// no memory referenced by B
return 0;
}
if (A.dim()!=B.dim()) {
return false;
}
return true;
}
} } // namespace DEBUGCLOSURE, flens
//
// Search mechanism for closures
//
namespace flens {
template <typename X, typename Y>
bool
DebugClosure::search(const X &x, const Y &y)
{
return DEBUGCLOSURE::identical(x, y);
}
template <typename Op, typename L, typename R, typename Y>
bool
DebugClosure::search(const VectorClosure<Op, L, R> &closure, const Y &y)
{
return search(closure.left(), y) || search(closure.right(), y);
}
template <typename Op, typename L, typename R, typename Y>
bool
DebugClosure::search(const MatrixClosure<Op, L, R> &closure, const Y &y)
{
return search(closure.left(), y) || search(closure.right(), y);
}
} // namespace flens
#endif // FLENS_BLAS_CLOSURES_DEBUGCLOSURE_TCC
|