forked from kulinseth/pytorch
-
Notifications
You must be signed in to change notification settings - Fork 0
/
SparseTensor.cpp
814 lines (731 loc) · 28.4 KB
/
SparseTensor.cpp
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
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
// Basic functions on sparse tensors
#define TORCH_ASSERT_ONLY_METHOD_OPERATORS
#include <ATen/core/Tensor.h>
#include <ATen/Dispatch.h>
#include <ATen/InitialTensorOptions.h>
#include <ATen/Layout.h>
#include <ATen/Parallel.h>
#include <ATen/SparseTensorImpl.h>
#include <ATen/SparseTensorUtils.h>
#include <ATen/native/sparse/SparseStubs.h>
#include <ATen/native/IndexingUtils.h>
#include <ATen/native/NonSymbolicBC.h>
#include <ATen/NamedTensorUtils.h>
#include <ATen/native/Copy.h>
#include <ATen/native/CPUBlas.h>
#include <c10/util/irange.h>
#ifndef AT_PER_OPERATOR_HEADERS
#include <ATen/Functions.h>
#include <ATen/NativeFunctions.h>
#else
#include <ATen/ops/_coalesce.h>
#include <ATen/ops/_coalesce_native.h>
#include <ATen/ops/_coalesced_native.h>
#include <ATen/ops/_convert_indices_from_csr_to_coo.h>
#include <ATen/ops/_dimI_native.h>
#include <ATen/ops/_dimV_native.h>
#include <ATen/ops/_indices_native.h>
#include <ATen/ops/_nnz_native.h>
#include <ATen/ops/sparse_coo_tensor.h>
#include <ATen/ops/_sparse_coo_tensor_unsafe_native.h>
#include <ATen/ops/_sparse_coo_tensor_with_dims.h>
#include <ATen/ops/_sparse_coo_tensor_with_dims_and_tensors.h>
#include <ATen/ops/_sparse_coo_tensor_with_dims_and_tensors_native.h>
#include <ATen/ops/_sparse_coo_tensor_with_dims_native.h>
#include <ATen/ops/_validate_sparse_coo_tensor_args_native.h>
#include <ATen/ops/_values_native.h>
#include <ATen/ops/clone_native.h>
#include <ATen/ops/coalesce_native.h>
#include <ATen/ops/copy_native.h>
#include <ATen/ops/copy_sparse_to_sparse.h>
#include <ATen/ops/copy_sparse_to_sparse_native.h>
#include <ATen/ops/dense_dim_native.h>
#include <ATen/ops/empty.h>
#include <ATen/ops/empty_like_native.h>
#include <ATen/ops/empty_native.h>
#include <ATen/ops/index_select.h>
#include <ATen/ops/indices_native.h>
#include <ATen/ops/is_coalesced_native.h>
#include <ATen/ops/resize_as_sparse.h>
#include <ATen/ops/resize_as_sparse_native.h>
#include <ATen/ops/sparse_coo_tensor.h>
#include <ATen/ops/sparse_coo_tensor_native.h>
#include <ATen/ops/sparse_dim_native.h>
#include <ATen/ops/sparse_mask_native.h>
#include <ATen/ops/sparse_resize_and_clear_native.h>
#include <ATen/ops/sparse_resize_native.h>
#include <ATen/ops/to_dense_native.h>
#include <ATen/ops/to_sparse_native.h>
#include <ATen/ops/unique_dim.h>
#include <ATen/ops/values_native.h>
#include <ATen/ops/zeros.h>
#include <ATen/ops/ones.h>
#endif
namespace at {
namespace native {
using namespace at::sparse;
/******************************************************************************
* access methods
******************************************************************************/
int64_t sparse_dim_sparse(const SparseTensor& self) {
return get_sparse_impl(self)->sparse_dim();
}
int64_t dense_dim_sparse(const SparseTensor& self) {
return get_sparse_impl(self)->dense_dim();
}
bool is_coalesced_sparse(const SparseTensor& self) {
return get_sparse_impl(self)->coalesced();
}
bool is_coalesced_default(const Tensor& self) {
TORCH_CHECK(false, "is_coalesced expected sparse coordinate tensor layout but got ", self.layout());
return false;
}
int64_t _nnz_sparse(const SparseTensor& self) {
return get_sparse_impl(self)->nnz();
}
// Why are there so many methods to get indices and value?
// See Note [ Sparse: different methods to get indices and values ] in
// native_functions.yaml
Tensor _indices_sparse(const SparseTensor& self) {
return get_sparse_impl(self)->indices();
}
Tensor _values_sparse(const SparseTensor& self) {
return get_sparse_impl(self)->values();
}
Tensor& _coalesced_sparse_(SparseTensor& self, bool coalesced) {
get_sparse_impl(self)->set_coalesced(coalesced);
return self;
}
Tensor indices_sparse(const Tensor& self) {
TORCH_CHECK(
self.is_coalesced(),
"Cannot get indices on an uncoalesced tensor, please call .coalesce() first");
return get_sparse_impl(self)->indices().alias();
}
Tensor indices_default(const Tensor& self) {
TORCH_CHECK(false, "indices expected sparse coordinate tensor layout but got ", self.layout());
}
Tensor values_sparse(const Tensor& self) {
TORCH_CHECK(
self.is_coalesced(),
"Cannot get values on an uncoalesced tensor, please call .coalesce() first");
return get_sparse_impl(self)->values().alias();
}
Tensor values_default(const Tensor& self) {
TORCH_CHECK(false, "values expected sparse tensor layout but got ", self.layout());
}
/******************************************************************************
* creation methods
* See NOTE [ Sparse: autograd and API ] for details
******************************************************************************/
/*** Helper methods ***/
SparseTensor new_sparse(
c10::optional<ScalarType> dtype,
c10::optional<Layout> layout,
c10::optional<Device> device,
c10::optional<bool> pin_memory) {
AT_ASSERT(layout.has_value() && *layout == kSparse);
DispatchKey dispatch_key;
switch (device_or_default(device).type()) {
#define DO_CASE(device, _) \
case DeviceType::device: \
dispatch_key = DispatchKey::Sparse##device; \
break;
C10_FORALL_BACKEND_DEVICE_TYPES(DO_CASE, unused)
#undef DO_CASE
default:
TORCH_CHECK(false, "device type not supported for sparse ", device_or_default(device))
}
return detail::make_tensor<SparseTensorImpl>(
DispatchKeySet(dispatch_key),
scalarTypeToTypeMeta(dtype_or_default(dtype)));
}
/** Actual dispatched creation methods ***/
SparseTensor new_with_dims_sparse(
int64_t sparse_dim,
int64_t dense_dim,
ArrayRef<int64_t> size,
c10::optional<ScalarType> dtype,
c10::optional<Layout> layout,
c10::optional<Device> device,
c10::optional<bool> pin_memory) {
SparseTensor self = new_sparse(dtype, layout, device, pin_memory);
get_sparse_impl(self)->resize_and_clear_(sparse_dim, dense_dim, size);
return self;
}
SparseTensor new_with_dims_and_tensor_sparse_symint(
int64_t sparse_dim,
int64_t dense_dim,
c10::SymIntArrayRef size,
const Tensor& indices,
const Tensor& values,
c10::optional<ScalarType> dtype,
c10::optional<Layout> layout,
c10::optional<Device> device,
c10::optional<bool> pin_memory) {
SparseTensor self = new_sparse(dtype, layout, device, pin_memory);
get_sparse_impl(self)->resize_(sparse_dim, dense_dim, size);
// NOTE: There is no guarantee that `indices` and `values` don't contain
// AutogradMeta. However, we want to maintain the invariant that `indices_`
// and `values_` of a sparse tensor don't contain AutogradMeta, and to achieve
// that we shallow-copy `indices` and `values` here.
auto indices_shallow_copy =
Tensor(indices.unsafeGetTensorImpl()->shallow_copy_and_detach(
/*version_counter=*/indices.unsafeGetTensorImpl()->version_counter(),
/*allow_tensor_metadata_change=*/true));
auto values_shallow_copy =
Tensor(values.unsafeGetTensorImpl()->shallow_copy_and_detach(
/*version_counter=*/values.unsafeGetTensorImpl()->version_counter(),
/*allow_tensor_metadata_change=*/true));
alias_into_sparse(self, indices_shallow_copy, values_shallow_copy);
return self;
}
/** Public creation API that dispatch to methods above **/
/** Empty init **/
Tensor empty_sparse(
IntArrayRef size,
c10::optional<ScalarType> dtype,
c10::optional<Layout> layout,
c10::optional<Device> device,
c10::optional<bool> pin_memory,
c10::optional<MemoryFormat> optional_memory_format) {
TORCH_CHECK(
!pin_memory.has_value() || !*pin_memory,
"Only dense CPU tensors can be pinned");
return new_with_dims_sparse(
size.size(), 0, size, dtype, layout, device, pin_memory);
}
/* Shape init */
Tensor sparse_coo_tensor(IntArrayRef size,
c10::optional<ScalarType> dtype,
c10::optional<Layout> layout,
c10::optional<Device> device,
c10::optional<bool> pin_memory) {
// See [Note: hacky wrapper removal for TensorOptions]
TensorOptions options = TensorOptions().dtype(dtype).layout(layout).device(device).pinned_memory(pin_memory);
return at::_sparse_coo_tensor_with_dims(size.size(), 0, size, options.layout(at::kSparse));
}
/* Pointer-copy init */
// helper
namespace {
static inline Tensor expand_values_if_needed(const Tensor& values) {
// expand
if (values.dim() == 0) {
// Mimic Numpy behavior here and treat it as a 1D tensor
return values.expand({1});
} else {
return values;
}
}
} // namespace
Tensor sparse_coo_tensor(const Tensor& indices, const Tensor& values_,
c10::optional<ScalarType> dtype,
c10::optional<Layout> layout,
c10::optional<Device> device,
c10::optional<bool> pin_memory) {
// See [Note: hacky wrapper removal for TensorOptions]
TensorOptions options = TensorOptions().dtype(dtype).layout(layout).device(device).pinned_memory(pin_memory);
Tensor values = expand_values_if_needed(values_);
// arg checking
TORCH_CHECK(
!options.has_layout() || options.layout() == kSparse,
"expected sparse layout, but got layout ",
options.layout());
// the following checks are redundant because they are also checked in
// SparseTensorImpl::set_indices_and_values_unsafe but we need to ensure them
// in order to infer the shape.
TORCH_CHECK(
indices.dim() == 2,
"indices must be sparse_dim x nnz, but got: ",
indices.sizes())
TORCH_CHECK(
!indices.is_sparse(),
"expected indices to be a dense tensor, but got indices of layout ",
indices.layout());
// If sizes are not given, it is inferred as max index of each dim.
int64_t sparse_dim = indices.size(0);
int64_t dense_dim = values.dim() - 1;
std::vector<int64_t> computed_sizes(sparse_dim + dense_dim);
if (indices.numel() > 0) {
// If the indices has elements in it, we infer the minimum sparse dimension
// sizes as the max value of each dim in indices. NB: It used to keepdim. I
// think that was wrong.
Tensor min_indices =
std::get</* values */ 0>(indices.min(/* dim */ 1, /* keepdim */ false));
Tensor computed_indices_sizes =
std::get</* values */ 0>(indices.max(/* dim */ 1, /* keepdim */ false));
computed_indices_sizes.add_(1); // len = max_index + 1
Tensor cpu_min_indices = min_indices.to(at::DeviceType::CPU);
Tensor cpu_computed_indices_sizes =
computed_indices_sizes.to(at::DeviceType::CPU);
auto cpu_min_indices_accessor = cpu_min_indices.accessor<int64_t, 1>();
auto cpu_computed_indices_sizes_accessor =
cpu_computed_indices_sizes.accessor<int64_t, 1>();
for (const auto d : c10::irange(sparse_dim)) {
int64_t min_index_in_dim = cpu_min_indices_accessor[d];
TORCH_CHECK(
min_index_in_dim >= 0,
"found negative index ",
min_index_in_dim,
" for dim ",
d);
computed_sizes[static_cast<size_t>(d)] =
cpu_computed_indices_sizes_accessor[d];
}
} else {
// If the indices doesn't have elements in it, there is not enough
// information to know what the minimum sparse dimension sizes should be,
// and in this case we set them to 0
for (const auto d : c10::irange(sparse_dim)) {
computed_sizes[static_cast<size_t>(d)] = 0;
}
}
for (const auto d : c10::irange(dense_dim)) {
computed_sizes[static_cast<size_t>(sparse_dim + d)] = values.size(d + 1);
}
return at::_sparse_coo_tensor_with_dims_and_tensors(
sparse_dim,
dense_dim,
computed_sizes,
indices,
values,
values.options().layout(kSparse));
}
void _validate_sparse_coo_tensor_args(
const Tensor& indices,
const Tensor& values_,
ArrayRef<int64_t> size) {
Tensor values = expand_values_if_needed(values_);
// the following checks are redundant because they are also checked in
// SparseTensorImpl::set_indices_and_values_unsafe but we need to ensure them
// in order to infer the shape.
TORCH_CHECK(
indices.dim() == 2,
"indices must be sparse_dim x nnz, but got: ",
indices.sizes())
TORCH_CHECK(
!indices.is_sparse(),
"expected indices to be a dense tensor, but got indices of layout ",
indices.layout());
int64_t sparse_dim = indices.size(0);
int64_t dense_dim = values.dim() - 1;
TORCH_CHECK(
static_cast<int64_t>(size.size()) == sparse_dim + dense_dim,
"number of dimensions must be sparse_dim (",
sparse_dim,
") + dense_dim (",
dense_dim,
"), but got ",
size.size());
// Check to make sure all indices are within the boundaries of `size`
if (indices.numel() > 0) {
Tensor min_indices =
std::get</* values */ 0>(indices.min(/* dim */ 1, /* keepdim */ false));
Tensor max_indices =
std::get</* values */ 0>(indices.max(/* dim */ 1, /* keepdim */ false));
Tensor cpu_min_indices, cpu_max_indices;
if (!indices.is_cpu()) {
cpu_min_indices = min_indices.to(at::DeviceType::CPU);
cpu_max_indices = max_indices.to(at::DeviceType::CPU);
} else {
cpu_min_indices = min_indices;
cpu_max_indices = max_indices;
}
auto cpu_min_indices_accessor = cpu_min_indices.accessor<int64_t, 1>();
auto cpu_max_indices_accessor = cpu_max_indices.accessor<int64_t, 1>();
for (const auto d : c10::irange(sparse_dim)) {
// NB: This used to sync ndim times to access each entry; now we copy
// everything to CPU first and then access it.
int64_t min_index_in_dim = cpu_min_indices_accessor[d];
TORCH_CHECK(
min_index_in_dim >= 0,
"found negative index ",
min_index_in_dim,
" for dim ",
d);
int64_t max_index_in_dim = cpu_max_indices_accessor[d];
int64_t dim_size = size[static_cast<size_t>(d)];
TORCH_CHECK(
max_index_in_dim < dim_size,
"size is inconsistent with indices: for dim ",
d,
", size is ",
dim_size,
" but found index ",
max_index_in_dim);
}
}
}
// NB: Got rid of the sizes == NULL case
Tensor sparse_coo_tensor(const Tensor& indices, const Tensor& values, IntArrayRef size,
c10::optional<ScalarType> dtype,
c10::optional<Layout> layout,
c10::optional<Device> device,
c10::optional<bool> pin_memory) {
// See [Note: hacky wrapper removal for TensorOptions]
TensorOptions options = TensorOptions().dtype(dtype).layout(layout).device(device).pinned_memory(pin_memory);
// arg checking
TORCH_CHECK(
!options.has_layout() || options.layout() == kSparse,
"expected sparse layout, but got layout ",
options.layout());
return at::native::_sparse_coo_tensor_unsafe(
indices,
values,
size,
optTypeMetaToScalarType(options.dtype_opt()),
options.layout_opt(),
options.device_opt(),
options.pinned_memory_opt());
}
Tensor _sparse_coo_tensor_unsafe(const Tensor& indices, const Tensor& values_, at::IntArrayRef size,
c10::optional<ScalarType> dtype,
c10::optional<Layout> layout,
c10::optional<Device> device,
c10::optional<bool> pin_memory) {
if (at::globalContext().checkSparseTensorInvariants()) {
at::native::_validate_sparse_coo_tensor_args(indices, values_, size);
}
return at::native::_sparse_coo_tensor_unsafe_symint(indices, values_, c10::fromIntArrayRefSlow(size), dtype, layout, device, pin_memory);
}
// NOTE: _sparse_coo_tensor_unsafe() differs from sparse_coo_tensor()
// in that we don't check whether any indices are out of boundaries of `size`, thus avoiding a
// copy from CUDA to CPU. However, this function should ONLY be used where we know that the indices
// are guaranteed to be within bounds or if the caller is going to call
// _validate_sparse_coo_tensor_args before using the tensor.
// NB: Got rid of the size == NULL case
Tensor _sparse_coo_tensor_unsafe_symint(const Tensor& indices, const Tensor& values_, c10::SymIntArrayRef size,
c10::optional<ScalarType> dtype,
c10::optional<Layout> layout,
c10::optional<Device> device,
c10::optional<bool> pin_memory) {
// See [Note: hacky wrapper removal for TensorOptions]
Tensor values = expand_values_if_needed(values_);
// This guard is intentional: we don't support dynamic shapes along the
// indices dimension because that implies variable dimensionality
auto sparse_dim = indices.sym_size(0).guard_int(__FILE__, __LINE__);
auto dense_dim = values.dim() - 1;
return at::_sparse_coo_tensor_with_dims_and_tensors_symint(
sparse_dim,
dense_dim,
size,
indices,
values,
values.options().layout(kSparse));
}
// NB: Deleted newWithSizeNd variants
SparseTensor clone_sparse(
const SparseTensor& self,
c10::optional<c10::MemoryFormat> optional_memory_format) {
TORCH_CHECK(
!optional_memory_format.has_value(),
"unsupported memory format option ",
optional_memory_format.value());
SparseTensor other = new_with_dims_sparse(
self.sparse_dim(),
self.dense_dim(),
self.sizes(),
optTypeMetaToScalarType(self.options().dtype_opt()),
self.options().layout_opt(),
self.options().device_opt(),
self.options().pinned_memory_opt());
copy_into_sparse(other, self._indices(), self._values(), true);
return other._coalesced_(self.is_coalesced());
}
/******************************************************************************
* reshaping methods
******************************************************************************/
const SparseTensor& sparse_resize_(
const SparseTensor& self,
ArrayRef<int64_t> size,
int64_t sparse_dim,
int64_t dense_dim) {
get_sparse_impl(self)->resize_(sparse_dim, dense_dim, size);
return self;
}
const SparseTensor& sparse_resize_and_clear_(
const SparseTensor& self,
ArrayRef<int64_t> size,
int64_t sparse_dim,
int64_t dense_dim) {
get_sparse_impl(self)->resize_and_clear_(sparse_dim, dense_dim, size);
return self;
}
namespace {
bool _is_same_size_as_sparse(
const SparseTensor& self,
const SparseTensor& src) {
return self.sparse_dim() == src.sparse_dim() &&
self.dense_dim() == src.dense_dim() && self.sizes().equals(src.sizes());
}
} // namespace
// Invoked from native/Resize.cpp (no dynamic dispatch necessary)
const SparseTensor& resize_as_sparse_(const SparseTensor& self, const SparseTensor& src) {
if (!_is_same_size_as_sparse(self, src)) {
sparse_resize_(self, src.sizes(), src.sparse_dim(), src.dense_dim());
}
return self;
}
SparseTensor dense_to_sparse(const Tensor& self, c10::optional<c10::Layout> layout, OptionalIntArrayRef blocksize, c10::optional<int64_t> dense_dim_opt) {
if (layout.has_value()) {
if (blocksize.has_value() && !(*layout == kSparseBsr || *layout == kSparseBsc)) {
AT_ERROR("to_sparse for ", self.layout(), " to ", *layout, " conversion does not use specified blocksize");
}
if (self.layout() == *layout) {
return self;
}
switch (*layout) {
case kStrided:
return self;
case kSparse:
return dense_to_sparse(self, self.dim() - dense_dim_opt.value_or(0));
case kSparseCsr:
return self.to_sparse_csr(dense_dim_opt);
case kSparseCsc:
return self.to_sparse_csc(dense_dim_opt);
case kSparseBsr:
if (blocksize.has_value()) {
return self.to_sparse_bsr(*blocksize, dense_dim_opt);
}
AT_ERROR("to_sparse for ", self.layout(), " to ", *layout, " conversion requires blocksize");
break;
case kSparseBsc:
if (blocksize.has_value()) {
return self.to_sparse_bsc(*blocksize, dense_dim_opt);
}
break;
AT_ERROR("to_sparse for ", self.layout(), " to ", *layout, " conversion requires blocksize");
default:
break;
}
AT_ERROR("to_sparse not implemented for ", self.layout(), " to ", *layout, " conversion");
}
return dense_to_sparse(self, self.dim() - dense_dim_opt.value_or(0));
}
SparseTensor dense_to_sparse(const Tensor& self, int64_t sparse_dim) {
int64_t dims = self.dim();
// TODO: it seems like sparse_dim == 0 could be supported even if self.dim() >
// 0, but this would take some work and doesn't seem particularly useful.
TORCH_CHECK(
sparse_dim > 0 || self.dim() == 0,
"sparse_dim must be >0 if dimensionality > 0");
TORCH_CHECK(
sparse_dim <= dims,
"sparse_dim must be less than or equal to self.dim()");
at::TensorOptions sparse_options = self.options().layout(kSparse);
std::vector<int64_t> sizes = self.sizes().vec();
Tensor nz = self.nonzero().transpose(0, 1);
if (nz.size(1) == 0) {
auto sparse = new_with_dims_sparse(
sparse_dim,
dims - sparse_dim,
sizes,
optTypeMetaToScalarType(sparse_options.dtype_opt()),
sparse_options.layout_opt(),
sparse_options.device_opt(),
sparse_options.pinned_memory_opt());
return sparse._coalesced_(true);
}
Tensor indices;
if (sparse_dim == dims) {
indices = nz.clone();
} else {
Tensor i = nz.narrow(0, 0, sparse_dim);
std::tie(indices, std::ignore, std::ignore) = unique_dim(i, 1);
indices = indices.contiguous(); // many sparse CUDA kernels require
// contiguity, see issue #12633
}
Tensor values;
if (self.dim() > 0) {
auto ix = toListOfOptionalTensors(indices.chunk(indices.size(0), 0));
values = self.index(ix).squeeze(0).clone(at::MemoryFormat::Preserve);
} else {
AT_ASSERT(nz.sizes().equals({0, 1}));
// In this cases, indices is a clone of nz, which is a tensor of shape (0,
// 1). Given sparse tensor invariants, values should be shape (1,)
values = self.unsqueeze(0).clone(at::MemoryFormat::Preserve);
}
Tensor sparse = at::sparse_coo_tensor(indices, values, sizes, sparse_options);
return sparse._coalesced_(true);
}
// NB: Dropped the resizeNd variants
SparseTensor& copy_sparse_wrapper_(
Tensor& self,
const Tensor& src,
bool non_blocking) {
// TODO: Once copy_ is fully migrated to use dispatcher, handle named
// inference using dispatcher instead of doing it everywhere
auto maybe_outnames = namedinference::compute_broadcast_outnames(self, src);
{
NoNamesGuard guard;
if (!self.is_sparse() || !src.is_sparse()) {
AT_ERROR(
"copy_() between dense and sparse Tensors is not implemented! Found self type = ",
self.toString(),
" and src type = ",
src.toString());
}
at::copy_sparse_to_sparse_(self, src, non_blocking);
}
namedinference::propagate_names_if_nonempty(self, maybe_outnames);
return self;
}
SparseTensor& copy_sparse_(
SparseTensor& self,
const SparseTensor& src,
bool non_blocking) {
if (is_same_tensor(self, src))
return self;
get_sparse_impl(self)->resize_(
src.sparse_dim(), src.dense_dim(), src.sizes());
copy_into_sparse(self, src._indices(), src._values(), non_blocking);
return self._coalesced_(src.is_coalesced());
}
SparseTensor coalesce(const SparseTensor& self) {
TORCH_CHECK(self.layout() == kSparse, "coalesce expected sparse coordinate tensor layout but got ", self.layout());
// See NOTE: [ coalesce autograd ]
if (self.is_coalesced()) {
return self;
}
return at::_coalesce(self);
}
SparseTensor _coalesce_sparse_cpu(const SparseTensor& self) {
AT_ASSERT(self.defined());
TORCH_INTERNAL_ASSERT(at::impl::variable_excluded_from_dispatch());
AT_ASSERT(self.is_sparse());
TORCH_INTERNAL_ASSERT(!self.is_coalesced());
// NOTE: Since `coalesce` is not an in-place operation when `is_coalesced` is false,
// we should keep the original tensor intact and do coalesce on a copy of the tensor
if (self._nnz() < 2) {
SparseTensor dst = self.clone();
dst._coalesced_(true);
return dst;
}
Tensor indices = self._indices();
Tensor values = self._values().contiguous();
int64_t sparse_dim = self.sparse_dim();
int64_t dense_dim = self.dense_dim();
int64_t nnz = self._nnz();
Tensor indices_scalar = flatten_indices(indices, self.sizes());
SparseTensor dst = new_sparse(
optTypeMetaToScalarType(self.options().dtype_opt()),
self.options().layout_opt(),
self.options().device_opt(),
self.options().pinned_memory_opt());
get_sparse_impl(dst)->resize_(sparse_dim, dense_dim, self.sizes());
// TODO: is there a more idiomatic way to do this?
Tensor newIndices = at::empty(indices.sizes(), indices.options());
Tensor newValues = at::empty(values.sizes(), values.options());
alias_into_sparse(dst, newIndices, newValues);
Tensor indicesBuffer;
Tensor indicesPermutation;
std::tie(indicesBuffer, indicesPermutation) = indices_scalar.sort(0);
// NB: The accessor accesses here rely on self._nnz() > 0 (tested earlier in
// this function)
auto newIndicesAccessor = newIndices.accessor<int64_t, 2>();
auto indicesAccessor = indices.accessor<int64_t, 2>();
auto indicesPermutationAccessor = indicesPermutation.accessor<int64_t, 1>();
auto indicesBufferAccessor = indicesBuffer.accessor<int64_t, 1>();
int64_t i = -1;
AT_DISPATCH_ALL_TYPES_AND_COMPLEX_AND4(
at::ScalarType::ComplexHalf, at::ScalarType::BFloat16, at::ScalarType::Half, at::ScalarType::Bool,
values.scalar_type(), "coalesce", [&] {
int64_t prev = -1;
int64_t blockSize = values.stride(0);
scalar_t* values_ptr = values.data_ptr<scalar_t>();
scalar_t* newValues_ptr = newValues.data_ptr<scalar_t>();
for (const auto j : c10::irange(nnz)) {
int64_t pos = indicesPermutationAccessor[j];
int64_t curr = indicesBufferAccessor[j];
if (curr == prev) {
if (values.numel() >
0) { // if values is an empty tensor, there are no elements to copy
at::native::cpublas::axpy<scalar_t>(
blockSize,
static_cast<scalar_t>(1),
values_ptr + pos * blockSize,
1,
newValues_ptr + i * blockSize,
1);
}
} else {
++i;
for (const auto d : c10::irange(sparse_dim)) {
newIndicesAccessor[d][i] = indicesAccessor[d][pos];
}
if (values.numel() >
0) { // if values is an empty tensor, there are no elements to copy
at::native::cpublas::copy<scalar_t>(
blockSize,
values_ptr + pos * blockSize,
1,
newValues_ptr + i * blockSize,
1);
}
}
prev = curr;
}
});
dst._coalesced_(true);
get_sparse_impl(dst)->set_nnz_and_narrow(i + 1);
return dst;
}
DEFINE_DISPATCH(sparse_mask_intersection_out_stub);
SparseTensor sparse_mask(const Tensor& t, const SparseTensor& mask) {
TORCH_CHECK(
mask.sizes().equals(t.sizes()),
"sparse_mask(): operands have incompatible sizes; self has size ",
t.sizes(),
" but mask has size ",
mask.sizes());
if (!mask.numel()) {
return mask.clone().to(t.device(), t.scalar_type());
}
if (t.layout() == at::kSparse) {
TORCH_CHECK(t.sparse_dim() == mask.sparse_dim(),
"sparse_mask(): the number of sparse dimensions in `self` ",
"should match that of the `mask`. ",
"Got `self.sparse_dim() == ", t.sparse_dim(), "` != ",
"`mask.sparse_dim() == ", mask.sparse_dim(), "`.");
auto res = at::empty({0}, t.options());
sparse_mask_intersection_out_stub(res.device().type(), res, t, mask);
return res;
}
const auto mask_values = mask._values();
auto mask_template = at::sparse_coo_tensor(
mask._indices(),
at::ones({1}, mask_values.options()).expand_as(mask_values),
mask.sizes())._coalesced_(mask.is_coalesced());
return t.mul(mask_template).to(t.scalar_type());
}
Tensor empty_like_sparse_coo(
const Tensor& self,
c10::optional<ScalarType> dtype,
c10::optional<Layout> layout,
c10::optional<Device> device,
c10::optional<bool> pin_memory,
c10::optional<c10::MemoryFormat> optional_memory_format) {
TensorOptions options_ = TensorOptions().dtype(dtype).layout(layout).device(device).pinned_memory(pin_memory);
TORCH_CHECK(
!(options_.has_memory_format() && optional_memory_format.has_value()),
"Cannot set memory_format both in TensorOptions and explicit argument; please delete "
"the redundant setter.");
TensorOptions options =
self.options()
.merge_in(options_)
.merge_memory_format(optional_memory_format);
TORCH_CHECK(
!(options.layout() != kStrided &&
optional_memory_format.has_value()),
"memory format option is only supported by strided tensors");
if (options.layout() == kSparse) {
auto result = at::empty({0}, options);
result.sparse_resize_and_clear_(
self.sizes(), self.sparse_dim(), self.dense_dim());
return result;
} else {
return at::native::empty_like(self, dtype, layout, device, pin_memory, optional_memory_format);
}
}
} // namespace native
} // namespace at