Home
last modified time | relevance | path

Searched refs:Edges (Results 1 – 25 of 68) sorted by relevance

123

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DDirectedGraph.h80 explicit DGNode(EdgeType &E) : Edges() { Edges.insert(&E); } in DGNode()
83 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {} in DGNode()
84 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {} in DGNode()
87 Edges = N.Edges;
91 Edges = std::move(N.Edges);
106 iterator begin() { return Edges.begin(); } in begin()
107 iterator end() { return Edges.end(); } in end()
119 for (auto *E : Edges) in findEdgesTo()
134 return (findEdgeTo(N) != Edges.end()); in hasEdgeTo()
145 void clear() { Edges.clear(); } in clear()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h59 edges Edges; member
126 iterator begin() { return Root.Edges.begin(); } in begin()
127 iterator end() { return Root.Edges.end(); } in end()
134 Root.Edges.emplace(&Root, &ProfiledFunctions[Name], 0); in addProfiledFunction()
147 auto &Edges = ProfiledFunctions[CallerName].Edges; variable
148 auto EdgeIt = Edges.find(Edge);
149 if (EdgeIt == Edges.end()) {
150 Edges.insert(Edge);
153 Edges.erase(EdgeIt);
154 Edges.insert(Edge);
[all …]
/llvm-project-15.0.7/llvm/test/Analysis/DDG/
H A Dbasic-loopnest.ll11 ; CHECK-NEXT: Edges:
17 ; CHECK-NEXT: Edges:
20 ; CHECK-NEXT: Edges:
29 ; CHECK-NEXT: Edges:
37 ; CHECK-NEXT: Edges:
43 ; CHECK-NEXT: Edges:
46 ; CHECK-NEXT: Edges:
62 ; CHECK-NEXT: Edges:
68 ; CHECK-NEXT: Edges:
75 ; CHECK-NEXT: Edges:
[all …]
H A Dbasic-a.ll10 ; CHECK-NEXT: Edges:
16 ; CHECK-NEXT: Edges:
19 ; CHECK-NEXT: Edges:
33 ; CHECK-NEXT: Edges:
40 ; CHECK-NEXT: Edges:
46 ; CHECK-NEXT: Edges:
52 ; CHECK-NEXT: Edges:
96 ; CHECK-NEXT: Edges:
102 ; CHECK-NEXT: Edges:
105 ; CHECK-NEXT: Edges:
[all …]
H A Dbasic-b.ll10 ; CHECK-NEXT: Edges:
16 ; CHECK-NEXT: Edges:
19 ; CHECK-NEXT: Edges:
34 ; CHECK-NEXT: Edges:
41 ; CHECK-NEXT: Edges:
48 ; CHECK-NEXT: Edges:
56 ; CHECK-NEXT: Edges:
62 ; CHECK-NEXT: Edges:
68 ; CHECK-NEXT: Edges:
114 ; CHECK-NEXT: Edges:
[all …]
/llvm-project-15.0.7/llvm/include/llvm/XRay/
H A DGraph.h112 EdgeMapT Edges;
321 iterator begin() { return G.Edges.begin(); } in begin()
322 iterator end() { return G.Edges.end(); } in end()
341 Edges.clear(); in clear()
389 auto &P = Edges.FindAndConstruct(I);
418 auto It = Edges.find(I); in at()
419 if (It == Edges.end()) in at()
427 auto It = Edges.find(I); in at()
428 if (It == Edges.end()) in at()
462 const auto &p = Edges.insert(Val); in insert()
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/Inline/ML/
H A Denable-inline-advisor-printing-ml.ll27 ; CHECK-SAME: 2 Edges: 1
29 ; CHECK-SAME: 2 Edges: 1
31 ; CHECK-SAME: 2 Edges: 1
33 ; CHECK-SAME: 2 Edges: 0
37 ; TWO-SAME: 2 Edges: 1
39 ; TWO-SAME: 2 Edges: 0
H A Dscc-dead-accounting.ll69 ; CHECK: [MLInlineAdvisor] Nodes: 3 Edges: 5 EdgesOfLastSeenNodes: 4
70 ; CHECK: [MLInlineAdvisor] Nodes: 3 Edges: 5 EdgesOfLastSeenNodes: 4
71 ; CHECK: [MLInlineAdvisor] Nodes: 3 Edges: 5 EdgesOfLastSeenNodes: 4
72 ; CHECK: [MLInlineAdvisor] Nodes: 3 Edges: 5 EdgesOfLastSeenNodes: 4
73 ; CHECK: [MLInlineAdvisor] Nodes: 3 Edges: 5 EdgesOfLastSeenNodes: 1
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h254 iterator begin() { return iterator(Edges.begin(), Edges.end()); } in begin()
255 iterator end() { return iterator(Edges.end(), Edges.end()); } in end()
268 auto &E = Edges[EI->second]; in lookup()
273 return call_iterator(Edges.begin(), Edges.end()); in call_begin()
275 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); } in call_end()
282 for (auto &E : Edges) in empty()
290 VectorT Edges;
365 if (Edges) in populate()
366 return *Edges; in populate()
381 Optional<EdgeSequence> Edges; variable
[all …]
/llvm-project-15.0.7/llvm/test/Analysis/LazyCallGraph/
H A Dbasic.ll6 ; CHECK-LABEL: Edges in function: f
54 ; CHECK-LABEL: Edges in function: test0
67 ; CHECK-LABEL: Edges in function: test1
111 ; CHECK-LABEL: Edges in function: test2
131 ; CHECK-LABEL: Edges in function: test3_aa1
143 ; CHECK-LABEL: Edges in function: test3_aa2
155 ; CHECK-LABEL: Edges in function: test3_ab1
167 ; CHECK-LABEL: Edges in function: test3_ab2
179 ; CHECK-LABEL: Edges in function: test3_ac1
191 ; CHECK-LABEL: Edges in function: test3_ac2
[all …]
H A Dalias.ll7 ; CHECK: Edges in function: foo
8 ; CHECK: Edges in function: bar
9 ; CHECK: Edges in function: baz
H A Dnon-leaf-intrinsics.ll11 ; CHECK: Edges in function: calls_statepoint
20 ; CHECK: Edges in function: calls_patchpoint
/llvm-project-15.0.7/clang-tools-extra/clangd/index/
H A DBackgroundIndexLoader.cpp53 std::vector<Path> Edges = {}; in loadShard() local
56 return {LS, Edges}; in loadShard()
64 return {LS, Edges}; in loadShard()
76 Edges.push_back(*AbsPath); in loadShard()
87 return {LS, Edges}; in loadShard()
/llvm-project-15.0.7/clang-tools-extra/pseudo/include/clang-pseudo/grammar/
H A DLRGraph.h152 llvm::ArrayRef<Edge> edges() const { return Edges; } in edges()
161 LRGraph(std::vector<State> States, std::vector<Edge> Edges, in LRGraph() argument
164 : States(std::move(States)), Edges(std::move(Edges)), in LRGraph()
169 std::vector<Edge> Edges; variable
/llvm-project-15.0.7/llvm/utils/TableGen/GlobalISel/
H A DGIMatchDag.h78 EdgesVec Edges; variable
91 return raw_pointer_iterator<EdgesVec::iterator>(Edges.begin()); in edges_begin()
94 return raw_pointer_iterator<EdgesVec::iterator>(Edges.end()); in edges_end()
97 return raw_pointer_iterator<EdgesVec::const_iterator>(Edges.begin()); in edges_begin()
100 return raw_pointer_iterator<EdgesVec::const_iterator>(Edges.end()); in edges_end()
199 Edges.push_back(std::move(Obj)); in addEdge()
219 size_t getNumEdges() const { return Edges.size(); } in getNumEdges()
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DImmutableGraph.h62 const Edge *Edges; variable
68 const Edge *edges_begin() const { return Edges; } in edges_begin()
73 const Edge *edges_end() const { return (this + 1)->Edges; } in edges_end()
80 ImmutableGraph(std::unique_ptr<Node[]> Nodes, std::unique_ptr<Edge[]> Edges, in ImmutableGraph() argument
82 : Nodes(std::move(Nodes)), Edges(std::move(Edges)), NodesSize(NodesSize), in ImmutableGraph()
94 ArrayRef<Edge> edges() const { return makeArrayRef(Edges.get(), EdgesSize); } in edges()
289 std::unique_ptr<Edge[]> Edges; variable
338 VertexArray[VI].Edges = &EdgeArray[EI]; in get()
347 VertexArray[VI].Edges = &EdgeArray[EdgeSize]; // terminator node in get()
379 NewVertexArray[VertexI].Edges = &NewEdgeArray[EdgeI]; in trim()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h173 EdgeVector Edges; variable
189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()
212 Edges[EId] = std::move(E); in addConstructedEdge()
214 EId = Edges.size(); in addConstructedEdge()
215 Edges.push_back(std::move(E)); in addConstructedEdge()
306 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); } in end()
308 bool empty() const { return G.Edges.empty(); } in empty()
311 return G.Edges.size() - G.FreeEdgeIds.size(); in size()
659 Edges[EId].invalidate(); in removeEdge()
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DHFSortPlus.cpp92 for (std::pair<Chain *, Edge *> It : Edges) in getEdge()
99 auto It = Edges.begin(); in removeEdge()
100 while (It != Edges.end()) { in removeEdge()
102 Edges.erase(It); in removeEdge()
121 Edges.clear(); in clear()
135 std::vector<std::pair<Chain *, Edge *>> Edges; member in llvm::bolt::__anonbf028ece0111::Chain
205 for (auto EdgeIt : Other->Edges) { in mergeEdges()
491 for (auto EdgeIt : ChainPred->Edges) { in runPassTwo()
522 for (std::pair<Chain *, Edge *> EdgeIt : BestChainPred->Edges) in runPassTwo()
524 for (std::pair<Chain *, Edge *> EdgeIt : BestChainSucc->Edges) in runPassTwo()
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp101 for (auto &Edge : Edges[Src]) { in run()
129 SrcEdge.RevEdgeIndex = Edges[Dst].size(); in addEdge()
136 DstEdge.RevEdgeIndex = Edges[Src].size(); in addEdge()
138 Edges[Src].push_back(SrcEdge); in addEdge()
139 Edges[Dst].push_back(DstEdge); in addEdge()
151 for (auto &Edge : Edges[Src]) { in getFlow()
161 for (auto &Edge : Edges[Src]) { in getFlow()
263 auto &Edge = Edges[Src][EdgeIdx]; in findAugmentingPath()
379 for (auto &Edge : Edges[Src]) { in findAugmentingDAG()
503 for (auto &Edge : Edges[Src]) { in identifyShortestEdges()
[all …]
H A DCodeLayout.cpp243 return Edges; in edges()
247 for (auto It : Edges) { in getEdge()
255 auto It = Edges.begin(); in removeEdge()
256 while (It != Edges.end()) { in removeEdge()
258 Edges.erase(It); in removeEdge()
266 Edges.push_back(std::make_pair(Other, Edge)); in addEdge()
283 Edges.clear(); in clear()
284 Edges.shrink_to_fit(); in clear()
295 std::vector<std::pair<Chain *, ChainEdge *>> Edges; member in __anon97d149770111::Chain
373 for (auto EdgeIt : Other->Edges) { in mergeEdges()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DLazyCallGraph.cpp47 EdgeIndexMap.insert({&TargetN, Edges.size()}); in insertEdgeInternal()
48 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
60 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
68 if (!EdgeIndexMap.insert({&N, Edges.size()}).second) in addEdge()
72 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
81 Edges = EdgeSequence(); in populateSlow()
110 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), in populateSlow()
124 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F), in populateSlow()
132 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F), in populateSlow()
135 return *Edges; in populateSlow()
[all …]
/llvm-project-15.0.7/bolt/runtime/
H A Dinstr.cpp482 const EdgeDescription *Edges; member
826 MaxNodes = D.Edges[I].FromNode; in Graph()
828 MaxNodes = D.Edges[I].ToNode; in Graph()
862 CFGNodes[D.Edges[I].ToNode].NumInEdges++; in Graph()
863 if (D.Edges[I].Counter != 0xffffffff) in Graph()
890 const uint32_t Src = D.Edges[I].FromNode; in Graph()
891 const uint32_t Dst = D.Edges[I].ToNode; in Graph()
900 if (D.Edges[I].Counter != 0xffffffff) in Graph()
1115 const uint32_t C = D.Edges[I].Counter; in computeEdgeFrequencies()
1240 const uint32_t C = F.Edges[I].Counter; in writeFunctionProfile()
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/GCOVProfiling/
H A Dexit-block.ll69 ; EXIT-LAST: Destination Edges
70 ; EXIT-SECOND-NOT: Destination Edges
73 ; EXIT-LAST-NOT: Destination Edges
74 ; EXIT-SECOND: Destination Edges
/llvm-project-15.0.7/clang-tools-extra/pseudo/lib/grammar/
H A DLRGraph.cpp170 for (const auto &E : Edges) { in dumpForTests()
196 Edges.push_back({Src, Dst, Label}); in buildLR0()
215 Edges.shrink_to_fit(); in buildLR0()
219 return LRGraph(std::move(States), std::move(Edges), std::move(Recoveries), in buildLR0()
227 std::vector<Edge> Edges; in buildLR0() member in clang::pseudo::LRGraph::buildLR0::Builder
/llvm-project-15.0.7/bolt/include/bolt/Passes/
H A DInstrumentationSummary.h95 std::vector<EdgeDescription> Edges; member
134 Func.Edges.size() * sizeof(EdgeDescription) + in getFDSize()

123