| /external/bcc/src/cc/frontends/p4/compiler/ |
| topoSorting.py | 38 class Graph(object):
|
| /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/swiftshader/third_party/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
47 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
53 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /external/swiftshader/third_party/llvm-7.0/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...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
50 // typedef EdgeRef - Type of Edge token in the graph, which should
53 // graph, dereference to a EdgeRef
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| TestGraph.h | 1 //===- llvm/unittest/ADT/TestGraph.h - Graph for testing ------------------===//
10 // Common graph data structure for testing.
24 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
26 class Graph {
29 Graph(const Graph&);
30 Graph& operator=(const Graph&);
37 /// NodeSubset - A subset of the graph's nodes
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DOTGraphTraitsPass.h | 23 /// \brief Default traits class for extracting a graph from an analysis pass.
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>());
135 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph);
137 ViewGraph(Graph, Name, IsSimple, Title)
[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!");
99 /// Nodes - The list of nodes for this graph
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| DOTGraphTraitsPass.h | 30 Analysis *Graph;
32 Graph = &getAnalysis<Analysis>();
33 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
35 ViewGraph(Graph, Name, Simple, Title);
57 Analysis *Graph;
63 Graph = &getAnalysis<Analysis>();
66 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
70 WriteGraph(File, Graph, Simple, Title);
|
| /external/swiftshader/third_party/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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| DOTGraphTraitsPass.h | 23 /// Default traits class for extracting a graph from an analysis pass.
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>());
135 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph);
137 ViewGraph(Graph, Name, IsSimple, Title)
[all...] |
| /external/syzkaller/tools/syz-benchcmp/ |
| benchcmp.go | 27 type Graph struct {
46 graphs := []*Graph{
111 func skipStart(g *Graph) {
126 func restoreMissingPoints(g *Graph) {
163 func printFinalStats(graphs []*Graph) {
183 func display(graphs []*Graph) {
223 {{range $id, $graph := .}}
227 {{range $graph.Headers}}
231 {{range $graph.Points}} [ {{.Time}}, {{range .Vals}} {{if .}} {{.}} {{end}}, {{end}}
237 title: '{{$graph.Name}}'
[all...] |
| /external/tensorflow/tensorflow/go/ |
| graph.go | 51 // Graph represents a computation graph. Graphs may be shared between sessions.
52 type Graph struct {
56 // Graph execution options
67 // NewGraph returns a new Graph.
68 func NewGraph() *Graph {
69 g := &Graph{C.TF_NewGraph()}
70 runtime.SetFinalizer(g, (*Graph).finalizer)
74 func (g *Graph) finalizer() {
81 func (g *Graph) WriteTo(w io.Writer) (int64, error)
[all...] |
| /external/v8/src/compiler/ |
| graph.cc | 5 #include "src/compiler/graph.h"
10 #include "src/compiler/graph-visualizer.h"
19 Graph::Graph(Zone* zone)
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)
[all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/rexpr/ |
| rexpr.h | 20 } Graph, *GraphPtr;
|
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
36 public class Graph<T> {
|
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-cfi-verify/ |
| llvm-cfi-verify.cpp | 89 const GraphResult &Graph,
97 Graph.printToDOT(Analysis, outs());
136 GraphResult Graph = GraphBuilder::buildFlowGraph(Analysis, Address);
139 Analysis.validateCFIProtection(Graph);
144 printInstructionInformation(Analysis, InstrMeta, Graph, ProtectionStatus);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/XRay/ |
| GraphTest.cpp | 1 //===- llvm/unittest/XRay/GraphTest.cpp - XRay Graph unit tests -*- C++ -*-===//
10 #include "llvm/XRay/Graph.h"
26 typedef Graph<VAttr, EAttr, unsigned> GraphT;
33 T Graph = getTestGraph();
149 auto &G = this->Graph;
155 auto &G = this->Graph;
161 TypeParam G(this->Graph);
168 TypeParam G = this->Graph;
175 TypeParam G(std::move(this->Graph));
181 // Tests the incremental Construction of a graph
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.cpp | 31 Graph::Graph()
38 Graph::~Graph()
44 void Graph::insert(Node *node)
49 node->graph = this;
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
87 Graph::Node::Node(void *priv) : data(priv),
88 in(0), out(0), graph(0)
[all...] |
| 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())
34 // A connected graph.
35 class Graph
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 *graph; member in class:nv50_ir::Graph::Node
[all...] |
| /external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/ |
| Graph.java | 21 * A data flow graph representing a TensorFlow computation.
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 {
30 /** Create an empty Graph. */
31 public Graph() {
35 /** Create a Graph from an existing handle (takes ownership). */
36 Graph(long nativeHandle) {
41 * Release resources associated with the Graph
439 private final Graph graph; field in class:Graph.OperationIterator
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| graph.cc | 16 #include "tensorflow/core/graph/graph.h"
19 #include "tensorflow/core/framework/graph.pb.h"
24 #include "tensorflow/core/graph/while_context.h"
35 const int Graph::kControlSlot = -1;
347 // Graph
349 Graph::Graph(const OpRegistryInterface* ops)
377 Graph::Graph(const FunctionLibraryDefinition& flib_def
[all...] |
| /art/tools/ahat/src/main/com/android/ahat/dominators/ |
| Dominators.java | 27 * Computes the immediate dominators of a directed graph. It can be used with
28 * any directed graph data structure that implements the
29 * {@link Dominators.Graph} interface and has some root node with no incoming
33 private final Graph<Node> graph; field in class:Dominators
39 * Interface for a directed graph to perform immediate dominators
41 * The dominators computation can be used with directed graph data
42 * structures that implement this <code>Graph</code> interface. To use the
43 * dominators computation on your graph, you must make the following
56 public interface Graph<Node>
[all...] |
| /art/tools/ahat/src/test/com/android/ahat/ |
| DominatorsTest.java | 32 private static class Graph implements Dominators.Graph<String> {
57 * Define a node in the graph, including all its outgoing edges.
75 Graph graph = new Graph(); local
76 graph.node("n");
77 new Dominators(graph).computeDominators("n");
84 Graph graph = new Graph() local
98 Graph graph = new Graph(); local
115 Graph graph = new Graph(); local
129 Graph graph = new Graph(); local
144 Graph graph = new Graph(); local
157 Graph graph = new Graph(); local
176 Graph graph = new Graph(); local
201 Graph graph = new Graph(); local
217 Graph graph = new Graph(); local
240 Graph graph = new Graph(); local
267 Graph graph = new Graph(); local
294 Graph graph = new Graph(); local
[all...] |
| /external/llvm/lib/Analysis/ |
| CFLSteensAliasAnalysis.cpp | 15 // graph of the uses of a variable, where each node is a memory location, and
25 // Because this algorithm requires a graph search on each query, we execute the
27 // in order to transform the graph into sets of variables that may alias in
117 // the data is *actually* mutable at graph building time. This will probably
196 // Builds the graph + StratifiedSets for a function.
202 auto &Graph = GraphBuilder.getCFLGraph();
203 for (const auto &Mapping : Graph.value_mappings()) {
223 for (const auto &Mapping : Graph.value_mappings()) {
|
| /external/skia/tests/ |
| IncrTopoSortTest.cpp | 14 // A node in the graph. This corresponds to an opList in the MDB world.
61 friend class Graph;
85 class Graph {
87 Graph(int numNodesToReserve, skiatest::Reporter* reporter)
96 fNodes.push_back(tmp); // The graph gets the creation ref
320 Graph g(10, reporter);
360 Graph g(10, reporter);
408 Graph g(4, reporter);
410 /* Create the graph (the '.' is the pointy side of the arrow):
446 Graph g(7, reporter)
[all...] |
