| /external/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()
203 void preUpdateEdgeCosts(Graph::EdgeItr eItr) { in preUpdateEdgeCosts()
[all …]
|
| D | Graph.h | 28 class Graph {
144 inline void copyFrom(const Graph &other);
148 Graph() : numNodes(0), numEdges(0) {}
153 Graph(const Graph &other) : numNodes(0), numEdges(0) {
164 Graph& operator=(const Graph &other) {
181 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr,
432 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const {
436 bool operator()(Graph::ConstNodeItr n1, Graph::ConstNodeItr n2) const {
443 bool operator()(Graph::EdgeItr e1, Graph::EdgeItr e2) const {
447 bool operator()(Graph::ConstEdgeItr e1, Graph::ConstEdgeItr e2) const {
[all …]
|
| D | Solution.h | 29 typedef std::map<Graph::ConstNodeItr, unsigned,
76 void setSelection(Graph::NodeItr nItr, unsigned selection) { in setSelection()
83 unsigned getSelection(Graph::ConstNodeItr nItr) const { in getSelection()
|
| /external/srec/tools/grxmlcompile/ |
| D | gr_iface.cpp | 30 int Graph::addSubGraph (SubGraph *sbGraph) in addSubGraph()
68 int Graph::getSubGraphIndex (int subId) in getSubGraphIndex()
76 int Graph::getSubGraphIndex (SubGraph *sGraph) in getSubGraphIndex()
86 void Graph::BeginRule (SubGraph *subg) in BeginRule()
95 void Graph::EndRule (SubGraph *subg) in EndRule()
104 void Graph::BeginItem (SubGraph *subg) in BeginItem()
113 void Graph::BeginItemRepeat (SubGraph *subg, int minCount, int maxCount) in BeginItemRepeat()
122 void Graph::AddRuleRef (SubGraph *subg, int ruleNo) in AddRuleRef()
132 void Graph::AddLabel (SubGraph *subg, int labNo) in AddLabel()
141 void Graph::AddTag (SubGraph *subg, int tagNo) in AddTag()
[all …]
|
| D | grph.h | 23 class Graph
26 Graph (const char *name) in Graph() function
36 ~Graph() in ~Graph()
|
| /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
| D | Briggs.h | 50 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { in operator()
63 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { in operator()
77 Graph *g;
80 typedef std::list<Graph::NodeItr> RNAllocableList;
83 typedef std::list<Graph::NodeItr> RNUnallocableList;
126 bool shouldOptimallyReduce(Graph::NodeItr nItr) { in shouldOptimallyReduce()
136 void addToHeuristicReduceList(Graph::NodeItr nItr) { in addToHeuristicReduceList()
162 Graph::NodeItr nItr = *rnaItr; in heuristicReduce()
171 Graph::NodeItr nItr = *rnuItr; in heuristicReduce()
183 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/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()
|
| D | parameter_block_ordering.cc | 49 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeSchurOrdering()
68 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeRecursiveIndependentSetOrdering()
86 Graph<ParameterBlock*>*
88 Graph<ParameterBlock*>* graph = CHECK_NOTNULL(new Graph<ParameterBlock*>); in CreateHessianGraph()
|
| D | graph_algorithms.h | 48 explicit VertexDegreeLessThan(const Graph<Vertex>& graph) in VertexDegreeLessThan()
59 const Graph<Vertex>& graph_;
79 int IndependentSetOrdering(const Graph<Vertex>& graph, in IndependentSetOrdering()
181 Graph<Vertex>*
182 Degree2MaximumSpanningForest(const Graph<Vertex>& graph) { in Degree2MaximumSpanningForest()
185 Graph<Vertex>* forest = new Graph<Vertex>(); in Degree2MaximumSpanningForest()
|
| D | canonical_views_clustering.cc | 58 void ComputeClustering(const Graph<int>& graph,
72 const Graph<int>* graph_;
82 const Graph<int>& graph, in ComputeCanonicalViewsClustering()
95 const Graph<int>& graph, in ComputeClustering()
148 if (graph_->VertexWeight(*view) != Graph<int>::InvalidWeight()) { in FindValidViews()
|
| D | graph.h | 48 class Graph {
50 Graph() {} in Graph() function
154 CERES_DISALLOW_COPY_AND_ASSIGN(Graph);
|
| D | visibility.cc | 72 Graph<int>* CreateSchurComplementGraph(const vector<set<int> >& visibility) { in CreateSchurComplementGraph()
118 Graph<int>* graph = new Graph<int>(); in CreateSchurComplementGraph()
|
| /external/llvm/include/llvm/Analysis/ |
| D | DOTGraphTraitsPass.h | 29 Analysis *Graph = &getAnalysis<Analysis>(); in runOnFunction() local
30 std::string GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph); in runOnFunction()
33 ViewGraph(Graph, Name, Simple, Title); in runOnFunction()
54 Analysis *Graph = &getAnalysis<Analysis>(); in runOnFunction() local
61 std::string GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph); in runOnFunction()
65 WriteGraph(File, Graph, Simple, Title); in runOnFunction()
89 Analysis *Graph = &getAnalysis<Analysis>(); in runOnModule() local
90 std::string Title = DOTGraphTraits<Analysis*>::getGraphName(Graph); in runOnModule()
92 ViewGraph(Graph, Name, Simple, Title); in runOnModule()
113 Analysis *Graph = &getAnalysis<Analysis>(); in runOnModule() local
[all …]
|
| D | CFGPrinter.h | 76 const Function *Graph) {
78 return getSimpleNodeLabel(Node, Graph);
80 return getCompleteNodeLabel(Node, Graph);
|
| /external/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/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/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 | 49 const ScheduleDAG *Graph) { in hasNodeAddressLabel()
57 const ScheduleDAG *Graph) { in getEdgeAttributes()
66 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
68 const ScheduleDAG *Graph) { in getNodeAttributes()
|
| D | RegAllocPBQP.cpp | 160 unsigned PBQPRAProblem::getVRegForNode(PBQP::Graph::ConstNodeItr node) const { in getVRegForNode()
166 PBQP::Graph::NodeItr PBQPRAProblem::getNodeForVReg(unsigned vreg) const { in getNodeForVReg()
199 PBQP::Graph &g = p->getGraph(); in build()
250 PBQP::Graph::NodeItr node = in build()
276 PBQP::Graph::EdgeItr edge = in build()
321 PBQP::Graph &g = p->getGraph(); in build()
368 PBQP::Graph::NodeItr node = p->getNodeForVReg(src); in build()
374 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst); in build()
375 PBQP::Graph::NodeItr node2 = p->getNodeForVReg(src); in build()
376 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2); in build()
[all …]
|
| /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/webkit/Source/JavaScriptCore/dfg/ |
| D | DFGGraph.cpp | 44 void Graph::dump(NodeIndex nodeIndex, CodeBlock* codeBlock) in dump()
125 void Graph::dump(CodeBlock* codeBlock) in dump()
138 void Graph::refChildren(NodeIndex op) in refChildren()
158 void Graph::derefChildren(NodeIndex op) in derefChildren()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | SelectionDAGPrinter.cpp | 83 const SelectionDAG *Graph) { in hasNodeAddressLabel()
91 const SelectionDAG *Graph) { in getEdgeAttributes()
111 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph);
113 const SelectionDAG *Graph) { in getNodeAttributes()
115 const std::string &Attrs = Graph->getGraphAttrs(N); in getNodeAttributes()
|