| /external/tensorflow/tensorflow/core/kernels/ |
| strided_slice_op_test.cc | 26 #include "tensorflow/core/graph/node_builder.h"
27 #include "tensorflow/core/graph/testlib.h"
43 Graph* g = new Graph(OpRegistry::Global());
66 .Input(test::graph::Constant(g, input))
67 .Input(test::graph::Constant(g, begin))
68 .Input(test::graph::Constant(g, end))
69 .Input(test::graph::Constant(g, strides))
|
| concat_op_test.cc | 26 #include "tensorflow/core/graph/node_builder.h"
27 #include "tensorflow/core/graph/testlib.h"
43 Graph* g = new Graph(OpRegistry::Global());
57 .Input(test::graph::Constant(g, concat_dim))
58 .Input({test::graph::Constant(g, in0), test::graph::Constant(g, in1)})
94 Graph* g = new Graph(OpRegistry::Global());
106 inputs.push_back(test::graph::Constant(g, in))
[all...] |
| remote_fused_graph_execute_utils.h | 22 #include "tensorflow/core/framework/graph.pb.h"
24 #include "tensorflow/core/graph/graph.h"
25 #include "tensorflow/core/graph/graph_constructor.h"
92 // To determine shapes of output tensors of all nodes, dryrun the graph.
94 // the graph. This function is used to verify shape inference and actual
143 Graph* graph, ShapeRefiner* shape_refiner);
145 static Status BuildTensorShapeMapFromGraph(const Graph& graph,
[all...] |
| /external/tensorflow/tensorflow/python/kernel_tests/ |
| summary_image_op_test.py | 55 with self.test_session(graph=ops.Graph()) as sess:
90 with self.test_session(graph=ops.Graph()) as sess:
|
| summary_ops_test.py | 87 with ops.Graph().as_default():
104 with ops.Graph().as_default():
|
| summary_audio_op_test.py | 53 with self.test_session(graph=ops.Graph()) as sess:
|
| /external/tensorflow/tensorflow/python/saved_model/ |
| simple_save_test.py | 61 # Initialize input and output variables and save a prediction graph using
63 with self.test_session(graph=ops.Graph()) as sess:
70 # Restore the graph with a valid tag and check the global variables and
72 with self.test_session(graph=ops.Graph()) as sess:
73 graph = loader.load(sess, [tag_constants.SERVING], export_dir)
85 signature_def_map = graph.signature_def
|
| /external/v8/src/compiler/ |
| control-equivalence.h | 9 #include "src/compiler/graph.h"
21 // - Build a program structure tree (PST) for controls in the graph.
22 // - Determine single-entry single-exit (SESE) regions within the graph.
36 ControlEquivalence(Zone* zone, Graph* graph)
38 graph_(graph),
41 node_data_(graph->NodeCount(), EmptyData(), zone) {}
44 // the following iterations over control edges of the graph:
107 // Performs and undirected DFS walk of the graph. Conceptually all nodes are
168 Graph* const graph_
[all...] |
| node-properties.h | 17 class Graph;
78 // within the graph (i.e. an IfException projection is present).
95 // Merge the control node {node} into the end of the graph, introducing a
97 static void MergeControlToEnd(Graph* graph, CommonOperatorBuilder* common,
114 // assumes a linear effect-chain up to a {CheckPoint} node in the graph.
|
| branch-elimination.h | 9 #include "src/compiler/graph-reducer.h"
92 Graph* graph() const;
|
| graph-replay.cc | 5 #include "src/compiler/graph-replay.h"
9 #include "src/compiler/graph.h"
20 void GraphReplayPrinter::PrintReplay(Graph* graph) {
22 PrintF(" Node* nil = graph()->NewNode(common()->Dead());\n");
23 Zone zone(graph->zone()->allocator(), ZONE_NAME);
24 AllNodes nodes(&zone, graph);
29 PrintF(" Node* n%d = graph()->NewNode(op", node->id());
|
| /system/update_engine/payload_generator/ |
| tarjan_unittest.cc | 45 const Graph::size_type kNodeCount = 8;
47 Graph graph(kNodeCount);
49 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties()));
50 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties()));
51 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties()));
52 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties()));
53 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties()));
54 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties()));
55 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties()))
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
36 public class Graph {
|
| /external/llvm/include/llvm/Analysis/ |
| Interval.h | 129 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
141 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /external/tensorflow/tensorflow/cc/ops/ |
| const_op.cc | 28 Graph* graph = scope.graph(); local
34 scope.UpdateStatus(builder.Finalize(graph, &ret));
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| xla_device.h | 16 // The XlaDevice executes a TensorFlow graph using the XLA linear algebra
91 Status FillContextMap(const Graph* graph,
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| dump_graph.cc | 75 string DumpGraphToFile(const string& name, Graph const& graph,
78 graph.ToGraphDef(&graph_def);
|
| /external/tensorflow/tensorflow/contrib/eager/python/ |
| saver_test.py | 66 first_graph = ops.Graph()
69 with ops.Graph().as_default():
130 with ops.Graph().as_default():
187 # reset the graph and reload on create, so that 1 + 2 = 3
188 with ops.Graph().as_default():
|
| /external/tensorflow/tensorflow/contrib/predictor/ |
| core_estimator_predictor.py | 54 graph=None):
63 graph: Optional. The Tensorflow `graph` in which prediction should be
66 self._graph = graph or ops.Graph()
|
| /external/tensorflow/tensorflow/contrib/stat_summarizer/python/ |
| stat_summarizer_test.py | 33 with ops.Graph().as_default() as graph:
38 graph_def = graph.as_graph_def()
|
| /external/tensorflow/tensorflow/core/common_runtime/gpu/ |
| gpu_stream_util.cc | 23 #include "tensorflow/core/graph/algorithm.h"
30 Status AssignStreams(const Graph* graph, const AssignStreamsOpts& opts,
36 if (graph == nullptr)
37 status.Update(errors::InvalidArgument("Bad graph argument supplied."));
46 status.Update(errors::InvalidArgument("Bad graph argument supplied."));
52 GetReversePostOrder(*graph, &order);
|
| /external/tensorflow/tensorflow/core/common_runtime/sycl/ |
| sycl_device.cc | 31 // TODO(pbar) We really need a useful identifier of the graph node.
78 Status SYCLDevice::FillContextMap(const Graph* graph,
82 device_context_map->resize(graph->num_node_ids());
83 for (Node* n : graph->nodes()) {
|
| /external/tensorflow/tensorflow/core/distributed_runtime/ |
| scheduler.cc | 22 #include "tensorflow/core/graph/graph.h"
30 void InitializePending(const Graph* graph, std::vector<int>* pending) {
31 pending->resize(graph->num_node_ids());
32 for (const Node* node : graph->nodes()) {
74 SlackAnalysis::SlackAnalysis(const Graph* g, const CostModel* cost_model)
190 const CostModel* cost_model, const Graph* g,
295 const Graph* g)
|
| /external/tensorflow/tensorflow/core/graph/ |
| graph_partition.cc | 16 #include "tensorflow/core/graph/graph_partition.h"
30 #include "tensorflow/core/graph/algorithm.h"
31 #include "tensorflow/core/graph/control_flow.h"
32 #include "tensorflow/core/graph/costmodel.h"
33 #include "tensorflow/core/graph/graph_def_builder.h"
34 #include "tensorflow/core/graph/node_builder.h"
35 #include "tensorflow/core/graph/tensor_id.h"
103 // We collect the following information about the graph before performing
104 // graph partitioning.
158 if (src_slot == Graph::kControlSlot)
[all...] |
| /external/tensorflow/tensorflow/python/tools/ |
| import_pb_to_tensorboard.py | 15 """Imports a protobuf model as a graph in Tensorboard."""
34 """View an imported protobuf model (`.pb` file) as a graph in Tensorboard.
43 View your imported `.pb` model as a graph.
45 with session.Session(graph=ops.Graph()) as sess:
52 pb_visual_writer.add_graph(sess.graph)
|
