/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/lib/CodeGen/MachineDebugify.cpp

Bug Summary

File:	llvm/lib/CodeGen/MachineDebugify.cpp
Warning:	line 113, column 16 Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name MachineDebugify.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -analyzer-config-compatibility-mode=true -mrelocation-model pic -pic-level 2 -mframe-pointer=none -fmath-errno -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -tune-cpu generic -fno-split-dwarf-inlining -debugger-tuning=gdb -ffunction-sections -fdata-sections -resource-dir /usr/lib/llvm-12/lib/clang/12.0.0 -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/build-llvm/lib/CodeGen -I /build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/lib/CodeGen -I /build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/build-llvm/include -I /build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include -U NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/c++/6.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/x86_64-linux-gnu/c++/6.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/x86_64-linux-gnu/c++/6.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/c++/6.3.0/backward -internal-isystem /usr/local/include -internal-isystem /usr/lib/llvm-12/lib/clang/12.0.0/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-maybe-uninitialized -Wno-comment -std=c++14 -fdeprecated-macro -fdebug-compilation-dir /build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/build-llvm/lib/CodeGen -fdebug-prefix-map=/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087=. -ferror-limit 19 -fvisibility-inlines-hidden -stack-protector 2 -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -faddrsig -o /tmp/scan-build-2020-12-16-233803-43058-1 -x c++ /build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/lib/CodeGen/MachineDebugify.cpp

/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/lib/CodeGen/MachineDebugify.cpp

→

1//===- MachineDebugify.cpp - Attach synthetic debug info to everything ----===//
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/// \file This pass attaches synthetic debug info to everything. It can be used
10/// to create targeted tests for debug info preservation, or test for CodeGen
11/// differences with vs. without debug info.
12///
13/// This isn't intended to have feature parity with Debugify.
14//===----------------------------------------------------------------------===//
15 
16#include "llvm/ADT/DenseMap.h"
17#include "llvm/ADT/SmallVector.h"
18#include "llvm/CodeGen/MachineFunctionPass.h"
19#include "llvm/CodeGen/MachineInstrBuilder.h"
20#include "llvm/CodeGen/MachineModuleInfo.h"
21#include "llvm/CodeGen/Passes.h"
22#include "llvm/CodeGen/TargetInstrInfo.h"
23#include "llvm/CodeGen/TargetSubtargetInfo.h"
24#include "llvm/IR/DIBuilder.h"
25#include "llvm/IR/DebugInfo.h"
26#include "llvm/IR/IntrinsicInst.h"
27#include "llvm/InitializePasses.h"
28#include "llvm/Transforms/Utils/Debugify.h"
29 
30#define DEBUG_TYPE"mir-debugify" "mir-debugify"
31 
32using namespace llvm;
33 
34namespace {
35bool applyDebugifyMetadataToMachineFunction(MachineModuleInfo &MMI,
36                                            DIBuilder &DIB, Function &F) {
37  MachineFunction *MaybeMF = MMI.getMachineFunction(F);
38  if (!MaybeMF)
2
←
Assuming 'MaybeMF' is non-null→
3
←
Taking false branch→
39    return false;
40  MachineFunction &MF = *MaybeMF;
41  const TargetInstrInfo &TII = *MF.getSubtarget().getInstrInfo();
42 
43  DISubprogram *SP = F.getSubprogram();
44  assert(SP && "IR Debugify just created it?")((SP && "IR Debugify just created it?") ? static_cast
<void> (0) : __assert_fail ("SP && \"IR Debugify just created it?\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/lib/CodeGen/MachineDebugify.cpp"
, 44, __PRETTY_FUNCTION__));
4
←
Assuming 'SP' is non-null→
5
←
'?' condition is true→
45 
46  Module &M = *F.getParent();
47  LLVMContext &Ctx = M.getContext();
48 
49  unsigned NextLine = SP->getLine();
50  for (MachineBasicBlock &MBB : MF) {
51    for (MachineInstr &MI : MBB) {
52      // This will likely emit line numbers beyond the end of the imagined
53      // source function and into subsequent ones. We don't do anything about
54      // that as it doesn't really matter to the compiler where the line is in
55      // the imaginary source code.
56      MI.setDebugLoc(DILocation::get(Ctx, NextLine++, 1, SP));
57    }
58  }
59 
60  // Find local variables defined by debugify. No attempt is made to match up
61  // MIR-level regs to the 'correct' IR-level variables: there isn't a simple
62  // way to do that, and it isn't necessary to find interesting CodeGen bugs.
63  // Instead, simply keep track of one variable per line. Later, we can insert
64  // DBG_VALUE insts that point to these local variables. Emitting DBG_VALUEs
65  // which cover a wide range of lines can help stress the debug info passes:
66  // if we can't do that, fall back to using the local variable which precedes
67  // all the others.
68  Function *DbgValF = M.getFunction("llvm.dbg.value");
69  DbgValueInst *EarliestDVI = nullptr;
6
←
'EarliestDVI' initialized to a null pointer value→
70  DenseMap<unsigned, DILocalVariable *> Line2Var;
71  DIExpression *Expr = nullptr;
72  if (DbgValF) {
7
←
Assuming 'DbgValF' is null→
8
←
Taking false branch→
73    for (const Use &U : DbgValF->uses()) {
74      auto *DVI = dyn_cast<DbgValueInst>(U.getUser());
75      if (!DVI || DVI->getFunction() != &F)
76        continue;
77      unsigned Line = DVI->getDebugLoc().getLine();
78      assert(Line != 0 && "debugify should not insert line 0 locations")((Line != 0 && "debugify should not insert line 0 locations"
) ? static_cast<void> (0) : __assert_fail ("Line != 0 && \"debugify should not insert line 0 locations\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/lib/CodeGen/MachineDebugify.cpp"
, 78, __PRETTY_FUNCTION__));
79      Line2Var[Line] = DVI->getVariable();
80      if (!EarliestDVI || Line < EarliestDVI->getDebugLoc().getLine())
81        EarliestDVI = DVI;
82      Expr = DVI->getExpression();
83    }
84  }
85  if (Line2Var.empty())
9
←
Assuming the condition is false→
10
←
Taking false branch→
86    return true;
87 
88  // Now, try to insert a DBG_VALUE instruction after each real instruction.
89  // Do this by introducing debug uses of each register definition. If that is
90  // not possible (e.g. we have a phi or a meta instruction), emit a constant.
91  uint64_t NextImm = 0;
92  const MCInstrDesc &DbgValDesc = TII.get(TargetOpcode::DBG_VALUE);
93  for (MachineBasicBlock &MBB : MF) {
94    MachineBasicBlock::iterator FirstNonPHIIt = MBB.getFirstNonPHI();
95    for (auto I = MBB.begin(), E = MBB.end(); I != E; ) {
11
←
Calling 'operator!='→
20
←
Returning from 'operator!='→
21
←
Loop condition is true.  Entering loop body→
96      MachineInstr &MI = *I;
97      ++I;
98 
99      // `I` may point to a DBG_VALUE created in the previous loop iteration.
100      if (MI.isDebugInstr())
22
←
Calling 'MachineInstr::isDebugInstr'→
24
←
Returning from 'MachineInstr::isDebugInstr'→
25
←
Taking false branch→
101        continue;
102 
103      // It's not allowed to insert DBG_VALUEs after a terminator.
104      if (MI.isTerminator())
26
←
Calling 'MachineInstr::isTerminator'→
33
←
Returning from 'MachineInstr::isTerminator'→
34
←
Assuming the condition is false→
35
←
Taking false branch→
105        continue;
106 
107      // Find a suitable insertion point for the DBG_VALUE.
108      auto InsertBeforeIt = MI.isPHI() ? FirstNonPHIIt : I;
36
←
'?' condition is true→
109 
110      // Find a suitable local variable for the DBG_VALUE.
111      unsigned Line = MI.getDebugLoc().getLine();
112      if (!Line2Var.count(Line))
37
←
Assuming the condition is true→
38
←
Taking true branch→
113        Line = EarliestDVI->getDebugLoc().getLine();
39
←
Called C++ object pointer is null
114      DILocalVariable *LocalVar = Line2Var[Line];
115      assert(LocalVar && "No variable for current line?")((LocalVar && "No variable for current line?") ? static_cast
<void> (0) : __assert_fail ("LocalVar && \"No variable for current line?\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/lib/CodeGen/MachineDebugify.cpp"
, 115, __PRETTY_FUNCTION__));
116 
117      // Emit DBG_VALUEs for register definitions.
118      SmallVector<MachineOperand *, 4> RegDefs;
119      for (MachineOperand &MO : MI.operands())
120        if (MO.isReg() && MO.isDef() && MO.getReg())
121          RegDefs.push_back(&MO);
122      for (MachineOperand *MO : RegDefs)
123        BuildMI(MBB, InsertBeforeIt, MI.getDebugLoc(), DbgValDesc,
124                /*IsIndirect=*/false, *MO, LocalVar, Expr);
125 
126      // OK, failing that, emit a constant DBG_VALUE.
127      if (RegDefs.empty()) {
128        auto ImmOp = MachineOperand::CreateImm(NextImm++);
129        BuildMI(MBB, InsertBeforeIt, MI.getDebugLoc(), DbgValDesc,
130                /*IsIndirect=*/false, ImmOp, LocalVar, Expr);
131      }
132    }
133  }
134 
135  return true;
136}
137 
138/// ModulePass for attaching synthetic debug info to everything, used with the
139/// legacy module pass manager.
140struct DebugifyMachineModule : public ModulePass {
141  bool runOnModule(Module &M) override {
142    MachineModuleInfo &MMI =
143        getAnalysis<MachineModuleInfoWrapperPass>().getMMI();
144    return applyDebugifyMetadata(
145        M, M.functions(),
146        "ModuleDebugify: ", [&](DIBuilder &DIB, Function &F) -> bool {
147          return applyDebugifyMetadataToMachineFunction(MMI, DIB, F);
1
Calling 'applyDebugifyMetadataToMachineFunction'→
148        });
149  }
150 
151  DebugifyMachineModule() : ModulePass(ID) {}
152 
153  void getAnalysisUsage(AnalysisUsage &AU) const override {
154    AU.addRequired<MachineModuleInfoWrapperPass>();
155    AU.addPreserved<MachineModuleInfoWrapperPass>();
156    AU.setPreservesCFG();
157  }
158 
159  static char ID; // Pass identification.
160};
161char DebugifyMachineModule::ID = 0;
162 
163} // end anonymous namespace
164 
165INITIALIZE_PASS_BEGIN(DebugifyMachineModule, DEBUG_TYPE,static void *initializeDebugifyMachineModulePassOnce(PassRegistry
 &Registry) {
166                      "Machine Debugify Module", false, false)static void *initializeDebugifyMachineModulePassOnce(PassRegistry
 &Registry) {
167INITIALIZE_PASS_END(DebugifyMachineModule, DEBUG_TYPE,PassInfo *PI = new PassInfo( "Machine Debugify Module", "mir-debugify"
, &DebugifyMachineModule::ID, PassInfo::NormalCtor_t(callDefaultCtor
<DebugifyMachineModule>), false, false); Registry.registerPass
(*PI, true); return PI; } static llvm::once_flag InitializeDebugifyMachineModulePassFlag
; void llvm::initializeDebugifyMachineModulePass(PassRegistry
 &Registry) { llvm::call_once(InitializeDebugifyMachineModulePassFlag
, initializeDebugifyMachineModulePassOnce, std::ref(Registry)
); }
168                    "Machine Debugify Module", false, false)PassInfo *PI = new PassInfo( "Machine Debugify Module", "mir-debugify"
, &DebugifyMachineModule::ID, PassInfo::NormalCtor_t(callDefaultCtor
<DebugifyMachineModule>), false, false); Registry.registerPass
(*PI, true); return PI; } static llvm::once_flag InitializeDebugifyMachineModulePassFlag
; void llvm::initializeDebugifyMachineModulePass(PassRegistry
 &Registry) { llvm::call_once(InitializeDebugifyMachineModulePassFlag
, initializeDebugifyMachineModulePassOnce, std::ref(Registry)
); }
169 
170ModulePass *llvm::createDebugifyMachineModulePass() {
171  return new DebugifyMachineModule();
172}

←

/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstrBundleIterator.h

→

1//===- llvm/CodeGen/MachineInstrBundleIterator.h ----------------*- C++ -*-===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// Defines an iterator class that bundles MachineInstr.
10//
11//===----------------------------------------------------------------------===//

13#ifndef LLVM_CODEGEN_MACHINEINSTRBUNDLEITERATOR_H
14#define LLVM_CODEGEN_MACHINEINSTRBUNDLEITERATOR_H

16#include "llvm/ADT/ilist.h"
17#include "llvm/ADT/simple_ilist.h"
18#include <cassert>
19#include <iterator>
20#include <type_traits>

