| /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/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| D | HeuristicSolver.h | 43 typedef std::list<Graph::EdgeItr> SolverEdges;
58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) { in addSolverEdge()
104 Graph &g;
107 std::vector<Graph::NodeItr> stack;
120 HeuristicSolverImpl(Graph &g) : g(g), h(*this) {} in HeuristicSolverImpl()
125 Graph& getGraph() { return g; } in getGraph()
130 HeuristicNodeData& getHeuristicNodeData(Graph::NodeItr nItr) { in getHeuristicNodeData()
137 HeuristicEdgeData& getHeuristicEdgeData(Graph::EdgeItr eItr) { in getHeuristicEdgeData()
146 SolverEdgeItr solverEdgesBegin(Graph::NodeItr nItr) { in solverEdgesBegin()
155 SolverEdgeItr solverEdgesEnd(Graph::NodeItr nItr) { in solverEdgesEnd()
[all …]
|
| D | HeuristicBase.h | 55 typedef std::list<Graph::NodeItr> OptimalList;
58 Graph &g;
66 void addToOptimalReductionList(Graph::NodeItr nItr) { in addToOptimalReductionList()
86 Graph& getGraph() { return g; } in getGraph()
108 bool shouldOptimallyReduce(Graph::NodeItr nItr) { in shouldOptimallyReduce()
121 void addToOptimalReduceList(Graph::NodeItr nItr) { in addToOptimalReduceList()
133 for (Graph::NodeItr nItr = g.nodesBegin(), nEnd = g.nodesEnd(); in setup()
153 Graph::NodeItr nItr = optimalList.front(); in optimalReduce()
188 void addToHeuristicList(Graph::NodeItr nItr) { in addToHeuristicList()
202 void preUpdateEdgeCosts(Graph::EdgeItr eItr) { in preUpdateEdgeCosts()
[all …]
|
| D | Graph.h | 27 class Graph {
139 inline void copyFrom(const Graph &other);
143 Graph() : numNodes(0), numEdges(0) {} in Graph() function
148 Graph(const Graph &other) : numNodes(0), numEdges(0) { in Graph() function
159 Graph& operator=(const Graph &other) {
176 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr, in addEdge()
390 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const { in operator()
394 bool operator()(Graph::ConstNodeItr n1, Graph::ConstNodeItr n2) const { in operator()
401 bool operator()(Graph::EdgeItr e1, Graph::EdgeItr e2) const { in operator()
405 bool operator()(Graph::ConstEdgeItr e1, Graph::ConstEdgeItr e2) const { in operator()
[all …]
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/ |
| D | Briggs.h | 51 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { in operator()
64 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { in operator()
78 Graph *g;
81 typedef std::list<Graph::NodeItr> RNAllocableList;
84 typedef std::list<Graph::NodeItr> RNUnallocableList;
127 bool shouldOptimallyReduce(Graph::NodeItr nItr) { in shouldOptimallyReduce()
137 void addToHeuristicReduceList(Graph::NodeItr nItr) { in addToHeuristicReduceList()
163 Graph::NodeItr nItr = *rnaItr; in heuristicReduce()
172 Graph::NodeItr nItr = *rnuItr; in heuristicReduce()
184 void preUpdateEdgeCosts(Graph::EdgeItr eItr) { in preUpdateEdgeCosts()
[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/v8/src/compiler/ |
| D | graph.cc | 19 Graph::Graph(Zone* zone) in Graph() function in v8::internal::compiler::Graph
28 void Graph::Decorate(Node* node) { in Decorate()
35 void Graph::AddDecorator(GraphDecorator* decorator) { in AddDecorator()
40 void Graph::RemoveDecorator(GraphDecorator* decorator) { in RemoveDecorator()
46 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs, in NewNode()
53 Node* Graph::NewNodeUnchecked(const Operator* op, int input_count, in NewNodeUnchecked()
62 Node* Graph::CloneNode(const Node* node) { in CloneNode()
70 NodeId Graph::NextNodeId() { in NextNodeId()
76 void Graph::Print() const { in Print()
|
| D | pipeline.h | 23 class Graph; variable
35 CompilationInfo* info, Graph* graph, CallDescriptor* descriptor,
42 Graph* graph, Schedule* schedule,
53 Graph* graph,
65 Graph* graph,
|
| D | select-lowering.h | 16 class Graph; variable
22 SelectLowering(Graph* graph, CommonOperatorBuilder* common);
29 Graph* graph() const { return graph_; } in graph()
32 Graph* graph_;
|
| D | tail-call-optimization.h | 17 class Graph; variable
24 TailCallOptimization(CommonOperatorBuilder* common, Graph* graph) in TailCallOptimization()
31 Graph* graph() const { return graph_; } in graph()
34 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/swiftshader/third_party/LLVM/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 21 class Graph { class
24 Graph(const Graph&);
25 Graph& operator=(const Graph&);
106 Graph() { in Graph() function in llvm::Graph
162 friend class Graph;
233 struct GraphTraits<Graph<N> > {
234 typedef typename Graph<N>::NodeType NodeType;
235 typedef typename Graph<N>::ChildIterator ChildIteratorType;
237 static inline NodeType *getEntryNode(const Graph<N> &G) { return G.AccessNode(0); } in getEntryNode()
239 return Graph<N>::child_begin(Node); in child_begin()
[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/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| D | DOTGraphTraitsPass.h | 30 Analysis *Graph; in runOnFunction() local
32 Graph = &getAnalysis<Analysis>(); in runOnFunction()
33 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph); in runOnFunction()
35 ViewGraph(Graph, Name, Simple, Title); in runOnFunction()
57 Analysis *Graph; in runOnFunction() local
63 Graph = &getAnalysis<Analysis>(); in runOnFunction()
66 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph); in runOnFunction()
70 WriteGraph(File, Graph, Simple, Title); in runOnFunction()
|
| /external/llvm/lib/Analysis/ |
| D | CFLGraph.h | 144 CFLGraph Graph; variable
153 CFLGraph &Graph; variable
182 if (Graph.addNode(InstantiatedValue{GVal, 0},
184 Graph.addNode(InstantiatedValue{GVal, 1}, getAttrUnknown());
187 if (Graph.addNode(InstantiatedValue{CExpr, 0}))
191 Graph.addNode(InstantiatedValue{Val, 0}, Attr);
201 Graph.addEdge(InstantiatedValue{From, 0}, InstantiatedValue{To, 0},
212 Graph.addNode(InstantiatedValue{From, 1}); in addDerefEdge()
213 Graph.addEdge(InstantiatedValue{From, 1}, InstantiatedValue{To, 0}); in addDerefEdge()
218 : AA(Builder.Analysis), TLI(Builder.TLI), Graph(Builder.Graph), in GetEdgesVisitor()
[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/swiftshader/third_party/LLVM/include/llvm/Support/ |
| D | DOTGraphTraits.h | 45 static std::string getGraphName(const GraphType& Graph) { return ""; } in getGraphName()
51 static std::string getGraphProperties(const GraphType& Graph) { in getGraphProperties()
71 std::string getNodeLabel(const void *Node, const GraphType& Graph) { in getNodeLabel()
78 static bool hasNodeAddressLabel(const void *Node, const GraphType& Graph) { in hasNodeAddressLabel()
86 const GraphType& Graph) { in getNodeAttributes()
94 const GraphType& Graph) { in getEdgeAttributes()
146 static void addCustomGraphFeatures(const GraphType& Graph, GraphWriter &GW) {} in addCustomGraphFeatures()
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 43 PBQP::Graph& getGraph() { return graph; } in getGraph()
45 const PBQP::Graph& getGraph() const { return graph; } in getGraph()
54 void recordVReg(unsigned vreg, PBQP::Graph::NodeItr node, in recordVReg()
66 unsigned getVRegForNode(PBQP::Graph::ConstNodeItr node) const;
69 PBQP::Graph::NodeItr getNodeForVReg(unsigned vreg) const;
94 typedef std::map<PBQP::Graph::ConstNodeItr, unsigned,
96 typedef DenseMap<unsigned, PBQP::Graph::NodeItr> VReg2Node;
99 PBQP::Graph graph;
|
| /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 | 48 class Graph : public GraphBase {
82 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
113 NIds[0] = NIds[1] = Graph::invalidNodeId(); in invalidate()
119 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { in connectToN()
126 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo()
135 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
149 void disconnectFromN(Graph &G, unsigned NIdx) { in disconnectFromN()
157 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
238 Graph(const Graph &Other) {} in Graph() function
239 void operator=(const Graph &Other) {}
[all …]
|