| /external/tensorflow/tensorflow/core/kernels/ |
| string_split_op_test.cc | 25 #include "tensorflow/core/graph/node_builder.h"
38 "The graph nodes represent mathematical operations, while the graph edges "
67 Graph* SetupStringSplitGraph(const Tensor& input) {
68 Graph* g = new Graph(OpRegistry::Global());
73 .Input(test::graph::Constant(g, input))
74 .Input(test::graph::Constant(g, delim))
84 Graph* g = SetupStringSplitGraph(input);
98 Graph* SetupStringSplitV2Graph(const Tensor& input)
[all...] |
| random_op_test.cc | 40 Graph* RandomUniform(int64 n) {
41 Graph* g = new Graph(OpRegistry::Global());
42 test::graph::RandomUniform(g, test::graph::Constant(g, VecShape(n)),
47 Graph* RandomNormal(int64 n) {
48 Graph* g = new Graph(OpRegistry::Global());
49 test::graph::RandomGaussian(g, test::graph::Constant(g, VecShape(n))
[all...] |
| sdca_ops_test.cc | 19 #include "tensorflow/core/graph/node_builder.h"
52 Node* Var(Graph* const g, const int n) {
53 return test::graph::Var(g, DT_FLOAT, TensorShape({n}));
57 std::vector<Node*> VarVector(Graph* const g, const int nodes,
67 Node* Zeros(Graph* const g, const TensorShape& shape) {
70 return test::graph::Constant(g, data);
73 Node* Zeros(Graph* const g, const int n) { return Zeros(g, TensorShape({n})); }
75 Node* Ones(Graph* const g, const int n) {
78 return test::graph::Constant(g, data);
81 Node* SparseIndices(Graph* const g, const int sparse_features_per_group)
[all...] |
| /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/ |
| TensorFlowTest.java | 45 try (Graph g = new Graph()) {
46 // Build a graph with an unrecognized operation.
58 // Now graph building should succeed.
|
| OperationBuilderTest.java | 35 try (Graph g1 = new Graph();
36 Graph g2 = new Graph()) {
50 try (Graph g = new Graph();
66 try (Graph g = new Graph();
86 try (Graph g = new Graph()) {
[all...] |
| /external/v8/src/compiler/ |
| verifier.h | 15 class Graph;
20 // Verifies properties of a graph, such as the well-formedness of inputs to
28 static void Run(Graph* graph, Typing typing = TYPED,
|
| common-operator-reducer.h | 9 #include "src/compiler/graph-reducer.h"
18 class Graph;
27 CommonOperatorReducer(Editor* editor, Graph* graph,
50 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
56 Graph* const graph_;
|
| node-marker.cc | 7 #include "src/compiler/graph.h"
13 NodeMarkerBase::NodeMarkerBase(Graph* graph, uint32_t num_states)
14 : mark_min_(graph->mark_max_), mark_max_(graph->mark_max_ += num_states) {
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| HeuristicSolver.h | 19 #include "Graph.h"
29 /// to HeuristicSolver<HImpl>::solve(Graph&).
33 /// backpropagation phase, and maintains the internal copy of the graph on
43 typedef std::list<Graph::EdgeItr> SolverEdges;
47 /// \brief Iterator type for edges in the solver graph.
58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) {
104 Graph &g;
107 std::vector<Graph::NodeItr> stack;
118 /// graph.
119 /// @param g The graph representing the problem instance to be solved
[all...] |
| Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
25 /// PBQP Graph class.
27 class Graph {
139 inline void copyFrom(const Graph &other);
142 /// \brief Construct an empty PBQP graph.
143 Graph() : numNodes(0), numEdges(0) {}
145 /// \brief Copy construct this graph from "other". Note: Does not copy node
146 /// and edge data, only graph structure and costs
[all...] |
| /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/op/core/ |
| ZerosTest.java | 26 import org.tensorflow.Graph;
38 try (Graph g = new Graph();
56 try (Graph g = new Graph();
74 try (Graph g = new Graph();
92 try (Graph g = new Graph();
110 try (Graph g = new Graph()
[all...] |
| /external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/ |
| OperationBuilder.java | 21 * A builder for {@link Operation}s in a {@link Graph}.
25 * <p>A builder for adding {@link Operation}s to a {@link Graph}. For example, the following uses
29 * // g is a Graph instance.
40 OperationBuilder(Graph graph, String type, String name) {
41 this.graph = graph;
42 Graph.Reference r = graph.ref();
51 * Add the {@link Operation} being built to the {@link Graph}
314 private Graph graph; field in class:OperationBuilder
[all...] |
| /external/google-fruit/include/fruit/impl/injector/ |
| injector_storage.h | 49 using Graph = SemistaticGraph<TypeId, NormalizedBinding>;
127 // A graph with injected types as nodes (each node stores the NormalizedBindingData for the type) and dependencies as
148 Graph::node_iterator lazyGetPtr();
152 const C* getPtr(Graph::node_iterator itr);
155 const void* getPtrInternal(Graph::node_iterator itr);
158 Graph::node_iterator lazyGetPtr(TypeId type);
161 Graph::node_iterator lazyGetPtr(Graph::edge_iterator deps, std::size_t dep_index);
185 InjectorStorage::Graph::node_iterator node_itr);
188 static const_object_ptr_t createInjectedObjectForProvider(InjectorStorage& injector, Graph::node_iterator node_itr)
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 46 const ScheduleDAG *Graph) {
57 const ScheduleDAG *Graph) {
66 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
68 const ScheduleDAG *Graph) {
99 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName());
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 47 const ScheduleDAG *Graph) {
55 const ScheduleDAG *Graph) {
64 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
66 const ScheduleDAG *Graph) {
90 "Scheduling-Units Graph for " + MF.getFunction()->getNameStr() +
94 "Scheduling-Units Graph for " + MF.getFunction()->getNameStr());
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 44 const ScheduleDAG *Graph) {
55 const ScheduleDAG *Graph) {
64 std::string getNodeLabel(const SUnit *SU, const ScheduleDAG *Graph);
66 const ScheduleDAG *Graph) {
97 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName());
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| const_analysis.h | 21 #include "tensorflow/core/graph/graph.h"
26 // Backwards dataflow analysis that finds nodes in a graph that must be
27 // compile-time constants for us to be able to lower the graph to XLA.
29 // The indices of the arguments to `graph` that must be constant are returned in
33 // The ids of the nodes in `graph` that must be constant are returned in
38 const Graph& g, std::vector<bool>* compile_time_const_arg_indices,
|
| /external/tensorflow/tensorflow/core/common_runtime/gpu/ |
| gpu_stream_util.h | 21 #include "tensorflow/core/graph/graph.h"
37 // Given the input graph, assigns every node in the graph with a
39 Status AssignStreams(const Graph* graph, const AssignStreamsOpts& opts,
|
| /external/tensorflow/tensorflow/core/debug/ |
| debug_graph_utils.h | 24 #include "tensorflow/core/graph/graph.h"
33 // EXPERIMENTAL: Insert special debug ops (e.g., DebugIdentity) to graph for
36 // For example, before the node insertion, the graph may look like:
45 // graph becomes:
52 // If a node (e.g., B) has Ref input, the graph becomes:
75 const protobuf::RepeatedPtrField<DebugTensorWatch>& watches, Graph* graph,
82 static void DeparallelizeWhileLoops(Graph* graph, Device* device)
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| control_flow.h | 21 #include "tensorflow/core/graph/graph.h"
26 // Control flow info for a graph node.
34 // We check the well-formedness of the graph:
46 Status BuildControlFlowInfo(const Graph* g, std::vector<ControlFlowInfo>* info,
|
| gradients.h | 19 #include "tensorflow/core/graph/graph.h"
40 // 'y_node_outputs'), adds gradient nodes to 'graph' that compute the symbolic
54 Graph* graph);
|
| quantize_training.h | 19 #include "tensorflow/core/graph/graph.h"
22 // Rewrites graph for quantized training.
39 Graph* g);
|
| /external/tensorflow/tensorflow/core/util/ |
| dump_graph.h | 23 #include "tensorflow/core/framework/graph.pb.h"
24 #include "tensorflow/core/graph/graph.h"
33 // 'name' with ".pbtxt" to form a name. If a graph has already been dumped by
39 // Similar to DumpGraphDefToFile, but builds the GraphDef to dump from a 'graph'
41 string DumpGraphToFile(const string& name, Graph const& graph,
|
| /external/tensorflow/tensorflow/go/ |
| saved_model_test.go | 26 if op := bundle.Graph.Operation("y"); op == nil {
27 t.Fatalf("\"y\" not found in graph")
|
| util_test.go | 19 func Placeholder(g *Graph, name string, dt DataType) (Output, error) {
30 func Const(g *Graph, name string, value interface{}) (Output, error) {
49 func Neg(g *Graph, name string, port Output) (Output, error) {
58 func Add(g *Graph, name string, x, y Output) (Output, error) {
|
