| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| tf2xla_util_test.cc | 32 #include "tensorflow/core/graph/graph.h"
194 // Graph is full, no pruning done.
195 // Graph right now has diamond from d:
211 // Fetch "a" and "e" to get the original graph.
218 // Builds a graph that adds two Tensors.
223 std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global()));
224 TF_ASSERT_OK(scope.ToGraph(graph.get()))
[all...] |
| /external/tensorflow/tensorflow/contrib/graph_editor/ |
| select.py | 15 """Various ways of selecting operations and tensors in a graph."""
339 set in which to perform the operation (if a `tf.Graph` is given, it
389 """Do a forward graph walk and return all the visited ops.
392 seed_ops: an iterable of operations from which the forward graph
398 the whole graph.
400 the op is within the graph traversal. This can be used along within_ops,
402 stop_at_ts: an iterable of tensors at which the graph walk stops.
404 If not `None`, it will be used while walking the graph forward.
461 """Do a backward graph walk and return all the visited ops.
464 seed_ops: an iterable of operations from which the backward graph
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| direct_session_test.cc | 29 #include "tensorflow/core/framework/graph.pb.h"
34 #include "tensorflow/core/graph/costmodel.h"
35 #include "tensorflow/core/graph/graph.h"
36 #include "tensorflow/core/graph/node_builder.h"
37 #include "tensorflow/core/graph/testlib.h"
85 Graph graph(OpRegistry::Global());
89 Node* a = test::graph::Constant(&graph, a_tensor)
1381 GraphDef graph; local
1479 GraphDef graph; local
[all...] |
| executor.h | 23 #include "tensorflow/core/graph/graph.h"
34 // Executor runs a graph computation.
36 // Graph* graph = ...;
37 // ... construct graph ...
39 // TF_CHECK_OK(NewSimpleExecutor(my_device, graph, &executor));
51 // RunAsync() executes the graph computation. "done" is run when the
52 // graph computation completes. If any error happens during the
67 // graph computation
[all...] |
| parallel_concat_optimizer.cc | 21 #include "tensorflow/core/graph/algorithm.h"
22 #include "tensorflow/core/graph/node_builder.h"
23 #include "tensorflow/core/graph/optimizer_cse.h"
34 if (options.graph == nullptr) {
36 // without a graph, but some tests require this.
39 Graph* g = options.graph->get();
43 "graph should be available.");
|
| /external/tensorflow/tensorflow/python/compiler/tensorrt/ |
| trt_convert_test.py | 108 """Get the graph for testing."""
109 # The graph computes (input+1)^2, it looks like:
120 g = ops.Graph()
136 """Get the graph def for testing."""
138 with self.session(graph=g, config=self._GetConfigProto()) as sess:
162 with self.session(graph=g, config=self._GetConfigProto()) as sess:
196 output_graph_def = conversion_result.graph.as_graph_def()
239 .DEFAULT_SERVING_SIGNATURE_DEF_KEY].graph.as_graph_def()
249 # In V2 the actual graph could be inside a function.
268 # Run the calibrated graph
[all...] |
| /external/tensorflow/tensorflow/python/ops/ |
| special_math_ops_test.py | 327 with ops.Graph().as_default():
338 with ops.Graph().as_default():
350 with ops.Graph().as_default():
361 with ops.Graph().as_default():
372 with ops.Graph().as_default():
383 with ops.Graph().as_default():
|
| /art/tools/ahat/src/main/com/android/ahat/dominators/ |
| Dominators.java | 27 * Computes the immediate dominators of a directed graph. It can be used with
28 * any directed graph data structure that implements the
29 * {@link Dominators.Graph} interface and has some root node with no incoming
33 private final Graph<Node> graph; field in class:Dominators
39 * Interface for a directed graph to perform immediate dominators
41 * The dominators computation can be used with directed graph data
42 * structures that implement this <code>Graph</code> interface. To use the
43 * dominators computation on your graph, you must make the following
56 public interface Graph<Node>
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| CFLSteensAliasAnalysis.cpp | 15 // graph of the uses of a variable, where each node is a memory location, and
25 // Because this algorithm requires a graph search on each query, we execute the
27 // in order to transform the graph into sets of variables that may alias in
104 // the data is *actually* mutable at graph building time. This will probably
183 // Builds the graph + StratifiedSets for a function.
189 auto &Graph = GraphBuilder.getCFLGraph();
190 for (const auto &Mapping : Graph.value_mappings()) {
210 for (const auto &Mapping : Graph.value_mappings()) {
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| deadness_analysis.cc | 25 #include "tensorflow/core/graph/algorithm.h"
26 #include "tensorflow/core/graph/control_flow.h"
27 #include "tensorflow/core/graph/tensor_id.h"
33 // We map every output produced by each node in the TensorFlow graph (including
46 // straightforward. We traverse the graph in RPO, mapping each node to a
61 // for Merge in a graph like:
89 // order) passes over the graph. On the first pass it assigns a symbolic
225 // in the following graph:
696 explicit DeadnessAnalysisImpl(const Graph* graph)
[all...] |
| xla_cluster_util.cc | 31 #include "tensorflow/core/graph/control_flow.h"
45 string DescribeCycle(const GraphCycles* cycles, const Graph& graph, int src,
47 int32 max_path_size = graph.num_node_ids() + 1;
54 auto node_name = [&graph](int node_id) {
55 if (!FastBoundsCheck(node_id, graph.num_node_ids())) {
58 auto* node = graph.FindNodeId(node_id);
114 xla::StatusOr<bool> CreateCycleDetectionGraph(const Graph* graph,
116 for (int i = 0; i < graph->num_node_ids(); ++i)
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| cast_op_test.cc | 31 static Graph* Cast(int num) {
32 Graph* g = new Graph(OpRegistry::Global());
36 test::graph::Cast(g, test::graph::Constant(g, data),
|
| resize_bicubic_op_test.cc | 254 static Graph* ResizeBicubic(int batch_size, int size, int channels,
256 Graph* g = new Graph(OpRegistry::Global());
263 test::graph::Binary(g, "ResizeBicubic", test::graph::Constant(g, input),
264 test::graph::Constant(g, shape));
|
| reverse_op_test.cc | 183 // Creates a Graph which "reduce"s a 3D float tensor of "num" elements
186 static Graph* Reverse(const TensorShape& shape, int reverse_axis) {
187 Graph* g = new Graph(OpRegistry::Global());
192 test::graph::Reverse(g, test::graph::Constant(g, data),
193 test::graph::Constant(g, axes));
|
| /external/tensorflow/tensorflow/core/kernels/data/ |
| single_threaded_executor.cc | 20 #include "tensorflow/core/graph/algorithm.h"
43 Status Initialize(const Graph& graph) {
44 // Topologicially sort `graph` to get a sequence of OpKernels.
46 ordered_nodes.reserve(graph.num_nodes());
47 GetReversePostOrder(graph, &ordered_nodes);
49 if (ordered_nodes.size() != graph.num_nodes()) {
50 return errors::InvalidArgument("Graph had ", graph.num_nodes(),
59 // Create the kernel and input-related structures for each node in `graph`
[all...] |
| /external/tensorflow/tensorflow/python/saved_model/ |
| load_v1_in_v2_test.py | 46 export_graph = ops.Graph()
106 export_graph = ops.Graph()
155 export_graph = ops.Graph()
|
| /external/v8/src/compiler/ |
| loop-peeling.cc | 8 #include "src/compiler/graph.h"
51 // from the peeled iteration, resulting in the graph as follows:
100 // graph, but are instead computed by the {LoopFinder}.
112 Peeling(Graph* graph, size_t max, NodeVector* p)
113 : node_map(graph, static_cast<uint32_t>(max)), pairs(p) {}
126 void CopyNodes(Graph* graph, Zone* tmp_zone_, Node* dead, NodeRange nodes,
139 Node* copy = graph->NewNode(node->op(), node->InputCount(), &inputs[0]);
332 // and remove all the markers from the graph
[all...] |
| /external/google-fruit/include/fruit/impl/normalized_component_storage/ |
| normalized_component_storage.h | 102 // A graph with types as nodes (each node stores the BindingData for the type) and dependencies as edges.
130 using Graph = SemistaticGraph<TypeId, NormalizedBinding>;
|
| /external/google-fruit/src/ |
| injector_storage.cpp | 95 bindings = Graph(normalized_component.bindings, BindingDataNodeIter{new_bindings_vector.begin()},
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| Interval.h | 130 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/python/kernel_tests/ |
| model_ops_test.py | 135 with ops.Graph().as_default() as graph:
136 with self.session(graph):
166 with ops.Graph().as_default() as graph:
167 with self.session(graph):
207 # Calling self.cached_session() without a graph specified results in
210 # which is why we also create a graph and pass it to self.cached_session()
213 with ops.Graph().as_default() as graph
[all...] |
| /external/tensorflow/tensorflow/contrib/distribute/python/ |
| monitor_test.py | 79 with context.graph_mode(), ops.Graph().as_default():
|
| /external/tensorflow/tensorflow/contrib/graph_editor/tests/ |
| match_test.py | 30 self.graph = ops.Graph()
31 with self.graph.as_default():
|
| /external/tensorflow/tensorflow/contrib/timeseries/python/timeseries/ |
| ar_model_test.py | 242 g = ops.Graph()
263 g = ops.Graph()
284 g = ops.Graph()
334 g = ops.Graph()
|
| /external/tensorflow/tensorflow/core/graph/ |
| node_builder.h | 23 #include "tensorflow/core/graph/graph.h"
30 // This is a helper for creating a Node and adding it to a Graph.
39 // .Finalize(&graph, &node);
46 // connecting to an existing Node*), and inputs from outside the graph
47 // (or haven't been added to the graph yet, like back edges, where
55 // For referencing Nodes not in the graph being built. It is
56 // useful when preparing a graph for ExtendSession or creating a
57 // back edge to a node that hasn't been added to the graph yet,
121 // Validates the described node and adds it to *graph, adding edge
[all...] |
