Home
last modified time | relevance | path

Searched refs:Edge (Results 1 – 25 of 110) sorted by relevance

12345

/openbsd-src/gnu/llvm/llvm/include/llvm/ExecutionEngine/JITLink/
H A DEHFrameSupport.h50 Edge *getPersonalityEdge() const { in getPersonalityEdge()
60 Edge *getCIEEdge() const { return CIEEdge; } in getCIEEdge()
65 Edge *getPCBeginEdge() const { return PCBeginEdge; } in getPCBeginEdge()
69 Edge *getLSDAEdge() const { in getLSDAEdge()
75 EHFrameCFIBlockInspector(Edge *PersonalityEdge);
76 EHFrameCFIBlockInspector(Edge &CIEEdge, Edge &PCBeginEdge, Edge *LSDAEdge);
78 Edge *CIEEdge = nullptr;
79 Edge *PCBeginEdge = nullptr;
81 Edge *PersonalityEdge;
82 Edge *LSDAEdge;
H A Di386.h21 enum EdgeKind_i386 : Edge::Kind {
24 None = Edge::FirstRelocation,
131 const char *getEdgeKindName(Edge::Kind K);
145 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup()
245 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
246 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
260 assert(KindToSet != Edge::Invalid && in visitEdge()
H A Dloongarch.h25 enum EdgeKind_loongarch : Edge::Kind {
31 Pointer64 = Edge::FirstRelocation,
165 const char *getEdgeKindName(Edge::Kind K);
173 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E) { in applyFixup()
319 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
320 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
331 assert(KindToSet != Edge::Invalid && in visitEdge()
365 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
H A Dx86_64.h26 enum EdgeKind_x86_64 : Edge::Kind {
33 Pointer64 = Edge::FirstRelocation,
382 const char *getEdgeKindName(Edge::Kind K);
396 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup()
564 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
565 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
591 assert(KindToSet != Edge::Invalid && in visitEdge()
624 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
H A Driscv.h24 enum EdgeKind_riscv : Edge::Kind {
32 R_RISCV_32 = Edge::FirstRelocation,
209 const char *getEdgeKindName(Edge::Kind K);
H A Daarch64.h25 enum EdgeKind_aarch64 : Edge::Kind {
32 Pointer64 = Edge::FirstRelocation,
294 const char *getEdgeKindName(Edge::Kind K);
343 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E) { in applyFixup()
545 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
546 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
574 assert(KindToSet != Edge::Invalid && in visitEdge()
608 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp95 Edges = std::vector<std::vector<Edge>>(NodeCount, std::vector<Edge>()); in initialize()
98 std::vector<std::vector<Edge *>>(NodeCount, std::vector<Edge *>()); in initialize()
113 for (auto &Edge : Edges[Src]) { in run() local
114 if (Edge.Flow > 0) { in run()
115 TotalCost += Edge.Cost * Edge.Flow; in run()
117 TotalFlow += Edge.Flow; in run()
136 Edge SrcEdge; in addEdge()
143 Edge DstEdge; in addEdge()
163 for (const auto &Edge : Edges[Src]) { in getFlow() local
164 if (Edge.Flow > 0) in getFlow()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/ExecutionEngine/JITLink/
H A DEHFrameSupportImpl.h32 Edge::Kind Pointer32, Edge::Kind Pointer64,
33 Edge::Kind Delta32, Edge::Kind Delta64,
34 Edge::Kind NegDelta32);
57 EdgeTarget(const Edge &E) : Target(&E.getTarget()), Addend(E.getAddend()) {} in EdgeTarget()
60 Edge::AddendT Addend = 0;
63 using BlockEdgeMap = DenseMap<Edge::OffsetT, EdgeTarget>;
108 Edge::Kind Pointer32;
109 Edge::Kind Pointer64;
110 Edge::Kind Delta32;
111 Edge::Kind Delta64;
[all …]
H A DELF_aarch64.cpp40 Error applyFixup(LinkGraph &G, Block &B, const Edge &E) const { in applyFixup()
48 enum ELFAArch64RelocationKind : Edge::Kind {
49 ELFCall26 = Edge::FirstRelocation,
167 Edge::OffsetT Offset = FixupAddress - BlockToFix.getAddress(); in addSingleRelocation()
173 Edge::Kind Kind = Edge::Invalid; in addSingleRelocation()
321 Edge GE(Kind, Offset, *GraphSymbol, Addend); in addSingleRelocation()
334 const char *getELFAArch64RelocationKindName(Edge::Kind R) { in getELFAArch64RelocationKindName()
379 return getGenericEdgeKindName(static_cast<Edge::Kind>(R)); in getELFAArch64RelocationKindName()
398 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { return false; } in visitEdge()
442 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
[all …]
H A DEHFrameSupport.cpp23 unsigned PointerSize, Edge::Kind Pointer32, in EHFrameEdgeFixer()
24 Edge::Kind Pointer64, Edge::Kind Delta32, in EHFrameEdgeFixer()
25 Edge::Kind Delta64, Edge::Kind NegDelta32) in EHFrameEdgeFixer()
382 (*PCBegin)->getBlock().addEdge(Edge::KeepAlive, 0, FDESymbol, 0); in processFDE()
584 Edge::Kind PtrEdgeKind = Edge::Invalid; in getOrCreateEncodedPointerEdge()
671 SmallVector<Edge *, 3> Es; in FromEdgeScan()
675 llvm::sort(Es, [](const Edge *LHS, const Edge *RHS) { in FromEdgeScan()
683 EHFrameCFIBlockInspector::EHFrameCFIBlockInspector(Edge *PersonalityEdge) in EHFrameCFIBlockInspector()
686 EHFrameCFIBlockInspector::EHFrameCFIBlockInspector(Edge &CIEEdge, in EHFrameCFIBlockInspector()
687 Edge &PCBeginEdge, in EHFrameCFIBlockInspector()
[all …]
H A DMachO_arm64.cpp34 enum MachOARM64RelocationKind : Edge::Kind {
35 MachOBranch26 = Edge::FirstRelocation,
124 using PairRelocInfo = std::tuple<Edge::Kind, Symbol *, uint64_t>;
129 parsePairRelocation(Block &BlockToFix, Edge::Kind SubtractorKind, in parsePairRelocation()
187 Edge::Kind DeltaKind; in parsePairRelocation()
278 Edge::Kind Kind = Edge::Invalid; in addRelocations()
453 Edge GE(Kind, FixupAddress - BlockToFix->getAddress(), *TargetSymbol, in addRelocations()
466 const char *getMachOARM64RelocationKindName(Edge::Kind R) { in getMachOARM64RelocationKindName()
501 return getGenericEdgeKindName(static_cast<Edge::Kind>(R)); in getMachOARM64RelocationKindName()
532 Error applyFixup(LinkGraph &G, Block &B, const Edge &E) const { in applyFixup()
H A DELF_x86_64.cpp43 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
109 enum ELFX86RelocationKind : Edge::Kind {
110 Branch32 = Edge::FirstRelocation,
202 Edge::Kind Kind = Edge::Invalid; in addSingleRelocation()
256 Edge::OffsetT Offset = FixupAddress - BlockToFix.getAddress(); in addSingleRelocation()
257 Edge GE(Kind, Offset, *GraphSymbol, Addend); in addSingleRelocation()
340 Error applyFixup(LinkGraph &G, Block &B, const Edge &E) const { in applyFixup()
H A DJITLink.cpp58 const char *getGenericEdgeKindName(Edge::Kind K) { in getGenericEdgeKindName()
60 case Edge::Invalid: in getGenericEdgeKindName()
62 case Edge::KeepAlive: in getGenericEdgeKindName()
112 void printEdge(raw_ostream &OS, const Block &B, const Edge &E, in printEdge()
284 std::vector<Edge> SortedEdges; in dump()
286 llvm::sort(SortedEdges, [](const Edge &LHS, const Edge &RHS) { in dump()
360 const Edge &E) { in makeTargetOutOfRangeError()
396 const Edge &E) { in makeAlignmentError()
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DSCCIterator.h274 bool unionGroups(const EdgeType *Edge) { in unionGroups() argument
275 NodeInfo *G1 = find(&NodeInfoMap[Edge->Source]); in unionGroups()
276 NodeInfo *G2 = find(&NodeInfoMap[Edge->Target]); in unionGroups()
329 for (auto &Edge : Node->Edges) { in scc_member_iterator()
330 if (NodeInfoMap.count(Edge.Target)) in scc_member_iterator()
331 SortedEdges.insert(&Edge); in scc_member_iterator()
338 for (auto *Edge : SortedEdges) { in scc_member_iterator()
339 if (unionGroups(Edge)) in scc_member_iterator()
340 MSTEdges.insert(Edge); in scc_member_iterator()
347 for (const auto *Edge : MSTEdges) in scc_member_iterator() local
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Target/X86/
H A DImmutableGraph.h47 class Edge {
62 const Edge *Edges;
68 const Edge *edges_begin() const { return Edges; } in edges_begin()
73 const Edge *edges_end() const { return (this + 1)->Edges; } in edges_end()
74 ArrayRef<Edge> edges() const { in edges()
80 ImmutableGraph(std::unique_ptr<Node[]> Nodes, std::unique_ptr<Edge[]> Edges, in ImmutableGraph()
94 ArrayRef<Edge> edges() const { return ArrayRef(Edges.get(), EdgesSize); } in edges()
95 const Edge *edges_begin() const { return edges().begin(); } in edges_begin()
96 const Edge *edges_end() const { return edges().end(); } in edges_end()
106 size_type getEdgeIndex(const Edge &E) const { in getEdgeIndex()
[all …]
H A DX86LoadValueInjectionLoadHardening.cpp121 using Edge = typename GraphT::Edge; typedef
124 std::unique_ptr<Edge[]> Edges, size_type NodesSize, in MachineGadgetGraph()
128 static inline bool isCFGEdge(const Edge &E) { in isCFGEdge()
131 static inline bool isGadgetEdge(const Edge &E) { in isGadgetEdge()
152 using Edge = MachineGadgetGraph::Edge; typedef in __anonced864880111::X86LoadValueInjectionLoadHardeningPass
548 for (const Edge &E : G.edges()) { in elimMitigatedEdgesAndNodes()
553 for (const Edge &DE : Dest->edges()) in elimMitigatedEdgesAndNodes()
572 for (const Edge &E : N->edges()) { in elimMitigatedEdgesAndNodes()
582 for (const Edge &E : RootN.edges()) { in elimMitigatedEdgesAndNodes()
635 for (const Edge &E : Graph->edges()) { in hardenLoadsWithPlugin()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DMachineDominators.cpp103 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
105 MachineBasicBlock *Succ = Edge.ToBB; in applySplitCriticalEdges()
109 if (PredBB == Edge.NewBB) in applySplitCriticalEdges()
139 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
141 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); in applySplitCriticalEdges()
147 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode); in applySplitCriticalEdges()
/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h131 class Edge {
136 Edge();
137 explicit Edge(Node &N, Kind K);
187 using VectorT = SmallVector<Edge, 4>;
188 using VectorImplT = SmallVectorImpl<Edge>;
257 Edge &operator[](Node &N) {
264 Edge *lookup(Node &N) { in lookup()
296 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);
299 void setEdgeKind(Node &ChildN, Edge::Kind EK);
754 void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
H A DBranchProbabilityInfo.h316 using Edge = std::pair<const BasicBlock *, unsigned>; variable
318 DenseMap<Edge, BranchProbability> Probs;
342 bool isLoopEnteringEdge(const LoopEdge &Edge) const;
346 bool isLoopExitingEdge(const LoopEdge &Edge) const;
349 bool isLoopEnteringExitingEdge(const LoopEdge &Edge) const;
352 bool isLoopBackEdge(const LoopEdge &Edge) const;
371 std::optional<uint32_t> getEstimatedEdgeWeight(const LoopEdge &Edge) const;
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DLazyCallGraph.cpp41 Edge::Kind EK) { in insertEdgeInternal()
46 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
55 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge()
62 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { in addEdge()
67 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
106 LazyCallGraph::Edge::Call); in populateSlow()
120 LazyCallGraph::Edge::Ref); in populateSlow()
128 LazyCallGraph::Edge::Ref); in populateSlow()
174 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref); in LazyCallGraph()
[all …]
H A DDDGPrinter.cpp130 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getSimpleEdgeAttributes() argument
133 DDGEdge::EdgeKind Kind = Edge->getKind(); in getSimpleEdgeAttributes()
139 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getVerboseEdgeAttributes() argument
142 DDGEdge::EdgeKind Kind = Edge->getKind(); in getVerboseEdgeAttributes()
145 OS << G->getDependenceString(*Src, Edge->getTargetNode()); in getVerboseEdgeAttributes()
H A DBranchProbabilityInfo.cpp325 bool BranchProbabilityInfo::isLoopEnteringEdge(const LoopEdge &Edge) const { in isLoopEnteringEdge()
326 const auto &SrcBlock = Edge.first; in isLoopEnteringEdge()
327 const auto &DstBlock = Edge.second; in isLoopEnteringEdge()
335 bool BranchProbabilityInfo::isLoopExitingEdge(const LoopEdge &Edge) const { in isLoopExitingEdge()
336 return isLoopEnteringEdge({Edge.second, Edge.first}); in isLoopExitingEdge()
340 const LoopEdge &Edge) const { in isLoopEnteringExitingEdge()
341 return isLoopEnteringEdge(Edge) || isLoopExitingEdge(Edge); in isLoopEnteringExitingEdge()
344 bool BranchProbabilityInfo::isLoopBackEdge(const LoopEdge &Edge) const { in isLoopBackEdge()
345 const auto &SrcBlock = Edge.first; in isLoopBackEdge()
346 const auto &DstBlock = Edge.second; in isLoopBackEdge()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Instrumentation/
H A DCFGMST.h39 template <class Edge, class BBInfo> class CFGMST {
45 std::vector<std::unique_ptr<Edge>> AllEdges;
108 Edge *EntryIncoming = nullptr, *EntryOutgoing = nullptr, in buildEdges()
168 Edge *ExitO = &addEdge(&BB, nullptr, BBWeight); in buildEdges()
205 llvm::stable_sort(AllEdges, [](const std::unique_ptr<Edge> &Edge1, in sortEdgesByWeight()
206 const std::unique_ptr<Edge> &Edge2) { in sortEdgesByWeight()
260 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) { in addEdge()
274 AllEdges.emplace_back(new Edge(Src, Dest, W)); in addEdge()
/openbsd-src/gnu/llvm/llvm/lib/LTO/
H A DSummaryBasedOptimizations.cpp53 auto GetCallSiteRelFreq = [](FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts() argument
54 return Scaled64(Edge.second.RelBlockFreq, -CalleeInfo::ScaleShift); in computeSyntheticCounts()
76 auto GetProfileCount = [&](ValueInfo V, FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts() argument
77 auto RelFreq = GetCallSiteRelFreq(Edge); in computeSyntheticCounts()
/openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h145 ProfiledCallGraphEdge Edge(&ProfiledFunctions[CallerName],
148 auto EdgeIt = Edges.find(Edge);
150 Edges.insert(Edge);
151 } else if (EdgeIt->Weight < Edge.Weight) {
154 Edges.insert(Edge);

12345