| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | DirectedGraph.h | 79 explicit DGNode(EdgeType &E) : Edges() { Edges.insert(&E); } in DGNode()
82 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {} in DGNode()
83 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {} in DGNode()
86 Edges = N.Edges;
90 Edges = std::move(N.Edges);
103 const_iterator begin() const { return Edges.begin(); } in begin()
104 const_iterator end() const { return Edges.end(); } in end()
105 iterator begin() { return Edges.begin(); } in begin()
106 iterator end() { return Edges.end(); } in end()
107 const EdgeType &front() const { return *Edges.front(); } in front()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/XRay/ |
| H A D | Graph.h | 112 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 …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 256 iterator begin() { return iterator(Edges.begin(), Edges.end()); } in begin()
257 iterator end() { return iterator(Edges.end(), Edges.end()); } in end()
261 auto &E = Edges[EdgeIndexMap.find(&N)->second];
270 auto &E = Edges[EI->second]; in lookup()
275 return call_iterator(Edges.begin(), Edges.end()); in call_begin()
277 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); } in call_end()
284 for (auto &E : Edges) in empty()
292 VectorT Edges;
333 bool isPopulated() const { return Edges.hasValue(); } in isPopulated()
350 return const_cast<EdgeSequence &>(*Edges);
[all …]
|
| H A D | BlockFrequencyInfoImpl.h | 611 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(); }
|
| /netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchDag.h | 79 EdgesVec Edges; variable
88 : Ctx(Ctx), InstrNodes(), PredicateNodes(), Edges(), in GIMatchDag()
94 return raw_pointer_iterator<EdgesVec::iterator>(Edges.begin()); in edges_begin()
97 return raw_pointer_iterator<EdgesVec::iterator>(Edges.end()); in edges_end()
100 return raw_pointer_iterator<EdgesVec::const_iterator>(Edges.begin()); in edges_begin()
103 return raw_pointer_iterator<EdgesVec::const_iterator>(Edges.end()); in edges_end()
202 Edges.push_back(std::move(Obj)); in addEdge()
222 size_t getNumEdges() const { return Edges.size(); } in getNumEdges()
|
| H A D | GIMatchDag.cpp | 59 for (const auto &E : Edges) { in writeDOTGraph()
116 for (const auto &E : Edges) { in print()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 173 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 …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| H A D | ImmutableGraph.h | 62 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 …]
|
| H A D | X86DomainReassignment.cpp | 301 DenseSet<Register> Edges; member in __anoncbde8b740111::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 D | X86LoadValueInjectionLoadHardening.cpp | 109 unsigned int *Edges, int *EdgeValues,
124 std::unique_ptr<Edge[]> Edges, size_type NodesSize, in MachineGadgetGraph()
126 : GraphT(std::move(Nodes), std::move(Edges), NodesSize, EdgesSize), in MachineGadgetGraph()
629 auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size()); in hardenLoadsWithPlugin() local
637 Edges[Graph->getEdgeIndex(E)] = Graph->getNodeIndex(*E.getDest()); in hardenLoadsWithPlugin()
640 OptimizeCut(Nodes.get(), Graph->nodes_size(), Edges.get(), EdgeValues.get(), in hardenLoadsWithPlugin()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 45 EdgeIndexMap.insert({&TargetN, Edges.size()}); in insertEdgeInternal()
46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
50 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK); in setEdgeKind()
58 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
63 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge() argument
66 if (!EdgeIndexMap.insert({&N, Edges.size()}).second) in addEdge()
70 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
74 assert(!Edges && "Must not have already populated the edges for this node!"); in populateSlow()
79 Edges = EdgeSequence(); in populateSlow()
108 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), in populateSlow()
[all …]
|
| H A D | CFLGraph.h | 69 EdgeList Edges, ReverseEdges; member
132 FromInfo->Edges.push_back(Edge{To, Offset});
|
| H A D | CFLSteensAliasAnalysis.cpp | 219 for (auto &Edge : ValueInfo.getNodeInfoAtLevel(I).Edges) in buildSetsFrom()
|
| H A D | CFLAndersAliasAnalysis.cpp | 618 for (auto &Edge : ValueInfo.getNodeInfoAtLevel(I).Edges) { in initializeWorkList()
684 for (const auto &AssignEdge : NodeInfo->Edges) in processWorkListItem()
|
| H A D | BlockFrequencyInfoImpl.cpp | 676 Irr.Edges.push_back(&SuccIrr); in addEdge()
677 SuccIrr.Edges.push_front(&Irr); in addEdge()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | SimplifyCFGPass.cpp | 203 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; in iterativelySimplifyCFG() local
204 FindFunctionBackedges(F, Edges); in iterativelySimplifyCFG()
206 for (unsigned i = 0, e = Edges.size(); i != e; ++i) in iterativelySimplifyCFG()
207 UniqueLoopHeaders.insert(const_cast<BasicBlock *>(Edges[i].second)); in iterativelySimplifyCFG()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | MachineBlockPlacement.cpp | 548 MutableArrayRef<SmallVector<WeightedEdge, 8>> Edges);
986 Edges) { in getBestNonConflictingEdges() argument
996 llvm::stable_sort(Edges[0], Cmp); in getBestNonConflictingEdges()
997 llvm::stable_sort(Edges[1], Cmp); in getBestNonConflictingEdges()
998 auto BestA = Edges[0].begin(); in getBestNonConflictingEdges()
999 auto BestB = Edges[1].begin(); in getBestNonConflictingEdges()
1044 SmallVector<WeightedEdge, 8> Edges[2]; in getBestTrellisSuccessor() local
1056 Edges[SuccIndex].push_back({EdgeFreq, SuccPred, Succ}); in getBestTrellisSuccessor()
1063 std::tie(BestA, BestB) = getBestNonConflictingEdges(BB, Edges); in getBestTrellisSuccessor()
1237 std::vector<MachineBasicBlock *> Edges; in precomputeTriangleChains() member
[all …]
|
| H A D | AggressiveAntiDepBreaker.cpp | 259 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep *> &Edges) { in AntiDepEdges() argument
264 Edges.push_back(&Pred); in AntiDepEdges()
824 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
826 AntiDepEdges(PathSU, Edges); in BreakAntiDependencies()
842 for (unsigned i = 0, e = Edges.size(); i != e; ++i) { in BreakAntiDependencies()
843 const SDep *Edge = Edges[i]; in BreakAntiDependencies()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ExecutionEngine/JITLink/ |
| H A D | JITLink.h | 237 Edges.push_back(Edge(K, Offset, Target, Addend)); in addEdge()
242 void addEdge(const Edge &E) { Edges.push_back(E); } in addEdge()
246 return make_range(Edges.begin(), Edges.end()); in edges()
251 return make_range(Edges.begin(), Edges.end()); in edges()
255 size_t edges_size() const { return Edges.size(); } in edges_size()
258 bool edges_empty() const { return Edges.empty(); } in edges_empty()
262 edge_iterator removeEdge(edge_iterator I) { return Edges.erase(I); } in removeEdge()
276 std::vector<Edge> Edges; variable
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| H A D | ModuleSummaryIndex.h | 612 makeDummyFunctionSummary(std::vector<FunctionSummary::EdgeTy> Edges) {
620 std::vector<ValueInfo>(), std::move(Edges),
1192 std::vector<FunctionSummary::EdgeTy> Edges;
1197 Edges.push_back(std::make_pair(P.first, CalleeInfo{}));
1199 if (Edges.empty()) {
1203 auto CallGraphRoot = FunctionSummary::makeDummyFunctionSummary(Edges);
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| H A D | HexagonISelDAGToDAGHVX.cpp | 131 std::map<Node,NodeSet> Edges; member
172 Edges[I].insert(PC); in build()
183 NodeSet &Is = Edges[I]; in build()
195 NodeSet &Ns = Edges[Q[I]]; in color()
206 NodeSet &Ns = Edges[N]; in color()
214 for (auto E : Edges) { in color()
227 for (auto E : Edges) { in color()
235 NodeSet &Ns = Edges[N]; in color()
246 NodeSet &Cs = Edges[C]; in color()
253 Edges[M].insert(C); in color()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| H A D | PGOInstrumentation.cpp | 1045 static uint64_t sumEdgeCount(const ArrayRef<PGOUseEdge *> Edges) { in sumEdgeCount() argument
1047 for (auto &E : Edges) { in sumEdgeCount()
1149 void setEdgeCount(DirectEdges &Edges, uint64_t Value);
1237 void PGOUseFunc::setEdgeCount(DirectEdges &Edges, uint64_t Value) { in setEdgeCount() argument
1238 for (auto &E : Edges) { in setEdgeCount()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/ |
| H A D | GCOV.h | 272 using Edges = SmallVector<GCOVArc *, 4>; variable
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/doc/ |
| H A D | cfg.texi | 40 * Edges:: Types of edges and their representation.
178 @node Edges
179 @section Edges
183 Edges represent possible control flow transfers from the end of some
185 a predecessor of B, and B is a successor of A@. Edges are represented
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/doc/ |
| H A D | cfg.texi | 40 * Edges:: Types of edges and their representation.
178 @node Edges
179 @section Edges
183 Edges represent possible control flow transfers from the end of some
185 a predecessor of B, and B is a successor of A@. Edges are represented
|