packed-matrix.cc
12.8 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
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
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
// matrix/packed-matrix.cc
// Copyright 2009-2012 Microsoft Corporation Saarland University
// Johns Hopkins University (Author: Daniel Povey);
// Haihua Xu
// See ../../COPYING for clarification regarding multiple authors
//
// 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
// THIS CODE IS PROVIDED *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
// WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
// MERCHANTABLITY OR NON-INFRINGEMENT.
// See the Apache 2 License for the specific language governing permissions and
// limitations under the License.
/**
* @file packed-matrix.cc
*
* Implementation of specialized PackedMatrix template methods
*/
#include "matrix/cblas-wrappers.h"
#include "matrix/packed-matrix.h"
#include "matrix/kaldi-vector.h"
namespace kaldi {
template<typename Real>
void PackedMatrix<Real>::Scale(Real alpha) {
size_t nr = num_rows_,
sz = (nr * (nr + 1)) / 2;
cblas_Xscal(sz, alpha, data_, 1);
}
template<typename Real>
void PackedMatrix<Real>::AddPacked(const Real alpha, const PackedMatrix<Real> &rMa) {
KALDI_ASSERT(num_rows_ == rMa.NumRows());
size_t nr = num_rows_,
sz = (nr * (nr + 1)) / 2;
cblas_Xaxpy(sz, alpha, rMa.Data(), 1, data_, 1);
}
template<typename Real>
void PackedMatrix<Real>::SetRandn() {
Real *data = data_;
size_t dim = num_rows_, size = ((dim*(dim+1))/2);
for (size_t i = 0; i < size; i++)
data[i] = RandGauss();
}
template<typename Real>
inline void PackedMatrix<Real>::Init(MatrixIndexT r) {
if (r == 0) {
num_rows_ = 0;
data_ = 0;
return;
}
size_t size = ((static_cast<size_t>(r) * static_cast<size_t>(r + 1)) / 2);
if (static_cast<size_t>(static_cast<MatrixIndexT>(size)) != size) {
KALDI_WARN << "Allocating packed matrix whose full dimension does not fit "
<< "in MatrixIndexT: not all code is tested for this case.";
}
void *data; // aligned memory block
void *temp;
if ((data = KALDI_MEMALIGN(16, size * sizeof(Real), &temp)) != NULL) {
this->data_ = static_cast<Real *> (data);
this->num_rows_ = r;
} else {
throw std::bad_alloc();
}
}
template<typename Real>
void PackedMatrix<Real>::Swap(PackedMatrix<Real> *other) {
std::swap(data_, other->data_);
std::swap(num_rows_, other->num_rows_);
}
template<typename Real>
void PackedMatrix<Real>::Swap(Matrix<Real> *other) {
std::swap(data_, other->data_);
std::swap(num_rows_, other->num_rows_);
}
template<typename Real>
void PackedMatrix<Real>::Resize(MatrixIndexT r, MatrixResizeType resize_type) {
// the next block uses recursion to handle what we have to do if
// resize_type == kCopyData.
if (resize_type == kCopyData) {
if (this->data_ == NULL || r == 0) resize_type = kSetZero; // nothing to copy.
else if (this->num_rows_ == r) { return; } // nothing to do.
else {
// set tmp to a packed matrix of the desired size.
PackedMatrix<Real> tmp(r, kUndefined);
size_t r_min = std::min(r, num_rows_);
size_t mem_size_min = sizeof(Real) * (r_min*(r_min+1))/2,
mem_size_full = sizeof(Real) * (r*(r+1))/2;
// Copy the contents to tmp.
memcpy(tmp.data_, data_, mem_size_min);
char *ptr = static_cast<char*>(static_cast<void*>(tmp.data_));
// Set the rest of the contents of tmp to zero.
memset(static_cast<void*>(ptr + mem_size_min), 0, mem_size_full-mem_size_min);
tmp.Swap(this);
return;
}
}
if (data_ != NULL) Destroy();
Init(r);
if (resize_type == kSetZero) SetZero();
}
template<typename Real>
void PackedMatrix<Real>::AddToDiag(Real r) {
Real *ptr = data_;
for (MatrixIndexT i = 2; i <= num_rows_+1; i++) {
*ptr += r;
ptr += i;
}
}
template<typename Real>
void PackedMatrix<Real>::ScaleDiag(Real alpha) {
Real *ptr = data_;
for (MatrixIndexT i = 2; i <= num_rows_+1; i++) {
*ptr *= alpha;
ptr += i;
}
}
template<typename Real>
void PackedMatrix<Real>::SetDiag(Real alpha) {
Real *ptr = data_;
for (MatrixIndexT i = 2; i <= num_rows_+1; i++) {
*ptr = alpha;
ptr += i;
}
}
template<typename Real>
template<typename OtherReal>
void PackedMatrix<Real>::CopyFromPacked(const PackedMatrix<OtherReal> &orig) {
KALDI_ASSERT(NumRows() == orig.NumRows());
if (sizeof(Real) == sizeof(OtherReal)) {
memcpy(data_, orig.Data(), SizeInBytes());
} else {
Real *dst = data_;
const OtherReal *src = orig.Data();
size_t nr = NumRows(),
size = (nr * (nr + 1)) / 2;
for (size_t i = 0; i < size; i++, dst++, src++)
*dst = *src;
}
}
// template instantiations.
template
void PackedMatrix<float>::CopyFromPacked(const PackedMatrix<double> &orig);
template
void PackedMatrix<double>::CopyFromPacked(const PackedMatrix<float> &orig);
template
void PackedMatrix<double>::CopyFromPacked(const PackedMatrix<double> &orig);
template
void PackedMatrix<float>::CopyFromPacked(const PackedMatrix<float> &orig);
template<typename Real>
template<typename OtherReal>
void PackedMatrix<Real>::CopyFromVec(const SubVector<OtherReal> &vec) {
MatrixIndexT size = (NumRows()*(NumRows()+1)) / 2;
KALDI_ASSERT(vec.Dim() == size);
if (sizeof(Real) == sizeof(OtherReal)) {
memcpy(data_, vec.Data(), size * sizeof(Real));
} else {
Real *dst = data_;
const OtherReal *src = vec.Data();
for (MatrixIndexT i = 0; i < size; i++, dst++, src++)
*dst = *src;
}
}
// template instantiations.
template
void PackedMatrix<float>::CopyFromVec(const SubVector<double> &orig);
template
void PackedMatrix<double>::CopyFromVec(const SubVector<float> &orig);
template
void PackedMatrix<double>::CopyFromVec(const SubVector<double> &orig);
template
void PackedMatrix<float>::CopyFromVec(const SubVector<float> &orig);
template<typename Real>
void PackedMatrix<Real>::SetZero() {
memset(data_, 0, SizeInBytes());
}
template<typename Real>
void PackedMatrix<Real>::SetUnit() {
memset(data_, 0, SizeInBytes());
for (MatrixIndexT row = 0;row < num_rows_;row++)
(*this)(row, row) = 1.0;
}
template<typename Real>
Real PackedMatrix<Real>::Trace() const {
Real ans = 0.0;
for (MatrixIndexT row = 0;row < num_rows_;row++)
ans += (*this)(row, row);
return ans;
}
template<typename Real>
void PackedMatrix<Real>::Destroy() {
// we need to free the data block if it was defined
if (data_ != NULL) KALDI_MEMALIGN_FREE(data_);
data_ = NULL;
num_rows_ = 0;
}
template<typename Real>
void PackedMatrix<Real>::Write(std::ostream &os, bool binary) const {
if (!os.good()) {
KALDI_ERR << "Failed to write vector to stream: stream not good";
}
int32 size = this->NumRows(); // make the size 32-bit on disk.
KALDI_ASSERT(this->NumRows() == (MatrixIndexT) size);
MatrixIndexT num_elems = ((size+1)*(MatrixIndexT)size)/2;
if(binary) {
std::string my_token = (sizeof(Real) == 4 ? "FP" : "DP");
WriteToken(os, binary, my_token);
WriteBasicType(os, binary, size);
// We don't use the built-in Kaldi write routines for the floats, as they are
// not efficient enough.
os.write((const char*) data_, sizeof(Real) * num_elems);
}
else {
if(size == 0)
os<<"[ ]\n";
else {
os<<"[\n";
MatrixIndexT i = 0;
for (int32 j = 0; j < size; j++) {
for (int32 k = 0; k < j + 1; k++) {
WriteBasicType(os, binary, data_[i++]);
}
os << ( (j==size-1)? "]\n" : "\n");
}
KALDI_ASSERT(i == num_elems);
}
}
if (os.fail()) {
KALDI_ERR << "Failed to write packed matrix to stream";
}
}
// template<typename Real>
// void Save (std::ostream & os, const PackedMatrix<Real>& rM)
// {
// const Real* p_elem = rM.data();
// for (MatrixIndexT i = 0; i < rM.NumRows(); i++) {
// for (MatrixIndexT j = 0; j <= i ; j++) {
// os << *p_elem;
// p_elem++;
// if (j == i) {
// os << '\n';
// }
// else {
// os << ' ';
// }
// }
// }
// if (os.fail())
// KALDI_ERR("Failed to write packed matrix to stream");
// }
template<typename Real>
void PackedMatrix<Real>::Read(std::istream& is, bool binary, bool add) {
if (add) {
PackedMatrix<Real> tmp;
tmp.Read(is, binary, false); // read without adding.
if (this->NumRows() == 0) this->Resize(tmp.NumRows());
else {
if (this->NumRows() != tmp.NumRows()) {
if (tmp.NumRows() == 0) return; // do nothing in this case.
else KALDI_ERR << "PackedMatrix::Read, size mismatch " << this->NumRows()
<< " vs. " << tmp.NumRows();
}
}
this->AddPacked(1.0, tmp);
return;
} // now assume add == false.
std::ostringstream specific_error;
MatrixIndexT pos_at_start = is.tellg();
int peekval = Peek(is, binary);
const char *my_token = (sizeof(Real) == 4 ? "FP" : "DP");
const char *new_format_token = "[";
bool is_new_format = false;//added by hxu
char other_token_start = (sizeof(Real) == 4 ? 'D' : 'F');
int32 size;
MatrixIndexT num_elems;
if (peekval == other_token_start) { // need to instantiate the other type to read it.
typedef typename OtherReal<Real>::Real OtherType; // if Real == float, OtherType == double, and vice versa.
PackedMatrix<OtherType> other(this->NumRows());
other.Read(is, binary, false); // add is false at this point.
this->Resize(other.NumRows());
this->CopyFromPacked(other);
return;
}
std::string token;
ReadToken(is, binary, &token);
if (token != my_token) {
if(token != new_format_token) {
specific_error << ": Expected token " << my_token << ", got " << token;
goto bad;
}
//new format it is
is_new_format = true;
}
if(!is_new_format) {
ReadBasicType(is, binary, &size); // throws on error.
if ((MatrixIndexT)size != this->NumRows()) {
KALDI_ASSERT(size>=0);
this->Resize(size);
}
num_elems = ((size+1)*(MatrixIndexT)size)/2;
if (!binary) {
for (MatrixIndexT i = 0; i < num_elems; i++) {
ReadBasicType(is, false, data_+i); // will throw on error.
}
} else {
if (num_elems)
is.read(reinterpret_cast<char*>(data_), sizeof(Real)*num_elems);
}
if (is.fail()) goto bad;
return;
}
else {
std::vector<Real> data;
while(1) {
int32 num_lines = 0;
int i = is.peek();
if (i == -1) { specific_error << "Got EOF while reading matrix data"; goto bad; }
else if (static_cast<char>(i) == ']') { // Finished reading matrix.
is.get(); // eat the "]".
i = is.peek();
if (static_cast<char>(i) == '\r') {
is.get();
is.get(); // get \r\n (must eat what we wrote)
}// I don't actually understand what it's doing here
else if (static_cast<char>(i) == '\n') { is.get(); } // get \n (must eat what we wrote)
if (is.fail()) {
KALDI_WARN << "After end of matrix data, read error.";
// we got the data we needed, so just warn for this error.
}
//now process the data:
num_lines = int32(sqrt(data.size()*2));
KALDI_ASSERT(data.size() == num_lines*(num_lines+1)/2);
this->Resize(num_lines);
//std::cout<<data.size()<<' '<<num_lines<<'\n';
for(int32 i = 0; i < data.size(); i++) {
data_[i] = data[i];
}
return;
//std::cout<<"here!!!!!hxu!!!!!"<<std::endl;
}
else if ( (i >= '0' && i <= '9') || i == '-' ) { // A number...
Real r;
is >> r;
if (is.fail()) {
specific_error << "Stream failure/EOF while reading matrix data.";
goto bad;
}
data.push_back(r);
}
else if (isspace(i)) {
is.get(); // eat the space and do nothing.
} else { // NaN or inf or error.
std::string str;
is >> str;
if (!KALDI_STRCASECMP(str.c_str(), "inf") ||
!KALDI_STRCASECMP(str.c_str(), "infinity")) {
data.push_back(std::numeric_limits<Real>::infinity());
KALDI_WARN << "Reading infinite value into matrix.";
} else if (!KALDI_STRCASECMP(str.c_str(), "nan")) {
data.push_back(std::numeric_limits<Real>::quiet_NaN());
KALDI_WARN << "Reading NaN value into matrix.";
} else {
specific_error << "Expecting numeric matrix data, got " << str;
goto bad;
}
}
}
}
bad:
KALDI_ERR << "Failed to read packed matrix from stream. " << specific_error.str()
<< " File position at start is "
<< pos_at_start << ", currently " << is.tellg();
}
// Instantiate PackedMatrix for float and double.
template
class PackedMatrix<float>;
template
class PackedMatrix<double>;
} // namespace kaldi