1 //===-- llvm/CodeGen/MachineModuleInfo.cpp ----------------------*- C++ -*-===// 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/CodeGen/MachineModuleInfo.h" 10 #include "llvm/ADT/ArrayRef.h" 11 #include "llvm/ADT/DenseMap.h" 12 #include "llvm/ADT/PostOrderIterator.h" 13 #include "llvm/ADT/StringRef.h" 14 #include "llvm/ADT/TinyPtrVector.h" 15 #include "llvm/CodeGen/MachineFunction.h" 16 #include "llvm/CodeGen/Passes.h" 17 #include "llvm/IR/BasicBlock.h" 18 #include "llvm/IR/DerivedTypes.h" 19 #include "llvm/IR/Instructions.h" 20 #include "llvm/IR/Module.h" 21 #include "llvm/IR/Value.h" 22 #include "llvm/IR/ValueHandle.h" 23 #include "llvm/InitializePasses.h" 24 #include "llvm/MC/MCContext.h" 25 #include "llvm/MC/MCSymbol.h" 26 #include "llvm/MC/MCSymbolXCOFF.h" 27 #include "llvm/Pass.h" 28 #include "llvm/Support/Casting.h" 29 #include "llvm/Support/ErrorHandling.h" 30 #include "llvm/Target/TargetLoweringObjectFile.h" 31 #include "llvm/Target/TargetMachine.h" 32 #include <algorithm> 33 #include <cassert> 34 #include <memory> 35 #include <utility> 36 #include <vector> 37 38 using namespace llvm; 39 using namespace llvm::dwarf; 40 41 // Out of line virtual method. 42 MachineModuleInfoImpl::~MachineModuleInfoImpl() = default; 43 44 namespace llvm { 45 46 class MMIAddrLabelMapCallbackPtr final : CallbackVH { 47 MMIAddrLabelMap *Map = nullptr; 48 49 public: 50 MMIAddrLabelMapCallbackPtr() = default; 51 MMIAddrLabelMapCallbackPtr(Value *V) : CallbackVH(V) {} 52 53 void setPtr(BasicBlock *BB) { 54 ValueHandleBase::operator=(BB); 55 } 56 57 void setMap(MMIAddrLabelMap *map) { Map = map; } 58 59 void deleted() override; 60 void allUsesReplacedWith(Value *V2) override; 61 }; 62 63 class MMIAddrLabelMap { 64 MCContext &Context; 65 struct AddrLabelSymEntry { 66 /// The symbols for the label. 67 TinyPtrVector<MCSymbol *> Symbols; 68 69 Function *Fn; // The containing function of the BasicBlock. 70 unsigned Index; // The index in BBCallbacks for the BasicBlock. 71 }; 72 73 DenseMap<AssertingVH<BasicBlock>, AddrLabelSymEntry> AddrLabelSymbols; 74 75 /// Callbacks for the BasicBlock's that we have entries for. We use this so 76 /// we get notified if a block is deleted or RAUWd. 77 std::vector<MMIAddrLabelMapCallbackPtr> BBCallbacks; 78 79 public: 80 MMIAddrLabelMap(MCContext &context) : Context(context) {} 81 82 ArrayRef<MCSymbol *> getAddrLabelSymbolToEmit(BasicBlock *BB); 83 84 void UpdateForDeletedBlock(BasicBlock *BB); 85 void UpdateForRAUWBlock(BasicBlock *Old, BasicBlock *New); 86 }; 87 88 } // end namespace llvm 89 90 ArrayRef<MCSymbol *> MMIAddrLabelMap::getAddrLabelSymbolToEmit(BasicBlock *BB) { 91 assert(BB->hasAddressTaken() && 92 "Shouldn't get label for block without address taken"); 93 AddrLabelSymEntry &Entry = AddrLabelSymbols[BB]; 94 95 // If we already had an entry for this block, just return it. 96 if (!Entry.Symbols.empty()) { 97 assert(BB->getParent() == Entry.Fn && "Parent changed"); 98 return Entry.Symbols; 99 } 100 101 // Otherwise, this is a new entry, create a new symbol for it and add an 102 // entry to BBCallbacks so we can be notified if the BB is deleted or RAUWd. 103 BBCallbacks.emplace_back(BB); 104 BBCallbacks.back().setMap(this); 105 Entry.Index = BBCallbacks.size() - 1; 106 Entry.Fn = BB->getParent(); 107 MCSymbol *Sym = Context.createTempSymbol(!BB->hasAddressTaken()); 108 Entry.Symbols.push_back(Sym); 109 return Entry.Symbols; 110 } 111 112 void MMIAddrLabelMap::UpdateForDeletedBlock(BasicBlock *BB) { 113 // If the block got deleted, there is no need for the symbol. If the symbol 114 // was already emitted, we can just forget about it, otherwise we need to 115 // queue it up for later emission when the function is output. 116 AddrLabelSymEntry Entry = std::move(AddrLabelSymbols[BB]); 117 AddrLabelSymbols.erase(BB); 118 assert(!Entry.Symbols.empty() && "Didn't have a symbol, why a callback?"); 119 BBCallbacks[Entry.Index] = nullptr; // Clear the callback. 120 121 assert((BB->getParent() == nullptr || BB->getParent() == Entry.Fn) && 122 "Block/parent mismatch"); 123 124 assert(llvm::all_of(Entry.Symbols, [](MCSymbol *Sym) { 125 return Sym->isDefined(); })); 126 } 127 128 void MMIAddrLabelMap::UpdateForRAUWBlock(BasicBlock *Old, BasicBlock *New) { 129 // Get the entry for the RAUW'd block and remove it from our map. 130 AddrLabelSymEntry OldEntry = std::move(AddrLabelSymbols[Old]); 131 AddrLabelSymbols.erase(Old); 132 assert(!OldEntry.Symbols.empty() && "Didn't have a symbol, why a callback?"); 133 134 AddrLabelSymEntry &NewEntry = AddrLabelSymbols[New]; 135 136 // If New is not address taken, just move our symbol over to it. 137 if (NewEntry.Symbols.empty()) { 138 BBCallbacks[OldEntry.Index].setPtr(New); // Update the callback. 139 NewEntry = std::move(OldEntry); // Set New's entry. 140 return; 141 } 142 143 BBCallbacks[OldEntry.Index] = nullptr; // Update the callback. 144 145 // Otherwise, we need to add the old symbols to the new block's set. 146 NewEntry.Symbols.insert(NewEntry.Symbols.end(), OldEntry.Symbols.begin(), 147 OldEntry.Symbols.end()); 148 } 149 150 void MMIAddrLabelMapCallbackPtr::deleted() { 151 Map->UpdateForDeletedBlock(cast<BasicBlock>(getValPtr())); 152 } 153 154 void MMIAddrLabelMapCallbackPtr::allUsesReplacedWith(Value *V2) { 155 Map->UpdateForRAUWBlock(cast<BasicBlock>(getValPtr()), cast<BasicBlock>(V2)); 156 } 157 158 void MachineModuleInfo::initialize() { 159 ObjFileMMI = nullptr; 160 CurCallSite = 0; 161 UsesMSVCFloatingPoint = UsesMorestackAddr = false; 162 HasSplitStack = HasNosplitStack = false; 163 AddrLabelSymbols = nullptr; 164 } 165 166 void MachineModuleInfo::finalize() { 167 Personalities.clear(); 168 169 delete AddrLabelSymbols; 170 AddrLabelSymbols = nullptr; 171 172 Context.reset(); 173 174 delete ObjFileMMI; 175 ObjFileMMI = nullptr; 176 } 177 178 MachineModuleInfo::MachineModuleInfo(MachineModuleInfo &&MMI) 179 : TM(std::move(MMI.TM)), 180 Context(MMI.TM.getMCAsmInfo(), MMI.TM.getMCRegisterInfo(), 181 MMI.TM.getObjFileLowering(), nullptr, nullptr, false), 182 MachineFunctions(std::move(MMI.MachineFunctions)) { 183 ObjFileMMI = MMI.ObjFileMMI; 184 CurCallSite = MMI.CurCallSite; 185 UsesMSVCFloatingPoint = MMI.UsesMSVCFloatingPoint; 186 UsesMorestackAddr = MMI.UsesMorestackAddr; 187 HasSplitStack = MMI.HasSplitStack; 188 HasNosplitStack = MMI.HasNosplitStack; 189 AddrLabelSymbols = MMI.AddrLabelSymbols; 190 TheModule = MMI.TheModule; 191 } 192 193 MachineModuleInfo::MachineModuleInfo(const LLVMTargetMachine *TM) 194 : TM(*TM), Context(TM->getMCAsmInfo(), TM->getMCRegisterInfo(), 195 TM->getObjFileLowering(), nullptr, nullptr, false) { 196 initialize(); 197 } 198 199 MachineModuleInfo::~MachineModuleInfo() { finalize(); } 200 201 //===- Address of Block Management ----------------------------------------===// 202 203 ArrayRef<MCSymbol *> 204 MachineModuleInfo::getAddrLabelSymbolToEmit(const BasicBlock *BB) { 205 // Lazily create AddrLabelSymbols. 206 if (!AddrLabelSymbols) 207 AddrLabelSymbols = new MMIAddrLabelMap(Context); 208 return AddrLabelSymbols->getAddrLabelSymbolToEmit(const_cast<BasicBlock*>(BB)); 209 } 210 211 /// \name Exception Handling 212 /// \{ 213 214 void MachineModuleInfo::addPersonality(const Function *Personality) { 215 for (unsigned i = 0; i < Personalities.size(); ++i) 216 if (Personalities[i] == Personality) 217 return; 218 Personalities.push_back(Personality); 219 } 220 221 /// \} 222 223 MachineFunction * 224 MachineModuleInfo::getMachineFunction(const Function &F) const { 225 auto I = MachineFunctions.find(&F); 226 return I != MachineFunctions.end() ? I->second.get() : nullptr; 227 } 228 229 MachineFunction &MachineModuleInfo::getOrCreateMachineFunction(Function &F) { 230 // Shortcut for the common case where a sequence of MachineFunctionPasses 231 // all query for the same Function. 232 if (LastRequest == &F) 233 return *LastResult; 234 235 auto I = MachineFunctions.insert( 236 std::make_pair(&F, std::unique_ptr<MachineFunction>())); 237 MachineFunction *MF; 238 if (I.second) { 239 // No pre-existing machine function, create a new one. 240 const TargetSubtargetInfo &STI = *TM.getSubtargetImpl(F); 241 MF = new MachineFunction(F, TM, STI, NextFnNum++, *this); 242 // Update the set entry. 243 I.first->second.reset(MF); 244 } else { 245 MF = I.first->second.get(); 246 } 247 248 LastRequest = &F; 249 LastResult = MF; 250 return *MF; 251 } 252 253 void MachineModuleInfo::deleteMachineFunctionFor(Function &F) { 254 MachineFunctions.erase(&F); 255 LastRequest = nullptr; 256 LastResult = nullptr; 257 } 258 259 namespace { 260 261 /// This pass frees the MachineFunction object associated with a Function. 262 class FreeMachineFunction : public FunctionPass { 263 public: 264 static char ID; 265 266 FreeMachineFunction() : FunctionPass(ID) {} 267 268 void getAnalysisUsage(AnalysisUsage &AU) const override { 269 AU.addRequired<MachineModuleInfoWrapperPass>(); 270 AU.addPreserved<MachineModuleInfoWrapperPass>(); 271 } 272 273 bool runOnFunction(Function &F) override { 274 MachineModuleInfo &MMI = 275 getAnalysis<MachineModuleInfoWrapperPass>().getMMI(); 276 MMI.deleteMachineFunctionFor(F); 277 return true; 278 } 279 280 StringRef getPassName() const override { 281 return "Free MachineFunction"; 282 } 283 }; 284 285 } // end anonymous namespace 286 287 char FreeMachineFunction::ID; 288 289 FunctionPass *llvm::createFreeMachineFunctionPass() { 290 return new FreeMachineFunction(); 291 } 292 293 MachineModuleInfoWrapperPass::MachineModuleInfoWrapperPass( 294 const LLVMTargetMachine *TM) 295 : ImmutablePass(ID), MMI(TM) { 296 initializeMachineModuleInfoWrapperPassPass(*PassRegistry::getPassRegistry()); 297 } 298 299 // Handle the Pass registration stuff necessary to use DataLayout's. 300 INITIALIZE_PASS(MachineModuleInfoWrapperPass, "machinemoduleinfo", 301 "Machine Module Information", false, false) 302 char MachineModuleInfoWrapperPass::ID = 0; 303 304 bool MachineModuleInfoWrapperPass::doInitialization(Module &M) { 305 MMI.initialize(); 306 MMI.TheModule = &M; 307 MMI.DbgInfoAvailable = !M.debug_compile_units().empty(); 308 return false; 309 } 310 311 bool MachineModuleInfoWrapperPass::doFinalization(Module &M) { 312 MMI.finalize(); 313 return false; 314 } 315 316 AnalysisKey MachineModuleAnalysis::Key; 317 318 MachineModuleInfo MachineModuleAnalysis::run(Module &M, 319 ModuleAnalysisManager &) { 320 MachineModuleInfo MMI(TM); 321 MMI.TheModule = &M; 322 MMI.DbgInfoAvailable = !M.debug_compile_units().empty(); 323 return MMI; 324 } 325