1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-25 20:23:11 +01:00

Give helpers internal linkage. NFC.

This commit is contained in:
Benjamin Kramer 2020-03-10 18:24:04 +01:00
parent ac5dfb4241
commit 5193ea06e9
5 changed files with 12 additions and 11 deletions

View File

@ -21,23 +21,23 @@ char ReachingDefAnalysis::ID = 0;
INITIALIZE_PASS(ReachingDefAnalysis, DEBUG_TYPE, "ReachingDefAnalysis", false,
true)
bool isValidReg(const MachineOperand &MO) {
static bool isValidReg(const MachineOperand &MO) {
return MO.isReg() && MO.getReg();
}
bool isValidRegUse(const MachineOperand &MO) {
static bool isValidRegUse(const MachineOperand &MO) {
return isValidReg(MO) && MO.isUse();
}
bool isValidRegUseOf(const MachineOperand &MO, int PhysReg) {
static bool isValidRegUseOf(const MachineOperand &MO, int PhysReg) {
return isValidRegUse(MO) && MO.getReg() == PhysReg;
}
bool isValidRegDef(const MachineOperand &MO) {
static bool isValidRegDef(const MachineOperand &MO) {
return isValidReg(MO) && MO.isDef();
}
bool isValidRegDefOf(const MachineOperand &MO, int PhysReg) {
static bool isValidRegDefOf(const MachineOperand &MO, int PhysReg) {
return isValidRegDef(MO) && MO.getReg() == PhysReg;
}

View File

@ -441,7 +441,7 @@ const uint8_t MachO_x86_64_GOTAndStubsBuilder::StubContent[6] = {
0xFF, 0x25, 0x00, 0x00, 0x00, 0x00};
} // namespace
Error optimizeMachO_x86_64_GOTAndStubs(LinkGraph &G) {
static Error optimizeMachO_x86_64_GOTAndStubs(LinkGraph &G) {
LLVM_DEBUG(dbgs() << "Optimizing GOT entries and stubs:\n");
for (auto *B : G.blocks())

View File

@ -26,7 +26,7 @@ struct TypesAndMemOps {
// Assumes power of 2 memory size. Subtargets that have only naturally-aligned
// memory access need to perform additional legalization here.
bool isUnalignedMemmoryAccess(uint64_t MemSize, uint64_t AlignInBits) {
static bool isUnalignedMemmoryAccess(uint64_t MemSize, uint64_t AlignInBits) {
assert(isPowerOf2_64(MemSize) && "Expected power of 2 memory size");
assert(isPowerOf2_64(AlignInBits) && "Expected power of 2 align");
if (MemSize > AlignInBits)

View File

@ -71,6 +71,7 @@ static llvm::Optional<ExpandedMatch> matchExpandedRem(Instruction &I) {
return M;
}
namespace {
/// A thin wrapper to store two values that we matched as div-rem pair.
/// We want this extra indirection to avoid dealing with RAUW'ing the map keys.
struct DivRemPairWorklistEntry {
@ -111,6 +112,7 @@ struct DivRemPairWorklistEntry {
}
}
};
} // namespace
using DivRemWorklistTy = SmallVector<DivRemPairWorklistEntry, 4>;
/// Find matching pairs of integer div/rem ops (they have the same numerator,

View File

@ -3228,10 +3228,9 @@ bool BoUpSLP::areAllUsersVectorized(Instruction *I) const {
});
}
std::pair<unsigned, unsigned> getVectorCallCosts(CallInst *CI,
VectorType *VecTy,
TargetTransformInfo *TTI,
TargetLibraryInfo *TLI) {
static std::pair<unsigned, unsigned>
getVectorCallCosts(CallInst *CI, VectorType *VecTy, TargetTransformInfo *TTI,
TargetLibraryInfo *TLI) {
Intrinsic::ID ID = getVectorIntrinsicIDForCall(CI, TLI);
// Calculate the cost of the scalar and vector calls.