| /external/tensorflow/tensorflow/core/graph/ |
| D | testlib.h | 36 void ToGraphDef(Graph* g, GraphDef* def);
41 Node* Constant(Graph* g, const Tensor& tensor);
42 Node* Constant(Graph* g, const Tensor& tensor, const string& name);
49 Node* HostConstant(Graph* g, const Tensor& tensor);
50 Node* HostConstant(Graph* g, const Tensor& tensor, const string& name);
53 Node* Var(Graph* g, const DataType dtype, const TensorShape& shape);
54 Node* Var(Graph* g, const DataType dtype, const TensorShape& shape,
58 Node* Assign(Graph* g, Node* var, Node* val);
62 Node* Send(Graph* g, Node* input, const string& tensor, const string& sender,
67 Node* Recv(Graph* g, const string& tensor, const string& type,
[all …]
|
| D | testlib.cc | 35 Node* Send(Graph* g, Node* input, const string& tensor, const string& sender, in Send()
49 Node* Recv(Graph* g, const string& tensor, const string& type, in Recv()
66 Node* Constant(Graph* g, const Tensor& tensor) { in Constant()
75 Node* Constant(Graph* g, const Tensor& tensor, const string& name) { in Constant()
84 Node* HostConstant(Graph* g, const Tensor& tensor) { in HostConstant()
88 Node* HostConstant(Graph* g, const Tensor& tensor, const string& name) { in HostConstant()
97 Node* Var(Graph* g, const DataType dtype, const TensorShape& shape) { in Var()
106 Node* Var(Graph* g, const DataType dtype, const TensorShape& shape, in Var()
116 Node* Assign(Graph* g, Node* var, Node* val) { in Assign()
126 Node* Cumsum(Graph* g, Node* data, Node* axes, bool exclusive, bool reverse) { in Cumsum()
[all …]
|
| D | algorithm.h | 53 extern void DFS(const Graph& g, const std::function<void(Node*)>& enter,
64 extern void DFSFrom(const Graph& g, gtl::ArraySlice<Node*> start,
69 extern void DFSFrom(const Graph& g, gtl::ArraySlice<const Node*> start,
80 extern void ReverseDFS(const Graph& g, const std::function<void(Node*)>& enter,
89 extern void ReverseDFSFrom(const Graph& g, gtl::ArraySlice<Node*> start,
93 extern void ReverseDFSFrom(const Graph& g, gtl::ArraySlice<const Node*> start,
110 void GetPostOrder(const Graph& g, std::vector<Node*>* order,
119 void GetReversePostOrder(const Graph& g, std::vector<Node*>* order,
126 bool PruneForReverseReachability(Graph* g,
133 bool FixupSourceAndSinkEdges(Graph* g);
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | training_ops_test.cc | 44 static Node* Var(Graph* g, int n) { in Var()
48 static Node* Var(Graph* g, int m, int n) { in Var()
52 static Node* Zeros(Graph* g, int n) { in Zeros()
58 static Node* Zeros(Graph* g, int m, int n) { in Zeros()
64 static Node* Random(Graph* g, int n) { in Random()
70 static Node* Random(Graph* g, int m, int n) { in Random()
76 static Node* Iota(Graph* g, int n) { in Iota()
83 static Node* Scalar(Graph* g, float val) { in Scalar()
89 static void SGD(int32 n, Graph** init_g, Graph** train_g) { in SGD()
91 Graph* g = new Graph(OpRegistry::Global()); in SGD()
[all …]
|
| D | sdca_ops_test.cc | 52 Node* Var(Graph* const g, const int n) { in Var()
57 std::vector<Node*> VarVector(Graph* const g, const int nodes, in VarVector()
67 Node* Zeros(Graph* const g, const TensorShape& shape) { in Zeros()
73 Node* Zeros(Graph* const g, const int n) { return Zeros(g, TensorShape({n})); } in Zeros()
75 Node* Ones(Graph* const g, const int n) { in Ones()
81 Node* SparseIndices(Graph* const g, const int sparse_features_per_group) { in SparseIndices()
87 Node* SparseExampleIndices(Graph* const g, const int sparse_features_per_group, in SparseExampleIndices()
95 Node* SparseFeatureIndices(Graph* const g, const int sparse_features_per_group, in SparseFeatureIndices()
104 Node* RandomZeroOrOne(Graph* const g, const int n) { in RandomZeroOrOne()
113 Node* RandomZeroOrOneMatrix(Graph* const g, const int n, int d) { in RandomZeroOrOneMatrix()
[all …]
|
| D | basic_ops_benchmark_test.cc | 38 static Node* Var(Graph* g, int n) { in Var()
42 static Node* Zeros(Graph* g, int n) { in Zeros()
48 static void MulChain(int chain_length, Graph** init_g, Graph** run_g) { in MulChain()
50 Graph* g = new Graph(OpRegistry::Global()); in MulChain()
56 Graph* g = new Graph(OpRegistry::Global()); in MulChain()
70 Graph* init; in BM_MulChain()
71 Graph* run; in BM_MulChain()
|
| D | random_op_test.cc | 40 Graph* RandomUniform(int64 n) { in RandomUniform()
41 Graph* g = new Graph(OpRegistry::Global()); in RandomUniform()
47 Graph* RandomNormal(int64 n) { in RandomNormal()
48 Graph* g = new Graph(OpRegistry::Global()); in RandomNormal()
54 Graph* TruncatedNormal(int64 n) { in TruncatedNormal()
55 Graph* g = new Graph(OpRegistry::Global()); in TruncatedNormal()
89 Graph* g = new Graph(OpRegistry::Global()); in BM_cpu_RandomGamma()
|
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| D | nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
35 class Graph
71 friend class Graph; variable
78 EdgeIterator(Graph::Edge *first, int dir, bool reverse) in EdgeIterator()
86 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]); in next()
98 Graph::Edge *e;
99 Graph::Edge *t;
128 Graph *getGraph() const { return graph; } in getGraph()
135 Graph *graph;
[all …]
|
| D | nv50_ir_graph.cpp | 31 Graph::Graph() in Graph() function in nv50_ir::Graph
38 Graph::~Graph() in ~Graph()
44 void Graph::insert(Node *node) in insert()
53 void Graph::Edge::unlink() in unlink()
73 const char *Graph::Edge::typeStr() const in typeStr()
86 Graph::Node::Node(void *priv) : data(priv), in Node()
94 void Graph::Node::attach(Node *node, Edge::Type kind) in attach()
128 bool Graph::Node::detach(Graph::Node *node) in detach()
143 void Graph::Node::cut() in cut()
157 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) in Edge()
[all …]
|
| /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/ |
| D | GraphOperationTest.java | 38 try (Graph g = new Graph()) { in outputListLengthFailsOnInvalidName()
58 try (Graph g = new Graph()) { in operationEquality()
73 try (Graph g = new Graph()) { in operationEquality()
81 try (Graph g = new Graph()) { in operationCollection()
98 try (Graph g = new Graph()) { in operationToString()
106 try (Graph g = new Graph()) { in outputEquality()
119 try (Graph g = new Graph()) { in outputCollection()
134 try (Graph g = new Graph()) { in outputToString()
159 try (Graph g = new Graph()) { in outputList()
172 try (Graph g = new Graph()) { in outputTensorNotSupported()
[all …]
|
| D | GraphTest.java | 37 try (Graph g = new Graph()) { in graphDefRoundTrip()
42 try (Graph g = new Graph()) { in graphDefRoundTrip()
46 try (Graph g = new Graph()) { in graphDefRoundTrip()
54 private static void validateImportedGraph(Graph g, String prefix) { in validateImportedGraph()
79 try (Graph g = new Graph()) { in iterateOverOperations()
107 try (Graph g = new Graph()) { in failImportOnInvalidGraphDefs()
124 Graph g = new Graph(); in failOnUseAfterClose()
135 try (Graph g = new Graph(); in addGradientsToGraph()
176 try (Graph g = new Graph(); in addGradientSumsToGraph()
202 try (Graph g = new Graph(); in addGradientsWithInitialValuesToGraph()
[all …]
|
| D | GraphOperationBuilderTest.java | 35 try (Graph g1 = new Graph(); in failWhenMixingOperationsOnDifferentGraphs()
36 Graph g2 = new Graph()) { in failWhenMixingOperationsOnDifferentGraphs()
50 try (Graph g = new Graph(); in failOnUseAfterBuild()
66 try (Graph g = new Graph(); in failOnUseAfterGraphClose()
86 try (Graph g = new Graph()) { in setAttr()
129 try (Graph g = new Graph()) { in setAttrShape()
167 try (Graph g = new Graph(); in addControlInput()
193 try (Graph g = new Graph(); in testSetAttrShapeList()
216 private static boolean hasNode(Graph g, String name) { in hasNode()
|
| D | SessionTest.java | 33 try (Graph g = new Graph(); in runUsingOperationNames()
48 try (Graph g = new Graph(); in runUsingOperationHandles()
65 try (Graph g = new Graph(); in runUsingColonSeparatedNames()
102 try (Graph g = new Graph(); in runWithMetadata()
132 try (Graph g = new Graph(); in runMultipleOutputs()
147 try (Graph g = new Graph()) { in failOnUseAfterClose()
161 try (Graph g = new Graph(); in createWithConfigProto()
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | function.h | 75 Graph* graph = nullptr; // owned.
88 DataTypeSlice ret_types, Graph* g);
94 string DebugString(const Graph* g);
115 bool RemoveDeadNodes(Graph* g);
126 bool RemoveIdentityNodes(Graph* g);
129 bool RemoveListArrayConverter(Graph* g);
133 void DumpGraph(StringPiece label, const Graph* g);
142 void OptimizeGraph(FunctionLibraryRuntime* lib, std::unique_ptr<Graph>* g,
144 void OptimizeGraph(FunctionLibraryRuntime* lib, std::unique_ptr<Graph>* g);
150 void ToGraphDef(const Graph* g, GraphDef* gdef, bool pretty = false);
[all …]
|
| /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/op/core/ |
| D | ConstantTest.java | 34 import org.tensorflow.Graph;
47 try (Graph g = new Graph(); in createInt()
62 try (Graph g = new Graph(); in createIntBuffer()
77 try (Graph g = new Graph(); in createFloat()
92 try (Graph g = new Graph(); in createFloatBuffer()
107 try (Graph g = new Graph(); in createDouble()
122 try (Graph g = new Graph(); in createDoubleBuffer()
137 try (Graph g = new Graph(); in createLong()
152 try (Graph g = new Graph(); in createLongBuffer()
167 try (Graph g = new Graph(); in createBoolean()
[all …]
|
| D | ZerosTest.java | 26 import org.tensorflow.Graph;
38 try (Graph g = new Graph(); in createIntZeros()
56 try (Graph g = new Graph(); in createFloatZeros()
74 try (Graph g = new Graph(); in createDoubleZeros()
92 try (Graph g = new Graph(); in createLongZeros()
110 try (Graph g = new Graph(); in createBooleanZeros()
128 try (Graph g = new Graph(); in createUInt8Zeros()
147 try (Graph g = new Graph(); in cannotCreateStringZeros()
157 try (Graph g = new Graph(); in operationsComposingZerosAreCorrectlyNamed()
|
| /external/tensorflow/tensorflow/python/framework/ |
| D | importer_test.py | 62 with ops.Graph().as_default():
120 with ops.Graph().as_default():
222 with ops.Graph().as_default():
236 with ops.Graph().as_default():
263 with ops.Graph().as_default():
290 with ops.Graph().as_default():
317 with ops.Graph().as_default():
328 with ops.Graph().as_default():
341 with ops.Graph().as_default():
352 with ops.Graph().as_default():
[all …]
|
| /external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/ |
| D | GraphOperationBuilder.java | 23 GraphOperationBuilder(Graph graph, String type, String name) { in GraphOperationBuilder()
25 Graph.Reference r = graph.ref(); in GraphOperationBuilder()
40 Graph.Reference r = graph.ref(); in build()
56 Graph.Reference r = graph.ref(); in addControlInput()
67 Graph.Reference r = graph.ref(); in addInput()
78 Graph.Reference r = graph.ref(); in addInputList()
95 Graph.Reference r = graph.ref(); in setDevice()
112 Graph.Reference r = graph.ref(); in setAttr()
123 Graph.Reference r = graph.ref(); in setAttr()
134 Graph.Reference r = graph.ref(); in setAttr()
[all …]
|
| D | GraphOperation.java | 33 GraphOperation(Graph g, long unsafeNativeHandle) { in GraphOperation()
40 Graph.Reference r = graph.ref(); in name()
50 Graph.Reference r = graph.ref(); in type()
60 Graph.Reference r = graph.ref(); in numOutputs()
70 Graph.Reference r = graph.ref(); in outputListLength()
99 Graph.Reference r = graph.ref(); in equals()
109 Graph.Reference r = graph.ref(); in inputListLength()
124 Graph.Reference r = graph.ref(); in shape()
134 Graph.Reference r = graph.ref(); in dtype()
151 private final Graph graph;
|
| D | Graph.java | 28 public final class Graph implements ExecutionEnvironment, AutoCloseable { class
31 public Graph() { in Graph() method in Graph
36 Graph(long nativeHandle) { in Graph() method in Graph
267 public void buildSubgraph(Graph g, Output<?>[] inputs, Output<?>[] outputs); in buildSubgraph()
278 Graph subgraph = new Graph(subgraphHandle); in buildSubgraph()
361 synchronized (Graph.this.nativeHandleLock) { in Reference()
362 active = Graph.this.nativeHandle != 0; in Reference()
367 Graph.this.refcount++; in Reference()
373 synchronized (Graph.this.nativeHandleLock) { in close()
378 if (--Graph.this.refcount == 0) { in close()
[all …]
|
| /external/tensorflow/tensorflow/python/saved_model/ |
| D | saved_model_test.py | 106 with self.session(graph=ops.Graph()) as sess:
119 with self.session(graph=ops.Graph()) as sess:
130 with self.session(graph=ops.Graph()) as sess:
142 with self.session(graph=ops.Graph()) as sess:
152 with self.session(graph=ops.Graph()) as sess:
174 with self.session(graph=ops.Graph()) as sess:
185 with self.session(graph=ops.Graph()) as sess:
199 with self.session(graph=ops.Graph()) as sess:
209 with self.session(graph=ops.Graph()) as sess:
217 sess = session.Session(graph=ops.Graph())
[all …]
|
| /external/v8/src/compiler/ |
| D | graph.cc | 19 Graph::Graph(Zone* zone) in Graph() function in v8::internal::compiler::Graph
32 void Graph::Decorate(Node* node) { in Decorate()
39 void Graph::AddDecorator(GraphDecorator* decorator) { in AddDecorator()
44 void Graph::RemoveDecorator(GraphDecorator* decorator) { in RemoveDecorator()
50 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs, in NewNode()
57 Node* Graph::NewNodeUnchecked(const Operator* op, int input_count, in NewNodeUnchecked()
66 Node* Graph::CloneNode(const Node* node) { in CloneNode()
74 NodeId Graph::NextNodeId() { in NextNodeId()
81 void Graph::Print() const { StdoutStream{} << AsRPO(*this); } in Print()
|
| /external/antlr/tool/src/test/java/org/antlr/test/ |
| D | TestTopologicalSort.java | 30 import org.antlr.misc.Graph;
41 Graph<String> g = new Graph<String>(); in testFairlyLargeGraph()
62 Graph<String> g = new Graph<String>(); in testCyclicGraph()
76 Graph<String> g = new Graph<String>(); in testRepeatedEdges()
90 Graph<String> g = new Graph<String>(); in testSimpleTokenDependence()
104 Graph<String> g = new Graph<String>(); in testParserLexerCombo()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| D | TestGraph.h | 26 class Graph {
29 Graph(const Graph&);
30 Graph& operator=(const Graph&);
109 Graph() { in Graph() function
165 friend class Graph; variable
236 struct GraphTraits<Graph<N> > {
237 typedef typename Graph<N>::NodeType *NodeRef;
238 typedef typename Graph<N>::ChildIterator ChildIteratorType;
240 static NodeRef getEntryNode(const Graph<N> &G) { return G.AccessNode(0); }
242 return Graph<N>::child_begin(Node);
[all …]
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | mark_for_compilation_pass_test.cc | 51 std::unordered_map<string, string> GetClusters(const Graph& graph) { in GetClusters()
71 const Graph& g, std::vector<string>* cluster_names = nullptr) { in GetClusterSets()
90 std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global())); in TEST()
115 std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global())); in TEST()
135 std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global())); in TEST()
156 std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global())); in TEST()
175 std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global())); in TEST()
209 std::unique_ptr<Graph> graph(new Graph(&flib_def)); in TEST()
250 std::unique_ptr<Graph> graph(new Graph(&flib_def)); in TEST()
287 std::unique_ptr<Graph> graph(new Graph(&flib_def)); in TEST()
[all …]
|