| /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 | 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()
427 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const { in operator()
431 bool operator()(Graph::ConstNodeItr n1, Graph::ConstNodeItr n2) const { in operator()
438 bool operator()(Graph::EdgeItr e1, Graph::EdgeItr e2) const { in operator()
442 bool operator()(Graph::ConstEdgeItr e1, Graph::ConstEdgeItr e2) const { in operator()
[all …]
|
| D | Solution.h | 30 typedef std::map<Graph::ConstNodeItr, unsigned,
77 void setSelection(Graph::NodeItr nItr, unsigned selection) { in setSelection()
84 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 | 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/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()
|
| 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 | 45 const ScheduleDAG *Graph) { in hasNodeAddressLabel()
53 const ScheduleDAG *Graph) { in getEdgeAttributes()
62 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
64 const ScheduleDAG *Graph) { in getNodeAttributes()
|
| D | RegAllocPBQP.cpp | 121 typedef std::vector<PBQP::Graph::NodeItr> NodeVector;
161 unsigned PBQPRAProblem::getVRegForNode(PBQP::Graph::ConstNodeItr node) const { in getVRegForNode()
167 PBQP::Graph::NodeItr PBQPRAProblem::getNodeForVReg(unsigned vreg) const { in getNodeForVReg()
200 PBQP::Graph &g = p->getGraph(); in build()
253 PBQP::Graph::NodeItr node = in build()
279 PBQP::Graph::EdgeItr edge = in build()
324 PBQP::Graph &g = p->getGraph(); in build()
371 PBQP::Graph::NodeItr node = p->getNodeForVReg(src); in build()
377 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst); in build()
378 PBQP::Graph::NodeItr node2 = p->getNodeForVReg(src); 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()
|
| D | DFGScoreBoard.h | 45 ScoreBoard(Graph& graph, uint32_t firstTemporary) in ScoreBoard()
114 Graph& m_graph;
|
| D | DFGAliasTracker.h | 45 AliasTracker(Graph& graph) in AliasTracker()
113 Graph& m_graph;
|
| D | DFGByteCodeParser.h | 42 bool parse(Graph&, JSGlobalData*, CodeBlock*);
|
| D | DFGJITCompiler.h | 109 JITCompiler(JSGlobalData* globalData, Graph& dfg, CodeBlock* codeBlock) in JITCompiler()
119 Graph& graph() { return m_graph; } in graph()
316 Graph& m_graph;
|
| /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()
|
| /external/llvm/include/llvm/Support/ |
| D | DataFlow.h | 65 return G.Graph;
86 return G.Graph;
|
| D | CFG.h | 283 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
296 return G.Graph;
345 return &G.Graph->getEntryBlock();
351 return &G.Graph->getEntryBlock();
|
| /external/clang/lib/AST/ |
| D | StmtViz.cpp | 35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) { in getNodeLabel()
|