Home
last modified time | relevance | path

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

12

/freebsd/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()
/freebsd/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()
146 Root.Edges.emplace(&Root, It->second, 0); in addProfiledFunction()
159 auto &Edges = CallerIt->second->Edges; variable
160 auto [EdgeIt, Inserted] = Edges.insert(Edge);
164 Edges.erase(EdgeIt);
165 Edges.insert(Edge);
196 auto &Edges = Node.second->Edges; variable
197 auto I = Edges.begin();
[all …]
/freebsd/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 …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h252 iterator begin() { return iterator(Edges.begin(), Edges.end()); } in begin()
253 iterator end() { return iterator(Edges.end(), Edges.end()); } in end()
257 auto &E = Edges[EdgeIndexMap.find(&N)->second];
266 auto &E = Edges[EI->second]; in lookup()
271 return call_iterator(Edges.begin(), Edges.end()); in call_begin()
273 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); } in call_end()
280 for (auto &E : Edges) in empty()
288 VectorT Edges;
329 bool isPopulated() const { return Edges.has_value(); } in isPopulated()
346 return const_cast<EdgeSequence &>(*Edges);
[all …]
H A DGenericDomTreeUpdaterImpl.h375 splitDTCriticalEdges(ArrayRef<CriticalEdge> Edges) { in splitDTCriticalEdges() argument
377 if (!DT || Edges.empty()) in splitDTCriticalEdges()
387 for (auto &Edge : Edges) in splitDTCriticalEdges()
393 SmallBitVector IsNewIDom(Edges.size(), true); in splitDTCriticalEdges()
397 for (const auto &[Idx, Edge] : enumerate(Edges)) { in splitDTCriticalEdges()
432 for (const auto &[Idx, Edge] : enumerate(Edges)) { in splitDTCriticalEdges()
448 splitPDTCriticalEdges(ArrayRef<CriticalEdge> Edges) { in splitPDTCriticalEdges() argument
450 if (!PDT || Edges.empty()) in splitPDTCriticalEdges()
454 for (const auto &Edge : Edges) { in splitPDTCriticalEdges()
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DJITLink.cpp246 auto &Edges = Blocks[0]->Edges; in splitBlockImpl() local
247 llvm::sort(Edges, [](const Edge &LHS, const Edge &RHS) { in splitBlockImpl()
254 if (Edges.empty()) in splitBlockImpl()
260 if (Edges.back().getOffset() < Delta) in splitBlockImpl()
263 size_t EI = Edges.size() - 1; in splitBlockImpl()
264 while (EI != 0 && Edges[EI - 1].getOffset() >= Delta) in splitBlockImpl()
267 for (size_t J = EI; J != Edges.size(); ++J) { in splitBlockImpl()
268 Blocks[I]->Edges.push_back(std::move(Edges[J])); in splitBlockImpl()
269 Blocks[I]->Edges.back().setOffset(Blocks[I]->Edges.back().getOffset() - in splitBlockImpl()
273 while (Edges.size() > EI) in splitBlockImpl()
[all …]
/freebsd/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/
H A DGIMatchDag.h
H A DGIMatchDag.cpp
/freebsd/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.cpp293 DenseSet<Register> Edges; member in __anond9661d290111::Closure
323 bool empty() const { return Edges.empty(); } in empty()
325 bool insertEdge(Register Reg) { return Edges.insert(Reg).second; } in insertEdge()
329 return iterator_range<const_edge_iterator>(Edges.begin(), Edges.end()); in edges()
343 for (Register Reg : Edges) { in dump()
H A DX86LoadValueInjectionLoadHardening.cpp107 unsigned int *Edges, int *EdgeValues,
122 std::unique_ptr<Edge[]> Edges, size_type NodesSize, in MachineGadgetGraph()
124 : GraphT(std::move(Nodes), std::move(Edges), NodesSize, EdgesSize), in MachineGadgetGraph()
624 auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size()); in hardenLoadsWithPlugin() local
632 Edges[Graph->getEdgeIndex(E)] = Graph->getNodeIndex(*E.getDest()); in hardenLoadsWithPlugin()
635 OptimizeCut(Nodes.get(), Graph->nodes_size(), Edges.get(), EdgeValues.get(), in hardenLoadsWithPlugin()
/freebsd/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 …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp44 EdgeIndexMap.try_emplace(&TargetN, Edges.size()); in insertEdgeInternal()
45 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
49 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK); in setEdgeKind()
57 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
62 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge() argument
65 if (!EdgeIndexMap.try_emplace(&N, Edges.size()).second) in addEdge()
69 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
73 assert(!Edges && "Must not have already populated the edges for this node!"); in populateSlow()
78 Edges = EdgeSequence(); in populateSlow()
107 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), in populateSlow()
[all …]
H A DCtxProfAnalysis.cpp81 std::optional<uint64_t> getEdgeSum(const SmallVector<EdgeInfo *> &Edges, in getEdgeSum() argument
84 for (const auto *E : Edges) { in getEdgeSum()
95 bool computeCountFrom(const SmallVector<EdgeInfo *> &Edges) { in computeCountFrom() argument
97 Count = getEdgeSum(Edges, true); in computeCountFrom()
101 void setSingleUnknownEdgeCount(SmallVector<EdgeInfo *> &Edges) { in setSingleUnknownEdgeCount() argument
102 uint64_t KnownSum = getEdgeSum(Edges, false).value_or(0U); in setSingleUnknownEdgeCount()
105 for (auto *I : Edges) in setSingleUnknownEdgeCount()
/freebsd/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 …]
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVStructurizer.cpp429 createAliasBlocksForComplexEdges(std::vector<Edge> Edges) { in createAliasBlocksForComplexEdges()
432 Output.reserve(Edges.size()); in createAliasBlocksForComplexEdges()
434 for (auto &[Src, Dst] : Edges) { in createAliasBlocksForComplexEdges()
463 std::vector<Edge> &Edges) { in createSingleExitNode()
465 std::vector<Edge> FixedEdges = createAliasBlocksForComplexEdges(Edges); in createSingleExitNode()
858 auto Edges = getExitsFrom(ConstructBlocks, *Node->Header); in fixupConstruct() local
861 if (Edges.size() < 1) in fixupConstruct()
867 for (auto &[Src, Dst] : Edges) { in fixupConstruct()
891 BasicBlock *NewExit = S.createSingleExitNode(Node->Header, Edges); in fixupConstruct()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineBlockPlacement.cpp600 MutableArrayRef<SmallVector<WeightedEdge, 8>> Edges);
1083 Edges) { in getBestNonConflictingEdges() argument
1093 llvm::stable_sort(Edges[0], Cmp); in getBestNonConflictingEdges()
1094 llvm::stable_sort(Edges[1], Cmp); in getBestNonConflictingEdges()
1095 auto BestA = Edges[0].begin(); in getBestNonConflictingEdges()
1096 auto BestB = Edges[1].begin(); in getBestNonConflictingEdges()
1141 SmallVector<WeightedEdge, 8> Edges[2]; in getBestTrellisSuccessor() local
1155 Edges[SuccIndex].push_back({EdgeFreq, SuccPred, Succ}); in getBestTrellisSuccessor()
1162 std::tie(BestA, BestB) = getBestNonConflictingEdges(BB, Edges); in getBestTrellisSuccessor()
1336 std::vector<MachineBasicBlock *> Edges; in precomputeTriangleChains() member
[all …]
H A DAggressiveAntiDepBreaker.cpp256 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep *> &Edges) { in AntiDepEdges() argument
261 Edges.push_back(&Pred); in AntiDepEdges()
808 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
810 AntiDepEdges(PathSU, Edges); in BreakAntiDependencies()
826 for (const SDep *Edge : Edges) { in BreakAntiDependencies()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp236 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; in iterativelySimplifyCFG() local
237 FindFunctionBackedges(F, Edges); in iterativelySimplifyCFG()
239 for (const auto &Edge : Edges) in iterativelySimplifyCFG()
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DJITLink.h323 Edges.push_back(Edge(K, Offset, Target, Addend)); in addEdge()
328 void addEdge(const Edge &E) { Edges.push_back(E); } in addEdge()
332 return make_range(Edges.begin(), Edges.end()); in edges()
337 return make_range(Edges.begin(), Edges.end()); in edges()
353 size_t edges_size() const { return Edges.size(); } in edges_size()
356 bool edges_empty() const { return Edges.empty(); } in edges_empty()
360 edge_iterator removeEdge(edge_iterator I) { return Edges.erase(I); } in removeEdge()
376 std::vector<Edge> Edges; variable
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAGHVX.cpp133 std::map<Node,NodeSet> Edges; member
174 Edges[I].insert(PC); in build()
185 NodeSet &Is = Edges[I]; in build()
197 NodeSet &Ns = Edges[Q[I]]; in color()
208 NodeSet &Ns = Edges[N]; in color()
216 for (auto E : Edges) { in color()
229 for (auto E : Edges) { in color()
236 NodeSet &Ns = Edges[N]; in color()
247 NodeSet &Cs = Edges[C]; in color()
254 Edges[M].insert(C); in color()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp1669 std::vector<DisplayEdge> Edges; member in __anon94a753662a11::DisplayNode
1767 Edges.emplace_back(Value.str(), Node, Colour); in createEdge()
1775 for (auto &E : Edges) in createEdgeMap()
1795 Edges(DN.Edges) {}
1842 std::vector<unsigned> Edges; member in __anon94a753662a11::DotCfgDiffNode
2085 for (auto I : Edges) { in createDisplayEdges()
2100 Edges.emplace_back(E.first); in finalize()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DModuleSummaryIndex.h858 makeDummyFunctionSummary(SmallVectorImpl<FunctionSummary::EdgeTy> &&Edges) {
866 std::move(Edges), std::vector<GlobalValue::GUID>(),
1616 SmallVector<FunctionSummary::EdgeTy, 0> Edges;
1621 Edges.push_back(std::make_pair(P.first, CalleeInfo{}));
1623 return FunctionSummary::makeDummyFunctionSummary(std::move(Edges));

12