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
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
//! View handles movement operations on nodes.
//! It is midlayer between graph and IR representation of movement ops.
use std::{collections::BTreeMap, fmt::Display};
use crate::shape::{Axis, Dimension};
pub(super) type Stride = usize;
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, bitcode::Encode, bitcode::Decode)]
pub(super) struct StridedDim {
pub(super) axis: Axis,
pub(super) dim: Dimension,
pub(super) stride: Stride,
}
#[derive(Debug, PartialEq, Eq, Clone, PartialOrd, Ord, bitcode::Encode, bitcode::Decode)]
pub(super) enum View {
None,
//Contiguous(Vec<StridedDim>), // TODO perhaps later, mainly for cpu and perhaps wide loads on gpu
Strided(Vec<StridedDim>),
// First is typical strided, second is group of axes and their padding. Very ugly, but works.
// If you can make it nicer, please do.
Padded(Vec<StridedDim>, Vec<(Vec<Axis>, (isize, isize))>),
//Reshaped(), // TODO perhaps for some weird optimizations, but it may actually reduce performace
// since then loads are very unpredictable
}
impl View {
pub(super) fn new(shape: &[usize]) -> Self {
let mut stride = 1;
let mut view: Vec<StridedDim> = shape
.iter()
.enumerate()
.rev()
.map(|(axis, dim)| {
let temp = stride;
stride *= dim;
StridedDim {
axis,
stride: temp,
dim: *dim,
}
})
.collect();
view.reverse();
return View::Strided(view);
}
/// Creates view binded to specific axes
pub(super) fn binded(shape: &[usize], axes: &[usize]) -> Self {
assert_eq!(shape.len(), axes.len());
let mut stride = 1;
let mut view: Vec<StridedDim> = shape
.iter()
.zip(axes)
.rev()
.map(|(&dim, &axis)| {
let temp = stride;
stride *= dim;
StridedDim {
axis,
stride: temp,
dim,
}
})
.collect();
view.reverse();
return View::Strided(view);
}
pub(super) fn shape(&self) -> Vec<usize> {
match self {
View::None => vec![1],
View::Strided(dims) => dims.iter().map(|dim| dim.dim).collect(),
View::Padded(dims, _) => dims.iter().map(|dim| dim.dim).collect(),
}
}
pub(super) fn rank(&self) -> usize {
match self {
View::None => 1,
View::Strided(dims) => dims.len(),
View::Padded(dims, _) => dims.len(),
}
}
/// Returns sorted used axes
pub(super) fn used_axes(&self) -> Vec<Axis> {
match self {
View::None => Vec::new(),
View::Strided(dims) | View::Padded(dims, _) => {
let mut res: Vec<Axis> = dims
.iter()
.flat_map(|x| if x.stride != 0 { Some(x.axis) } else { None })
.collect();
res.sort();
res
}
}
}
pub(super) fn requires_conditional_padding(&self) -> bool {
// View requires conditional padding if any padding is more than zero
if let View::Padded(_, padding) = self {
return padding.iter().any(|(_, (lp, rp))| *lp > 0 || *rp > 0);
}
false
}
pub(super) fn original_numel(&self) -> usize {
//println!("Original numel {self}");
match self {
View::None => 1,
View::Strided(dims) => dims
.iter()
.map(|dim| if dim.stride != 0 { dim.dim } else { 1 })
.product(),
View::Padded(dims, axes) => axes
.iter()
.map(|(axes, (lp, rp))| {
let numel: usize = dims
.iter()
.filter_map(|StridedDim { axis, dim, .. }| {
if axes.contains(axis) {
Some(*dim)
} else {
None
}
})
.product();
//println!("{numel}, {lp}, {rp}");
(numel as isize - lp - rp) as usize
})
.product(),
}
}
pub(super) fn permute(&mut self, axes: &[usize]) {
//println!("Permuting {self} by {axes:?}");
assert_eq!(self.rank(), axes.len());
match self {
View::None => {}
View::Strided(dims) => {
*dims = axes.iter().map(|axis| dims[*axis]).collect();
for (a, dim) in dims.iter_mut().enumerate() {
dim.axis = a;
}
}
View::Padded(dims, padding) => {
*dims = axes.iter().map(|axis| dims[*axis]).collect();
for (a, dim) in dims.iter_mut().enumerate() {
dim.axis = a;
}
// TODO is this correct?
let axes_map: BTreeMap<usize, usize> =
(0..axes.len()).zip(axes.iter().copied()).collect();
for (axes, _) in padding {
for d in axes {
*d = axes_map[d];
}
}
}
}
}
//pub(super) fn arbitrary_permute(&mut self, axes: &[usize]) { todo!() }
pub(super) fn pad_axis(&mut self, axis: Axis, left_pad: isize, right_pad: isize) {
//println!("Padding {axis} with {left_pad}, {right_pad}");
let paxis = axis;
match self {
View::None => {}
View::Strided(dims) => {
if dims.iter().any(|&StridedDim { axis, .. }| axis == paxis) {
*self = View::Padded(
dims.iter()
.map(|&StridedDim { axis, dim, stride }| {
if axis == paxis {
StridedDim {
axis,
dim: (dim as isize + left_pad + right_pad) as usize,
stride,
}
} else {
StridedDim { axis, dim, stride }
}
})
.collect(),
vec![(vec![axis], (left_pad, right_pad))],
);
}
}
View::Padded(dims, padding) => {
if let Some(StridedDim { dim, .. }) = dims
.iter_mut()
.find(|StridedDim { axis, .. }| *axis == paxis)
{
//println!("Padding axis {axis}, dim {dim} with {left_pad}, {right_pad}");
*dim = (*dim as isize + left_pad + right_pad) as usize;
if let Some((_, (lp, rp))) =
padding.iter_mut().find(|(axes, _)| axes.contains(&axis))
{
*lp += left_pad;
*rp += right_pad;
} else {
padding.push((vec![axis], (left_pad, right_pad)));
padding.sort();
}
}
}
}
//println!("Result {self}");
}
pub(super) fn expand(&mut self, axis: Axis, dimension: Dimension) {
// TODO probably instead of changing stride to 0, we can simply
// remove the dimension alltogether
/*let _ = dimension;
match self {
View::None => {}
View::Strided(dims) => {
dims.retain(|x| x.axis != axis);
}
View::Padded(dims, pa) => {
dims.retain(|x| x.axis != axis);
pa.axes.iter_mut().for_each(|(v, _)| v.retain(|a| *a != axis));
pa.axes.retain(|(axes, _)| !axes.is_empty());
}
}*/
match self {
View::None => {}
View::Strided(dims) => {
for StridedDim {
axis: paxis,
dim,
stride,
..
} in dims.iter_mut()
{
if axis == *paxis {
assert_eq!(*dim, 1);
*stride = 0;
*dim = dimension;
}
}
}
View::Padded(dims, padding) => {
for StridedDim {
axis: paxis,
dim,
stride,
..
} in dims.iter_mut()
{
if axis == *paxis {
assert_eq!(*dim, 1);
*stride = 0;
*dim = dimension;
// Remove expanded axes from padding
for (axes, _) in padding.iter_mut() {
if let Some(id) = axes.iter().position(|&a| a == axis) {
axes.remove(id);
}
}
}
}
}
}
}
pub(super) fn numel(&self) -> usize {
match self {
View::None => 0,
View::Strided(dims) => dims.iter().map(|dim| dim.dim).product(),
View::Padded(dims, _) => dims.iter().map(|dim| dim.dim).product(),
}
}
pub(super) fn is_contiguous(&self) -> bool {
&View::new(&self.shape()) == self
}
pub(super) fn split_axis(&mut self, axis: Axis, dimensions: &[usize]) {
//println!("{axis}, {dimensions:?}");
match self {
View::None => {}
View::Strided(dims) => {
// Rename all following axes
for st_dim in dims.iter_mut() {
if axis < st_dim.axis {
st_dim.axis += dimensions.len() - 1;
}
}
if let Some((id, st_dim)) = dims
.iter_mut()
.enumerate()
.find(|(_, dim)| dim.axis == axis)
{
let mut stride = st_dim.stride;
dims.remove(id);
let mut temp_axis = axis + dimensions.len();
for dim in dimensions.iter().copied().rev() {
temp_axis -= 1;
dims.insert(
id,
StridedDim {
axis: temp_axis,
dim,
stride,
},
);
stride *= dim;
}
}
}
View::Padded(dims, padding) => {
let dim_len = dimensions.len();
for st_dim in dims.iter_mut() {
if axis < st_dim.axis {
st_dim.axis += dim_len - 1;
}
}
if let Some((id, st_dim)) = dims
.iter_mut()
.enumerate()
.find(|(_, dim)| dim.axis == axis)
{
let mut stride = st_dim.stride;
dims.remove(id);
let mut temp_axis = axis + dimensions.len();
for dim in dimensions.iter().copied().rev() {
temp_axis -= 1;
dims.insert(
id,
StridedDim {
axis: temp_axis,
dim,
stride,
},
);
stride *= dim;
}
}
// If key in padding axes is greater than axis, then add dim_len - 1 to it
for (axes, _) in padding.iter_mut() {
for a in axes {
if *a > axis {
*a += dim_len - 1;
}
}
}
// Split padding
if let Some((axes, _)) = padding.iter_mut().find(|(k, _)| k.contains(&axis)) {
//std::println!("Original: {axes:?} splitting into: {axis}..{}", axis+dim_len);
for a in axis + 1..axis + dim_len {
if dims.iter().find(|dim| dim.axis == a).unwrap().dim != 1 {
axes.push(a);
}
}
// Would not be needed on btreeset
axes.sort();
}
}
}
}
}
impl Display for View {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
match self {
View::None => f.write_str("View::None"),
View::Strided(dims) => f.write_fmt(format_args!(
"V:S ax{:?} sh{:?} st{:?}",
dims.iter().map(|d| d.axis).collect::<Vec<Dimension>>(),
dims.iter().map(|d| d.dim).collect::<Vec<Dimension>>(),
dims.iter().map(|d| d.stride).collect::<Vec<Stride>>()
)),
View::Padded(dims, padding) => f.write_fmt(format_args!(
"V:P ax{:?} sh{:?} st{:?} pd{:?}",
dims.iter().map(|d| d.axis).collect::<Vec<Dimension>>(),
dims.iter().map(|d| d.dim).collect::<Vec<Dimension>>(),
dims.iter().map(|d| d.stride).collect::<Vec<Stride>>(),
padding,
)),
}
}
}