Home
last modified time | relevance | path

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

1234

/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DDirectedGraph.h77 explicit DGNode(EdgeType &E) : Edges() { Edges.insert(&E); } in DGNode()
80 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {} in DGNode()
81 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {} in DGNode()
84 Edges = N.Edges;
88 Edges = std::move(N.Edges);
97 const_iterator begin() const { return Edges.begin(); } in begin()
98 const_iterator end() const { return Edges.end(); } in end()
99 iterator begin() { return Edges.begin(); } in begin()
100 iterator end() { return Edges.end(); } in end()
101 const EdgeType &front() const { return *Edges.front(); } in front()
[all …]
/external/llvm-project/llvm/include/llvm/ADT/
DDirectedGraph.h77 explicit DGNode(EdgeType &E) : Edges() { Edges.insert(&E); } in DGNode()
80 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {} in DGNode()
81 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {} in DGNode()
84 Edges = N.Edges;
88 Edges = std::move(N.Edges);
97 const_iterator begin() const { return Edges.begin(); } in begin()
98 const_iterator end() const { return Edges.end(); } in end()
99 iterator begin() { return Edges.begin(); } in begin()
100 iterator end() { return Edges.end(); } in end()
101 const EdgeType &front() const { return *Edges.front(); } in front()
[all …]
/external/llvm-project/llvm/test/Analysis/DDG/
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:
56 ; CHECK-NEXT: Edges:none!
62 ; CHECK-NEXT: Edges:
68 ; CHECK-NEXT: Edges:
[all …]
Dbasic-a.ll10 ; CHECK-NEXT: Edges:
16 ; CHECK-NEXT: Edges:
19 ; CHECK-NEXT: Edges:
28 ; CHECK-NEXT: Edges:none!
33 ; CHECK-NEXT: Edges:
40 ; CHECK-NEXT: Edges:
46 ; CHECK-NEXT: Edges:
52 ; CHECK-NEXT: Edges:
58 ; CHECK-NEXT: Edges:none!
96 ; CHECK-NEXT: Edges:
[all …]
Dbasic-b.ll10 ; CHECK-NEXT: Edges:
16 ; CHECK-NEXT: Edges:
19 ; CHECK-NEXT: Edges:
29 ; CHECK-NEXT: Edges:none!
34 ; CHECK-NEXT: Edges:
41 ; CHECK-NEXT: Edges:
48 ; CHECK-NEXT: Edges:
56 ; CHECK-NEXT: Edges:
62 ; CHECK-NEXT: Edges:
68 ; CHECK-NEXT: Edges:
[all …]
/external/llvm-project/llvm/include/llvm/XRay/
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 …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/XRay/
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 …]
/external/angle/third_party/vulkan-deps/glslang/src/Test/baseResults/
Dhlsl.hull.6.tesc.out7 …antHS(struct-VSOutput-vf4-vf31[1];u1;f1[2]; ( temp structure{ temp 4-element array of float Edges})
15 0:19 Edges: direct index for structure ( temp 4-element array of float)
16 0:19 'Factors' ( temp structure{ temp 4-element array of float Edges})
25 0:20 Edges: direct index for structure ( temp 4-element array of float)
26 0:20 'Factors' ( temp structure{ temp 4-element array of float Edges})
35 0:21 Edges: direct index for structure ( temp 4-element array of float)
36 0:21 'Factors' ( temp structure{ temp 4-element array of float Edges})
45 0:22 Edges: direct index for structure ( temp 4-element array of float)
46 0:22 'Factors' ( temp structure{ temp 4-element array of float Edges})
68 0:27 'Factors' ( temp structure{ temp 4-element array of float Edges})
[all …]
/external/deqp-deps/glslang/Test/baseResults/
Dhlsl.hull.6.tesc.out7 …antHS(struct-VSOutput-vf4-vf31[1];u1;f1[2]; ( temp structure{ temp 4-element array of float Edges})
15 0:19 Edges: direct index for structure ( temp 4-element array of float)
16 0:19 'Factors' ( temp structure{ temp 4-element array of float Edges})
25 0:20 Edges: direct index for structure ( temp 4-element array of float)
26 0:20 'Factors' ( temp structure{ temp 4-element array of float Edges})
35 0:21 Edges: direct index for structure ( temp 4-element array of float)
36 0:21 'Factors' ( temp structure{ temp 4-element array of float Edges})
45 0:22 Edges: direct index for structure ( temp 4-element array of float)
46 0:22 'Factors' ( temp structure{ temp 4-element array of float Edges})
68 0:27 'Factors' ( temp structure{ temp 4-element array of float Edges})
[all …]
/external/angle/third_party/vulkan-deps/glslang/src/Test/
Dhlsl.hull.6.tesc11 float Edges[4] : SV_TessFactor;
19 Factors.Edges[0] = 2.5;
20 Factors.Edges[1] = 4.25;
21 Factors.Edges[2] = 5.75;
22 Factors.Edges[3] = 7.5;
/external/deqp-deps/glslang/Test/
Dhlsl.hull.6.tesc11 float Edges[4] : SV_TessFactor;
19 Factors.Edges[0] = 2.5;
20 Factors.Edges[1] = 4.25;
21 Factors.Edges[2] = 5.75;
22 Factors.Edges[3] = 7.5;
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DLazyCallGraph.h258 iterator begin() { return iterator(Edges.begin(), Edges.end()); } in begin()
259 iterator end() { return iterator(Edges.end(), Edges.end()); } in end()
261 Edge &operator[](int i) { return Edges[i]; }
264 auto &E = Edges[EdgeIndexMap.find(&N)->second];
273 auto &E = Edges[EI->second]; in lookup()
278 return call_iterator(Edges.begin(), Edges.end()); in call_begin()
280 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); } in call_end()
287 for (auto &E : Edges) in empty()
295 VectorT Edges;
343 bool isPopulated() const { return Edges.hasValue(); } in isPopulated()
[all …]
/external/llvm-project/llvm/include/llvm/Analysis/
DLazyCallGraph.h258 iterator begin() { return iterator(Edges.begin(), Edges.end()); } in begin()
259 iterator end() { return iterator(Edges.end(), Edges.end()); } in end()
261 Edge &operator[](int i) { return Edges[i]; }
264 auto &E = Edges[EdgeIndexMap.find(&N)->second];
273 auto &E = Edges[EI->second]; in lookup()
278 return call_iterator(Edges.begin(), Edges.end()); in call_begin()
280 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); } in call_end()
287 for (auto &E : Edges) in empty()
295 VectorT Edges;
343 bool isPopulated() const { return Edges.hasValue(); } in isPopulated()
[all …]
/external/llvm-project/llvm/test/Analysis/LazyCallGraph/
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 …]
/external/llvm/test/Analysis/LazyCallGraph/
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 …]
/external/llvm-project/llvm/utils/TableGen/GlobalISel/
DGIMatchDag.h79 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()
/external/llvm-project/clang-tools-extra/clangd/index/
DBackgroundIndexLoader.cpp56 std::vector<Path> Edges = {}; in loadShard() local
59 return {LS, Edges}; in loadShard()
67 return {LS, Edges}; in loadShard()
79 Edges.push_back(*AbsPath); in loadShard()
90 return {LS, Edges}; in loadShard()
/external/llvm-project/llvm/lib/Target/X86/
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 …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/
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 …]
/external/llvm-project/llvm/include/llvm/CodeGen/PBQP/
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 …]
/external/llvm/include/llvm/CodeGen/PBQP/
DGraph.h188 EdgeVector Edges; variable
202 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
203 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()
225 Edges[EId] = std::move(E); in addConstructedEdge()
227 EId = Edges.size(); in addConstructedEdge()
228 Edges.push_back(std::move(E)); in addConstructedEdge()
280 : CurEId(CurEId), EndEId(G.Edges.size()), FreeEdgeIds(G.FreeEdgeIds) { in EdgeItr()
320 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); } in end()
321 bool empty() const { return G.Edges.empty(); } in empty()
323 return G.Edges.size() - G.FreeEdgeIds.size(); in size()
[all …]
/external/bcc/tools/
Ddeadlock_detector_example.txt269 Mutexes: 0, Edges: 0
270 Mutexes: 532, Edges: 411
271 Mutexes: 735, Edges: 675
272 Mutexes: 1118, Edges: 1278
273 Mutexes: 1666, Edges: 2185
274 Mutexes: 2056, Edges: 2694
275 Mutexes: 2245, Edges: 2906
276 Mutexes: 2656, Edges: 3479
277 Mutexes: 2813, Edges: 3785
290 Mutexes: 0, Edges: 0
[all …]
/external/llvm-project/llvm/lib/Analysis/
DLazyCallGraph.cpp44 EdgeIndexMap.insert({&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.insert({&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 …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DLazyCallGraph.cpp44 EdgeIndexMap.insert({&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.insert({&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 …]
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h207 mutable EdgeVectorT Edges; variable
240 return edge_iterator(Edges.begin(), Edges.end()); in begin()
242 edge_iterator end() const { return edge_iterator(Edges.end(), Edges.end()); } in end()
244 const Edge &operator[](int i) const { return Edges[i]; }
247 return Edges[EdgeIndexMap.find(&F)->second];
252 return call_edge_iterator(Edges.begin(), Edges.end()); in call_begin()
255 return call_edge_iterator(Edges.end(), Edges.end()); in call_end()

1234