| /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"
93 // Returns graph containing "num" const nodes. If 'sequential' is
95 // graph by adding control dependencies.
96 static Graph* ManyConsts(int num, bool sequential) {
97 Graph* g = new Graph(OpRegistry::Global());
102 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 | 97 with ops.Graph().as_default():
108 with ops.Graph().as_default():
119 with ops.Graph().as_default():
137 with ops.Graph().as_default():
155 with ops.Graph().as_default():
181 # The next one has the graph and metagraph.
207 with ops.Graph().as_default():
230 # The next one has the graph.
271 with ops.Graph().as_default():
290 with ops.Graph().as_default()
[all...] |
| basic_loops_test.py | 53 with ops.Graph().as_default():
70 with ops.Graph().as_default():
93 with ops.Graph().as_default():
|
| /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/tensorflow/tensorflow/core/graph/ |
| 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 | 28 #include "tensorflow/core/graph/algorithm.h"
29 #include "tensorflow/core/graph/graph.h"
30 #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/python/framework/ |
| ops_test.py | 89 ops._NodeDef("FloatOutput", "myop"), ops.Graph(), [], [dtypes.float32])
97 ops._NodeDef("FloatOutput", "myop"), ops.Graph(), [], [dtypes.float32])
263 op = ops.Operation(ops._NodeDef("None", "myop"), ops.Graph(), [], [])
267 op = ops.Operation(ops._NodeDef("None", "op2"), ops.Graph(), [], [])
275 g = ops.Graph()
301 g = ops.Graph()
398 op = ops.Operation(node_def, ops.Graph(), [], [dtypes.float32])
403 ops._NodeDef("None", "op1"), ops.Graph(), [], [dtypes.float32])
465 with ops.Graph().as_default():
479 with ops.Graph().as_default()
[all...] |
| op_def_library_test.py | 118 with ops.Graph().as_default():
141 with ops.Graph().as_default():
180 with ops.Graph().as_default():
187 with ops.Graph().as_default():
215 with ops.Graph().as_default():
241 with ops.Graph().as_default():
257 with ops.Graph().as_default():
287 with ops.Graph().as_default():
309 with ops.Graph().as_default():
340 with ops.Graph().as_default()
[all...] |
| /external/tensorflow/tensorflow/contrib/quantize/python/ |
| quantize_graph_test.py | 15 """Unit tests for the quantize_graph graph rewriting API."""
73 graph = ops.Graph()
74 with graph.as_default():
78 [v.name for v in graph.get_collection(ops.GraphKeys.GLOBAL_VARIABLES)])
80 rewrite_fn(graph)
82 q_variables = graph.get_collection(ops.GraphKeys.GLOBAL_VARIABLES)
90 # Tests that the default graph is correctly used when no args are provided
92 with ops.Graph().as_default() as g:
106 with ops.Graph().as_default() as g
[all...] |
| /external/tensorflow/tensorflow/python/estimator/ |
| warm_starting_util_test.py | 60 with ops.Graph().as_default() as g:
61 with self.test_session(graph=g) as sess:
103 with ops.Graph().as_default() as g:
104 with self.test_session(graph=g) as sess:
119 with ops.Graph().as_default() as g:
120 with self.test_session(graph=g) as sess:
131 with ops.Graph().as_default() as g:
132 with self.test_session(graph=g) as sess:
154 # New session and new graph.
155 with ops.Graph().as_default() as g
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 92 const Function *Graph) {
94 return getSimpleNodeLabel(Node, Graph);
96 return getCompleteNodeLabel(Node, Graph);
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
45 /// PBQP Graph class.
49 class Graph : public GraphBase {
83 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
113 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
120 void connect(Graph &G, EdgeId ThisEdgeId) {
134 void disconnectFromN(Graph &G, unsigned NIdx) {
142 void disconnectFrom(Graph &G, NodeId NId)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/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...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
45 /// PBQP Graph class.
49 class Graph : public GraphBase {
83 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
113 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
120 void connect(Graph &G, EdgeId ThisEdgeId) {
134 void disconnectFromN(Graph &G, unsigned NIdx) {
142 void disconnectFrom(Graph &G, NodeId NId)
[all...] |
