|
| 1 | +//===- JumpTableToSwitch.cpp ----------------------------------------------===// |
| 2 | +// |
| 3 | +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 4 | +// See https://llvm.org/LICENSE.txt for license information. |
| 5 | +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| 6 | +// |
| 7 | +//===----------------------------------------------------------------------===// |
| 8 | + |
| 9 | +#include "llvm/Transforms/Scalar/JumpTableToSwitch.h" |
| 10 | +#include "llvm/ADT/DenseMap.h" |
| 11 | +#include "llvm/ADT/SmallSet.h" |
| 12 | +#include "llvm/Analysis/ConstantFolding.h" |
| 13 | +#include "llvm/Analysis/DomTreeUpdater.h" |
| 14 | +#include "llvm/Analysis/OptimizationRemarkEmitter.h" |
| 15 | +#include "llvm/Analysis/PostDominators.h" |
| 16 | +#include "llvm/Analysis/TargetLibraryInfo.h" |
| 17 | +#include "llvm/Analysis/TargetTransformInfo.h" |
| 18 | +#include "llvm/Analysis/ValueTracking.h" |
| 19 | +#include "llvm/IR/IRBuilder.h" |
| 20 | +#include "llvm/IR/IntrinsicInst.h" |
| 21 | +#include "llvm/Support/CommandLine.h" |
| 22 | +#include "llvm/Support/Debug.h" |
| 23 | +#include "llvm/Transforms/Utils/BasicBlockUtils.h" |
| 24 | +#include "llvm/Transforms/Utils/Cloning.h" |
| 25 | +#include "llvm/Transforms/Utils/Local.h" |
| 26 | + |
| 27 | +using namespace llvm; |
| 28 | +using namespace PatternMatch; |
| 29 | + |
| 30 | +// TODO: Consider adding a cost model for profitability analysis of this |
| 31 | +// transformation. Currently we replace a jump table with a switch if all the |
| 32 | +// functions in the jump table are smaller than the provided threshold. |
| 33 | +static cl::opt<unsigned> |
| 34 | + JumpTableSizeThreshold("jump-table-to-switch-size-threshold", cl::Hidden, |
| 35 | + cl::desc("Only split jump tables with size less or " |
| 36 | + "equal than JumpTableSizeThreshold."), |
| 37 | + cl::init(10)); |
| 38 | + |
| 39 | +static cl::opt<unsigned> FunctionSizeThreshold( |
| 40 | + "jump-table-to-switch-function-size-threshold", cl::Hidden, |
| 41 | + cl::desc("Only split jump tables containing functions whose sizes are less " |
| 42 | + "or equal than this threshold."), |
| 43 | + cl::init(50)); |
| 44 | + |
| 45 | +#define DEBUG_TYPE "jump-table-to-switch" |
| 46 | + |
| 47 | +namespace { |
| 48 | +struct JumpTableTy { |
| 49 | + Value *Index; |
| 50 | + SmallVector<Function *, 10> Funcs; |
| 51 | +}; |
| 52 | +} // anonymous namespace |
| 53 | + |
| 54 | +static std::optional<JumpTableTy> parseJumpTable(GetElementPtrInst *GEP, |
| 55 | + PointerType *PtrTy) { |
| 56 | + Constant *Ptr = dyn_cast<Constant>(GEP->getPointerOperand()); |
| 57 | + if (!Ptr) |
| 58 | + return std::nullopt; |
| 59 | + |
| 60 | + GlobalVariable *GV = dyn_cast<GlobalVariable>(Ptr); |
| 61 | + if (!GV || !GV->isConstant() || !GV->hasDefinitiveInitializer()) |
| 62 | + return std::nullopt; |
| 63 | + |
| 64 | + Function &F = *GEP->getParent()->getParent(); |
| 65 | + const DataLayout &DL = F.getParent()->getDataLayout(); |
| 66 | + const unsigned BitWidth = |
| 67 | + DL.getIndexSizeInBits(GEP->getPointerAddressSpace()); |
| 68 | + MapVector<Value *, APInt> VariableOffsets; |
| 69 | + APInt ConstantOffset(BitWidth, 0); |
| 70 | + if (!GEP->collectOffset(DL, BitWidth, VariableOffsets, ConstantOffset)) |
| 71 | + return std::nullopt; |
| 72 | + if (VariableOffsets.size() != 1) |
| 73 | + return std::nullopt; |
| 74 | + // TODO: consider supporting more general patterns |
| 75 | + if (!ConstantOffset.isZero()) |
| 76 | + return std::nullopt; |
| 77 | + const uint64_t StrideBytes = VariableOffsets.front().second.getZExtValue(); |
| 78 | + const uint64_t JumpTableSizeBytes = DL.getTypeAllocSize(GV->getValueType()); |
| 79 | + if (JumpTableSizeBytes % StrideBytes != 0) |
| 80 | + return std::nullopt; |
| 81 | + const uint64_t N = JumpTableSizeBytes / StrideBytes; |
| 82 | + if (N > JumpTableSizeThreshold) |
| 83 | + return std::nullopt; |
| 84 | + |
| 85 | + JumpTableTy JumpTable; |
| 86 | + JumpTable.Index = VariableOffsets.front().first; |
| 87 | + JumpTable.Funcs.assign(N, nullptr); |
| 88 | + const unsigned PtrSizeBits = DL.getPointerTypeSizeInBits(PtrTy); |
| 89 | + for (uint64_t Index = 0; Index < N; ++Index) { |
| 90 | + APInt Offset(PtrSizeBits, Index * StrideBytes); |
| 91 | + Offset += ConstantOffset; |
| 92 | + Constant *C = ConstantFoldLoadFromConst( |
| 93 | + cast<Constant>(GV->getInitializer()), PtrTy, Offset, DL); |
| 94 | + auto *Func = dyn_cast_or_null<Function>(C); |
| 95 | + if (!Func || Func->isDeclaration() || |
| 96 | + Func->getInstructionCount() > FunctionSizeThreshold) |
| 97 | + return std::nullopt; |
| 98 | + JumpTable.Funcs[Index] = Func; |
| 99 | + } |
| 100 | + return JumpTable; |
| 101 | +} |
| 102 | + |
| 103 | +static BasicBlock *expandToSwitch(CallBase *CB, const JumpTableTy &JT, |
| 104 | + DomTreeUpdater &DTU, |
| 105 | + OptimizationRemarkEmitter &ORE) { |
| 106 | + const bool IsVoid = CB->getType() == Type::getVoidTy(CB->getContext()); |
| 107 | + |
| 108 | + SmallVector<DominatorTree::UpdateType, 8> DTUpdates; |
| 109 | + BasicBlock *BB = CB->getParent(); |
| 110 | + BasicBlock *Tail = SplitBlock(BB, CB, &DTU, nullptr, nullptr, |
| 111 | + BB->getName() + Twine(".tail")); |
| 112 | + DTUpdates.push_back({DominatorTree::Delete, BB, Tail}); |
| 113 | + BB->getTerminator()->eraseFromParent(); |
| 114 | + |
| 115 | + Function &F = *BB->getParent(); |
| 116 | + BasicBlock *BBUnreachable = BasicBlock::Create( |
| 117 | + F.getContext(), "default.switch.case.unreachable", &F, Tail); |
| 118 | + IRBuilder<> BuilderUnreachable(BBUnreachable); |
| 119 | + BuilderUnreachable.CreateUnreachable(); |
| 120 | + |
| 121 | + IRBuilder<> Builder(BB); |
| 122 | + SwitchInst *Switch = Builder.CreateSwitch(JT.Index, BBUnreachable); |
| 123 | + DTUpdates.push_back({DominatorTree::Insert, BB, BBUnreachable}); |
| 124 | + |
| 125 | + IRBuilder<> BuilderTail(CB); |
| 126 | + PHINode *PHI = |
| 127 | + IsVoid ? nullptr : BuilderTail.CreatePHI(CB->getType(), JT.Funcs.size()); |
| 128 | + |
| 129 | + for (auto [Index, Func] : llvm::enumerate(JT.Funcs)) { |
| 130 | + BasicBlock *B = BasicBlock::Create(Func->getContext(), |
| 131 | + "call." + Twine(Index), &F, Tail); |
| 132 | + DTUpdates.push_back({DominatorTree::Insert, BB, B}); |
| 133 | + DTUpdates.push_back({DominatorTree::Insert, B, Tail}); |
| 134 | + |
| 135 | + CallBase *Call = cast<CallBase>(CB->clone()); |
| 136 | + Call->setCalledFunction(Func); |
| 137 | + Call->insertInto(B, B->end()); |
| 138 | + Switch->addCase( |
| 139 | + cast<ConstantInt>(ConstantInt::get(JT.Index->getType(), Index)), B); |
| 140 | + BranchInst::Create(Tail, B); |
| 141 | + if (PHI) |
| 142 | + PHI->addIncoming(Call, B); |
| 143 | + } |
| 144 | + DTU.applyUpdates(DTUpdates); |
| 145 | + ORE.emit([&]() { |
| 146 | + return OptimizationRemark(DEBUG_TYPE, "ReplacedJumpTableWithSwitch", CB) |
| 147 | + << "expanded indirect call into switch"; |
| 148 | + }); |
| 149 | + if (PHI) |
| 150 | + CB->replaceAllUsesWith(PHI); |
| 151 | + CB->eraseFromParent(); |
| 152 | + return Tail; |
| 153 | +} |
| 154 | + |
| 155 | +PreservedAnalyses JumpTableToSwitchPass::run(Function &F, |
| 156 | + FunctionAnalysisManager &AM) { |
| 157 | + OptimizationRemarkEmitter &ORE = |
| 158 | + AM.getResult<OptimizationRemarkEmitterAnalysis>(F); |
| 159 | + DominatorTree *DT = AM.getCachedResult<DominatorTreeAnalysis>(F); |
| 160 | + PostDominatorTree *PDT = AM. getCachedResult<PostDominatorTreeAnalysis>(F); |
| 161 | + DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy); |
| 162 | + bool Changed = false; |
| 163 | + for (BasicBlock &BB : make_early_inc_range(F)) { |
| 164 | + BasicBlock *CurrentBB = &BB; |
| 165 | + while (CurrentBB) { |
| 166 | + BasicBlock *SplittedOutTail = nullptr; |
| 167 | + for (Instruction &I : make_early_inc_range(*CurrentBB)) { |
| 168 | + auto *Call = dyn_cast<CallInst>(&I); |
| 169 | + if (!Call || Call->getCalledFunction() || Call->isMustTailCall()) |
| 170 | + continue; |
| 171 | + auto *L = dyn_cast<LoadInst>(Call->getCalledOperand()); |
| 172 | + // Skip atomic or volatile loads. |
| 173 | + if (!L || !L->isSimple()) |
| 174 | + continue; |
| 175 | + auto *GEP = dyn_cast<GetElementPtrInst>(L->getPointerOperand()); |
| 176 | + if (!GEP) |
| 177 | + continue; |
| 178 | + auto *PtrTy = dyn_cast<PointerType>(L-> getType()); |
| 179 | + assert(PtrTy && "call operand must be a pointer"); |
| 180 | + std::optional<JumpTableTy> JumpTable = parseJumpTable(GEP, PtrTy); |
| 181 | + if (!JumpTable) |
| 182 | + continue; |
| 183 | + SplittedOutTail = expandToSwitch(Call, *JumpTable, DTU, ORE); |
| 184 | + Changed = true; |
| 185 | + break; |
| 186 | + } |
| 187 | + CurrentBB = SplittedOutTail ? SplittedOutTail : nullptr; |
| 188 | + } |
| 189 | + } |
| 190 | + |
| 191 | + if (!Changed) |
| 192 | + return PreservedAnalyses::all(); |
| 193 | + |
| 194 | + PreservedAnalyses PA; |
| 195 | + if (DT) |
| 196 | + PA.preserve<DominatorTreeAnalysis>(); |
| 197 | + if (PDT) |
| 198 | + PA. preserve<PostDominatorTreeAnalysis>(); |
| 199 | + return PA; |
| 200 | +} |
0 commit comments