File Manager

003 File Manager

Current Path: /usr/src/contrib/llvm-project/llvm/include/llvm/IR

usr / src / contrib / llvm-project / llvm / include / llvm / IR /

📁 ..
📄 AbstractCallSite.h(9.5 KB)
📄 Argument.h(5.03 KB)
📄 AssemblyAnnotationWriter.h(2.2 KB)
📄 Attributes.h(35.5 KB)
📄 Attributes.td(8.96 KB)
📄 AutoUpgrade.h(3.96 KB)
📄 BasicBlock.h(21.91 KB)
📄 CFG.h(13.84 KB)
📄 CallingConv.h(9.27 KB)
📄 Comdat.h(2.16 KB)
📄 Constant.h(8.33 KB)
📄 ConstantFolder.h(10.01 KB)
📄 ConstantRange.h(21.6 KB)
📄 Constants.h(53.03 KB)
📄 ConstrainedOps.def(5.4 KB)
📄 DIBuilder.h(44.36 KB)
📄 DataLayout.h(24.11 KB)
📄 DebugInfo.h(5.42 KB)
📄 DebugInfoFlags.def(3.62 KB)
📄 DebugInfoMetadata.h(132.91 KB)
📄 DebugLoc.h(4.57 KB)
📄 DerivedTypes.h(26.81 KB)
📄 DerivedUser.h(1.32 KB)
📄 DiagnosticHandler.h(2.89 KB)
📄 DiagnosticInfo.h(41.02 KB)
📄 DiagnosticPrinter.h(3.46 KB)
📄 Dominators.h(9.94 KB)
📄 FPEnv.h(1.97 KB)
📄 FixedMetadataKinds.def(2.05 KB)
📄 Function.h(31.39 KB)
📄 GVMaterializer.h(1.45 KB)
📄 GetElementPtrTypeIterator.h(5.54 KB)
📄 GlobalAlias.h(3.16 KB)
📄 GlobalIFunc.h(2.51 KB)
📄 GlobalIndirectSymbol.h(3.11 KB)
📄 GlobalObject.h(7.39 KB)
📄 GlobalValue.h(21.2 KB)
📄 GlobalVariable.h(9.6 KB)
📄 IRBuilder.h(105.58 KB)
📄 IRBuilderFolder.h(7.1 KB)
📄 IRPrintingPasses.h(3.57 KB)
📄 InlineAsm.h(15.84 KB)
📄 InstIterator.h(5.06 KB)
📄 InstVisitor.h(13.95 KB)
📄 InstrTypes.h(86.25 KB)
📄 Instruction.def(8.53 KB)
📄 Instruction.h(30.74 KB)
📄 Instructions.h(195.68 KB)
📄 IntrinsicInst.h(29.03 KB)
📄 Intrinsics.h(8.21 KB)
📄 Intrinsics.td(78.88 KB)
📄 IntrinsicsAArch64.td(100.59 KB)
📄 IntrinsicsAMDGPU.td(80.43 KB)
📄 IntrinsicsARM.td(65.15 KB)
📄 IntrinsicsBPF.td(1.54 KB)
📄 IntrinsicsHexagon.td(11.53 KB)
📄 IntrinsicsHexagonDep.td(197.38 KB)
📄 IntrinsicsMips.td(94.94 KB)
📄 IntrinsicsNVVM.td(193.97 KB)
📄 IntrinsicsPowerPC.td(68.23 KB)
📄 IntrinsicsRISCV.td(3.24 KB)
📄 IntrinsicsSystemZ.td(18.56 KB)
📄 IntrinsicsWebAssembly.td(9.38 KB)
📄 IntrinsicsX86.td(242.99 KB)
📄 IntrinsicsXCore.td(6.83 KB)
📄 LLVMContext.h(14.18 KB)
📄 LLVMRemarkStreamer.h(3.36 KB)
📄 LegacyPassManager.h(3.11 KB)
📄 LegacyPassManagers.h(18.17 KB)
📄 LegacyPassNameParser.h(3.73 KB)
📄 MDBuilder.h(8.65 KB)
📄 Mangler.h(2.06 KB)
📄 MatrixBuilder.h(8.81 KB)
📄 Metadata.def(5.07 KB)
📄 Metadata.h(45.24 KB)
📄 Module.h(34.6 KB)
📄 ModuleSlotTracker.h(2.56 KB)
📄 ModuleSummaryIndex.h(58.12 KB)
📄 ModuleSummaryIndexYAML.h(10.93 KB)
📄 NoFolder.h(11.32 KB)
📄 OperandTraits.h(5.78 KB)
📄 Operator.h(19.58 KB)
📄 OptBisect.h(2.79 KB)
📄 PassInstrumentation.h(8.05 KB)
📄 PassManager.h(54.18 KB)
📄 PassManagerImpl.h(5.76 KB)
📄 PassManagerInternal.h(11.9 KB)
📄 PassTimingInfo.h(3.65 KB)
📄 PatternMatch.h(73.41 KB)
📄 PredIteratorCache.h(2.59 KB)
📄 ProfileSummary.h(4.34 KB)
📄 RuntimeLibcalls.def(24.52 KB)
📄 SafepointIRVerifier.h(1.63 KB)
📄 Statepoint.h(13.61 KB)
📄 SymbolTableListTraits.h(4.45 KB)
📄 TrackingMDRef.h(4.5 KB)
📄 Type.h(18.98 KB)
📄 TypeFinder.h(2.57 KB)
📄 Use.h(3.75 KB)
📄 UseListOrder.h(1.18 KB)
📄 User.h(11.75 KB)
📄 VPIntrinsics.def(2.34 KB)
📄 Value.def(3.62 KB)
📄 Value.h(32.16 KB)
📄 ValueHandle.h(18.11 KB)
📄 ValueMap.h(14.09 KB)
📄 ValueSymbolTable.h(4.22 KB)
📄 Verifier.h(5.47 KB)

