Repository navigation
Expand file tree
/
Copy pathsymmetries.h
More file actions
357 lines (318 loc) · 9.32 KB
/
Copy pathsymmetries.h
File metadata and controls
357 lines (318 loc) · 9.32 KB
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
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
// Copyright 2018 Google LLC
//
// 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.
#ifndef CC_SYMMETRIES_H_
#define CC_SYMMETRIES_H_
#include <array>
#include <cstring>
#include <ostream>
#include "cc/coord.h"
#include "cc/logging.h"
namespace minigo {
namespace symmetry {
enum Symmetry : uint8_t {
// No transform.
kIdentity,
// 90 degree anticlockwise rotation.
kRot90,
// 180 degree rotation.
kRot180,
// 270 degree clockwise rotation.
kRot270,
// Transpose.
kFlip,
// Transpose then 90 degree anticlockwise rotation (vertical reflection).
kFlipRot90,
// Transpose then 180 degree rotation.
kFlipRot180,
// Transpose then 270 degree anticlockwise rotation (horizontal reflection).
kFlipRot270,
kNumSymmetries,
};
std::ostream& operator<<(std::ostream& os, Symmetry sym);
// Helpful array of all symmetries that allows iterating over all symmetries
// without casting between int and Symmetry all the time.
extern const std::array<Symmetry, kNumSymmetries> kAllSymmetries;
// Array of inverses.
extern const std::array<Symmetry, kNumSymmetries> kInverseSymmetries;
extern const std::array<std::array<Coord, kNumMoves>, kNumSymmetries> kCoords;
inline Symmetry Inverse(Symmetry sym) { return kInverseSymmetries[sym]; }
// Identity symmetry is the same for both interleaved (NHWC) and planar (NCHW)
// data.
template <int N, int num, typename T>
inline void Identity(const T* src, T* dst) {
MG_DCHECK(dst != src);
std::memcpy(dst, src, N * N * num * sizeof(T));
}
// Symmetries for interleaved tensors (NHWC).
template <int N, int num_channels, typename T>
inline void Rot90Interleaved(const T* src, T* dst) {
MG_DCHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1 - j) * num_channels;
for (int i = 0; i < N; ++i) {
std::memcpy(dst, s, num_channels * sizeof(T));
dst += num_channels;
s += row_stride;
}
}
}
template <int N, int num_channels, typename T>
inline void Rot180Interleaved(const T* src, T* dst) {
MG_DCHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1 - j) * row_stride + (N - 1) * num_channels;
for (int i = 0; i < N; ++i) {
std::memcpy(dst, s, num_channels * sizeof(T));
dst += num_channels;
s -= num_channels;
}
}
}
template <int N, int num_channels, typename T>
inline void Rot270Interleaved(const T* src, T* dst) {
MG_DCHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1) * row_stride + j * num_channels;
for (int i = 0; i < N; ++i) {
std::memcpy(dst, s, num_channels * sizeof(T));
dst += num_channels;
s -= row_stride;
}
}
}
template <int N, int num_channels, typename T>
inline void FlipInterleaved(const T* src, T* dst) {
MG_DCHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + j * num_channels;
for (int i = 0; i < N; ++i) {
std::memcpy(dst, s, num_channels * sizeof(T));
dst += num_channels;
s += row_stride;
}
}
}
template <int N, int num_channels, typename T>
inline void FlipRot90Interleaved(const T* src, T* dst) {
MG_DCHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1 - j) * row_stride;
for (int i = 0; i < N; ++i) {
std::memcpy(dst, s, num_channels * sizeof(T));
dst += num_channels;
s += num_channels;
}
}
}
template <int N, int num_channels, typename T>
inline void FlipRot180Interleaved(const T* src, T* dst) {
MG_DCHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1) * row_stride + (N - 1 - j) * num_channels;
for (int i = 0; i < N; ++i) {
std::memcpy(dst, s, num_channels * sizeof(T));
dst += num_channels;
s -= row_stride;
}
}
}
template <int N, int num_channels, typename T>
inline void FlipRot270Interleaved(const T* src, T* dst) {
MG_DCHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + j * row_stride + (N - 1) * num_channels;
for (int i = 0; i < N; ++i) {
std::memcpy(dst, s, num_channels * sizeof(T));
dst += num_channels;
s -= num_channels;
}
}
}
// TODO(tommadams): rename ApplySymmetry to ApplySymmetryInterleaved
template <int N, int num_channels, typename T>
inline void ApplySymmetry(Symmetry sym, const T* src, T* dst) {
switch (sym) {
case kIdentity:
Identity<N, num_channels>(src, dst);
break;
case Symmetry::kRot90:
Rot90Interleaved<N, num_channels>(src, dst);
break;
case Symmetry::kRot180:
Rot180Interleaved<N, num_channels>(src, dst);
break;
case Symmetry::kRot270:
Rot270Interleaved<N, num_channels>(src, dst);
break;
case Symmetry::kFlip:
FlipInterleaved<N, num_channels>(src, dst);
break;
case Symmetry::kFlipRot90:
FlipRot90Interleaved<N, num_channels>(src, dst);
break;
case Symmetry::kFlipRot180:
FlipRot180Interleaved<N, num_channels>(src, dst);
break;
case Symmetry::kFlipRot270:
FlipRot270Interleaved<N, num_channels>(src, dst);
break;
default:
MG_LOG(FATAL) << static_cast<int>(sym);
break;
}
}
// Symmetries for planar tensors (NCHW).
template <int N, int num_planes, typename T>
inline void Rot90Planar(const T* src, T* dst) {
MG_DCHECK(dst != src);
for (int p = 0; p < num_planes; ++p) {
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1 - j);
for (int i = 0; i < N; ++i) {
*dst++ = *s;
s += N;
}
}
src += N * N;
}
}
template <int N, int num_planes, typename T>
inline void Rot180Planar(const T* src, T* dst) {
MG_DCHECK(dst != src);
for (int p = 0; p < num_planes; ++p) {
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1 - j) * N + (N - 1);
for (int i = 0; i < N; ++i) {
*dst++ = *s;
s -= 1;
}
}
src += N * N;
}
}
template <int N, int num_planes, typename T>
inline void Rot270Planar(const T* src, T* dst) {
MG_DCHECK(dst != src);
for (int p = 0; p < num_planes; ++p) {
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1) * N + j;
for (int i = 0; i < N; ++i) {
*dst++ = *s;
s -= N;
}
}
src += N * N;
}
}
template <int N, int num_planes, typename T>
inline void FlipPlanar(const T* src, T* dst) {
MG_DCHECK(dst != src);
for (int p = 0; p < num_planes; ++p) {
for (int j = 0; j < N; ++j) {
auto s = src + j;
for (int i = 0; i < N; ++i) {
*dst++ = *s;
s += N;
}
}
src += N * N;
}
}
template <int N, int num_planes, typename T>
inline void FlipRot90Planar(const T* src, T* dst) {
MG_DCHECK(dst != src);
for (int p = 0; p < num_planes; ++p) {
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1 - j) * N;
for (int i = 0; i < N; ++i) {
*dst++ = *s;
s += 1;
}
}
src += N * N;
}
}
template <int N, int num_planes, typename T>
inline void FlipRot180Planar(const T* src, T* dst) {
MG_DCHECK(dst != src);
for (int p = 0; p < num_planes; ++p) {
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1) * N + (N - 1 - j);
for (int i = 0; i < N; ++i) {
*dst++ = *s;
s -= N;
}
}
src += N * N;
}
}
template <int N, int num_planes, typename T>
inline void FlipRot270Planar(const T* src, T* dst) {
MG_DCHECK(dst != src);
for (int p = 0; p < num_planes; ++p) {
for (int j = 0; j < N; ++j) {
auto s = src + j * N + (N - 1);
for (int i = 0; i < N; ++i) {
*dst++ = *s;
s -= 1;
}
}
src += N * N;
}
}
template <int N, int num_planes, typename T>
inline void ApplySymmetryPlanar(Symmetry sym, const T* src, T* dst) {
switch (sym) {
case kIdentity:
Identity<N, num_planes>(src, dst);
break;
case Symmetry::kRot90:
Rot90Planar<N, num_planes>(src, dst);
break;
case Symmetry::kRot180:
Rot180Planar<N, num_planes>(src, dst);
break;
case Symmetry::kRot270:
Rot270Planar<N, num_planes>(src, dst);
break;
case Symmetry::kFlip:
FlipPlanar<N, num_planes>(src, dst);
break;
case Symmetry::kFlipRot90:
FlipRot90Planar<N, num_planes>(src, dst);
break;
case Symmetry::kFlipRot180:
FlipRot180Planar<N, num_planes>(src, dst);
break;
case Symmetry::kFlipRot270:
FlipRot270Planar<N, num_planes>(src, dst);
break;
default:
MG_LOG(FATAL) << static_cast<int>(sym);
break;
}
}
Coord ApplySymmetry(Symmetry sym, Coord c);
// Returns the Symmetry obtained by first applying a then b.
Symmetry Concat(Symmetry a, Symmetry b);
} // namespace symmetry
} // namespace minigo
#endif // CC_SYMMETRIES_H_