aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Writer/BitcodeWriter.cpp
diff options
context:
space:
mode:
authorAart Bik <ajcbik@google.com>2021-09-15 15:18:19 -0700
committerAart Bik <ajcbik@google.com>2021-09-15 20:28:04 -0700
commitb1d44e59020a2a7adfc81bffb07577fd091d0778 (patch)
tree534d38ae4215adcf1d2bc731746f934077ca00a3 /llvm/lib/Bitcode/Writer/BitcodeWriter.cpp
parent24c8eaec9467b2aaf70b0db33a4e4dd415139a50 (diff)
downloadllvm-b1d44e59020a2a7adfc81bffb07577fd091d0778.zip
llvm-b1d44e59020a2a7adfc81bffb07577fd091d0778.tar.gz
llvm-b1d44e59020a2a7adfc81bffb07577fd091d0778.tar.bz2
[mlir][sparse] add affine subscripts to sparse compilation pass
This enables the sparsification of more kernels, such as convolutions where there is a x(i+j) subscript. It also enables more tensor invariants such as x(1) or other affine subscripts such as x(i+1). Currently, we reject sparsity altogether for such tensors. Despite this restriction, however, we can already handle a lot more kernels with compound subscripts for dense access (viz. convolution with dense input and sparse filter). Some unit tests and an integration test demonstrate new capability. Reviewed By: bixia Differential Revision: https://reviews.llvm.org/D109783
Diffstat (limited to 'llvm/lib/Bitcode/Writer/BitcodeWriter.cpp')
0 files changed, 0 insertions, 0 deletions