Home
last modified time | relevance | path

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

123456

/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp103 TotalCost += Edge.Cost * Edge.Flow; in run()
124 Edge SrcEdge; in addEdge()
131 Edge DstEdge; in addEdge()
153 Flow.push_back(std::make_pair(Edge.Dst, Edge.Flow)); in getFlow()
264 if (Edge.Flow < Edge.Capacity) { in findAugmentingPath()
474 assert(uint64_t(Edge->Capacity - Edge->Flow) >= Edge->AugmentedFlow); in augmentFlowAlongDAG()
476 auto &RevEdge = Edges[Edge->Dst][Edge->RevEdgeIndex]; in augmentFlowAlongDAG()
477 Edge->Flow += Edge->AugmentedFlow; in augmentFlowAlongDAG()
479 if (Edge->Capacity == Edge->Flow && Edge->AugmentedFlow > 0) in augmentFlowAlongDAG()
509 Edge.Capacity > Edge.Flow && in identifyShortestEdges()
[all …]
/llvm-project-15.0.7/mlir/include/mlir/Analysis/
H A DCallGraph.h43 class Edge {
75 bool operator==(const Edge &edge) const {
110 using iterator = SmallVectorImpl<Edge>::const_iterator;
123 static Edge getEmptyKey() { return Edge(BaseInfo::getEmptyKey()); } in getEmptyKey()
124 static Edge getTombstoneKey() { return Edge(BaseInfo::getTombstoneKey()); } in getTombstoneKey()
125 static unsigned getHashValue(const Edge &edge) { in getHashValue()
128 static bool isEqual(const Edge &lhs, const Edge &rhs) { return lhs == rhs; } in isEqual()
134 void addEdge(CallGraphNode *node, Edge::Kind kind);
142 SetVector<Edge, SmallVector<Edge, 4>,
143 llvm::SmallDenseSet<Edge, 4, EdgeKeyInfo>>
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DHFSortPlus.cpp75 class Edge;
109 void addEdge(Chain *Other, Edge *Edge) { Edges.emplace_back(Other, Edge); } in addEdge() argument
141 class Edge { class
143 Edge(const Edge &) = delete;
144 Edge(Edge &&) = default;
145 Edge &operator=(const Edge &) = delete;
146 Edge &operator=(Edge &&) = default;
350 Edge *Edge = Chain->getEdge(Chain); in shortCalls() local
365 double shortCalls(Chain *ChainPred, Chain *ChainSucc, Edge *Edge) const { in shortCalls()
403 double mergeGain(Chain *ChainPred, Chain *ChainSucc, Edge *Edge) const { in mergeGain()
[all …]
H A DExtTSPReorderAlgorithm.cpp84 class Edge;
260 void addEdge(Chain *Other, Edge *Edge) { Edges.emplace_back(Other, Edge); } in addEdge() argument
297 class Edge { class
299 Edge(const Edge &) = delete;
300 Edge(Edge &&) = default;
301 Edge &operator=(const Edge &) = delete;
302 Edge &operator=(Edge &&) = default;
321 void moveJumps(Edge *Other) { in moveJumps()
697 MergeGainTy mergeGain(Chain *ChainPred, Chain *ChainSucc, Edge *Edge) const { in mergeGain()
702 JumpList Jumps = Edge->jumps(); in mergeGain()
[all …]
/llvm-project-15.0.7/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()
324 Edge GE(Kind, Offset, *GraphSymbol, Addend); in addSingleRelocation()
337 const char *getELFAArch64RelocationKindName(Edge::Kind R) { in getELFAArch64RelocationKindName()
382 return getGenericEdgeKindName(static_cast<Edge::Kind>(R)); in getELFAArch64RelocationKindName()
445 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
446 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
[all …]
H A DCOFF_x86_64.cpp29 enum EdgeKind_coff_x86_64 : Edge::Kind {
44 Error applyFixup(LinkGraph &G, Block &B, const Edge &E) const { in applyFixup()
89 Edge::OffsetT Offset = FixupAddress - BlockToFix.getAddress(); in addSingleRelocation()
91 Edge::Kind Kind = Edge::Invalid; in addSingleRelocation()
117 Edge GE(Kind, Offset, *GraphSymbol, Addend); in addSingleRelocation()
210 const char *getCOFFX86RelocationKindName(Edge::Kind R) { in getCOFFX86RelocationKindName()
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()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSCCIterator.h329 for (auto &Edge : Node->Edges) { 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
353 for (auto *Edge : SortedEdges) { in scc_member_iterator()
355 Queue.push(Edge->Source); in scc_member_iterator()
364 for (auto &Edge : Node->Edges) { in scc_member_iterator()
365 if (MSTEdges.count(&Edge) && !NodeInfoMap[Edge.Target].Visited) { in scc_member_iterator()
[all …]
/llvm-project-15.0.7/mlir/test/Analysis/
H A Dtest-callgraph.mlir14 // CHECK-NEXT: Call-Edge{{.*}}External-Node
21 // CHECK-NEXT: Call-Edge{{.*}}func_c
28 // CHECK-DAG: Call-Edge{{.*}}func_c
29 // CHECK-DAG: Call-Edge{{.*}}func_d
30 // CHECK-DAG: Call-Edge{{.*}}func_e
39 // CHECK: Child-Edge{{.*}}test.functional_region_op
40 // CHECK: Call-Edge{{.*}}test.functional_region_op
43 // CHECK: Call-Edge{{.*}}func_f
66 // CHECK: Call-Edge{{.*}}func_a
/llvm-project-15.0.7/llvm/test/tools/llvm-profdata/
H A Doverlap.test9 MAINFUNC: Edge profile overlap: 100.000%
10 MAINFUNC: Edge profile base count sum: 200000
11 MAINFUNC: Edge profile test count sum: 20000
17 OVERLAP: Edge profile overlap: 60.000%
18 OVERLAP: Mismatched count percentage (Edge): 20.000%
19 OVERLAP: Percentage of Edge profile only in test_profile: 20.000%
20 OVERLAP: Edge profile base count sum: 500000
21 OVERLAP: Edge profile test count sum: 50000
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DImmutableGraph.h47 class Edge {
62 const Edge *Edges;
74 ArrayRef<Edge> edges() const { in edges()
106 size_type getEdgeIndex(const Edge &E) const { in getEdgeIndex()
206 bool insert(const Edge &E) { in insert()
212 void erase(const Edge &E) { in erase()
216 bool contains(const Edge &E) const { in contains()
272 Edge *operator*() const {
289 std::unique_ptr<Edge[]> Edges;
306 using Edge = typename GraphT::Edge; variable
[all …]
H A DX86LoadValueInjectionLoadHardening.cpp121 using Edge = typename GraphT::Edge; typedef
152 using Edge = MachineGadgetGraph::Edge; typedef in __anon994a0f410111::X86LoadValueInjectionLoadHardeningPass
549 for (const Edge &E : G.edges()) { in elimMitigatedEdgesAndNodes()
554 for (const Edge &DE : Dest->edges()) in elimMitigatedEdgesAndNodes()
583 for (const Edge &E : RootN.edges()) { in elimMitigatedEdgesAndNodes()
636 for (const Edge &E : Graph->edges()) { in hardenLoadsWithPlugin()
677 for (const Edge &E : Graph->edges()) in hardenLoadsWithHeuristic()
690 for (const Edge &E : N.edges()) { in hardenLoadsWithHeuristic()
710 for (const Edge *E : EdgesToCut) in hardenLoadsWithHeuristic()
730 for (const Edge &E : N.edges()) { in insertFences()
[all …]
/llvm-project-15.0.7/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()
299 void setEdgeKind(Node &ChildN, Edge::Kind EK);
1203 inline LazyCallGraph::Edge::Edge() = default;
1204 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} in Edge() function
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DLazyCallGraph.cpp258 for (Edge &E : **N) in verify()
369 for (Edge &E : *N) { in verify()
415 for (Edge &E : *N) in isParentOf()
437 for (Edge &E : *N) { in isAncestorOf()
659 for (Edge &E : *N) { in switchInternalEdgeToCall()
1045 for (Edge &E : *N) in insertIncomingRefEdge()
1429 E.setKind(Edge::Call); in insertTrivialCallEdge()
1620 for (Edge &E : *NewN) { in addSplitFunction()
1633 for (Edge &E : *NewN) { in addSplitFunction()
1705 for (Edge &E : *NewN) { in addSplitRefRecursiveFunctions()
[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 const auto &SrcBlock = Edge.first; in isLoopEnteringEdge()
326 const auto &DstBlock = Edge.second; in isLoopEnteringEdge()
335 return isLoopEnteringEdge({Edge.second, Edge.first}); in isLoopExitingEdge()
339 const LoopEdge &Edge) const { in isLoopEnteringExitingEdge()
340 return isLoopEnteringEdge(Edge) || isLoopExitingEdge(Edge); in isLoopEnteringExitingEdge()
344 const auto &SrcBlock = Edge.first; in isLoopBackEdge()
345 const auto &DstBlock = Edge.second; in isLoopBackEdge()
675 return isLoopEnteringEdge(Edge) in getEstimatedEdgeWeight()
769 } else if (isLoopExitingEdge(Edge)) { in propagateEstimatedBlockWeight()
907 Weight = getEstimatedEdgeWeight(Edge); in calcEstimatedHeuristics()
[all …]
/llvm-project-15.0.7/mlir/lib/Analysis/
H A DCallGraph.cpp41 addEdge(node, Edge::Kind::Abstract); in addAbstractEdge()
46 addEdge(node, Edge::Kind::Call); in addCallEdge()
51 addEdge(child, Edge::Kind::Child); in addChildEdge()
56 return llvm::any_of(edges, [](const Edge &edge) { return edge.isChild(); }); in hasChildren()
60 void CallGraphNode::addEdge(CallGraphNode *node, Edge::Kind kind) { in addEdge()
156 for (const CallGraphNode::Edge &edge : llvm::make_early_inc_range(*node)) in eraseNode()
162 it.second->edges.remove_if([node](const CallGraphNode::Edge &edge) { in eraseNode()
/llvm-project-15.0.7/llvm/include/llvm/ExecutionEngine/JITLink/
H A Dx86_64.h26 enum EdgeKind_x86_64 : Edge::Kind {
33 Pointer64 = Edge::FirstRelocation,
371 const char *getEdgeKindName(Edge::Kind K);
385 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup()
544 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
545 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
571 assert(KindToSet != Edge::Invalid && in visitEdge()
604 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
H A Daarch64.h24 enum EdgeKind_aarch64 : Edge::Kind {
25 Branch26 = Edge::FirstRelocation,
49 const char *getEdgeKindName(Edge::Kind K);
98 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E) { in applyFixup()
258 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
259 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
287 assert(KindToSet != Edge::Invalid && in visitEdge()
329 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
H A Driscv.h23 enum EdgeKind_riscv : Edge::Kind {
31 R_RISCV_32 = Edge::FirstRelocation,
188 const char *getEdgeKindName(Edge::Kind K);
H A DELF_x86_64.h22 enum ELFX86RelocationKind : Edge::Kind {
23 Branch32 = Edge::FirstRelocation,
52 const char *getELFX86RelocationKindName(Edge::Kind R);
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/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()

123456