| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| D | nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
35 class Graph
72 friend class Graph; variable
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse) in EdgeIterator()
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]); in next()
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph; } in getGraph()
136 Graph *graph;
[all …]
|
| D | nv50_ir_graph.cpp | 31 Graph::Graph() in Graph() function in nv50_ir::Graph
38 Graph::~Graph() in ~Graph()
44 void Graph::insert(Node *node) in insert()
53 void Graph::Edge::unlink() in unlink()
73 const char *Graph::Edge::typeStr() const in typeStr()
87 Graph::Node::Node(void *priv) : data(priv), in Node()
95 void Graph::Node::attach(Node *node, Edge::Type kind) in attach()
129 bool Graph::Node::detach(Graph::Node *node) in detach()
144 void Graph::Node::cut() in cut()
158 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) in Edge()
[all …]
|
| D | nv50_ir_bb.cpp | 102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) { in clone()
113 Graph::Node *dn = dom.parent(); in idom()
310 Graph::Edge *e = cfg.outgoing(true).getEdge(); in splitCommon()
322 this->cfg.attach(&bb->cfg, Graph::Edge::TREE); in splitCommon()
351 Graph::Node *bn = &that->dom; in dominatedBy()
352 Graph::Node *dn = &this->dom; in dominatedBy()
363 Graph::Node *out[2]; in initiatesSimpleConditional()
365 Graph::Edge::Type eR; in initiatesSimpleConditional()
371 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next()) in initiatesSimpleConditional()
376 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK) in initiatesSimpleConditional()
[all …]
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| D | graph.rst | 1 :mod:`altgraph.Graph` --- Basic directional graphs
4 .. module:: altgraph.Graph
7 The module :mod:`altgraph.Graph` provides a class :class:`Graph` that
10 .. class:: Graph([edges])
12 Constructs a new empty :class:`Graph` object. If the optional
26 .. method:: Graph.add_node(node[, node_data])
38 .. method:: Graph.hide_node(node)
47 .. method:: Graph.restore_node(node)
55 .. method:: Graph.restore_all_nodes()
59 .. method:: Graph.number_of_nodes()
[all …]
|
| D | changelog.rst | 94 - ``altgraph.Graph.add_edge(a, b, create_nodes=False)`` will
98 - ``altgraph.Graph.forw_topo_sort`` failed for some sparse graphs.
100 - ``altgraph.Graph.back_topo_sort`` was completely broken in
103 - ``altgraph.Graph.forw_bfs_subgraph`` now actually works.
105 - ``altgraph.Graph.back_bfs_subgraph`` now actually works.
107 - ``altgraph.Graph.iterdfs`` now returns the correct result
110 - ``altgraph.Graph.iterdata`` now returns the correct result
116 - The ``altgraph.Graph`` constructor now accepts an argument
121 - ``altgraph.Graph.Graph.add_node`` has no effect when you
124 - The private method ``altgraph.Graph._bfs`` is no longer
[all …]
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| D | TestTopologicalSort.java | 30 import org.antlr.misc.Graph;
39 Graph g = new Graph(); in testFairlyLargeGraph()
60 Graph g = new Graph(); in testCyclicGraph()
74 Graph g = new Graph(); in testRepeatedEdges()
88 Graph g = new Graph(); in testSimpleTokenDependence()
102 Graph g = new Graph(); in testParserLexerCombo()
|
| /external/ceres-solver/internal/ceres/ |
| D | graph_test.cc | 40 TEST(Graph, EmptyGraph) { in TEST() argument
41 Graph<int> graph; in TEST()
45 TEST(Graph, AddVertexAndEdge) { in TEST() argument
46 Graph<int> graph; in TEST()
61 TEST(Graph, AddVertexIdempotence) { in TEST() argument
62 Graph<int> graph; in TEST()
86 TEST(Graph, DieOnNonExistentVertex) { in TEST() argument
87 Graph<int> graph; in TEST()
96 TEST(Graph, NonExistentEdge) { in TEST() argument
97 Graph<int> graph; in TEST()
|
| D | graph_algorithms_test.cc | 44 Graph<int> graph; in TEST()
74 Graph<int> graph; in TEST()
105 Graph<int> graph; in TEST()
111 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph)); in TEST()
122 Graph<int> graph; in TEST()
134 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph)); in TEST()
169 Graph<int> graph; in TEST()
201 Graph<int> graph; in TEST()
|
| D | graph_algorithms.h | 51 explicit VertexTotalOrdering(const Graph<Vertex>& graph) in VertexTotalOrdering()
62 const Graph<Vertex>& graph_;
68 explicit VertexDegreeLessThan(const Graph<Vertex>& graph) in VertexDegreeLessThan()
76 const Graph<Vertex>& graph_;
96 int IndependentSetOrdering(const Graph<Vertex>& graph, in IndependentSetOrdering()
172 int StableIndependentSetOrdering(const Graph<Vertex>& graph, in StableIndependentSetOrdering()
273 Graph<Vertex>*
274 Degree2MaximumSpanningForest(const Graph<Vertex>& graph) { in Degree2MaximumSpanningForest()
277 Graph<Vertex>* forest = new Graph<Vertex>(); in Degree2MaximumSpanningForest()
|
| /external/v8/src/compiler/ |
| D | graph.cc | 18 Graph::Graph(Zone* zone) in Graph() function in v8::internal::compiler::Graph
27 void Graph::Decorate(Node* node) { in Decorate()
34 void Graph::AddDecorator(GraphDecorator* decorator) { in AddDecorator()
39 void Graph::RemoveDecorator(GraphDecorator* decorator) { in RemoveDecorator()
46 Node* Graph::NewNode(const Operator* op, int input_count, Node** inputs, in NewNode()
54 Node* Graph::NewNodeUnchecked(const Operator* op, int input_count, in NewNodeUnchecked()
63 Node* Graph::CloneNode(const Node* node) { in CloneNode()
71 NodeId Graph::NextNodeId() { in NextNodeId()
|
| D | tail-call-optimization.h | 16 class Graph; variable
23 TailCallOptimization(CommonOperatorBuilder* common, Graph* graph) in TailCallOptimization()
30 Graph* graph() const { return graph_; } in graph()
33 Graph* const graph_;
|
| D | select-lowering.h | 19 class Graph; variable
25 SelectLowering(Graph* graph, CommonOperatorBuilder* common);
37 Graph* graph() const { return graph_; } in graph()
40 Graph* graph_;
|
| D | graph-visualizer.h | 18 class Graph; variable
28 AsJSON(const Graph& g, SourcePositionTable* p) : graph(g), positions(p) {} in AsJSON()
29 const Graph& graph;
36 explicit AsRPO(const Graph& g) : graph(g) {} in AsRPO()
37 const Graph& graph;
|
| D | graph-trimmer.h | 15 class Graph; variable
21 GraphTrimmer(Zone* zone, Graph* graph);
44 Graph* graph() const { return graph_; } in graph()
46 Graph* const graph_;
|
| D | control-flow-optimizer.h | 17 class Graph; variable
24 ControlFlowOptimizer(Graph* graph, CommonOperatorBuilder* common,
37 Graph* graph() const { return graph_; } in graph()
42 Graph* const graph_;
|
| /external/llvm/include/llvm/Analysis/ |
| D | DOTGraphTraitsPass.h | 55 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction() local
56 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
59 ViewGraph(Graph, Name, IsSimple, Title); in runOnFunction()
97 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction() local
104 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
108 WriteGraph(File, Graph, IsSimple, Title); in runOnFunction()
134 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
135 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnModule()
137 ViewGraph(Graph, Name, IsSimple, Title); in runOnModule()
160 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
[all …]
|
| /external/llvm/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 21 class Graph { class
24 Graph(const Graph&);
25 Graph& operator=(const Graph&);
104 Graph() { in Graph() function in llvm::Graph
160 friend class Graph;
231 struct GraphTraits<Graph<N> > {
232 typedef typename Graph<N>::NodeType NodeType;
233 typedef typename Graph<N>::ChildIterator ChildIteratorType;
235 static inline NodeType *getEntryNode(const Graph<N> &G) { return G.AccessNode(0); } in getEntryNode()
237 return Graph<N>::child_begin(Node); in child_begin()
[all …]
|
| /external/testng/src/test/java/test/ |
| D | GraphTest.java | 6 import org.testng.internal.Graph;
21 Graph<String> g = new Graph<>(); in sort()
54 Graph<String> g = createCyclicGraph(); in cycleShouldFail()
60 Graph<String> g = null; in cycleShouldBeCorrect()
72 private Graph<String> createCyclicGraph() { in createCyclicGraph()
73 Graph<String> g = new Graph<>(); in createCyclicGraph()
87 Graph<String> g = new Graph<>(); in findPredecessors()
149 Graph<String> g = new Graph<>(); in findPredecessorsTiming()
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| D | test_dot.py | 5 from altgraph import Graph
12 g = Graph.Graph([
81 g = Graph.Graph([])
94 g = Graph.Graph([
126 g = Graph.Graph([
158 g = Graph.Graph([
249 g = Graph.Graph([
285 g = Graph.Graph([
|
| D | test_graph.py | 4 from altgraph.Graph import Graph
9 graph = Graph()
68 graph = Graph()
170 graph = Graph()
208 graph = Graph()
248 graph = Graph()
258 self.assertTrue(isinstance(subgraph, Graph))
264 self.assertTrue(isinstance(subgraph, Graph))
281 graph = Graph()
291 self.assertTrue(isinstance(subgraph, Graph))
[all …]
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 49 class Graph : public GraphBase {
83 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
114 NIds[0] = NIds[1] = Graph::invalidNodeId(); in invalidate()
120 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { in connectToN()
127 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo()
136 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
150 void disconnectFromN(Graph &G, unsigned NIdx) { in disconnectFromN()
158 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
239 Graph(const Graph &Other) {} in Graph() function
240 void operator=(const Graph &Other) {}
[all …]
|
| /external/opencv3/modules/calib3d/src/ |
| D | circlesgrid.hpp | 82 class Graph class
92 Graph(size_t n);
160 …void drawBasisGraphs(const std::vector<Graph> &basisGraphs, cv::Mat &drawImg, bool drawEdges = tru…
164 void computeRNG(Graph &rng, std::vector<cv::Point2f> &vectors, cv::Mat *drawImage = 0) const;
165 void rng2gridGraph(Graph &rng, std::vector<cv::Point2f> &vectors) const;
166 void eraseUsedGraph(std::vector<Graph> &basisGraphs) const;
169 std::vector<Graph> &basisGraphs);
170 void findMCS(const std::vector<cv::Point2f> &basis, std::vector<Graph> &basisGraphs);
171 size_t findLongestPath(std::vector<Graph> &basisGraphs, Path &bestPath);
172 …float computeGraphConfidence(const std::vector<Graph> &basisGraphs, bool addRow, const std::vector…
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | GraphTraits.h | 79 const GraphType &Graph; member
81 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse()
92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/ |
| D | PKG-INFO | 111 - ``altgraph.Graph.add_edge(a, b, create_nodes=False)`` will
115 - ``altgraph.Graph.forw_topo_sort`` failed for some sparse graphs.
117 - ``altgraph.Graph.back_topo_sort`` was completely broken in
120 - ``altgraph.Graph.forw_bfs_subgraph`` now actually works.
122 - ``altgraph.Graph.back_bfs_subgraph`` now actually works.
124 - ``altgraph.Graph.iterdfs`` now returns the correct result
127 - ``altgraph.Graph.iterdata`` now returns the correct result
133 - The ``altgraph.Graph`` constructor now accepts an argument
138 - ``altgraph.Graph.Graph.add_node`` has no effect when you
141 - The private method ``altgraph.Graph._bfs`` is no longer
[all …]
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph.egg-info/ |
| D | PKG-INFO | 111 - ``altgraph.Graph.add_edge(a, b, create_nodes=False)`` will
115 - ``altgraph.Graph.forw_topo_sort`` failed for some sparse graphs.
117 - ``altgraph.Graph.back_topo_sort`` was completely broken in
120 - ``altgraph.Graph.forw_bfs_subgraph`` now actually works.
122 - ``altgraph.Graph.back_bfs_subgraph`` now actually works.
124 - ``altgraph.Graph.iterdfs`` now returns the correct result
127 - ``altgraph.Graph.iterdata`` now returns the correct result
133 - The ``altgraph.Graph`` constructor now accepts an argument
138 - ``altgraph.Graph.Graph.add_node`` has no effect when you
141 - The private method ``altgraph.Graph._bfs`` is no longer
[all …]
|