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
|
#include <torch/csrc/lazy/core/lazy_view.h>
#include <torch/csrc/lazy/core/helpers.h>
#include <torch/csrc/lazy/core/ir_builder.h>
#include <torch/csrc/lazy/core/ops/utils.h>
#include <torch/csrc/lazy/core/permutation_util.h>
#include <c10/util/Exception.h>
#include <algorithm>
#include <functional>
#include <numeric>
namespace torch {
namespace lazy {
namespace {
Value ApplyViewInfo(Value ir_value, const ViewInfo& view_info) {
switch (view_info.view_type) {
case ViewInfo::Type::kSelect:
return MakeSelect(
ir_value,
view_info.select->dim,
view_info.select->start,
view_info.select->end,
view_info.select->stride);
case ViewInfo::Type::kNarrow:
return MakeNarrow(
ir_value, view_info.indices, view_info.shape.sizes().vec());
case ViewInfo::Type::kNoOp:
return ir_value;
case ViewInfo::Type::kPermute:
return MakePermute(ir_value, view_info.permutation);
case ViewInfo::Type::kReshape:
return MakeView(ir_value, view_info.shape.sizes().vec());
case ViewInfo::Type::kResize:
return MakeResize(ir_value, view_info.shape.sizes().vec());
case ViewInfo::Type::kSqueeze:
return MakeSqueeze(ir_value, view_info.squeeze_index);
case ViewInfo::Type::kUnsqueeze:
return MakeUnsqueeze(ir_value, view_info.squeeze_index);
case ViewInfo::Type::kAsStrided:
return MakeAsStrided(
ir_value,
view_info.shape.sizes().vec(),
view_info.as_strided->stride,
view_info.as_strided->offset);
case ViewInfo::Type::kDiagonal:
return MakeDiagonal(
ir_value,
view_info.diagonal->offset,
view_info.diagonal->dim1,
view_info.diagonal->dim2);
default:
TORCH_INTERNAL_ASSERT(
false, "Invalid view type: ", GetEnumValue(view_info.view_type));
}
}
// Here we are trying to populate inplace updated values from the latest view
// all the way back to the original tensor.
// For example:
// a = torch.diagonal(b)
// b.add_(1) # a should be updated as well.
//
// Ideally we should all have a *ViewUpdate IR which updates the original
// tensor/view withe current value. See DiagonalViewUpdate and corresponding
// LowerDiagonalViewUpdate in ts_node_lowering.cpp. There are some "edge cases"
// here simply because they can smartly reuse some other ops to undo themselves.
Value ApplyUpdate(Value ir_value, const Alias::UpdateData& update_data) {
// We first bring the source IR value forward, by reshaping and slicing.
std::vector<Value> tmp_values({ir_value});
for (const ViewInfo& view_info : update_data.view_infos) {
tmp_values.push_back(ApplyViewInfo(tmp_values.back(), view_info));
}
// We then move backward given the source update value, by reshaping and
// slice-updating.
Value result = update_data.ir_value;
for (size_t i = update_data.view_infos.size(); i > 0; --i) {
const ViewInfo& view_info = update_data.view_infos[i - 1];
switch (view_info.view_type) {
case ViewInfo::Type::kSelect:
result = MakeSelectViewUpdate(
tmp_values[i - 1],
result,
view_info.select->dim,
view_info.select->start,
view_info.select->end,
view_info.select->stride);
break;
case ViewInfo::Type::kNarrow:
result =
MakeNarrowViewUpdate(tmp_values[i - 1], result, view_info.indices);
break;
case ViewInfo::Type::kNoOp:
break;
case ViewInfo::Type::kPermute:
result = MakePermute(result, InversePermutation(view_info.permutation));
break;
case ViewInfo::Type::kReshape:
result = MakeView(result, view_info.source_shape.sizes().vec());
break;
case ViewInfo::Type::kResize:
result = MakeResize(result, view_info.source_shape.sizes().vec());
break;
case ViewInfo::Type::kSqueeze:
result = MakeUnsqueeze(ir_value, view_info.squeeze_index);
break;
case ViewInfo::Type::kUnsqueeze:
result = MakeSqueeze(ir_value, view_info.squeeze_index);
break;
case ViewInfo::Type::kAsStrided:
result = MakeAsStridedViewUpdate(
tmp_values[i - 1],
result,
view_info.source_shape.sizes().vec(),
view_info.as_strided->stride,
view_info.as_strided->offset);
break;
case ViewInfo::Type::kDiagonal:
result = MakeDiagonalViewUpdate(
tmp_values[i - 1],
result,
view_info.diagonal->offset,
view_info.diagonal->dim1,
view_info.diagonal->dim2);
break;
default:
TORCH_INTERNAL_ASSERT(
false, "Invalid view type: ", GetEnumValue(view_info.view_type));
}
}
return result;
}
} // namespace
ViewInfo::ViewInfo(Type view_type, Shape shape, Shape source_shape)
: view_type(view_type),
shape(std::move(shape)),
indices(source_shape.dim(), 0),
source_shape(std::move(source_shape)) {}
ViewInfo::ViewInfo(Type view_type, Shape shape, Shape source_shape, int64_t sqi)
: view_type(view_type),
shape(std::move(shape)),
source_shape(std::move(source_shape)),
squeeze_index(sqi) {
TORCH_CHECK(view_type == Type::kSqueeze);
}
ViewInfo::ViewInfo(
Type view_type,
Shape source_shape,
std::vector<int64_t> permutation)
: view_type(view_type),
shape(MakePermuteShape(source_shape, permutation)),
source_shape(std::move(source_shape)),
permutation(std::move(permutation)) {
TORCH_CHECK(view_type == Type::kPermute);
}
ViewInfo::ViewInfo(Type view_type, const Shape& source_shape, SelectInfo select)
: view_type(view_type),
shape(MakeSelectShape(
source_shape,
select.dim,
select.start,
select.end,
select.stride)),
source_shape(source_shape),
select(select) {
TORCH_CHECK(view_type == Type::kSelect);
}
ViewInfo::ViewInfo(
Type view_type,
Shape shape,
Shape source_shape,
AsStridedInfo as_strided)
: view_type(view_type),
shape(std::move(shape)),
source_shape(std::move(source_shape)),
as_strided(std::move(as_strided)) {
TORCH_CHECK(view_type == Type::kAsStrided);
}
ViewInfo::ViewInfo(
Type view_type,
const Shape& source_shape,
DiagonalInfo diagonal)
: view_type(view_type),
shape(MakeDiagonalShape(
source_shape,
diagonal.offset,
diagonal.dim1,
diagonal.dim2)),
source_shape(source_shape),
diagonal(diagonal) {
TORCH_CHECK(view_type == Type::kDiagonal);
}
void Alias::Update(Value ir_value, std::vector<ViewInfo> view_infos) {
if (!updates_.empty() && updates_.back().view_infos == view_infos) {
updates_.back().ir_value = std::move(ir_value);
} else {
updates_.push_back({std::move(ir_value), std::move(view_infos)});
}
++generation_;
}
Value Alias::SyncUpdateOperations() {
for (auto& update_data : updates_) {
root_ir_value_ = ApplyUpdate(root_ir_value_, update_data);
}
updates_.clear();
return root_ir_value_;
}
LazyView::LazyView(
Shape shape,
std::shared_ptr<Alias> alias,
ViewInfo view_info)
: shape_(std::move(shape)), alias_(std::move(alias)) {
view_infos_.push_back(std::move(view_info));
}
LazyView::LazyView(
Shape shape,
std::shared_ptr<Alias> alias,
std::vector<ViewInfo> view_infos)
: view_infos_(std::move(view_infos)),
shape_(std::move(shape)),
alias_(std::move(alias)) {}
void LazyView::Update(Value ir_value) {
alias_->Update(std::move(ir_value), view_infos_);
}
std::shared_ptr<LazyView> LazyView::CreateSubView(
Shape shape,
ViewInfo view_info) {
std::vector<ViewInfo> view_infos(view_infos_);
view_infos.push_back(std::move(view_info));
return std::make_shared<LazyView>(
std::move(shape), alias_, std::move(view_infos));
}
std::tuple<Value, bool> LazyView::GetViewIrNode() {
if (IsUpToDate()) {
return std::make_tuple(ir_value_, false);
}
Value update = alias_->SyncUpdateOperations();
for (auto& view_info : view_infos_) {
update = ApplyViewInfo(update, view_info);
}
ir_value_ = update;
generation_ = alias_->generation();
return std::make_tuple(ir_value_, true);
}
} // namespace lazy
} // namespace torch
|
