| /external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/ |
| Operation.java | 19 * A Graph node that performs computation on Tensors.
21 * <p>An Operation is a node in a {@link Graph} that takes zero or more {@link Tensor}s (produced by
22 * other Operations in the Graph) as input, and produces zero or more {@link Tensor}s as output.
24 * <p>Operation instances are valid only as long as the Graph they are a part of is valid. Thus, if
25 * {@link Graph#close()} has been invoked, then methods on the Operation instance may fail with an
34 // called unsafeHandle. Graph.ref() is used to safely use the unsafeHandle.
35 Operation(Graph g, long unsafeNativeHandle) {
36 this.graph = g;
42 Graph.Reference r = graph.ref()
205 private final Graph graph; field in class:Operation
[all...] |
| SavedModelBundle.java | 21 * <p>The model consists of a description of the computation (a {@link Graph}), a {@link Session}
22 * with tensors (e.g., parameters or variables in the graph) initialized to values saved in storage,
60 * Sets the set of tags that identify the specific graph in the saved model to load.
92 * @return a bundle containing the graph and associated session.
119 /** Returns the graph that describes the computation performed by the model. */
120 public Graph graph() { method in class:SavedModelBundle
121 return graph;
134 * Releases resources (the {@link Graph} and {@link Session}) associated with the saved model
140 graph.close()
143 private final Graph graph; field in class:SavedModelBundle
161 Graph graph = new Graph(graphHandle); local
[all...] |
| /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/ |
| OperationTest.java | 37 try (Graph g = new Graph()) {
57 try (Graph g = new Graph()) {
72 try (Graph g = new Graph()) {
80 try (Graph g = new Graph()) {
97 try (Graph g = new Graph()) {
[all...] |
| SessionTest.java | 33 try (Graph g = new Graph();
48 try (Graph g = new Graph();
65 try (Graph g = new Graph();
102 try (Graph g = new Graph();
132 try (Graph g = new Graph();
[all...] |
| GraphTest.java | 29 /** Unit tests for {@link org.tensorflow.Graph}. */
36 // Create a graph for A * X + B
37 try (Graph g = new Graph()) {
42 try (Graph g = new Graph()) {
46 try (Graph g = new Graph()) {
54 private static void validateImportedGraph(Graph g, String prefix) {
79 try (Graph g = new Graph())
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| testlib.cc | 16 #include "tensorflow/core/graph/testlib.h"
20 #include "tensorflow/core/framework/graph.pb.h"
26 #include "tensorflow/core/graph/graph.h"
27 #include "tensorflow/core/graph/node_builder.h"
33 namespace graph { namespace in namespace:tensorflow::test
35 Node* Send(Graph* g, Node* input, const string& tensor, const string& sender,
49 Node* Recv(Graph* g, const string& tensor, const string& type,
66 Node* Constant(Graph* g, const Tensor& tensor) {
75 Node* Constant(Graph* g, const Tensor& tensor, const string& name)
[all...] |
| subgraph.h | 22 #include "tensorflow/core/graph/graph.h"
23 #include "tensorflow/core/graph/node_builder.h"
31 // Information about a graph rewritten by `RewriteGraphForExecution()`.
44 // a "<node_name>:<output_index>" pair) when pruning the graph.
49 // with an error if the resulting graph would be invalid.
57 // Creates a new node whose output replaces the given `tensor` in graph `g`.
59 virtual Status AddNode(Graph* g, NodeBuilder::NodeOut tensor,
74 // Rewrite the graph structure of "*g" to deal with feeding node
76 // graph. "fed_outputs" and "fetch_outputs" are both lists o
[all...] |
| graph_constructor.h | 19 #include "tensorflow/core/framework/graph.pb.h"
20 #include "tensorflow/core/graph/graph.h"
21 #include "tensorflow/core/graph/tensor_id.h"
27 // Construct a Graph *g out of a GraphDef gdef. Returns non-OK on
30 // *g is expected to be an empty graph (with no more than a source and sink
31 // nodes) when provided to ConvertGraphDefToGraph. To enhance an existing Graph,
39 // If true, the graph def is expected to have fully specified
40 // devices for all nodes. A node in the resulting graph "g" has the
47 const GraphDef& gdef, Graph* g)
[all...] |
| /art/tools/ahat/src/test/com/android/ahat/ |
| DominatorsTest.java | 32 private static class Graph implements Dominators.Graph<String> {
57 * Define a node in the graph, including all its outgoing edges.
75 Graph graph = new Graph(); local
76 graph.node("n");
77 new Dominators(graph).computeDominators("n");
84 Graph graph = new Graph() local
98 Graph graph = new Graph(); local
115 Graph graph = new Graph(); local
129 Graph graph = new Graph(); local
144 Graph graph = new Graph(); local
157 Graph graph = new Graph(); local
176 Graph graph = new Graph(); local
201 Graph graph = new Graph(); local
217 Graph graph = new Graph(); local
240 Graph graph = new Graph(); local
267 Graph graph = new Graph(); local
294 Graph graph = new Graph(); local
[all...] |
| /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/op/core/ |
| ConstantTest.java | 34 import org.tensorflow.Graph;
47 try (Graph g = new Graph();
62 try (Graph g = new Graph();
77 try (Graph g = new Graph();
92 try (Graph g = new Graph();
107 try (Graph g = new Graph()
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| TestGraph.h | 1 //===- llvm/unittest/ADT/TestGraph.h - Graph for testing ------------------===//
10 // Common graph data structure for testing.
24 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
26 class Graph {
29 Graph(const Graph&);
30 Graph& operator=(const Graph&);
37 /// NodeSubset - A subset of the graph's nodes
[all...] |
| DepthFirstIteratorTest.cpp | 42 typedef CountedSet<Graph<3>::NodeType *> StorageT;
43 typedef df_iterator<Graph<3>, StorageT, true> DFIter;
45 Graph<3> G;
|
| /external/llvm/include/llvm/Analysis/ |
| DOTGraphTraitsPass.h | 23 /// \brief Default traits class for extracting a graph from an analysis pass.
55 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis);
56 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph);
59 ViewGraph(Graph, Name, IsSimple, Title);
97 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis);
104 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph);
108 WriteGraph(File, Graph, IsSimple, Title);
134 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>());
135 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph);
137 ViewGraph(Graph, Name, IsSimple, Title)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| Solution.h | 18 #include "Graph.h"
30 typedef std::map<Graph::ConstNodeItr, unsigned,
77 void setSelection(Graph::NodeItr nItr, unsigned selection) {
84 unsigned getSelection(Graph::ConstNodeItr nItr) const {
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| DOTGraphTraitsPass.h | 23 /// Default traits class for extracting a graph from an analysis pass.
55 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis);
56 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph);
59 ViewGraph(Graph, Name, IsSimple, Title);
97 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis);
104 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph);
108 WriteGraph(File, Graph, IsSimple, Title);
134 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>());
135 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph);
137 ViewGraph(Graph, Name, IsSimple, Title)
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| partitioning_utils.h | 27 // Given a `device_set` and a `graph`, partitions the `graph` into
28 // `subgraphs`. `subgraphs` maps device names to the graph assigned to that
29 // device. `graph` must have been placed (e.g. by running Placer),
31 // `graph` is non-const because the underlying Partition() function transforms
32 // the graph to correctly partition distributed control flow.
34 const DeviceSet& device_set, std::unique_ptr<Graph> graph,
35 std::unordered_map<string, std::unique_ptr<Graph>>* subgraphs);
60 Graph* subgraph, std::vector<int>* arg_indices
[all...] |
| constant_folding.h | 22 #include "tensorflow/core/graph/graph.h"
32 std::function<string(Graph* graph, string old_name)>;
54 // Perform constant folding optimization on "graph".
55 // Looks for nodes in "graph" that can be completely evaluated statically, i.e.,
58 // "partition_device", if non-null, is the device where all the graph nodes are
60 // Sets `was_mutated` to true if and only if "graph" has been mutated.
62 // running the graph.
65 Device* partition_device, Graph* graph, bool* was_mutated)
[all...] |
| /external/v8/src/compiler/ |
| loop-peeling.h | 37 LoopPeeler(Graph* graph, CommonOperatorBuilder* common, LoopTree* loop_tree,
40 : graph_(graph),
50 static void EliminateLoopExits(Graph* graph, Zone* tmp_zone);
54 Graph* const graph_;
|
| typer.h | 8 #include "src/compiler/graph.h"
29 Graph* graph);
33 // TODO(bmeurer,jarin): Remove this once we have a notion of "roots" on Graph.
42 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::Typer
43 Zone* zone() const { return graph()->zone(); }
48 Graph* const graph_;
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/ |
| Briggs.h | 11 // PBQP graph representing a register allocation problem. Nodes which can be
13 // the PBQP graph first. If no provably allocable node is present in the graph
51 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
64 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
78 Graph *g;
81 typedef std::list<Graph::NodeItr> RNAllocableList;
84 typedef std::list<Graph::NodeItr> RNUnallocableList;
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 21 #include "llvm/CodeGen/PBQP/Graph.h"
43 PBQP::Graph& getGraph() { return graph; }
45 const PBQP::Graph& getGraph() const { return graph; }
54 void recordVReg(unsigned vreg, PBQP::Graph::NodeItr node,
66 unsigned getVRegForNode(PBQP::Graph::ConstNodeItr node) const;
69 PBQP::Graph::NodeItr getNodeForVReg(unsigned vreg) const;
94 typedef std::map<PBQP::Graph::ConstNodeItr, unsigned,
96 typedef DenseMap<unsigned, PBQP::Graph::NodeItr> VReg2Node
99 PBQP::Graph graph; member in class:llvm::PBQPRAProblem
[all...] |
| /external/tensorflow/tensorflow/compiler/jit/ |
| clone_constants_for_better_clustering.h | 25 // Clones small host constants in the graph to make it easier to form larger
36 // following graph:
64 Graph* g, const absl::flat_hash_set<string>& name_set, Node* n);
68 Graph* g, const absl::flat_hash_set<string>& name_set, Node* n);
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| functionalize_control_flow_util.h | 21 #include "tensorflow/core/graph/graph.h"
27 // Check that the graph has no cycle containing the given node.
37 // Returns the Node* created from the NodeDef in the Graph.
38 xla::StatusOr<Node*> AddNodeDefToGraph(const NodeDef& node_def, Graph* graph);
41 xla::StatusOr<Node*> BuildRetvalNode(Graph* graph, DataType type, int index);
|
| graph_compiler.h | 36 // GraphCompiler compiles the graph in topological order in the current
37 // thread. It also resolves the nondeterminism in the graph by enforcing a
40 // If a function call is visited during the graph traversal, it is then
58 GraphCompiler(XlaCompilationDevice* device, Graph* graph,
62 graph_(graph),
66 // Compiles the graph. The results are written in xla_context stored in the
82 Graph* graph_;
85 // A buffer to hold tensor inputs to a node, this is reused across the graph
|
| /external/tensorflow/tensorflow/core/kernels/ |
| regex_replace_op_test.cc | 25 #include "tensorflow/core/graph/node_builder.h"
38 "The graph nodes represent mathematical operations, while the graph edges "
70 Graph* SetupRegexReplaceGraph(const Tensor& input, const string& input_pattern,
72 Graph* g = new Graph(OpRegistry::Global());
79 .Input(test::graph::Constant(g, input))
80 .Input(test::graph::Constant(g, pattern))
81 .Input(test::graph::Constant(g, rewrite))
92 Graph* g = SetupRegexReplaceGraph(input, kRegExPattern, kRewrite)
[all...] |
