Pre-commiting this before landing the new check in https://github.com/llvm/llvm-project/pull/177892
1669 lines
68 KiB
C++
1669 lines
68 KiB
C++
//===- XeGPUPropagateLayout.cpp - XeGPU Layout Propagation ------*- C++ -*-===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "mlir/Analysis/DataFlow/DeadCodeAnalysis.h"
|
|
#include "mlir/Analysis/DataFlow/SparseAnalysis.h"
|
|
#include "mlir/Analysis/DataFlow/Utils.h"
|
|
#include "mlir/Analysis/DataFlowFramework.h"
|
|
#include "mlir/Dialect/GPU/IR/GPUDialect.h"
|
|
#include "mlir/Dialect/MemRef/IR/MemRef.h"
|
|
#include "mlir/Dialect/Vector/IR/VectorOps.h"
|
|
#include "mlir/Dialect/XeGPU/IR/XeGPU.h"
|
|
#include "mlir/Dialect/XeGPU/Transforms/Passes.h"
|
|
#include "mlir/Dialect/XeGPU/Utils/XeGPUUtils.h"
|
|
#include "mlir/IR/Attributes.h"
|
|
#include "mlir/IR/Builders.h"
|
|
#include "mlir/IR/BuiltinAttributes.h"
|
|
#include "mlir/IR/BuiltinTypes.h"
|
|
#include "mlir/IR/Operation.h"
|
|
#include "mlir/IR/Value.h"
|
|
#include "mlir/IR/Visitors.h"
|
|
#include "mlir/Interfaces/ControlFlowInterfaces.h"
|
|
#include "mlir/Interfaces/FunctionInterfaces.h"
|
|
#include "mlir/Support/LLVM.h"
|
|
#include "llvm/ADT/ArrayRef.h"
|
|
#include "llvm/ADT/STLExtras.h"
|
|
#include "llvm/ADT/SmallSet.h"
|
|
#include "llvm/ADT/SmallVector.h"
|
|
#include "llvm/ADT/TypeSwitch.h"
|
|
#include "llvm/Support/Casting.h"
|
|
#include "llvm/Support/Debug.h"
|
|
#include "llvm/Support/LogicalResult.h"
|
|
#include "llvm/Support/raw_ostream.h"
|
|
|
|
#include "mlir/Dialect/XeGPU/uArch/IntelGpuXe2.h"
|
|
|
|
namespace mlir {
|
|
namespace xegpu {
|
|
#define GEN_PASS_DEF_XEGPUPROPAGATELAYOUT
|
|
#include "mlir/Dialect/XeGPU/Transforms/Passes.h.inc"
|
|
} // namespace xegpu
|
|
} // namespace mlir
|
|
|
|
#define DEBUG_TYPE "xegpu-propagate-layout"
|
|
#define DBGS() (llvm::dbgs() << "[" DEBUG_TYPE "]: ")
|
|
|
|
using namespace mlir;
|
|
using namespace mlir::dataflow;
|
|
|
|
namespace {
|
|
|
|
enum class LayoutKind { Lane, InstData, Subgroup };
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// LayoutInfo
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// Helper class for tracking the analysis state of an mlir value. For layout
|
|
/// propagation, the analysis state is simply the distribution layout of
|
|
/// each value. The distribution layout information is encapsulated using
|
|
/// xegpu::DistributeLayoutAttr class which can hold information about any type
|
|
/// of distribution layout that XeGPU dialect supports. Purpose of this analysis
|
|
/// to propagate some unique distribution layout for each value in the program
|
|
/// starting from a set of anchor operations (like DPAS, StoreNd, etc.). Note
|
|
/// that analysis will reach a fixed point when all values are reached some
|
|
/// layout and, analysis does not try to modify any already assigned layouts.
|
|
///
|
|
/// Given this, LayoutInfo satisifies the following properties:
|
|
/// 1) A LayoutInfo value can be in one of two states - `assigned` or `not
|
|
/// assigned`.
|
|
/// 2) Two LayoutInfo values are equal if they are both assigned or
|
|
/// both not assigned. The concrete value of assigned state does not matter.
|
|
/// 3) The meet operator works as follows:
|
|
/// - If current state is assigned, return the current state. (already
|
|
/// a unique layout is assigned. don't change it)
|
|
/// - Otherwise, return the other state.
|
|
|
|
struct LayoutInfo {
|
|
private:
|
|
xegpu::DistributeLayoutAttr storage = nullptr;
|
|
|
|
public:
|
|
LayoutInfo() = default;
|
|
LayoutInfo(const xegpu::DistributeLayoutAttr &layout) : storage(layout) {}
|
|
|
|
// Two lattice values are equal if they have `some` layout. The actual
|
|
// content of the layout does not matter.
|
|
bool operator==(const LayoutInfo &other) const {
|
|
return this->isAssigned() == other.isAssigned();
|
|
}
|
|
|
|
static LayoutInfo meet(const LayoutInfo &lhs, const LayoutInfo &rhs);
|
|
|
|
static LayoutInfo join(const LayoutInfo &lhs, const LayoutInfo &rhs);
|
|
|
|
void print(raw_ostream &os) const;
|
|
|
|
bool isAssigned() const { return storage != nullptr; }
|
|
|
|
LayoutInfo transpose(ArrayRef<int64_t> permutation) const;
|
|
|
|
SmallVector<int> getLaneLayout() const;
|
|
|
|
SmallVector<int> getLaneData() const;
|
|
|
|
SmallVector<int> getInstData() const;
|
|
|
|
SmallVector<int> getSgLayout() const;
|
|
|
|
SmallVector<int> getSgData() const;
|
|
|
|
SmallVector<int> getOrder() const;
|
|
|
|
bool isSliceLayout() const {
|
|
if (!isAssigned())
|
|
return false;
|
|
return isa<xegpu::SliceAttr>(storage);
|
|
}
|
|
|
|
int64_t getRank() const {
|
|
if (!isAssigned())
|
|
return -1;
|
|
return storage.getRank();
|
|
}
|
|
|
|
Attribute get() { return storage; }
|
|
};
|
|
|
|
SmallVector<int> LayoutInfo::getLaneLayout() const {
|
|
if (!isAssigned())
|
|
return {};
|
|
return llvm::map_to_vector(storage.getEffectiveLaneLayoutAsInt(),
|
|
[](int64_t val) { return static_cast<int>(val); });
|
|
}
|
|
|
|
SmallVector<int> LayoutInfo::getLaneData() const {
|
|
if (!isAssigned())
|
|
return {};
|
|
return llvm::map_to_vector(storage.getEffectiveLaneDataAsInt(),
|
|
[](int64_t val) { return static_cast<int>(val); });
|
|
}
|
|
|
|
SmallVector<int> LayoutInfo::getInstData() const {
|
|
if (!isAssigned())
|
|
return {};
|
|
return llvm::map_to_vector(storage.getEffectiveInstDataAsInt(),
|
|
[](int64_t val) { return static_cast<int>(val); });
|
|
}
|
|
|
|
SmallVector<int> LayoutInfo::getSgLayout() const {
|
|
if (!isAssigned())
|
|
return {};
|
|
return llvm::map_to_vector(storage.getEffectiveSgLayoutAsInt(),
|
|
[](int64_t val) { return static_cast<int>(val); });
|
|
}
|
|
|
|
SmallVector<int> LayoutInfo::getSgData() const {
|
|
if (!isAssigned())
|
|
return {};
|
|
return llvm::map_to_vector(storage.getEffectiveSgDataAsInt(),
|
|
[](int64_t val) { return static_cast<int>(val); });
|
|
}
|
|
|
|
SmallVector<int> LayoutInfo::getOrder() const {
|
|
if (!isAssigned() || !storage.getOrder())
|
|
return {};
|
|
return llvm::map_to_vector(storage.getOrder().asArrayRef(),
|
|
[](int64_t val) { return static_cast<int>(val); });
|
|
}
|
|
|
|
void LayoutInfo::print(raw_ostream &os) const {
|
|
if (isAssigned()) {
|
|
os << storage;
|
|
} else {
|
|
os << "Not assigned.";
|
|
}
|
|
}
|
|
|
|
LayoutInfo LayoutInfo::meet(const LayoutInfo &lhs, const LayoutInfo &rhs) {
|
|
if (!lhs.isAssigned())
|
|
return rhs;
|
|
return lhs;
|
|
}
|
|
|
|
/// Since this is a backward analysis, join method is not used.
|
|
LayoutInfo LayoutInfo::join(const LayoutInfo &lhs, const LayoutInfo &rhs) {
|
|
llvm_unreachable("Join should not be triggered by layout propagation.");
|
|
}
|
|
|
|
/// Construct a new layout with the transposed inst_data or lane_layout,
|
|
/// lane_data.
|
|
LayoutInfo LayoutInfo::transpose(ArrayRef<int64_t> permutation) const {
|
|
if (!isAssigned())
|
|
return {};
|
|
// Check if the permutation is valid.
|
|
llvm::SmallSet<int64_t, 4> seen(permutation.begin(), permutation.end());
|
|
bool hasDuplicates = seen.size() != permutation.size();
|
|
bool withinRange = llvm::all_of(permutation, [&](int64_t idx) {
|
|
return idx >= 0 && idx < static_cast<int64_t>(permutation.size());
|
|
});
|
|
|
|
if (!withinRange || hasDuplicates) {
|
|
assert(false && "Invalid permutation for transpose.");
|
|
return {};
|
|
}
|
|
|
|
SmallVector<int32_t> laneLayout;
|
|
SmallVector<int32_t> laneData;
|
|
SmallVector<int32_t> instData;
|
|
SmallVector<int32_t> sgLayout;
|
|
SmallVector<int32_t> sgData;
|
|
SmallVector<int32_t> order;
|
|
|
|
for (int64_t idx : permutation) {
|
|
if (getLaneLayout().size()) {
|
|
laneLayout.push_back(static_cast<int32_t>(getLaneLayout()[idx]));
|
|
laneData.push_back(static_cast<int32_t>(getLaneData()[idx]));
|
|
}
|
|
if (getInstData().size())
|
|
instData.push_back(static_cast<int32_t>(getInstData()[idx]));
|
|
if (getSgData().size()) {
|
|
sgLayout.push_back(static_cast<int32_t>(getSgLayout()[idx]));
|
|
sgData.push_back(static_cast<int32_t>(getSgData()[idx]));
|
|
}
|
|
if (getOrder().size()) {
|
|
order.push_back(static_cast<int32_t>(getOrder()[idx]));
|
|
}
|
|
}
|
|
auto orderAttr = order.size()
|
|
? DenseI32ArrayAttr::get(storage.getContext(), order)
|
|
: nullptr;
|
|
xegpu::LayoutAttr layoutAttr;
|
|
if (getLaneLayout().size())
|
|
layoutAttr =
|
|
xegpu::LayoutAttr::get(storage.getContext(), laneLayout, laneData);
|
|
if (getInstData().size())
|
|
layoutAttr = xegpu::LayoutAttr::get(storage.getContext(), instData);
|
|
if (getSgData().size())
|
|
layoutAttr = xegpu::LayoutAttr::get(
|
|
storage.getContext(),
|
|
DenseI32ArrayAttr::get(storage.getContext(), sgLayout),
|
|
DenseI32ArrayAttr::get(storage.getContext(), sgData),
|
|
/*inst_data =*/nullptr, /*lane_layout =*/nullptr,
|
|
/*lane_data =*/nullptr, orderAttr);
|
|
return LayoutInfo(layoutAttr);
|
|
}
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// LayoutInfoLattice
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// Lattice holding the LayoutInfo for each value.
|
|
struct LayoutInfoLattice : public Lattice<LayoutInfo> {
|
|
MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(LayoutInfoLattice)
|
|
using Lattice::Lattice;
|
|
};
|
|
|
|
/// Helper Functions to get default layouts. A `default layout` is a layout that
|
|
/// is assigned to a value when the layout is not fixed by some anchor operation
|
|
/// (like DPAS).
|
|
|
|
/// Helper Function to get the default layout for uniform values like constants.
|
|
/// For 1D vector, lane_layout is [subgroupSize] and lane_data is [1].
|
|
/// For 2D vector, lane_layout is [1, subgroupSize] and lane_data is [1, 1].
|
|
static LayoutInfo getDefaultSIMTLayoutInfo(mlir::MLIRContext *ctx,
|
|
unsigned rank,
|
|
const xegpu::uArch::uArch *uArch) {
|
|
assert((rank == 1 || rank == 2) && "Expected 1D or 2D vector.");
|
|
if (rank == 1) {
|
|
return LayoutInfo(
|
|
xegpu::LayoutAttr::get(ctx, {uArch->getSubgroupSize()}, {1}));
|
|
}
|
|
return LayoutInfo(
|
|
xegpu::LayoutAttr::get(ctx, {1, uArch->getSubgroupSize()}, {1, 1}));
|
|
}
|
|
|
|
static LayoutInfo getDefaultSIMTLayoutInfo(mlir::MLIRContext *ctx,
|
|
unsigned rank, int subgroupSize) {
|
|
assert((rank == 1 || rank == 2) && "Expected 1D or 2D vector.");
|
|
if (rank == 1) {
|
|
return LayoutInfo(xegpu::LayoutAttr::get(ctx, {subgroupSize}, {1}));
|
|
}
|
|
return LayoutInfo(xegpu::LayoutAttr::get(ctx, {1, subgroupSize}, {1, 1}));
|
|
}
|
|
|
|
/// Helper to get the default layout for 2D block operations.
|
|
template <typename Ty>
|
|
static LayoutInfo getSIMTLayoutInfoBlockIO(Ty ty,
|
|
const xegpu::uArch::uArch *uArch,
|
|
unsigned packingSize) {
|
|
// Expecting a 1D or 2D vector.
|
|
assert((ty.getRank() == 1 || ty.getRank() == 2) &&
|
|
"Expected 1D or 2D vector.");
|
|
// Expecting int or float element type.
|
|
assert(ty.getElementType().isIntOrFloat() &&
|
|
"Expected int or float element type.");
|
|
// If the rank is 1, then return default layout for 1D vector.
|
|
if (ty.getRank() == 1)
|
|
return getDefaultSIMTLayoutInfo(ty.getContext(), 1, uArch);
|
|
// Packing factor is determined by the element type bitwidth.
|
|
unsigned bitwidth = ty.getElementType().getIntOrFloatBitWidth();
|
|
int packingFactor = bitwidth < packingSize ? packingSize / bitwidth : 1;
|
|
return LayoutInfo(xegpu::LayoutAttr::get(
|
|
ty.getContext(), {1, uArch->getSubgroupSize()}, {1, packingFactor}));
|
|
}
|
|
|
|
/// Helper to get the default layout for a vector type.
|
|
static LayoutInfo getSIMTLayoutInfoScatterIO(VectorType vectorTy,
|
|
const xegpu::uArch::uArch *uArch) {
|
|
// Expecting a 1D or 2D vector.
|
|
assert((vectorTy.getRank() == 1 || vectorTy.getRank() == 2) &&
|
|
"Expected 1D or 2D vector.");
|
|
// Expecting int or float element type.
|
|
assert(vectorTy.getElementType().isIntOrFloat() &&
|
|
"Expected int or float element type.");
|
|
// If the rank is 1, then return default layout for 1D vector.
|
|
const unsigned packingSize{uArch->getGeneralPackedFormatBitSize()};
|
|
if (vectorTy.getRank() == 1)
|
|
return getDefaultSIMTLayoutInfo(vectorTy.getContext(), 1, uArch);
|
|
// Packing factor is determined by the element type bitwidth.
|
|
unsigned bitwidth = vectorTy.getElementType().getIntOrFloatBitWidth();
|
|
int packingFactor = bitwidth < packingSize ? packingSize / bitwidth : 1;
|
|
return LayoutInfo(xegpu::LayoutAttr::get(vectorTy.getContext(),
|
|
{uArch->getSubgroupSize(), 1},
|
|
{1, packingFactor}));
|
|
}
|
|
|
|
/// Helper Function to get the expected layouts for DPAS operands. `lane_data`
|
|
/// is set according to the following criteria:
|
|
/// * For A operand, the data must be packed in minimum
|
|
/// `packedSizeInBitsForDefault`
|
|
/// * For B operand, the data must be packed in minimum
|
|
/// `packedSizeInBitsForDpasB`
|
|
static LayoutInfo
|
|
getSIMTLayoutInfoForDPASOperand(VectorType vectorTy, unsigned operandNum,
|
|
const xegpu::uArch::uArch *uArch,
|
|
unsigned packingSize) {
|
|
Type elementTy = vectorTy.getElementType();
|
|
assert(elementTy.isIntOrFloat() &&
|
|
"Expected int or float type in DPAS operands");
|
|
SmallVector<int32_t, 2> layout({1, uArch->getSubgroupSize()});
|
|
// For B operand, data must be packed in minimum `packedDpasBSizeInBits` and
|
|
// must have the VNNI format.
|
|
if (operandNum == 1 && elementTy.getIntOrFloatBitWidth() < packingSize) {
|
|
SmallVector<int32_t, 2> data(
|
|
{static_cast<int32_t>(packingSize / elementTy.getIntOrFloatBitWidth()),
|
|
1});
|
|
return LayoutInfo(
|
|
xegpu::LayoutAttr::get(vectorTy.getContext(), layout, data));
|
|
}
|
|
// Otherwise, return the default layout for the vector type.
|
|
return getSIMTLayoutInfoBlockIO(vectorTy, uArch, packingSize);
|
|
}
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// LayoutInfoPropagation
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// Backward data flow analysis to propagate the lane_layout and lane_data of
|
|
/// each value in the program. Currently, the layouts for operands DPAS,
|
|
/// StoreNd, and StoreScatter are fixed (known before propagation). Purpose of
|
|
/// this analysis is to propagate those known layouts to all their producers and
|
|
/// (other) consumers.
|
|
class LayoutInfoPropagation
|
|
: public SparseBackwardDataFlowAnalysis<LayoutInfoLattice> {
|
|
private:
|
|
LayoutKind layoutKind;
|
|
void visitDpasOp(xegpu::DpasOp dpas, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitStoreNdOp(xegpu::StoreNdOp store,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitStoreScatterOp(xegpu::StoreScatterOp storeScatter,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitLoadNdOp(xegpu::LoadNdOp load,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitLoadGatherOp(xegpu::LoadGatherOp load,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitTransposeOp(vector::TransposeOp transpose,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitVectorBitcastOp(vector::BitCastOp bitcast,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitCreateDescOp(xegpu::CreateDescOp createDesc,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitUpdateNdOffsetOp(xegpu::UpdateNdOffsetOp updateNdOffset,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitPrefetchNdOp(xegpu::PrefetchNdOp prefetch,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitVectorMultiReductionOp(vector::MultiDimReductionOp reduction,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitVectorBroadCastOp(vector::BroadcastOp broadcast,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
void visitShapeCastOp(vector::ShapeCastOp shapeCast,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
void visitStoreMatrixOp(xegpu::StoreMatrixOp store,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results);
|
|
|
|
bool hasParamsOfLayoutKind(xegpu::DistributeLayoutAttr anchorLayout);
|
|
|
|
public:
|
|
LayoutInfoPropagation(DataFlowSolver &solver,
|
|
SymbolTableCollection &symbolTable,
|
|
LayoutKind layoutKind)
|
|
: SparseBackwardDataFlowAnalysis(solver, symbolTable),
|
|
layoutKind(layoutKind) {}
|
|
using SparseBackwardDataFlowAnalysis::SparseBackwardDataFlowAnalysis;
|
|
|
|
LogicalResult
|
|
visitOperation(Operation *op, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) override;
|
|
|
|
void visitBranchOperand(OpOperand &operand) override {};
|
|
|
|
void visitCallOperand(OpOperand &operand) override {};
|
|
|
|
void
|
|
visitNonControlFlowArguments(RegionSuccessor &successor,
|
|
ArrayRef<BlockArgument> arguments) override {};
|
|
|
|
void visitExternalCall(CallOpInterface call,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) override {
|
|
};
|
|
|
|
void setToExitState(LayoutInfoLattice *lattice) override {
|
|
(void)lattice->meet(LayoutInfo());
|
|
}
|
|
};
|
|
} // namespace
|
|
|
|
LogicalResult LayoutInfoPropagation::visitOperation(
|
|
Operation *op, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
TypeSwitch<Operation *>(op)
|
|
.Case(
|
|
[&](xegpu::DpasOp dpasOp) { visitDpasOp(dpasOp, operands, results); })
|
|
.Case([&](xegpu::StoreNdOp storeNdOp) {
|
|
visitStoreNdOp(storeNdOp, operands, results);
|
|
})
|
|
.Case([&](xegpu::StoreScatterOp storeScatterOp) {
|
|
visitStoreScatterOp(storeScatterOp, operands, results);
|
|
})
|
|
.Case([&](xegpu::LoadNdOp loadNdOp) {
|
|
visitLoadNdOp(loadNdOp, operands, results);
|
|
})
|
|
.Case([&](xegpu::LoadGatherOp loadGatherOp) {
|
|
visitLoadGatherOp(loadGatherOp, operands, results);
|
|
})
|
|
.Case([&](xegpu::CreateDescOp createDescOp) {
|
|
visitCreateDescOp(createDescOp, operands, results);
|
|
})
|
|
.Case([&](xegpu::UpdateNdOffsetOp updateNdOffsetOp) {
|
|
visitUpdateNdOffsetOp(updateNdOffsetOp, operands, results);
|
|
})
|
|
.Case([&](xegpu::PrefetchNdOp prefetchNdOp) {
|
|
visitPrefetchNdOp(prefetchNdOp, operands, results);
|
|
})
|
|
.Case([&](vector::TransposeOp transposeOp) {
|
|
visitTransposeOp(transposeOp, operands, results);
|
|
})
|
|
.Case([&](vector::BitCastOp bitcastOp) {
|
|
visitVectorBitcastOp(bitcastOp, operands, results);
|
|
})
|
|
.Case([&](vector::MultiDimReductionOp reductionOp) {
|
|
visitVectorMultiReductionOp(reductionOp, operands, results);
|
|
})
|
|
.Case([&](vector::BroadcastOp broadcastOp) {
|
|
visitVectorBroadCastOp(broadcastOp, operands, results);
|
|
})
|
|
.Case([&](vector::ShapeCastOp shapeCastOp) {
|
|
visitShapeCastOp(shapeCastOp, operands, results);
|
|
})
|
|
.Case([&](xegpu::StoreMatrixOp storeMatrixOp) {
|
|
visitStoreMatrixOp(storeMatrixOp, operands, results);
|
|
})
|
|
// All other ops.
|
|
.Default([&](Operation *op) {
|
|
for (const LayoutInfoLattice *resultInfo : results) {
|
|
if (!resultInfo->getValue().isAssigned())
|
|
continue;
|
|
for (auto [operandInfo, operand] :
|
|
llvm::zip(operands, op->getOpOperands())) {
|
|
// If the operand type is not a vector or tensor descriptor, skip
|
|
// it.
|
|
if (!isa<xegpu::TensorDescType, VectorType>(
|
|
operand.get().getType()))
|
|
continue;
|
|
// Propagate the result layout to the operand.
|
|
meet(operandInfo, *resultInfo);
|
|
}
|
|
}
|
|
});
|
|
|
|
return success();
|
|
}
|
|
|
|
bool LayoutInfoPropagation::hasParamsOfLayoutKind(
|
|
xegpu::DistributeLayoutAttr anchorLayout) {
|
|
if (anchorLayout == nullptr) {
|
|
return false;
|
|
}
|
|
if (layoutKind == LayoutKind::InstData) {
|
|
return !(anchorLayout.getEffectiveInstDataAsInt().empty());
|
|
} else if (layoutKind == LayoutKind::Lane) {
|
|
return !(anchorLayout.getEffectiveLaneLayoutAsInt().empty() ||
|
|
anchorLayout.getEffectiveLaneDataAsInt().empty());
|
|
} else if (layoutKind == LayoutKind::Subgroup) {
|
|
return !(anchorLayout.getEffectiveSgLayoutAsInt().empty() ||
|
|
anchorLayout.getEffectiveSgDataAsInt().empty());
|
|
}
|
|
return false;
|
|
}
|
|
|
|
// This function returns all layouts for the given sgCount, whose sgData:
|
|
// 1. Evenly divides the wgShape.
|
|
// 2. Is a multiple of instData.
|
|
// Example:
|
|
// wgShape = [128, 64], instData = [8, 16], sgCount = 32
|
|
// Returns layouts:
|
|
// [(8,4), (16,2)], which correspond to sgData [16,16] and [8,32].
|
|
SmallVector<std::pair<int, int>> getValidLayouts(ArrayRef<int64_t> wgShape,
|
|
ArrayRef<int> instData,
|
|
int64_t sgCount) {
|
|
SmallVector<std::pair<int, int>> candidates;
|
|
for (int sgLayout0 = 1; sgLayout0 <= sgCount; ++sgLayout0) {
|
|
if (sgCount % sgLayout0)
|
|
continue;
|
|
int sgLayout1 = sgCount / sgLayout0;
|
|
int sgData0 = wgShape[0] / sgLayout0;
|
|
int sgData1 = wgShape[1] / sgLayout1;
|
|
if ((wgShape[0] % sgLayout0 || wgShape[1] % sgLayout1) ||
|
|
(sgData0 % instData[0] || sgData1 % instData[1]))
|
|
continue;
|
|
candidates.emplace_back(sgLayout0, sgLayout1);
|
|
}
|
|
// Sort primarily by how balanced they are
|
|
// (i.e., minimize the absolute difference between the two dimensions), and
|
|
// secondarily by the first dimension in ascending order.
|
|
llvm::sort(candidates, [](const std::pair<int, int> &lhs,
|
|
const std::pair<int, int> &rhs) {
|
|
int diffLhs = std::abs(lhs.first - lhs.second);
|
|
int diffRhs = std::abs(rhs.first - rhs.second);
|
|
if (diffLhs != diffRhs)
|
|
return diffLhs < diffRhs;
|
|
return lhs.first < rhs.first;
|
|
});
|
|
return candidates;
|
|
}
|
|
|
|
FailureOr<int64_t> getNumSg(Operation *op, const int sgSize) {
|
|
// Oblivious to workitem layout, the total count matters.
|
|
auto gpuFunc = op->getParentOfType<gpu::GPUFuncOp>();
|
|
if (!gpuFunc)
|
|
return failure();
|
|
auto knownBlockSize = gpuFunc.getKnownBlockSize();
|
|
if (!knownBlockSize.has_value())
|
|
return failure();
|
|
const int flatBlockSize = llvm::product_of(knownBlockSize.value());
|
|
return flatBlockSize / sgSize;
|
|
}
|
|
|
|
void LayoutInfoPropagation::visitPrefetchNdOp(
|
|
xegpu::PrefetchNdOp prefetch, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
|
|
LayoutInfo prefetchLayout;
|
|
xegpu::DistributeLayoutAttr anchorLayout = prefetch.getLayoutAttr();
|
|
if (hasParamsOfLayoutKind(anchorLayout)) {
|
|
prefetchLayout = LayoutInfo(anchorLayout);
|
|
} else {
|
|
// Here we assign the default layout to the tensor descriptor operand of
|
|
// prefetch.
|
|
auto tdescTy = prefetch.getTensorDescType();
|
|
|
|
auto uArch = getUArch(getChipStr(prefetch).value_or(""));
|
|
const auto *uArchInstruction =
|
|
dyn_cast<xegpu::uArch::Subgroup2DBlockPrefetchInstruction>(
|
|
uArch->getInstruction(
|
|
xegpu::uArch::InstructionKind::Subgroup2DBlockPrefetch));
|
|
|
|
auto blockWHC =
|
|
uArchInstruction->getBlockWidthHeightCount(tdescTy.getElementType());
|
|
if (!blockWHC)
|
|
prefetch.emitWarning("No known block params found for the element type.");
|
|
auto [bWidth, bHeight, bCount] = blockWHC.value();
|
|
SmallVector<int> instData;
|
|
int instWidth = xegpu::getLargestDivisor(
|
|
static_cast<int>(tdescTy.getDimSize(tdescTy.getRank() - 1)), bWidth);
|
|
if (instWidth == -1)
|
|
prefetch.emitWarning(
|
|
"No suitable instruction multiple found for the given shape.");
|
|
if (tdescTy.getRank() == 1)
|
|
instData = {instWidth};
|
|
else {
|
|
int instHeight = xegpu::getLargestDivisor(
|
|
static_cast<int>(tdescTy.getDimSize(tdescTy.getRank() - 2)), bHeight);
|
|
if (instHeight == -1)
|
|
prefetch.emitWarning(
|
|
"No suitable instruction multiple found for the given shape.");
|
|
instData = {instHeight, instWidth};
|
|
}
|
|
|
|
if (layoutKind == LayoutKind::InstData)
|
|
prefetchLayout =
|
|
LayoutInfo(xegpu::LayoutAttr::get(tdescTy.getContext(), instData));
|
|
else
|
|
prefetchLayout = getSIMTLayoutInfoBlockIO(
|
|
tdescTy, uArch, uArchInstruction->getPackedFormatBitSize());
|
|
|
|
prefetch.setLayoutAttr(
|
|
dyn_cast<xegpu::DistributeLayoutAttr>(prefetchLayout.get()));
|
|
}
|
|
// Propagate the layout to the source tensor descriptor.
|
|
propagateIfChanged(operands[0], operands[0]->meet(prefetchLayout));
|
|
}
|
|
|
|
void LayoutInfoPropagation::visitVectorMultiReductionOp(
|
|
vector::MultiDimReductionOp reduction,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
// The layout of the result must be present.
|
|
LayoutInfo resultLayout = results[0]->getValue();
|
|
if (!resultLayout.isAssigned())
|
|
return;
|
|
// We only consider 2D -> 1D reductions at this point.
|
|
VectorType resultTy = llvm::dyn_cast<VectorType>(reduction.getDestType());
|
|
if (!resultTy || resultTy.getRank() != 1) {
|
|
reduction.emitWarning("Expecting output type to be 1D vector.");
|
|
return;
|
|
}
|
|
auto uArch = getUArch(xegpu::getChipStr(reduction).value_or(""));
|
|
// Given that the result is 1D, the layout of the operand should be 2D with
|
|
// default layout.
|
|
LayoutInfo operandLayout = getDefaultSIMTLayoutInfo(
|
|
reduction->getContext(), 2, uArch->getSubgroupSize());
|
|
propagateIfChanged(operands[0], operands[0]->meet(operandLayout));
|
|
// Accumulator should have the same layout as the result.
|
|
propagateIfChanged(operands[1], operands[1]->meet(resultLayout));
|
|
}
|
|
|
|
void LayoutInfoPropagation::visitVectorBroadCastOp(
|
|
vector::BroadcastOp broadcast, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
// The layout of the result must be present.
|
|
LayoutInfo resultLayout = results[0]->getValue();
|
|
if (!resultLayout.isAssigned())
|
|
return;
|
|
// Only consider vector to vector broadcasts for now.
|
|
VectorType resultTy = broadcast.getResultVectorType();
|
|
VectorType sourceTy = dyn_cast<VectorType>(broadcast.getSourceType());
|
|
// skip layout propagation for non-vector source operand.
|
|
if (!sourceTy)
|
|
return;
|
|
|
|
// Hanlding broadcast from low-rank to high-rank (e.g., 1D to 2D) case.
|
|
if (sourceTy.getRank() != resultTy.getRank()) {
|
|
auto sourceDims = sourceTy.getShape();
|
|
auto resultDims = resultTy.getShape();
|
|
SmallVector<int64_t> bcastDims;
|
|
auto dimDiff = resultTy.getRank() - sourceTy.getRank();
|
|
// adding the missing leading dims
|
|
for (int i = 0; i < dimDiff; i++)
|
|
bcastDims.push_back(i);
|
|
|
|
// for the rest dims in the resultTy, if sourceTy dim is 1, then it's
|
|
// broadcasted dim
|
|
for (size_t i = 0; i < sourceDims.size(); i++)
|
|
if ((sourceDims[i] == 1) && (resultDims[i + dimDiff] != 1))
|
|
bcastDims.push_back(i + dimDiff);
|
|
|
|
// create a slice layout for the source
|
|
xegpu::SliceAttr sliceLayout = xegpu::SliceAttr::get(
|
|
broadcast->getContext(),
|
|
cast<xegpu::DistributeLayoutAttr>(resultLayout.get()),
|
|
DenseI64ArrayAttr::get(broadcast->getContext(), bcastDims));
|
|
|
|
propagateIfChanged(operands[0], operands[0]->meet(LayoutInfo(sliceLayout)));
|
|
return;
|
|
}
|
|
propagateIfChanged(operands[0], operands[0]->meet(resultLayout));
|
|
}
|
|
|
|
void LayoutInfoPropagation::visitShapeCastOp(
|
|
vector::ShapeCastOp shapeCast, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
// The layout of the result must be present.
|
|
LayoutInfo resultLayout = results[0]->getValue();
|
|
if (!resultLayout.isAssigned())
|
|
return;
|
|
VectorType sourceTy = shapeCast.getSourceVectorType();
|
|
VectorType resultTy = shapeCast.getResultVectorType();
|
|
// Shape cast layout propagation only supports 1D -> 2D shape casts.
|
|
// TODO: Support kD -> nD shape casts (k < n, n >= 2) where expanded dims are
|
|
// unit dimensions and non-unit dims match.
|
|
if (sourceTy.getRank() != 1 || resultTy.getRank() != 2) {
|
|
shapeCast.emitWarning("Expecting shape cast to be 1D -> 2D.");
|
|
return;
|
|
}
|
|
int64_t slicedDim = resultTy.getShape()[0] == 1 ? 0 : 1;
|
|
xegpu::SliceAttr sliceLayout = xegpu::SliceAttr::get(
|
|
shapeCast->getContext(), cast<xegpu::LayoutAttr>(resultLayout.get()),
|
|
DenseI64ArrayAttr::get(shapeCast->getContext(), {slicedDim}));
|
|
propagateIfChanged(operands[0], operands[0]->meet(LayoutInfo(sliceLayout)));
|
|
}
|
|
|
|
/// Propagate the layout of the result tensor to the source tensor descriptor
|
|
/// in UpdateNdOffsetOp.
|
|
void LayoutInfoPropagation::visitUpdateNdOffsetOp(
|
|
xegpu::UpdateNdOffsetOp updateNdOffset,
|
|
ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
// The layout of the result must be present.
|
|
LayoutInfo resultLayout = results[0]->getValue();
|
|
if (!resultLayout.isAssigned())
|
|
return;
|
|
// Propagate the layout to the source operand.
|
|
propagateIfChanged(operands[0], operands[0]->meet(resultLayout));
|
|
}
|
|
|
|
/// Set the layouts for DPAS A, B, and C operands.
|
|
void LayoutInfoPropagation::visitDpasOp(
|
|
xegpu::DpasOp dpas, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
|
|
LayoutInfo dpasALayout;
|
|
LayoutInfo dpasBLayout;
|
|
LayoutInfo dpasCDLayout;
|
|
|
|
xegpu::DistributeLayoutAttr anchorLayoutCD = dpas.getLayoutCdAttr();
|
|
if (hasParamsOfLayoutKind(anchorLayoutCD)) {
|
|
xegpu::DistributeLayoutAttr anchorLayoutA = dpas.getLayoutAAttr();
|
|
xegpu::DistributeLayoutAttr anchorLayoutB = dpas.getLayoutBAttr();
|
|
assert(hasParamsOfLayoutKind(anchorLayoutA) &&
|
|
"Expected anchor layout for DPAS A operand.");
|
|
assert(hasParamsOfLayoutKind(anchorLayoutB) &&
|
|
"Expected anchor layout for DPAS B operand.");
|
|
dpasALayout = LayoutInfo(anchorLayoutA);
|
|
dpasBLayout = LayoutInfo(anchorLayoutB);
|
|
dpasCDLayout = LayoutInfo(anchorLayoutCD);
|
|
} else {
|
|
VectorType aTy = dpas.getLhsType();
|
|
VectorType bTy = dpas.getRhsType();
|
|
VectorType cTy;
|
|
const bool hasAcc = operands.size() > 2;
|
|
if (hasAcc)
|
|
cTy = dpas.getAccType();
|
|
|
|
auto uArch = getUArch(getChipStr(dpas).value_or(""));
|
|
const int subgroupSize = uArch->getSubgroupSize();
|
|
const auto *uArchInstruction =
|
|
dyn_cast<xegpu::uArch::SubgroupMatrixMultiplyAcc>(uArch->getInstruction(
|
|
xegpu::uArch::InstructionKind::SubgroupMatrixMultiplyAcc));
|
|
|
|
const unsigned dataALen = aTy.getShape().front();
|
|
auto supportedALen = uArchInstruction->getSupportedM(aTy.getElementType());
|
|
const int maxALen =
|
|
xegpu::getLargestDivisor(dataALen, ArrayRef<unsigned>(supportedALen));
|
|
if (maxALen == -1)
|
|
dpas.emitWarning(
|
|
"No suitable instruction multiple found for the given shape.");
|
|
|
|
const unsigned dataBLen = bTy.getShape().back();
|
|
auto supportedBLen = uArchInstruction->getSupportedN(bTy.getElementType());
|
|
|
|
const int maxBLen =
|
|
xegpu::getLargestDivisor(dataBLen, ArrayRef<unsigned>(supportedBLen));
|
|
|
|
if (maxBLen == -1)
|
|
dpas.emitWarning(
|
|
"No suitable instruction multiple found for the given shape.");
|
|
SmallVector<int> instDataA = {maxALen, subgroupSize};
|
|
SmallVector<int> instDataB = {subgroupSize, maxBLen};
|
|
SmallVector<int> instDataCD;
|
|
if (hasAcc) {
|
|
const unsigned dataCLen = bTy.getShape().back();
|
|
auto supportedCLen =
|
|
uArchInstruction->getSupportedN(cTy.getElementType());
|
|
const int maxCLen =
|
|
xegpu::getLargestDivisor(dataCLen, ArrayRef<unsigned>(supportedCLen));
|
|
if (maxCLen == -1) {
|
|
dpas.emitWarning(
|
|
"No suitable instruction multiple found for the given shape.");
|
|
return;
|
|
}
|
|
instDataCD = {maxALen, maxCLen};
|
|
}
|
|
if (layoutKind == LayoutKind::InstData) {
|
|
dpasALayout =
|
|
LayoutInfo(xegpu::LayoutAttr::get(dpas.getContext(), instDataA));
|
|
dpasBLayout =
|
|
LayoutInfo(xegpu::LayoutAttr::get(dpas.getContext(), instDataB));
|
|
if (hasAcc) {
|
|
dpasCDLayout =
|
|
LayoutInfo(xegpu::LayoutAttr::get(dpas.getContext(), instDataCD));
|
|
}
|
|
} else if (layoutKind == LayoutKind::Lane) {
|
|
dpasALayout = getSIMTLayoutInfoForDPASOperand(
|
|
aTy, 0, uArch, uArchInstruction->getPackedFormatBitSizeA());
|
|
dpasBLayout = getSIMTLayoutInfoForDPASOperand(
|
|
bTy, 1, uArch, uArchInstruction->getPackedFormatBitSizeB());
|
|
if (hasAcc) {
|
|
dpasCDLayout = getSIMTLayoutInfoForDPASOperand(
|
|
cTy, 2, uArch, uArchInstruction->getPackedFormatBitSizeB());
|
|
}
|
|
} else { // Subgroup
|
|
auto numSgOrErr = getNumSg(dpas, subgroupSize);
|
|
if (failed(numSgOrErr)) {
|
|
dpas.emitWarning(
|
|
"Unable to determine the number of subgroups for the operation.");
|
|
return;
|
|
}
|
|
|
|
// Step 1. Get all valid layouts for A, B, and C operands.
|
|
// All operands must have at least one valid subgroup layout.
|
|
LayoutInfo layoutD = results[0]->getValue();
|
|
SmallVector<int> sgLayoutD = layoutD.getSgLayout();
|
|
assert(!sgLayoutD.empty() && "Expected layout for DPAS result.");
|
|
auto layoutDVal = std::make_pair(sgLayoutD[0], sgLayoutD[1]);
|
|
|
|
auto layoutsA =
|
|
getValidLayouts(aTy.getShape(), instDataA, numSgOrErr.value());
|
|
auto layoutsB =
|
|
getValidLayouts(bTy.getShape(), instDataB, numSgOrErr.value());
|
|
SmallVector<std::pair<int, int>> layoutsC;
|
|
if (hasAcc)
|
|
layoutsC =
|
|
getValidLayouts(cTy.getShape(), instDataCD, numSgOrErr.value());
|
|
|
|
if (layoutsA.empty() || layoutsB.empty() ||
|
|
(hasAcc && layoutsC.empty())) {
|
|
dpas.emitWarning(
|
|
"Unable to determine suitable subgroup layout for A/B/C matrices.");
|
|
return;
|
|
}
|
|
|
|
// Step 2. If the result D layout can be reused for all operands, that
|
|
// layout is chosen. Otherwise, pick the most balanced subgroup layout
|
|
// that is valid for A, B and C (if present) operands
|
|
llvm::DenseSet<std::pair<int, int>> setA(layoutsA.begin(),
|
|
layoutsA.end());
|
|
llvm::DenseSet<std::pair<int, int>> setC;
|
|
if (hasAcc)
|
|
setC = llvm::DenseSet<std::pair<int, int>>(layoutsC.begin(),
|
|
layoutsC.end());
|
|
std::optional<std::pair<int, int>> bestPick;
|
|
for (auto &l : layoutsB) {
|
|
if (setA.contains(l)) {
|
|
if (hasAcc && !setC.contains(l))
|
|
continue;
|
|
// Is in (A and B and C) and matches D -> best pick
|
|
if (l == layoutDVal) {
|
|
bestPick = l;
|
|
break;
|
|
}
|
|
// Is in (A and B and C), balanced layout comes first
|
|
if (!bestPick)
|
|
bestPick = l;
|
|
}
|
|
}
|
|
// Step 3. If there is no subgroup layout compatible with A, B and C (if
|
|
// present) operands, we fail.
|
|
SmallVector<int> sgLayout;
|
|
if (bestPick) {
|
|
sgLayout = {bestPick->first, bestPick->second};
|
|
} else {
|
|
dpas.emitWarning("Unable to find common subgroup layout for matrices.");
|
|
return;
|
|
}
|
|
SmallVector<int> sgDataA = {
|
|
static_cast<int>(aTy.getShape()[0]) / sgLayout[0],
|
|
static_cast<int>(aTy.getShape()[1]) / sgLayout[1]};
|
|
SmallVector<int> sgDataB = {
|
|
static_cast<int>(bTy.getShape()[0]) / sgLayout[0],
|
|
static_cast<int>(bTy.getShape()[1]) / sgLayout[1]};
|
|
SmallVector<int> sgDataC;
|
|
if (hasAcc)
|
|
sgDataC = {
|
|
static_cast<int>(dpas.getResultType().getShape()[0]) / sgLayout[0],
|
|
static_cast<int>(dpas.getResultType().getShape()[1]) / sgLayout[1]};
|
|
|
|
dpasALayout = LayoutInfo(xegpu::LayoutAttr::get(
|
|
aTy.getContext(), DenseI32ArrayAttr::get(aTy.getContext(), sgLayout),
|
|
DenseI32ArrayAttr::get(aTy.getContext(), sgDataA),
|
|
/*inst_data =*/nullptr, /*lane_layout =*/nullptr,
|
|
/*lane_data =*/nullptr, /*order =*/nullptr));
|
|
|
|
dpasBLayout = LayoutInfo(xegpu::LayoutAttr::get(
|
|
bTy.getContext(), DenseI32ArrayAttr::get(bTy.getContext(), sgLayout),
|
|
DenseI32ArrayAttr::get(bTy.getContext(), sgDataB),
|
|
/*inst_data =*/nullptr, /*lane_layout =*/nullptr,
|
|
/*lane_data =*/nullptr, /*order =*/nullptr));
|
|
if (hasAcc) {
|
|
dpasCDLayout = LayoutInfo(xegpu::LayoutAttr::get(
|
|
cTy.getContext(),
|
|
DenseI32ArrayAttr::get(cTy.getContext(), sgLayout),
|
|
DenseI32ArrayAttr::get(cTy.getContext(), sgDataC),
|
|
/*inst_data =*/nullptr, /*lane_layout =*/nullptr,
|
|
/*lane_data =*/nullptr, /*order =*/nullptr));
|
|
}
|
|
}
|
|
dpas.setLayoutAAttr(
|
|
dyn_cast<xegpu::DistributeLayoutAttr>(dpasALayout.get()));
|
|
dpas.setLayoutBAttr(
|
|
dyn_cast<xegpu::DistributeLayoutAttr>(dpasBLayout.get()));
|
|
if (hasAcc)
|
|
dpas.setLayoutCdAttr(
|
|
dyn_cast<xegpu::DistributeLayoutAttr>(dpasCDLayout.get()));
|
|
}
|
|
|
|
propagateIfChanged(operands[0], operands[0]->meet(dpasALayout));
|
|
propagateIfChanged(operands[1], operands[1]->meet(dpasBLayout));
|
|
if (operands.size() > 2) {
|
|
propagateIfChanged(operands[2], operands[2]->meet(dpasCDLayout));
|
|
}
|
|
}
|
|
|
|
/// Set the layout for the value and tensor descriptor operands in StoreNdOp.
|
|
void LayoutInfoPropagation::visitStoreNdOp(
|
|
xegpu::StoreNdOp store, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
|
|
LayoutInfo storeLayout;
|
|
xegpu::DistributeLayoutAttr anchorLayout = store.getLayoutAttr();
|
|
if (hasParamsOfLayoutKind(anchorLayout)) {
|
|
storeLayout = LayoutInfo(anchorLayout);
|
|
} else {
|
|
auto uArch = getUArch(getChipStr(store).value_or(""));
|
|
const auto *uArchInstruction =
|
|
dyn_cast<xegpu::uArch::Subgroup2DBlockStoreInstruction>(
|
|
uArch->getInstruction(
|
|
xegpu::uArch::InstructionKind::Subgroup2DBlockStore));
|
|
VectorType dataTy = store.getValueType();
|
|
auto blockWHC = uArchInstruction->getBlockWidthHeightCount(
|
|
store.getValueType().getElementType());
|
|
if (!blockWHC)
|
|
store.emitWarning("No known block params found for the element type.");
|
|
auto [bWidth, bHeight, bCount] = blockWHC.value();
|
|
SmallVector<int> instData;
|
|
int instWidth = xegpu::getLargestDivisor(
|
|
static_cast<int>(dataTy.getDimSize(dataTy.getRank() - 1)), bWidth);
|
|
if (instWidth == -1)
|
|
store.emitWarning(
|
|
"No suitable instruction multiple found for the given shape.");
|
|
if (dataTy.getRank() == 1)
|
|
instData = {instWidth};
|
|
else {
|
|
int instHeight = xegpu::getLargestDivisor(
|
|
static_cast<int>(dataTy.getDimSize(dataTy.getRank() - 2)), bHeight);
|
|
if (instHeight == -1)
|
|
store.emitWarning(
|
|
"No suitable instruction multiple found for the given shape.");
|
|
instData = {instHeight, instWidth};
|
|
}
|
|
|
|
if (layoutKind == LayoutKind::InstData)
|
|
storeLayout =
|
|
LayoutInfo(xegpu::LayoutAttr::get(dataTy.getContext(), instData));
|
|
else if (layoutKind == LayoutKind::Lane)
|
|
storeLayout =
|
|
getSIMTLayoutInfoBlockIO(store.getValueType(), uArch,
|
|
uArchInstruction->getPackedFormatBitSize());
|
|
else { // LayoutKind::Subgroup
|
|
auto sgSize = uArch->getSubgroupSize();
|
|
auto numSgOrErr = getNumSg(store, sgSize);
|
|
if (failed(numSgOrErr)) {
|
|
store.emitWarning(
|
|
"Unable to determine the number of subgroups for the operation.");
|
|
return;
|
|
}
|
|
auto sgLayouts = getValidLayouts(store.getValueType().getShape(),
|
|
instData, numSgOrErr.value());
|
|
if (sgLayouts.empty()) {
|
|
store.emitWarning(
|
|
"Unable to determine suitable subgroup layout for store value.");
|
|
return;
|
|
}
|
|
SmallVector<int> sgLayout = {sgLayouts[0].first, sgLayouts[0].second};
|
|
SmallVector<int> sgData = {
|
|
static_cast<int>(dataTy.getShape()[0]) / sgLayout[0],
|
|
static_cast<int>(dataTy.getShape()[1]) / sgLayout[1]};
|
|
storeLayout = LayoutInfo(xegpu::LayoutAttr::get(
|
|
dataTy.getContext(),
|
|
DenseI32ArrayAttr::get(dataTy.getContext(), sgLayout),
|
|
DenseI32ArrayAttr::get(dataTy.getContext(), sgData),
|
|
/*inst_data =*/nullptr, /*lane_layout =*/nullptr,
|
|
/*lane_data =*/nullptr, /*order =*/nullptr));
|
|
}
|
|
store.setLayoutAttr(
|
|
dyn_cast<xegpu::DistributeLayoutAttr>(storeLayout.get()));
|
|
}
|
|
// Propagate the layout to the value operand.
|
|
// Both operands should have the same layout
|
|
for (LayoutInfoLattice *operand : operands)
|
|
propagateIfChanged(operand, operand->meet(storeLayout));
|
|
}
|
|
|
|
/// Propagate the layout of the value to the tensor descriptor operand in
|
|
/// LoadNdOp.
|
|
void LayoutInfoPropagation::visitLoadNdOp(
|
|
xegpu::LoadNdOp load, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
|
|
LayoutInfo loadLayout;
|
|
xegpu::DistributeLayoutAttr anchorLayout = load.getLayoutAttr();
|
|
if (hasParamsOfLayoutKind(anchorLayout)) {
|
|
loadLayout = LayoutInfo(anchorLayout);
|
|
} else {
|
|
|
|
LayoutInfo valueLayout = results[0]->getValue();
|
|
// Need the layout of the value to propagate to the tensor descriptor.
|
|
if (!valueLayout.isAssigned())
|
|
return;
|
|
loadLayout = valueLayout;
|
|
// LoadNdOp has the transpose effect. However, at the stage of this analysis
|
|
// this effect is not expected and should be abstracted away. Emit a
|
|
// warning.
|
|
if (auto transpose = load.getTranspose()) {
|
|
load.emitWarning("Transpose effect is not expected for LoadNdOp at "
|
|
"LayoutInfoPropagation stage.");
|
|
loadLayout = valueLayout.transpose(transpose.value());
|
|
}
|
|
load.setLayoutAttr(dyn_cast<xegpu::DistributeLayoutAttr>(loadLayout.get()));
|
|
}
|
|
// Propagate the new layout to the tensor descriptor operand.
|
|
propagateIfChanged(operands[0], operands[0]->meet(loadLayout));
|
|
}
|
|
|
|
/// For vector::TransposeOp, the layout of the result is transposed and
|
|
/// propagated to the operand.
|
|
void LayoutInfoPropagation::visitTransposeOp(
|
|
vector::TransposeOp transpose, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
// Need the layout of transpose result to propagate to the operands.
|
|
LayoutInfo resultLayout = results[0]->getValue();
|
|
if (!resultLayout.isAssigned())
|
|
return;
|
|
LayoutInfo newLayout = resultLayout.transpose(transpose.getPermutation());
|
|
// Propagate the new layout to the vector operand.
|
|
propagateIfChanged(operands[0], operands[0]->meet(newLayout));
|
|
}
|
|
|
|
/// For vector::BitCastOp, the lane_data of the source layout is changed based
|
|
/// on the bit width of the source and result types.
|
|
void LayoutInfoPropagation::visitVectorBitcastOp(
|
|
vector::BitCastOp bitcast, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
// Need the layout of bitcast result to propagate to the operands.
|
|
LayoutInfo resultLayout = results[0]->getValue();
|
|
if (!resultLayout.isAssigned())
|
|
return;
|
|
int inElemTyBitWidth =
|
|
bitcast.getSourceVectorType().getElementType().getIntOrFloatBitWidth();
|
|
int outElemTyBitWidth =
|
|
bitcast.getResultVectorType().getElementType().getIntOrFloatBitWidth();
|
|
// If the element bit widths are the same, then the layout does not change.
|
|
if (inElemTyBitWidth == outElemTyBitWidth) {
|
|
propagateIfChanged(operands[0], operands[0]->meet(resultLayout));
|
|
return;
|
|
}
|
|
// Check if the result layout is valid. i.e. result vector can be distributed.
|
|
auto resultLaneLayout = resultLayout.getLaneLayout();
|
|
auto resultLaneData = resultLayout.getLaneData();
|
|
if (failed(xegpu::getDistributedVectorType(
|
|
bitcast.getResultVectorType(),
|
|
xegpu::LayoutAttr::get(bitcast->getContext(), resultLaneLayout,
|
|
resultLaneData)))) {
|
|
bitcast.emitWarning(
|
|
"Result vector type can not be evenly distributed across lanes.");
|
|
return;
|
|
}
|
|
int64_t rank = bitcast.getSourceVectorType().getRank();
|
|
// Bitcast is a `narrowing` if the input element type bit width larger than
|
|
// the output element type bit width. eg. f32 -> f16 is a narrowing bitcast.
|
|
bool isNarrowing = inElemTyBitWidth > outElemTyBitWidth;
|
|
int bitCastRatio = isNarrowing ? inElemTyBitWidth / outElemTyBitWidth
|
|
: outElemTyBitWidth / inElemTyBitWidth;
|
|
SmallVector<int> sourceLaneLayout =
|
|
resultLayout.getLaneLayout(); // Lane layout does not change for bitcast.
|
|
SmallVector<int> outData = resultLayout.getLaneData();
|
|
|
|
// TODO: Currently we assume that bitcasts does not require cross lane
|
|
// communication. So each lane must own the required number of elements to
|
|
// perform the bitcast locally without cross-lane communication.
|
|
int outInnerBitsPerLane = outData[rank - 1] * outElemTyBitWidth;
|
|
if (outInnerBitsPerLane < inElemTyBitWidth) {
|
|
bitcast.emitWarning(
|
|
"Narrowing bitcast with cross lane communication is not supported.");
|
|
return;
|
|
}
|
|
// Check if each lane owns a single element in all dimensions except the
|
|
// innermost dimension.
|
|
SmallVector<int> sourceLaneData(outData.begin(), outData.end() - 1);
|
|
if (llvm::any_of(sourceLaneData, [](int64_t d) { return d != 1; })) {
|
|
bitcast.emitWarning("Each lane must not own multiple elements in any "
|
|
"dimension other than "
|
|
"the innermost dimension.");
|
|
return;
|
|
}
|
|
// Decide lane data based on whether the bitcast is narrowing or widening.
|
|
int64_t innerMostLaneData = isNarrowing ? outData[rank - 1] / bitCastRatio
|
|
: outData[rank - 1] * bitCastRatio;
|
|
sourceLaneData.push_back(innerMostLaneData);
|
|
|
|
propagateIfChanged(
|
|
operands[0],
|
|
operands[0]->meet(LayoutInfo(xegpu::LayoutAttr::get(
|
|
bitcast->getContext(), sourceLaneLayout, sourceLaneData))));
|
|
}
|
|
|
|
/// Propagate the layout of the result to the tensor descriptor, mask and offset
|
|
/// operands in LoadGatherOp.
|
|
void LayoutInfoPropagation::visitLoadGatherOp(
|
|
xegpu::LoadGatherOp load, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
|
|
LayoutInfo loadLayout;
|
|
LayoutInfo maskLayout;
|
|
auto uArch = getUArch(getChipStr(load).value_or(""));
|
|
const int subgroupSize = uArch->getSubgroupSize();
|
|
xegpu::DistributeLayoutAttr anchorLayout = load.getLayoutAttr();
|
|
if (hasParamsOfLayoutKind(anchorLayout)) {
|
|
loadLayout = LayoutInfo(anchorLayout);
|
|
maskLayout = loadLayout;
|
|
} else {
|
|
LayoutInfo valueLayout = results[0]->getValue();
|
|
// Need the layout of the value to propagate to the tensor descriptor.
|
|
if (!valueLayout.isAssigned())
|
|
return;
|
|
|
|
auto resAttr = dyn_cast<xegpu::DistributeLayoutAttr>(valueLayout.get());
|
|
auto instDataIncoming = resAttr.getEffectiveInstDataAsInt();
|
|
if (auto sliceAttr = dyn_cast<xegpu::SliceAttr>(resAttr))
|
|
instDataIncoming = SmallVector<int64_t>(
|
|
cast<xegpu::LayoutAttr>(sliceAttr.flatten().getParent())
|
|
.getInstData()
|
|
.asArrayRef());
|
|
|
|
VectorType payloadTy = load.getValueType();
|
|
if (!payloadTy) {
|
|
load.emitWarning("Not propagating, non-vector payload supplied.");
|
|
return;
|
|
}
|
|
const auto *uArchInstruction =
|
|
dyn_cast<xegpu::uArch::LoadGatherInstruction>(
|
|
uArch->getInstruction(xegpu::uArch::InstructionKind::LoadGather));
|
|
|
|
// Check if value inst_data complies with uArch
|
|
if (layoutKind == LayoutKind::InstData) {
|
|
// Each lane loads either one element
|
|
SmallVector<int> instDataUarch{subgroupSize};
|
|
// Or multiple elements as 2D with lane's elements in the inner dimension
|
|
if (payloadTy.getRank() != 1) {
|
|
if (payloadTy.getRank() != 2) {
|
|
load.emitWarning("Expected 2D payload for LoadGatherOp.");
|
|
return;
|
|
}
|
|
instDataUarch.push_back(
|
|
(std::min(static_cast<int>(payloadTy.getShape().back()),
|
|
uArchInstruction->getMaxLaneLoadStoreSize())));
|
|
}
|
|
// If inst data does not match, enforce the uArch-based one
|
|
if (!llvm::equal(instDataIncoming, instDataUarch)) {
|
|
xegpu::LayoutAttr sourceAttr = dyn_cast<xegpu::LayoutAttr>(resAttr);
|
|
if (auto sliceAttr = dyn_cast<xegpu::SliceAttr>(resAttr)) {
|
|
sourceAttr = cast<xegpu::LayoutAttr>(sliceAttr.flatten().getParent());
|
|
}
|
|
assert(sourceAttr);
|
|
xegpu::DistributeLayoutAttr updatedLayoutAttr = xegpu::LayoutAttr::get(
|
|
load.getContext(), sourceAttr.getSgLayout(), sourceAttr.getSgData(),
|
|
DenseI32ArrayAttr::get(load.getContext(), instDataUarch),
|
|
sourceAttr.getLaneLayout(), sourceAttr.getLaneData(),
|
|
sourceAttr.getOrder());
|
|
|
|
if (auto sliceAttr = dyn_cast<xegpu::SliceAttr>(resAttr))
|
|
updatedLayoutAttr = xegpu::SliceAttr::get(
|
|
load.getContext(), updatedLayoutAttr, sliceAttr.getDims());
|
|
valueLayout = LayoutInfo(updatedLayoutAttr);
|
|
}
|
|
}
|
|
loadLayout = valueLayout;
|
|
load.setLayoutAttr(dyn_cast<xegpu::DistributeLayoutAttr>(loadLayout.get()));
|
|
}
|
|
|
|
// If no user-defined anchor or we deal with a chunked op, set the default
|
|
// mask layout.
|
|
// Rank 1 data : Keep the mask layout aligned with data.
|
|
// Rank >1 data: Enforce the default xegpu 1D layout for mask.
|
|
if (!hasParamsOfLayoutKind(anchorLayout) ||
|
|
load.getValueType().getRank() > 1) {
|
|
if (layoutKind == LayoutKind::InstData)
|
|
maskLayout = LayoutInfo(
|
|
xegpu::LayoutAttr::get(load->getContext(), {subgroupSize}));
|
|
else if (layoutKind == LayoutKind::Lane)
|
|
maskLayout =
|
|
getDefaultSIMTLayoutInfo(load->getContext(), 1, subgroupSize);
|
|
}
|
|
|
|
// Propagate the new layout to the tensor descriptor operand.
|
|
if (isa<xegpu::TensorDescType>(load.getSourceType()))
|
|
propagateIfChanged(operands[0], operands[0]->meet(loadLayout));
|
|
// Propagate the new layout to the mask and optional offset operand.
|
|
propagateIfChanged(operands[1], operands[1]->meet(maskLayout));
|
|
if (load.getOffsets())
|
|
propagateIfChanged(operands[2], operands[2]->meet(maskLayout));
|
|
}
|
|
|
|
/// Propagate the layout of the descriptor to the vector offset operand in
|
|
/// CreateDescOp.
|
|
void LayoutInfoPropagation::visitCreateDescOp(
|
|
xegpu::CreateDescOp createDesc, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
LayoutInfo descLayout = results[0]->getValue();
|
|
// Need the layout of the descriptor to propagate to the operands.
|
|
if (!descLayout.isAssigned())
|
|
return;
|
|
auto uArch = getUArch(getChipStr(createDesc).value_or(""));
|
|
// For offset operand propagate 1D default layout.
|
|
LayoutInfo layout = getDefaultSIMTLayoutInfo(createDesc->getContext(), 1,
|
|
uArch->getSubgroupSize());
|
|
propagateIfChanged(operands[1], operands[1]->meet(layout));
|
|
}
|
|
|
|
/// Set the layout for the value, tensor descriptor, offset and mask operands in
|
|
/// the StoreScatterOp.
|
|
void LayoutInfoPropagation::visitStoreScatterOp(
|
|
xegpu::StoreScatterOp storeScatter, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
|
|
LayoutInfo payloadLayout;
|
|
LayoutInfo maskLayout;
|
|
xegpu::DistributeLayoutAttr anchorLayout = storeScatter.getLayoutAttr();
|
|
auto uArch = getUArch(getChipStr(storeScatter).value_or(""));
|
|
const int subgroupSize = uArch->getSubgroupSize();
|
|
|
|
if (hasParamsOfLayoutKind(anchorLayout)) {
|
|
payloadLayout = LayoutInfo(anchorLayout);
|
|
maskLayout = payloadLayout;
|
|
} else {
|
|
// Currently, for 2D StoreScatterOp we expect that the height dimension of
|
|
// the tensor descriptor is equal to the subgroup size. This is ensured by
|
|
// the op verifier.
|
|
VectorType payloadTy = storeScatter.getValueType();
|
|
if (!payloadTy) {
|
|
storeScatter.emitWarning("Not propagating, non-vector payload supplied.");
|
|
return;
|
|
}
|
|
|
|
if (layoutKind == LayoutKind::InstData) {
|
|
const auto *uArchInstruction =
|
|
dyn_cast<xegpu::uArch::StoreScatterInstruction>(uArch->getInstruction(
|
|
xegpu::uArch::InstructionKind::StoreScatter));
|
|
const int subgroupSize = uArch->getSubgroupSize();
|
|
SmallVector<int> instDataUarch{subgroupSize};
|
|
if (payloadTy.getRank() != 1) {
|
|
if (payloadTy.getRank() != 2) {
|
|
storeScatter.emitWarning("Expected 2D payload for StoreScatterOp.");
|
|
return;
|
|
}
|
|
instDataUarch.push_back(
|
|
(std::min(static_cast<int>(payloadTy.getShape().back()),
|
|
uArchInstruction->getMaxLaneLoadStoreSize())));
|
|
}
|
|
payloadLayout = LayoutInfo(
|
|
xegpu::LayoutAttr::get(storeScatter.getContext(), instDataUarch));
|
|
} else {
|
|
auto payloadShape = payloadTy.getShape();
|
|
if (payloadShape.size() > 1)
|
|
assert(payloadShape[0] == subgroupSize &&
|
|
"Expected the first dimension of 2D tensor descriptor to be "
|
|
"equal to "
|
|
"subgroup size.");
|
|
payloadLayout = getSIMTLayoutInfoScatterIO(payloadTy, uArch);
|
|
}
|
|
|
|
storeScatter.setLayoutAttr(
|
|
dyn_cast<xegpu::DistributeLayoutAttr>(payloadLayout.get()));
|
|
}
|
|
|
|
// If no user-defined anchor or we deal with a chunked op, set the default
|
|
// mask layout.
|
|
// Rank 1 data : Keep the mask layout aligned with data.
|
|
// Rank >1 data: Enforce the default xegpu 1D layout for mask.
|
|
if (!hasParamsOfLayoutKind(anchorLayout) ||
|
|
storeScatter.getValueType().getRank() > 1) {
|
|
if (layoutKind == LayoutKind::InstData)
|
|
maskLayout = LayoutInfo(
|
|
xegpu::LayoutAttr::get(storeScatter->getContext(), {subgroupSize}));
|
|
else if (layoutKind == LayoutKind::Lane)
|
|
maskLayout =
|
|
getDefaultSIMTLayoutInfo(storeScatter->getContext(), 1, subgroupSize);
|
|
}
|
|
|
|
// Propagate the payload operand layout
|
|
propagateIfChanged(operands[0], operands[0]->meet(payloadLayout));
|
|
// Propagate the destination (if tdesc) operand layout
|
|
if (isa<xegpu::TensorDescType>(storeScatter.getDestType()))
|
|
propagateIfChanged(operands[1], operands[1]->meet(payloadLayout));
|
|
// Propagate the new layout to the mask and optional offset operand.
|
|
propagateIfChanged(operands[2], operands[2]->meet(maskLayout));
|
|
if (storeScatter.getOffsets())
|
|
propagateIfChanged(operands[3], operands[3]->meet(maskLayout));
|
|
}
|
|
|
|
// Store matrix is a flavor of scattered store for 2D shapes.
|
|
void LayoutInfoPropagation::visitStoreMatrixOp(
|
|
xegpu::StoreMatrixOp storeMatrix, ArrayRef<LayoutInfoLattice *> operands,
|
|
ArrayRef<const LayoutInfoLattice *> results) {
|
|
Value operand = storeMatrix.getData();
|
|
unsigned index =
|
|
std::distance(storeMatrix.operand_begin(),
|
|
llvm::find(storeMatrix->getOperands(), operand));
|
|
|
|
xegpu::DistributeLayoutAttr anchorLayout = storeMatrix.getLayoutAttr();
|
|
LayoutInfo layout;
|
|
if (hasParamsOfLayoutKind(anchorLayout)) {
|
|
layout = LayoutInfo(anchorLayout);
|
|
} else {
|
|
VectorType payloadTy = llvm::cast<VectorType>(operand.getType());
|
|
assert(payloadTy.getRank() == 2 && "Expecting 2D vector for store matrix.");
|
|
auto uArch = getUArch(getChipStr(storeMatrix).value_or(""));
|
|
SmallVector<int> instData = {1, uArch->getSubgroupSize()};
|
|
if (layoutKind == LayoutKind::InstData)
|
|
layout = LayoutInfo(
|
|
xegpu::LayoutAttr::get(storeMatrix.getContext(), instData));
|
|
else
|
|
layout = getSIMTLayoutInfoScatterIO(payloadTy, uArch);
|
|
}
|
|
|
|
propagateIfChanged(operands[index], operands[index]->meet(layout));
|
|
}
|
|
|
|
namespace {
|
|
//===----------------------------------------------------------------------===//
|
|
// RunLayoutInfoPropagation
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// Driver class for running the LayoutInfoPropagation analysis.
|
|
class RunLayoutInfoPropagation {
|
|
public:
|
|
MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(RunLayoutInfoPropagation)
|
|
|
|
RunLayoutInfoPropagation(Operation *op, LayoutKind layoutKind) : target(op) {
|
|
SymbolTableCollection symbolTable;
|
|
loadBaselineAnalyses(solver);
|
|
solver.load<LayoutInfoPropagation>(symbolTable, layoutKind);
|
|
(void)solver.initializeAndRun(op);
|
|
}
|
|
|
|
LayoutInfo getLayoutInfo(Value val);
|
|
|
|
void printAnalysisResult(llvm::raw_ostream &os);
|
|
|
|
private:
|
|
DataFlowSolver solver;
|
|
const Operation *target;
|
|
};
|
|
} // namespace
|
|
|
|
LayoutInfo RunLayoutInfoPropagation::getLayoutInfo(Value val) {
|
|
auto *state = solver.lookupState<LayoutInfoLattice>(val);
|
|
if (!state)
|
|
return {};
|
|
return state->getValue();
|
|
}
|
|
|
|
// Print the analysis result for debugging purposes.
|
|
void RunLayoutInfoPropagation::printAnalysisResult(llvm::raw_ostream &os) {
|
|
auto printFunctionResult = [&](FunctionOpInterface funcOp) {
|
|
os << "function: " << funcOp.getName() << ":\n";
|
|
// Function arguments
|
|
for (BlockArgument arg : funcOp.getArguments()) {
|
|
LayoutInfo layout = getLayoutInfo(arg);
|
|
os << "argument: " << arg << "\n";
|
|
os << "layout : ";
|
|
layout.print(os);
|
|
os << "\n";
|
|
}
|
|
// Function ops
|
|
funcOp.walk([&](Operation *op) {
|
|
// Skip ops that do not have results
|
|
if (op->getResults().empty())
|
|
return;
|
|
os << "op : ";
|
|
// For control-flow ops, print the op name only.
|
|
if (isa<BranchOpInterface>(op) || isa<RegionBranchOpInterface>(op))
|
|
os << op->getName();
|
|
else
|
|
op->print(os);
|
|
os << "\n";
|
|
// Print the layout for each result.
|
|
for (auto [i, r] : llvm::enumerate(op->getResults())) {
|
|
LayoutInfo layout = getLayoutInfo(r);
|
|
os << "layout for result #" << i << ": ";
|
|
layout.print(os);
|
|
os << "\n";
|
|
}
|
|
});
|
|
};
|
|
|
|
SmallVector<FunctionOpInterface> funcOps;
|
|
if (auto modOp = dyn_cast<ModuleOp>(target)) {
|
|
for (auto funcOp : modOp.getOps<FunctionOpInterface>())
|
|
funcOps.push_back(funcOp);
|
|
|
|
// Collect all GpuFuncOps in the module.
|
|
for (auto gpuModOp : modOp.getOps<gpu::GPUModuleOp>()) {
|
|
for (auto gpuFuncOp : gpuModOp.getOps<FunctionOpInterface>())
|
|
funcOps.push_back(gpuFuncOp);
|
|
}
|
|
}
|
|
// Print the analysis result for each function.
|
|
for (FunctionOpInterface funcOp : funcOps)
|
|
printFunctionResult(funcOp);
|
|
}
|
|
|
|
using GetLayoutFnTy = function_ref<xegpu::DistributeLayoutAttr(Value)>;
|
|
/// Update an operation with the layout of its results. If the result type is
|
|
/// a vector type, a temporary layout attribute is added to the operation. If
|
|
/// the result type is a tensor descriptor type, the type is updated with the
|
|
/// layout attribute. The users of the result are also updated with the layout
|
|
/// attribute.
|
|
static LogicalResult updateOp(mlir::OpBuilder &builder, mlir::Operation *op,
|
|
GetLayoutFnTy getLayoutOfValue) {
|
|
// Region ops (like scf.for) are already handled by the
|
|
// updateControlFlowOps.
|
|
if (mlir::isa<mlir::RegionBranchOpInterface>(op))
|
|
return success();
|
|
|
|
// Iterate over all the results.
|
|
for (OpResult result : op->getResults()) {
|
|
Type resultType = result.getType();
|
|
// Layouts are needed only for vector and tensor descriptor types.
|
|
if (!isa<VectorType, xegpu::TensorDescType>(resultType))
|
|
continue;
|
|
// If the result has no layout but has users, emit a warning and continue.
|
|
xegpu::DistributeLayoutAttr layout = getLayoutOfValue(result);
|
|
if (!layout && result.getNumUses() > 0) {
|
|
op->emitWarning("op has users but no layout assigned for its result");
|
|
continue;
|
|
}
|
|
// If the result is a tensor descriptor type, update the tensor desc type
|
|
// with layout.
|
|
if (auto tensorDescTy = dyn_cast<xegpu::TensorDescType>(resultType)) {
|
|
auto typeWithLayout = xegpu::TensorDescType::get(
|
|
tensorDescTy.getContext(), tensorDescTy.getShape(),
|
|
tensorDescTy.getElementType(), tensorDescTy.getEncoding(), layout);
|
|
result.setType(typeWithLayout);
|
|
continue;
|
|
}
|
|
// If the result is a vector type, add a temporary layout attribute to the
|
|
// op.
|
|
xegpu::setDistributeLayoutAttr(result, layout);
|
|
}
|
|
return success();
|
|
}
|
|
|
|
/// Region ops like scf.for need special handling because they have blocks
|
|
/// inside. If the blocks have tensor descriptor type as block arguments,
|
|
/// thier types must be updated. Also region op can have results that may not
|
|
/// have any users (e.g. A and B tiles). They are not assigned a layout by
|
|
/// layout analysis because they have no users. However inside the region op
|
|
/// corresponding block arguments for these results do have layouts.
|
|
/// Therefore, in this case we still need to update the result types with the
|
|
/// layout attribute. This function function updates the internal block
|
|
/// arguments and the result types of the region op with the assigned layouts.
|
|
/// clang-format off
|
|
/// Example: scf.for ... iter_args(...) -> (out types) {
|
|
/// ^bb0(block types):
|
|
/// ...
|
|
/// scf.yield ... : (yield types)
|
|
/// }
|
|
/// clang-format on
|
|
/// In this example, at scf.yield, control-flow can transfer to two successor
|
|
/// regions. One is the ^bb0 (for loop body) and the other is the scf.for op
|
|
/// itself (yield the results). So we update both the block arguments of the
|
|
/// successor region (i.e. block types) and the result types of the scf.for op
|
|
/// (i.e. out types). Note that yield types are updated by respective
|
|
/// producers inside bb0.
|
|
static LogicalResult
|
|
updateControlFlowOps(mlir::OpBuilder &builder,
|
|
mlir::RegionBranchTerminatorOpInterface terminator,
|
|
GetLayoutFnTy getLayoutOfValue) {
|
|
// Only process if the terminator is inside a region branch op.
|
|
auto branchOp = dyn_cast<RegionBranchOpInterface>(terminator->getParentOp());
|
|
if (!branchOp)
|
|
return success();
|
|
|
|
RegionBranchSuccessorMapping mapping;
|
|
branchOp.getSuccessorOperandInputMapping(mapping,
|
|
RegionBranchPoint(terminator));
|
|
for (const auto &[successorOperand, successorInputs] : mapping) {
|
|
for (Value successorInput : successorInputs) {
|
|
Type inputType = successorInput.getType();
|
|
// We only need to operate on tensor descriptor or vector types.
|
|
if (!isa<xegpu::TensorDescType, VectorType>(inputType))
|
|
continue;
|
|
xegpu::DistributeLayoutAttr successorInputLayout =
|
|
getLayoutOfValue(successorInput);
|
|
xegpu::DistributeLayoutAttr successorOperandLayout =
|
|
getLayoutOfValue(successorOperand->get());
|
|
|
|
// If either of the layouts is not assigned, we cannot proceed.
|
|
if (!successorOperandLayout) {
|
|
LLVM_DEBUG(DBGS() << "No layout assigned for forwarded operand in "
|
|
"branch terminator: "
|
|
<< successorOperand->get() << "\n");
|
|
return failure();
|
|
}
|
|
// We expect the layouts to match.
|
|
if (successorInputLayout &&
|
|
successorInputLayout != successorOperandLayout) {
|
|
LLVM_DEBUG(DBGS() << "Conflicting layouts for region argument and "
|
|
"operand forwarded as the argument: "
|
|
<< successorInputLayout << " vs "
|
|
<< successorOperandLayout << "\n");
|
|
return failure();
|
|
}
|
|
// Get tensor descriptor type with the layout.
|
|
if (auto tdescTy = dyn_cast<xegpu::TensorDescType>(inputType)) {
|
|
auto newTdescTy = xegpu::TensorDescType::get(
|
|
tdescTy.getContext(), tdescTy.getShape(), tdescTy.getElementType(),
|
|
tdescTy.getEncoding(), successorOperandLayout);
|
|
successorInput.setType(newTdescTy);
|
|
continue;
|
|
}
|
|
// If the type is a vector type and this region argument is an OpResult,
|
|
// set the layout attribute on the OpResult.
|
|
if (auto result = dyn_cast<OpResult>(successorInput))
|
|
xegpu::setDistributeLayoutAttr(result, successorOperandLayout);
|
|
}
|
|
}
|
|
return success();
|
|
}
|
|
|
|
/// Update the function arguments and results with the layouts.
|
|
static LogicalResult updateFunctionOpInterface(mlir::OpBuilder &builder,
|
|
mlir::FunctionOpInterface funcOp,
|
|
GetLayoutFnTy getLayoutOfValue) {
|
|
SmallVector<Type> newArgTypes;
|
|
// Update the function arguments.
|
|
for (BlockArgument arg : funcOp.getArguments()) {
|
|
Type argType = arg.getType();
|
|
newArgTypes.push_back(argType);
|
|
if (!isa<VectorType, xegpu::TensorDescType>(argType))
|
|
continue;
|
|
xegpu::DistributeLayoutAttr layout = getLayoutOfValue(arg);
|
|
if (!layout) {
|
|
LLVM_DEBUG(DBGS() << "Expecting layout for function argument: " << arg
|
|
<< " but got none.\n");
|
|
return failure();
|
|
}
|
|
if (auto tensorDescTy = dyn_cast<xegpu::TensorDescType>(argType)) {
|
|
auto newTdescTy = xegpu::TensorDescType::get(
|
|
tensorDescTy.getContext(), tensorDescTy.getShape(),
|
|
tensorDescTy.getElementType(), tensorDescTy.getEncoding(), layout);
|
|
arg.setType(newTdescTy);
|
|
newArgTypes.back() = newTdescTy;
|
|
}
|
|
}
|
|
// Update the function type with the new argument types.
|
|
// NOTE: We assume that function results are not expected to have layouts.
|
|
funcOp.setType(FunctionType::get(funcOp.getContext(), newArgTypes,
|
|
funcOp.getResultTypes()));
|
|
return success();
|
|
}
|
|
|
|
namespace {
|
|
struct XeGPUPropagateLayoutPass final
|
|
: public xegpu::impl::XeGPUPropagateLayoutBase<XeGPUPropagateLayoutPass> {
|
|
XeGPUPropagateLayoutPass() = default;
|
|
XeGPUPropagateLayoutPass(const XeGPUPropagateLayoutPass &other) = default;
|
|
XeGPUPropagateLayoutPass(xegpu::XeGPUPropagateLayoutOptions options)
|
|
: XeGPUPropagateLayoutBase(options) {}
|
|
void runOnOperation() override;
|
|
};
|
|
|
|
} // namespace
|
|
|
|
void XeGPUPropagateLayoutPass::runOnOperation() {
|
|
LayoutKind layoutKind;
|
|
if (this->layoutKind == "lane") {
|
|
layoutKind = LayoutKind::Lane;
|
|
} else if (this->layoutKind == "inst") {
|
|
layoutKind = LayoutKind::InstData;
|
|
} else if (this->layoutKind == "subgroup") {
|
|
layoutKind = LayoutKind::Subgroup;
|
|
} else {
|
|
getOperation()->emitError("Unsupported layout kind option: " +
|
|
this->layoutKind);
|
|
signalPassFailure();
|
|
return;
|
|
}
|
|
RunLayoutInfoPropagation analysis(getOperation(), layoutKind);
|
|
// Print the analysis result and exit. (for debugging purposes)
|
|
if (printOnly) {
|
|
auto &os = llvm::outs();
|
|
analysis.printAnalysisResult(os);
|
|
return;
|
|
}
|
|
// Helper to convert LayoutInfo to xegpu::LayoutAttr.
|
|
auto getXeGPULayoutForValue = [&](Value val) -> xegpu::DistributeLayoutAttr {
|
|
LayoutInfo layout = analysis.getLayoutInfo(val);
|
|
if (!layout.isAssigned())
|
|
return {};
|
|
xegpu::DistributeLayoutAttr layoutAttr =
|
|
cast<xegpu::DistributeLayoutAttr>(layout.get());
|
|
if (layout.isSliceLayout())
|
|
return cast<xegpu::SliceAttr>(layoutAttr);
|
|
return cast<xegpu::LayoutAttr>(layoutAttr);
|
|
};
|
|
|
|
mlir::OpBuilder builder(&getContext());
|
|
Operation *op = getOperation();
|
|
auto walkResult = op->walk([&](mlir::Block *block) -> WalkResult {
|
|
for (mlir::Operation &op : llvm::reverse(block->getOperations())) {
|
|
LogicalResult r = success();
|
|
TypeSwitch<Operation *>(&op)
|
|
.Case([&](mlir::RegionBranchTerminatorOpInterface branchTermOp) {
|
|
r = updateControlFlowOps(builder, branchTermOp,
|
|
getXeGPULayoutForValue);
|
|
})
|
|
.Case([&](mlir::FunctionOpInterface funcOp) {
|
|
r = updateFunctionOpInterface(builder, funcOp,
|
|
getXeGPULayoutForValue);
|
|
})
|
|
.Default([&](Operation *op) {
|
|
r = updateOp(builder, op, getXeGPULayoutForValue);
|
|
});
|
|
if (failed(r)) {
|
|
op.emitError("Failed to update operation with the layout.");
|
|
return WalkResult::interrupt();
|
|
}
|
|
}
|
|
return WalkResult::advance();
|
|
});
|
|
if (walkResult.wasInterrupted()) {
|
|
signalPassFailure();
|
|
return;
|
|
}
|
|
}
|