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