| /external/v8/src/compiler/ |
| pipeline.h | 29 class Graph;
48 // Run the pipeline on a machine graph and generate code. The {schedule} must
49 // be valid, hence the given {graph} does not need to be schedulable.
52 Graph* graph, Schedule* schedule,
60 // Run the pipeline on a machine graph and generate code. If {schedule} is
63 Graph* graph,
71 // Run the pipeline on a machine graph and generate code. If {schedule} is
74 CompilationInfo* info, CallDescriptor* call_descriptor, Graph* graph
[all...] |
| graph-visualizer.h | 21 class Graph;
32 AsJSON(const Graph& g, SourcePositionTable* p) : graph(g), positions(p) {}
33 const Graph& graph; member in struct:v8::internal::compiler::AsJSON
40 explicit AsRPO(const Graph& g) : graph(g) {}
41 const Graph& graph; member in struct:v8::internal::compiler::AsRPO
|
| scheduler.h | 23 class Graph;
27 // Computes a schedule from a graph, placing nodes into basic blocks and
36 // nodes from the graph into it.
37 static Schedule* ComputeSchedule(Zone* zone, Graph* graph, Flags flags);
65 Graph* graph_;
76 Scheduler(Zone* zone, Graph* graph, Schedule* schedule, Flags flags);
90 // Phase 1: Build control-flow graph.
|
| /hardware/interfaces/tests/pointer/1.0/default/ |
| Graph.h | 22 struct Graph : public IGraph {
25 Return<void> passAGraph(const IGraph::Graph& g) override;
26 Return<void> passTwoGraphs(::android::hardware::tests::pointer::V1_0::IGraph::Graph const* g1, ::android::hardware::tests::pointer::V1_0::IGraph::Graph const* g2) override;
|
| /system/update_engine/payload_generator/ |
| inplace_generator.h | 59 // each of which has a corresponding vertex in a graph.
71 // Checks all the operations in the graph have a type assigned.
72 static void CheckGraph(const Graph& graph);
86 // Cuts 'edges' from 'graph' according to the AU algorithm. This means
93 static bool CutEdges(Graph* graph,
97 // Creates all the edges for the graph. Writers of a block point to
100 static void CreateEdges(Graph* graph,
[all...] |
| topological_sort.cc | 30 void TopologicalSortVisit(const Graph& graph,
39 for (Vertex::EdgeMap::const_iterator it = graph[node].out_edges.begin();
40 it != graph[node].out_edges.end(); ++it) {
41 TopologicalSortVisit(graph, visited_nodes, nodes, it->first);
48 void TopologicalSort(const Graph& graph, vector<Vertex::Index>* out) {
51 for (Vertex::Index i = 0; i < graph.size(); i++) {
52 TopologicalSortVisit(graph, &visited_nodes, out, i);
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| CFGPrinter.h | 36 const Function *Graph) {
48 const Function *Graph) {
76 const Function *Graph) {
78 return getSimpleNodeLabel(Node, Graph);
80 return getCompleteNodeLabel(Node, Graph);
|
| /external/tensorflow/tensorflow/core/graph/ |
| mkl_tfconversion_pass_test.cc | 18 #include "tensorflow/core/graph/mkl_tfconversion_pass.h"
19 #include "tensorflow/core/graph/mkl_graph_util.h"
27 #include "tensorflow/core/graph/graph.h"
28 #include "tensorflow/core/graph/graph_constructor.h"
29 #include "tensorflow/core/graph/testlib.h"
46 static void InitGraph(const string& s, Graph* graph) {
52 TF_CHECK_OK(ConvertGraphDefToGraph(opts, graph_def, graph));
65 } else if (index == Graph::kControlSlot)
285 Graph* graph = new Graph(OpRegistry::Global()); local
[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/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/tensorflow/tensorflow/java/src/test/java/org/tensorflow/ |
| SessionTest.java | 35 try (Graph g = new Graph();
50 try (Graph g = new Graph();
67 try (Graph g = new Graph();
104 try (Graph g = new Graph();
134 try (Graph g = new Graph();
[all...] |
| /external/tensorflow/tensorflow/python/estimator/ |
| model_fn_test.py | 51 with ops.Graph().as_default(), self.test_session():
59 with ops.Graph().as_default(), self.test_session():
80 with ops.Graph().as_default(), self.test_session():
89 with ops.Graph().as_default(), self.test_session():
96 with ops.Graph().as_default(), self.test_session():
102 with ops.Graph().as_default(), self.test_session():
110 with ops.Graph().as_default(), self.test_session():
122 with ops.Graph().as_default():
124 with ops.Graph().as_default(), self.test_session():
126 ValueError, 'must be from the default graph')
[all...] |
| /external/tensorflow/tensorflow/python/saved_model/ |
| saved_model_test.py | 98 with self.test_session(graph=ops.Graph()) as sess:
111 with self.test_session(graph=ops.Graph()) as sess:
133 with self.test_session(graph=ops.Graph()) as sess:
144 with self.test_session(graph=ops.Graph()) as sess:
158 with self.test_session(graph=ops.Graph()) as sess
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| graph_execution_state.h | 27 #include "tensorflow/core/framework/graph.pb.h"
28 #include "tensorflow/core/graph/costmodel.h"
29 #include "tensorflow/core/graph/graph.h"
49 // A ClientGraph is simply a sub-graph of the full graph as induced by
55 graph(flib_def.get()),
58 // Each client-graph gets its own function library since optimization passes
61 Graph graph; member in struct:tensorflow::ClientGraph
[all...] |
| memory_types_test.cc | 19 #include "tensorflow/core/graph/testlib.h"
26 Graph* g = new Graph(OpRegistry::Global());
29 auto in0 = test::graph::Constant(g, v);
30 auto in1 = test::graph::Constant(g, v);
31 test::graph::Add(g, in0, in1);
44 Graph* g = new Graph(OpRegistry::Global());
47 auto x = test::graph::Constant(g, v);
48 test::graph::Cast(g, x, DT_FLOAT)
[all...] |
| graph_optimizer.cc | 20 #include "tensorflow/core/graph/algorithm.h"
21 #include "tensorflow/core/graph/graph_constructor.h"
22 #include "tensorflow/core/graph/node_builder.h"
23 #include "tensorflow/core/graph/optimizer_cse.h"
38 std::unique_ptr<Graph>* graph,
42 Graph* g = graph->get();
95 // Note that we use the Graph constructor that copies the input
97 std::unique_ptr<Graph> copy(new Graph(g->flib_def()))
[all...] |
| graph_optimizer.h | 20 #include "tensorflow/core/graph/graph.h"
32 // Applies optimization passes specified in 'opts' to 'graph'.
33 // Maybe replace *graph with a new graph object. 'device' is device
34 // on which the 'graph' will execute. It's passed to the optimizers
38 // If shape_map is not null it maps from nodes in graph to partially-known
44 // TODO(b/65453533) introduce a unique way to name nodes in a graph.
50 std::unique_ptr<Graph>* graph,
[all...] |
| graph_runner.h | 26 #include "tensorflow/core/graph/graph.h"
32 // GraphRunner takes a Graph, some inputs to feed, and some outputs
33 // to fetch and executes the graph required to feed and fetch the
37 // partially evaluate inexpensive nodes in a graph, such as for shape
53 // REQUIRES: `graph`, `env`, and `outputs` are not nullptr.
56 Status Run(Graph* graph, FunctionLibraryRuntime* function_library,
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| mark_for_compilation_pass_test.cc | 26 #include "tensorflow/core/graph/graph_constructor.h"
27 #include "tensorflow/core/graph/graph_def_builder.h"
28 #include "tensorflow/core/graph/graph_def_builder_util.h"
38 Status MarkForCompilation(std::unique_ptr<Graph>* graph,
42 for (Node* n : (*graph)->nodes()) {
47 opt_options.graph = graph;
53 Status MarkForCompilation(std::unique_ptr<Graph>* graph) {
[all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| proto.h | 310 extern Graph buildAction( char *, int, int, int );
311 extern Graph buildToken( char * );
312 extern Graph buildWildCard( char * );
313 extern Graph buildRuleRef( char * );
314 extern Graph Or( Graph, Graph );
315 extern Graph Cat( Graph, Graph );
[all...] |
| /external/llvm/lib/Analysis/ |
| CallPrinter.cpp | 1 //===- CallPrinter.cpp - DOT printer for call graph -----------------------===//
11 // containing the call graph of a module.
28 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; }
30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
77 INITIALIZE_PASS(CallGraphViewer, "view-callgraph", "View call graph", false,
82 "Print call graph to 'dot' file", false, false)
|
| /external/tensorflow/tensorflow/core/debug/ |
| debugger_state_impl.h | 52 Status DecorateGraph(Graph* graph, Device* device) override;
53 Status PublishGraph(const Graph& graph, const string& device_name) override;
|
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/rexpr/ |
| rexpr.h | 20 } Graph, *GraphPtr;
|
| /external/tensorflow/tensorflow/contrib/kfac/examples/tests/ |
| mlp_test.py | 30 with tf.Graph().as_default():
43 with tf.Graph().as_default():
51 with tf.Graph().as_default():
57 with tf.Graph().as_default():
|
| /external/tensorflow/tensorflow/contrib/tensorrt/convert/ |
| convert_nodes.h | 23 #include "tensorflow/core/framework/graph.pb.h"
24 #include "tensorflow/core/graph/graph.h"
36 const tensorflow::Graph& graph, const std::set<int>& subgraph_node_ids,
|
