72 lines
2.7 KiB
C++
72 lines
2.7 KiB
C++
//===- lib/CodeGen/GlobalISel/LegalizerMutations.cpp - Mutations ----------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// A library of mutation factories to use for LegalityMutation.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/CodeGen/GlobalISel/LegalizerInfo.h"
|
|
|
|
using namespace llvm;
|
|
|
|
LegalizeMutation LegalizeMutations::changeTo(unsigned TypeIdx, LLT Ty) {
|
|
return
|
|
[=](const LegalityQuery &Query) { return std::make_pair(TypeIdx, Ty); };
|
|
}
|
|
|
|
LegalizeMutation LegalizeMutations::changeTo(unsigned TypeIdx,
|
|
unsigned FromTypeIdx) {
|
|
return [=](const LegalityQuery &Query) {
|
|
return std::make_pair(TypeIdx, Query.Types[FromTypeIdx]);
|
|
};
|
|
}
|
|
|
|
LegalizeMutation LegalizeMutations::changeElementTo(unsigned TypeIdx,
|
|
unsigned FromTypeIdx) {
|
|
return [=](const LegalityQuery &Query) {
|
|
const LLT OldTy = Query.Types[TypeIdx];
|
|
const LLT NewTy = Query.Types[FromTypeIdx];
|
|
return std::make_pair(TypeIdx, OldTy.changeElementType(NewTy));
|
|
};
|
|
}
|
|
|
|
LegalizeMutation LegalizeMutations::changeElementTo(unsigned TypeIdx,
|
|
LLT NewEltTy) {
|
|
return [=](const LegalityQuery &Query) {
|
|
const LLT OldTy = Query.Types[TypeIdx];
|
|
return std::make_pair(TypeIdx, OldTy.changeElementType(NewEltTy));
|
|
};
|
|
}
|
|
|
|
LegalizeMutation LegalizeMutations::widenScalarOrEltToNextPow2(unsigned TypeIdx,
|
|
unsigned Min) {
|
|
return [=](const LegalityQuery &Query) {
|
|
const LLT Ty = Query.Types[TypeIdx];
|
|
unsigned NewEltSizeInBits =
|
|
std::max(1u << Log2_32_Ceil(Ty.getScalarSizeInBits()), Min);
|
|
return std::make_pair(TypeIdx, Ty.changeElementSize(NewEltSizeInBits));
|
|
};
|
|
}
|
|
|
|
LegalizeMutation LegalizeMutations::moreElementsToNextPow2(unsigned TypeIdx,
|
|
unsigned Min) {
|
|
return [=](const LegalityQuery &Query) {
|
|
const LLT VecTy = Query.Types[TypeIdx];
|
|
unsigned NewNumElements =
|
|
std::max(1u << Log2_32_Ceil(VecTy.getNumElements()), Min);
|
|
return std::make_pair(TypeIdx,
|
|
LLT::vector(NewNumElements, VecTy.getElementType()));
|
|
};
|
|
}
|
|
|
|
LegalizeMutation LegalizeMutations::scalarize(unsigned TypeIdx) {
|
|
return [=](const LegalityQuery &Query) {
|
|
return std::make_pair(TypeIdx, Query.Types[TypeIdx].getElementType());
|
|
};
|
|
}
|