//===- Interchange.cpp - Linalg interchange transformation ----------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// This file implements the linalg interchange transformation.
//
//===----------------------------------------------------------------------===//

#include "mlir/Dialect/Linalg/Analysis/DependenceAnalysis.h"
#include "mlir/Dialect/Linalg/IR/LinalgOps.h"
#include "mlir/Dialect/Linalg/Transforms/Transforms.h"
#include "mlir/Dialect/Linalg/Utils/Utils.h"
#include "mlir/Dialect/StandardOps/EDSC/Intrinsics.h"
#include "mlir/Dialect/Utils/StructuredOpsUtils.h"
#include "mlir/Dialect/Vector/EDSC/Intrinsics.h"
#include "mlir/Dialect/Vector/VectorOps.h"
#include "mlir/IR/AffineExpr.h"
#include "mlir/IR/Matchers.h"
#include "mlir/IR/PatternMatch.h"
#include "mlir/Pass/Pass.h"
#include "mlir/Support/LLVM.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/raw_ostream.h"
#include <type_traits>

#define DEBUG_TYPE "linalg-interchange"

using namespace mlir;
using namespace mlir::linalg;

LogicalResult mlir::linalg::interchangeGenericLinalgOpPrecondition(
    Operation *op, ArrayRef<unsigned> interchangeVector) {
  // Transformation applies to generic ops only.
  if (!isa<GenericOp, IndexedGenericOp>(op))
    return failure();
  LinalgOp linalgOp = cast<LinalgOp>(op);
  // Interchange vector must be non-empty and match the number of loops.
  if (interchangeVector.empty() ||
      linalgOp.getNumLoops() != interchangeVector.size())
    return failure();
  // Permutation map must be invertible.
  if (!inversePermutation(
          AffineMap::getPermutationMap(interchangeVector, op->getContext())))
    return failure();
  return success();
}

void mlir::linalg::interchange(PatternRewriter &rewriter, LinalgOp op,
                               ArrayRef<unsigned> interchangeVector) {
  // 1. Compute the inverse permutation map.
  MLIRContext *context = op.getContext();
  AffineMap permutationMap = inversePermutation(
      AffineMap::getPermutationMap(interchangeVector, context));
  assert(permutationMap && "expected permutation to be invertible");
  assert(interchangeVector.size() == op.getNumLoops() &&
         "expected interchange vector to have entry for every loop");

  // 2. Compute the interchanged indexing maps.
  SmallVector<Attribute, 4> newIndexingMaps;
  ArrayRef<Attribute> indexingMaps = op.indexing_maps().getValue();
  for (unsigned i = 0, e = op.getNumShapedOperands(); i != e; ++i) {
    AffineMap m = indexingMaps[i].cast<AffineMapAttr>().getValue();
    if (!permutationMap.isEmpty())
      m = m.compose(permutationMap);
    newIndexingMaps.push_back(AffineMapAttr::get(m));
  }
  op->setAttr(getIndexingMapsAttrName(),
              ArrayAttr::get(context, newIndexingMaps));

  // 3. Compute the interchanged iterator types.
  ArrayRef<Attribute> itTypes = op.iterator_types().getValue();
  SmallVector<Attribute, 4> itTypesVector;
  llvm::append_range(itTypesVector, itTypes);
  applyPermutationToVector(itTypesVector, interchangeVector);
  op->setAttr(getIteratorTypesAttrName(),
              ArrayAttr::get(context, itTypesVector));

  // 4. Transform the index operations by applying the permutation map.
  if (op.hasIndexSemantics()) {
    // TODO: Remove the assertion and add a getBody() method to LinalgOp
    // interface once every LinalgOp has a body.
    assert(op->getNumRegions() == 1 &&
           op->getRegion(0).getBlocks().size() == 1 &&
           "expected generic operation to have one block.");
    Block &block = op->getRegion(0).front();
    OpBuilder::InsertionGuard guard(rewriter);
    for (IndexOp indexOp :
         llvm::make_early_inc_range(block.getOps<IndexOp>())) {
      rewriter.setInsertionPoint(indexOp);
      SmallVector<Value> allIndices;
      allIndices.reserve(op.getNumLoops());
      llvm::transform(llvm::seq<int64_t>(0, op.getNumLoops()),
                      std::back_inserter(allIndices), [&](int64_t dim) {
                        return rewriter.create<IndexOp>(indexOp->getLoc(), dim);
                      });
      rewriter.replaceOpWithNewOp<AffineApplyOp>(
          indexOp, permutationMap.getSubMap(indexOp.dim()), allIndices);
    }
  }
}