Editing: Dominators.h

//===- Dominators.h - Dominator Info Calculation ----------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// This file defines the DominatorTree class, which provides fast and efficient
// dominance queries.
//
//===----------------------------------------------------------------------===//

#ifndef LLVM_IR_DOMINATORS_H
#define LLVM_IR_DOMINATORS_H

#include "llvm/ADT/DenseMapInfo.h"
#include "llvm/ADT/DepthFirstIterator.h"
#include "llvm/ADT/GraphTraits.h"
#include "llvm/ADT/Hashing.h"
#include "llvm/IR/BasicBlock.h"
#include "llvm/IR/CFG.h"
#include "llvm/IR/PassManager.h"
#include "llvm/Pass.h"
#include "llvm/Support/GenericDomTree.h"
#include <utility>

namespace llvm {

class Function;
class Instruction;
class Module;
class raw_ostream;

extern template class DomTreeNodeBase<BasicBlock>;
extern template class DominatorTreeBase<BasicBlock, false>; // DomTree
extern template class DominatorTreeBase<BasicBlock, true>; // PostDomTree

extern template class cfg::Update<BasicBlock *>;

namespace DomTreeBuilder {
using BBDomTree = DomTreeBase<BasicBlock>;
using BBPostDomTree = PostDomTreeBase<BasicBlock>;

using BBUpdates = ArrayRef<llvm::cfg::Update<BasicBlock *>>;

extern template void Calculate<BBDomTree>(BBDomTree &DT);
extern template void CalculateWithUpdates<BBDomTree>(BBDomTree &DT,
                                                     BBUpdates U);

extern template void Calculate<BBPostDomTree>(BBPostDomTree &DT);

extern template void InsertEdge<BBDomTree>(BBDomTree &DT, BasicBlock *From,
                                           BasicBlock *To);
extern template void InsertEdge<BBPostDomTree>(BBPostDomTree &DT,
                                               BasicBlock *From,
                                               BasicBlock *To);

extern template void DeleteEdge<BBDomTree>(BBDomTree &DT, BasicBlock *From,
                                           BasicBlock *To);
extern template void DeleteEdge<BBPostDomTree>(BBPostDomTree &DT,
                                               BasicBlock *From,
                                               BasicBlock *To);

extern template void ApplyUpdates<BBDomTree>(BBDomTree &DT, BBUpdates);
extern template void ApplyUpdates<BBPostDomTree>(BBPostDomTree &DT, BBUpdates);

extern template bool Verify<BBDomTree>(const BBDomTree &DT,
                                       BBDomTree::VerificationLevel VL);
extern template bool Verify<BBPostDomTree>(const BBPostDomTree &DT,
                                           BBPostDomTree::VerificationLevel VL);
}  // namespace DomTreeBuilder

using DomTreeNode = DomTreeNodeBase<BasicBlock>;

class BasicBlockEdge {
  const BasicBlock *Start;
  const BasicBlock *End;

public:
  BasicBlockEdge(const BasicBlock *Start_, const BasicBlock *End_) :
    Start(Start_), End(End_) {}

BasicBlockEdge(const std::pair<BasicBlock *, BasicBlock *> &Pair)
      : Start(Pair.first), End(Pair.second) {}

BasicBlockEdge(const std::pair<const BasicBlock *, const BasicBlock *> &Pair)
      : Start(Pair.first), End(Pair.second) {}

const BasicBlock *getStart() const {
    return Start;
  }

const BasicBlock *getEnd() const {
    return End;
  }

/// Check if this is the only edge between Start and End.
  bool isSingleEdge() const;
};

template <> struct DenseMapInfo<BasicBlockEdge> {
  using BBInfo = DenseMapInfo<const BasicBlock *>;

static unsigned getHashValue(const BasicBlockEdge *V);

static inline BasicBlockEdge getEmptyKey() {
    return BasicBlockEdge(BBInfo::getEmptyKey(), BBInfo::getEmptyKey());
  }

static inline BasicBlockEdge getTombstoneKey() {
    return BasicBlockEdge(BBInfo::getTombstoneKey(), BBInfo::getTombstoneKey());
  }

static unsigned getHashValue(const BasicBlockEdge &Edge) {
    return hash_combine(BBInfo::getHashValue(Edge.getStart()),
                        BBInfo::getHashValue(Edge.getEnd()));
  }

static bool isEqual(const BasicBlockEdge &LHS, const BasicBlockEdge &RHS) {
    return BBInfo::isEqual(LHS.getStart(), RHS.getStart()) &&
           BBInfo::isEqual(LHS.getEnd(), RHS.getEnd());
  }
};

/// Concrete subclass of DominatorTreeBase that is used to compute a
/// normal dominator tree.
///
/// Definition: A block is said to be forward statically reachable if there is
/// a path from the entry of the function to the block.  A statically reachable
/// block may become statically unreachable during optimization.
///
/// A forward unreachable block may appear in the dominator tree, or it may
/// not.  If it does, dominance queries will return results as if all reachable
/// blocks dominate it.  When asking for a Node corresponding to a potentially
/// unreachable block, calling code must handle the case where the block was
/// unreachable and the result of getNode() is nullptr.
///
/// Generally, a block known to be unreachable when the dominator tree is
/// constructed will not be in the tree.  One which becomes unreachable after
/// the dominator tree is initially constructed may still exist in the tree,
/// even if the tree is properly updated. Calling code should not rely on the
/// preceding statements; this is stated only to assist human understanding.
class DominatorTree : public DominatorTreeBase<BasicBlock, false> {
 public:
  using Base = DominatorTreeBase<BasicBlock, false>;

DominatorTree() = default;
  explicit DominatorTree(Function &F) { recalculate(F); }
  explicit DominatorTree(DominatorTree &DT, DomTreeBuilder::BBUpdates U) {
    recalculate(*DT.Parent, U);
  }

/// Handle invalidation explicitly.
  bool invalidate(Function &F, const PreservedAnalyses &PA,
                  FunctionAnalysisManager::Invalidator &);

// Ensure base-class overloads are visible.
  using Base::dominates;

/// Return true if Def dominates a use in User.
  ///
  /// This performs the special checks necessary if Def and User are in the same
  /// basic block. Note that Def doesn't dominate a use in Def itself!
  bool dominates(const Instruction *Def, const Use &U) const;
  bool dominates(const Instruction *Def, const Instruction *User) const;
  bool dominates(const Instruction *Def, const BasicBlock *BB) const;

/// Return true if an edge dominates a use.
  ///
  /// If BBE is not a unique edge between start and end of the edge, it can
  /// never dominate the use.
  bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
  bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /// Returns true if edge \p BBE1 dominates edge \p BBE2.
  bool dominates(const BasicBlockEdge &BBE1, const BasicBlockEdge &BBE2) const;

// Ensure base class overloads are visible.
  using Base::isReachableFromEntry;

/// Provide an overload for a Use.
  bool isReachableFromEntry(const Use &U) const;

// Pop up a GraphViz/gv window with the Dominator Tree rendered using `dot`.
  void viewGraph(const Twine &Name, const Twine &Title);
  void viewGraph();
};

//===-------------------------------------
// DominatorTree GraphTraits specializations so the DominatorTree can be
// iterable by generic graph iterators.

template <class Node, class ChildIterator> struct DomTreeGraphTraitsBase {
  using NodeRef = Node *;
  using ChildIteratorType = ChildIterator;
  using nodes_iterator = df_iterator<Node *, df_iterator_default_set<Node*>>;

static NodeRef getEntryNode(NodeRef N) { return N; }
  static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
  static ChildIteratorType child_end(NodeRef N) { return N->end(); }

static nodes_iterator nodes_begin(NodeRef N) {
    return df_begin(getEntryNode(N));
  }

static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
};

template <>
struct GraphTraits<DomTreeNode *>
    : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::const_iterator> {
};

template <>
struct GraphTraits<const DomTreeNode *>
    : public DomTreeGraphTraitsBase<const DomTreeNode,
                                    DomTreeNode::const_iterator> {};

template <> struct GraphTraits<DominatorTree*>
  : public GraphTraits<DomTreeNode*> {
  static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }

static nodes_iterator nodes_begin(DominatorTree *N) {
    return df_begin(getEntryNode(N));
  }

static nodes_iterator nodes_end(DominatorTree *N) {
    return df_end(getEntryNode(N));
  }
};

