[658] | 1 | #ifndef BZ_ARRAYSTENCIL_H
|
---|
| 2 | #define BZ_ARRAYSTENCIL_H
|
---|
| 3 |
|
---|
| 4 | #ifndef BZ_ARRAY_H
|
---|
| 5 | #error <blitz/array/stencil.h> must be included via <blitz/array.h>
|
---|
| 6 | #endif
|
---|
| 7 |
|
---|
| 8 | #include <blitz/array/stencilops.h>
|
---|
| 9 |
|
---|
| 10 | BZ_NAMESPACE(blitz)
|
---|
| 11 |
|
---|
| 12 | // NEEDS_WORK: currently stencilExtent returns int(1). What if the
|
---|
| 13 | // stencil contains calls to math functions, or divisions, etc.?
|
---|
| 14 | // Should at least return a number of the appropriate type. Probably
|
---|
| 15 | // return a sequence of quasi-random floating point numbers.
|
---|
| 16 |
|
---|
| 17 | /*
|
---|
| 18 | * These macros make it easier for users to declare stencil objects.
|
---|
| 19 | * The syntax is:
|
---|
| 20 | *
|
---|
| 21 | * BZ_DECLARE_STENCILN(stencilname, Array1, Array2, ..., ArrayN)
|
---|
| 22 | * // stencil operations go here
|
---|
| 23 | * BZ_END_STENCIL
|
---|
| 24 | */
|
---|
| 25 |
|
---|
| 26 | #define BZ_DECLARE_STENCIL2(name,A,B) \
|
---|
| 27 | struct name { \
|
---|
| 28 | template<class T1, class T2, class T3, class T4, class T5, class T6, \
|
---|
| 29 | class T7, class T8, class T9, class T10, class T11> \
|
---|
| 30 | static inline void apply(T1& A, T2& B, T3, T4, T5, T6, T7, T8, T9, T10, T11) \
|
---|
| 31 | {
|
---|
| 32 |
|
---|
| 33 | #define BZ_END_STENCIL } };
|
---|
| 34 | #define BZ_STENCIL_END } };
|
---|
| 35 |
|
---|
| 36 | #define BZ_DECLARE_STENCIL3(name,A,B,C) \
|
---|
| 37 | struct name { \
|
---|
| 38 | template<class T1, class T2, class T3, class T4, class T5, class T6, \
|
---|
| 39 | class T7, class T8, class T9, class T10, class T11> \
|
---|
| 40 | static inline void apply(T1& A, T2& B, T3& C, T4, T5, T6, T7, T8, T9, \
|
---|
| 41 | T10, T11) \
|
---|
| 42 | {
|
---|
| 43 |
|
---|
| 44 | #define BZ_DECLARE_STENCIL4(name,A,B,C,D) \
|
---|
| 45 | struct name { \
|
---|
| 46 | template<class T1, class T2, class T3, class T4, class T5, class T6, \
|
---|
| 47 | class T7, class T8, class T9, class T10, class T11> \
|
---|
| 48 | static inline void apply(T1& A, T2& B, T3& C, T4& D, T5, T6, T7, \
|
---|
| 49 | T8, T9, T10, T11) \
|
---|
| 50 | {
|
---|
| 51 |
|
---|
| 52 | #define BZ_DECLARE_STENCIL5(name,A,B,C,D,E) \
|
---|
| 53 | struct name { \
|
---|
| 54 | template<class T1, class T2, class T3, class T4, class T5, class T6, \
|
---|
| 55 | class T7, class T8, class T9, class T10, class T11> \
|
---|
| 56 | static inline void apply(T1& A, T2& B, T3& C, T4& D, T5& E, T6, T7, T8, \
|
---|
| 57 | T9, T10, T11) \
|
---|
| 58 | {
|
---|
| 59 |
|
---|
| 60 | #define BZ_DECLARE_STENCIL6(name,A,B,C,D,E,F) \
|
---|
| 61 | struct name { \
|
---|
| 62 | template<class T1, class T2, class T3, class T4, class T5, class T6, \
|
---|
| 63 | class T7, class T8, class T9, class T10, class T11> \
|
---|
| 64 | static inline void apply(T1& A, T2& B, T3& C, T4& D, T5& E, T6& F, \
|
---|
| 65 | T7, T8, T9, T10, T11) \
|
---|
| 66 | {
|
---|
| 67 |
|
---|
| 68 | #define BZ_DECLARE_STENCIL7(name,A,B,C,D,E,F,G) \
|
---|
| 69 | struct name { \
|
---|
| 70 | template<class T1, class T2, class T3, class T4, \
|
---|
| 71 | class T5, class T6, class T7, class T8, class T9, class T10, class T11> \
|
---|
| 72 | static inline void apply(T1& A, T2& B, T3& C, T4& D, T5& E, T6& F, T7& G, \
|
---|
| 73 | T8, T9, T10, T11) \
|
---|
| 74 | {
|
---|
| 75 |
|
---|
| 76 | #define BZ_DECLARE_STENCIL8(name,A,B,C,D,E,F,G,H) \
|
---|
| 77 | struct name { \
|
---|
| 78 | template<class T1, class T2, class T3, class T4, \
|
---|
| 79 | class T5, class T6, class T7, class T8, class T9, class T10, class T11> \
|
---|
| 80 | static inline void apply(T1& A, T2& B, T3& C, T4& D, T5& E, T6& F, T7& G, \
|
---|
| 81 | T8& H, T9, T10, T11) \
|
---|
| 82 | {
|
---|
| 83 |
|
---|
| 84 | #define BZ_DECLARE_STENCIL9(name,A,B,C,D,E,F,G,H,I) \
|
---|
| 85 | struct name { \
|
---|
| 86 | template<class T1, class T2, class T3, class T4, \
|
---|
| 87 | class T5, class T6, class T7, class T8, class T9, class T10, \
|
---|
| 88 | class T11> \
|
---|
| 89 | static inline void apply(T1& A, T2& B, T3& C, T4& D, T5& E, T6& F, T7& G, \
|
---|
| 90 | T8& H, T9& I, T10, T11) \
|
---|
| 91 | {
|
---|
| 92 |
|
---|
| 93 | #define BZ_DECLARE_STENCIL10(name,A,B,C,D,E,F,G,H,I,J) \
|
---|
| 94 | struct name { \
|
---|
| 95 | template<class T1, class T2, class T3, class T4, \
|
---|
| 96 | class T5, class T6, class T7, class T8, class T9, class T10, class T11> \
|
---|
| 97 | static inline void apply(T1& A, T2& B, T3& C, T4& D, T5& E, T6& F, T7& G, \
|
---|
| 98 | T8& H, T9& I, T10& J, T11) \
|
---|
| 99 | {
|
---|
| 100 |
|
---|
| 101 | #define BZ_DECLARE_STENCIL11(name,A,B,C,D,E,F,G,H,I,J,K) \
|
---|
| 102 | struct name { \
|
---|
| 103 | template<class T1, class T2, class T3, class T4, \
|
---|
| 104 | class T5, class T6, class T7, class T8, class T9, class T10, \
|
---|
| 105 | class T11> \
|
---|
| 106 | static inline void apply(T1& A, T2& B, T3& C, T4& D, T5& E, T6& F, T7& G, \
|
---|
| 107 | T8& H, T9& I, T10& J, T11& K) \
|
---|
| 108 | {
|
---|
| 109 |
|
---|
| 110 |
|
---|
| 111 |
|
---|
| 112 | /*
|
---|
| 113 | * dummyArray is used to provide "dummy" padding parameters to applyStencil(),
|
---|
| 114 | * so that any number of arrays (up to 11) can be given as arguments.
|
---|
| 115 | */
|
---|
| 116 |
|
---|
| 117 | template<class T> class dummy;
|
---|
| 118 |
|
---|
| 119 | struct dummyArray {
|
---|
| 120 | typedef dummy<double> T_iterator;
|
---|
| 121 |
|
---|
| 122 | const dummyArray& shape() const { return *this; }
|
---|
| 123 | };
|
---|
| 124 |
|
---|
| 125 | _bz_global dummyArray _dummyArray;
|
---|
| 126 |
|
---|
| 127 | /*
|
---|
| 128 | * This dummy class pretends to be a scalar of type T, or an array iterator
|
---|
| 129 | * of type T, but really does nothing.
|
---|
| 130 | */
|
---|
| 131 | template<class T>
|
---|
| 132 | class dummy {
|
---|
| 133 | public:
|
---|
| 134 | dummy() { }
|
---|
| 135 |
|
---|
| 136 | dummy(T value)
|
---|
| 137 | : value_(value)
|
---|
| 138 | { }
|
---|
| 139 |
|
---|
| 140 | dummy(const dummyArray&)
|
---|
| 141 | { }
|
---|
| 142 |
|
---|
| 143 | operator T() const { return value_; };
|
---|
| 144 |
|
---|
| 145 | template<class T2>
|
---|
| 146 | void operator=(T2) { }
|
---|
| 147 |
|
---|
| 148 | _bz_typename multicomponent_traits<T>::T_element operator[](int i) const
|
---|
| 149 | { return value_[i]; }
|
---|
| 150 |
|
---|
| 151 | void loadStride(int) { }
|
---|
| 152 | void moveTo(int) { }
|
---|
| 153 | void moveTo(int,int) { }
|
---|
| 154 | void moveTo(int,int,int) { }
|
---|
| 155 | void moveTo(int,int,int,int) { }
|
---|
| 156 | void advance() { }
|
---|
| 157 | T shift(int,int) { return T(); }
|
---|
| 158 |
|
---|
| 159 | private:
|
---|
| 160 | T value_;
|
---|
| 161 | };
|
---|
| 162 |
|
---|
| 163 |
|
---|
| 164 | /*
|
---|
| 165 | * The stencilExtent object is passed to stencil objects to find out
|
---|
| 166 | * the spatial extent of the stencil. It pretends it's an array,
|
---|
| 167 | * but really it's just recording the locations of the array reads
|
---|
| 168 | * via operator().
|
---|
| 169 | */
|
---|
| 170 |
|
---|
| 171 | template<int N_rank, class P_numtype>
|
---|
| 172 | class stencilExtent {
|
---|
| 173 | public:
|
---|
| 174 | typedef P_numtype T_numtype;
|
---|
| 175 |
|
---|
| 176 | stencilExtent()
|
---|
| 177 | {
|
---|
| 178 | min_ = 0;
|
---|
| 179 | max_ = 0;
|
---|
| 180 | }
|
---|
| 181 |
|
---|
| 182 | dummy<T_numtype> operator()(int i)
|
---|
| 183 | {
|
---|
| 184 | update(0, i);
|
---|
| 185 | return dummy<T_numtype>(1);
|
---|
| 186 | }
|
---|
| 187 |
|
---|
| 188 | dummy<T_numtype> operator()(int i, int j)
|
---|
| 189 | {
|
---|
| 190 | update(0, i);
|
---|
| 191 | update(1, j);
|
---|
| 192 | return dummy<T_numtype>(1);
|
---|
| 193 | }
|
---|
| 194 |
|
---|
| 195 | dummy<T_numtype> operator()(int i, int j, int k)
|
---|
| 196 | {
|
---|
| 197 | update(0, i);
|
---|
| 198 | update(1, j);
|
---|
| 199 | update(2, k);
|
---|
| 200 | return dummy<T_numtype>(1);
|
---|
| 201 | }
|
---|
| 202 |
|
---|
| 203 | dummy<T_numtype> shift(int offset, int dim)
|
---|
| 204 | {
|
---|
| 205 | update(dim, offset);
|
---|
| 206 | return dummy<T_numtype>(1);
|
---|
| 207 | }
|
---|
| 208 |
|
---|
| 209 | dummy<_bz_typename multicomponent_traits<T_numtype>::T_element>
|
---|
| 210 | operator[](int)
|
---|
| 211 | {
|
---|
| 212 | return dummy<_bz_typename multicomponent_traits<T_numtype>::T_element>
|
---|
| 213 | (1);
|
---|
| 214 | }
|
---|
| 215 |
|
---|
| 216 | void update(int rank, int offset)
|
---|
| 217 | {
|
---|
| 218 | if (offset < min_[rank])
|
---|
| 219 | min_[rank] = offset;
|
---|
| 220 | if (offset > max_[rank])
|
---|
| 221 | max_[rank] = offset;
|
---|
| 222 | }
|
---|
| 223 |
|
---|
| 224 | template<class T_numtype2>
|
---|
| 225 | void combine(const stencilExtent<N_rank,T_numtype2>& x)
|
---|
| 226 | {
|
---|
| 227 | for (int i=0; i < N_rank; ++i)
|
---|
| 228 | {
|
---|
| 229 | min_[i] = ::min(min_[i], x.min(i));
|
---|
| 230 | max_[i] = ::max(max_[i], x.max(i));
|
---|
| 231 | }
|
---|
| 232 | }
|
---|
| 233 |
|
---|
| 234 | template<class T_numtype2>
|
---|
| 235 | void combine(const dummy<T_numtype2>&)
|
---|
| 236 | { }
|
---|
| 237 |
|
---|
| 238 | int min(int i) const
|
---|
| 239 | { return min_[i]; }
|
---|
| 240 |
|
---|
| 241 | int max(int i) const
|
---|
| 242 | { return max_[i]; }
|
---|
| 243 |
|
---|
| 244 | const TinyVector<int,N_rank>& min() const
|
---|
| 245 | { return min_; }
|
---|
| 246 |
|
---|
| 247 | const TinyVector<int,N_rank>& max() const
|
---|
| 248 | { return max_; }
|
---|
| 249 |
|
---|
| 250 | template<class T>
|
---|
| 251 | void operator=(T)
|
---|
| 252 | { }
|
---|
| 253 |
|
---|
| 254 | // NEEDS_WORK: other operators
|
---|
| 255 | template<class T> void operator+=(T) { }
|
---|
| 256 | template<class T> void operator-=(T) { }
|
---|
| 257 | template<class T> void operator*=(T) { }
|
---|
| 258 | template<class T> void operator/=(T) { }
|
---|
| 259 |
|
---|
| 260 | operator T_numtype()
|
---|
| 261 | { return T_numtype(1); }
|
---|
| 262 |
|
---|
| 263 | T_numtype operator*()
|
---|
| 264 | { return T_numtype(1); }
|
---|
| 265 |
|
---|
| 266 | private:
|
---|
| 267 | _bz_mutable TinyVector<int,N_rank> min_, max_;
|
---|
| 268 | };
|
---|
| 269 |
|
---|
| 270 |
|
---|
| 271 | /*
|
---|
| 272 | * stencilExtent_traits gives a stencilExtent<N,T> object for arrays,
|
---|
| 273 | * and a dummy object for dummy arrays.
|
---|
| 274 | */
|
---|
| 275 | template<class T>
|
---|
| 276 | struct stencilExtent_traits {
|
---|
| 277 | typedef dummy<double> T_stencilExtent;
|
---|
| 278 | };
|
---|
| 279 |
|
---|
| 280 | template<class T_numtype, int N_rank>
|
---|
| 281 | struct stencilExtent_traits<Array<T_numtype,N_rank> > {
|
---|
| 282 | typedef stencilExtent<N_rank,T_numtype> T_stencilExtent;
|
---|
| 283 | };
|
---|
| 284 |
|
---|
| 285 | /*
|
---|
| 286 | * Specialization of areShapesConformable(), originally
|
---|
| 287 | * defined in <blitz/shapecheck.h>
|
---|
| 288 | */
|
---|
| 289 |
|
---|
| 290 | template<class T_shape1>
|
---|
| 291 | inline _bz_bool areShapesConformable(const T_shape1&, const dummyArray&)
|
---|
| 292 | {
|
---|
| 293 | return _bz_true;
|
---|
| 294 | }
|
---|
| 295 |
|
---|
| 296 | BZ_NAMESPACE_END
|
---|
| 297 |
|
---|
| 298 | #include <blitz/array/stencil.cc>
|
---|
| 299 |
|
---|
| 300 | #endif // BZ_ARRAYSTENCIL_H
|
---|
| 301 |
|
---|