HomeSort by relevance Sort by last modified time
    Searched refs:Graph (Results 676 - 700 of 1007) sorted by null

<<21222324252627282930>>

  /external/tensorflow/tensorflow/compiler/jit/
encapsulate_subgraphs_pass_test.cc 32 #include "tensorflow/core/graph/graph_constructor.h"
33 #include "tensorflow/core/graph/graph_def_builder.h"
52 std::unique_ptr<Graph> graph = local
53 std::unique_ptr<Graph>(new Graph(OpRegistry::Global()));
56 TF_RETURN_IF_ERROR(ConvertGraphDefToGraph(opts, graphdef, graph.get()));
59 *graph,
492 // Convert the GraphDef to a Graph
497 std::unique_ptr<Graph> graph(new Graph(lib_def.get()))
746 std::unique_ptr<Graph> graph; local
    [all...]
  /external/tensorflow/tensorflow/contrib/gan/python/estimator/python/
gan_estimator_test.py 75 with ops.Graph().as_default():
150 with ops.Graph().as_default():
181 with ops.Graph().as_default():
stargan_estimator_test.py 68 with ops.Graph().as_default():
173 with ops.Graph().as_default():
  /external/tensorflow/tensorflow/contrib/slim/python/slim/nets/
vgg_test.py 60 with ops.Graph().as_default():
181 with ops.Graph().as_default():
315 with ops.Graph().as_default():
  /external/tensorflow/tensorflow/contrib/timeseries/python/timeseries/
