/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/lib/Analysis/ |
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
|
H A D | DomPrinter.cpp | 34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) { argument
|
H A D | BlockFrequencyInfo.cpp | 93 const BlockFrequencyInfo *Graph) { 95 return BFIDOTGTraitsBase::getNodeLabel(Node, Graph, 100 const BlockFrequencyInfo *Graph) { 101 return BFIDOTGTraitsBase::getNodeAttributes(Node, Graph, 92 getNodeLabel(const BasicBlock *Node, const BlockFrequencyInfo *Graph) argument 99 getNodeAttributes(const BasicBlock *Node, const BlockFrequencyInfo *Graph) argument
|
H A D | RegionPrinter.cpp | 44 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) { argument 67 static std::string getGraphName(const RegionInfo *) { return "Region Graph"; }
|
/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!"); 103 /// Graph - Default constructor. Creates an empty graph. 104 Graph() { 129 // on taking a constant Graph [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===// 76 const GraphType &Graph; member in struct:llvm::Inverse 78 inline Inverse(const GraphType &G) : Graph(G) {} 89 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
H A D | DOTGraphTraitsPass.h | 30 Analysis *Graph; local 32 Graph = &getAnalysis<Analysis>(); 33 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph); 35 ViewGraph(Graph, Name, Simple, Title); 57 Analysis *Graph; local 63 Graph = &getAnalysis<Analysis>(); 66 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph); 70 WriteGraph(File, Graph, Simple, Title);
|
H A D | CFGPrinter.h | 36 const Function *Graph) { 48 const Function *Graph) { 76 const Function *Graph) { 78 return getSimpleNodeLabel(Node, Graph); 80 return getCompleteNodeLabel(Node, Graph); 35 getSimpleNodeLabel(const BasicBlock *Node, const Function *Graph) argument 47 getCompleteNodeLabel(const BasicBlock *Node, const Function *Graph) argument 75 getNodeLabel(const BasicBlock *Node, const Function *Graph) argument
|
/external/swiftshader/third_party/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/llvm/include/llvm/Analysis/ |
H A D | DOTGraphTraitsPass.h | 55 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); 56 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); 59 ViewGraph(Graph, Name, IsSimple, Title); 97 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); 104 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); 108 WriteGraph(File, Graph, IsSimple, Title); 134 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); variable 135 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph); 137 ViewGraph(Graph, Name, IsSimple, Title); 160 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/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | ScheduleDAGPrinter.cpp | 47 const ScheduleDAG *Graph) { 55 const ScheduleDAG *Graph) { 64 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph); 66 const ScheduleDAG *Graph) { 90 "Scheduling-Units Graph for " + MF.getFunction()->getNameStr() + 94 "Scheduling-Units Graph for " + MF.getFunction()->getNameStr()); 46 hasNodeAddressLabel(const SUnit *Node, const ScheduleDAG *Graph) argument 53 getEdgeAttributes(const SUnit *Node, SUnitIterator EI, const ScheduleDAG *Graph) argument 65 getNodeAttributes(const SUnit *N, const ScheduleDAG *Graph) argument
|
/external/llvm/lib/CodeGen/ |
H A D | ScheduleDAGPrinter.cpp | 46 const ScheduleDAG *Graph) { 57 const ScheduleDAG *Graph) { 66 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph); 68 const ScheduleDAG *Graph) { 99 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName()); 45 getNodeIdentifierLabel(const SUnit *Node, const ScheduleDAG *Graph) argument 55 getEdgeAttributes(const SUnit *Node, SUnitIterator EI, const ScheduleDAG *Graph) argument 67 getNodeAttributes(const SUnit *N, const ScheduleDAG *Graph) argument
|
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
H A D | DOTGraphTraits.h | 45 static std::string getGraphName(const GraphType& Graph) { return ""; } argument 51 static std::string getGraphProperties(const GraphType& Graph) { argument 71 std::string getNodeLabel(const void *Node, const GraphType& Graph) { argument 78 static bool hasNodeAddressLabel(const void *Node, const GraphType& Graph) { argument 86 const GraphType& Graph) { 94 const GraphType& Graph) { 146 static void addCustomGraphFeatures(const GraphType& Graph, GraphWriter &GW) {} argument 85 getNodeAttributes(const void *Node, const GraphType& Graph) argument 93 getEdgeAttributes(const void *Node, EdgeIter EI, const GraphType& Graph) argument
|
/external/swiftshader/third_party/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";
|
/external/swiftshader/third_party/LLVM/tools/opt/ |
H A D | GraphPrinters.cpp | 48 // Call Graph Printer
58 return "Call Graph";
61 static std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
argument 91 "Print Call Graph to 'dot' file");
|
/external/v8/src/compiler/ |
H A D | graph.cc | 19 Graph::Graph(Zone* zone) function in class:v8::internal::compiler::Graph 28 void Graph::Decorate(Node* node) { 35 void Graph::AddDecorator(GraphDecorator* decorator) { 40 void Graph::RemoveDecorator(GraphDecorator* decorator) { 46 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs, 53 Node* Graph::NewNodeUnchecked(const Operator* op, int input_count, 62 Node* Graph::CloneNode(const Node* node) { 70 NodeId Graph::NextNodeId() { 76 void Graph [all...] |
/external/mesa3d/src/gallium/drivers/nouveau/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...] |
/external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/ |
H A D | Graph.java | 23 * <p>Instances of a Graph are thread-safe. 25 * <p><b>WARNING:</b> Resources consumed by the Graph object must be explicitly freed by invoking 26 * the {@link #close()} method then the Graph object is no longer needed. 28 public final class Graph implements AutoCloseable { class in inherits:AutoCloseable 30 /** Create an empty Graph. */ 31 public Graph() { method in class:Graph 35 /** Create a Graph from an existing handle (takes ownership). */ 36 Graph(long nativeHandle) { method in class:Graph 41 * Release resources associated with the Graph. 43 * <p>Blocks until there are no active {@link Session} instances referring to this Graph [all...] |
/external/tensorflow/tensorflow/python/framework/ |
H A D | framework_lib.py | 21 @@Graph 48 ## Graph collections 74 # Classes used when building a Graph. 76 from tensorflow.python.framework.ops import Graph namespace 84 # Utilities used when building a Graph.
|
/external/tensorflow/tensorflow/core/graph/ |
H A D | graph.cc | 34 const int Graph::kControlSlot = -1; 264 // Graph 266 Graph::Graph(const OpRegistryInterface* ops) function in class:tensorflow::Graph 294 Graph::Graph(const FunctionLibraryDefinition& flib_def) function in class:tensorflow::Graph 295 : Graph(flib_def.default_registry()) { 305 Graph::~Graph() { 320 const VersionDef& Graph [all...] |