/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/ExecutionEngine/JITLink/ |
H A D | MachO_arm64.h | 23 enum MachOARM64RelocationKind : Edge::Kind { 24 Branch26 = Edge::FirstRelocation, 64 const char *getMachOARM64RelocationKindName(Edge::Kind R);
|
H A D | ELF_x86_64.h | 22 enum ELFX86RelocationKind : Edge::Kind { 23 Branch32 = Edge::FirstRelocation, 64 const char *getELFX86RelocationKindName(Edge::Kind R);
|
H A D | x86_64.h | 25 enum EdgeKind_x86_64 : Edge::Kind { 32 Pointer64 = Edge::FirstRelocation, 247 const char *getEdgeKindName(Edge::Kind K); 261 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E,
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/JITLink/ |
H A D | EHFrameSupportImpl.h | 44 Edge::Kind Delta64, Edge::Kind Delta32, 45 Edge::Kind NegDelta32); 67 EdgeTarget(const Edge &E) : Target(&E.getTarget()), Addend(E.getAddend()) {} 70 Edge::AddendT Addend = 0; 73 using BlockEdgeMap = DenseMap<Edge::OffsetT, EdgeTarget>; 105 Expected<std::pair<JITTargetAddress, Edge::Kind>> 114 Edge::Kind Delta64; 115 Edge::Kind Delta32; 116 Edge [all...] |
H A D | x86_64.cpp | 21 const char *getEdgeKindName(Edge::Kind K) { 52 return getGenericEdgeKindName(static_cast<Edge::Kind>(K));
|
H A D | JITLink.cpp | 60 const char *getGenericEdgeKindName(Edge::Kind K) { 62 case Edge::Invalid: 64 case Edge::KeepAlive: 115 void printEdge(raw_ostream &OS, const Block &B, const Edge &E, 280 std::vector<Edge> SortedEdges; 282 llvm::sort(SortedEdges, [](const Edge &LHS, const Edge &RHS) { 359 const Edge &E) {
|
H A D | MachO_x86_64.cpp | 116 using PairRelocInfo = std::tuple<Edge::Kind, Symbol *, uint64_t>; 178 Edge::Kind DeltaKind; 278 Edge::Kind Kind = Edge::Invalid; 402 Edge GE(Kind, FixupAddress - BlockToFix->getAddress(), *TargetSymbol, 424 bool isGOTEdgeToFix(Edge &E) const { 434 void fixGOTEdge(Edge &E, Symbol &GOTEntry) { 450 bool isExternalBranchEdge(Edge &E) { 459 void fixPLTEdge(Edge &E, Symbol &Stub) { 580 Error applyFixup(LinkGraph &G, Block &B, const Edge [all...] |
H A D | MachO_arm64.cpp | 102 parsePairRelocation(Block &BlockToFix, Edge::Kind SubtractorKind, 392 Edge GE(*Kind, FixupAddress - BlockToFix->getAddress(), *TargetSymbol, 415 bool isGOTEdgeToFix(Edge &E) const { 428 void fixGOTEdge(Edge &E, Symbol &GOTEntry) { 439 bool isExternalBranchEdge(Edge &E) { 452 void fixPLTEdge(Edge &E, Symbol &Stub) { 529 Error applyFixup(LinkGraph &G, Block &B, const Edge &E, 699 const char *getMachOARM64RelocationKindName(Edge::Kind R) { 730 return getGenericEdgeKindName(static_cast<Edge::Kind>(R));
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
H A D | MachineDominators.cpp | 101 for (CriticalEdge &Edge : CriticalEdgesToSplit) { 103 MachineBasicBlock *Succ = Edge.ToBB; 107 if (PredBB == Edge.NewBB) 137 for (CriticalEdge &Edge : CriticalEdgesToSplit) { 139 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); 145 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode);
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/LTO/ |
H A D | SummaryBasedOptimizations.cpp | 53 auto GetCallSiteRelFreq = [](FunctionSummary::EdgeTy &Edge) { 54 return Scaled64(Edge.second.RelBlockFreq, -CalleeInfo::ScaleShift); 76 auto GetProfileCount = [&](ValueInfo V, FunctionSummary::EdgeTy &Edge) { 77 auto RelFreq = GetCallSiteRelFreq(Edge);
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
H A D | MaximumSpanningTree.h | 29 typedef std::pair<const T*, const T*> Edge; typedef in class:llvm::MaximumSpanningTree 30 typedef std::pair<Edge, double> EdgeWeight; 33 typedef std::vector<Edge> MaxSpanTree; 78 Edge e = (*EWi).first; 87 Edge e = (*EWi).first;
|
H A D | CFGMST.h | 39 template <class Edge, class BBInfo> class CFGMST { 45 std::vector<std::unique_ptr<Edge>> AllEdges; 101 LLVM_DEBUG(dbgs() << "Build Edge on " << F.getName() << "\n"); 108 Edge *EntryIncoming = nullptr, *EntryOutgoing = nullptr, 114 LLVM_DEBUG(dbgs() << " Edge: from fake node to " << Entry->getName() 147 LLVM_DEBUG(dbgs() << " Edge: from " << BB.getName() << " to " 168 Edge *ExitO = &addEdge(&BB, nullptr, BBWeight); 173 LLVM_DEBUG(dbgs() << " Edge: from " << BB.getName() << " to fake exit" 205 llvm::stable_sort(AllEdges, [](const std::unique_ptr<Edge> &Edge1, 206 const std::unique_ptr<Edge> [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 47 class Edge { class in class:llvm::ImmutableGraph 62 const Edge *Edges; 68 const Edge *edges_begin() const { return Edges; } 73 const Edge *edges_end() const { return (this + 1)->Edges; } 74 ArrayRef<Edge> edges() const { 80 ImmutableGraph(std::unique_ptr<Node[]> Nodes, std::unique_ptr<Edge[]> Edges, 94 ArrayRef<Edge> edges() const { return makeArrayRef(Edges.get(), EdgesSize); } 95 const Edge *edges_begin() const { return edges().begin(); } 96 const Edge *edges_end() const { return edges().end(); } 105 // Edge [all...] |
H A D | X86LoadValueInjectionLoadHardening.cpp | 121 using Edge = typename GraphT::Edge; 124 std::unique_ptr<Edge[]> Edges, size_type NodesSize, 128 static inline bool isCFGEdge(const Edge &E) { 131 static inline bool isGadgetEdge(const Edge &E) { 152 using Edge = MachineGadgetGraph::Edge; 548 for (const Edge &E : G.edges()) { 553 for (const Edge &DE : Dest->edges()) 572 for (const Edge [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
H A D | DDGPrinter.h | 77 const DDGEdge *Edge, 83 const DDGEdge *Edge,
|
H A D | LazyCallGraph.h | 133 class Edge { class in class:llvm::LazyCallGraph 138 Edge(); 139 explicit Edge(Node &N, Kind K); 189 using VectorT = SmallVector<Edge, 4>; 190 using VectorImplT = SmallVectorImpl<Edge>; 259 Edge &operator[](Node &N) { 266 Edge *lookup(Node &N) { 298 void insertEdgeInternal(Node &ChildN, Edge::Kind EK); 301 void setEdgeKind(Node &ChildN, Edge::Kind EK); 747 void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge 1229 inline LazyCallGraph::Edge::Edge() : Value() {} function in class:llvm::LazyCallGraph::LazyCallGraph::Edge 1230 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} function in class:llvm::LazyCallGraph::LazyCallGraph::Edge [all...] |
H A D | BranchProbabilityInfo.h | 324 using Edge = std::pair<const BasicBlock *, unsigned>; 326 DenseMap<Edge, BranchProbability> Probs; 350 bool isLoopEnteringEdge(const LoopEdge &Edge) const; 354 bool isLoopExitingEdge(const LoopEdge &Edge) const; 355 /// Returns true if \p Edge is either enters to or exits from some loop, false 357 bool isLoopEnteringExitingEdge(const LoopEdge &Edge) const; 360 bool isLoopBackEdge(const LoopEdge &Edge) const; 376 /// Return estimated weight for \p Edge. Returns None if estimated weight is 378 Optional<uint32_t> getEstimatedEdgeWeight(const LoopEdge &Edge) const;
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Analysis/ |
H A D | DDGPrinter.cpp | 130 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { 133 DDGEdge::EdgeKind Kind = Edge->getKind(); 139 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { 142 DDGEdge::EdgeKind Kind = Edge->getKind(); 145 OS << G->getDependenceString(*Src, Edge->getTargetNode()); 129 getSimpleEdgeAttributes( const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) argument 138 getVerboseEdgeAttributes( const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) argument
|
H A D | LazyCallGraph.cpp | 44 Edge::Kind EK) { 49 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { 58 Edges[IndexMapI->second] = Edge(); 63 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, 65 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { 70 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); 109 LazyCallGraph::Edge::Call); 123 LazyCallGraph::Edge::Ref); 131 LazyCallGraph::Edge::Ref); 177 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge [all...] |
H A D | BranchProbabilityInfo.cpp | 252 bool BranchProbabilityInfo::isLoopEnteringEdge(const LoopEdge &Edge) const { 253 const auto &SrcBlock = Edge.first; 254 const auto &DstBlock = Edge.second; 262 bool BranchProbabilityInfo::isLoopExitingEdge(const LoopEdge &Edge) const { 263 return isLoopEnteringEdge({Edge.second, Edge.first}); 267 const LoopEdge &Edge) const { 268 return isLoopEnteringEdge(Edge) || isLoopExitingEdge(Edge); 271 bool BranchProbabilityInfo::isLoopBackEdge(const LoopEdge &Edge) cons [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
H A D | SyntheticCountsPropagation.cpp | 106 // Edge includes information about the source. Hence ignore the first 109 const CallGraphNode::CallRecord &Edge) { 111 if (!Edge.first) 113 CallBase &CB = *cast<CallBase>(*Edge.first);
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Support/ |
H A D | SuffixTree.cpp | 42 unsigned StartIdx, unsigned Edge) { 48 Parent.Children[Edge] = N; 55 unsigned EndIdx, unsigned Edge) { 65 Parent->Children[Edge] = N; 41 insertLeaf(SuffixTreeNode &Parent, unsigned StartIdx, unsigned Edge) argument 53 insertInternalNode(SuffixTreeNode *Parent, unsigned StartIdx, unsigned EndIdx, unsigned Edge) argument
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
H A D | SampleProfileLoaderBaseImpl.h | 100 using Edge = std::pair<const BasicBlockT *, const BasicBlockT *>; 101 using EdgeWeightMap = DenseMap<Edge, uint64_t>; 124 void printEdgeWeight(raw_ostream &OS, Edge E); 134 uint64_t visitEdge(Edge E, unsigned *NumUnknownEdges, Edge *UnknownEdge); 152 /// Edge weights are computed by propagating basic block weights in 160 SmallSet<Edge, 32> VisitedEdges; 220 /// \param E Edge to print. 222 void SampleProfileLoaderBaseImpl<BT>::printEdgeWeight(raw_ostream &OS, Edge E) { 502 /// \param E Edge t [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
H A D | SuffixTree.h | 194 /// \param Edge The label on the edge leaving \p Parent to this node. 198 unsigned Edge); 205 /// \param Edge The label on the edge leaving \p Parent to this node. 209 unsigned EndIdx, unsigned Edge);
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
H A D | LoopPeel.cpp | 609 for (auto Edge : ExitEdges) 610 for (PHINode &PHI : Edge.second->phis()) { 611 Value *LatchVal = PHI.getIncomingValueForBlock(Edge.first); 615 PHI.addIncoming(LatchVal, cast<BasicBlock>(VMap[Edge.first])); 703 for (auto Edge : ExitEdges) { 704 if (ExitIDom.count(Edge.second)) 707 DT->getNode(Edge.second)->getIDom()->getBlock(), Latch); 709 ExitIDom[Edge.second] = BB;
|