1//===- MachineFunction.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// Collect native machine code information for a function. This allows
10// target-specific information about the generated code to be stored with each
11// function.
12//
13//===----------------------------------------------------------------------===//
14
15#include "llvm/CodeGen/MachineFunction.h"
16#include "llvm/ADT/BitVector.h"
17#include "llvm/ADT/DenseMap.h"
18#include "llvm/ADT/DenseSet.h"
19#include "llvm/ADT/STLExtras.h"
20#include "llvm/ADT/SmallString.h"
21#include "llvm/ADT/SmallVector.h"
22#include "llvm/ADT/StringRef.h"
23#include "llvm/ADT/Twine.h"
24#include "llvm/Analysis/ConstantFolding.h"
25#include "llvm/Analysis/ProfileSummaryInfo.h"
26#include "llvm/CodeGen/MachineBasicBlock.h"
27#include "llvm/CodeGen/MachineConstantPool.h"
28#include "llvm/CodeGen/MachineFrameInfo.h"
29#include "llvm/CodeGen/MachineInstr.h"
30#include "llvm/CodeGen/MachineJumpTableInfo.h"
31#include "llvm/CodeGen/MachineMemOperand.h"
32#include "llvm/CodeGen/MachineModuleInfo.h"
33#include "llvm/CodeGen/MachineRegisterInfo.h"
34#include "llvm/CodeGen/PseudoSourceValue.h"
35#include "llvm/CodeGen/PseudoSourceValueManager.h"
36#include "llvm/CodeGen/TargetFrameLowering.h"
37#include "llvm/CodeGen/TargetInstrInfo.h"
38#include "llvm/CodeGen/TargetLowering.h"
39#include "llvm/CodeGen/TargetRegisterInfo.h"
40#include "llvm/CodeGen/TargetSubtargetInfo.h"
41#include "llvm/CodeGen/WasmEHFuncInfo.h"
42#include "llvm/CodeGen/WinEHFuncInfo.h"
43#include "llvm/Config/llvm-config.h"
44#include "llvm/IR/Attributes.h"
45#include "llvm/IR/BasicBlock.h"
46#include "llvm/IR/Constant.h"
47#include "llvm/IR/DataLayout.h"
48#include "llvm/IR/DerivedTypes.h"
49#include "llvm/IR/EHPersonalities.h"
50#include "llvm/IR/Function.h"
51#include "llvm/IR/GlobalValue.h"
52#include "llvm/IR/Instruction.h"
53#include "llvm/IR/Instructions.h"
54#include "llvm/IR/Metadata.h"
55#include "llvm/IR/Module.h"
56#include "llvm/IR/ModuleSlotTracker.h"
57#include "llvm/IR/Value.h"
58#include "llvm/MC/MCContext.h"
59#include "llvm/MC/MCSymbol.h"
60#include "llvm/MC/SectionKind.h"
61#include "llvm/Support/Casting.h"
62#include "llvm/Support/CommandLine.h"
63#include "llvm/Support/Compiler.h"
64#include "llvm/Support/DOTGraphTraits.h"
65#include "llvm/Support/ErrorHandling.h"
66#include "llvm/Support/GraphWriter.h"
67#include "llvm/Support/raw_ostream.h"
68#include "llvm/Target/TargetMachine.h"
69#include <algorithm>
70#include <cassert>
71#include <cstddef>
72#include <cstdint>
73#include <iterator>
74#include <string>
75#include <utility>
76#include <vector>
77
78#include "LiveDebugValues/LiveDebugValues.h"
79
80using namespace llvm;
81
82#define DEBUG_TYPE "codegen"
83
84static cl::opt<unsigned> AlignAllFunctions(
85 "align-all-functions",
86 cl::desc("Force the alignment of all functions in log2 format (e.g. 4 "
87 "means align on 16B boundaries)."),
88 cl::init(Val: 0), cl::Hidden);
89
90static const char *getPropertyName(MachineFunctionProperties::Property Prop) {
91 using P = MachineFunctionProperties::Property;
92
93 // clang-format off
94 switch(Prop) {
95 case P::FailedISel: return "FailedISel";
96 case P::IsSSA: return "IsSSA";
97 case P::Legalized: return "Legalized";
98 case P::NoPHIs: return "NoPHIs";
99 case P::NoVRegs: return "NoVRegs";
100 case P::RegBankSelected: return "RegBankSelected";
101 case P::Selected: return "Selected";
102 case P::TracksLiveness: return "TracksLiveness";
103 case P::TiedOpsRewritten: return "TiedOpsRewritten";
104 case P::FailsVerification: return "FailsVerification";
105 case P::FailedRegAlloc: return "FailedRegAlloc";
106 case P::TracksDebugUserValues: return "TracksDebugUserValues";
107 }
108 // clang-format on
109 llvm_unreachable("Invalid machine function property");
110}
111
112void setUnsafeStackSize(const Function &F, MachineFrameInfo &FrameInfo) {
113 if (!F.hasFnAttribute(Kind: Attribute::SafeStack))
114 return;
115
116 auto *Existing =
117 dyn_cast_or_null<MDTuple>(Val: F.getMetadata(KindID: LLVMContext::MD_annotation));
118
119 if (!Existing || Existing->getNumOperands() != 2)
120 return;
121
122 auto *MetadataName = "unsafe-stack-size";
123 if (auto &N = Existing->getOperand(I: 0)) {
124 if (N.equalsStr(Str: MetadataName)) {
125 if (auto &Op = Existing->getOperand(I: 1)) {
126 auto Val = mdconst::extract<ConstantInt>(MD: Op)->getZExtValue();
127 FrameInfo.setUnsafeStackSize(Val);
128 }
129 }
130 }
131}
132
133// Pin the vtable to this file.
134void MachineFunction::Delegate::anchor() {}
135
136void MachineFunctionProperties::print(raw_ostream &OS) const {
137 const char *Separator = "";
138 for (BitVector::size_type I = 0; I < Properties.size(); ++I) {
139 if (!Properties[I])
140 continue;
141 OS << Separator << getPropertyName(Prop: static_cast<Property>(I));
142 Separator = ", ";
143 }
144}
145
146//===----------------------------------------------------------------------===//
147// MachineFunction implementation
148//===----------------------------------------------------------------------===//
149
150// Out-of-line virtual method.
151MachineFunctionInfo::~MachineFunctionInfo() = default;
152
153void ilist_alloc_traits<MachineBasicBlock>::deleteNode(MachineBasicBlock *MBB) {
154 MBB->getParent()->deleteMachineBasicBlock(MBB);
155}
156
157static inline Align getFnStackAlignment(const TargetSubtargetInfo &STI,
158 const Function &F) {
159 if (auto MA = F.getFnStackAlign())
160 return *MA;
161 return STI.getFrameLowering()->getStackAlign();
162}
163
164MachineFunction::MachineFunction(Function &F, const TargetMachine &Target,
165 const TargetSubtargetInfo &STI, MCContext &Ctx,
166 unsigned FunctionNum)
167 : F(F), Target(Target), STI(STI), Ctx(Ctx) {
168 FunctionNumber = FunctionNum;
169 init();
170}
171
172void MachineFunction::handleInsertion(MachineInstr &MI) {
173 if (TheDelegate)
174 TheDelegate->MF_HandleInsertion(MI);
175}
176
177void MachineFunction::handleRemoval(MachineInstr &MI) {
178 if (TheDelegate)
179 TheDelegate->MF_HandleRemoval(MI);
180}
181
182void MachineFunction::handleChangeDesc(MachineInstr &MI,
183 const MCInstrDesc &TID) {
184 if (TheDelegate)
185 TheDelegate->MF_HandleChangeDesc(MI, TID);
186}
187
188void MachineFunction::init() {
189 // Assume the function starts in SSA form with correct liveness.
190 Properties.setIsSSA();
191 Properties.setTracksLiveness();
192 RegInfo = new (Allocator) MachineRegisterInfo(this);
193
194 MFInfo = nullptr;
195
196 // We can realign the stack if the target supports it and the user hasn't
197 // explicitly asked us not to.
198 bool CanRealignSP = STI.getFrameLowering()->isStackRealignable() &&
199 !F.hasFnAttribute(Kind: "no-realign-stack");
200 bool ForceRealignSP = F.hasFnAttribute(Kind: Attribute::StackAlignment) ||
201 F.hasFnAttribute(Kind: "stackrealign");
202 FrameInfo = new (Allocator) MachineFrameInfo(
203 getFnStackAlignment(STI, F), /*StackRealignable=*/CanRealignSP,
204 /*ForcedRealign=*/ForceRealignSP && CanRealignSP);
205
206 setUnsafeStackSize(F, FrameInfo&: *FrameInfo);
207
208 if (F.hasFnAttribute(Kind: Attribute::StackAlignment))
209 FrameInfo->ensureMaxAlignment(Alignment: *F.getFnStackAlign());
210
211 ConstantPool = new (Allocator) MachineConstantPool(getDataLayout());
212 Alignment = STI.getTargetLowering()->getMinFunctionAlignment();
213
214 // -fsanitize=function and -fsanitize=kcfi instrument indirect function calls
215 // to load a type hash before the function label. Ensure functions are aligned
216 // by a least 4 to avoid unaligned access, which is especially important for
217 // -mno-unaligned-access.
218 if (F.hasMetadata(KindID: LLVMContext::MD_func_sanitize) ||
219 F.getMetadata(KindID: LLVMContext::MD_kcfi_type))
220 Alignment = std::max(a: Alignment, b: Align(4));
221
222 if (AlignAllFunctions)
223 Alignment = Align(1ULL << AlignAllFunctions);
224
225 JumpTableInfo = nullptr;
226
227 if (isFuncletEHPersonality(Pers: classifyEHPersonality(
228 Pers: F.hasPersonalityFn() ? F.getPersonalityFn() : nullptr))) {
229 WinEHInfo = new (Allocator) WinEHFuncInfo();
230 }
231
232 if (isScopedEHPersonality(Pers: classifyEHPersonality(
233 Pers: F.hasPersonalityFn() ? F.getPersonalityFn() : nullptr))) {
234 WasmEHInfo = new (Allocator) WasmEHFuncInfo();
235 }
236
237 assert(Target.isCompatibleDataLayout(getDataLayout()) &&
238 "Can't create a MachineFunction using a Module with a "
239 "Target-incompatible DataLayout attached\n");
240
241 PSVManager = std::make_unique<PseudoSourceValueManager>(args: getTarget());
242}
243
244void MachineFunction::initTargetMachineFunctionInfo(
245 const TargetSubtargetInfo &STI) {
246 assert(!MFInfo && "MachineFunctionInfo already set");
247 MFInfo = Target.createMachineFunctionInfo(Allocator, F, STI: &STI);
248}
249
250MachineFunction::~MachineFunction() {
251 clear();
252}
253
254void MachineFunction::clear() {
255 Properties.reset();
256
257 // Clear JumpTableInfo first. Otherwise, every MBB we delete would do a
258 // linear search over the jump table entries to find and erase itself.
259 if (JumpTableInfo) {
260 JumpTableInfo->~MachineJumpTableInfo();
261 Allocator.Deallocate(Ptr: JumpTableInfo);
262 JumpTableInfo = nullptr;
263 }
264
265 // Don't call destructors on MachineInstr and MachineOperand. All of their
266 // memory comes from the BumpPtrAllocator which is about to be purged.
267 //
268 // Do call MachineBasicBlock destructors, it contains std::vectors.
269 for (iterator I = begin(), E = end(); I != E; I = BasicBlocks.erase(where: I))
270 I->Insts.clearAndLeakNodesUnsafely();
271 MBBNumbering.clear();
272
273 InstructionRecycler.clear(Allocator);
274 OperandRecycler.clear(Allocator);
275 BasicBlockRecycler.clear(Allocator);
276 CodeViewAnnotations.clear();
277 VariableDbgInfos.clear();
278 if (RegInfo) {
279 RegInfo->~MachineRegisterInfo();
280 Allocator.Deallocate(Ptr: RegInfo);
281 }
282 if (MFInfo) {
283 MFInfo->~MachineFunctionInfo();
284 Allocator.Deallocate(Ptr: MFInfo);
285 }
286
287 FrameInfo->~MachineFrameInfo();
288 Allocator.Deallocate(Ptr: FrameInfo);
289
290 ConstantPool->~MachineConstantPool();
291 Allocator.Deallocate(Ptr: ConstantPool);
292
293 if (WinEHInfo) {
294 WinEHInfo->~WinEHFuncInfo();
295 Allocator.Deallocate(Ptr: WinEHInfo);
296 }
297
298 if (WasmEHInfo) {
299 WasmEHInfo->~WasmEHFuncInfo();
300 Allocator.Deallocate(Ptr: WasmEHInfo);
301 }
302}
303
304const DataLayout &MachineFunction::getDataLayout() const {
305 return F.getDataLayout();
306}
307
308/// Get the JumpTableInfo for this function.
309/// If it does not already exist, allocate one.
310MachineJumpTableInfo *MachineFunction::
311getOrCreateJumpTableInfo(unsigned EntryKind) {
312 if (JumpTableInfo) return JumpTableInfo;
313
314 JumpTableInfo = new (Allocator)
315 MachineJumpTableInfo((MachineJumpTableInfo::JTEntryKind)EntryKind);
316 return JumpTableInfo;
317}
318
319DenormalMode MachineFunction::getDenormalMode(const fltSemantics &FPType) const {
320 return F.getDenormalMode(FPType);
321}
322
323/// Should we be emitting segmented stack stuff for the function
324bool MachineFunction::shouldSplitStack() const {
325 return getFunction().hasFnAttribute(Kind: "split-stack");
326}
327
328Align MachineFunction::getPreferredAlignment() const {
329 Align PrefAlignment;
330
331 if (MaybeAlign A = F.getPreferredAlignment())
332 PrefAlignment = *A;
333 else if (!F.hasOptSize())
334 PrefAlignment = STI.getTargetLowering()->getPrefFunctionAlignment();
335 else
336 PrefAlignment = Align(1);
337
338 return std::max(a: PrefAlignment, b: getAlignment());
339}
340
341[[nodiscard]] unsigned
342MachineFunction::addFrameInst(const MCCFIInstruction &Inst) {
343 FrameInstructions.push_back(x: Inst);
344 return FrameInstructions.size() - 1;
345}
346
347/// This discards all of the MachineBasicBlock numbers and recomputes them.
348/// This guarantees that the MBB numbers are sequential, dense, and match the
349/// ordering of the blocks within the function. If a specific MachineBasicBlock
350/// is specified, only that block and those after it are renumbered.
351void MachineFunction::RenumberBlocks(MachineBasicBlock *MBB) {
352 if (empty()) { MBBNumbering.clear(); return; }
353 MachineFunction::iterator MBBI, E = end();
354 if (MBB == nullptr)
355 MBBI = begin();
356 else
357 MBBI = MBB->getIterator();
358
359 // Figure out the block number this should have.
360 unsigned BlockNo = 0;
361 if (MBBI != begin())
362 BlockNo = std::prev(x: MBBI)->getNumber() + 1;
363
364 for (; MBBI != E; ++MBBI, ++BlockNo) {
365 if (MBBI->getNumber() != (int)BlockNo) {
366 // Remove use of the old number.
367 if (MBBI->getNumber() != -1) {
368 assert(MBBNumbering[MBBI->getNumber()] == &*MBBI &&
369 "MBB number mismatch!");
370 MBBNumbering[MBBI->getNumber()] = nullptr;
371 }
372
373 // If BlockNo is already taken, set that block's number to -1.
374 if (MBBNumbering[BlockNo])
375 MBBNumbering[BlockNo]->setNumber(-1);
376
377 MBBNumbering[BlockNo] = &*MBBI;
378 MBBI->setNumber(BlockNo);
379 }
380 }
381
382 // Okay, all the blocks are renumbered. If we have compactified the block
383 // numbering, shrink MBBNumbering now.
384 assert(BlockNo <= MBBNumbering.size() && "Mismatch!");
385 MBBNumbering.resize(new_size: BlockNo);
386 MBBNumberingEpoch++;
387}
388
389int64_t MachineFunction::estimateFunctionSizeInBytes() {
390 const TargetInstrInfo &TII = *getSubtarget().getInstrInfo();
391 const Align FunctionAlignment = getAlignment();
392 MachineFunction::iterator MBBI = begin(), E = end();
393 /// Offset - Distance from the beginning of the function to the end
394 /// of the basic block.
395 int64_t Offset = 0;
396
397 for (; MBBI != E; ++MBBI) {
398 const Align Alignment = MBBI->getAlignment();
399 int64_t BlockSize = 0;
400
401 for (auto &MI : *MBBI) {
402 BlockSize += TII.getInstSizeInBytes(MI);
403 }
404
405 int64_t OffsetBB;
406 if (Alignment <= FunctionAlignment) {
407 OffsetBB = alignTo(Size: Offset, A: Alignment);
408 } else {
409 // The alignment of this MBB is larger than the function's alignment, so
410 // we can't tell whether or not it will insert nops. Assume that it will.
411 OffsetBB = alignTo(Size: Offset, A: Alignment) + Alignment.value() -
412 FunctionAlignment.value();
413 }
414 Offset = OffsetBB + BlockSize;
415 }
416
417 return Offset;
418}
419
420/// This method iterates over the basic blocks and assigns their IsBeginSection
421/// and IsEndSection fields. This must be called after MBB layout is finalized
422/// and the SectionID's are assigned to MBBs.
423void MachineFunction::assignBeginEndSections() {
424 front().setIsBeginSection();
425 auto CurrentSectionID = front().getSectionID();
426 for (auto MBBI = std::next(x: begin()), E = end(); MBBI != E; ++MBBI) {
427 if (MBBI->getSectionID() == CurrentSectionID)
428 continue;
429 MBBI->setIsBeginSection();
430 std::prev(x: MBBI)->setIsEndSection();
431 CurrentSectionID = MBBI->getSectionID();
432 }
433 back().setIsEndSection();
434}
435
436/// Allocate a new MachineInstr. Use this instead of `new MachineInstr'.
437MachineInstr *MachineFunction::CreateMachineInstr(const MCInstrDesc &MCID,
438 DebugLoc DL,
439 bool NoImplicit) {
440 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
441 MachineInstr(*this, MCID, std::move(DL), NoImplicit);
442}
443
444/// Create a new MachineInstr which is a copy of the 'Orig' instruction,
445/// identical in all ways except the instruction has no parent, prev, or next.
446MachineInstr *
447MachineFunction::CloneMachineInstr(const MachineInstr *Orig) {
448 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
449 MachineInstr(*this, *Orig);
450}
451
452MachineInstr &MachineFunction::cloneMachineInstrBundle(
453 MachineBasicBlock &MBB, MachineBasicBlock::iterator InsertBefore,
454 const MachineInstr &Orig) {
455 MachineInstr *FirstClone = nullptr;
456 MachineBasicBlock::const_instr_iterator I = Orig.getIterator();
457 while (true) {
458 MachineInstr *Cloned = CloneMachineInstr(Orig: &*I);
459 MBB.insert(I: InsertBefore, MI: Cloned);
460 if (FirstClone == nullptr) {
461 FirstClone = Cloned;
462 } else {
463 Cloned->bundleWithPred();
464 }
465
466 if (!I->isBundledWithSucc())
467 break;
468 ++I;
469 }
470 // Copy over call info to the cloned instruction if needed. If Orig is in
471 // a bundle, copyAdditionalCallInfo takes care of finding the call instruction
472 // in the bundle.
473 if (Orig.shouldUpdateAdditionalCallInfo())
474 copyAdditionalCallInfo(Old: &Orig, New: FirstClone);
475 return *FirstClone;
476}
477
478/// Delete the given MachineInstr.
479///
480/// This function also serves as the MachineInstr destructor - the real
481/// ~MachineInstr() destructor must be empty.
482void MachineFunction::deleteMachineInstr(MachineInstr *MI) {
483 // Verify that a call site info is at valid state. This assertion should
484 // be triggered during the implementation of support for the
485 // call site info of a new architecture. If the assertion is triggered,
486 // back trace will tell where to insert a call to updateCallSiteInfo().
487 assert((!MI->isCandidateForAdditionalCallInfo() ||
488 !CallSitesInfo.contains(MI)) &&
489 "Call site info was not updated!");
490 // Verify that the "called globals" info is in a valid state.
491 assert((!MI->isCandidateForAdditionalCallInfo() ||
492 !CalledGlobalsInfo.contains(MI)) &&
493 "Called globals info was not updated!");
494 // Strip it for parts. The operand array and the MI object itself are
495 // independently recyclable.
496 if (MI->Operands)
497 deallocateOperandArray(Cap: MI->CapOperands, Array: MI->Operands);
498 // Don't call ~MachineInstr() which must be trivial anyway because
499 // ~MachineFunction drops whole lists of MachineInstrs wihout calling their
500 // destructors.
501 InstructionRecycler.Deallocate(Allocator, Element: MI);
502}
503
504/// Allocate a new MachineBasicBlock. Use this instead of
505/// `new MachineBasicBlock'.
506MachineBasicBlock *
507MachineFunction::CreateMachineBasicBlock(const BasicBlock *BB,
508 std::optional<UniqueBBID> BBID) {
509 MachineBasicBlock *MBB =
510 new (BasicBlockRecycler.Allocate<MachineBasicBlock>(Allocator))
511 MachineBasicBlock(*this, BB);
512 // Set BBID for `-basic-block-sections=list` and `-basic-block-address-map` to
513 // allow robust mapping of profiles to basic blocks.
514 if (Target.Options.BBAddrMap ||
515 Target.getBBSectionsType() == BasicBlockSection::List)
516 MBB->setBBID(BBID.has_value() ? *BBID : UniqueBBID{.BaseID: NextBBID++, .CloneID: 0});
517 return MBB;
518}
519
520/// Delete the given MachineBasicBlock.
521void MachineFunction::deleteMachineBasicBlock(MachineBasicBlock *MBB) {
522 assert(MBB->getParent() == this && "MBB parent mismatch!");
523 // Clean up any references to MBB in jump tables before deleting it.
524 if (JumpTableInfo)
525 JumpTableInfo->RemoveMBBFromJumpTables(MBB);
526 MBB->~MachineBasicBlock();
527 BasicBlockRecycler.Deallocate(Allocator, Element: MBB);
528}
529
530MachineMemOperand *MachineFunction::getMachineMemOperand(
531 MachinePointerInfo PtrInfo, MachineMemOperand::Flags F, LocationSize Size,
532 Align BaseAlignment, const AAMDNodes &AAInfo, const MDNode *Ranges,
533 SyncScope::ID SSID, AtomicOrdering Ordering,
534 AtomicOrdering FailureOrdering) {
535 assert((!Size.hasValue() ||
536 Size.getValue().getKnownMinValue() != ~UINT64_C(0)) &&
537 "Unexpected an unknown size to be represented using "
538 "LocationSize::beforeOrAfter()");
539 return new (Allocator)
540 MachineMemOperand(PtrInfo, F, Size, BaseAlignment, AAInfo, Ranges, SSID,
541 Ordering, FailureOrdering);
542}
543
544MachineMemOperand *MachineFunction::getMachineMemOperand(
545 MachinePointerInfo PtrInfo, MachineMemOperand::Flags f, LLT MemTy,
546 Align base_alignment, const AAMDNodes &AAInfo, const MDNode *Ranges,
547 SyncScope::ID SSID, AtomicOrdering Ordering,
548 AtomicOrdering FailureOrdering) {
549 return new (Allocator)
550 MachineMemOperand(PtrInfo, f, MemTy, base_alignment, AAInfo, Ranges, SSID,
551 Ordering, FailureOrdering);
552}
553
554MachineMemOperand *
555MachineFunction::getMachineMemOperand(const MachineMemOperand *MMO,
556 const MachinePointerInfo &PtrInfo,
557 LocationSize Size) {
558 assert((!Size.hasValue() ||
559 Size.getValue().getKnownMinValue() != ~UINT64_C(0)) &&
560 "Unexpected an unknown size to be represented using "
561 "LocationSize::beforeOrAfter()");
562 return new (Allocator)
563 MachineMemOperand(PtrInfo, MMO->getFlags(), Size, MMO->getBaseAlign(),
564 AAMDNodes(), nullptr, MMO->getSyncScopeID(),
565 MMO->getSuccessOrdering(), MMO->getFailureOrdering());
566}
567
568MachineMemOperand *MachineFunction::getMachineMemOperand(
569 const MachineMemOperand *MMO, const MachinePointerInfo &PtrInfo, LLT Ty) {
570 return new (Allocator)
571 MachineMemOperand(PtrInfo, MMO->getFlags(), Ty, MMO->getBaseAlign(),
572 AAMDNodes(), nullptr, MMO->getSyncScopeID(),
573 MMO->getSuccessOrdering(), MMO->getFailureOrdering());
574}
575
576MachineMemOperand *
577MachineFunction::getMachineMemOperand(const MachineMemOperand *MMO,
578 int64_t Offset, LLT Ty) {
579 const MachinePointerInfo &PtrInfo = MMO->getPointerInfo();
580
581 // If there is no pointer value, the offset isn't tracked so we need to adjust
582 // the base alignment.
583 Align Alignment = PtrInfo.V.isNull()
584 ? commonAlignment(A: MMO->getBaseAlign(), Offset)
585 : MMO->getBaseAlign();
586
587 // Do not preserve ranges, since we don't necessarily know what the high bits
588 // are anymore.
589 return new (Allocator) MachineMemOperand(
590 PtrInfo.getWithOffset(O: Offset), MMO->getFlags(), Ty, Alignment,
591 MMO->getAAInfo(), nullptr, MMO->getSyncScopeID(),
592 MMO->getSuccessOrdering(), MMO->getFailureOrdering());
593}
594
595MachineMemOperand *
596MachineFunction::getMachineMemOperand(const MachineMemOperand *MMO,
597 const AAMDNodes &AAInfo) {
598 MachinePointerInfo MPI = MMO->getValue() ?
599 MachinePointerInfo(MMO->getValue(), MMO->getOffset()) :
600 MachinePointerInfo(MMO->getPseudoValue(), MMO->getOffset());
601
602 return new (Allocator) MachineMemOperand(
603 MPI, MMO->getFlags(), MMO->getSize(), MMO->getBaseAlign(), AAInfo,
604 MMO->getRanges(), MMO->getSyncScopeID(), MMO->getSuccessOrdering(),
605 MMO->getFailureOrdering());
606}
607
608MachineMemOperand *
609MachineFunction::getMachineMemOperand(const MachineMemOperand *MMO,
610 MachineMemOperand::Flags Flags) {
611 return new (Allocator) MachineMemOperand(
612 MMO->getPointerInfo(), Flags, MMO->getSize(), MMO->getBaseAlign(),
613 MMO->getAAInfo(), MMO->getRanges(), MMO->getSyncScopeID(),
614 MMO->getSuccessOrdering(), MMO->getFailureOrdering());
615}
616
617MachineInstr::ExtraInfo *MachineFunction::createMIExtraInfo(
618 ArrayRef<MachineMemOperand *> MMOs, MCSymbol *PreInstrSymbol,
619 MCSymbol *PostInstrSymbol, MDNode *HeapAllocMarker, MDNode *PCSections,
620 uint32_t CFIType, MDNode *MMRAs, Value *DS) {
621 return MachineInstr::ExtraInfo::create(Allocator, MMOs, PreInstrSymbol,
622 PostInstrSymbol, HeapAllocMarker,
623 PCSections, CFIType, MMRAs, DS);
624}
625
626const char *MachineFunction::createExternalSymbolName(StringRef Name) {
627 char *Dest = Allocator.Allocate<char>(Num: Name.size() + 1);
628 llvm::copy(Range&: Name, Out: Dest);
629 Dest[Name.size()] = 0;
630 return Dest;
631}
632
633uint32_t *MachineFunction::allocateRegMask() {
634 unsigned NumRegs = getSubtarget().getRegisterInfo()->getNumRegs();
635 unsigned Size = MachineOperand::getRegMaskSize(NumRegs);
636 uint32_t *Mask = Allocator.Allocate<uint32_t>(Num: Size);
637 memset(s: Mask, c: 0, n: Size * sizeof(Mask[0]));
638 return Mask;
639}
640
641ArrayRef<int> MachineFunction::allocateShuffleMask(ArrayRef<int> Mask) {
642 int* AllocMask = Allocator.Allocate<int>(Num: Mask.size());
643 copy(Range&: Mask, Out: AllocMask);
644 return {AllocMask, Mask.size()};
645}
646
647#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
648LLVM_DUMP_METHOD void MachineFunction::dump() const {
649 print(dbgs());
650}
651#endif
652
653StringRef MachineFunction::getName() const {
654 return getFunction().getName();
655}
656
657void MachineFunction::print(raw_ostream &OS, const SlotIndexes *Indexes) const {
658 OS << "# Machine code for function " << getName() << ": ";
659 getProperties().print(OS);
660 OS << '\n';
661
662 // Print Frame Information
663 FrameInfo->print(MF: *this, OS);
664
665 // Print JumpTable Information
666 if (JumpTableInfo)
667 JumpTableInfo->print(OS);
668
669 // Print Constant Pool
670 ConstantPool->print(OS);
671
672 const TargetRegisterInfo *TRI = getSubtarget().getRegisterInfo();
673
674 if (RegInfo && !RegInfo->livein_empty()) {
675 OS << "Function Live Ins: ";
676 for (MachineRegisterInfo::livein_iterator
677 I = RegInfo->livein_begin(), E = RegInfo->livein_end(); I != E; ++I) {
678 OS << printReg(Reg: I->first, TRI);
679 if (I->second)
680 OS << " in " << printReg(Reg: I->second, TRI);
681 if (std::next(x: I) != E)
682 OS << ", ";
683 }
684 OS << '\n';
685 }
686
687 ModuleSlotTracker MST(getFunction().getParent());
688 MST.incorporateFunction(F: getFunction());
689 for (const auto &BB : *this) {
690 OS << '\n';
691 // If we print the whole function, print it at its most verbose level.
692 BB.print(OS, MST, Indexes, /*IsStandalone=*/true);
693 }
694
695 OS << "\n# End machine code for function " << getName() << ".\n\n";
696}
697
698/// True if this function needs frame moves for debug or exceptions.
699bool MachineFunction::needsFrameMoves() const {
700 // TODO: Ideally, what we'd like is to have a switch that allows emitting
701 // synchronous (precise at call-sites only) CFA into .eh_frame. However, even
702 // under this switch, we'd like .debug_frame to be precise when using -g. At
703 // this moment, there's no way to specify that some CFI directives go into
704 // .eh_frame only, while others go into .debug_frame only.
705 return getTarget().Options.ForceDwarfFrameSection ||
706 F.needsUnwindTableEntry() ||
707 !F.getParent()->debug_compile_units().empty();
708}
709
710MachineFunction::CallSiteInfo::CallSiteInfo(const CallBase &CB) {
711 // Numeric callee_type ids are only for indirect calls.
712 if (!CB.isIndirectCall())
713 return;
714
715 MDNode *CalleeTypeList = CB.getMetadata(KindID: LLVMContext::MD_callee_type);
716 if (!CalleeTypeList)
717 return;
718
719 for (const MDOperand &Op : CalleeTypeList->operands()) {
720 MDNode *TypeMD = cast<MDNode>(Val: Op);
721 MDString *TypeIdStr = cast<MDString>(Val: TypeMD->getOperand(I: 1));
722 // Compute numeric type id from generalized type id string
723 uint64_t TypeIdVal = MD5Hash(Str: TypeIdStr->getString());
724 IntegerType *Int64Ty = Type::getInt64Ty(C&: CB.getContext());
725 CalleeTypeIds.push_back(
726 Elt: ConstantInt::get(Ty: Int64Ty, V: TypeIdVal, /*IsSigned=*/false));
727 }
728}
729
730template <>
731struct llvm::DOTGraphTraits<const MachineFunction *>
732 : public DefaultDOTGraphTraits {
733 DOTGraphTraits(bool isSimple = false) : DefaultDOTGraphTraits(isSimple) {}
734
735 static std::string getGraphName(const MachineFunction *F) {
736 return ("CFG for '" + F->getName() + "' function").str();
737 }
738
739 std::string getNodeLabel(const MachineBasicBlock *Node,
740 const MachineFunction *Graph) {
741 std::string OutStr;
742 {
743 raw_string_ostream OSS(OutStr);
744
745 if (isSimple()) {
746 OSS << printMBBReference(MBB: *Node);
747 if (const BasicBlock *BB = Node->getBasicBlock())
748 OSS << ": " << BB->getName();
749 } else
750 Node->print(OS&: OSS);
751 }
752
753 if (OutStr[0] == '\n')
754 OutStr.erase(position: OutStr.begin());
755
756 // Process string output to make it nicer...
757 for (unsigned i = 0; i != OutStr.length(); ++i)
758 if (OutStr[i] == '\n') { // Left justify
759 OutStr[i] = '\\';
760 OutStr.insert(p: OutStr.begin() + i + 1, c: 'l');
761 }
762 return OutStr;
763 }
764};
765
766void MachineFunction::viewCFG() const
767{
768#ifndef NDEBUG
769 ViewGraph(this, "mf" + getName());
770#else
771 errs() << "MachineFunction::viewCFG is only available in debug builds on "
772 << "systems with Graphviz or gv!\n";
773#endif // NDEBUG
774}
775
776void MachineFunction::viewCFGOnly() const
777{
778#ifndef NDEBUG
779 ViewGraph(this, "mf" + getName(), true);
780#else
781 errs() << "MachineFunction::viewCFGOnly is only available in debug builds on "
782 << "systems with Graphviz or gv!\n";
783#endif // NDEBUG
784}
785
786/// Add the specified physical register as a live-in value and
787/// create a corresponding virtual register for it.
788Register MachineFunction::addLiveIn(MCRegister PReg,
789 const TargetRegisterClass *RC) {
790 MachineRegisterInfo &MRI = getRegInfo();
791 Register VReg = MRI.getLiveInVirtReg(PReg);
792 if (VReg) {
793 const TargetRegisterClass *VRegRC = MRI.getRegClass(Reg: VReg);
794 (void)VRegRC;
795 // A physical register can be added several times.
796 // Between two calls, the register class of the related virtual register
797 // may have been constrained to match some operation constraints.
798 // In that case, check that the current register class includes the
799 // physical register and is a sub class of the specified RC.
800 assert((VRegRC == RC || (VRegRC->contains(PReg) &&
801 RC->hasSubClassEq(VRegRC))) &&
802 "Register class mismatch!");
803 return VReg;
804 }
805 VReg = MRI.createVirtualRegister(RegClass: RC);
806 MRI.addLiveIn(Reg: PReg, vreg: VReg);
807 return VReg;
808}
809
810/// Return the MCSymbol for the specified non-empty jump table.
811/// If isLinkerPrivate is specified, an 'l' label is returned, otherwise a
812/// normal 'L' label is returned.
813MCSymbol *MachineFunction::getJTISymbol(unsigned JTI, MCContext &Ctx,
814 bool isLinkerPrivate) const {
815 const DataLayout &DL = getDataLayout();
816 assert(JumpTableInfo && "No jump tables");
817 assert(JTI < JumpTableInfo->getJumpTables().size() && "Invalid JTI!");
818
819 StringRef Prefix = isLinkerPrivate ? DL.getLinkerPrivateGlobalPrefix()
820 : DL.getPrivateGlobalPrefix();
821 SmallString<60> Name;
822 raw_svector_ostream(Name)
823 << Prefix << "JTI" << getFunctionNumber() << '_' << JTI;
824 return Ctx.getOrCreateSymbol(Name);
825}
826
827/// Return a function-local symbol to represent the PIC base.
828MCSymbol *MachineFunction::getPICBaseSymbol() const {
829 const DataLayout &DL = getDataLayout();
830 return Ctx.getOrCreateSymbol(Name: Twine(DL.getPrivateGlobalPrefix()) +
831 Twine(getFunctionNumber()) + "$pb");
832}
833
834/// \name Exception Handling
835/// \{
836
837LandingPadInfo &
838MachineFunction::getOrCreateLandingPadInfo(MachineBasicBlock *LandingPad) {
839 unsigned N = LandingPads.size();
840 for (unsigned i = 0; i < N; ++i) {
841 LandingPadInfo &LP = LandingPads[i];
842 if (LP.LandingPadBlock == LandingPad)
843 return LP;
844 }
845
846 LandingPads.push_back(x: LandingPadInfo(LandingPad));
847 return LandingPads[N];
848}
849
850void MachineFunction::addInvoke(MachineBasicBlock *LandingPad,
851 MCSymbol *BeginLabel, MCSymbol *EndLabel) {
852 LandingPadInfo &LP = getOrCreateLandingPadInfo(LandingPad);
853 LP.BeginLabels.push_back(Elt: BeginLabel);
854 LP.EndLabels.push_back(Elt: EndLabel);
855}
856
857MCSymbol *MachineFunction::addLandingPad(MachineBasicBlock *LandingPad) {
858 MCSymbol *LandingPadLabel = Ctx.createTempSymbol();
859 LandingPadInfo &LP = getOrCreateLandingPadInfo(LandingPad);
860 LP.LandingPadLabel = LandingPadLabel;
861
862 BasicBlock::const_iterator FirstI =
863 LandingPad->getBasicBlock()->getFirstNonPHIIt();
864 if (const auto *LPI = dyn_cast<LandingPadInst>(Val&: FirstI)) {
865 // If there's no typeid list specified, then "cleanup" is implicit.
866 // Otherwise, id 0 is reserved for the cleanup action.
867 if (LPI->isCleanup() && LPI->getNumClauses() != 0)
868 LP.TypeIds.push_back(x: 0);
869
870 // FIXME: New EH - Add the clauses in reverse order. This isn't 100%
871 // correct, but we need to do it this way because of how the DWARF EH
872 // emitter processes the clauses.
873 for (unsigned I = LPI->getNumClauses(); I != 0; --I) {
874 Value *Val = LPI->getClause(Idx: I - 1);
875 if (LPI->isCatch(Idx: I - 1)) {
876 LP.TypeIds.push_back(
877 x: getTypeIDFor(TI: dyn_cast<GlobalValue>(Val: Val->stripPointerCasts())));
878 } else {
879 // Add filters in a list.
880 auto *CVal = cast<Constant>(Val);
881 SmallVector<unsigned, 4> FilterList;
882 for (const Use &U : CVal->operands())
883 FilterList.push_back(
884 Elt: getTypeIDFor(TI: cast<GlobalValue>(Val: U->stripPointerCasts())));
885
886 LP.TypeIds.push_back(x: getFilterIDFor(TyIds: FilterList));
887 }
888 }
889
890 } else if (const auto *CPI = dyn_cast<CatchPadInst>(Val&: FirstI)) {
891 for (unsigned I = CPI->arg_size(); I != 0; --I) {
892 auto *TypeInfo =
893 dyn_cast<GlobalValue>(Val: CPI->getArgOperand(i: I - 1)->stripPointerCasts());
894 LP.TypeIds.push_back(x: getTypeIDFor(TI: TypeInfo));
895 }
896
897 } else {
898 assert(isa<CleanupPadInst>(FirstI) && "Invalid landingpad!");
899 }
900
901 return LandingPadLabel;
902}
903
904void MachineFunction::setCallSiteLandingPad(MCSymbol *Sym,
905 ArrayRef<unsigned> Sites) {
906 LPadToCallSiteMap[Sym].append(in_start: Sites.begin(), in_end: Sites.end());
907}
908
909unsigned MachineFunction::getTypeIDFor(const GlobalValue *TI) {
910 for (unsigned i = 0, N = TypeInfos.size(); i != N; ++i)
911 if (TypeInfos[i] == TI) return i + 1;
912
913 TypeInfos.push_back(x: TI);
914 return TypeInfos.size();
915}
916
917int MachineFunction::getFilterIDFor(ArrayRef<unsigned> TyIds) {
918 // If the new filter coincides with the tail of an existing filter, then
919 // re-use the existing filter. Folding filters more than this requires
920 // re-ordering filters and/or their elements - probably not worth it.
921 for (unsigned i : FilterEnds) {
922 unsigned j = TyIds.size();
923
924 while (i && j)
925 if (FilterIds[--i] != TyIds[--j])
926 goto try_next;
927
928 if (!j)
929 // The new filter coincides with range [i, end) of the existing filter.
930 return -(1 + i);
931
932try_next:;
933 }
934
935 // Add the new filter.
936 int FilterID = -(1 + FilterIds.size());
937 FilterIds.reserve(n: FilterIds.size() + TyIds.size() + 1);
938 llvm::append_range(C&: FilterIds, R&: TyIds);
939 FilterEnds.push_back(x: FilterIds.size());
940 FilterIds.push_back(x: 0); // terminator
941 return FilterID;
942}
943
944MachineFunction::CallSiteInfoMap::iterator
945MachineFunction::getCallSiteInfo(const MachineInstr *MI) {
946 assert(MI->isCandidateForAdditionalCallInfo() &&
947 "Call site info refers only to call (MI) candidates");
948
949 if (!Target.Options.EmitCallSiteInfo && !Target.Options.EmitCallGraphSection)
950 return CallSitesInfo.end();
951 return CallSitesInfo.find(Val: MI);
952}
953
954/// Return the call machine instruction or find a call within bundle.
955static const MachineInstr *getCallInstr(const MachineInstr *MI) {
956 if (!MI->isBundle())
957 return MI;
958
959 for (const auto &BMI : make_range(x: getBundleStart(I: MI->getIterator()),
960 y: getBundleEnd(I: MI->getIterator())))
961 if (BMI.isCandidateForAdditionalCallInfo())
962 return &BMI;
963
964 llvm_unreachable("Unexpected bundle without a call site candidate");
965}
966
967void MachineFunction::eraseAdditionalCallInfo(const MachineInstr *MI) {
968 assert(MI->shouldUpdateAdditionalCallInfo() &&
969 "Call info refers only to call (MI) candidates or "
970 "candidates inside bundles");
971
972 const MachineInstr *CallMI = getCallInstr(MI);
973
974 CallSiteInfoMap::iterator CSIt = getCallSiteInfo(MI: CallMI);
975 if (CSIt != CallSitesInfo.end())
976 CallSitesInfo.erase(I: CSIt);
977
978 CalledGlobalsInfo.erase(Val: CallMI);
979}
980
981void MachineFunction::copyAdditionalCallInfo(const MachineInstr *Old,
982 const MachineInstr *New) {
983 assert(Old->shouldUpdateAdditionalCallInfo() &&
984 "Call info refers only to call (MI) candidates or "
985 "candidates inside bundles");
986
987 if (!New->isCandidateForAdditionalCallInfo())
988 return eraseAdditionalCallInfo(MI: Old);
989
990 const MachineInstr *OldCallMI = getCallInstr(MI: Old);
991 CallSiteInfoMap::iterator CSIt = getCallSiteInfo(MI: OldCallMI);
992 if (CSIt != CallSitesInfo.end()) {
993 CallSiteInfo CSInfo = CSIt->second;
994 CallSitesInfo[New] = std::move(CSInfo);
995 }
996
997 CalledGlobalsMap::iterator CGIt = CalledGlobalsInfo.find(Val: OldCallMI);
998 if (CGIt != CalledGlobalsInfo.end()) {
999 CalledGlobalInfo CGInfo = CGIt->second;
1000 CalledGlobalsInfo[New] = std::move(CGInfo);
1001 }
1002}
1003
1004void MachineFunction::moveAdditionalCallInfo(const MachineInstr *Old,
1005 const MachineInstr *New) {
1006 assert(Old->shouldUpdateAdditionalCallInfo() &&
1007 "Call info refers only to call (MI) candidates or "
1008 "candidates inside bundles");
1009
1010 if (!New->isCandidateForAdditionalCallInfo())
1011 return eraseAdditionalCallInfo(MI: Old);
1012
1013 const MachineInstr *OldCallMI = getCallInstr(MI: Old);
1014 CallSiteInfoMap::iterator CSIt = getCallSiteInfo(MI: OldCallMI);
1015 if (CSIt != CallSitesInfo.end()) {
1016 CallSiteInfo CSInfo = std::move(CSIt->second);
1017 CallSitesInfo.erase(I: CSIt);
1018 CallSitesInfo[New] = std::move(CSInfo);
1019 }
1020
1021 CalledGlobalsMap::iterator CGIt = CalledGlobalsInfo.find(Val: OldCallMI);
1022 if (CGIt != CalledGlobalsInfo.end()) {
1023 CalledGlobalInfo CGInfo = std::move(CGIt->second);
1024 CalledGlobalsInfo.erase(I: CGIt);
1025 CalledGlobalsInfo[New] = std::move(CGInfo);
1026 }
1027}
1028
1029void MachineFunction::setDebugInstrNumberingCount(unsigned Num) {
1030 DebugInstrNumberingCount = Num;
1031}
1032
1033void MachineFunction::makeDebugValueSubstitution(DebugInstrOperandPair A,
1034 DebugInstrOperandPair B,
1035 unsigned Subreg) {
1036 // Catch any accidental self-loops.
1037 assert(A.first != B.first);
1038 // Don't allow any substitutions _from_ the memory operand number.
1039 assert(A.second != DebugOperandMemNumber);
1040
1041 DebugValueSubstitutions.push_back(Elt: {A, B, Subreg});
1042}
1043
1044void MachineFunction::substituteDebugValuesForInst(const MachineInstr &Old,
1045 MachineInstr &New,
1046 unsigned MaxOperand) {
1047 // If the Old instruction wasn't tracked at all, there is no work to do.
1048 unsigned OldInstrNum = Old.peekDebugInstrNum();
1049 if (!OldInstrNum)
1050 return;
1051
1052 // Iterate over all operands looking for defs to create substitutions for.
1053 // Avoid creating new instr numbers unless we create a new substitution.
1054 // While this has no functional effect, it risks confusing someone reading
1055 // MIR output.
1056 // Examine all the operands, or the first N specified by the caller.
1057 MaxOperand = std::min(a: MaxOperand, b: Old.getNumOperands());
1058 for (unsigned int I = 0; I < MaxOperand; ++I) {
1059 const auto &OldMO = Old.getOperand(i: I);
1060 auto &NewMO = New.getOperand(i: I);
1061 (void)NewMO;
1062
1063 if (!OldMO.isReg() || !OldMO.isDef())
1064 continue;
1065 assert(NewMO.isDef());
1066
1067 unsigned NewInstrNum = New.getDebugInstrNum();
1068 makeDebugValueSubstitution(A: std::make_pair(x&: OldInstrNum, y&: I),
1069 B: std::make_pair(x&: NewInstrNum, y&: I));
1070 }
1071}
1072
1073auto MachineFunction::salvageCopySSA(
1074 MachineInstr &MI, DenseMap<Register, DebugInstrOperandPair> &DbgPHICache)
1075 -> DebugInstrOperandPair {
1076 const TargetInstrInfo &TII = *getSubtarget().getInstrInfo();
1077
1078 // Check whether this copy-like instruction has already been salvaged into
1079 // an operand pair.
1080 Register Dest;
1081 if (auto CopyDstSrc = TII.isCopyLikeInstr(MI)) {
1082 Dest = CopyDstSrc->Destination->getReg();
1083 } else {
1084 assert(MI.isSubregToReg());
1085 Dest = MI.getOperand(i: 0).getReg();
1086 }
1087
1088 auto CacheIt = DbgPHICache.find(Val: Dest);
1089 if (CacheIt != DbgPHICache.end())
1090 return CacheIt->second;
1091
1092 // Calculate the instruction number to use, or install a DBG_PHI.
1093 auto OperandPair = salvageCopySSAImpl(MI);
1094 DbgPHICache.insert(KV: {Dest, OperandPair});
1095 return OperandPair;
1096}
1097
1098auto MachineFunction::salvageCopySSAImpl(MachineInstr &MI)
1099 -> DebugInstrOperandPair {
1100 MachineRegisterInfo &MRI = getRegInfo();
1101 const TargetRegisterInfo &TRI = *MRI.getTargetRegisterInfo();
1102 const TargetInstrInfo &TII = *getSubtarget().getInstrInfo();
1103
1104 // Chase the value read by a copy-like instruction back to the instruction
1105 // that ultimately _defines_ that value. This may pass:
1106 // * Through multiple intermediate copies, including subregister moves /
1107 // copies,
1108 // * Copies from physical registers that must then be traced back to the
1109 // defining instruction,
1110 // * Or, physical registers may be live-in to (only) the entry block, which
1111 // requires a DBG_PHI to be created.
1112 // We can pursue this problem in that order: trace back through copies,
1113 // optionally through a physical register, to a defining instruction. We
1114 // should never move from physreg to vreg. As we're still in SSA form, no need
1115 // to worry about partial definitions of registers.
1116
1117 // Helper lambda to interpret a copy-like instruction. Takes instruction,
1118 // returns the register read and any subregister identifying which part is
1119 // read.
1120 auto GetRegAndSubreg =
1121 [&](const MachineInstr &Cpy) -> std::pair<Register, unsigned> {
1122 Register NewReg, OldReg;
1123 unsigned SubReg;
1124 if (Cpy.isCopy()) {
1125 OldReg = Cpy.getOperand(i: 0).getReg();
1126 NewReg = Cpy.getOperand(i: 1).getReg();
1127 SubReg = Cpy.getOperand(i: 1).getSubReg();
1128 } else if (Cpy.isSubregToReg()) {
1129 OldReg = Cpy.getOperand(i: 0).getReg();
1130 NewReg = Cpy.getOperand(i: 1).getReg();
1131 SubReg = Cpy.getOperand(i: 2).getImm();
1132 } else {
1133 auto CopyDetails = *TII.isCopyInstr(MI: Cpy);
1134 const MachineOperand &Src = *CopyDetails.Source;
1135 const MachineOperand &Dest = *CopyDetails.Destination;
1136 OldReg = Dest.getReg();
1137 NewReg = Src.getReg();
1138 SubReg = Src.getSubReg();
1139 }
1140
1141 return {NewReg, SubReg};
1142 };
1143
1144 // First seek either the defining instruction, or a copy from a physreg.
1145 // During search, the current state is the current copy instruction, and which
1146 // register we've read. Accumulate qualifying subregisters into SubregsSeen;
1147 // deal with those later.
1148 auto State = GetRegAndSubreg(MI);
1149 auto CurInst = MI.getIterator();
1150 SmallVector<unsigned, 4> SubregsSeen;
1151 while (true) {
1152 // If we've found a copy from a physreg, first portion of search is over.
1153 if (!State.first.isVirtual())
1154 break;
1155
1156 // Record any subregister qualifier.
1157 if (State.second)
1158 SubregsSeen.push_back(Elt: State.second);
1159
1160 assert(MRI.hasOneDef(State.first));
1161 MachineInstr &Inst = *MRI.def_begin(RegNo: State.first)->getParent();
1162 CurInst = Inst.getIterator();
1163
1164 // Any non-copy instruction is the defining instruction we're seeking.
1165 if (!Inst.isCopyLike() && !TII.isCopyLikeInstr(MI: Inst))
1166 break;
1167 State = GetRegAndSubreg(Inst);
1168 };
1169
1170 // Helper lambda to apply additional subregister substitutions to a known
1171 // instruction/operand pair. Adds new (fake) substitutions so that we can
1172 // record the subregister. FIXME: this isn't very space efficient if multiple
1173 // values are tracked back through the same copies; cache something later.
1174 auto ApplySubregisters =
1175 [&](DebugInstrOperandPair P) -> DebugInstrOperandPair {
1176 for (unsigned Subreg : reverse(C&: SubregsSeen)) {
1177 // Fetch a new instruction number, not attached to an actual instruction.
1178 unsigned NewInstrNumber = getNewDebugInstrNum();
1179 // Add a substitution from the "new" number to the known one, with a
1180 // qualifying subreg.
1181 makeDebugValueSubstitution(A: {NewInstrNumber, 0}, B: P, Subreg);
1182 // Return the new number; to find the underlying value, consumers need to
1183 // deal with the qualifying subreg.
1184 P = {NewInstrNumber, 0};
1185 }
1186 return P;
1187 };
1188
1189 // If we managed to find the defining instruction after COPYs, return an
1190 // instruction / operand pair after adding subregister qualifiers.
1191 if (State.first.isVirtual()) {
1192 // Virtual register def -- we can just look up where this happens.
1193 MachineInstr *Inst = MRI.def_begin(RegNo: State.first)->getParent();
1194 for (auto &MO : Inst->all_defs()) {
1195 if (MO.getReg() != State.first)
1196 continue;
1197 return ApplySubregisters({Inst->getDebugInstrNum(), MO.getOperandNo()});
1198 }
1199
1200 llvm_unreachable("Vreg def with no corresponding operand?");
1201 }
1202
1203 // Our search ended in a copy from a physreg: walk back up the function
1204 // looking for whatever defines the physreg.
1205 assert(CurInst->isCopyLike() || TII.isCopyInstr(*CurInst));
1206 State = GetRegAndSubreg(*CurInst);
1207 Register RegToSeek = State.first;
1208
1209 auto RMII = CurInst->getReverseIterator();
1210 auto PrevInstrs = make_range(x: RMII, y: CurInst->getParent()->instr_rend());
1211 for (auto &ToExamine : PrevInstrs) {
1212 for (auto &MO : ToExamine.all_defs()) {
1213 // Test for operand that defines something aliasing RegToSeek.
1214 if (!TRI.regsOverlap(RegA: RegToSeek, RegB: MO.getReg()))
1215 continue;
1216
1217 return ApplySubregisters(
1218 {ToExamine.getDebugInstrNum(), MO.getOperandNo()});
1219 }
1220 }
1221
1222 MachineBasicBlock &InsertBB = *CurInst->getParent();
1223
1224 // We reached the start of the block before finding a defining instruction.
1225 // There are numerous scenarios where this can happen:
1226 // * Constant physical registers,
1227 // * Several intrinsics that allow LLVM-IR to read arbitary registers,
1228 // * Arguments in the entry block,
1229 // * Exception handling landing pads.
1230 // Validating all of them is too difficult, so just insert a DBG_PHI reading
1231 // the variable value at this position, rather than checking it makes sense.
1232
1233 // Create DBG_PHI for specified physreg.
1234 auto Builder = BuildMI(BB&: InsertBB, I: InsertBB.getFirstNonPHI(), MIMD: DebugLoc(),
1235 MCID: TII.get(Opcode: TargetOpcode::DBG_PHI));
1236 Builder.addReg(RegNo: State.first);
1237 unsigned NewNum = getNewDebugInstrNum();
1238 Builder.addImm(Val: NewNum);
1239 return ApplySubregisters({NewNum, 0u});
1240}
1241
1242void MachineFunction::finalizeDebugInstrRefs() {
1243 auto *TII = getSubtarget().getInstrInfo();
1244
1245 auto MakeUndefDbgValue = [&](MachineInstr &MI) {
1246 const MCInstrDesc &RefII = TII->get(Opcode: TargetOpcode::DBG_VALUE_LIST);
1247 MI.setDesc(RefII);
1248 MI.setDebugValueUndef();
1249 };
1250
1251 DenseMap<Register, DebugInstrOperandPair> ArgDbgPHIs;
1252 for (auto &MBB : *this) {
1253 for (auto &MI : MBB) {
1254 if (!MI.isDebugRef())
1255 continue;
1256
1257 bool IsValidRef = true;
1258
1259 for (MachineOperand &MO : MI.debug_operands()) {
1260 if (!MO.isReg())
1261 continue;
1262
1263 Register Reg = MO.getReg();
1264
1265 // Some vregs can be deleted as redundant in the meantime. Mark those
1266 // as DBG_VALUE $noreg. Additionally, some normal instructions are
1267 // quickly deleted, leaving dangling references to vregs with no def.
1268 if (Reg == 0 || !RegInfo->hasOneDef(RegNo: Reg)) {
1269 IsValidRef = false;
1270 break;
1271 }
1272
1273 assert(Reg.isVirtual());
1274 MachineInstr &DefMI = *RegInfo->def_instr_begin(RegNo: Reg);
1275
1276 // If we've found a copy-like instruction, follow it back to the
1277 // instruction that defines the source value, see salvageCopySSA docs
1278 // for why this is important.
1279 if (DefMI.isCopyLike() || TII->isCopyInstr(MI: DefMI)) {
1280 auto Result = salvageCopySSA(MI&: DefMI, DbgPHICache&: ArgDbgPHIs);
1281 MO.ChangeToDbgInstrRef(InstrIdx: Result.first, OpIdx: Result.second);
1282 } else {
1283 // Otherwise, identify the operand number that the VReg refers to.
1284 unsigned OperandIdx = 0;
1285 for (const auto &DefMO : DefMI.operands()) {
1286 if (DefMO.isReg() && DefMO.isDef() && DefMO.getReg() == Reg)
1287 break;
1288 ++OperandIdx;
1289 }
1290 assert(OperandIdx < DefMI.getNumOperands());
1291
1292 // Morph this instr ref to point at the given instruction and operand.
1293 unsigned ID = DefMI.getDebugInstrNum();
1294 MO.ChangeToDbgInstrRef(InstrIdx: ID, OpIdx: OperandIdx);
1295 }
1296 }
1297
1298 if (!IsValidRef)
1299 MakeUndefDbgValue(MI);
1300 }
1301 }
1302}
1303
1304bool MachineFunction::shouldUseDebugInstrRef() const {
1305 // Disable instr-ref at -O0: it's very slow (in compile time). We can still
1306 // have optimized code inlined into this unoptimized code, however with
1307 // fewer and less aggressive optimizations happening, coverage and accuracy
1308 // should not suffer.
1309 if (getTarget().getOptLevel() == CodeGenOptLevel::None)
1310 return false;
1311
1312 // Don't use instr-ref if this function is marked optnone.
1313 if (F.hasFnAttribute(Kind: Attribute::OptimizeNone))
1314 return false;
1315
1316 if (llvm::debuginfoShouldUseDebugInstrRef(T: getTarget().getTargetTriple()))
1317 return true;
1318
1319 return false;
1320}
1321
1322bool MachineFunction::useDebugInstrRef() const {
1323 return UseDebugInstrRef;
1324}
1325
1326void MachineFunction::setUseDebugInstrRef(bool Use) {
1327 UseDebugInstrRef = Use;
1328}
1329
1330// Use one million as a high / reserved number.
1331const unsigned MachineFunction::DebugOperandMemNumber = 1000000;
1332
1333/// \}
1334
1335//===----------------------------------------------------------------------===//
1336// MachineJumpTableInfo implementation
1337//===----------------------------------------------------------------------===//
1338
1339MachineJumpTableEntry::MachineJumpTableEntry(
1340 const std::vector<MachineBasicBlock *> &MBBs)
1341 : MBBs(MBBs), Hotness(MachineFunctionDataHotness::Unknown) {}
1342
1343/// Return the size of each entry in the jump table.
1344unsigned MachineJumpTableInfo::getEntrySize(const DataLayout &TD) const {
1345 // The size of a jump table entry is 4 bytes unless the entry is just the
1346 // address of a block, in which case it is the pointer size.
1347 switch (getEntryKind()) {
1348 case MachineJumpTableInfo::EK_BlockAddress:
1349 return TD.getPointerSize();
1350 case MachineJumpTableInfo::EK_GPRel64BlockAddress:
1351 case MachineJumpTableInfo::EK_LabelDifference64:
1352 return 8;
1353 case MachineJumpTableInfo::EK_GPRel32BlockAddress:
1354 case MachineJumpTableInfo::EK_LabelDifference32:
1355 case MachineJumpTableInfo::EK_Custom32:
1356 return 4;
1357 case MachineJumpTableInfo::EK_Inline:
1358 return 0;
1359 }
1360 llvm_unreachable("Unknown jump table encoding!");
1361}
1362
1363/// Return the alignment of each entry in the jump table.
1364unsigned MachineJumpTableInfo::getEntryAlignment(const DataLayout &TD) const {
1365 // The alignment of a jump table entry is the alignment of int32 unless the
1366 // entry is just the address of a block, in which case it is the pointer
1367 // alignment.
1368 switch (getEntryKind()) {
1369 case MachineJumpTableInfo::EK_BlockAddress:
1370 return TD.getPointerABIAlignment(AS: 0).value();
1371 case MachineJumpTableInfo::EK_GPRel64BlockAddress:
1372 case MachineJumpTableInfo::EK_LabelDifference64:
1373 return TD.getABIIntegerTypeAlignment(BitWidth: 64).value();
1374 case MachineJumpTableInfo::EK_GPRel32BlockAddress:
1375 case MachineJumpTableInfo::EK_LabelDifference32:
1376 case MachineJumpTableInfo::EK_Custom32:
1377 return TD.getABIIntegerTypeAlignment(BitWidth: 32).value();
1378 case MachineJumpTableInfo::EK_Inline:
1379 return 1;
1380 }
1381 llvm_unreachable("Unknown jump table encoding!");
1382}
1383
1384/// Create a new jump table entry in the jump table info.
1385unsigned MachineJumpTableInfo::createJumpTableIndex(
1386 const std::vector<MachineBasicBlock*> &DestBBs) {
1387 assert(!DestBBs.empty() && "Cannot create an empty jump table!");
1388 JumpTables.push_back(x: MachineJumpTableEntry(DestBBs));
1389 return JumpTables.size()-1;
1390}
1391
1392bool MachineJumpTableInfo::updateJumpTableEntryHotness(
1393 size_t JTI, MachineFunctionDataHotness Hotness) {
1394 assert(JTI < JumpTables.size() && "Invalid JTI!");
1395 // Record the largest hotness value.
1396 if (Hotness <= JumpTables[JTI].Hotness)
1397 return false;
1398
1399 JumpTables[JTI].Hotness = Hotness;
1400 return true;
1401}
1402
1403/// If Old is the target of any jump tables, update the jump tables to branch
1404/// to New instead.
1405bool MachineJumpTableInfo::ReplaceMBBInJumpTables(MachineBasicBlock *Old,
1406 MachineBasicBlock *New) {
1407 assert(Old != New && "Not making a change?");
1408 bool MadeChange = false;
1409 for (size_t i = 0, e = JumpTables.size(); i != e; ++i)
1410 ReplaceMBBInJumpTable(Idx: i, Old, New);
1411 return MadeChange;
1412}
1413
1414/// If MBB is present in any jump tables, remove it.
1415bool MachineJumpTableInfo::RemoveMBBFromJumpTables(MachineBasicBlock *MBB) {
1416 bool MadeChange = false;
1417 for (MachineJumpTableEntry &JTE : JumpTables) {
1418 auto removeBeginItr = std::remove(first: JTE.MBBs.begin(), last: JTE.MBBs.end(), value: MBB);
1419 MadeChange |= (removeBeginItr != JTE.MBBs.end());
1420 JTE.MBBs.erase(first: removeBeginItr, last: JTE.MBBs.end());
1421 }
1422 return MadeChange;
1423}
1424
1425/// If Old is a target of the jump tables, update the jump table to branch to
1426/// New instead.
1427bool MachineJumpTableInfo::ReplaceMBBInJumpTable(unsigned Idx,
1428 MachineBasicBlock *Old,
1429 MachineBasicBlock *New) {
1430 assert(Old != New && "Not making a change?");
1431 bool MadeChange = false;
1432 MachineJumpTableEntry &JTE = JumpTables[Idx];
1433 for (MachineBasicBlock *&MBB : JTE.MBBs)
1434 if (MBB == Old) {
1435 MBB = New;
1436 MadeChange = true;
1437 }
1438 return MadeChange;
1439}
1440
1441void MachineJumpTableInfo::print(raw_ostream &OS) const {
1442 if (JumpTables.empty()) return;
1443
1444 OS << "Jump Tables:\n";
1445
1446 for (unsigned i = 0, e = JumpTables.size(); i != e; ++i) {
1447 OS << printJumpTableEntryReference(Idx: i) << ':';
1448 for (const MachineBasicBlock *MBB : JumpTables[i].MBBs)
1449 OS << ' ' << printMBBReference(MBB: *MBB);
1450 OS << '\n';
1451 }
1452
1453 OS << '\n';
1454}
1455
1456#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1457LLVM_DUMP_METHOD void MachineJumpTableInfo::dump() const { print(dbgs()); }
1458#endif
1459
1460Printable llvm::printJumpTableEntryReference(unsigned Idx) {
1461 return Printable([Idx](raw_ostream &OS) { OS << "%jump-table." << Idx; });
1462}
1463
1464//===----------------------------------------------------------------------===//
1465// MachineConstantPool implementation
1466//===----------------------------------------------------------------------===//
1467
1468void MachineConstantPoolValue::anchor() {}
1469
1470unsigned MachineConstantPoolValue::getSizeInBytes(const DataLayout &DL) const {
1471 return DL.getTypeAllocSize(Ty);
1472}
1473
1474unsigned MachineConstantPoolEntry::getSizeInBytes(const DataLayout &DL) const {
1475 if (isMachineConstantPoolEntry())
1476 return Val.MachineCPVal->getSizeInBytes(DL);
1477 return DL.getTypeAllocSize(Ty: Val.ConstVal->getType());
1478}
1479
1480bool MachineConstantPoolEntry::needsRelocation() const {
1481 if (isMachineConstantPoolEntry())
1482 return true;
1483 return Val.ConstVal->needsDynamicRelocation();
1484}
1485
1486SectionKind
1487MachineConstantPoolEntry::getSectionKind(const DataLayout *DL) const {
1488 if (needsRelocation())
1489 return SectionKind::getReadOnlyWithRel();
1490 switch (getSizeInBytes(DL: *DL)) {
1491 case 4:
1492 return SectionKind::getMergeableConst4();
1493 case 8:
1494 return SectionKind::getMergeableConst8();
1495 case 16:
1496 return SectionKind::getMergeableConst16();
1497 case 32:
1498 return SectionKind::getMergeableConst32();
1499 default:
1500 return SectionKind::getReadOnly();
1501 }
1502}
1503
1504MachineConstantPool::~MachineConstantPool() {
1505 // A constant may be a member of both Constants and MachineCPVsSharingEntries,
1506 // so keep track of which we've deleted to avoid double deletions.
1507 DenseSet<MachineConstantPoolValue*> Deleted;
1508 for (const MachineConstantPoolEntry &C : Constants)
1509 if (C.isMachineConstantPoolEntry()) {
1510 Deleted.insert(V: C.Val.MachineCPVal);
1511 delete C.Val.MachineCPVal;
1512 }
1513 for (MachineConstantPoolValue *CPV : MachineCPVsSharingEntries) {
1514 if (Deleted.count(V: CPV) == 0)
1515 delete CPV;
1516 }
1517}
1518
1519/// Test whether the given two constants can be allocated the same constant pool
1520/// entry referenced by \param A.
1521static bool CanShareConstantPoolEntry(const Constant *A, const Constant *B,
1522 const DataLayout &DL) {
1523 // Handle the trivial case quickly.
1524 if (A == B) return true;
1525
1526 // If they have the same type but weren't the same constant, quickly
1527 // reject them.
1528 if (A->getType() == B->getType()) return false;
1529
1530 // We can't handle structs or arrays.
1531 if (isa<StructType>(Val: A->getType()) || isa<ArrayType>(Val: A->getType()) ||
1532 isa<StructType>(Val: B->getType()) || isa<ArrayType>(Val: B->getType()))
1533 return false;
1534
1535 // For now, only support constants with the same size.
1536 uint64_t StoreSize = DL.getTypeStoreSize(Ty: A->getType());
1537 if (StoreSize != DL.getTypeStoreSize(Ty: B->getType()) || StoreSize > 128)
1538 return false;
1539
1540 bool ContainsUndefOrPoisonA = A->containsUndefOrPoisonElement();
1541
1542 Type *IntTy = IntegerType::get(C&: A->getContext(), NumBits: StoreSize*8);
1543
1544 // Try constant folding a bitcast of both instructions to an integer. If we
1545 // get two identical ConstantInt's, then we are good to share them. We use
1546 // the constant folding APIs to do this so that we get the benefit of
1547 // DataLayout.
1548 if (isa<PointerType>(Val: A->getType()))
1549 A = ConstantFoldCastOperand(Opcode: Instruction::PtrToInt,
1550 C: const_cast<Constant *>(A), DestTy: IntTy, DL);
1551 else if (A->getType() != IntTy)
1552 A = ConstantFoldCastOperand(Opcode: Instruction::BitCast, C: const_cast<Constant *>(A),
1553 DestTy: IntTy, DL);
1554 if (isa<PointerType>(Val: B->getType()))
1555 B = ConstantFoldCastOperand(Opcode: Instruction::PtrToInt,
1556 C: const_cast<Constant *>(B), DestTy: IntTy, DL);
1557 else if (B->getType() != IntTy)
1558 B = ConstantFoldCastOperand(Opcode: Instruction::BitCast, C: const_cast<Constant *>(B),
1559 DestTy: IntTy, DL);
1560
1561 if (A != B)
1562 return false;
1563
1564 // Constants only safely match if A doesn't contain undef/poison.
1565 // As we'll be reusing A, it doesn't matter if B contain undef/poison.
1566 // TODO: Handle cases where A and B have the same undef/poison elements.
1567 // TODO: Merge A and B with mismatching undef/poison elements.
1568 return !ContainsUndefOrPoisonA;
1569}
1570
1571/// Create a new entry in the constant pool or return an existing one.
1572/// User must specify the log2 of the minimum required alignment for the object.
1573unsigned MachineConstantPool::getConstantPoolIndex(const Constant *C,
1574 Align Alignment) {
1575 if (Alignment > PoolAlignment) PoolAlignment = Alignment;
1576
1577 // Check to see if we already have this constant.
1578 //
1579 // FIXME, this could be made much more efficient for large constant pools.
1580 for (unsigned i = 0, e = Constants.size(); i != e; ++i)
1581 if (!Constants[i].isMachineConstantPoolEntry() &&
1582 CanShareConstantPoolEntry(A: Constants[i].Val.ConstVal, B: C, DL)) {
1583 if (Constants[i].getAlign() < Alignment)
1584 Constants[i].Alignment = Alignment;
1585 return i;
1586 }
1587
1588 Constants.push_back(x: MachineConstantPoolEntry(C, Alignment));
1589 return Constants.size()-1;
1590}
1591
1592unsigned MachineConstantPool::getConstantPoolIndex(MachineConstantPoolValue *V,
1593 Align Alignment) {
1594 if (Alignment > PoolAlignment) PoolAlignment = Alignment;
1595
1596 // Check to see if we already have this constant.
1597 //
1598 // FIXME, this could be made much more efficient for large constant pools.
1599 int Idx = V->getExistingMachineCPValue(CP: this, Alignment);
1600 if (Idx != -1) {
1601 MachineCPVsSharingEntries.insert(V);
1602 return (unsigned)Idx;
1603 }
1604
1605 Constants.push_back(x: MachineConstantPoolEntry(V, Alignment));
1606 return Constants.size()-1;
1607}
1608
1609void MachineConstantPool::print(raw_ostream &OS) const {
1610 if (Constants.empty()) return;
1611
1612 OS << "Constant Pool:\n";
1613 for (unsigned i = 0, e = Constants.size(); i != e; ++i) {
1614 OS << " cp#" << i << ": ";
1615 if (Constants[i].isMachineConstantPoolEntry())
1616 Constants[i].Val.MachineCPVal->print(O&: OS);
1617 else
1618 Constants[i].Val.ConstVal->printAsOperand(O&: OS, /*PrintType=*/false);
1619 OS << ", align=" << Constants[i].getAlign().value();
1620 OS << "\n";
1621 }
1622}
1623
1624//===----------------------------------------------------------------------===//
1625// Template specialization for MachineFunction implementation of
1626// ProfileSummaryInfo::getEntryCount().
1627//===----------------------------------------------------------------------===//
1628template <>
1629std::optional<Function::ProfileCount>
1630ProfileSummaryInfo::getEntryCount<llvm::MachineFunction>(
1631 const llvm::MachineFunction *F) const {
1632 return F->getFunction().getEntryCount();
1633}
1634
1635#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1636LLVM_DUMP_METHOD void MachineConstantPool::dump() const { print(dbgs()); }
1637#endif
1638