/external/srec/tools/grxmlcompile/ |
H A D | grph.h | 23 class Graph class 26 Graph (const char *name) function in class:Graph 36 ~Graph()
|
/external/chromium_org/v8/src/compiler/ |
H A D | graph.cc | 21 Graph::Graph(Zone* zone) : GenericGraph<Node>(zone), decorators_(zone) {} function in class:v8::internal::compiler::Graph 24 Node* Graph::NewNode(const Operator* op, int input_count, Node** inputs) {
|
H A D | graph.h | 23 class Graph : public GenericGraph<Node> { class in namespace:v8::internal::compiler 25 explicit Graph(Zone* zone);
|
/external/clang/lib/AST/ |
H A D | StmtViz.cpp | 35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) { argument
|
/external/llvm/include/llvm/ADT/ |
H A D | GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===// 79 const GraphType &Graph; member in struct:llvm::Inverse 81 inline Inverse(const GraphType &G) : Graph(G) {} 92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
|
/external/llvm/include/llvm/Analysis/ |
H A D | DOTGraphTraitsPass.h | 40 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); variable 41 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); 44 ViewGraph(Graph, Name, IsSimple, Title); 67 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); variable 74 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); 78 WriteGraph(File, Graph, IsSimple, Title); 104 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); variable 105 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph); 107 ViewGraph(Graph, Name, IsSimple, Title); 130 GraphT Graph variable [all...] |
H A D | CFGPrinter.h | 92 const Function *Graph) { 94 return getSimpleNodeLabel(Node, Graph); 96 return getCompleteNodeLabel(Node, Graph); 91 getNodeLabel(const BasicBlock *Node, const Function *Graph) argument
|
/external/llvm/lib/Analysis/IPA/ |
H A D | CallPrinter.cpp | 28 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; } argument 30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { argument
|
/external/llvm/unittests/ADT/ |
H A D | SCCIteratorTest.cpp | 19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8. 21 class Graph { class in namespace:llvm 24 Graph(const Graph&); 25 Graph& operator=(const Graph&); 40 assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!"); 105 /// Graph - Default constructor. Creates an empty graph. 106 Graph() { 131 // on taking a constant Graph [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Graph.java | 36 public class Graph { class
|
/external/ceres-solver/internal/ceres/ |
H A D | graph.h | 49 class Graph { class in namespace:ceres::internal 51 Graph() {} function in class:ceres::internal::Graph 155 CERES_DISALLOW_COPY_AND_ASSIGN(Graph);
|
/external/chromium_org/cc/layers/ |
H A D | heads_up_display_layer_impl.h | 53 class Graph { class in class:cc::HeadsUpDisplayLayerImpl 55 Graph(double indicator_value, double start_upper_bound); 99 const Graph& graph) const; 130 Graph fps_graph_; 131 Graph paint_time_graph_;
|
/external/llvm/lib/CodeGen/ |
H A D | ScheduleDAGPrinter.cpp | 48 const ScheduleDAG *Graph) { 56 const ScheduleDAG *Graph) { 65 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph); 67 const ScheduleDAG *Graph) { 98 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName()); 47 hasNodeAddressLabel(const SUnit *Node, const ScheduleDAG *Graph) argument 54 getEdgeAttributes(const SUnit *Node, SUnitIterator EI, const ScheduleDAG *Graph) argument 66 getNodeAttributes(const SUnit *N, const ScheduleDAG *Graph) argument
|
H A D | MachineBlockFrequencyInfo.cpp | 91 const MachineBlockFrequencyInfo *Graph) { 98 Graph->printBlockFreq(OS, Node); 101 OS << Graph->getBlockFreq(Node).getFrequency(); 90 getNodeLabel(const MachineBasicBlock *Node, const MachineBlockFrequencyInfo *Graph) argument
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.cpp | 31 Graph::Graph() function in class:nv50_ir::Graph 38 Graph::~Graph() 44 void Graph::insert(Node *node) 53 void Graph::Edge::unlink() 73 const char *Graph::Edge::typeStr() const 87 Graph::Node::Node(void *priv) : data(priv), 95 void Graph::Node::attach(Node *node, Edge::Type kind) 129 bool Graph [all...] |
H A 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 class in namespace:nv50_ir 72 friend class Graph; 79 EdgeIterator(Graph::Edge *first, int dir, bool reverse) 87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]); 99 Graph::Edge *e; 100 Graph::Edge *t; 129 Graph *getGraph() const { return graph; } 136 Graph *grap [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.cpp | 31 Graph::Graph() function in class:nv50_ir::Graph 38 Graph::~Graph() 44 void Graph::insert(Node *node) 53 void Graph::Edge::unlink() 73 const char *Graph::Edge::typeStr() const 87 Graph::Node::Node(void *priv) : data(priv), 95 void Graph::Node::attach(Node *node, Edge::Type kind) 129 bool Graph [all...] |
H A 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 class in namespace:nv50_ir 72 friend class Graph; 79 EdgeIterator(Graph::Edge *first, int dir, bool reverse) 87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]); 99 Graph::Edge *e; 100 Graph::Edge *t; 129 Graph *getGraph() const { return graph; } 136 Graph *grap [all...] |
/external/chromium_org/v8/tools/ |
H A D | run_perf.py | 178 class Graph(Node): class in inherits:Node 184 super(Graph, self).__init__() 225 class Trace(Graph): 264 class Runnable(Graph): 376 return Graph(suite, parent, arch)
|
/external/llvm/lib/Analysis/ |
H A D | DomPrinter.cpp | 34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) { argument
|
H A D | RegionPrinter.cpp | 41 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) { argument 65 return "Region Graph";
|
H A D | BlockFrequencyInfo.cpp | 84 const BlockFrequencyInfo *Graph) { 91 Graph->printBlockFreq(OS, Node); 94 OS << Graph->getBlockFreq(Node).getFrequency(); 83 getNodeLabel(const BasicBlock *Node, const BlockFrequencyInfo *Graph) argument
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGPrinter.cpp | 84 const SelectionDAG *Graph) { 92 const SelectionDAG *Graph) { 112 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph); 114 const SelectionDAG *Graph) { 116 const std::string &Attrs = Graph->getGraphAttrs(N); 83 hasNodeAddressLabel(const SDNode *Node, const SelectionDAG *Graph) argument 91 getEdgeAttributes(const void *Node, EdgeIter EI, const SelectionDAG *Graph) argument 113 getNodeAttributes(const SDNode *N, const SelectionDAG *Graph) argument
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | RegAllocSolver.h | 22 #include "Graph.h" 148 typedef PBQP::Graph<RegAllocSolverImpl> Graph; typedef in class:PBQP::RegAlloc::RegAllocSolverImpl 150 RegAllocSolverImpl(Graph &G) : G(G) {} 330 SpillCostComparator(const Graph& G) : G(G) {} 337 const Graph& G; 340 Graph& G; 347 typedef Graph<RegAllocSolverImpl> Graph; typedef in namespace:PBQP::RegAlloc 349 inline Solution solve(Graph [all...] |
/external/opencv/cvaux/src/ |
H A D | cvlcm.cpp | 54 CvGraph* Graph; member in struct:CvLCM 303 LCM.Graph = cvCreateGraph(CV_SEQ_KIND_GRAPH|CV_GRAPH_FLAG_ORIENTED, 309 cvReleaseLinearContorModelStorage(&LCM.Graph); 313 return LCM.Graph; 316 CV_IMPL int cvReleaseLinearContorModelStorage(CvGraph** Graph) argument 325 if(!Graph || !(*Graph)) 328 LCMNodeSeq = (CvSeq*)(*Graph); 329 LCMEdgeSeq = (CvSeq*)(*Graph)->edges; 342 if((*Graph) [all...] |