| /external/tensorflow/tensorflow/core/graph/ |
| graph_def_builder_util.h | 18 #include "tensorflow/core/graph/graph_def_builder.h"
23 class Graph;
25 // Converts the `GraphDef` being built by `builder` to a `Graph` and
26 // stores it in `*graph`.
28 // Graph->GraphDef->Graph. This cleans up the graph (e.g. adds
30 // by name), and makes sure the resulting graph is valid.
31 Status GraphDefBuilderToGraph(const GraphDefBuilder& builder, Graph* graph);
[all...] |
| testlib.h | 26 #include "tensorflow/core/graph/graph.h"
27 #include "tensorflow/core/graph/types.h"
32 namespace graph { namespace in namespace:tensorflow::test
36 void ToGraphDef(Graph* g, GraphDef* def);
38 // A few helpers to construct a graph.
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)
[all...] |
| mkl_layout_pass.h | 16 // A graph pass that rewrites graph for propagating MKL layout as a tensor
25 #include "tensorflow/core/graph/graph.h"
31 extern bool RunMklLayoutRewritePass(std::unique_ptr<Graph>* g);
|
| mkl_tfconversion_pass.h | 16 // An optimization pass that inserts MklToTf conversion nodes in the graph
25 #include "tensorflow/core/graph/graph.h"
31 extern bool InsertMklToTfConversionNodes(std::unique_ptr<Graph>* g);
|
| optimizer_cse.h | 22 #include "tensorflow/core/graph/graph.h"
26 // Perform common-subexpression elimination on the graph "*g". If
32 extern bool OptimizeCSE(Graph* g,
|
| algorithm.h | 23 #include "tensorflow/core/graph/graph.h"
50 extern void DFS(const Graph& g, const std::function<void(Node*)>& enter,
59 extern void ReverseDFS(const Graph& g, const std::function<void(Node*)>& enter,
68 extern void ReverseDFSFrom(const Graph& g, gtl::ArraySlice<Node*> start,
72 extern void ReverseDFSFrom(const Graph& g, gtl::ArraySlice<const Node*> start,
78 // in graph found via a depth first search starting at the source node.
81 // graph does not have cycles.
87 void GetPostOrder(const Graph& g, std::vector<Node*>* order,
93 void GetReversePostOrder(const Graph& g, std::vector<Node*>* order
[all...] |
| /external/v8/src/compiler/ |
| graph-replay.h | 15 class Graph;
17 // Helper class to print a full replay of a graph. This replay can be used to
18 // materialize the same graph within a C++ unit test and hence test subsequent
19 // optimization passes on a graph without going through the construction steps.
23 static void PrintReplay(Graph* graph);
25 static void PrintReplay(Graph* graph) {}
|
| select-lowering.h | 8 #include "src/compiler/graph-reducer.h"
16 class Graph;
22 SelectLowering(Graph* graph, CommonOperatorBuilder* common);
29 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
32 Graph* graph_;
|
| basic-block-instrumentor.h | 18 class Graph;
24 Graph* graph, Schedule* schedule);
|
| tail-call-optimization.h | 8 #include "src/compiler/graph-reducer.h"
17 class Graph;
24 TailCallOptimization(CommonOperatorBuilder* common, Graph* graph)
25 : common_(common), graph_(graph) {}
31 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
34 Graph* const graph_;
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| functionalize_control_flow.h | 20 #include "tensorflow/core/graph/graph.h"
26 Status FunctionalizeControlFlow(Graph* graph,
|
| const_analysis.h | 21 #include "tensorflow/core/graph/graph.h"
26 // Backwards dataflow analysis that finds arguments (_Arg nodes) to a graph that
28 Status BackwardsConstAnalysis(const Graph& graph,
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| costmodel_manager.h | 22 #include "tensorflow/core/graph/costmodel.h"
23 #include "tensorflow/core/graph/graph.h"
34 typedef std::unordered_map<const Graph*, CostModel*> CostModelMap;
42 CostModel* FindOrCreateCostModel(const Graph* graph);
44 bool RemoveCostModelForGraph(const Graph* graph);
46 Status AddToCostGraphDef(const Graph* graph, CostGraphDef* cost_graph)
[all...] |
| memory_types.h | 20 #include "tensorflow/core/graph/graph.h"
27 Status ValidateMemoryTypes(const DeviceType& device_type, const Graph* g);
39 const string& device_name, Graph* g);
41 // Get the memory type for 'index'th output of node 'n' in graph 'g', when
43 Status MemoryTypeForOutput(const DeviceType& device_type, const Graph* g,
|
| function.h | 26 #include "tensorflow/core/graph/graph.h"
72 // instantiated function that is represented as a Graph with arg/ret
76 Graph* graph = nullptr; // owned. member in struct:tensorflow::FunctionBody
84 DataTypeSlice ret_types, Graph* g);
88 // Debugging facility. Returns a debug string for a graph
90 string DebugString(const Graph* instantiated_func_graph);
93 // (a Graph*).
100 bool RemoveDeadNodes(Graph* g)
[all...] |
| /hardware/interfaces/tests/pointer/1.0/default/lib/include/hidl-test/ |
| PointerHelper.h | 10 void simpleGraph(IGraph::Graph& g);
11 bool isSimpleGraph(const IGraph::Graph &g);
12 void logSimpleGraph(const char *prefix, const IGraph::Graph& g);
|
| /external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/op/ |
| Scope.java | 18 import org.tensorflow.Graph;
28 * Scope scope = new Scope(graph);
39 * scope.graph().opBuilder(
56 * Scope root = new Scope(graph);
81 * @param graph The graph instance to be managed by the scope.
83 public Scope(Graph graph) {
84 this(graph, new NameScope());
87 /** Returns the graph managed by this scope. *
88 public Graph graph() { method in class:Scope
163 private final Graph graph; field in class:Scope
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| HeuristicBase.h | 25 /// <li> void addToHeuristicList(Graph::NodeItr) : Add a node to the
28 /// <li> void preUpdateEdgeCosts(Graph::EdgeItr) : Handle the (imminent)
30 /// <li> void postUpdateEdgeCostts(Graph::EdgeItr) : Handle the new
32 /// <li> void handleAddEdge(Graph::EdgeItr) : Handle the addition of a new
33 /// edge into the PBQP graph (by R2).
34 /// <li> void handleRemoveEdge(Graph::EdgeItr, Graph::NodeItr) : Handle the
49 /// node/edge in the PBQP graph.
55 typedef std::list<Graph::NodeItr> OptimalList;
58 Graph &g
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| basic_ops_benchmark_test.cc | 38 static Node* Var(Graph* g, int n) {
39 return test::graph::Var(g, DT_FLOAT, TensorShape({n}));
42 static Node* Zeros(Graph* g, int n) {
45 return test::graph::Constant(g, data);
48 static void MulChain(int chain_length, Graph** init_g, Graph** run_g) {
50 Graph* g = new Graph(OpRegistry::Global());
52 test::graph::Assign(g, var, Zeros(g, 1));
56 Graph* g = new Graph(OpRegistry::Global())
[all...] |
| training_ops_test.cc | 38 static Node* Var(Graph* g, int n) {
39 return test::graph::Var(g, DT_FLOAT, TensorShape({n}));
42 static Node* Zeros(Graph* g, int n) {
45 return test::graph::Constant(g, data);
48 static Node* Random(Graph* g, int n) {
51 return test::graph::Constant(g, data);
54 static Node* Scalar(Graph* g, float val) {
57 return test::graph::Constant(g, data);
60 static void SGD(int32 n, Graph** init_g, Graph** train_g)
[all...] |
| /external/tensorflow/tensorflow/compiler/jit/ |
| graph_to_functiondef.h | 20 #include "tensorflow/core/graph/graph.h"
25 // Converts 'graph' to a FunctionDef 'fdef', with name 'name'.
28 Status GraphToFunctionDef(const Graph& graph, const string& name,
|
| /system/update_engine/payload_generator/ |
| topological_sort.h | 26 // Performs a topological sort on the directed graph 'graph' and stores
28 // For example, this graph:
37 // Note: results are undefined if there is a cycle in the graph.
38 void TopologicalSort(const Graph& graph, std::vector<Vertex::Index>* out);
|
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| 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())
34 // A connected graph.
35 class Graph
72 friend class Graph;
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph;
136 Graph *graph; member in class:nv50_ir::Graph::Node
[all...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 30 import org.antlr.misc.Graph;
39 Graph g = new Graph();
60 Graph g = new Graph();
74 Graph g = new Graph();
88 Graph g = new Graph();
102 Graph g = new Graph()
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| DOTGraphTraitsPass.h | 30 Analysis *Graph;
32 Graph = &getAnalysis<Analysis>();
33 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
35 ViewGraph(Graph, Name, Simple, Title);
57 Analysis *Graph;
63 Graph = &getAnalysis<Analysis>();
66 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
70 WriteGraph(File, Graph, Simple, Title);
|