22namespace llvm {

24template <class T, bool IsReverse> struct MachineInstrBundleIteratorTraits;
25template <class T> struct MachineInstrBundleIteratorTraits<T, false> {
using list_type = simple_ilist<T, ilist_sentinel_tracking<true>>;
using instr_iterator = typename list_type::iterator;
using nonconst_instr_iterator = typename list_type::iterator;
using const_instr_iterator = typename list_type::const_iterator;
30};
31template <class T> struct MachineInstrBundleIteratorTraits<T, true> {
using list_type = simple_ilist<T, ilist_sentinel_tracking<true>>;
using instr_iterator = typename list_type::reverse_iterator;
using nonconst_instr_iterator = typename list_type::reverse_iterator;
using const_instr_iterator = typename list_type::const_reverse_iterator;
36};
37template <class T> struct MachineInstrBundleIteratorTraits<const T, false> {
using list_type = simple_ilist<T, ilist_sentinel_tracking<true>>;
using instr_iterator = typename list_type::const_iterator;
using nonconst_instr_iterator = typename list_type::iterator;
using const_instr_iterator = typename list_type::const_iterator;
42};
43template <class T> struct MachineInstrBundleIteratorTraits<const T, true> {
using list_type = simple_ilist<T, ilist_sentinel_tracking<true>>;
using instr_iterator = typename list_type::const_reverse_iterator;
using nonconst_instr_iterator = typename list_type::reverse_iterator;
using const_instr_iterator = typename list_type::const_reverse_iterator;
48};

50template <bool IsReverse> struct MachineInstrBundleIteratorHelper;
51template <> struct MachineInstrBundleIteratorHelper<false> {
/// Get the beginning of the current bundle.
template <class Iterator> static Iterator getBundleBegin(Iterator I) {
  if (!I.isEnd())
    while (I->isBundledWithPred())
      --I;
  return I;
}

/// Get the final node of the current bundle.
template <class Iterator> static Iterator getBundleFinal(Iterator I) {
  if (!I.isEnd())
    while (I->isBundledWithSucc())
      ++I;
  return I;
}

/// Increment forward ilist iterator.
template <class Iterator> static void increment(Iterator &I) {
  I = std::next(getBundleFinal(I));
}

/// Decrement forward ilist iterator.
template <class Iterator> static void decrement(Iterator &I) {
  I = getBundleBegin(std::prev(I));
}
77};

79template <> struct MachineInstrBundleIteratorHelper<true> {
/// Get the beginning of the current bundle.
template <class Iterator> static Iterator getBundleBegin(Iterator I) {
  return MachineInstrBundleIteratorHelper<false>::getBundleBegin(
             I.getReverse())
      .getReverse();
}

/// Get the final node of the current bundle.
template <class Iterator> static Iterator getBundleFinal(Iterator I) {
  return MachineInstrBundleIteratorHelper<false>::getBundleFinal(
             I.getReverse())
      .getReverse();
}

/// Increment reverse ilist iterator.
template <class Iterator> static void increment(Iterator &I) {
  I = getBundleBegin(std::next(I));
}

/// Decrement reverse ilist iterator.
template <class Iterator> static void decrement(Iterator &I) {
  I = std::prev(getBundleFinal(I));
}
103};

105/// MachineBasicBlock iterator that automatically skips over MIs that are
106/// inside bundles (i.e. walk top level MIs only).
107template <typename Ty, bool IsReverse = false>
108class MachineInstrBundleIterator : MachineInstrBundleIteratorHelper<IsReverse> {
using Traits = MachineInstrBundleIteratorTraits<Ty, IsReverse>;
using instr_iterator = typename Traits::instr_iterator;

instr_iterator MII;

114public:
using value_type = typename instr_iterator::value_type;
using difference_type = typename instr_iterator::difference_type;
using pointer = typename instr_iterator::pointer;
using reference = typename instr_iterator::reference;
using const_pointer = typename instr_iterator::const_pointer;
using const_reference = typename instr_iterator::const_reference;
using iterator_category = std::bidirectional_iterator_tag;

123private:
using nonconst_instr_iterator = typename Traits::nonconst_instr_iterator;
using const_instr_iterator = typename Traits::const_instr_iterator;
using nonconst_iterator =
    MachineInstrBundleIterator<typename nonconst_instr_iterator::value_type,
                               IsReverse>;
using reverse_iterator = MachineInstrBundleIterator<Ty, !IsReverse>;

131public:
MachineInstrBundleIterator(instr_iterator MI) : MII(MI) {
  assert((!MI.getNodePtr() || MI.isEnd() || !MI->isBundledWithPred()) &&(((!MI.getNodePtr() || MI.isEnd() || !MI->isBundledWithPred
()) && "It's not legal to initialize MachineInstrBundleIterator with a "
 "bundled MI") ? static_cast<void> (0) : __assert_fail (
"(!MI.getNodePtr() || MI.isEnd() || !MI->isBundledWithPred()) && \"It's not legal to initialize MachineInstrBundleIterator with a \" \"bundled MI\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstrBundleIterator.h"
, 135, __PRETTY_FUNCTION__))
         "It's not legal to initialize MachineInstrBundleIterator with a "(((!MI.getNodePtr() || MI.isEnd() || !MI->isBundledWithPred
()) && "It's not legal to initialize MachineInstrBundleIterator with a "
 "bundled MI") ? static_cast<void> (0) : __assert_fail (
"(!MI.getNodePtr() || MI.isEnd() || !MI->isBundledWithPred()) && \"It's not legal to initialize MachineInstrBundleIterator with a \" \"bundled MI\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstrBundleIterator.h"
, 135, __PRETTY_FUNCTION__))
         "bundled MI")(((!MI.getNodePtr() || MI.isEnd() || !MI->isBundledWithPred
()) && "It's not legal to initialize MachineInstrBundleIterator with a "
 "bundled MI") ? static_cast<void> (0) : __assert_fail (
"(!MI.getNodePtr() || MI.isEnd() || !MI->isBundledWithPred()) && \"It's not legal to initialize MachineInstrBundleIterator with a \" \"bundled MI\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstrBundleIterator.h"
, 135, __PRETTY_FUNCTION__));
}

MachineInstrBundleIterator(reference MI) : MII(MI) {
  assert(!MI.isBundledWithPred() && "It's not legal to initialize "((!MI.isBundledWithPred() && "It's not legal to initialize "
 "MachineInstrBundleIterator with a " "bundled MI") ? static_cast
<void> (0) : __assert_fail ("!MI.isBundledWithPred() && \"It's not legal to initialize \" \"MachineInstrBundleIterator with a \" \"bundled MI\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstrBundleIterator.h"
, 141, __PRETTY_FUNCTION__))
                                    "MachineInstrBundleIterator with a "((!MI.isBundledWithPred() && "It's not legal to initialize "
 "MachineInstrBundleIterator with a " "bundled MI") ? static_cast
<void> (0) : __assert_fail ("!MI.isBundledWithPred() && \"It's not legal to initialize \" \"MachineInstrBundleIterator with a \" \"bundled MI\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstrBundleIterator.h"
, 141, __PRETTY_FUNCTION__))
                                    "bundled MI")((!MI.isBundledWithPred() && "It's not legal to initialize "
 "MachineInstrBundleIterator with a " "bundled MI") ? static_cast
<void> (0) : __assert_fail ("!MI.isBundledWithPred() && \"It's not legal to initialize \" \"MachineInstrBundleIterator with a \" \"bundled MI\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstrBundleIterator.h"
, 141, __PRETTY_FUNCTION__));
}

MachineInstrBundleIterator(pointer MI) : MII(MI) {
  // FIXME: This conversion should be explicit.
  assert((!MI || !MI->isBundledWithPred()) && "It's not legal to initialize "(((!MI || !MI->isBundledWithPred()) && "It's not legal to initialize "
 "MachineInstrBundleIterator " "with a bundled MI") ? static_cast
<void> (0) : __assert_fail ("(!MI || !MI->isBundledWithPred()) && \"It's not legal to initialize \" \"MachineInstrBundleIterator \" \"with a bundled MI\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstrBundleIterator.h"
, 148, __PRETTY_FUNCTION__))
                                              "MachineInstrBundleIterator "(((!MI || !MI->isBundledWithPred()) && "It's not legal to initialize "
 "MachineInstrBundleIterator " "with a bundled MI") ? static_cast
<void> (0) : __assert_fail ("(!MI || !MI->isBundledWithPred()) && \"It's not legal to initialize \" \"MachineInstrBundleIterator \" \"with a bundled MI\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstrBundleIterator.h"
, 148, __PRETTY_FUNCTION__))
                                              "with a bundled MI")(((!MI || !MI->isBundledWithPred()) && "It's not legal to initialize "
 "MachineInstrBundleIterator " "with a bundled MI") ? static_cast
<void> (0) : __assert_fail ("(!MI || !MI->isBundledWithPred()) && \"It's not legal to initialize \" \"MachineInstrBundleIterator \" \"with a bundled MI\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstrBundleIterator.h"
, 148, __PRETTY_FUNCTION__));
}

// Template allows conversion from const to nonconst.
template <class OtherTy>
MachineInstrBundleIterator(
    const MachineInstrBundleIterator<OtherTy, IsReverse> &I,
    std::enable_if_t<std::is_convertible<OtherTy *, Ty *>::value, void *> =
        nullptr)
    : MII(I.getInstrIterator()) {}

MachineInstrBundleIterator() : MII(nullptr) {}

/// Explicit conversion between forward/reverse iterators.
///
/// Translate between forward and reverse iterators without changing range
/// boundaries.  The resulting iterator will dereference (and have a handle)
/// to the previous node, which is somewhat unexpected; but converting the
/// two endpoints in a range will give the same range in reverse.
///
/// This matches std::reverse_iterator conversions.
explicit MachineInstrBundleIterator(
    const MachineInstrBundleIterator<Ty, !IsReverse> &I)
    : MachineInstrBundleIterator(++I.getReverse()) {}

/// Get the bundle iterator for the given instruction's bundle.
static MachineInstrBundleIterator getAtBundleBegin(instr_iterator MI) {
  return MachineInstrBundleIteratorHelper<IsReverse>::getBundleBegin(MI);
}

reference operator*() const { return *MII; }
pointer operator->() const { return &operator*(); }

/// Check for null.
bool isValid() const { return MII.getNodePtr(); }

friend bool operator==(const MachineInstrBundleIterator &L,
                       const MachineInstrBundleIterator &R) {
  return L.MII == R.MII;
13
←
Calling 'operator=='→
16
←
Returning from 'operator=='→
17
←
Returning zero, which participates in a condition later→
}
friend bool operator==(const MachineInstrBundleIterator &L,
                       const const_instr_iterator &R) {
  return L.MII == R; // Avoid assertion about validity of R.
}
friend bool operator==(const const_instr_iterator &L,
                       const MachineInstrBundleIterator &R) {
  return L == R.MII; // Avoid assertion about validity of L.
}
friend bool operator==(const MachineInstrBundleIterator &L,
                       const nonconst_instr_iterator &R) {
  return L.MII == R; // Avoid assertion about validity of R.
}
friend bool operator==(const nonconst_instr_iterator &L,
                       const MachineInstrBundleIterator &R) {
  return L == R.MII; // Avoid assertion about validity of L.
}
friend bool operator==(const MachineInstrBundleIterator &L, const_pointer R) {
  return L == const_instr_iterator(R); // Avoid assertion about validity of R.
}
friend bool operator==(const_pointer L, const MachineInstrBundleIterator &R) {
  return const_instr_iterator(L) == R; // Avoid assertion about validity of L.
}
friend bool operator==(const MachineInstrBundleIterator &L,
                       const_reference R) {
  return L == &R; // Avoid assertion about validity of R.
}
friend bool operator==(const_reference L,
                       const MachineInstrBundleIterator &R) {
  return &L == R; // Avoid assertion about validity of L.
}

friend bool operator!=(const MachineInstrBundleIterator &L,
                       const MachineInstrBundleIterator &R) {
  return !(L == R);
12
←
Calling 'operator=='→
18
←
Returning from 'operator=='→
19
←
Returning the value 1, which participates in a condition later→
}
friend bool operator!=(const MachineInstrBundleIterator &L,
                       const const_instr_iterator &R) {
  return !(L == R);
}
friend bool operator!=(const const_instr_iterator &L,
                       const MachineInstrBundleIterator &R) {
  return !(L == R);
}
friend bool operator!=(const MachineInstrBundleIterator &L,
                       const nonconst_instr_iterator &R) {
  return !(L == R);
}
friend bool operator!=(const nonconst_instr_iterator &L,
                       const MachineInstrBundleIterator &R) {
  return !(L == R);
}
friend bool operator!=(const MachineInstrBundleIterator &L, const_pointer R) {
  return !(L == R);
}
friend bool operator!=(const_pointer L, const MachineInstrBundleIterator &R) {
  return !(L == R);
}
friend bool operator!=(const MachineInstrBundleIterator &L,
                       const_reference R) {
  return !(L == R);
}
friend bool operator!=(const_reference L,
                       const MachineInstrBundleIterator &R) {
  return !(L == R);
}

// Increment and decrement operators...
MachineInstrBundleIterator &operator--() {
  this->decrement(MII);
  return *this;
}
MachineInstrBundleIterator &operator++() {
  this->increment(MII);
  return *this;
}
MachineInstrBundleIterator operator--(int) {
  MachineInstrBundleIterator Temp = *this;
  --*this;
  return Temp;
}
MachineInstrBundleIterator operator++(int) {
  MachineInstrBundleIterator Temp = *this;
  ++*this;
  return Temp;
}

instr_iterator getInstrIterator() const { return MII; }

nonconst_iterator getNonConstIterator() const { return MII.getNonConst(); }

/// Get a reverse iterator to the same node.
///
/// Gives a reverse iterator that will dereference (and have a handle) to the
/// same node.  Converting the endpoint iterators in a range will give a
/// different range; for range operations, use the explicit conversions.
reverse_iterator getReverse() const { return MII.getReverse(); }
284};

286} // end namespace llvm

288#endif // LLVM_CODEGEN_MACHINEINSTRBUNDLEITERATOR_H

←

/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/ADT/ilist_iterator.h

→

1//===- llvm/ADT/ilist_iterator.h - Intrusive List Iterator ------*- C++ -*-===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//

9#ifndef LLVM_ADT_ILIST_ITERATOR_H
10#define LLVM_ADT_ILIST_ITERATOR_H

12#include "llvm/ADT/ilist_node.h"
13#include <cassert>
14#include <cstddef>
15#include <iterator>
16#include <type_traits>

