forked from pytorch/pytorch
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pack_segments.cc
231 lines (208 loc) · 6.96 KB
/
pack_segments.cc
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
#include "caffe2/operators/pack_segments.h"
namespace caffe2 {
template <>
template <typename T>
bool PackSegmentsOp<CPUContext>::DoRunWithType() {
return DispatchHelper<
TensorTypes2<char, int32_t, int64_t, float, std::string>,
T>::call(this, Input(DATA));
}
template <>
template <typename T, typename Data_T>
bool PackSegmentsOp<CPUContext>::DoRunWithType2() {
const auto& data = Input(DATA);
const auto& lengths = Input(LENGTHS);
Tensor* presence_mask = nullptr;
if (return_presence_mask_) {
presence_mask = Output(1);
}
CAFFE_ENFORCE_GE(data.dim(), 1, "DATA should be at least 1-D");
CAFFE_ENFORCE_EQ(lengths.dim(), 1, "LENGTH should be 1-D");
// Find the length of the longest sequence.
const T* l = lengths.template data<T>();
T max_length = 0;
int64_t total_length = 0;
for (T i = 0; i < lengths.size(0); ++i) {
max_length = std::max(max_length, l[i]);
total_length += l[i];
}
if (max_length_ != -1) {
max_length = max_length_;
}
// Total lengths must be the same as data.dims(0)
CAFFE_ENFORCE_EQ(
data.size(0),
total_length,
" PackSegments requires that the sum of the lengths ",
total_length,
" is equal to the first data dimension ",
data.size(0));
auto shape =
data.sizes().vec(); // Shape of output is batch_size x max_len x ...
shape[0] = max_length;
shape.insert(shape.begin(), lengths.numel());
auto* output = Output(0, shape, at::dtype(data.dtype()));
// create output tensor
auto* out = static_cast<char*>(output->raw_mutable_data(data.dtype()));
bool* presence_mask_data = nullptr;
if (return_presence_mask_) {
// Shape of presence is batch_size x max_len
std::vector<int64_t> presence_shape{lengths.numel(), max_length};
presence_mask->Resize(presence_shape);
presence_mask_data = presence_mask->template mutable_data<bool>();
}
if (!data.size(0)) {
// Return empty output (with the proper shape)
return true;
}
// Do padding
if (output->template IsType<float>()) {
math::Set<float, CPUContext>(
output->numel(),
padding_,
output->template mutable_data<float>(),
&context_);
}
if (return_presence_mask_) {
memset(presence_mask_data, (int)false, presence_mask->numel());
}
auto block_size = data.size_from_dim(1);
auto block_bytesize = data.itemsize() * block_size;
const auto* d = static_cast<const char*>(data.raw_data());
int64_t start = 0;
for (int64_t i = 0; i < lengths.size(0); ++i) {
auto len = l[i] <= max_length ? l[i] : max_length;
context_.CopyItemsSameDevice(
data.dtype(),
len * block_size,
d + block_bytesize * start,
out + block_bytesize * max_length * i);
if (return_presence_mask_) {
memset(presence_mask_data + max_length * i, (int)true, len);
}
start += l[i];
}
return true;
}
template <>
template <typename T>
bool UnpackSegmentsOp<CPUContext>::DoRunWithType() {
return DispatchHelper<
TensorTypes2<char, int32_t, int64_t, float, std::string>,
T>::call(this, Input(DATA));
}
template <>
template <typename T, typename Data_T>
bool UnpackSegmentsOp<CPUContext>::DoRunWithType2() {
const auto& data = Input(DATA);
const auto& lengths = Input(LENGTHS);
auto* output = Output(0);
CAFFE_ENFORCE_GE(data.dim(), 2, "DATA should be at least 2-D");
CAFFE_ENFORCE_EQ(lengths.dim(), 1, "LENGTH should be 1-D");
if (max_length_ != -1) {
CAFFE_ENFORCE_EQ(
max_length_,
data.size(1),
"max_length should be equal to the second dimension of the packed segments");
}
const T* l = lengths.template data<T>();
int64_t total_l = 0;
if (max_length_ != -1) {
for (int64_t i = 0; i < lengths.size(0); ++i) {
total_l += (int64_t)(l[i] <= max_length_ ? l[i] : max_length_);
}
} else {
total_l = std::accumulate(l, l + lengths.size(0), (int64_t)0);
}
auto shape = data.sizes().vec();
CAFFE_ENFORCE_EQ(
shape[0], lengths.size(0), "LENGTH should match DATA in dimension 0");
shape.erase(shape.begin());
shape[0] = total_l;
output->Resize(shape);
// create output tensor
auto* out = static_cast<char*>(output->raw_mutable_data(data.dtype()));
if (!(data.size(0) && data.size(1))) {
return true;
}
auto block_size = data.size_from_dim(2);
auto block_bytesize = data.itemsize() * block_size;
const auto* d = static_cast<const char*>(data.raw_data());
int64_t start = 0;
for (int64_t i = 0; i < lengths.size(0); ++i) {
auto len = l[i];
if (max_length_ != -1 && l[i] > max_length_) {
len = max_length_;
}
context_.CopyItemsSameDevice(
data.dtype(),
len * block_size,
d + block_bytesize * data.size(1) * i,
out + block_bytesize * start);
start += len;
}
return true;
}
REGISTER_CPU_OPERATOR(PackSegments, PackSegmentsOp<CPUContext>);
REGISTER_CPU_OPERATOR(UnpackSegments, UnpackSegmentsOp<CPUContext>);
OPERATOR_SCHEMA(PackSegments)
.NumInputs(2)
.NumOutputs(1, 2)
.SetDoc(
"Map N dim tensor to N+1 dim based on length blob. Sequences that \
are shorter than the longest sequence are padded with zeros.")
.Input(
0,
"lengths",
"1-d int/long tensor contains the length in each of the output.")
.Input(1, "tensor", "N dim Tensor.")
.Output(
0,
"packed_tensor",
"N + 1 dim Tensor"
"where dim(1) is the max length"
", dim(0) is the batch size.")
.Output(
1,
"presence_mask",
"2 dim boolean tensor"
", false where packed_tensor is padded, true otherwise.")
.Arg("max_length", "The pre-defined max_length for the packed segments")
.Arg(
"pad_minf",
"Padding number in the packed segments. Use true to pad \
-infinity, otherwise pad zeros")
.Arg(
"return_presence_mask",
"bool whether to return presence mask, false by default");
OPERATOR_SCHEMA(UnpackSegments)
.NumInputs(2)
.NumOutputs(1)
.SetDoc("Map N+1 dim tensor to N dim based on length blob")
.Input(
0,
"lengths",
"1-d int/long tensor contains the length in each of the input.")
.Input(1, "tensor", "N+1 dim Tensor.")
.Output(0, "packed_tensor", "N dim Tensor")
.Arg("max_length", "The pre-defined max_length for the packed segments");
class GetPackSegmentsGradient : public GradientMakerBase {
using GradientMakerBase::GradientMakerBase;
vector<OperatorDef> GetGradientDefs() override {
return SingleGradientDef(
"UnpackSegments",
"",
vector<string>{I(0), GO(0)},
vector<string>{GI(1)});
}
};
REGISTER_GRADIENT(PackSegments, GetPackSegmentsGradient);
class GetUnpackSegmentsGradient : public GradientMakerBase {
using GradientMakerBase::GradientMakerBase;
vector<OperatorDef> GetGradientDefs() override {
return SingleGradientDef(
"PackSegments", "", vector<string>{I(0), GO(0)}, vector<string>{GI(1)});
}
};
REGISTER_GRADIENT(UnpackSegments, GetUnpackSegmentsGradient);
} // namespace caffe2