/// Analysis pass which computes a \c DominatorTree.
class DominatorTreeAnalysis : public AnalysisInfoMixin<DominatorTreeAnalysis> {
  friend AnalysisInfoMixin<DominatorTreeAnalysis>;
  static AnalysisKey Key;

public:
  /// Provide the result typedef for this analysis pass.
  using Result = DominatorTree;

/// Run the analysis pass over a function and produce a dominator tree.
  DominatorTree run(Function &F, FunctionAnalysisManager &);
};

/// Printer pass for the \c DominatorTree.
class DominatorTreePrinterPass
    : public PassInfoMixin<DominatorTreePrinterPass> {
  raw_ostream &OS;

public:
  explicit DominatorTreePrinterPass(raw_ostream &OS);

PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM);
};

/// Verifier pass for the \c DominatorTree.
struct DominatorTreeVerifierPass : PassInfoMixin<DominatorTreeVerifierPass> {
  PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM);
};

/// Legacy analysis pass which computes a \c DominatorTree.
class DominatorTreeWrapperPass : public FunctionPass {
  DominatorTree DT;

public:
  static char ID;

DominatorTreeWrapperPass();

DominatorTree &getDomTree() { return DT; }
  const DominatorTree &getDomTree() const { return DT; }

bool runOnFunction(Function &F) override;

void verifyAnalysis() const override;

void getAnalysisUsage(AnalysisUsage &AU) const override {
    AU.setPreservesAll();
  }

void releaseMemory() override { DT.reset(); }

void print(raw_ostream &OS, const Module *M = nullptr) const override;
};
} // end namespace llvm

#endif // LLVM_IR_DOMINATORS_H

003 File Manager

Editing: Dominators.h

Upload File

Create Folder