18namespace llvm {

20namespace ilist_detail {

22/// Find const-correct node types.
23template <class OptionsT, bool IsConst> struct IteratorTraits;
24template <class OptionsT> struct IteratorTraits<OptionsT, false> {
using value_type = typename OptionsT::value_type;
using pointer = typename OptionsT::pointer;
using reference = typename OptionsT::reference;
using node_pointer = ilist_node_impl<OptionsT> *;
using node_reference = ilist_node_impl<OptionsT> &;
30};
31template <class OptionsT> struct IteratorTraits<OptionsT, true> {
using value_type = const typename OptionsT::value_type;
using pointer = typename OptionsT::const_pointer;
using reference = typename OptionsT::const_reference;
using node_pointer = const ilist_node_impl<OptionsT> *;
using node_reference = const ilist_node_impl<OptionsT> &;
37};

39template <bool IsReverse> struct IteratorHelper;
40template <> struct IteratorHelper<false> : ilist_detail::NodeAccess {
using Access = ilist_detail::NodeAccess;

template <class T> static void increment(T *&I) { I = Access::getNext(*I); }
template <class T> static void decrement(T *&I) { I = Access::getPrev(*I); }
45};
46template <> struct IteratorHelper<true> : ilist_detail::NodeAccess {
using Access = ilist_detail::NodeAccess;

template <class T> static void increment(T *&I) { I = Access::getPrev(*I); }
template <class T> static void decrement(T *&I) { I = Access::getNext(*I); }
51};

53} // end namespace ilist_detail

55/// Iterator for intrusive lists  based on ilist_node.
56template <class OptionsT, bool IsReverse, bool IsConst>
57class ilist_iterator : ilist_detail::SpecificNodeAccess<OptionsT> {
friend ilist_iterator<OptionsT, IsReverse, !IsConst>;
friend ilist_iterator<OptionsT, !IsReverse, IsConst>;
friend ilist_iterator<OptionsT, !IsReverse, !IsConst>;

using Traits = ilist_detail::IteratorTraits<OptionsT, IsConst>;
using Access = ilist_detail::SpecificNodeAccess<OptionsT>;

65public:
using value_type = typename Traits::value_type;
using pointer = typename Traits::pointer;
using reference = typename Traits::reference;
using difference_type = ptrdiff_t;
using iterator_category = std::bidirectional_iterator_tag;
using const_pointer = typename OptionsT::const_pointer;
using const_reference = typename OptionsT::const_reference;

74private:
using node_pointer = typename Traits::node_pointer;
using node_reference = typename Traits::node_reference;

node_pointer NodePtr = nullptr;

80public:
/// Create from an ilist_node.
explicit ilist_iterator(node_reference N) : NodePtr(&N) {}

explicit ilist_iterator(pointer NP) : NodePtr(Access::getNodePtr(NP)) {}
explicit ilist_iterator(reference NR) : NodePtr(Access::getNodePtr(&NR)) {}
ilist_iterator() = default;

// This is templated so that we can allow constructing a const iterator from
// a nonconst iterator...
template <bool RHSIsConst>
ilist_iterator(const ilist_iterator<OptionsT, IsReverse, RHSIsConst> &RHS,
               std::enable_if_t<IsConst || !RHSIsConst, void *> = nullptr)
    : NodePtr(RHS.NodePtr) {}

// This is templated so that we can allow assigning to a const iterator from
// a nonconst iterator...
template <bool RHSIsConst>
std::enable_if_t<IsConst || !RHSIsConst, ilist_iterator &>
operator=(const ilist_iterator<OptionsT, IsReverse, RHSIsConst> &RHS) {
  NodePtr = RHS.NodePtr;
  return *this;
}

/// Explicit conversion between forward/reverse iterators.
///
/// Translate between forward and reverse iterators without changing range
/// boundaries.  The resulting iterator will dereference (and have a handle)
/// to the previous node, which is somewhat unexpected; but converting the
/// two endpoints in a range will give the same range in reverse.
///
/// This matches std::reverse_iterator conversions.
explicit ilist_iterator(
    const ilist_iterator<OptionsT, !IsReverse, IsConst> &RHS)
    : ilist_iterator(++RHS.getReverse()) {}

/// Get a reverse iterator to the same node.
///
/// Gives a reverse iterator that will dereference (and have a handle) to the
/// same node.  Converting the endpoint iterators in a range will give a
/// different range; for range operations, use the explicit conversions.
ilist_iterator<OptionsT, !IsReverse, IsConst> getReverse() const {
  if (NodePtr)
    return ilist_iterator<OptionsT, !IsReverse, IsConst>(*NodePtr);
  return ilist_iterator<OptionsT, !IsReverse, IsConst>();
}

/// Const-cast.
ilist_iterator<OptionsT, IsReverse, false> getNonConst() const {
  if (NodePtr)
    return ilist_iterator<OptionsT, IsReverse, false>(
        const_cast<typename ilist_iterator<OptionsT, IsReverse,
                                           false>::node_reference>(*NodePtr));
  return ilist_iterator<OptionsT, IsReverse, false>();
}

// Accessors...
reference operator*() const {
  assert(!NodePtr->isKnownSentinel())((!NodePtr->isKnownSentinel()) ? static_cast<void> (
0) : __assert_fail ("!NodePtr->isKnownSentinel()", "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/ADT/ilist_iterator.h"
, 138, __PRETTY_FUNCTION__));
  return *Access::getValuePtr(NodePtr);
}
pointer operator->() const { return &operator*(); }

// Comparison operators
friend bool operator==(const ilist_iterator &LHS, const ilist_iterator &RHS) {
  return LHS.NodePtr == RHS.NodePtr;
14
←
Assuming 'LHS.NodePtr' is not equal to 'RHS.NodePtr'→
15
←
Returning zero, which participates in a condition later→
}
friend bool operator!=(const ilist_iterator &LHS, const ilist_iterator &RHS) {
  return LHS.NodePtr != RHS.NodePtr;
}

// Increment and decrement operators...
ilist_iterator &operator--() {
  NodePtr = IsReverse ? NodePtr->getNext() : NodePtr->getPrev();
  return *this;
}
ilist_iterator &operator++() {
  NodePtr = IsReverse ? NodePtr->getPrev() : NodePtr->getNext();
  return *this;
}
ilist_iterator operator--(int) {
  ilist_iterator tmp = *this;
  --*this;
  return tmp;
}
ilist_iterator operator++(int) {
  ilist_iterator tmp = *this;
  ++*this;
  return tmp;
}

/// Get the underlying ilist_node.
node_pointer getNodePtr() const { return static_cast<node_pointer>(NodePtr); }

/// Check for end.  Only valid if ilist_sentinel_tracking<true>.
bool isEnd() const { return NodePtr ? NodePtr->isSentinel() : false; }
176};

178template <typename From> struct simplify_type;

180/// Allow ilist_iterators to convert into pointers to a node automatically when
181/// used by the dyn_cast, cast, isa mechanisms...
182///
183/// FIXME: remove this, since there is no implicit conversion to NodeTy.
184template <class OptionsT, bool IsConst>
185struct simplify_type<ilist_iterator<OptionsT, false, IsConst>> {
using iterator = ilist_iterator<OptionsT, false, IsConst>;
using SimpleType = typename iterator::pointer;

static SimpleType getSimplifiedValue(const iterator &Node) { return &*Node; }
190};
191template <class OptionsT, bool IsConst>
192struct simplify_type<const ilist_iterator<OptionsT, false, IsConst>>
  : simplify_type<ilist_iterator<OptionsT, false, IsConst>> {};

195} // end namespace llvm

197#endif // LLVM_ADT_ILIST_ITERATOR_H

←

/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h

1//===- llvm/CodeGen/MachineInstr.h - MachineInstr class ---------*- C++ -*-===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// This file contains the declaration of the MachineInstr class, which is the
10// basic representation for all target dependent machine instructions used by
11// the back end.
12//
13//===----------------------------------------------------------------------===//

15#ifndef LLVM_CODEGEN_MACHINEINSTR_H
16#define LLVM_CODEGEN_MACHINEINSTR_H

18#include "llvm/ADT/DenseMapInfo.h"
19#include "llvm/ADT/PointerSumType.h"
20#include "llvm/ADT/ilist.h"
21#include "llvm/ADT/ilist_node.h"
22#include "llvm/ADT/iterator_range.h"
23#include "llvm/CodeGen/MachineMemOperand.h"
24#include "llvm/CodeGen/MachineOperand.h"
25#include "llvm/CodeGen/TargetOpcodes.h"
26#include "llvm/IR/DebugLoc.h"
27#include "llvm/IR/InlineAsm.h"
28#include "llvm/MC/MCInstrDesc.h"
29#include "llvm/MC/MCSymbol.h"
30#include "llvm/Support/ArrayRecycler.h"
31#include "llvm/Support/TrailingObjects.h"
32#include <algorithm>
33#include <cassert>
34#include <cstdint>
35#include <utility>

