| /external/tensorflow/tensorflow/core/common_runtime/ |
| partitioning_utils.cc | 19 #include "tensorflow/core/graph/graph.h"
20 #include "tensorflow/core/graph/graph_constructor.h"
21 #include "tensorflow/core/graph/graph_partition.h"
26 const DeviceSet& device_set, std::unique_ptr<Graph> graph,
27 std::unordered_map<string, std::unique_ptr<Graph>>* subgraphs) {
30 // TODO(iga): To support the distributed case, first split the graph by
33 // Currently, we simply split the graph at device boundaries.
51 TF_RETURN_IF_ERROR(Partition(partition_options, graph.get(), &partitions))
[all...] |
| /external/tensorflow/tensorflow/compiler/jit/ |
| extract_outside_compilation_pass_test.cc | 41 // Build the graph:
52 std::unique_ptr<Graph> g(new Graph(OpRegistry::Global()));
125 // Build the graph: only 1 node: "arg0"
128 std::unique_ptr<Graph> g(new Graph(OpRegistry::Global()));
149 // Build the graph:
154 std::unique_ptr<Graph> g(new Graph(OpRegistry::Global()));
175 // Build the graph: only 1 node: "const0
[all...] |
| build_xla_ops_pass_test.cc | 26 #include "tensorflow/core/graph/algorithm.h"
58 std::unique_ptr<Graph>* result) {
59 auto graph = absl::make_unique<Graph>(OpRegistry::Global()); local
60 TF_RETURN_IF_ERROR(s.ToGraph(graph.get()));
61 FunctionLibraryDefinition flib_def(graph->op_registry(), fdef_lib);
65 for (Node* n : graph->nodes()) {
73 FixupSourceAndSinkEdges(graph.get());
79 opt_options.graph = &graph;
145 std::unique_ptr<Graph> graph; local
167 std::unique_ptr<Graph> graph; local
198 std::unique_ptr<Graph> graph; local
221 std::unique_ptr<Graph> graph; local
243 std::unique_ptr<Graph> graph; local
[all...] |
| encapsulate_subgraphs_pass.cc | 43 #include "tensorflow/core/graph/algorithm.h"
44 #include "tensorflow/core/graph/control_flow.h"
45 #include "tensorflow/core/graph/graph.h"
46 #include "tensorflow/core/graph/graph_def_builder.h"
47 #include "tensorflow/core/graph/tensor_id.h"
104 const Graph& graph,
113 graph, srcs, /*enter=*/nullptr,
147 Graph const* graph_in
2423 std::unique_ptr<Graph> graph; local
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| subgraph_test.cc | 16 #include "tensorflow/core/graph/subgraph.h"
21 #include "tensorflow/core/framework/graph.pb.h"
23 #include "tensorflow/core/graph/graph.h"
24 #include "tensorflow/core/graph/graph_constructor.h"
25 #include "tensorflow/core/graph/graph_def_builder.h"
26 #include "tensorflow/core/graph/graph_def_builder_util.h"
44 SubgraphTest() : g_(new Graph(OpRegistry::Global())) {
104 return HasEdge(src, Graph::kControlSlot, dst, Graph::kControlSlot)
136 Graph* graph() { return g_.get(); } function in class:tensorflow::__anon45055::SubgraphTest
[all...] |
| quantize_training.cc | 22 #include "tensorflow/core/graph/quantize_training.h"
29 #include "tensorflow/core/graph/algorithm.h"
30 #include "tensorflow/core/graph/graph_constructor.h"
31 #include "tensorflow/core/graph/node_builder.h"
32 #include "tensorflow/core/graph/subgraph.h"
71 inline bool IsGradientNode(const Graph* graph, const Node* node) {
79 bool FindType(const Graph* graph, const Node* node, bool* signed_input,
112 if (edge->src_output() != Graph::kControlSlot && edge->dst_input() == 0)
[all...] |
| optimizer_cse_test.cc | 16 #include "tensorflow/core/graph/optimizer_cse.h"
22 #include "tensorflow/core/graph/graph.h"
23 #include "tensorflow/core/graph/graph_constructor.h"
24 #include "tensorflow/core/graph/testlib.h"
37 static void InitGraph(const string& s, Graph* graph) {
44 TF_CHECK_OK(ConvertGraphDefToGraph(opts, graph_def, graph));
61 } else if (index == Graph::kControlSlot) {
68 string CanonicalGraphString(Graph* g)
362 Graph* graph = new Graph(OpRegistry::Global()); local
[all...] |
| mkl_tfconversion_pass.cc | 27 #include "tensorflow/core/graph/algorithm.h"
28 #include "tensorflow/core/graph/graph.h"
29 #include "tensorflow/core/graph/node_builder.h"
36 #include "tensorflow/core/graph/mkl_graph_util.h"
37 #include "tensorflow/core/graph/mkl_tfconversion_pass.h"
42 // in the graph in between A and B, where A and B match any one
51 // B = NULL (in other words, A is the last node in the graph), then
81 // Insert layout conversion node in the graph pointed by g.
82 // Function scans the graph for candidate edges where w
[all...] |
| graph_def_builder.h | 20 #include "tensorflow/core/framework/graph.pb.h"
22 #include "tensorflow/core/graph/graph.h"
23 #include "tensorflow/core/graph/node_builder.h"
68 // Options for adding a Node to a Graph.
71 // Sets the Graph (that Nodes will be added to) and the status. The
73 // failures. The graph and status must outlive *this.
74 Options(Graph* graph, Status* status);
136 Graph* const graph_
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| reduction_ops_test.cc | 24 // Creates a Graph which "reduce"s a 3D float tensor of "num" elements
27 static Graph* ToScalar(const string& reduce, int num_x, int num_y) {
28 auto* g = new Graph(OpRegistry::Global());
34 test::graph::Reduce(g, reduce, test::graph::Constant(g, data),
35 test::graph::Constant(g, axes));
39 static Graph* ColReduce(const string& reduce, int num_x, int num_y) {
40 auto* g = new Graph(OpRegistry::Global());
45 test::graph::Reduce(g, reduce, test::graph::Constant(g, data)
[all...] |
| batch_matmul_op_test.cc | 24 static Graph* BatchMatmul(int b, int m, int k, int n, bool adjoint_a,
26 Graph* g = new Graph(OpRegistry::Global());
31 test::graph::BatchMatmul(g, test::graph::Constant(g, in0),
32 test::graph::Constant(g, in1), adjoint_a, adjoint_b);
|
| constant_op_test.cc | 24 #include "tensorflow/core/graph/graph.h"
94 // Returns graph containing "num" const nodes. If 'sequential' is
96 // graph by adding control dependencies.
97 static Graph* ManyConsts(int num, bool sequential) {
98 Graph* g = new Graph(OpRegistry::Global());
103 Node* curr = test::graph::Constant(g, c);
|
| matmul_op_test.cc | 24 static Graph* Matmul(int m, int k, int n, bool transpose_a, bool transpose_b,
26 Graph* g = new Graph(OpRegistry::Global());
31 test::graph::Matmul(g, test::graph::Constant(g, in0),
32 test::graph::Constant(g, in1), transpose_a, transpose_b);
|
| split_op_test.cc | 22 #include "tensorflow/core/graph/node_builder.h"
29 static Graph* MakeGraph(int split_dim, int num_split,
31 Graph* g = new Graph(OpRegistry::Global());
39 .Input(test::graph::Constant(g, split_dim_tensor))
40 .Input(test::graph::Constant(g, in))
|
| /external/tensorflow/tensorflow/python/training/ |
| supervisor_test.py | 99 with ops.Graph().as_default():
110 with ops.Graph().as_default():
121 with ops.Graph().as_default():
139 with ops.Graph().as_default():
157 with ops.Graph().as_default():
183 # The next one has the graph and metagraph.
209 with ops.Graph().as_default():
232 # The next one has the graph.
273 with ops.Graph().as_default():
292 with ops.Graph().as_default()
[all...] |
| basic_loops_test.py | 55 with ops.Graph().as_default():
73 with ops.Graph().as_default():
97 with ops.Graph().as_default():
|
| /external/tensorflow/tensorflow/python/framework/ |
| op_def_library_test.py | 118 with ops.Graph().as_default():
141 with ops.Graph().as_default():
183 with ops.Graph().as_default():
190 with ops.Graph().as_default():
218 with ops.Graph().as_default():
244 with ops.Graph().as_default():
260 with ops.Graph().as_default():
284 with ops.Graph().as_default():
306 with ops.Graph().as_default():
337 with ops.Graph().as_default()
[all...] |
| meta_graph_test.py | 73 orig_graph = ops.Graph()
74 with self.session(graph=orig_graph) as sess:
75 # Create a minimal graph with zero variables.
81 # Add input and output tensors to graph collections.
100 # Create a clean graph and import the MetaGraphDef nodes.
101 new_graph = ops.Graph()
102 with self.session(graph=new_graph) as sess:
103 # Import the previously export meta graph.
106 # Re-exports the current graph state for comparison to the original.
112 # Ensures that we can still get a reference to our graph collections
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
44 /// PBQP Graph class.
48 class Graph : public GraphBase {
82 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
113 NIds[0] = NIds[1] = Graph::invalidNodeId();
119 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
126 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) {
135 void connect(Graph &G, EdgeId ThisEdgeId)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 92 const Function *Graph) {
94 return getSimpleNodeLabel(Node, Graph);
96 return getCompleteNodeLabel(Node, Graph);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-cfi-verify/lib/ |
| FileAnalysis.cpp | 264 FileAnalysis::validateCFIProtection(const GraphResult &Graph) const {
265 const Instr *InstrMetaPtr = getInstruction(Graph.BaseAddress);
276 if (!Graph.OrphanedNodes.empty())
279 for (const auto &BranchNode : Graph.ConditionalBranchNodes) {
284 if (indirectCFOperandClobber(Graph) != Graph.BaseAddress)
290 uint64_t FileAnalysis::indirectCFOperandClobber(const GraphResult &Graph) const {
291 assert(Graph.OrphanedNodes.empty() && "Orphaned nodes should be empty.");
294 const Instr &IndirectCF = getInstructionOrDie(Graph.BaseAddress);
303 for (const auto &Branch : Graph.ConditionalBranchNodes)
[all...] |
| /external/tensorflow/tensorflow/python/saved_model/ |
| loader_test.py | 49 g = ops.Graph()
71 with session.Session(graph=g) as sess:
79 with session.Session(graph=g) as sess:
101 with self.session(graph=ops.Graph()) as sess:
103 self.assertEqual(5, sess.graph.get_tensor_by_name("x:0").eval())
104 self.assertEqual(11, sess.graph.get_tensor_by_name("y:0").eval())
108 with self.session(graph=ops.Graph()) as sess:
110 self.assertEqual(5, sess.graph.get_tensor_by_name("x:0").eval()
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 1 //===- Graph.h - PBQP Graph -------------------------------------*- C++ -*-===//
10 // PBQP Graph class.
43 /// PBQP Graph class.
47 class Graph : public GraphBase {
81 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
133 void disconnectFromN(Graph &G, unsigned NIdx) {
141 void disconnectFrom(Graph &G, NodeId NId)
[all...] |
| /external/tensorflow/tensorflow/contrib/quantize/python/ |
| quantize_graph_test.py | 15 """Unit tests for the quantize_graph graph rewriting API."""
96 graph = ops.Graph()
97 with graph.as_default():
101 [v.name for v in graph.get_collection(ops.GraphKeys.GLOBAL_VARIABLES)])
103 rewrite_fn(graph)
105 q_variables = graph.get_collection(ops.GraphKeys.GLOBAL_VARIABLES)
113 # Tests that the default graph is correctly used when no args are provided
115 with ops.Graph().as_default() as g:
129 # Tests that the default graph is correctly used when no args are provide
[all...] |
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| xla_compiler_test.cc | 43 #include "tensorflow/core/graph/algorithm.h"
44 #include "tensorflow/core/graph/graph.h"
45 #include "tensorflow/core/graph/graph_constructor.h"
120 scope.UpdateStatus(builder.Finalize(scope.graph(), &ret));
172 // Tests compilation and execution of an empty graph.
176 std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global()));
179 XlaCompiler::CompileOptions(), "add", std::move(graph),
[all...] |
