HomeSort by relevance Sort by last modified time
    Searched refs:Graph (Results 501 - 525 of 1024) sorted by null

<<21222324252627282930>>

  /external/tensorflow/tensorflow/core/graph/
graph_constructor.cc 16 #include "tensorflow/core/graph/graph_constructor.h"
27 #include "tensorflow/core/framework/graph.pb.h"
34 #include "tensorflow/core/graph/algorithm.h"
35 #include "tensorflow/core/graph/graph.h"
36 #include "tensorflow/core/graph/tensor_id.h"
120 const FunctionDefLibrary* library, Graph* g, ShapeRefiner* refiner,
127 "GraphDef", "graph"));
140 const FunctionDefLibrary* library, Graph* g,
226 // already unique in the graph
    [all...]
costmodel.cc 16 #include "tensorflow/core/graph/costmodel.h"
23 #include "tensorflow/core/graph/graph.h"
53 void CostModel::MergeFromLocal(const Graph& g, const CostModel& cm) {
105 // We don't keep stats for nodes not in the global graph, i.e.
233 void CostModel::CheckInitialized(const Graph& graph) const {
234 for (const Node* n : graph.op_nodes()) {
413 static void AddNodesToCostModel(const Graph& g, CostModel* cost_model) {
424 static void AssignSizes(const Graph& g, CostModel* cost_model)
    [all...]
  /external/tensorflow/tensorflow/contrib/graph_editor/
util.py 166 """Check that all the element in args belong to the same graph.
169 *args: a list of object with a obj.graph property.
171 ValueError: if all the elements do not belong to the same graph.
173 graph = None
175 if graph is None and sgv.graph is not None:
176 graph = sgv.graph
177 elif sgv.graph is not None and sgv.graph is not graph
384 def graph(self): member in class:ControlOutputs
    [all...]
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
388 """Do a forward graph walk and return all the visited ops.
391 seed_ops: an iterable of operations from which the forward graph
397 the whole graph.
398 stop_at_ts: an iterable of tensors at which the graph walk stops.
400 If not `None`, it will be used while walking the graph forward.
455 """Do a backward graph walk and return all the visited ops.
458 seed_ops: an iterable of operations from which the backward graph
464 the whole graph
    [all...]
  /external/testng/src/main/java/org/testng/internal/
MethodHelper.java 31 private static final Map<ITestNGMethod[], Graph<ITestNGMethod>> GRAPH_CACHE =
191 private static Graph<ITestNGMethod> topologicalSort(ITestNGMethod[] methods,
193 Graph<ITestNGMethod> result = new Graph<>();
200 // Create the graph
299 Graph<ITestNGMethod> g = GRAPH_CACHE.get(methods);
  /external/v8/src/compiler/
graph.h 23 // Marks are used during traversal of the graph to distinguish states of nodes.
33 class V8_EXPORT_PRIVATE Graph final : public NON_EXPORTED_BASE(ZoneObject) {
35 explicit Graph(Zone* zone);
38 // the original start and end nodes of the graph, and resets them when you
42 explicit SubgraphScope(Graph* graph)
43 : graph_(graph), start_(graph->start()), end_(graph->end()) {}
50 Graph* const graph_
    [all...]
  /external/tensorflow/tensorflow/core/distributed_runtime/
graph_mgr.cc 37 #include "tensorflow/core/graph/graph.h"
38 #include "tensorflow/core/graph/graph_constructor.h"
39 #include "tensorflow/core/graph/graph_partition.h"
40 #include "tensorflow/core/graph/validate.h"
71 graph_mgr->cost_model_manager_.RemoveCostModelForGraph(unit.graph);
98 const DebugOptions& debug_options, Graph* graph, Device* device) {
102 TF_RETURN_IF_ERROR(decorator->DecorateGraph(graph, device));
103 TF_RETURN_IF_ERROR(decorator->PublishGraph(*graph, device->name()))
    [all...]
  /external/tensorflow/tensorflow/python/framework/
graph_util_test.py 49 with ops.Graph().as_default() as g:
105 with ops.Graph().as_default():
120 with ops.Graph().as_default() as g:
141 with ops.Graph().as_default() as g, g.device(
180 # It is fine to have a loops in the graph as well.
203 with ops.Graph().as_default():
215 variable_graph_def = sess.graph.as_graph_def()
229 with ops.Graph().as_default():
239 variable_graph_def = sess.graph.as_graph_def()
276 # Now we make sure the variable is now a constant, and that the graph stil
    [all...]
  /external/tensorflow/tensorflow/core/common_runtime/
direct_session_test.cc 27 #include "tensorflow/core/framework/graph.pb.h"
32 #include "tensorflow/core/graph/costmodel.h"
33 #include "tensorflow/core/graph/graph.h"
34 #include "tensorflow/core/graph/node_builder.h"
35 #include "tensorflow/core/graph/testlib.h"
60 Graph graph(OpRegistry::Global());
64 Node* a = test::graph::Constant(&graph, a_tensor)
720 GraphDef graph; local
840 GraphDef graph; local
    [all...]
function_test.cc 37 #include "tensorflow/core/graph/graph_constructor.h"
74 std::unique_ptr<Graph> g(new Graph(OpRegistry::Global()));
303 std::unique_ptr<Graph> GetFuncBody(FunctionLibraryRuntime* flr,
314 std::unique_ptr<Graph> ret(new Graph(lib_def_.get()));
315 CopyGraph(*fbody->graph, ret.get());
319 std::unique_ptr<Graph> GetGradBody(FunctionLibraryRuntime* flr,
332 std::unique_ptr<Graph> ret(new Graph(lib_def_.get()))
    [all...]
executor.h 23 #include "tensorflow/core/graph/graph.h"
33 // Executor runs a graph computation.
35 // Graph* graph = ...;
36 // ... construct graph ...
38 // TF_CHECK_OK(NewSimpleExecutor(my_device, graph, &executor));
50 // RunAsync() executes the graph computation. "done" is run when the
51 // graph computation completes. If any error happens during the
66 // 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/core/distributed_runtime/rpc/
grpc_session_test.cc 20 #include "tensorflow/core/framework/graph.pb.h"
23 #include "tensorflow/core/graph/default_device.h"
24 #include "tensorflow/core/graph/graph.h"
25 #include "tensorflow/core/graph/testlib.h"
45 Graph graph(OpRegistry::Global());
49 Node* a = test::graph::Constant(&graph, a_tensor);
54 Node* b = test::graph::Constant(&graph, b_tensor)
88 GraphDef graph; local
124 GraphDef graph; local
156 GraphDef graph; local
187 GraphDef graph; local
697 GraphDef graph; local
828 GraphDef graph; local
    [all...]
  /external/tensorflow/tensorflow/python/kernel_tests/
constant_op_test.py 177 with ops.Graph().as_default():
184 with ops.Graph().as_default():
190 with ops.Graph().as_default():
195 with ops.Graph().as_default():
200 with ops.Graph().as_default():
205 with ops.Graph().as_default():
210 with ops.Graph().as_default():
216 with ops.Graph().as_default():
227 with ops.Graph().as_default():
237 with ops.Graph().as_default() as g
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/vendor/github.com/google/pprof/internal/graph/
graph.go 15 // Package graph collects a set of samples into a directed graph.
16 package graph package
29 // Graph summarizes a performance profile into a format that is
31 type Graph struct {
35 // Options encodes the options for constructing a graph
43 CallTree bool // Build a tree instead of a graph
49 // Nodes is an ordered collection of graph nodes.
182 // NodePtrSet is a collection of nodes. Trimming a graph or tree requires a set
183 // of objects which uniquely identify the nodes to keep. In a graph, NodeInf
    [all...]
  /prebuilts/go/linux-x86/src/cmd/vendor/github.com/google/pprof/internal/graph/
graph.go 15 // Package graph collects a set of samples into a directed graph.
16 package graph package
29 // Graph summarizes a performance profile into a format that is
31 type Graph struct {
35 // Options encodes the options for constructing a graph
43 CallTree bool // Build a tree instead of a graph
49 // Nodes is an ordered collection of graph nodes.
182 // NodePtrSet is a collection of nodes. Trimming a graph or tree requires a set
183 // of objects which uniquely identify the nodes to keep. In a graph, NodeInf
    [all...]
  /external/tensorflow/tensorflow/contrib/quantize/python/
fold_batch_norms_test.py 82 g = ops.Graph()
152 g = ops.Graph()
217 g = ops.Graph()
281 g = ops.Graph()
359 unfolded_g = ops.Graph()
388 with session.Session(graph=unfolded_g) as sess:
394 with session.Session(graph=folded_g) as sess:
453 def _AssertOutputGoesToOps(self, op, graph, out_op_names):
458 graph: Graph where output operations are located
    [all...]
quantize_parameterized_test.py 15 """Parameterized unit tests for quantizing a Tensorflow graph."""
73 graph = ops.Graph()
74 with graph.as_default():
91 quantize.Quantize(graph, True, quant_delay=delay)
93 weights_quant = graph.get_operation_by_name(scope + '/weights_quant/' +
106 self._AssertOutputGoesToOps(weights_quant, graph, [output_op_name])
109 conv_quant = graph.get_operation_by_name(scope + '/conv_quant/' +
119 self._AssertOutputGoesToOps(conv_quant, graph, [output_op_name])
121 act_quant = graph.get_operation_by_name('test/act_quant/'
    [all...]
  /external/tensorflow/tensorflow/core/kernels/
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/python/data/kernel_tests/
reader_dataset_ops_test.py 337 with ops.Graph().as_default() as g:
340 with self.test_session(graph=g) as sess:
364 with ops.Graph().as_default() as g:
367 with self.test_session(graph=g) as sess:
390 with ops.Graph().as_default() as g:
393 with self.test_session(graph=g) as sess:
417 with ops.Graph().as_default() as g:
420 with self.test_session(graph=g) as sess:
442 with ops.Graph().as_default() as g:
445 with self.test_session(graph=g) as sess
    [all...]
  /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.test_session(graph):
166 with ops.Graph().as_default() as graph:
167 with self.test_session(graph):
207 # Calling self.test_session() without a graph specified results in
210 # which is why we also create a graph and pass it to self.test_session()
213 with ops.Graph().as_default() as graph
    [all...]
  /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/signal/python/kernel_tests/
window_ops_test.py 101 g = ops.Graph()

Completed in 1342 milliseconds

<<21222324252627282930>>