mirror of https://github.com/llvm/torch-mlir
c531f5495b
The logic here is very similar to the conversion for AdaptiveAvgPool1d #2661 with a few modifications: 1. buffVal = -inf instead of 0 2. the main linalg generic op accumulates a max, instead of a sum, to the first output tensor 3. avg pooling requires dividing the sum pool by the kernel width, which we stored as an auxilliary tensor (kSizeTensor). Here, the auxiliary tensor will be recording the indices. Strangely enough, the only signature available for this function is to return indices, and it appears that they must be computed whether the user desires them or not. See [pytorch/torch/nn/functional.py](https://github.com/pytorch/pytorch/blob/main/torch/nn/functional.py#L1174). Before writing other adaptive pooling conversions, the logic of this decomposition should be rolled into a helper function that will work for both max and avg pooling ops. Even the auxiliary tensor should likely be automated. This code was written in a slightly more tedious way than strictly necessary (often using loops to fill SmallVectors up to rank-2, which is only two in this case), in order to more easily facilitate the transition to a helper function. |
||
|---|---|---|
| .. | ||
| CMakeLists.txt | ||
| DataMovement.cpp | ||
| IndirectDataMovement.cpp | ||
| Linear.cpp | ||
| Pooling.cpp | ||
| PopulatePatterns.h | ||
| Random.cpp | ||
| Reduction.cpp | ||
| TensorConstructors.cpp | ||
| TensorScalarInterop.cpp | ||
| TorchToLinalg.cpp | ||
| Uncategorized.cpp | ||
| Utils.cpp | ||