/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...] |
collective_order.h | 18 #include "tensorflow/core/graph/graph.h" 27 // the same graph. 29 // control edges between collective graph nodes. If `order_type` is `kAttrs`, 32 Status OrderCollectives(Graph* graph, GraphCollectiveOrder order_type);
|
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);
|
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,
|
/external/tensorflow/tensorflow/compiler/jit/ |
mark_for_compilation_pass_test_helper.h | 24 // Runs the MarkForCompilation pass on `graph` after assigning all nodes in 25 // `graph` to the CPU device. To make testing easier, ignores device 27 static Status MarkForCompilation(std::unique_ptr<Graph>* graph, 32 static Status MarkForCompilation(std::unique_ptr<Graph>* graph,
|
deadness_analysis_internal.h | 20 #include "tensorflow/core/graph/tensor_id.h" 28 Status ComputePredicates(const Graph& graph, PredicateMapTy* out_predicate_map); 31 // testing purposes only. Makes deadness analysis visit the graph in the order 32 // specified in `reverse_post_order` which must be a valid RPO for the graph 34 Status ComputePredicates(const Graph& graph,
|
encapsulate_xla_computations_pass.h | 28 #include "tensorflow/core/graph/graph.h" 49 static Status Encapsulate(std::unique_ptr<Graph>* graph, 55 static Status BuildXlaLaunchOps(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,
|
lower_if_op.h | 25 Status RewriteIfNode(Node* n, Graph* g, const FunctionLibraryDefinition& flib);
|
lower_while_op.h | 26 Status RewriteWhileNode(Node* n, Graph* g,
|
placer.h | 23 #include "tensorflow/core/graph/graph.h" 32 // A placement algorithm that assigns the nodes of the given Graph to 43 // The implementation builds a constraint graph with the same set of 45 // nodes. Each connected component in the resulting constraint graph 54 // placement algorithms so that they may be injected into the graph 58 // A map from graph node names to numerical IDs (in a Graph object). 62 // Graph "graph" (nodes in which may or may not be assigned) on th [all...] |
/external/v8/src/compiler/ |
select-lowering.h | 8 #include "src/compiler/graph-reducer.h" 16 class Graph; 22 SelectLowering(Graph* graph, CommonOperatorBuilder* common); 31 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final 34 Graph* graph_;
|
basic-block-instrumentor.h | 18 class Graph; 24 Graph* graph, Schedule* schedule,
|
/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 154 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/tf2xla/ |
functionalize_while.h | 20 #include "tensorflow/core/graph/graph.h" 28 Graph* graph, FunctionLibraryDefinition* library);
|
side_effect_util.h | 21 #include "tensorflow/core/graph/graph.h" 35 // node has side-effect dependency on current graph's token input. 45 // Calculates side-effect dependencies for the graph's token output. 47 std::set<std::string> CalculateTokenInputsForOutputToken(const Graph& g); 49 // Returns whether a graph contains side-effecting nodes. 50 bool HasSideEffectingNodes(const Graph& g);
|
/external/tensorflow/tensorflow/core/framework/ |
graph_to_functiondef.h | 20 #include "tensorflow/core/graph/graph.h" 25 // Converts 'graph' to a FunctionDef 'fdef', with name 'name'. 27 Status GraphToFunctionDef(const Graph& graph, const string& name,
|
/external/tensorflow/tensorflow/core/kernels/data/ |
single_threaded_executor.h | 24 // Creates a new `Executor` for executing `graph` synchronously on the caller 28 // graphs that perform a small amount of work (e.g. <15us of work per graph on 56 std::unique_ptr<const Graph> graph,
|
/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/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);
|