head_test.py 97 g = ops.Graph()
407 graph = ops.Graph()
408 with graph.as_default():
433 graph.as_graph_element(input_value.name): features[input_key]
435 fetches = {output_key: graph.as_graph_element(output_value.name)
445 graph = ops.Graph()
446 with graph.as_default():
469 feeds = {graph.as_graph_element(input_value.name): examples
    [all...]
  /external/tensorflow/tensorflow/contrib/training/python/training/
evaluation_test.py 167 with ops.Graph().as_default():
286 with ops.Graph().as_default():
495 with ops.Graph().as_default():
  /external/tensorflow/tensorflow/core/grappler/optimizers/
model_pruner.cc 40 if (input.port_id == Graph::kControlSlot) {
49 if (output.port_id == Graph::kControlSlot) {
60 // Remove the stop gradient nodes since they serve no purpose once the graph
106 } else if (input.port_id == Graph::kControlSlot) {
258 GraphDef* graph, NodeMap* node_map) {
266 NodeDef* new_node = graph->add_node();
282 const absl::flat_hash_set<int>& terminal_ports, GraphDef* graph,
302 string identity = NewIdentityFromIdentityN(i, *node, graph, node_map);
369 Status SplitIdentityNInputs(GraphDef* graph,
376 NodeMap node_map(graph);
    [all...]
  /external/tensorflow/tensorflow/python/grappler/
memory_optimizer_test.py 43 """Make sure the graph is preserved when there is nothing to swap."""
50 mg = meta_graph.create_meta_graph_def(graph=ops.get_default_graph())
60 graph = tf_optimizer.OptimizeGraph(config, mg)
62 self.assertEqual(len(graph.node), graph_size)
63 self.assertItemsEqual([node.name for node in graph.node], nodes)
78 mg = meta_graph.create_meta_graph_def(graph=ops.get_default_graph())
89 graph = tf_optimizer.OptimizeGraph(config, mg)
91 self.assertEqual(len(graph.node), graph_size + 2)
93 set([node.name for node in graph.node]) > set(
95 for node in graph.node
    [all...]
  /external/tensorflow/tensorflow/core/common_runtime/
process_function_library_runtime.cc 32 #include "tensorflow/core/graph/graph.h"
33 #include "tensorflow/core/graph/graph_constructor.h"
34 #include "tensorflow/core/graph/graph_partition.h"
306 Graph* graph) const {
312 for (Node* node : graph->op_nodes()) {
321 for (Node* node : graph->op_nodes()) {
481 std::unique_ptr<Graph>* graph,
553 std::unique_ptr<Graph> graph; local
    [all...]
  /external/llvm/include/llvm/CodeGen/
MachineFunction.h 407 /// this can make the graph smaller.
610 // machine function as a graph of machine basic blocks... these are
620 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
632 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
647 // graph of basic blocks... and to walk it in inverse order. Inverse order for
654 return &G.Graph->front();
660 return &G.Graph->front();
  /external/mesa3d/src/gallium/drivers/nouveau/codegen/
nv50_ir_print.cpp 737 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next())
753 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next())
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
MachineBasicBlock.h 466 // MachineFunction as a graph of MachineBasicBlocks...
496 // MachineFunction as a graph of MachineBasicBlocks... and to walk it
505 return G.Graph;
519 return G.Graph;
  /external/tensorflow/tensorflow/compiler/tf2xla/
functionalize_control_flow_test.cc 31 #include "tensorflow/core/graph/graph_constructor.h"
32 #include "tensorflow/core/graph/graph_def_builder.h"
33 #include "tensorflow/core/graph/validate.h"
42 // graph.
43 Status FindIfThenAndElse(const GraphDef& graph, string* op_name,
45 for (const NodeDef& node : graph.node()) {
56 return errors::NotFound("No If node found in graph");
59 // Graph:
66 Graph graph(OpRegistry::Global())
    [all...]
  /external/tensorflow/tensorflow/contrib/image/python/kernel_tests/
distort_image_ops_test.py 264 with session.Session('', graph=ops.Graph(), config=config) as sess:
308 with session.Session('', graph=ops.Graph(), config=config) as sess:
  /external/tensorflow/tensorflow/core/kernels/
quantize_and_dequantize_op_test.cc 537 Graph* g = new Graph(OpRegistry::Global()); \
quantized_concat_op_test.cc 31 #include "tensorflow/core/graph/node_builder.h"
42 using test::graph::Constant;
254 Graph* g = new Graph(OpRegistry::Global());
  /external/tensorflow/tensorflow/core/profiler/g3doc/
profile_time.md 6 * [Profile by Graph](#profile-by-graph)
12 in the graph. An operation can be placed on an accelerator or on CPU.
105 sess.graph, run_meta, cmd='code', options=opts)
141 ### Profile by Graph
143 Usually, use graph view to generate a timeline to visualize the result.
157 graph -max_depth 10000000 -step 0 -account_type_regexes .*gpu:3.*,.*worker.*cpu:0.* -output timeline:outfile=<filename.json>
  /external/tensorflow/tensorflow/python/kernel_tests/
functional_ops_test.py 594 with ops.Graph().as_default() as g:
607 with self.session(graph=g, use_gpu=use_gpu) as sess:
614 with ops.Graph().as_default() as g:
627 with self.session(graph=g, use_gpu=True) as sess:
636 with ops.Graph().as_default() as g:
658 with self.session(graph=g, use_gpu=use_gpu) as sess:
670 with ops.Graph().as_default() as g:
688 with self.session(graph=g, use_gpu=use_gpu):
703 with ops.Graph().as_default() as g:
713 with self.session(graph=g, use_gpu=use_gpu) as sess
    [all...]
lu_op_test.py 256 with ops.Graph().as_default(), \
269 with ops.Graph().as_default(), \
matrix_exponential_op_test.py 190 with ops.Graph().as_default(), \
204 with ops.Graph().as_default(), \
where_op_test.py 176 with ops.Graph().as_default():
198 with ops.Graph().as_default():
  /external/tensorflow/tensorflow/python/ops/
gradient_checker_test.py 179 with ops.Graph().as_default() as g:
180 with self.session(graph=g):
191 with ops.Graph().as_default() as g:
192 with self.session(graph=g):
  /external/tensorflow/tensorflow/python/tpu/
session_support.py 46 def _clone_session(session, graph=None):
50 graph=graph if graph else session.graph)
198 session: Session connected to worker devices. A cloned session and graph
219 """Reset the graph, session and worker manager."""
220 self._graph = ops.Graph()
223 graph=self._graph,
312 # Worker heartbeats are managed independently of the main training graph
    [all...]
  /external/tensorflow/tensorflow/tools/graph_transforms/
fold_constants_lib.cc 29 #include "tensorflow/core/graph/graph_constructor.h"
30 #include "tensorflow/core/graph/node_builder.h"
31 #include "tensorflow/core/graph/subgraph.h"
58 // graph did not already have a node with the name for the new added recv
90 if (id.second != Graph::kControlSlot) {
167 LOG(ERROR) << "Bad graph structure, no node named '" << node_name
169 return errors::InvalidArgument("Bad graph structure, no node named '",
216 Graph input_graph(OpRegistry::Global());
  /external/v8/src/compiler/
effect-control-linearizer.h 9 #include "src/compiler/graph-assembler.h"
27 class Graph;
36 EffectControlLinearizer(JSGraph* graph, Schedule* schedule, Zone* temp_zone,
207 Graph* graph() const;

Completed in 1052 milliseconds

<<21222324252627282930>>