HomeSort by relevance Sort by last modified time
    Searched defs:Graph (Results 1 - 16 of 16) sorted by null

  /external/srec/tools/grxmlcompile/
grph.h 3 * DESCRIPTION: Part of the SREC graph compiler project source files.
23 class Graph
26 Graph (const char *name)
36 ~Graph()
  /external/llvm/include/llvm/ADT/
GraphTraits.h 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
23 // GraphTraits - This class should be specialized by different graph types...
30 // typedef NodeType - Type of Node in the graph
31 // typedef ChildIteratorType - Type used to iterate over children in graph
34 // Return the entry node of the graph
46 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
49 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
    [all...]
  /external/llvm/include/llvm/Analysis/
DOTGraphTraitsPass.h 29 Analysis *Graph = &getAnalysis<Analysis>();
30 std::string GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
33 ViewGraph(Graph, Name, Simple, Title);
54 Analysis *Graph = &getAnalysis<Analysis>();
61 std::string GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
65 WriteGraph(File, Graph, Simple, Title);
89 Analysis *Graph = &getAnalysis<Analysis>();
90 std::string Title = DOTGraphTraits<Analysis*>::getGraphName(Graph);
92 ViewGraph(Graph, Name, Simple, Title);
113 Analysis *Graph = &getAnalysis<Analysis>()
    [all...]
  /external/llvm/unittests/ADT/
SCCIteratorTest.cpp 19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
21 class Graph {
24 Graph(const Graph&);
25 Graph& operator=(const Graph&);
32 /// NodeSubset - A subset of the graph's nodes.
40 assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!");
101 /// Nodes - The list of nodes for this graph
    [all...]
  /external/webkit/Source/JavaScriptCore/dfg/
DFGGraph.h 62 // === Graph ===
64 // The dataflow graph is an ordered vector of nodes.
67 class Graph : public Vector<Node, 64> {