37namespace llvm {

39class AAResults;
40template <typename T> class ArrayRef;
41class DIExpression;
42class DILocalVariable;
43class MachineBasicBlock;
44class MachineFunction;
45class MachineRegisterInfo;
46class ModuleSlotTracker;
47class raw_ostream;
48template <typename T> class SmallVectorImpl;
49class SmallBitVector;
50class StringRef;
51class TargetInstrInfo;
52class TargetRegisterClass;
53class TargetRegisterInfo;

55//===----------------------------------------------------------------------===//
56/// Representation of each machine instruction.
57///
58/// This class isn't a POD type, but it must have a trivial destructor. When a
59/// MachineFunction is deleted, all the contained MachineInstrs are deallocated
60/// without having their destructor called.
61///
62class MachineInstr
  : public ilist_node_with_parent<MachineInstr, MachineBasicBlock,
                                  ilist_sentinel_tracking<true>> {
65public:
using mmo_iterator = ArrayRef<MachineMemOperand *>::iterator;

/// Flags to specify different kinds of comments to output in
/// assembly code.  These flags carry semantic information not
/// otherwise easily derivable from the IR text.
///
enum CommentFlag {
  ReloadReuse = 0x1,    // higher bits are reserved for target dep comments.
  NoSchedComment = 0x2,
  TAsmComments = 0x4    // Target Asm comments should start from this value.
};

enum MIFlag {
  NoFlags      = 0,
  FrameSetup   = 1 << 0,              // Instruction is used as a part of
                                      // function frame setup code.
  FrameDestroy = 1 << 1,              // Instruction is used as a part of
                                      // function frame destruction code.
  BundledPred  = 1 << 2,              // Instruction has bundled predecessors.
  BundledSucc  = 1 << 3,              // Instruction has bundled successors.
  FmNoNans     = 1 << 4,              // Instruction does not support Fast
                                      // math nan values.
  FmNoInfs     = 1 << 5,              // Instruction does not support Fast
                                      // math infinity values.
  FmNsz        = 1 << 6,              // Instruction is not required to retain
                                      // signed zero values.
  FmArcp       = 1 << 7,              // Instruction supports Fast math
                                      // reciprocal approximations.
  FmContract   = 1 << 8,              // Instruction supports Fast math
                                      // contraction operations like fma.
  FmAfn        = 1 << 9,              // Instruction may map to Fast math
                                      // instrinsic approximation.
  FmReassoc    = 1 << 10,             // Instruction supports Fast math
                                      // reassociation of operand order.
  NoUWrap      = 1 << 11,             // Instruction supports binary operator
                                      // no unsigned wrap.
  NoSWrap      = 1 << 12,             // Instruction supports binary operator
                                      // no signed wrap.
  IsExact      = 1 << 13,             // Instruction supports division is
                                      // known to be exact.
  NoFPExcept   = 1 << 14,             // Instruction does not raise
                                      // floatint-point exceptions.
  NoMerge      = 1 << 15,             // Passes that drop source location info
                                      // (e.g. branch folding) should skip
                                      // this instruction.
};

113private:
const MCInstrDesc *MCID;              // Instruction descriptor.
MachineBasicBlock *Parent = nullptr;  // Pointer to the owning basic block.

// Operands are allocated by an ArrayRecycler.
MachineOperand *Operands = nullptr;   // Pointer to the first operand.
unsigned NumOperands = 0;             // Number of operands on instruction.

uint16_t Flags = 0;                   // Various bits of additional
                                      // information about machine
                                      // instruction.

uint8_t AsmPrinterFlags = 0;          // Various bits of information used by
                                      // the AsmPrinter to emit helpful
                                      // comments.  This is *not* semantic
                                      // information.  Do not use this for
                                      // anything other than to convey comment
                                      // information to AsmPrinter.

// OperandCapacity has uint8_t size, so it should be next to AsmPrinterFlags
// to properly pack.
using OperandCapacity = ArrayRecycler<MachineOperand>::Capacity;
OperandCapacity CapOperands;          // Capacity of the Operands array.

/// Internal implementation detail class that provides out-of-line storage for
/// extra info used by the machine instruction when this info cannot be stored
/// in-line within the instruction itself.
///
/// This has to be defined eagerly due to the implementation constraints of
/// `PointerSumType` where it is used.
class ExtraInfo final
    : TrailingObjects<ExtraInfo, MachineMemOperand *, MCSymbol *, MDNode *> {
public:
  static ExtraInfo *create(BumpPtrAllocator &Allocator,
                           ArrayRef<MachineMemOperand *> MMOs,
                           MCSymbol *PreInstrSymbol = nullptr,
                           MCSymbol *PostInstrSymbol = nullptr,
                           MDNode *HeapAllocMarker = nullptr) {
    bool HasPreInstrSymbol = PreInstrSymbol != nullptr;
    bool HasPostInstrSymbol = PostInstrSymbol != nullptr;
    bool HasHeapAllocMarker = HeapAllocMarker != nullptr;
    auto *Result = new (Allocator.Allocate(
        totalSizeToAlloc<MachineMemOperand *, MCSymbol *, MDNode *>(
            MMOs.size(), HasPreInstrSymbol + HasPostInstrSymbol,
            HasHeapAllocMarker),
        alignof(ExtraInfo)))
        ExtraInfo(MMOs.size(), HasPreInstrSymbol, HasPostInstrSymbol,
                  HasHeapAllocMarker);

    // Copy the actual data into the trailing objects.
    std::copy(MMOs.begin(), MMOs.end(),
              Result->getTrailingObjects<MachineMemOperand *>());

    if (HasPreInstrSymbol)
      Result->getTrailingObjects<MCSymbol *>()[0] = PreInstrSymbol;
    if (HasPostInstrSymbol)
      Result->getTrailingObjects<MCSymbol *>()[HasPreInstrSymbol] =
          PostInstrSymbol;
    if (HasHeapAllocMarker)
      Result->getTrailingObjects<MDNode *>()[0] = HeapAllocMarker;

    return Result;
  }

  ArrayRef<MachineMemOperand *> getMMOs() const {
    return makeArrayRef(getTrailingObjects<MachineMemOperand *>(), NumMMOs);
  }

  MCSymbol *getPreInstrSymbol() const {
    return HasPreInstrSymbol ? getTrailingObjects<MCSymbol *>()[0] : nullptr;
  }

  MCSymbol *getPostInstrSymbol() const {
    return HasPostInstrSymbol
               ? getTrailingObjects<MCSymbol *>()[HasPreInstrSymbol]
               : nullptr;
  }

  MDNode *getHeapAllocMarker() const {
    return HasHeapAllocMarker ? getTrailingObjects<MDNode *>()[0] : nullptr;
  }

private:
  friend TrailingObjects;

  // Description of the extra info, used to interpret the actual optional
  // data appended.
  //
  // Note that this is not terribly space optimized. This leaves a great deal
  // of flexibility to fit more in here later.
  const int NumMMOs;
  const bool HasPreInstrSymbol;
  const bool HasPostInstrSymbol;
  const bool HasHeapAllocMarker;

  // Implement the `TrailingObjects` internal API.
  size_t numTrailingObjects(OverloadToken<MachineMemOperand *>) const {
    return NumMMOs;
  }
  size_t numTrailingObjects(OverloadToken<MCSymbol *>) const {
    return HasPreInstrSymbol + HasPostInstrSymbol;
  }
  size_t numTrailingObjects(OverloadToken<MDNode *>) const {
    return HasHeapAllocMarker;
  }

  // Just a boring constructor to allow us to initialize the sizes. Always use
  // the `create` routine above.
  ExtraInfo(int NumMMOs, bool HasPreInstrSymbol, bool HasPostInstrSymbol,
            bool HasHeapAllocMarker)
      : NumMMOs(NumMMOs), HasPreInstrSymbol(HasPreInstrSymbol),
        HasPostInstrSymbol(HasPostInstrSymbol),
        HasHeapAllocMarker(HasHeapAllocMarker) {}
};

/// Enumeration of the kinds of inline extra info available. It is important
/// that the `MachineMemOperand` inline kind has a tag value of zero to make
/// it accessible as an `ArrayRef`.
enum ExtraInfoInlineKinds {
  EIIK_MMO = 0,
  EIIK_PreInstrSymbol,
  EIIK_PostInstrSymbol,
  EIIK_OutOfLine
};

// We store extra information about the instruction here. The common case is
// expected to be nothing or a single pointer (typically a MMO or a symbol).
// We work to optimize this common case by storing it inline here rather than
// requiring a separate allocation, but we fall back to an allocation when
// multiple pointers are needed.
PointerSumType<ExtraInfoInlineKinds,
               PointerSumTypeMember<EIIK_MMO, MachineMemOperand *>,
               PointerSumTypeMember<EIIK_PreInstrSymbol, MCSymbol *>,
               PointerSumTypeMember<EIIK_PostInstrSymbol, MCSymbol *>,
               PointerSumTypeMember<EIIK_OutOfLine, ExtraInfo *>>
    Info;

DebugLoc debugLoc;                    // Source line information.

/// Unique instruction number. Used by DBG_INSTR_REFs to refer to the values
/// defined by this instruction.
unsigned DebugInstrNum;

// Intrusive list support
friend struct ilist_traits<MachineInstr>;
friend struct ilist_callback_traits<MachineBasicBlock>;
void setParent(MachineBasicBlock *P) { Parent = P; }

/// This constructor creates a copy of the given
/// MachineInstr in the given MachineFunction.
MachineInstr(MachineFunction &, const MachineInstr &);

/// This constructor create a MachineInstr and add the implicit operands.
/// It reserves space for number of operands specified by
/// MCInstrDesc.  An explicit DebugLoc is supplied.
MachineInstr(MachineFunction &, const MCInstrDesc &tid, DebugLoc dl,
             bool NoImp = false);

// MachineInstrs are pool-allocated and owned by MachineFunction.
friend class MachineFunction;

void
dumprImpl(const MachineRegisterInfo &MRI, unsigned Depth, unsigned MaxDepth,
          SmallPtrSetImpl<const MachineInstr *> &AlreadySeenInstrs) const;

278public:
MachineInstr(const MachineInstr &) = delete;
MachineInstr &operator=(const MachineInstr &) = delete;
// Use MachineFunction::DeleteMachineInstr() instead.
~MachineInstr() = delete;

const MachineBasicBlock* getParent() const { return Parent; }
MachineBasicBlock* getParent() { return Parent; }

/// Move the instruction before \p MovePos.
void moveBefore(MachineInstr *MovePos);

/// Return the function that contains the basic block that this instruction
/// belongs to.
///
/// Note: this is undefined behaviour if the instruction does not have a
/// parent.
const MachineFunction *getMF() const;
MachineFunction *getMF() {
  return const_cast<MachineFunction *>(
      static_cast<const MachineInstr *>(this)->getMF());
}

/// Return the asm printer flags bitvector.
uint8_t getAsmPrinterFlags() const { return AsmPrinterFlags; }

/// Clear the AsmPrinter bitvector.
void clearAsmPrinterFlags() { AsmPrinterFlags = 0; }

/// Return whether an AsmPrinter flag is set.
bool getAsmPrinterFlag(CommentFlag Flag) const {
  return AsmPrinterFlags & Flag;
}

/// Set a flag for the AsmPrinter.
void setAsmPrinterFlag(uint8_t Flag) {
  AsmPrinterFlags |= Flag;
}

/// Clear specific AsmPrinter flags.
void clearAsmPrinterFlag(CommentFlag Flag) {
  AsmPrinterFlags &= ~Flag;
}

/// Return the MI flags bitvector.
uint16_t getFlags() const {
  return Flags;
}

/// Return whether an MI flag is set.
bool getFlag(MIFlag Flag) const {
  return Flags & Flag;
}

/// Set a MI flag.
void setFlag(MIFlag Flag) {
  Flags |= (uint16_t)Flag;
}

void setFlags(unsigned flags) {
  // Filter out the automatically maintained flags.
  unsigned Mask = BundledPred | BundledSucc;
  Flags = (Flags & Mask) | (flags & ~Mask);
}

/// clearFlag - Clear a MI flag.
void clearFlag(MIFlag Flag) {
  Flags &= ~((uint16_t)Flag);
}

/// Return true if MI is in a bundle (but not the first MI in a bundle).
///
/// A bundle looks like this before it's finalized:
///   ----------------
///   |      MI      |
///   ----------------
///          |
///   ----------------
///   |      MI    * |
///   ----------------
///          |
///   ----------------
///   |      MI    * |
///   ----------------
/// In this case, the first MI starts a bundle but is not inside a bundle, the
/// next 2 MIs are considered "inside" the bundle.
///
/// After a bundle is finalized, it looks like this:
///   ----------------
///   |    Bundle    |
///   ----------------
///          |
///   ----------------
///   |      MI    * |
///   ----------------
///          |
///   ----------------
///   |      MI    * |
///   ----------------
///          |
///   ----------------
///   |      MI    * |
///   ----------------
/// The first instruction has the special opcode "BUNDLE". It's not "inside"
/// a bundle, but the next three MIs are.
bool isInsideBundle() const {
  return getFlag(BundledPred);
}

/// Return true if this instruction part of a bundle. This is true
/// if either itself or its following instruction is marked "InsideBundle".
bool isBundled() const {
  return isBundledWithPred() || isBundledWithSucc();
}

/// Return true if this instruction is part of a bundle, and it is not the
/// first instruction in the bundle.
bool isBundledWithPred() const { return getFlag(BundledPred); }

/// Return true if this instruction is part of a bundle, and it is not the
/// last instruction in the bundle.
bool isBundledWithSucc() const { return getFlag(BundledSucc); }

/// Bundle this instruction with its predecessor. This can be an unbundled
/// instruction, or it can be the first instruction in a bundle.
void bundleWithPred();

/// Bundle this instruction with its successor. This can be an unbundled
/// instruction, or it can be the last instruction in a bundle.
void bundleWithSucc();

/// Break bundle above this instruction.
void unbundleFromPred();

/// Break bundle below this instruction.
void unbundleFromSucc();

/// Returns the debug location id of this MachineInstr.
const DebugLoc &getDebugLoc() const { return debugLoc; }

/// Return the operand containing the offset to be used if this DBG_VALUE
/// instruction is indirect; will be an invalid register if this value is
/// not indirect, and an immediate with value 0 otherwise.
const MachineOperand &getDebugOffset() const {
  assert(isDebugValue() && "not a DBG_VALUE")((isDebugValue() && "not a DBG_VALUE") ? static_cast<
void> (0) : __assert_fail ("isDebugValue() && \"not a DBG_VALUE\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 422, __PRETTY_FUNCTION__));
  return getOperand(1);
}
MachineOperand &getDebugOffset() {
  assert(isDebugValue() && "not a DBG_VALUE")((isDebugValue() && "not a DBG_VALUE") ? static_cast<
void> (0) : __assert_fail ("isDebugValue() && \"not a DBG_VALUE\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 426, __PRETTY_FUNCTION__));
  return getOperand(1);
}

/// Return the operand for the debug variable referenced by
/// this DBG_VALUE instruction.
const MachineOperand &getDebugVariableOp() const;
MachineOperand &getDebugVariableOp();

/// Return the debug variable referenced by
/// this DBG_VALUE instruction.
const DILocalVariable *getDebugVariable() const;

/// Return the operand for the complex address expression referenced by
/// this DBG_VALUE instruction.
MachineOperand &getDebugExpressionOp();

/// Return the complex address expression referenced by
/// this DBG_VALUE instruction.
const DIExpression *getDebugExpression() const;

/// Return the debug label referenced by
/// this DBG_LABEL instruction.
const DILabel *getDebugLabel() const;

/// Fetch the instruction number of this MachineInstr. If it does not have
/// one already, a new and unique number will be assigned.
unsigned getDebugInstrNum();

/// Examine the instruction number of this MachineInstr. May be zero if
/// it hasn't been assigned a number yet.
unsigned peekDebugInstrNum() const { return DebugInstrNum; }

/// Set instruction number of this MachineInstr. Avoid using unless you're
/// deserializing this information.
void setDebugInstrNum(unsigned Num) { DebugInstrNum = Num; }

/// Emit an error referring to the source location of this instruction.
/// This should only be used for inline assembly that is somehow
/// impossible to compile. Other errors should have been handled much
/// earlier.
///
/// If this method returns, the caller should try to recover from the error.
void emitError(StringRef Msg) const;

/// Returns the target instruction descriptor of this MachineInstr.
const MCInstrDesc &getDesc() const { return *MCID; }

/// Returns the opcode of this MachineInstr.
unsigned getOpcode() const { return MCID->Opcode; }

/// Retuns the total number of operands.
unsigned getNumOperands() const { return NumOperands; }

/// Returns the total number of operands which are debug locations.
unsigned getNumDebugOperands() const {
  return std::distance(debug_operands().begin(), debug_operands().end());
}

const MachineOperand& getOperand(unsigned i) const {
  assert(i < getNumOperands() && "getOperand() out of range!")((i < getNumOperands() && "getOperand() out of range!"
) ? static_cast<void> (0) : __assert_fail ("i < getNumOperands() && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 486, __PRETTY_FUNCTION__));
  return Operands[i];
}
MachineOperand& getOperand(unsigned i) {
  assert(i < getNumOperands() && "getOperand() out of range!")((i < getNumOperands() && "getOperand() out of range!"
) ? static_cast<void> (0) : __assert_fail ("i < getNumOperands() && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 490, __PRETTY_FUNCTION__));
  return Operands[i];
}

MachineOperand &getDebugOperand(unsigned Index) {
  assert(Index < getNumDebugOperands() && "getDebugOperand() out of range!")((Index < getNumDebugOperands() && "getDebugOperand() out of range!"
) ? static_cast<void> (0) : __assert_fail ("Index < getNumDebugOperands() && \"getDebugOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 495, __PRETTY_FUNCTION__));
  return *(debug_operands().begin() + Index);
}
const MachineOperand &getDebugOperand(unsigned Index) const {
  assert(Index < getNumDebugOperands() && "getDebugOperand() out of range!")((Index < getNumDebugOperands() && "getDebugOperand() out of range!"
) ? static_cast<void> (0) : __assert_fail ("Index < getNumDebugOperands() && \"getDebugOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 499, __PRETTY_FUNCTION__));
  return *(debug_operands().begin() + Index);
}

/// Returns a pointer to the operand corresponding to a debug use of Reg, or
/// nullptr if Reg is not used in any debug operand.
const MachineOperand *getDebugOperandForReg(Register Reg) const {
  const MachineOperand *RegOp =
      find_if(debug_operands(), [Reg](const MachineOperand &Op) {
        return Op.isReg() && Op.getReg() == Reg;
      });
  return RegOp == adl_end(debug_operands()) ? nullptr : RegOp;
}
MachineOperand *getDebugOperandForReg(Register Reg) {
  MachineOperand *RegOp =
      find_if(debug_operands(), [Reg](const MachineOperand &Op) {
        return Op.isReg() && Op.getReg() == Reg;
      });
  return RegOp == adl_end(debug_operands()) ? nullptr : RegOp;
}

unsigned getDebugOperandIndex(const MachineOperand *Op) const {
  assert(Op >= adl_begin(debug_operands()) &&((Op >= adl_begin(debug_operands()) && Op <= adl_end
(debug_operands()) && "Expected a debug operand.") ? static_cast
<void> (0) : __assert_fail ("Op >= adl_begin(debug_operands()) && Op <= adl_end(debug_operands()) && \"Expected a debug operand.\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 522, __PRETTY_FUNCTION__))
         Op <= adl_end(debug_operands()) && "Expected a debug operand.")((Op >= adl_begin(debug_operands()) && Op <= adl_end
(debug_operands()) && "Expected a debug operand.") ? static_cast
<void> (0) : __assert_fail ("Op >= adl_begin(debug_operands()) && Op <= adl_end(debug_operands()) && \"Expected a debug operand.\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 522, __PRETTY_FUNCTION__));
  return std::distance(adl_begin(debug_operands()), Op);
}

/// Returns the total number of definitions.
unsigned getNumDefs() const {
  return getNumExplicitDefs() + MCID->getNumImplicitDefs();
}

/// Returns true if the instruction has implicit definition.
bool hasImplicitDef() const {
  for (unsigned I = getNumExplicitOperands(), E = getNumOperands();
    I != E; ++I) {
    const MachineOperand &MO = getOperand(I);
    if (MO.isDef() && MO.isImplicit())
      return true;
  }
  return false;
}

/// Returns the implicit operands number.
unsigned getNumImplicitOperands() const {
  return getNumOperands() - getNumExplicitOperands();
}

/// Return true if operand \p OpIdx is a subregister index.
bool isOperandSubregIdx(unsigned OpIdx) const {
  assert(getOperand(OpIdx).getType() == MachineOperand::MO_Immediate &&((getOperand(OpIdx).getType() == MachineOperand::MO_Immediate
 && "Expected MO_Immediate operand type.") ? static_cast
<void> (0) : __assert_fail ("getOperand(OpIdx).getType() == MachineOperand::MO_Immediate && \"Expected MO_Immediate operand type.\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 550, __PRETTY_FUNCTION__))
         "Expected MO_Immediate operand type.")((getOperand(OpIdx).getType() == MachineOperand::MO_Immediate
 && "Expected MO_Immediate operand type.") ? static_cast
<void> (0) : __assert_fail ("getOperand(OpIdx).getType() == MachineOperand::MO_Immediate && \"Expected MO_Immediate operand type.\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 550, __PRETTY_FUNCTION__));
  if (isExtractSubreg() && OpIdx == 2)
    return true;
  if (isInsertSubreg() && OpIdx == 3)
    return true;
  if (isRegSequence() && OpIdx > 1 && (OpIdx % 2) == 0)
    return true;
  if (isSubregToReg() && OpIdx == 3)
    return true;
  return false;
}

/// Returns the number of non-implicit operands.
unsigned getNumExplicitOperands() const;

/// Returns the number of non-implicit definitions.
unsigned getNumExplicitDefs() const;

/// iterator/begin/end - Iterate over all operands of a machine instruction.
using mop_iterator = MachineOperand *;
using const_mop_iterator = const MachineOperand *;

mop_iterator operands_begin() { return Operands; }
mop_iterator operands_end() { return Operands + NumOperands; }

const_mop_iterator operands_begin() const { return Operands; }
const_mop_iterator operands_end() const { return Operands + NumOperands; }

iterator_range<mop_iterator> operands() {
  return make_range(operands_begin(), operands_end());
}
iterator_range<const_mop_iterator> operands() const {
  return make_range(operands_begin(), operands_end());
}
iterator_range<mop_iterator> explicit_operands() {
  return make_range(operands_begin(),
                    operands_begin() + getNumExplicitOperands());
}
iterator_range<const_mop_iterator> explicit_operands() const {
  return make_range(operands_begin(),
                    operands_begin() + getNumExplicitOperands());
}
iterator_range<mop_iterator> implicit_operands() {
  return make_range(explicit_operands().end(), operands_end());
}
iterator_range<const_mop_iterator> implicit_operands() const {
  return make_range(explicit_operands().end(), operands_end());
}
/// Returns a range over all operands that are used to determine the variable
/// location for this DBG_VALUE instruction.
iterator_range<mop_iterator> debug_operands() {
  assert(isDebugValue() && "Must be a debug value instruction.")((isDebugValue() && "Must be a debug value instruction."
) ? static_cast<void> (0) : __assert_fail ("isDebugValue() && \"Must be a debug value instruction.\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 601, __PRETTY_FUNCTION__));
  return make_range(operands_begin(), operands_begin() + 1);
}
/// \copydoc debug_operands()
iterator_range<const_mop_iterator> debug_operands() const {
  assert(isDebugValue() && "Must be a debug value instruction.")((isDebugValue() && "Must be a debug value instruction."
) ? static_cast<void> (0) : __assert_fail ("isDebugValue() && \"Must be a debug value instruction.\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 606, __PRETTY_FUNCTION__));
  return make_range(operands_begin(), operands_begin() + 1);
}
/// Returns a range over all explicit operands that are register definitions.
/// Implicit definition are not included!
iterator_range<mop_iterator> defs() {
  return make_range(operands_begin(),
                    operands_begin() + getNumExplicitDefs());
}
/// \copydoc defs()
iterator_range<const_mop_iterator> defs() const {
  return make_range(operands_begin(),
                    operands_begin() + getNumExplicitDefs());
}
/// Returns a range that includes all operands that are register uses.
/// This may include unrelated operands which are not register uses.
iterator_range<mop_iterator> uses() {
  return make_range(operands_begin() + getNumExplicitDefs(), operands_end());
}
/// \copydoc uses()
iterator_range<const_mop_iterator> uses() const {
  return make_range(operands_begin() + getNumExplicitDefs(), operands_end());
}
iterator_range<mop_iterator> explicit_uses() {
  return make_range(operands_begin() + getNumExplicitDefs(),
                    operands_begin() + getNumExplicitOperands());
}
iterator_range<const_mop_iterator> explicit_uses() const {
  return make_range(operands_begin() + getNumExplicitDefs(),
                    operands_begin() + getNumExplicitOperands());
}

/// Returns the number of the operand iterator \p I points to.
unsigned getOperandNo(const_mop_iterator I) const {
  return I - operands_begin();
}

/// Access to memory operands of the instruction. If there are none, that does
/// not imply anything about whether the function accesses memory. Instead,
/// the caller must behave conservatively.
ArrayRef<MachineMemOperand *> memoperands() const {
  if (!Info)
    return {};

  if (Info.is<EIIK_MMO>())
    return makeArrayRef(Info.getAddrOfZeroTagPointer(), 1);

  if (ExtraInfo *EI = Info.get<EIIK_OutOfLine>())
    return EI->getMMOs();

  return {};
}

/// Access to memory operands of the instruction.
///
/// If `memoperands_begin() == memoperands_end()`, that does not imply
/// anything about whether the function accesses memory. Instead, the caller
/// must behave conservatively.
mmo_iterator memoperands_begin() const { return memoperands().begin(); }

/// Access to memory operands of the instruction.
///
/// If `memoperands_begin() == memoperands_end()`, that does not imply
/// anything about whether the function accesses memory. Instead, the caller
/// must behave conservatively.
mmo_iterator memoperands_end() const { return memoperands().end(); }

/// Return true if we don't have any memory operands which described the
/// memory access done by this instruction.  If this is true, calling code
/// must be conservative.
bool memoperands_empty() const { return memoperands().empty(); }

/// Return true if this instruction has exactly one MachineMemOperand.
bool hasOneMemOperand() const { return memoperands().size() == 1; }

/// Return the number of memory operands.
unsigned getNumMemOperands() const { return memoperands().size(); }

/// Helper to extract a pre-instruction symbol if one has been added.
MCSymbol *getPreInstrSymbol() const {
  if (!Info)
    return nullptr;
  if (MCSymbol *S = Info.get<EIIK_PreInstrSymbol>())
    return S;
  if (ExtraInfo *EI = Info.get<EIIK_OutOfLine>())
    return EI->getPreInstrSymbol();

  return nullptr;
}

/// Helper to extract a post-instruction symbol if one has been added.
MCSymbol *getPostInstrSymbol() const {
  if (!Info)
    return nullptr;
  if (MCSymbol *S = Info.get<EIIK_PostInstrSymbol>())
    return S;
  if (ExtraInfo *EI = Info.get<EIIK_OutOfLine>())
    return EI->getPostInstrSymbol();

  return nullptr;
}

/// Helper to extract a heap alloc marker if one has been added.
MDNode *getHeapAllocMarker() const {
  if (!Info)
    return nullptr;
  if (ExtraInfo *EI = Info.get<EIIK_OutOfLine>())
    return EI->getHeapAllocMarker();

  return nullptr;
}

/// API for querying MachineInstr properties. They are the same as MCInstrDesc
/// queries but they are bundle aware.

enum QueryType {
  IgnoreBundle,    // Ignore bundles
  AnyInBundle,     // Return true if any instruction in bundle has property
  AllInBundle      // Return true if all instructions in bundle have property
};

/// Return true if the instruction (or in the case of a bundle,
/// the instructions inside the bundle) has the specified property.
/// The first argument is the property being queried.
/// The second argument indicates whether the query should look inside
/// instruction bundles.
bool hasProperty(unsigned MCFlag, QueryType Type = AnyInBundle) const {
  assert(MCFlag < 64 &&((MCFlag < 64 && "MCFlag out of range for bit mask in getFlags/hasPropertyInBundle."
) ? static_cast<void> (0) : __assert_fail ("MCFlag < 64 && \"MCFlag out of range for bit mask in getFlags/hasPropertyInBundle.\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 734, __PRETTY_FUNCTION__))
28
←
'?' condition is true→
         "MCFlag out of range for bit mask in getFlags/hasPropertyInBundle.")((MCFlag < 64 && "MCFlag out of range for bit mask in getFlags/hasPropertyInBundle."
) ? static_cast<void> (0) : __assert_fail ("MCFlag < 64 && \"MCFlag out of range for bit mask in getFlags/hasPropertyInBundle.\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 734, __PRETTY_FUNCTION__));
  // Inline the fast path for unbundled or bundle-internal instructions.
  if (Type28.1
'Type' is not equal to IgnoreBundle
1
'Type' is not equal to IgnoreBundle
1
'Type' is not equal to IgnoreBundle
1
'Type' is not equal to IgnoreBundle
 == IgnoreBundle || !isBundled() || isBundledWithPred())
29
←
Taking true branch→
    return getDesc().getFlags() & (1ULL << MCFlag);
30
←
Returning value, which participates in a condition later→

  // If this is the first instruction in a bundle, take the slow path.
  return hasPropertyInBundle(1ULL << MCFlag, Type);
}

/// Return true if this is an instruction that should go through the usual
/// legalization steps.
bool isPreISelOpcode(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::PreISelOpcode, Type);
}

/// Return true if this instruction can have a variable number of operands.
/// In this case, the variable operands will be after the normal
/// operands but before the implicit definitions and uses (if any are
/// present).
bool isVariadic(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::Variadic, Type);
}

/// Set if this instruction has an optional definition, e.g.
/// ARM instructions which can set condition code if 's' bit is set.
bool hasOptionalDef(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::HasOptionalDef, Type);
}

/// Return true if this is a pseudo instruction that doesn't
/// correspond to a real machine instruction.
bool isPseudo(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::Pseudo, Type);
}

bool isReturn(QueryType Type = AnyInBundle) const {
  return hasProperty(MCID::Return, Type);
}

/// Return true if this is an instruction that marks the end of an EH scope,
/// i.e., a catchpad or a cleanuppad instruction.
bool isEHScopeReturn(QueryType Type = AnyInBundle) const {
  return hasProperty(MCID::EHScopeReturn, Type);
}

bool isCall(QueryType Type = AnyInBundle) const {
  return hasProperty(MCID::Call, Type);
}

/// Return true if this is a call instruction that may have an associated
/// call site entry in the debug info.
bool isCandidateForCallSiteEntry(QueryType Type = IgnoreBundle) const;
/// Return true if copying, moving, or erasing this instruction requires
/// updating Call Site Info (see \ref copyCallSiteInfo, \ref moveCallSiteInfo,
/// \ref eraseCallSiteInfo).
bool shouldUpdateCallSiteInfo() const;

/// Returns true if the specified instruction stops control flow
/// from executing the instruction immediately following it.  Examples include
/// unconditional branches and return instructions.
bool isBarrier(QueryType Type = AnyInBundle) const {
  return hasProperty(MCID::Barrier, Type);
}

/// Returns true if this instruction part of the terminator for a basic block.
/// Typically this is things like return and branch instructions.
///
/// Various passes use this to insert code into the bottom of a basic block,
/// but before control flow occurs.
bool isTerminator(QueryType Type = AnyInBundle) const {
  return hasProperty(MCID::Terminator, Type);
27
←
Calling 'MachineInstr::hasProperty'→
31
←
Returning from 'MachineInstr::hasProperty'→
32
←
Returning value, which participates in a condition later→
}

/// Returns true if this is a conditional, unconditional, or indirect branch.
/// Predicates below can be used to discriminate between
/// these cases, and the TargetInstrInfo::analyzeBranch method can be used to
/// get more information.
bool isBranch(QueryType Type = AnyInBundle) const {
  return hasProperty(MCID::Branch, Type);
}

/// Return true if this is an indirect branch, such as a
/// branch through a register.
bool isIndirectBranch(QueryType Type = AnyInBundle) const {
  return hasProperty(MCID::IndirectBranch, Type);
}

/// Return true if this is a branch which may fall
/// through to the next instruction or may transfer control flow to some other
/// block.  The TargetInstrInfo::analyzeBranch method can be used to get more
/// information about this branch.
bool isConditionalBranch(QueryType Type = AnyInBundle) const {
  return isBranch(Type) && !isBarrier(Type) && !isIndirectBranch(Type);
}

/// Return true if this is a branch which always
/// transfers control flow to some other block.  The
/// TargetInstrInfo::analyzeBranch method can be used to get more information
/// about this branch.
bool isUnconditionalBranch(QueryType Type = AnyInBundle) const {
  return isBranch(Type) && isBarrier(Type) && !isIndirectBranch(Type);
}

/// Return true if this instruction has a predicate operand that
/// controls execution.  It may be set to 'always', or may be set to other
/// values.   There are various methods in TargetInstrInfo that can be used to
/// control and modify the predicate in this instruction.
bool isPredicable(QueryType Type = AllInBundle) const {
  // If it's a bundle than all bundled instructions must be predicable for this
  // to return true.
  return hasProperty(MCID::Predicable, Type);
}

/// Return true if this instruction is a comparison.
bool isCompare(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::Compare, Type);
}

/// Return true if this instruction is a move immediate
/// (including conditional moves) instruction.
bool isMoveImmediate(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::MoveImm, Type);
}

/// Return true if this instruction is a register move.
/// (including moving values from subreg to reg)
bool isMoveReg(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::MoveReg, Type);
}

/// Return true if this instruction is a bitcast instruction.
bool isBitcast(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::Bitcast, Type);
}

/// Return true if this instruction is a select instruction.
bool isSelect(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::Select, Type);
}

/// Return true if this instruction cannot be safely duplicated.
/// For example, if the instruction has a unique labels attached
/// to it, duplicating it would cause multiple definition errors.
bool isNotDuplicable(QueryType Type = AnyInBundle) const {
  return hasProperty(MCID::NotDuplicable, Type);
}

/// Return true if this instruction is convergent.
/// Convergent instructions can not be made control-dependent on any
/// additional values.
bool isConvergent(QueryType Type = AnyInBundle) const {
  if (isInlineAsm()) {
    unsigned ExtraInfo = getOperand(InlineAsm::MIOp_ExtraInfo).getImm();
    if (ExtraInfo & InlineAsm::Extra_IsConvergent)
      return true;
  }
  return hasProperty(MCID::Convergent, Type);
}

/// Returns true if the specified instruction has a delay slot
/// which must be filled by the code generator.
bool hasDelaySlot(QueryType Type = AnyInBundle) const {
  return hasProperty(MCID::DelaySlot, Type);
}

/// Return true for instructions that can be folded as
/// memory operands in other instructions. The most common use for this
/// is instructions that are simple loads from memory that don't modify
/// the loaded value in any way, but it can also be used for instructions
/// that can be expressed as constant-pool loads, such as V_SETALLONES
/// on x86, to allow them to be folded when it is beneficial.
/// This should only be set on instructions that return a value in their
/// only virtual register definition.
bool canFoldAsLoad(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::FoldableAsLoad, Type);
}

/// Return true if this instruction behaves
/// the same way as the generic REG_SEQUENCE instructions.
/// E.g., on ARM,
/// dX VMOVDRR rY, rZ
/// is equivalent to
/// dX = REG_SEQUENCE rY, ssub_0, rZ, ssub_1.
///
/// Note that for the optimizers to be able to take advantage of
/// this property, TargetInstrInfo::getRegSequenceLikeInputs has to be
/// override accordingly.
bool isRegSequenceLike(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::RegSequence, Type);
}

/// Return true if this instruction behaves
/// the same way as the generic EXTRACT_SUBREG instructions.
/// E.g., on ARM,
/// rX, rY VMOVRRD dZ
/// is equivalent to two EXTRACT_SUBREG:
/// rX = EXTRACT_SUBREG dZ, ssub_0
/// rY = EXTRACT_SUBREG dZ, ssub_1
///
/// Note that for the optimizers to be able to take advantage of
/// this property, TargetInstrInfo::getExtractSubregLikeInputs has to be
/// override accordingly.
bool isExtractSubregLike(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::ExtractSubreg, Type);
}

/// Return true if this instruction behaves
/// the same way as the generic INSERT_SUBREG instructions.
/// E.g., on ARM,
/// dX = VSETLNi32 dY, rZ, Imm
/// is equivalent to a INSERT_SUBREG:
/// dX = INSERT_SUBREG dY, rZ, translateImmToSubIdx(Imm)
///
/// Note that for the optimizers to be able to take advantage of
/// this property, TargetInstrInfo::getInsertSubregLikeInputs has to be
/// override accordingly.
bool isInsertSubregLike(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::InsertSubreg, Type);
}

//===--------------------------------------------------------------------===//
// Side Effect Analysis
//===--------------------------------------------------------------------===//

/// Return true if this instruction could possibly read memory.
/// Instructions with this flag set are not necessarily simple load
/// instructions, they may load a value and modify it, for example.
bool mayLoad(QueryType Type = AnyInBundle) const {
  if (isInlineAsm()) {
    unsigned ExtraInfo = getOperand(InlineAsm::MIOp_ExtraInfo).getImm();
    if (ExtraInfo & InlineAsm::Extra_MayLoad)
      return true;
  }
  return hasProperty(MCID::MayLoad, Type);
}

/// Return true if this instruction could possibly modify memory.
/// Instructions with this flag set are not necessarily simple store
/// instructions, they may store a modified value based on their operands, or
/// may not actually modify anything, for example.
bool mayStore(QueryType Type = AnyInBundle) const {
  if (isInlineAsm()) {
    unsigned ExtraInfo = getOperand(InlineAsm::MIOp_ExtraInfo).getImm();
    if (ExtraInfo & InlineAsm::Extra_MayStore)
      return true;
  }
  return hasProperty(MCID::MayStore, Type);
}

/// Return true if this instruction could possibly read or modify memory.
bool mayLoadOrStore(QueryType Type = AnyInBundle) const {
  return mayLoad(Type) || mayStore(Type);
}

/// Return true if this instruction could possibly raise a floating-point
/// exception.  This is the case if the instruction is a floating-point
/// instruction that can in principle raise an exception, as indicated
/// by the MCID::MayRaiseFPException property, *and* at the same time,
/// the instruction is used in a context where we expect floating-point
/// exceptions are not disabled, as indicated by the NoFPExcept MI flag.
bool mayRaiseFPException() const {
  return hasProperty(MCID::MayRaiseFPException) &&
         !getFlag(MachineInstr::MIFlag::NoFPExcept);
}

//===--------------------------------------------------------------------===//
// Flags that indicate whether an instruction can be modified by a method.
//===--------------------------------------------------------------------===//

/// Return true if this may be a 2- or 3-address
/// instruction (of the form "X = op Y, Z, ..."), which produces the same
/// result if Y and Z are exchanged.  If this flag is set, then the
/// TargetInstrInfo::commuteInstruction method may be used to hack on the
/// instruction.
///
/// Note that this flag may be set on instructions that are only commutable
/// sometimes.  In these cases, the call to commuteInstruction will fail.
/// Also note that some instructions require non-trivial modification to
/// commute them.
bool isCommutable(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::Commutable, Type);
}

/// Return true if this is a 2-address instruction
/// which can be changed into a 3-address instruction if needed.  Doing this
/// transformation can be profitable in the register allocator, because it
/// means that the instruction can use a 2-address form if possible, but
/// degrade into a less efficient form if the source and dest register cannot
/// be assigned to the same register.  For example, this allows the x86
/// backend to turn a "shl reg, 3" instruction into an LEA instruction, which
/// is the same speed as the shift but has bigger code size.
///
/// If this returns true, then the target must implement the
/// TargetInstrInfo::convertToThreeAddress method for this instruction, which
/// is allowed to fail if the transformation isn't valid for this specific
/// instruction (e.g. shl reg, 4 on x86).
///
bool isConvertibleTo3Addr(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::ConvertibleTo3Addr, Type);
}

/// Return true if this instruction requires
/// custom insertion support when the DAG scheduler is inserting it into a
/// machine basic block.  If this is true for the instruction, it basically
/// means that it is a pseudo instruction used at SelectionDAG time that is
/// expanded out into magic code by the target when MachineInstrs are formed.
///
/// If this is true, the TargetLoweringInfo::InsertAtEndOfBasicBlock method
/// is used to insert this into the MachineBasicBlock.
bool usesCustomInsertionHook(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::UsesCustomInserter, Type);
}

/// Return true if this instruction requires *adjustment*
/// after instruction selection by calling a target hook. For example, this
/// can be used to fill in ARM 's' optional operand depending on whether
/// the conditional flag register is used.
bool hasPostISelHook(QueryType Type = IgnoreBundle) const {
  return hasProperty(MCID::HasPostISelHook, Type);
}

/// Returns true if this instruction is a candidate for remat.
/// This flag is deprecated, please don't use it anymore.  If this
/// flag is set, the isReallyTriviallyReMaterializable() method is called to
/// verify the instruction is really rematable.
bool isRematerializable(QueryType Type = AllInBundle) const {
  // It's only possible to re-mat a bundle if all bundled instructions are
  // re-materializable.
  return hasProperty(MCID::Rematerializable, Type);
}

/// Returns true if this instruction has the same cost (or less) than a move
/// instruction. This is useful during certain types of optimizations
/// (e.g., remat during two-address conversion or machine licm)
/// where we would like to remat or hoist the instruction, but not if it costs
/// more than moving the instruction into the appropriate register. Note, we
/// are not marking copies from and to the same register class with this flag.
bool isAsCheapAsAMove(QueryType Type = AllInBundle) const {
  // Only returns true for a bundle if all bundled instructions are cheap.
  return hasProperty(MCID::CheapAsAMove, Type);
}

/// Returns true if this instruction source operands
/// have special register allocation requirements that are not captured by the
/// operand register classes. e.g. ARM::STRD's two source registers must be an
/// even / odd pair, ARM::STM registers have to be in ascending order.
/// Post-register allocation passes should not attempt to change allocations
/// for sources of instructions with this flag.
bool hasExtraSrcRegAllocReq(QueryType Type = AnyInBundle) const {
  return hasProperty(MCID::ExtraSrcRegAllocReq, Type);
}

/// Returns true if this instruction def operands
/// have special register allocation requirements that are not captured by the
/// operand register classes. e.g. ARM::LDRD's two def registers must be an
/// even / odd pair, ARM::LDM registers have to be in ascending order.
/// Post-register allocation passes should not attempt to change allocations
/// for definitions of instructions with this flag.
bool hasExtraDefRegAllocReq(QueryType Type = AnyInBundle) const {
  return hasProperty(MCID::ExtraDefRegAllocReq, Type);
}

enum MICheckType {
  CheckDefs,      // Check all operands for equality
  CheckKillDead,  // Check all operands including kill / dead markers
  IgnoreDefs,     // Ignore all definitions
  IgnoreVRegDefs  // Ignore virtual register definitions
};

/// Return true if this instruction is identical to \p Other.
/// Two instructions are identical if they have the same opcode and all their
/// operands are identical (with respect to MachineOperand::isIdenticalTo()).
/// Note that this means liveness related flags (dead, undef, kill) do not
/// affect the notion of identical.
bool isIdenticalTo(const MachineInstr &Other,
                   MICheckType Check = CheckDefs) const;

/// Unlink 'this' from the containing basic block, and return it without
/// deleting it.
///
/// This function can not be used on bundled instructions, use
/// removeFromBundle() to remove individual instructions from a bundle.
MachineInstr *removeFromParent();

/// Unlink this instruction from its basic block and return it without
/// deleting it.
///
/// If the instruction is part of a bundle, the other instructions in the
/// bundle remain bundled.
MachineInstr *removeFromBundle();

/// Unlink 'this' from the containing basic block and delete it.
///
/// If this instruction is the header of a bundle, the whole bundle is erased.
/// This function can not be used for instructions inside a bundle, use
/// eraseFromBundle() to erase individual bundled instructions.
void eraseFromParent();

/// Unlink 'this' from the containing basic block and delete it.
///
/// For all definitions mark their uses in DBG_VALUE nodes
/// as undefined. Otherwise like eraseFromParent().
void eraseFromParentAndMarkDBGValuesForRemoval();

/// Unlink 'this' form its basic block and delete it.
///
/// If the instruction is part of a bundle, the other instructions in the
/// bundle remain bundled.
void eraseFromBundle();

bool isEHLabel() const { return getOpcode() == TargetOpcode::EH_LABEL; }
bool isGCLabel() const { return getOpcode() == TargetOpcode::GC_LABEL; }
bool isAnnotationLabel() const {
  return getOpcode() == TargetOpcode::ANNOTATION_LABEL;
}

/// Returns true if the MachineInstr represents a label.
bool isLabel() const {
  return isEHLabel() || isGCLabel() || isAnnotationLabel();
}

bool isCFIInstruction() const {
  return getOpcode() == TargetOpcode::CFI_INSTRUCTION;
}

// True if the instruction represents a position in the function.
bool isPosition() const { return isLabel() || isCFIInstruction(); }

bool isDebugValue() const { return getOpcode() == TargetOpcode::DBG_VALUE; }
bool isDebugLabel() const { return getOpcode() == TargetOpcode::DBG_LABEL; }
bool isDebugRef() const { return getOpcode() == TargetOpcode::DBG_INSTR_REF; }
bool isDebugInstr() const {
  return isDebugValue() || isDebugLabel() || isDebugRef();
23
←
Returning zero, which participates in a condition later→
}

bool isDebugOffsetImm() const { return getDebugOffset().isImm(); }

/// A DBG_VALUE is indirect iff the location operand is a register and
/// the offset operand is an immediate.
bool isIndirectDebugValue() const {
  return isDebugValue() && getDebugOperand(0).isReg() && isDebugOffsetImm();
}

/// A DBG_VALUE is an entry value iff its debug expression contains the
/// DW_OP_LLVM_entry_value operation.
bool isDebugEntryValue() const;

/// Return true if the instruction is a debug value which describes a part of
/// a variable as unavailable.
bool isUndefDebugValue() const {
  return isDebugValue() && getDebugOperand(0).isReg() &&
         !getDebugOperand(0).getReg().isValid();
}

bool isPHI() const {
  return getOpcode() == TargetOpcode::PHI ||
         getOpcode() == TargetOpcode::G_PHI;
}
bool isKill() const { return getOpcode() == TargetOpcode::KILL; }
bool isImplicitDef() const { return getOpcode()==TargetOpcode::IMPLICIT_DEF; }
bool isInlineAsm() const {
  return getOpcode() == TargetOpcode::INLINEASM ||
         getOpcode() == TargetOpcode::INLINEASM_BR;
}

/// FIXME: Seems like a layering violation that the AsmDialect, which is X86
/// specific, be attached to a generic MachineInstr.
bool isMSInlineAsm() const {
  return isInlineAsm() && getInlineAsmDialect() == InlineAsm::AD_Intel;
}

bool isStackAligningInlineAsm() const;
InlineAsm::AsmDialect getInlineAsmDialect() const;

bool isInsertSubreg() const {
  return getOpcode() == TargetOpcode::INSERT_SUBREG;
}

bool isSubregToReg() const {
  return getOpcode() == TargetOpcode::SUBREG_TO_REG;
}

bool isRegSequence() const {
  return getOpcode() == TargetOpcode::REG_SEQUENCE;
}

bool isBundle() const {
  return getOpcode() == TargetOpcode::BUNDLE;
}

bool isCopy() const {
  return getOpcode() == TargetOpcode::COPY;
}

bool isFullCopy() const {
  return isCopy() && !getOperand(0).getSubReg() && !getOperand(1).getSubReg();
}

bool isExtractSubreg() const {
  return getOpcode() == TargetOpcode::EXTRACT_SUBREG;
}

/// Return true if the instruction behaves like a copy.
/// This does not include native copy instructions.
bool isCopyLike() const {
  return isCopy() || isSubregToReg();
}

/// Return true is the instruction is an identity copy.
bool isIdentityCopy() const {
  return isCopy() && getOperand(0).getReg() == getOperand(1).getReg() &&
    getOperand(0).getSubReg() == getOperand(1).getSubReg();
}

/// Return true if this instruction doesn't produce any output in the form of
/// executable instructions.
bool isMetaInstruction() const {
  switch (getOpcode()) {
  default:
    return false;
  case TargetOpcode::IMPLICIT_DEF:
  case TargetOpcode::KILL:
  case TargetOpcode::CFI_INSTRUCTION:
  case TargetOpcode::EH_LABEL:
  case TargetOpcode::GC_LABEL:
  case TargetOpcode::DBG_VALUE:
  case TargetOpcode::DBG_INSTR_REF:
  case TargetOpcode::DBG_LABEL:
  case TargetOpcode::LIFETIME_START:
  case TargetOpcode::LIFETIME_END:
  case TargetOpcode::PSEUDO_PROBE:
    return true;
  }
}

/// Return true if this is a transient instruction that is either very likely
/// to be eliminated during register allocation (such as copy-like
/// instructions), or if this instruction doesn't have an execution-time cost.
bool isTransient() const {
  switch (getOpcode()) {
  default:
    return isMetaInstruction();
  // Copy-like instructions are usually eliminated during register allocation.
  case TargetOpcode::PHI:
  case TargetOpcode::G_PHI:
  case TargetOpcode::COPY:
  case TargetOpcode::INSERT_SUBREG:
  case TargetOpcode::SUBREG_TO_REG:
  case TargetOpcode::REG_SEQUENCE:
    return true;
  }
}

/// Return the number of instructions inside the MI bundle, excluding the
/// bundle header.
///
/// This is the number of instructions that MachineBasicBlock::iterator
/// skips, 0 for unbundled instructions.
unsigned getBundleSize() const;

/// Return true if the MachineInstr reads the specified register.
/// If TargetRegisterInfo is passed, then it also checks if there
/// is a read of a super-register.
/// This does not count partial redefines of virtual registers as reads:
///   %reg1024:6 = OP.
bool readsRegister(Register Reg,
                   const TargetRegisterInfo *TRI = nullptr) const {
  return findRegisterUseOperandIdx(Reg, false, TRI) != -1;
}

/// Return true if the MachineInstr reads the specified virtual register.
/// Take into account that a partial define is a
/// read-modify-write operation.
bool readsVirtualRegister(Register Reg) const {
  return readsWritesVirtualRegister(Reg).first;
}

/// Return a pair of bools (reads, writes) indicating if this instruction
/// reads or writes Reg. This also considers partial defines.
/// If Ops is not null, all operand indices for Reg are added.
std::pair<bool,bool> readsWritesVirtualRegister(Register Reg,
                              SmallVectorImpl<unsigned> *Ops = nullptr) const;

/// Return true if the MachineInstr kills the specified register.
/// If TargetRegisterInfo is passed, then it also checks if there is
/// a kill of a super-register.
bool killsRegister(Register Reg,
                   const TargetRegisterInfo *TRI = nullptr) const {
  return findRegisterUseOperandIdx(Reg, true, TRI) != -1;
}

/// Return true if the MachineInstr fully defines the specified register.
/// If TargetRegisterInfo is passed, then it also checks
/// if there is a def of a super-register.
/// NOTE: It's ignoring subreg indices on virtual registers.
bool definesRegister(Register Reg,
                     const TargetRegisterInfo *TRI = nullptr) const {
  return findRegisterDefOperandIdx(Reg, false, false, TRI) != -1;
}

/// Return true if the MachineInstr modifies (fully define or partially
/// define) the specified register.
/// NOTE: It's ignoring subreg indices on virtual registers.
bool modifiesRegister(Register Reg,
                      const TargetRegisterInfo *TRI = nullptr) const {
  return findRegisterDefOperandIdx(Reg, false, true, TRI) != -1;
}

/// Returns true if the register is dead in this machine instruction.
/// If TargetRegisterInfo is passed, then it also checks
/// if there is a dead def of a super-register.
bool registerDefIsDead(Register Reg,
                       const TargetRegisterInfo *TRI = nullptr) const {
  return findRegisterDefOperandIdx(Reg, true, false, TRI) != -1;
}

/// Returns true if the MachineInstr has an implicit-use operand of exactly
/// the given register (not considering sub/super-registers).
bool hasRegisterImplicitUseOperand(Register Reg) const;

/// Returns the operand index that is a use of the specific register or -1
/// if it is not found. It further tightens the search criteria to a use
/// that kills the register if isKill is true.
int findRegisterUseOperandIdx(Register Reg, bool isKill = false,
                              const TargetRegisterInfo *TRI = nullptr) const;

/// Wrapper for findRegisterUseOperandIdx, it returns
/// a pointer to the MachineOperand rather than an index.
MachineOperand *findRegisterUseOperand(Register Reg, bool isKill = false,
                                    const TargetRegisterInfo *TRI = nullptr) {
  int Idx = findRegisterUseOperandIdx(Reg, isKill, TRI);
  return (Idx == -1) ? nullptr : &getOperand(Idx);
}

const MachineOperand *findRegisterUseOperand(
  Register Reg, bool isKill = false,
  const TargetRegisterInfo *TRI = nullptr) const {
  return const_cast<MachineInstr *>(this)->
    findRegisterUseOperand(Reg, isKill, TRI);
}

/// Returns the operand index that is a def of the specified register or
/// -1 if it is not found. If isDead is true, defs that are not dead are
/// skipped. If Overlap is true, then it also looks for defs that merely
/// overlap the specified register. If TargetRegisterInfo is non-null,
/// then it also checks if there is a def of a super-register.
/// This may also return a register mask operand when Overlap is true.
int findRegisterDefOperandIdx(Register Reg,
                              bool isDead = false, bool Overlap = false,
                              const TargetRegisterInfo *TRI = nullptr) const;

/// Wrapper for findRegisterDefOperandIdx, it returns
/// a pointer to the MachineOperand rather than an index.
MachineOperand *
findRegisterDefOperand(Register Reg, bool isDead = false,
                       bool Overlap = false,
                       const TargetRegisterInfo *TRI = nullptr) {
  int Idx = findRegisterDefOperandIdx(Reg, isDead, Overlap, TRI);
  return (Idx == -1) ? nullptr : &getOperand(Idx);
}

const MachineOperand *
findRegisterDefOperand(Register Reg, bool isDead = false,
                       bool Overlap = false,
                       const TargetRegisterInfo *TRI = nullptr) const {
  return const_cast<MachineInstr *>(this)->findRegisterDefOperand(
      Reg, isDead, Overlap, TRI);
}

/// Find the index of the first operand in the
/// operand list that is used to represent the predicate. It returns -1 if
/// none is found.
int findFirstPredOperandIdx() const;

/// Find the index of the flag word operand that
/// corresponds to operand OpIdx on an inline asm instruction.  Returns -1 if
/// getOperand(OpIdx) does not belong to an inline asm operand group.
///
/// If GroupNo is not NULL, it will receive the number of the operand group
/// containing OpIdx.
///
/// The flag operand is an immediate that can be decoded with methods like
/// InlineAsm::hasRegClassConstraint().
int findInlineAsmFlagIdx(unsigned OpIdx, unsigned *GroupNo = nullptr) const;

/// Compute the static register class constraint for operand OpIdx.
/// For normal instructions, this is derived from the MCInstrDesc.
/// For inline assembly it is derived from the flag words.
///
/// Returns NULL if the static register class constraint cannot be
/// determined.
const TargetRegisterClass*
getRegClassConstraint(unsigned OpIdx,
                      const TargetInstrInfo *TII,
                      const TargetRegisterInfo *TRI) const;

/// Applies the constraints (def/use) implied by this MI on \p Reg to
/// the given \p CurRC.
/// If \p ExploreBundle is set and MI is part of a bundle, all the
/// instructions inside the bundle will be taken into account. In other words,
/// this method accumulates all the constraints of the operand of this MI and
/// the related bundle if MI is a bundle or inside a bundle.
///
/// Returns the register class that satisfies both \p CurRC and the
/// constraints set by MI. Returns NULL if such a register class does not
/// exist.
///
/// \pre CurRC must not be NULL.
const TargetRegisterClass *getRegClassConstraintEffectForVReg(
    Register Reg, const TargetRegisterClass *CurRC,
    const TargetInstrInfo *TII, const TargetRegisterInfo *TRI,
    bool ExploreBundle = false) const;

/// Applies the constraints (def/use) implied by the \p OpIdx operand
/// to the given \p CurRC.
///
/// Returns the register class that satisfies both \p CurRC and the
/// constraints set by \p OpIdx MI. Returns NULL if such a register class
/// does not exist.
///
/// \pre CurRC must not be NULL.
/// \pre The operand at \p OpIdx must be a register.
const TargetRegisterClass *
getRegClassConstraintEffect(unsigned OpIdx, const TargetRegisterClass *CurRC,
                            const TargetInstrInfo *TII,
                            const TargetRegisterInfo *TRI) const;

/// Add a tie between the register operands at DefIdx and UseIdx.
/// The tie will cause the register allocator to ensure that the two
/// operands are assigned the same physical register.
///
/// Tied operands are managed automatically for explicit operands in the
/// MCInstrDesc. This method is for exceptional cases like inline asm.
void tieOperands(unsigned DefIdx, unsigned UseIdx);

/// Given the index of a tied register operand, find the
/// operand it is tied to. Defs are tied to uses and vice versa. Returns the
/// index of the tied operand which must exist.
unsigned findTiedOperandIdx(unsigned OpIdx) const;

/// Given the index of a register def operand,
/// check if the register def is tied to a source operand, due to either
/// two-address elimination or inline assembly constraints. Returns the
/// first tied use operand index by reference if UseOpIdx is not null.
bool isRegTiedToUseOperand(unsigned DefOpIdx,
                           unsigned *UseOpIdx = nullptr) const {
  const MachineOperand &MO = getOperand(DefOpIdx);
  if (!MO.isReg() || !MO.isDef() || !MO.isTied())
    return false;
  if (UseOpIdx)
    *UseOpIdx = findTiedOperandIdx(DefOpIdx);
  return true;
}

/// Return true if the use operand of the specified index is tied to a def
/// operand. It also returns the def operand index by reference if DefOpIdx
/// is not null.
bool isRegTiedToDefOperand(unsigned UseOpIdx,
                           unsigned *DefOpIdx = nullptr) const {
  const MachineOperand &MO = getOperand(UseOpIdx);
  if (!MO.isReg() || !MO.isUse() || !MO.isTied())
    return false;
  if (DefOpIdx)
    *DefOpIdx = findTiedOperandIdx(UseOpIdx);
  return true;
}

/// Clears kill flags on all operands.
void clearKillInfo();

/// Replace all occurrences of FromReg with ToReg:SubIdx,
/// properly composing subreg indices where necessary.
void substituteRegister(Register FromReg, Register ToReg, unsigned SubIdx,
                        const TargetRegisterInfo &RegInfo);

/// We have determined MI kills a register. Look for the
/// operand that uses it and mark it as IsKill. If AddIfNotFound is true,
/// add a implicit operand if it's not found. Returns true if the operand
/// exists / is added.
bool addRegisterKilled(Register IncomingReg,
                       const TargetRegisterInfo *RegInfo,
                       bool AddIfNotFound = false);

/// Clear all kill flags affecting Reg.  If RegInfo is provided, this includes
/// all aliasing registers.
void clearRegisterKills(Register Reg, const TargetRegisterInfo *RegInfo);

/// We have determined MI defined a register without a use.
/// Look for the operand that defines it and mark it as IsDead. If
/// AddIfNotFound is true, add a implicit operand if it's not found. Returns
/// true if the operand exists / is added.
bool addRegisterDead(Register Reg, const TargetRegisterInfo *RegInfo,
                     bool AddIfNotFound = false);

/// Clear all dead flags on operands defining register @p Reg.
void clearRegisterDeads(Register Reg);

/// Mark all subregister defs of register @p Reg with the undef flag.
/// This function is used when we determined to have a subregister def in an
/// otherwise undefined super register.
void setRegisterDefReadUndef(Register Reg, bool IsUndef = true);

/// We have determined MI defines a register. Make sure there is an operand
/// defining Reg.
void addRegisterDefined(Register Reg,
                        const TargetRegisterInfo *RegInfo = nullptr);

/// Mark every physreg used by this instruction as
/// dead except those in the UsedRegs list.
///
/// On instructions with register mask operands, also add implicit-def
/// operands for all registers in UsedRegs.
void setPhysRegsDeadExcept(ArrayRef<Register> UsedRegs,
                           const TargetRegisterInfo &TRI);

/// Return true if it is safe to move this instruction. If
/// SawStore is set to true, it means that there is a store (or call) between
/// the instruction's location and its intended destination.
bool isSafeToMove(AAResults *AA, bool &SawStore) const;

/// Returns true if this instruction's memory access aliases the memory
/// access of Other.
//
/// Assumes any physical registers used to compute addresses
/// have the same value for both instructions.  Returns false if neither
/// instruction writes to memory.
///
/// @param AA Optional alias analysis, used to compare memory operands.
/// @param Other MachineInstr to check aliasing against.
/// @param UseTBAA Whether to pass TBAA information to alias analysis.
bool mayAlias(AAResults *AA, const MachineInstr &Other, bool UseTBAA) const;

/// Return true if this instruction may have an ordered
/// or volatile memory reference, or if the information describing the memory
/// reference is not available. Return false if it is known to have no
/// ordered or volatile memory references.
bool hasOrderedMemoryRef() const;

/// Return true if this load instruction never traps and points to a memory
/// location whose value doesn't change during the execution of this function.
///
/// Examples include loading a value from the constant pool or from the
/// argument area of a function (if it does not change).  If the instruction
/// does multiple loads, this returns true only if all of the loads are
/// dereferenceable and invariant.
bool isDereferenceableInvariantLoad(AAResults *AA) const;

/// If the specified instruction is a PHI that always merges together the
/// same virtual register, return the register, otherwise return 0.
unsigned isConstantValuePHI() const;

/// Return true if this instruction has side effects that are not modeled
/// by mayLoad / mayStore, etc.
/// For all instructions, the property is encoded in MCInstrDesc::Flags
/// (see MCInstrDesc::hasUnmodeledSideEffects(). The only exception is
/// INLINEASM instruction, in which case the side effect property is encoded
/// in one of its operands (see InlineAsm::Extra_HasSideEffect).
///
bool hasUnmodeledSideEffects() const;

/// Returns true if it is illegal to fold a load across this instruction.
bool isLoadFoldBarrier() const;

/// Return true if all the defs of this instruction are dead.
bool allDefsAreDead() const;

/// Return a valid size if the instruction is a spill instruction.
Optional<unsigned> getSpillSize(const TargetInstrInfo *TII) const;

/// Return a valid size if the instruction is a folded spill instruction.
Optional<unsigned> getFoldedSpillSize(const TargetInstrInfo *TII) const;

/// Return a valid size if the instruction is a restore instruction.
Optional<unsigned> getRestoreSize(const TargetInstrInfo *TII) const;

/// Return a valid size if the instruction is a folded restore instruction.
Optional<unsigned>
getFoldedRestoreSize(const TargetInstrInfo *TII) const;

/// Copy implicit register operands from specified
/// instruction to this instruction.
void copyImplicitOps(MachineFunction &MF, const MachineInstr &MI);

/// Debugging support
/// @{
/// Determine the generic type to be printed (if needed) on uses and defs.
LLT getTypeToPrint(unsigned OpIdx, SmallBitVector &PrintedTypes,
                   const MachineRegisterInfo &MRI) const;

/// Return true when an instruction has tied register that can't be determined
/// by the instruction's descriptor. This is useful for MIR printing, to
/// determine whether we need to print the ties or not.
bool hasComplexRegisterTies() const;

/// Print this MI to \p OS.
/// Don't print information that can be inferred from other instructions if
/// \p IsStandalone is false. It is usually true when only a fragment of the
/// function is printed.
/// Only print the defs and the opcode if \p SkipOpers is true.
/// Otherwise, also print operands if \p SkipDebugLoc is true.
/// Otherwise, also print the debug loc, with a terminating newline.
/// \p TII is used to print the opcode name.  If it's not present, but the
/// MI is in a function, the opcode will be printed using the function's TII.
void print(raw_ostream &OS, bool IsStandalone = true, bool SkipOpers = false,
           bool SkipDebugLoc = false, bool AddNewLine = true,
           const TargetInstrInfo *TII = nullptr) const;
void print(raw_ostream &OS, ModuleSlotTracker &MST, bool IsStandalone = true,
           bool SkipOpers = false, bool SkipDebugLoc = false,
           bool AddNewLine = true,
           const TargetInstrInfo *TII = nullptr) const;
void dump() const;
/// Print on dbgs() the current instruction and the instructions defining its
/// operands and so on until we reach \p MaxDepth.
void dumpr(const MachineRegisterInfo &MRI,
           unsigned MaxDepth = UINT_MAX(2147483647 *2U +1U)) const;
/// @}

//===--------------------------------------------------------------------===//
// Accessors used to build up machine instructions.

/// Add the specified operand to the instruction.  If it is an implicit
/// operand, it is added to the end of the operand list.  If it is an
/// explicit operand it is added at the end of the explicit operand list
/// (before the first implicit operand).
///
/// MF must be the machine function that was used to allocate this
/// instruction.
///
/// MachineInstrBuilder provides a more convenient interface for creating
/// instructions and adding operands.
void addOperand(MachineFunction &MF, const MachineOperand &Op);

/// Add an operand without providing an MF reference. This only works for
/// instructions that are inserted in a basic block.
///
/// MachineInstrBuilder and the two-argument addOperand(MF, MO) should be
/// preferred.
void addOperand(const MachineOperand &Op);

/// Replace the instruction descriptor (thus opcode) of
/// the current instruction with a new one.
void setDesc(const MCInstrDesc &tid) { MCID = &tid; }

/// Replace current source information with new such.
/// Avoid using this, the constructor argument is preferable.
void setDebugLoc(DebugLoc dl) {
  debugLoc = std::move(dl);
  assert(debugLoc.hasTrivialDestructor() && "Expected trivial destructor")((debugLoc.hasTrivialDestructor() && "Expected trivial destructor"
) ? static_cast<void> (0) : __assert_fail ("debugLoc.hasTrivialDestructor() && \"Expected trivial destructor\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 1681, __PRETTY_FUNCTION__));
}

/// Erase an operand from an instruction, leaving it with one
/// fewer operand than it started with.
void RemoveOperand(unsigned OpNo);

/// Clear this MachineInstr's memory reference descriptor list.  This resets
/// the memrefs to their most conservative state.  This should be used only
/// as a last resort since it greatly pessimizes our knowledge of the memory
/// access performed by the instruction.
void dropMemRefs(MachineFunction &MF);

/// Assign this MachineInstr's memory reference descriptor list.
///
/// Unlike other methods, this *will* allocate them into a new array
/// associated with the provided `MachineFunction`.
void setMemRefs(MachineFunction &MF, ArrayRef<MachineMemOperand *> MemRefs);

/// Add a MachineMemOperand to the machine instruction.
/// This function should be used only occasionally. The setMemRefs function
/// is the primary method for setting up a MachineInstr's MemRefs list.
void addMemOperand(MachineFunction &MF, MachineMemOperand *MO);

/// Clone another MachineInstr's memory reference descriptor list and replace
/// ours with it.
///
/// Note that `*this` may be the incoming MI!
///
/// Prefer this API whenever possible as it can avoid allocations in common
/// cases.
void cloneMemRefs(MachineFunction &MF, const MachineInstr &MI);

/// Clone the merge of multiple MachineInstrs' memory reference descriptors
/// list and replace ours with it.
///
/// Note that `*this` may be one of the incoming MIs!
///
/// Prefer this API whenever possible as it can avoid allocations in common
/// cases.
void cloneMergedMemRefs(MachineFunction &MF,
                        ArrayRef<const MachineInstr *> MIs);

/// Set a symbol that will be emitted just prior to the instruction itself.
///
/// Setting this to a null pointer will remove any such symbol.
///
/// FIXME: This is not fully implemented yet.
void setPreInstrSymbol(MachineFunction &MF, MCSymbol *Symbol);

/// Set a symbol that will be emitted just after the instruction itself.
///
/// Setting this to a null pointer will remove any such symbol.
///
/// FIXME: This is not fully implemented yet.
void setPostInstrSymbol(MachineFunction &MF, MCSymbol *Symbol);

/// Clone another MachineInstr's pre- and post- instruction symbols and
/// replace ours with it.
void cloneInstrSymbols(MachineFunction &MF, const MachineInstr &MI);

/// Set a marker on instructions that denotes where we should create and emit
/// heap alloc site labels. This waits until after instruction selection and
/// optimizations to create the label, so it should still work if the
/// instruction is removed or duplicated.
void setHeapAllocMarker(MachineFunction &MF, MDNode *MD);

/// Return the MIFlags which represent both MachineInstrs. This
/// should be used when merging two MachineInstrs into one. This routine does
/// not modify the MIFlags of this MachineInstr.
uint16_t mergeFlagsWith(const MachineInstr& Other) const;

static uint16_t copyFlagsFromInstruction(const Instruction &I);

/// Copy all flags to MachineInst MIFlags
void copyIRFlags(const Instruction &I);

/// Break any tie involving OpIdx.
void untieRegOperand(unsigned OpIdx) {
  MachineOperand &MO = getOperand(OpIdx);
  if (MO.isReg() && MO.isTied()) {
    getOperand(findTiedOperandIdx(OpIdx)).TiedTo = 0;
    MO.TiedTo = 0;
  }
}

/// Add all implicit def and use operands to this instruction.
void addImplicitDefUseOperands(MachineFunction &MF);

/// Scan instructions immediately following MI and collect any matching
/// DBG_VALUEs.
void collectDebugValues(SmallVectorImpl<MachineInstr *> &DbgValues);

/// Find all DBG_VALUEs that point to the register def in this instruction
/// and point them to \p Reg instead.
void changeDebugValuesDefReg(Register Reg);

/// Returns the Intrinsic::ID for this instruction.
/// \pre Must have an intrinsic ID operand.
unsigned getIntrinsicID() const {
  return getOperand(getNumExplicitDefs()).getIntrinsicID();
}

/// Sets all register debug operands in this debug value instruction to be
/// undef.
void setDebugValueUndef() {
  assert(isDebugValue() && "Must be a debug value instruction.")((isDebugValue() && "Must be a debug value instruction."
) ? static_cast<void> (0) : __assert_fail ("isDebugValue() && \"Must be a debug value instruction.\""
, "/build/llvm-toolchain-snapshot-12~++20201216100621+e7280248087/llvm/include/llvm/CodeGen/MachineInstr.h"
, 1787, __PRETTY_FUNCTION__));
  for (MachineOperand &MO : debug_operands()) {
    if (MO.isReg()) {
      MO.setReg(0);
      MO.setSubReg(0);
    }
  }
}

1796private:
/// If this instruction is embedded into a MachineFunction, return the
/// MachineRegisterInfo object for the current function, otherwise
/// return null.
MachineRegisterInfo *getRegInfo();

/// Unlink all of the register operands in this instruction from their
/// respective use lists.  This requires that the operands already be on their
/// use lists.
void RemoveRegOperandsFromUseLists(MachineRegisterInfo&);

/// Add all of the register operands in this instruction from their
/// respective use lists.  This requires that the operands not be on their
/// use lists yet.
void AddRegOperandsToUseLists(MachineRegisterInfo&);

/// Slow path for hasProperty when we're dealing with a bundle.
bool hasPropertyInBundle(uint64_t Mask, QueryType Type) const;

/// Implements the logic of getRegClassConstraintEffectForVReg for the
/// this MI and the given operand index \p OpIdx.
/// If the related operand does not constrained Reg, this returns CurRC.
const TargetRegisterClass *getRegClassConstraintEffectForVRegImpl(
    unsigned OpIdx, Register Reg, const TargetRegisterClass *CurRC,
    const TargetInstrInfo *TII, const TargetRegisterInfo *TRI) const;

/// Stores extra instruction information inline or allocates as ExtraInfo
/// based on the number of pointers.
void setExtraInfo(MachineFunction &MF, ArrayRef<MachineMemOperand *> MMOs,
                  MCSymbol *PreInstrSymbol, MCSymbol *PostInstrSymbol,
                  MDNode *HeapAllocMarker);
1827};

1829/// Special DenseMapInfo traits to compare MachineInstr* by *value* of the
1830/// instruction rather than by pointer value.
1831/// The hashing and equality testing functions ignore definitions so this is
1832/// useful for CSE, etc.
1833struct MachineInstrExpressionTrait : DenseMapInfo<MachineInstr*> {
static inline MachineInstr *getEmptyKey() {
  return nullptr;
}

static inline MachineInstr *getTombstoneKey() {
  return reinterpret_cast<MachineInstr*>(-1);
}

static unsigned getHashValue(const MachineInstr* const &MI);

static bool isEqual(const MachineInstr* const &LHS,
                    const MachineInstr* const &RHS) {
  if (RHS == getEmptyKey() || RHS == getTombstoneKey() ||
      LHS == getEmptyKey() || LHS == getTombstoneKey())
    return LHS == RHS;
  return LHS->isIdenticalTo(*RHS, MachineInstr::IgnoreVRegDefs);
}
1851};

1853//===----------------------------------------------------------------------===//
1854// Debugging Support

1856inline raw_ostream& operator<<(raw_ostream &OS, const MachineInstr &MI) {
MI.print(OS);
return OS;
1859}

1861} // end namespace llvm

1863#endif // LLVM_CODEGEN_MACHINEINSTR_H