Searched refs:Edge (Results 1 - 25 of 60) sorted by relevance

123

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DMachO_arm64.h23 enum MachOARM64RelocationKind : Edge::Kind {
24 Branch26 = Edge::FirstRelocation,
55 StringRef getMachOARM64RelocationKindName(Edge::Kind R);
H A DMachO_x86_64.h23 enum MachOX86RelocationKind : Edge::Kind {
24 Branch32 = Edge::FirstRelocation,
59 StringRef getMachOX86RelocationKindName(Edge::Kind R);
H A DJITLink.h57 class Edge { class in namespace:llvm::jitlink
71 Edge(Kind K, OffsetT Offset, Symbol &Target, AddendT Addend) function in class:llvm::jitlink::Edge
98 const char *getGenericEdgeKindName(Edge::Kind K);
169 using EdgeVector = std::vector<Edge>;
224 void addEdge(Edge::Kind K, Edge::OffsetT Offset, Symbol &Target,
225 Edge::AddendT Addend) {
226 Edges.push_back(Edge(K, Offset, Target, Addend));
231 void addEdge(const Edge &E) { Edges.push_back(E); }
261 std::vector<Edge> Edge
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineDominators.cpp101 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);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DEHFrameSupportImpl.h43 EHFrameEdgeFixer(StringRef EHFrameSectionName, Edge::Kind FDEToCIE,
44 Edge::Kind FDEToPCBegin, Edge::Kind FDEToLSDA);
64 EdgeTarget(const Edge &E) : Target(&E.getTarget()), Addend(E.getAddend()) {}
67 Edge::AddendT Addend = 0;
70 using BlockEdgeMap = DenseMap<Edge::OffsetT, EdgeTarget>;
104 Edge::Kind FDEToCIE;
105 Edge::Kind FDEToPCBegin;
106 Edge::Kind FDEToLSDA;
H A DJITLink.cpp59 const char *getGenericEdgeKindName(Edge::Kind K) {
61 case Edge::Invalid:
63 case Edge::KeepAlive:
138 void printEdge(raw_ostream &OS, const Block &B, const Edge &E,
232 std::function<StringRef(Edge::Kind)> EdgeKindToName) {
234 EdgeKindToName = [](Edge::Kind K) { return StringRef(); };
243 StringRef EdgeName = (E.getKind() < Edge::FirstRelocation
H A DMachO_arm64.cpp110 parsePairRelocation(Block &BlockToFix, Edge::Kind SubtractorKind,
367 Edge GE(*Kind, FixupAddress - BlockToFix->getAddress(), *TargetSymbol,
389 bool isGOTEdge(Edge &E) const {
401 void fixGOTEdge(Edge &E, Symbol &GOTEntry) {
412 bool isExternalBranchEdge(Edge &E) {
425 void fixExternalBranchEdge(Edge &E, Symbol &Stub) {
484 StringRef getEdgeKindName(Edge::Kind R) const override {
496 static Error targetOutOfRangeError(const Block &B, const Edge &E) {
529 Error applyFixup(Block &B, const Edge &E, char *BlockWorkingMem) const {
688 StringRef getMachOARM64RelocationKindName(Edge
[all...]
H A DMachO_x86_64.cpp112 parsePairRelocation(Block &BlockToFix, Edge::Kind SubtractorKind,
336 Edge GE(*Kind, FixupAddress - BlockToFix->getAddress(), *TargetSymbol,
356 bool isGOTEdge(Edge &E) const {
367 void fixGOTEdge(Edge &E, Symbol &GOTEntry) {
375 bool isExternalBranchEdge(Edge &E) {
388 void fixExternalBranchEdge(Edge &E, Symbol &Stub) {
444 StringRef getEdgeKindName(Edge::Kind R) const override {
456 static Error targetOutOfRangeError(const Block &B, const Edge &E) {
467 Error applyFixup(Block &B, const Edge &E, char *BlockWorkingMem) const {
582 StringRef getMachOX86RelocationKindName(Edge
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/LTO/
H A DSummaryBasedOptimizations.cpp51 auto GetCallSiteRelFreq = [](FunctionSummary::EdgeTy &Edge) {
52 return Scaled64(Edge.second.RelBlockFreq, -CalleeInfo::ScaleShift);
74 auto GetProfileCount = [&](ValueInfo V, FunctionSummary::EdgeTy &Edge) {
75 auto RelFreq = GetCallSiteRelFreq(Edge);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h29 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 DCFGMST.h37 template <class Edge, class BBInfo> class CFGMST {
43 std::vector<std::unique_ptr<Edge>> AllEdges;
99 LLVM_DEBUG(dbgs() << "Build Edge on " << F.getName() << "\n");
103 Edge *EntryIncoming = nullptr, *EntryOutgoing = nullptr,
109 LLVM_DEBUG(dbgs() << " Edge: from fake node to " << Entry->getName()
140 LLVM_DEBUG(dbgs() << " Edge: from " << BB->getName() << " to "
161 Edge *ExitO = &addEdge(&*BB, nullptr, BBWeight);
166 LLVM_DEBUG(dbgs() << " Edge: from " << BB->getName() << " to fake exit"
198 llvm::stable_sort(AllEdges, [](const std::unique_ptr<Edge> &Edge1,
199 const std::unique_ptr<Edge>
[all...]
H A DPGOInstrumentation.cpp520 template <class Edge, class BBInfo> class FuncPGOInstrumentation {
545 CFGMST<Edge, BBInfo> MST;
553 BasicBlock *getInstrBB(Edge *E);
611 template <class Edge, class BBInfo>
612 void FuncPGOInstrumentation<Edge, BBInfo>::computeCFGHash() {
673 template <class Edge, class BBInfo>
674 void FuncPGOInstrumentation<Edge, BBInfo>::renameComdatFunction() {
721 template <class Edge, class BBInfo>
722 void FuncPGOInstrumentation<Edge, BBInfo>::getInstrumentBBs(
725 std::vector<Edge *> EdgeLis
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSyntheticCountsPropagation.cpp106 // Edge includes information about the source. Hence ignore the first
109 const CallGraphNode::CallRecord &Edge) {
111 if (!Edge.first)
113 assert(isa<Instruction>(Edge.first));
114 CallSite CS(cast<Instruction>(Edge.first));
H A DSampleProfile.cpp173 using Edge = std::pair<const BasicBlock *, const BasicBlock *>;
174 using EdgeWeightMap = DenseMap<Edge, uint64_t>;
342 void printEdgeWeight(raw_ostream &OS, Edge E);
352 uint64_t visitEdge(Edge E, unsigned *NumUnknownEdges, Edge *UnknownEdge);
369 /// Edge weights are computed by propagating basic block weights in
377 SmallSet<Edge, 32> VisitedEdges;
654 /// \param E Edge to print.
655 void SampleProfileLoader::printEdgeWeight(raw_ostream &OS, Edge E) {
1239 /// \param E Edge t
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h48 class Edge { class in class:llvm::ImmutableGraph
63 const Edge *Edges;
69 const Edge *edges_begin() const { return Edges; }
74 const Edge *edges_end() const { return (this + 1)->Edges; }
75 ArrayRef<Edge> edges() const {
81 ImmutableGraph(std::unique_ptr<Node[]> Nodes, std::unique_ptr<Edge[]> Edges,
95 ArrayRef<Edge> edges() const { return makeArrayRef(Edges.get(), EdgesSize); }
96 const Edge *edges_begin() const { return edges().begin(); }
97 const Edge *edges_end() const { return edges().end(); }
106 // Edge
[all...]
H A DX86LoadValueInjectionLoadHardening.cpp120 using Edge = typename GraphT::Edge;
123 std::unique_ptr<Edge[]> Edges, size_type NodesSize,
127 static inline bool isCFGEdge(const Edge &E) {
130 static inline bool isGadgetEdge(const Edge &E) {
672 auto IsCFGEdge = [&ElimEdges, &CutEdges](const MachineGadgetGraph::Edge &E) {
677 &CutEdges](const MachineGadgetGraph::Edge &E) {
686 const MachineGadgetGraph::Edge *CheapestSoFar = nullptr;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp43 Edge::Kind EK) {
48 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {
57 Edges[IndexMapI->second] = Edge();
62 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,
64 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {
69 Edges.emplace_back(LazyCallGraph::Edge(N, EK));
108 LazyCallGraph::Edge::Call);
122 LazyCallGraph::Edge::Ref);
130 LazyCallGraph::Edge::Ref);
173 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge
[all...]
H A DCGSCCPassManager.cpp430 using Edge = LazyCallGraph::Edge;
455 Edge *E = N->lookup(CalleeN);
480 Edge *E = N->lookup(RefereeN);
505 for (Edge &E : *N) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h135 class Edge { class in class:llvm::LazyCallGraph
140 Edge();
141 explicit Edge(Node &N, Kind K);
191 using VectorT = SmallVector<Edge, 4>;
192 using VectorImplT = SmallVectorImpl<Edge>;
261 Edge &operator[](int i) { return Edges[i]; }
262 Edge &operator[](Node &N) {
269 Edge *lookup(Node &N) {
301 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);
304 void setEdgeKind(Node &ChildN, Edge
1211 inline LazyCallGraph::Edge::Edge() : Value() {} function in class:llvm::LazyCallGraph::LazyCallGraph::Edge
1212 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} function in class:llvm::LazyCallGraph::LazyCallGraph::Edge
[all...]
H A DBranchProbabilityInfo.h170 using Edge = std::pair<const BasicBlock *, unsigned>;
180 DenseMap<Edge, BranchProbability> Probs;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DGCOV.h336 void addSrcEdge(GCOVEdge *Edge) { argument
337 assert(&Edge->Dst == this); // up to caller to ensure edge is valid
338 SrcEdges.push_back(Edge);
341 void addDstEdge(GCOVEdge *Edge) { argument
342 assert(&Edge->Src == this); // up to caller to ensure edge is valid
344 if (DstEdges.size() && DstEdges.back()->Dst.Number > Edge->Dst.Number)
346 DstEdges.push_back(Edge);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ProfileData/
H A DGCOV.cpp189 GCOVEdge *Edge = Edges.back().get(); local
190 Blocks[BlockNo]->addDstEdge(Edge);
191 Blocks[Dst]->addSrcEdge(Edge);
193 return false; // Edge flag
416 for (const GCOVEdge *Edge : SrcEdges)
417 OS << Edge->Src.Number << " (" << Edge->Count << "), ";
422 for (const GCOVEdge *Edge : DstEdges)
423 OS << Edge->Dst.Number << " (" << Edge
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopUnrollPeel.cpp576 for (auto Edge : ExitEdges)
577 for (PHINode &PHI : Edge.second->phis()) {
578 Value *LatchVal = PHI.getIncomingValueForBlock(Edge.first);
582 PHI.addIncoming(LatchVal, cast<BasicBlock>(VMap[Edge.first]));
636 for (auto Edge : ExitEdges) {
637 if (ExitIDom.count(Edge.second))
640 DT->getNode(Edge.second)->getIDom()->getBlock(), Latch);
642 ExitIDom[Edge.second] = BB;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DDominators.h115 static unsigned getHashValue(const BasicBlockEdge &Edge) { argument
116 return hash_combine(BBInfo::getHashValue(Edge.getStart()),
117 BBInfo::getHashValue(Edge.getEnd()));
/freebsd-11-stable/contrib/llvm-project/lld/ELF/
H A DCallGraphSort.cpp56 struct Edge { struct in namespace:lld::elf::__anon1126
75 Edge bestPred = {-1, 0};

Completed in 317 milliseconds

123