Home
last modified time | relevance | path

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

12

/freebsd-14.2/contrib/llvm-project/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 …]
H A DSCCIterator.h331 for (auto &Edge : Node->Edges) { in scc_member_iterator()
368 for (auto &Edge : Node->Edges) { in scc_member_iterator()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h58 edges Edges; member
158 auto &Edges = ProfiledFunctions[CallerName]->Edges; variable
159 auto EdgeIt = Edges.find(Edge);
160 if (EdgeIt == Edges.end()) {
161 Edges.insert(Edge);
165 Edges.erase(EdgeIt);
166 Edges.insert(Edge);
197 auto &Edges = Node.second->Edges; variable
198 auto I = Edges.begin();
199 while (I != Edges.end()) {
[all …]
/freebsd-14.2/contrib/llvm-project/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 …]
/freebsd-14.2/contrib/llvm-project/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 std::optional<EdgeSequence> Edges; variable
[all …]
H A DBlockFrequencyInfoImpl.h611 std::deque<const IrrNode *> Edges;
617 iterator pred_begin() const { return Edges.begin(); }
618 iterator succ_begin() const { return Edges.begin() + NumIn; }
620 iterator succ_end() const { return Edges.end(); }
/freebsd-14.2/contrib/llvm-project/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 …]
/freebsd-14.2/contrib/llvm-project/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 ArrayRef(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 …]
H A DX86DomainReassignment.cpp301 DenseSet<Register> Edges; member in __anon72b853df0111::Closure
331 bool empty() const { return Edges.empty(); } in empty()
333 bool insertEdge(Register Reg) { return Edges.insert(Reg).second; } in insertEdge()
337 return iterator_range<const_edge_iterator>(Edges.begin(), Edges.end()); in edges()
351 for (Register Reg : Edges) { in dump()
H A DX86LoadValueInjectionLoadHardening.cpp108 unsigned int *Edges, int *EdgeValues,
123 std::unique_ptr<Edge[]> Edges, size_type NodesSize, in MachineGadgetGraph()
125 : GraphT(std::move(Nodes), std::move(Edges), NodesSize, EdgesSize), in MachineGadgetGraph()
627 auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size()); in hardenLoadsWithPlugin() local
635 Edges[Graph->getEdgeIndex(E)] = Graph->getNodeIndex(*E.getDest()); in hardenLoadsWithPlugin()
638 OptimizeCut(Nodes.get(), Graph->nodes_size(), Edges.get(), EdgeValues.get(), in hardenLoadsWithPlugin()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp42 EdgeIndexMap.try_emplace(&TargetN, Edges.size()); in insertEdgeInternal()
43 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
47 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK); in setEdgeKind()
55 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
67 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
76 Edges = EdgeSequence(); in populateSlow()
105 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), in populateSlow()
119 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F), in populateSlow()
127 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F), in populateSlow()
130 return *Edges; in populateSlow()
[all …]
H A DBlockFrequencyInfoImpl.cpp681 Irr.Edges.push_back(&SuccIrr); in addEdge()
682 SuccIrr.Edges.push_front(&Irr); in addEdge()
H A DModuleSummaryAnalysis.cpp533 SetVector<ValueInfo, std::vector<ValueInfo>> &Edges, in computeFunctionSummary()
537 findRefEdges(Index, I, Edges, Cache); in computeFunctionSummary()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp114 for (auto &Edge : Edges[Src]) { in run()
142 SrcEdge.RevEdgeIndex = Edges[Dst].size(); in addEdge()
149 DstEdge.RevEdgeIndex = Edges[Src].size(); in addEdge()
151 Edges[Src].push_back(SrcEdge); in addEdge()
152 Edges[Dst].push_back(DstEdge); in addEdge()
164 for (const auto &Edge : Edges[Src]) { in getFlow()
174 for (const auto &Edge : Edges[Src]) { in getFlow()
271 auto &Edge = Edges[Src][EdgeIdx]; in findAugmentingPath()
387 for (auto &Edge : Edges[Src]) { in findAugmentingDAG()
511 for (auto &Edge : Edges[Src]) { in identifyShortestEdges()
[all …]
H A DCodeLayout.cpp307 for (const auto &[Chain, ChainEdge] : Edges) { in getEdge()
315 auto It = Edges.begin(); in removeEdge()
316 while (It != Edges.end()) { in removeEdge()
318 Edges.erase(It); in removeEdge()
326 Edges.push_back(std::make_pair(Other, Edge)); in addEdge()
347 Edges.clear(); in clear()
348 Edges.shrink_to_fit(); in clear()
363 std::vector<std::pair<ChainT *, ChainEdge *>> Edges; member
475 for (const auto &[DstChain, DstEdge] : Other->Edges) { in mergeEdges()
975 for (auto EdgeIt : Into->Edges) in mergeChains()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineBlockPlacement.cpp1017 Edges) { in getBestNonConflictingEdges() argument
1027 llvm::stable_sort(Edges[0], Cmp); in getBestNonConflictingEdges()
1028 llvm::stable_sort(Edges[1], Cmp); in getBestNonConflictingEdges()
1029 auto BestA = Edges[0].begin(); in getBestNonConflictingEdges()
1030 auto BestB = Edges[1].begin(); in getBestNonConflictingEdges()
1075 SmallVector<WeightedEdge, 8> Edges[2]; in getBestTrellisSuccessor() local
1268 std::vector<MachineBasicBlock *> Edges; in precomputeTriangleChains() member
1271 : Edges({src, dst}) {} in precomputeTriangleChains()
1276 Edges.push_back(dst); in precomputeTriangleChains()
1282 return Edges.back(); in precomputeTriangleChains()
[all …]
H A DAggressiveAntiDepBreaker.cpp257 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep *> &Edges) { in AntiDepEdges() argument
262 Edges.push_back(&Pred); in AntiDepEdges()
804 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
806 AntiDepEdges(PathSU, Edges); in BreakAntiDependencies()
822 for (const SDep *Edge : Edges) { in BreakAntiDependencies()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp228 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; in iterativelySimplifyCFG() local
229 FindFunctionBackedges(F, Edges); in iterativelySimplifyCFG()
231 for (const auto &Edge : Edges) in iterativelySimplifyCFG()
H A DJumpThreading.cpp527 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges; in findLoopHeaders() local
528 FindFunctionBackedges(F, Edges); in findLoopHeaders()
530 for (const auto &Edge : Edges) in findLoopHeaders()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DJITLink.h315 Edges.push_back(Edge(K, Offset, Target, Addend)); in addEdge()
320 void addEdge(const Edge &E) { Edges.push_back(E); } in addEdge()
324 return make_range(Edges.begin(), Edges.end()); in edges()
329 return make_range(Edges.begin(), Edges.end()); in edges()
333 size_t edges_size() const { return Edges.size(); } in edges_size()
336 bool edges_empty() const { return Edges.empty(); } in edges_empty()
340 edge_iterator removeEdge(edge_iterator I) { return Edges.erase(I); } in removeEdge()
356 std::vector<Edge> Edges; variable
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/
H A DModuleSummaryIndex.h810 makeDummyFunctionSummary(std::vector<FunctionSummary::EdgeTy> Edges) {
818 std::vector<ValueInfo>(), std::move(Edges),
1498 std::vector<FunctionSummary::EdgeTy> Edges;
1503 Edges.push_back(std::make_pair(P.first, CalleeInfo{}));
1505 if (Edges.empty()) {
1509 auto CallGraphRoot = FunctionSummary::makeDummyFunctionSummary(Edges);
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAGHVX.cpp137 std::map<Node,NodeSet> Edges; member
178 Edges[I].insert(PC); in build()
189 NodeSet &Is = Edges[I]; in build()
212 NodeSet &Ns = Edges[N]; in color()
220 for (auto E : Edges) { in color()
233 for (auto E : Edges) { in color()
240 NodeSet &Ns = Edges[N]; in color()
251 NodeSet &Cs = Edges[C]; in color()
258 Edges[M].insert(C); in color()
260 Edges[M].erase(N); in color()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp1579 std::vector<DisplayEdge> Edges; member in __anonb0928b5c2a11::DisplayNode
1677 Edges.emplace_back(Value.str(), Node, Colour); in createEdge()
1685 for (auto &E : Edges) in createEdgeMap()
1705 Edges(DN.Edges) {}
1752 std::vector<unsigned> Edges; member in __anonb0928b5c2a11::DotCfgDiffNode
2000 for (auto I : Edges) { in createDisplayEdges()
2015 Edges.emplace_back(E.first); in finalize()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DGCOV.h279 using Edges = SmallVector<GCOVArc *, 4>; variable
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp1025 static uint64_t sumEdgeCount(const ArrayRef<PGOUseEdge *> Edges) { in sumEdgeCount() argument
1027 for (const auto &E : Edges) { in sumEdgeCount()
1134 void setEdgeCount(DirectEdges &Edges, uint64_t Value);
1240 void PGOUseFunc::setEdgeCount(DirectEdges &Edges, uint64_t Value) { in setEdgeCount() argument
1241 for (auto &E : Edges) { in setEdgeCount()

12