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
|
#pragma once
#include <algorithm>
#include <cstdint>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include "common/hash.h"
#include "common/logging.h"
namespace marian {
struct Slice // Python-like slice/index descriptor
{
Slice(int b, int e, int s) : begin(b), end(e), stride(s) {}
Slice(int b, int e) : Slice(b, e, 1) {}
Slice() : Slice(0, END) {}
explicit Slice(int i) : Slice(i, i + 1) {}
Slice(const Slice& other) : Slice(other.begin, other.end, other.stride) {}
const Slice& operator=(const Slice& other) { begin = other.begin; end = other.end; stride = other.stride; return *this; }
const Slice& operator=(int i) { begin = i; end = i + 1; stride = 1; return *this; }
bool operator==(const Slice& other) const { return begin == other.begin && end == other.end && stride == other.stride; }
bool operator!=(const Slice& other) const { return !(*this == other); }
/*const*/ int begin, end, stride;
static const int END = INT_MAX;
};
typedef std::vector<Slice> Slices;
struct Shape {
private:
std::vector<int> shape_;
public:
Shape() : shape_({1}) {}
Shape(std::initializer_list<int> il) : Shape() {
shape_.resize(il.size());
std::copy(il.begin(), il.end(), begin());
}
Shape(std::vector<int>&& shape) : shape_(std::move(shape)) {}
Shape(const Shape& shape) : Shape() {
shape_.resize(shape.size());
std::copy(shape.begin(), shape.end(), begin());
}
inline size_t size() const { return shape_.size(); }
void resize(size_t n) { shape_.resize(n, 1); }
const int* data() const { return shape_.data(); }
int* data() { return shape_.data(); }
inline void set(int i, int val) { dim(i) = val; }
inline void set(size_t i, int val) { dim(i) = val; }
inline void set(int i, size_t val) { dim(i) = (int)val; }
inline void set(size_t i, size_t val) { dim(i) = (int)val; }
inline int& dim(int i) {
if(i >= 0) {
ABORT_IF(i >= (int)size(),
"Index {} is out of bounds, shape has {} dimension",
i,
size());
return shape_[i];
} else {
ABORT_IF((int)size() + i < 0,
"Negative index {} is out of bounds, shape has {} dimension",
i,
size());
return shape_[size() + i];
}
}
inline const int& dim(int i) const {
return const_cast<Shape&>(*this).dim(i);
}
inline int& dim(size_t i) { return dim(int(i)); }
inline const int& dim(size_t i) const { return dim(int(i)); }
inline int operator[](int i) const { return dim(i); }
inline int operator[](int i) { return dim(i); }
inline int operator[](size_t i) const { return dim(i); }
inline int operator[](size_t i) { return dim(i); }
inline int back() const { return shape_.back(); }
inline int& back() { return shape_.back(); }
inline int stride(int i) const {
std::vector<int> stride(shape_.size(), 1);
for(int j = (int)shape_.size() - 2; j >= 0; --j)
stride[j] = stride[j + 1] * shape_[j + 1];
if(i >= 0)
return stride[i];
else
return stride[size() + i];
}
inline int elements() const {
int el = 1;
for(auto s : shape_)
el *= s;
return el;
}
inline void dims(int i, std::vector<int>& d) const {
d.resize(shape_.size());
std::vector<int> stride(shape_.size(), 1);
for(int j = (int)shape_.size() - 2; j >= 0; --j)
stride[j] = stride[j + 1] * shape_[j + 1];
for(size_t j = 0; j < d.size(); ++j)
d[j] = (i / stride[j]) % shape_[j];
}
auto begin() -> decltype(shape_.begin()) { return shape_.begin(); }
auto begin() const -> decltype(shape_.begin()) { return shape_.begin(); }
auto end() -> decltype(shape_.end()) { return shape_.end(); }
auto end() const -> decltype(shape_.end()) { return shape_.end(); }
auto rbegin() -> decltype(shape_.rbegin()) { return shape_.rbegin(); }
auto rbegin() const -> decltype(shape_.rbegin()) { return shape_.rbegin(); }
auto rend() -> decltype(shape_.rend()) { return shape_.rend(); }
auto rend() const -> decltype(shape_.rend()) { return shape_.rend(); }
bool operator==(const Shape& other) const {
return size() == other.size() && std::equal(begin(), end(), other.begin());
}
bool operator!=(const Shape& other) const { return !(*this == other); }
std::string toString() const {
std::stringstream strm;
strm << "shape=" << (*this)[0];
for(int i = 1; i < size(); ++i)
strm << "x" << (*this)[i];
strm << " size=" << elements();
return strm.str();
}
friend std::ostream& operator<<(std::ostream& strm, const Shape& shape) {
strm << shape.toString();
return strm;
}
operator std::string() const {
std::stringstream ss;
ss << *this;
return ss.str();
}
int axis(int ax) const {
if(ax < 0)
return (int)size() + ax;
else
return ax;
}
Slice slice(Slice slice, int ax) const { // interpret negative and special values in Slice
int n = dim(ax);
if (slice.begin < 0)
slice.begin += n;
if (slice.end < 0)
slice.end += n;
else if (slice.end == Slice::END)
slice.end = n;
return slice;
}
static Shape broadcast(const std::vector<Shape>& shapes) {
size_t maxDims = 0;
for(auto& s : shapes)
if(s.size() > maxDims)
maxDims = s.size();
Shape shape;
shape.resize(maxDims);
for(auto& s : shapes) {
for(int i = 1; i <= (int)s.size(); ++i) {
ABORT_IF(shape[-i] != s[-i] && shape[-i] != 1 && s[-i] != 1,
"Shapes {} and {} cannot be broadcast",
(std::string)shape,
(std::string)s);
shape.set(-i, std::max(shape[-i], s[-i]));
}
}
return shape;
}
template <typename T>
static Shape broadcast(const std::initializer_list<T>& il) {
return broadcast(std::vector<T>(il));
}
template <typename T>
static Shape broadcast(const std::vector<T>& nodes) {
size_t maxDims = 0;
for(auto& n : nodes)
if(n->shape().size() > maxDims)
maxDims = n->shape().size();
Shape shape;
shape.resize(maxDims);
for(auto& node : nodes) {
const Shape& shapen = node->shape();
for(int i = 1; i <= (int)shapen.size(); ++i) {
ABORT_IF(shape[-i] != shapen[-i] && shape[-i] != 1 && shapen[-i] != 1,
"Shapes {} and {} cannot be broadcasted",
(std::string)shape,
(std::string)shapen);
shape.set(-i, std::max(shape[-i], shapen[-i]));
}
}
return shape;
}
size_t hash() const {
size_t seed = util::hash<int>()(shape_[0]);
for(size_t i = 1; i < shape_.size(); ++i)
util::hash_combine(seed, shape_[i]);
return seed;
}
};
} // namespace marian
|