| /external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/ |
| segment_test.cc | 20 #include "tensorflow/core/graph/testlib.h"
63 void RunTest(const Graph* graph, const std::set<string>& candidates,
68 TF_EXPECT_OK(SegmentGraph(graph, MakeCandidateFn(candidates),
107 Graph g(OpRegistry::Global());
130 Graph g(OpRegistry::Global());
177 Graph g(OpRegistry::Global());
208 Graph g(OpRegistry::Global());
255 Graph g(OpRegistry::Global());
|
| /external/tensorflow/tensorflow/contrib/quantize/python/ |
| graph_matcher_test.py | 39 g = ops.Graph()
88 g = ops.Graph()
113 g = ops.Graph()
146 g = ops.Graph()
156 g = ops.Graph()
172 g = ops.Graph()
184 # Both add_pattern_a and add_pattern_b should match the graph since
|
| /external/tensorflow/tensorflow/core/kernels/ |
| sparse_dense_binary_op_shared_test.cc | 24 #include "tensorflow/core/graph/graph.h"
25 #include "tensorflow/core/graph/node_builder.h"
212 static Graph* SparseMatCMulDenseMat(Graph* g, Node* sp_indices, Node* sp_vals,
225 static Node* MakeTensor(Graph* g, int B, int M, int N) {
228 return test::graph::Constant(g, data);
237 static ST MakeSparseTensor(Graph* g, int B, int M, int N, int nnz_inner) {
272 return ST{test::graph::Constant(g, indices), test::graph::Constant(g, vals)
[all...] |
| /external/tensorflow/tensorflow/core/nccl/ |
| nccl_rewrite.cc | 24 #include "tensorflow/core/graph/node_builder.h"
31 Status ReplaceReduce(Graph* graph, Node* node) {
76 TF_RETURN_IF_ERROR(send_builder.Finalize(graph, &send_node));
79 // to the outputs of the graph. We add a control dependency to the receive
83 graph->AddControlEdge(send_node, out_node.node);
91 TF_RETURN_IF_ERROR(recv_builder.Finalize(graph, &recv_node));
93 graph->RemoveNode(node);
95 if (out_node.index == Graph::kControlSlot) {
96 graph->AddControlEdge(recv_node, out_node.node)
250 Graph* graph = options.graph->get(); variable
[all...] |
| /external/tensorflow/tensorflow/python/grappler/ |
| cluster_test.py | 35 with ops.Graph().as_default() as g:
41 mg = meta_graph.create_meta_graph_def(graph=g)
52 with ops.Graph().as_default() as g:
58 mg = meta_graph.create_meta_graph_def(graph=g)
69 with ops.Graph().as_default() as g:
76 mg = meta_graph.create_meta_graph_def(graph=g)
89 with ops.Graph().as_default() as g:
96 mg = meta_graph.create_meta_graph_def(graph=g)
117 with ops.Graph().as_default() as g:
123 mg = meta_graph.create_meta_graph_def(graph=g
[all...] |
| /external/tensorflow/tensorflow/python/kernel_tests/ |
| reduction_ops_test_big.py | 69 with self.session(graph=ops.Graph(), use_gpu=True) as sess:
89 with self.session(graph=ops.Graph(), use_gpu=True) as sess:
118 with self.session(graph=ops.Graph(), use_gpu=True) as sess:
139 with self.session(graph=ops.Graph(), use_gpu=True) as sess:
167 with self.session(graph=ops.Graph(), use_gpu=True) as sess
[all...] |
| stage_op_test.py | 34 with ops.Graph().as_default() as G:
46 with self.session(use_gpu=True, graph=G) as sess:
54 with ops.Graph().as_default() as G:
66 with self.session(use_gpu=True, graph=G) as sess:
75 with ops.Graph().as_default() as G:
92 with self.session(use_gpu=True, graph=G) as sess:
102 with ops.Graph().as_default() as G:
119 with ops.Graph().as_default() as G:
134 with self.session(use_gpu=True, graph=G) as sess:
143 with ops.Graph().as_default() as G
[all...] |
| /art/tools/ahat/src/main/com/android/ahat/heapdump/ |
| AhatSnapshot.java | 68 Dominators.Graph<AhatInstance> graph = new Dominators.Graph<AhatInstance>() { local
89 new Dominators(graph).progress(progress, mInstances.size()).computeDominators(mSuperRoot);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-cfi-verify/lib/ |
| FileAnalysis.h | 66 // error in the program, where you try and validate a graph that was created
147 // Returns whether the provided Graph represents a protected indirect control
149 CFIProtectionStatus validateCFIProtection(const GraphResult &Graph) const;
156 // instruction. The result is undefined if the provided graph does not fall
159 uint64_t indirectCFOperandClobber(const GraphResult& Graph) const;
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| side_effect_util.cc | 19 #include "tensorflow/core/graph/algorithm.h"
72 std::set<std::string> CalculateTokenInputsForOutputToken(const Graph& g) {
101 bool HasSideEffectingNodes(const Graph& g) {
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/estimator_batch/ |
| trainer_hooks_test.py | 46 with ops.Graph().as_default():
47 # Begin won't be able to find the required tensors in the graph.
56 with ops.Graph().as_default(), tf_session.Session() as sess:
62 # Begin finds tensors in the graph.
|
| /external/tensorflow/tensorflow/contrib/compiler/ |
| jit_test.py | 51 with self.session(graph=ops.Graph()) as sess:
72 v_true_1_t_sampler_op = v_true_1_t.graph.get_operation_by_name(
74 v_all_true_t_sampler_op = v_all_true_t.graph.get_operation_by_name(
91 with self.session(graph=ops.Graph()):
141 with self.session(graph=ops.Graph()):
150 graph_def = r.graph.as_graph_def()
157 with self.session(graph=ops.Graph())
[all...] |
| /external/tensorflow/tensorflow/contrib/tensorrt/custom_plugin_examples/ |
| plugin_test.py | 40 """Create a simple graph and return its graph_def."""
41 g = ops.Graph()
49 # insert custom_op in the graph
62 g = ops.Graph()
71 graph=g) as sess:
78 orig_graph = self._get_plugin_graph_def() # graph with plugin node
|
| /external/tensorflow/tensorflow/contrib/training/python/training/ |
| training_test.py | 94 with ops.Graph().as_default():
107 with ops.Graph().as_default():
144 with ops.Graph().as_default():
177 with ops.Graph().as_default():
200 with ops.Graph().as_default():
237 with ops.Graph().as_default():
273 with ops.Graph().as_default():
294 with ops.Graph().as_default():
321 with ops.Graph().as_default():
384 with ops.Graph().as_default()
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| colocation_graph.h | 97 // graph.
137 // constraint graph, and uses this information to assign a satisfying
138 // device placement to the nodes of the graph.
142 // Graph graph = ...;
144 // ColocationGraph colocation_graph(graph, device_set);
146 // // Add all the nodes of the `graph` to the `colocation_graph`.
147 // for (Node* node : graph.nodes()) {
152 // Node node_1 = *graph.FindNodeId(...);
153 // Node node_2 = *graph.FindNodeId(...)
[all...] |
| constant_folding_test.cc | 37 #include "tensorflow/core/graph/node_builder.h"
76 // Constructs the following graph.
117 Graph g(OpRegistry::Global());
137 // Tests that different node creation ordering creates same graph after constant
140 auto build_graph_and_constant_folding = [](Graph& g, bool swap) -> Status {
165 auto generate_new_name = [&unique_id](Graph* graph, string old_name) {
166 return strings::StrCat(graph->NewName(old_name), "__cf__", unique_id++);
175 Graph g1(OpRegistry::Global());
177 Graph g2(OpRegistry::Global())
[all...] |
| renamed_device.h | 115 Status MaybeRewriteGraph(std::unique_ptr<Graph>* graph) override {
116 return underlying_->MaybeRewriteGraph(graph);
119 Status FillContextMap(const Graph* graph,
121 return underlying_->FillContextMap(graph, device_context_map);
|
| step_stats_collector.h | 34 class Graph;
171 const std::unordered_map<string, const Graph*>& device_map);
|
| /external/tensorflow/tensorflow/core/distributed_runtime/ |
| graph_mgr.h | 49 // TensorFlow worker. Each registered graph is identified by a handle
52 // After a successful registration, the caller executes a graph using
53 // the graph handle. Each execution is distinguished from others by a
55 // can use the same graph concurrently and independently as long as
63 // TF_CHECK_OK(gmgr.Register("session", { graph computes c = a + b },
75 // Registers a graph. Fills in "handle". The registered graph retains a
83 // Executes one step of a registered graph "handle".
101 // Deregisters a graph.
111 Graph* graph = nullptr; // not owned member in struct:tensorflow::GraphMgr::ExecutionUnit
[all...] |
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| topological_sort.cc | 41 GraphView::OutputPort(dep.from, Graph::kControlSlot),
42 GraphView::InputPort(dep.to, Graph::kControlSlot));
50 const GraphDef& graph,
55 graph, MakeEphemeralEdges(extra_dependencies)));
58 std::vector<int> num_ready_inputs(graph.node_size(), 0);
61 ready_nodes->reserve(graph.node_size());
66 for (int i = 0; i < graph.node_size(); i++) {
71 if (IsMerge(graph.node(i))) {
73 if (IsNextIteration(graph.node(input))) {
94 "The graph couldn't be sorted in topological order.")
[all...] |
| /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/ |
| ShapeTest.java | 64 try (Graph g = new Graph()) {
|
| /external/tensorflow/tensorflow/python/compiler/tensorrt/test/ |
| topk_test.py | 38 g = ops.Graph()
65 g = ops.Graph()
|
| /external/v8/src/compiler/ |
| escape-analysis-reducer.h | 10 #include "src/compiler/graph-reducer.h"
24 NodeHashCache(Graph* graph, Zone* zone)
25 : graph_(graph), cache_(zone), temp_nodes_(zone) {}
67 Graph* graph_;
81 // Modify the graph according to the information computed in the previous phase.
|
| node-origin-table.h | 112 explicit NodeOriginTable(Graph* graph);
127 Graph* const graph_;
|
