| /external/tensorflow/tensorflow/core/common_runtime/ |
| step_stats_collector.h | 32 class Graph;
78 const std::unordered_map<string, const Graph*>& device_map);
|
| /external/tensorflow/tensorflow/core/debug/ |
| debugger_state_impl.cc | 48 Status DebugGraphDecorator::DecorateGraph(Graph* graph, Device* device) {
49 DebugNodeInserter::DeparallelizeWhileLoops(graph, device);
51 debug_options_.debug_tensor_watch_opts(), graph, device);
54 Status DebugGraphDecorator::PublishGraph(const Graph& graph,
64 return DebugIO::PublishGraph(graph, device_name, debug_urls);
|
| /external/tensorflow/tensorflow/core/graph/ |
| graph.cc | 16 #include "tensorflow/core/graph/graph.h"
19 #include "tensorflow/core/framework/graph.pb.h"
24 #include "tensorflow/core/graph/while_context.h"
34 const int Graph::kControlSlot = -1;
264 // Graph
266 Graph::Graph(const OpRegistryInterface* ops)
294 Graph::Graph(const FunctionLibraryDefinition& flib_def
[all...] |
| 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::__anon39637::SubgraphTest
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| slice_op_test.cc | 25 #include "tensorflow/core/graph/node_builder.h"
26 #include "tensorflow/core/graph/testlib.h"
41 Graph* g = new Graph(OpRegistry::Global());
60 .Input(test::graph::Constant(g, input))
61 .Input(test::graph::Constant(g, begin))
62 .Input(test::graph::Constant(g, sizes))
|
| /external/v8/src/compiler/ |
| compiler-source-position-table.h | 44 explicit SourcePositionTable(Graph* graph);
61 Graph* const graph_;
|
| diamond.h | 9 #include "src/compiler/graph.h"
18 Graph* graph; member in struct:v8::internal::compiler::Diamond
25 Diamond(Graph* g, CommonOperatorBuilder* b, Node* cond,
27 graph = g;
29 branch = graph->NewNode(common->Branch(hint), cond, graph->start());
30 if_true = graph->NewNode(common->IfTrue(), branch);
31 if_false = graph->NewNode(common->IfFalse(), branch);
32 merge = graph->NewNode(common->Merge(2), if_true, if_false)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
49 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
52 // Return total number of nodes in the graph
59 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
49 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
52 // Return total number of nodes in the graph
59 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| GraphTraits.h | 1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
25 // GraphTraits - This class should be specialized by different graph types...
32 // typedef NodeRef - Type of Node token in the graph, which should
34 // typedef ChildIteratorType - Type used to iterate over children in graph,
38 // Return the entry node of the graph
48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
51 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/gpu/ |
| gpu_stream_util_test.cc | 22 #include "tensorflow/core/graph/graph_def_builder.h"
23 #include "tensorflow/core/graph/node_builder.h"
38 Graph g(OpRegistry::Global());
58 Graph g(OpRegistry::Global());
69 Graph g(OpRegistry::Global());
88 Graph g(OpRegistry::Global());
113 Graph g(OpRegistry::Global());
|
| /external/tensorflow/tensorflow/examples/image_retraining/ |
| retrain_test.py | 16 """Tests the graph freezing tool."""
63 with tf.Graph().as_default():
66 self.assertIsNotNone(sess.graph.get_tensor_by_name('DistortJPGInput:0'))
67 self.assertIsNotNone(sess.graph.get_tensor_by_name('DistortResult:0'))
71 with tf.Graph().as_default():
76 self.assertIsNotNone(sess.graph.get_tensor_by_name('final:0'))
80 with tf.Graph().as_default():
85 self.assertIsNotNone(sess.graph.get_tensor_by_name('final:0'))
88 with tf.Graph().as_default():
94 with tf.Graph().as_default()
[all...] |
| /system/update_engine/payload_generator/ |
| graph_utils.cc | 38 uint64_t EdgeWeight(const Graph& graph, const Edge& edge) {
41 graph[edge.first].out_edges.find(edge.second)->second.extents;
94 // For each node N in graph, drop all edges N->|index|.
95 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index) {
97 // edges in the graph.
98 for (Graph::iterator it = graph->begin(), e = graph->end(); it != e; ++it)
[all...] |
| /external/tensorflow/tensorflow/contrib/kfac/python/kernel_tests/ |
| loss_functions_test.py | 51 with ops.Graph().as_default(), self.test_session() as sess:
64 with ops.Graph().as_default(), self.test_session() as sess:
87 with ops.Graph().as_default(), self.test_session() as sess:
102 with ops.Graph().as_default():
117 with ops.Graph().as_default(), self.test_session() as sess:
136 with ops.Graph().as_default(), self.test_session() as sess:
157 with ops.Graph().as_default(), self.test_session() as sess:
170 with ops.Graph().as_default(), self.test_session() as sess:
193 with ops.Graph().as_default(), self.test_session() as sess:
208 with ops.Graph().as_default()
[all...] |
