| /external/tensorflow/tensorflow/core/kernels/ |
| parameterized_truncated_normal_op_test.cc | 21 #include "tensorflow/core/graph/node_builder.h"
27 static Graph* PTruncatedNormal(int num_batches, int samples_per_batch) {
28 Graph* g = new Graph(OpRegistry::Global());
46 .Input(test::graph::Constant(g, shape_t))
47 .Input(test::graph::Constant(g, means_t))
48 .Input(test::graph::Constant(g, stdevs_t))
49 .Input(test::graph::Constant(g, minvals_t))
50 .Input(test::graph::Constant(g, maxvals_t))
56 static Graph* PTruncatedNormal2SD(int num_batches, int samples_per_batch)
[all...] |
| bias_op_test.cc | 26 static Graph* BiasAddGrad(int d0, int d1, int d2, int d3) {
27 auto* g = new Graph(OpRegistry::Global());
30 test::graph::Unary(g, "BiasAddGrad", test::graph::Constant(g, out_backprop));
|
| scan_ops_test.cc | 25 static Graph* LargeOneDCumsum(int num_x, bool reverse = false) {
26 auto* g = new Graph(OpRegistry::Global());
31 test::graph::Cumsum(g, test::graph::Constant(g, data),
32 test::graph::Constant(g, axes));
36 static Graph* ColCumsum(int num_x, int num_y, bool reverse = false) {
37 auto* g = new Graph(OpRegistry::Global());
42 test::graph::Cumsum(g, test::graph::Constant(g, data),
43 test::graph::Constant(g, axes))
[all...] |
| 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/tensorflow/tensorflow/java/src/test/java/org/tensorflow/op/core/ |
| GradientsTest.java | 26 import org.tensorflow.Graph;
39 try (Graph g = new Graph();
66 try (Graph g = new Graph();
91 try (Graph g = new Graph();
118 try (Graph g = new Graph()) {
|
| /external/tensorflow/tensorflow/python/training/ |
| training_util_test.py | 39 with ops.Graph().as_default() as g:
52 with ops.Graph().as_default() as g:
66 with ops.Graph().as_default() as g:
73 self._assert_global_step(training_util.create_global_step(ops.Graph()))
76 with ops.Graph().as_default() as g:
89 with ops.Graph().as_default() as g:
99 with ops.Graph().as_default():
105 with ops.Graph().as_default():
112 with ops.Graph().as_default():
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| CFLGraph.h | 49 /// The Program Expression Graph (PEG) of CFL analysis
52 /// the main purpose of this graph is to abstract away unrelated facts and
54 /// Each Node in the graph is an InstantiatedValue, and each edge represent a
56 /// references/dereferences are not explicitly stored in the graph: we
171 CFLGraph Graph;
175 /// Gets the edges our graph should have, based on an Instruction*
181 CFLGraph &Graph;
210 if (Graph.addNode(InstantiatedValue{GVal, 0},
212 Graph.addNode(InstantiatedValue{GVal, 1}, getAttrUnknown());
215 if (Graph.addNode(InstantiatedValue{CExpr, 0})
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_bb.cpp | 106 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
117 Graph::Node *dn = dom.parent();
314 Graph::Edge *e = cfg.outgoing(true).getEdge();
326 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
358 Graph::Node *bn = &that->dom;
359 Graph::Node *dn = &this->dom;
370 Graph::Node *out[2];
372 Graph::Edge::Type eR;
378 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next())
383 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK
[all...] |
| /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"
35 const int Graph::kControlSlot = -1;
347 // Graph
349 Graph::Graph(const OpRegistryInterface* ops)
377 Graph::Graph(const FunctionLibraryDefinition& flib_def
[all...] |
| tensor_id.cc | 16 #include "tensorflow/core/graph/tensor_id.h"
57 id.second = Graph::kControlSlot;
66 return tensor_id.index() == Graph::kControlSlot;
|
| tensor_id.h | 21 #include "tensorflow/core/graph/graph.h"
48 if (second == Graph::kControlSlot) return strings::StrCat("^", first);
80 if (second == Graph::kControlSlot) return strings::StrCat("^", first);
|
| /art/tools/ahat/src/main/com/android/ahat/dominators/ |
| DominatorsComputation.java | 24 * directed graph. It can be used with any directed graph data structure
35 * Interface for a directed graph to perform immediate dominators
37 * The dominators computation can be used with directed graph data
39 * dominators computation on your graph, you must make the following
119 * graph, for progress tracking purposes only.
123 Dominators.Graph<Node> graph = new Dominators.Graph<Node>() { local
145 new Dominators(graph).progress(progress, numNodes).computeDominators(root)
[all...] |
| /external/google-fruit/include/fruit/ |
| provider.h | 139 fruit::impl::InjectorStorage::Graph::node_iterator itr;
141 Provider(fruit::impl::InjectorStorage* storage, fruit::impl::InjectorStorage::Graph::node_iterator itr);
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| extract_outside_compilation_pass.h | 22 #include "tensorflow/core/graph/graph.h"
55 std::unique_ptr<Graph>* graph,
68 // single host side graph (`host_graph`).
80 // host_graph: Graph object to store host side graph for all outside
99 // inference graph into `fld`.
103 const std::unordered_map<string, XlaClusterInfo>& clusters, Graph* g,
|
| /external/tensorflow/tensorflow/contrib/graph_editor/tests/ |
| util_test.py | 49 g0 = ops.Graph()
53 g1 = ops.Graph()
57 # Same graph, should be fine.
62 # a0 and b0 belongs to the same graph, should be fine.
64 # Different graph, should raise an error.
70 g0 = ops.Graph()
74 # Should extract the ops from the graph.
81 g0 = ops.Graph()
86 # Should extract the tensors from tre graph.
97 g0 = ops.Graph()
[all...] |
| /external/tensorflow/tensorflow/contrib/layers/python/layers/ |
| target_column_test.py | 34 with ops.Graph().as_default(), session.Session() as sess:
43 with ops.Graph().as_default(), session.Session() as sess:
61 with ops.Graph().as_default(), session.Session() as sess:
74 with ops.Graph().as_default(), session.Session() as sess:
87 with ops.Graph().as_default(), session.Session() as sess:
100 with ops.Graph().as_default(), session.Session() as sess:
111 with ops.Graph().as_default(), session.Session() as sess:
130 with ops.Graph().as_default(), session.Session() as sess:
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| debugger_state_interface.h | 22 #include "tensorflow/core/graph/graph.h"
62 // Insert special-purpose debug nodes to graph and dump the graph for
65 virtual Status DecorateGraph(Graph* graph, Device* device) = 0;
67 // Publish Graph to debug URLs.
68 virtual Status PublishGraph(const Graph& graph,
|
| /external/tensorflow/tensorflow/core/debug/ |
| debugger_state_impl.cc | 51 Status DebugGraphDecorator::DecorateGraph(Graph* graph, Device* device) {
52 DebugNodeInserter::DeparallelizeWhileLoops(graph, device);
54 debug_options_.debug_tensor_watch_opts(), graph, device);
57 Status DebugGraphDecorator::PublishGraph(const Graph& graph,
67 return DebugIO::PublishGraph(graph, device_name, debug_urls);
|
| /external/tensorflow/tensorflow/core/util/ |
| dump_graph_test.cc | 17 #include "tensorflow/core/graph/graph.h"
18 #include "tensorflow/core/graph/node_builder.h"
28 Graph graph(OpRegistry::Global());
30 TF_CHECK_OK(NodeBuilder("A", "NoOp").Finalize(&graph, &node));
33 string ret = DumpGraphToFile("graph", graph);
34 EXPECT_EQ(ret, io::JoinPath(testing::TmpDir(), "graph.pbtxt"));
35 ret = DumpGraphToFile("graph", graph)
[all...] |
| /external/tensorflow/tensorflow/python/framework/ |
| smart_cond_test.py | 40 with ops.Graph().as_default():
50 with ops.Graph().as_default():
59 with ops.Graph().as_default():
68 with ops.Graph().as_default():
72 # x * y > 0 can be evaluated at graph construction time, so the false
79 with ops.Graph().as_default():
88 with ops.Graph().as_default():
95 with ops.Graph().as_default():
153 with ops.Graph().as_default():
|
| /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...] |
| /external/tensorflow/tensorflow/core/kernels/data/ |
| single_threaded_executor_test.cc | 28 #include "tensorflow/core/graph/algorithm.h"
29 #include "tensorflow/core/graph/graph_constructor.h"
56 // Resets executor_ with a new executor based on a graph 'gdef'.
57 void Create(std::unique_ptr<const Graph> graph) {
58 const int version = graph->versions().producer();
70 TF_CHECK_OK(NewSingleThreadedExecutor(params, std::move(graph), &exec_));
142 std::unique_ptr<Graph> g = absl::make_unique<Graph>(OpRegistry::Global());
143 auto in0 = test::graph::Arg(g.get(), 0, DT_FLOAT)
[all...] |
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| functionalize_cond.h | 22 #include "tensorflow/core/graph/graph.h"
26 // Functionalize all the switch-merge nodes of a loop-free graph into If
28 // in the graph into If nodes.
29 // Precondition: All while loops have been removed from graph.
30 Status FunctionalizeCond(Graph* graph, FunctionLibraryDefinition* library);
73 // StateMap is responsible for mapping from each graph Node to
77 // that are an ancestor of the node in the graph;
83 explicit StateMap(Graph* graph)
[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());
|
