| /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 …]
|
| D | nv50_ir_ssa.cpp | 32 class DominatorTree : public Graph
35 DominatorTree(Graph *cfg);
52 Graph *cfg;
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph), in DominatorTree()
97 void DominatorTree::buildDFS(Graph::Node *node) in buildDFS()
101 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { in buildDFS()
144 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) { in build()
175 nw->attach(nv, Graph::Edge::TREE); in build()
229 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in buildLiveSetsPreSSA()
270 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in buildDefSetsPreSSA()
[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()
|
| D | parameter_block_ordering.cc | 49 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeStableSchurOrdering()
75 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeSchurOrdering()
94 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeRecursiveIndependentSetOrdering()
112 Graph<ParameterBlock*>*
114 Graph<ParameterBlock*>* graph = CHECK_NOTNULL(new Graph<ParameterBlock*>); in CreateHessianGraph()
|
| D | canonical_views_clustering.cc | 64 const Graph<int>& graph,
77 const Graph<int>* graph_;
88 const Graph<int>& graph, in ComputeCanonicalViewsClustering()
101 const Graph<int>& graph, in ComputeClustering()
153 if (graph_->VertexWeight(*view) != Graph<int>::InvalidWeight()) { in FindValidViews()
|
| /external/llvm/include/llvm/Analysis/ |
| D | DOTGraphTraitsPass.h | 40 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnFunction() local
41 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
44 ViewGraph(Graph, Name, IsSimple, Title); in runOnFunction()
67 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnFunction() local
74 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
78 WriteGraph(File, Graph, IsSimple, Title); in runOnFunction()
104 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
105 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnModule()
107 ViewGraph(Graph, Name, IsSimple, Title); in runOnModule()
130 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/v8/src/compiler/ |
| D | pipeline.h | 20 class Graph; variable
34 Handle<Code> GenerateCodeForMachineGraph(Linkage* linkage, Graph* graph,
50 Schedule* ComputeSchedule(Graph* graph);
51 void VerifyAndPrintGraph(Graph* graph, const char* phase);
52 Handle<Code> GenerateCode(Linkage* linkage, Graph* graph, Schedule* schedule,
|
| D | typer.h | 23 void Run(Graph* graph, MaybeHandle<Context> context);
24 void Narrow(Graph* graph, Node* node, MaybeHandle<Context> context);
25 void Widen(Graph* graph, Node* node, MaybeHandle<Context> context);
27 void DecorateGraph(Graph* graph);
|
| D | graph-reducer.h | 15 class Graph; variable
58 explicit GraphReducer(Graph* graph);
60 Graph* graph() const { return graph_; } in graph()
70 Graph* graph_;
|
| D | graph-visualizer.h | 17 class Graph; variable
20 explicit AsDOT(const Graph& g) : graph(g) {} in AsDOT()
21 const Graph& graph;
|
| D | scheduler.h | 24 static Schedule* ComputeSchedule(Graph* graph);
31 static void ComputeCFG(Graph* graph, Schedule* schedule);
48 Graph* graph_;
55 Scheduler(Zone* zone, Graph* graph, Schedule* schedule);
|
| D | graph-replay.h | 15 class Graph; variable
23 static void PrintReplay(Graph* graph);
25 static void PrintReplay(Graph* graph) {}
|
| D | graph.cc | 21 Graph::Graph(Zone* zone) : GenericGraph<Node>(zone), decorators_(zone) {} in Graph() function in v8::internal::compiler::Graph
24 Node* Graph::NewNode(const Operator* op, int input_count, Node** inputs) { in NewNode()
|
| D | graph-inl.h | 16 void Graph::VisitNodeUsesFrom(Node* node, Visitor* visitor) { in VisitNodeUsesFrom()
23 void Graph::VisitNodeUsesFromStart(Visitor* visitor) { in VisitNodeUsesFromStart()
29 void Graph::VisitNodeInputsFromEnd(Visitor* visitor) { in VisitNodeInputsFromEnd()
|
| /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 …]
|
| /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/llvm/lib/CodeGen/ |
| D | ScheduleDAGPrinter.cpp | 47 const ScheduleDAG *Graph) { in hasNodeAddressLabel()
55 const ScheduleDAG *Graph) { in getEdgeAttributes()
64 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
66 const ScheduleDAG *Graph) { in getNodeAttributes()
|
| /external/opencv/cvaux/src/ |
| D | cvlcm.cpp | 54 CvGraph* Graph; member
303 LCM.Graph = cvCreateGraph(CV_SEQ_KIND_GRAPH|CV_GRAPH_FLAG_ORIENTED, in cvLinearContorModelFromVoronoiDiagram()
309 cvReleaseLinearContorModelStorage(&LCM.Graph); in cvLinearContorModelFromVoronoiDiagram()
313 return LCM.Graph; in cvLinearContorModelFromVoronoiDiagram()
316 CV_IMPL int cvReleaseLinearContorModelStorage(CvGraph** Graph) in cvReleaseLinearContorModelStorage() argument
325 if(!Graph || !(*Graph)) in cvReleaseLinearContorModelStorage()
328 LCMNodeSeq = (CvSeq*)(*Graph); in cvReleaseLinearContorModelStorage()
329 LCMEdgeSeq = (CvSeq*)(*Graph)->edges; in cvReleaseLinearContorModelStorage()
342 if((*Graph)->storage) in cvReleaseLinearContorModelStorage()
343 cvReleaseMemStorage(&(*Graph)->storage); in cvReleaseLinearContorModelStorage()
[all …]
|
| /external/v8/test/cctest/compiler/ |
| D | graph-builder-tester.h | 25 explicit DirectGraphBuilder(Graph* graph) : GraphBuilder(graph) {} in DirectGraphBuilder()
54 Graph* graph_;
62 : main_graph_(new (zone) Graph(zone)), in GraphAndBuilders()
68 Graph* main_graph_;
|