Home
last modified time | relevance | path

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

12

/src/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);
104 const_iterator begin() const { return Edges.begin(); } in begin()
105 const_iterator end() const { return Edges.end(); } in end()
106 iterator begin() { return Edges.begin(); } in begin()
107 iterator end() { return Edges.end(); } in end()
108 const EdgeType &front() const { return *Edges.front(); } in front()
[all …]
H A DSCCIterator.h331 for (auto &Edge : Node->Edges) { in scc_member_iterator()
368 for (auto &Edge : Node->Edges) { in scc_member_iterator()
/src/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h58 edges Edges; member
133 iterator begin() { return Root.Edges.begin(); } in begin()
134 iterator end() { return Root.Edges.end(); } in end()
145 Root.Edges.emplace(&Root, ProfiledFunctions[Name], 0); in addProfiledFunction()
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);
[all …]
/src/contrib/llvm-project/llvm/include/llvm/XRay/
H A DGraph.h112 EdgeMapT Edges;
254 : M(G.Edges), A(A), NL(isOut ? G.OutNeighbors : G.InNeighbors) {} in InOutEdgeView()
321 iterator begin() { return G.Edges.begin(); } in begin()
322 iterator end() { return G.Edges.end(); } in end()
323 const_iterator cbegin() const { return G.Edges.cbegin(); } in cbegin()
324 const_iterator cend() const { return G.Edges.cend(); } in cend()
325 const_iterator begin() const { return G.Edges.begin(); } in begin()
326 const_iterator end() const { return G.Edges.end(); } in end()
327 size_type size() const { return G.Edges.size(); } in size()
328 bool empty() const { return G.Edges.empty(); } in empty()
[all …]
/src/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()
259 auto &E = Edges[EdgeIndexMap.find(&N)->second];
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;
331 bool isPopulated() const { return Edges.has_value(); } in isPopulated()
348 return const_cast<EdgeSequence &>(*Edges);
[all …]
H A DBlockFrequencyInfoImpl.h608 std::deque<const IrrNode *> Edges;
614 iterator pred_begin() const { return Edges.begin(); }
615 iterator succ_begin() const { return Edges.begin() + NumIn; }
617 iterator succ_end() const { return Edges.end(); }
/src/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 __anonb853a5be0111::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()
626 auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size()); in hardenLoadsWithPlugin() local
634 Edges[Graph->getEdgeIndex(E)] = Graph->getNodeIndex(*E.getDest()); in hardenLoadsWithPlugin()
637 OptimizeCut(Nodes.get(), Graph->nodes_size(), Edges.get(), EdgeValues.get(), in hardenLoadsWithPlugin()
/src/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()
263 : CurEId(CurEId), EndEId(G.Edges.size()), FreeEdgeIds(G.FreeEdgeIds) { in EdgeItr()
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()
[all …]
/src/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()
60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge() argument
63 if (!EdgeIndexMap.try_emplace(&N, Edges.size()).second) in addEdge()
67 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
71 assert(!Edges && "Must not have already populated the edges for this node!"); in populateSlow()
76 Edges = EdgeSequence(); in populateSlow()
105 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), in populateSlow()
[all …]
H A DBlockFrequencyInfoImpl.cpp666 Irr.Edges.push_back(&SuccIrr); in addEdge()
667 SuccIrr.Edges.push_front(&Irr); in addEdge()
H A DModuleSummaryAnalysis.cpp574 SetVector<ValueInfo, std::vector<ValueInfo>> &Edges, in computeFunctionSummary()
578 findRefEdges(Index, I, Edges, Cache, HasLocalIFuncCallOrRef); in computeFunctionSummary()
/src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp96 Edges = std::vector<std::vector<Edge>>(NodeCount, std::vector<Edge>()); in initialize()
114 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()
221 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex]; in computeAugmentingPathCapacity()
270 for (uint64_t EdgeIdx = 0; EdgeIdx < Edges[Src].size(); EdgeIdx++) { in findAugmentingPath()
[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()
755 for (const auto &[ChainSucc, Edge] : ChainPred->Edges) { in mergeChainPairs()
[all …]
/src/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineBlockPlacement.cpp575 MutableArrayRef<SmallVector<WeightedEdge, 8>> Edges);
1022 Edges) { in getBestNonConflictingEdges() argument
1032 llvm::stable_sort(Edges[0], Cmp); in getBestNonConflictingEdges()
1033 llvm::stable_sort(Edges[1], Cmp); in getBestNonConflictingEdges()
1034 auto BestA = Edges[0].begin(); in getBestNonConflictingEdges()
1035 auto BestB = Edges[1].begin(); in getBestNonConflictingEdges()
1080 SmallVector<WeightedEdge, 8> Edges[2]; in getBestTrellisSuccessor() local
1092 Edges[SuccIndex].push_back({EdgeFreq, SuccPred, Succ}); in getBestTrellisSuccessor()
1099 std::tie(BestA, BestB) = getBestNonConflictingEdges(BB, Edges); in getBestTrellisSuccessor()
1273 std::vector<MachineBasicBlock *> Edges; in precomputeTriangleChains() member
[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()
/src/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp233 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; in iterativelySimplifyCFG() local
234 FindFunctionBackedges(F, Edges); in iterativelySimplifyCFG()
236 for (const auto &Edge : Edges) in iterativelySimplifyCFG()
/src/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DJITLink.h316 Edges.push_back(Edge(K, Offset, Target, Addend)); in addEdge()
321 void addEdge(const Edge &E) { Edges.push_back(E); } in addEdge()
325 return make_range(Edges.begin(), Edges.end()); in edges()
330 return make_range(Edges.begin(), Edges.end()); in edges()
334 size_t edges_size() const { return Edges.size(); } in edges_size()
337 bool edges_empty() const { return Edges.empty(); } in edges_empty()
341 edge_iterator removeEdge(edge_iterator I) { return Edges.erase(I); } in removeEdge()
357 std::vector<Edge> Edges; variable
/src/contrib/llvm-project/llvm/include/llvm/IR/
H A DModuleSummaryIndex.h852 makeDummyFunctionSummary(std::vector<FunctionSummary::EdgeTy> Edges) {
860 std::vector<ValueInfo>(), std::move(Edges),
1543 std::vector<FunctionSummary::EdgeTy> Edges;
1548 Edges.push_back(std::make_pair(P.first, CalleeInfo{}));
1550 if (Edges.empty()) {
1554 auto CallGraphRoot = FunctionSummary::makeDummyFunctionSummary(Edges);
/src/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()
201 NodeSet &Ns = Edges[Q[I]]; in color()
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()
[all …]
/src/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMemProfContextDisambiguation.cpp290 auto *Edges = getEdgesWithAllocInfo(); in getContextIds() local
291 if (!Edges) in getContextIds()
294 for (auto &Edge : *Edges) in getContextIds()
297 for (auto &Edge : *Edges) in getContextIds()
306 auto *Edges = getEdgesWithAllocInfo(); in computeAllocType() local
307 if (!Edges) in computeAllocType()
312 for (auto &Edge : *Edges) { in computeAllocType()
324 auto *Edges = getEdgesWithAllocInfo(); in emptyContextIds() local
325 if (!Edges) in emptyContextIds()
327 for (auto &Edge : *Edges) { in emptyContextIds()
[all …]
/src/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp1672 std::vector<DisplayEdge> Edges; member in __anon270b9d5b2a11::DisplayNode
1770 Edges.emplace_back(Value.str(), Node, Colour); in createEdge()
1778 for (auto &E : Edges) in createEdgeMap()
1798 Edges(DN.Edges) {}
1845 std::vector<unsigned> Edges; member in __anon270b9d5b2a11::DotCfgDiffNode
2092 for (auto I : Edges) { in createDisplayEdges()
2107 Edges.emplace_back(E.first); in finalize()
/src/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DGCOV.h279 using Edges = SmallVector<GCOVArc *, 4>; variable
/src/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp1076 static uint64_t sumEdgeCount(const ArrayRef<PGOUseEdge *> Edges) { in sumEdgeCount() argument
1078 for (const auto &E : Edges) { in sumEdgeCount()
1188 void setEdgeCount(DirectEdges &Edges, uint64_t Value);
1294 void PGOUseFunc::setEdgeCount(DirectEdges &Edges, uint64_t Value) { in setEdgeCount() argument
1295 for (auto &E : Edges) { in setEdgeCount()

12