| /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"
51 // A ClientGraph is simply a sub-graph of the full graph as induced by
58 graph(flib_def.get()),
62 // Each client-graph gets its own function library since optimization passes
65 Graph graph; member in struct:tensorflow::ClientGraph
[all...] |
| partitioning_utils_test.cc | 29 #include "tensorflow/core/graph/graph.h"
57 void SwapGraph(Graph* graph, bool assign_device = false) {
68 TF_ASSERT_OK(s.ToGraph(graph));
71 Placer placer(graph, &device_set_, device0_);
76 void TwoDeviceSwapGraph(Graph* graph) {
86 TF_ASSERT_OK(s.ToGraph(graph));
87 Placer placer(graph, &device_set_, device0_)
112 std::unique_ptr<Graph> graph = absl::make_unique<Graph>(OpRegistry::Global()); local
122 std::unique_ptr<Graph> graph = absl::make_unique<Graph>(OpRegistry::Global()); local
138 std::unique_ptr<Graph> graph = absl::make_unique<Graph>(OpRegistry::Global()); local
178 std::unique_ptr<Graph> graph = absl::make_unique<Graph>(OpRegistry::Global()); local
[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.h | 20 #include "tensorflow/core/graph/graph.h"
32 // If not null it maps from nodes in graph to partially-known
38 // TODO(b/65453533) introduce a unique way to name nodes in a graph.
54 // Applies optimization passes specified in 'opts' to 'graph'.
55 // Maybe replace *graph with a new graph object. 'device' is device
56 // on which the 'graph' will execute. It's passed to the optimizers
60 std::unique_ptr<Graph>* graph,
[all...] |
| kernel_benchmark_testlib.h | 24 #include "tensorflow/core/graph/testlib.h"
40 Benchmark(const string& device, Graph* g,
41 const SessionOptions* options = nullptr, Graph* init = nullptr,
45 // Executes the graph for "iters" times.
49 // inputs to the corresponding recv nodes in the graph, after each
51 // the graph. In the benchmark, we throw away values returned by the
52 // graph.
|
| /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/java/src/test/java/org/tensorflow/op/core/ |
| GeneratedOperationsTest.java | 24 import org.tensorflow.Graph;
35 try (Graph g = new Graph();
47 try (Graph g = new Graph();
|
| /external/v8/src/compiler/ |
| graph.h | 25 // Marks are used during traversal of the graph to distinguish states of nodes.
35 class V8_EXPORT_PRIVATE Graph final : public NON_EXPORTED_BASE(ZoneObject) {
37 explicit Graph(Zone* zone);
40 // the original start and end nodes of the graph, and resets them when you
44 explicit SubgraphScope(Graph* graph)
45 : graph_(graph), start_(graph->start()), end_(graph->end()) {}
52 Graph* const graph_
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| collective_order_test.cc | 15 #include "tensorflow/core/graph/collective_order.h"
19 #include "tensorflow/core/graph/graph_def_builder.h"
20 #include "tensorflow/core/graph/graph_def_builder_util.h"
31 // Verifies that the list of collective nodes in `graph` matches
34 void VerifyGraph(const Graph& graph,
40 for (const Node* src : graph.nodes()) {
65 const Graph& graph,
67 for (const Node* node : graph.nodes())
131 std::unique_ptr<Graph> graph = absl::make_unique<Graph>(OpRegistry::Global()); local
142 std::unique_ptr<Graph> graph = InitGraph(); local
149 std::unique_ptr<Graph> graph = InitGraph(); local
179 std::unique_ptr<Graph> graph = absl::make_unique<Graph>(OpRegistry::Global()); local
191 std::unique_ptr<Graph> graph = InitGraph2(); local
218 std::unique_ptr<Graph> graph = absl::make_unique<Graph>(OpRegistry::Global()); local
229 std::unique_ptr<Graph> graph = InitGraphForPruning(); local
[all...] |
| mkl_tfconversion_pass_test.cc | 18 #include "tensorflow/core/graph/mkl_tfconversion_pass.h"
19 #include "tensorflow/core/graph/mkl_graph_util.h"
26 #include "tensorflow/core/graph/graph.h"
27 #include "tensorflow/core/graph/graph_constructor.h"
28 #include "tensorflow/core/graph/testlib.h"
45 static void InitGraph(const string& s, Graph* graph) {
51 TF_CHECK_OK(ConvertGraphDefToGraph(opts, graph_def, graph));
64 } else if (index == Graph::kControlSlot)
284 Graph* graph = new Graph(OpRegistry::Global()); local
[all...] |
| validate.h | 19 #include "tensorflow/core/framework/graph.pb.h"
21 #include "tensorflow/core/graph/graph.h"
25 namespace graph { namespace in namespace:tensorflow
54 // Validate that the graph has no cycle except for legal while loop cycles.
60 Status ValidateGraphHasNoCycle(const Graph& graph);
62 // Returns OK if the graph has no duplicate node names.
63 Status VerifyNoDuplicateNodeNames(const GraphDef& graph);
65 } // namespace graph
[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/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...] |
| /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/swiftshader/third_party/llvm-7.0/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/compiler/jit/ |
| mark_for_compilation_pass_test_helper.cc | 23 std::unique_ptr<Graph>* graph, FunctionLibraryDefinition* flib_def,
27 for (Node* n : (*graph)->nodes()) {
48 opt_options.graph = graph;
56 std::unique_ptr<Graph>* graph, bool enable_global_jit) {
58 FunctionLibraryDefinition flib_def((*graph)->op_registry(), flib);
59 return MarkForCompilation(graph, &flib_def, enable_global_jit);
|
| xla_cluster_util.h | 16 // Contains utilities for clustering compilable graph nodes via XLA.
25 #include "tensorflow/core/graph/algorithm.h"
55 // Creates a graph representation to enable cycle detection when clustering.
56 // This representation handles loops in graph by disconnecting each loop from
57 // the enclosing graph.
61 xla::StatusOr<bool> CreateCycleDetectionGraph(const Graph* graph,
80 const Graph* graph, const FunctionLibraryDefinition* flib_def,
|
| shape_inference.h | 40 // Infer shapes for all Tensors in a graph, and save them in a map. The vector
43 Status InferShapes(Graph* graph, const std::map<int, InferredShape>& arg_shapes,
|
| /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;
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/data/vectorization/ |
| vectorizer_registry_test.cc | 25 Status Vectorize(const Node& node, Graph* outer_scope,
40 Graph g(OpRegistry::Global());
|
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/rexpr/ |
| rexpr.h | 20 } Graph, *GraphPtr;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| BreadthFirstIteratorTest.cpp | 19 typedef bf_iterator<Graph<4>> BFIter;
21 Graph<4> G;
44 typedef bf_iterator<Graph<4>> BFIter;
46 Graph<4> G;
|
| /external/tensorflow/tensorflow/cc/framework/ |
| scope.h | 27 #include "tensorflow/core/graph/graph_constructor.h"
33 class Graph;
87 /// Graph object to which operations are added when the new scope or its
108 /// This creates a new graph and all operations constructed in this graph
194 // TODO(skyewm): Graph is not part of public API
195 Graph* graph() const;
197 // TODO(skyewm): Graph is not part of public API
198 std::shared_ptr<Graph> graph_as_shared_ptr() const
[all...] |
