| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| graph_optimizer.h | 41 GraphDef* optimized_graph) = 0;
44 // on how well the "optimized_graph" (produced as *optimized_graph from a
47 const GraphDef& optimized_graph, double result) = 0;
|
| loop_optimizer.cc | 33 GraphDef* optimized_graph) {
34 *optimized_graph = item.graph;
40 const GraphDef& /*optimized_graph*/,
|
| meta_optimizer.h | 38 GraphDef* optimized_graph) override;
43 const GraphDef& optimized_graph, double result) override;
62 GraphDef* optimized_graph);
|
| loop_optimizer.h | 37 GraphDef* optimized_graph) override;
40 const GraphDef& optimized_graph, double result) override;
|
| meta_optimizer.cc | 86 GraphDef* optimized_graph) {
140 *optimized_graph = item.graph;
147 Status status = optimizer->Optimize(cluster, item, optimized_graph);
156 "OK. ", PrintSizesBeforeAfter(item.graph, *optimized_graph));
162 GrapplerItem optimized_item(item, std::move(*optimized_graph));
164 optimizer->Optimize(cluster, optimized_item, optimized_graph);
169 optimized_graph->Swap(&optimized_item.graph);
174 PrintSizesBeforeAfter(optimized_item.graph, *optimized_graph));
183 TF_RETURN_IF_ERROR(TopologicalSort(optimized_graph));
185 DCHECK_GE(optimized_graph->library().function_size()
[all...] |
| dependency_optimizer.h | 40 GraphDef* optimized_graph) override;
43 const GraphDef& optimized_graph, double result) override;
|
| loop_optimizer_test.cc | 32 const GraphDef& optimized_graph, const string& func) {
33 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << func;
36 const NodeDef& optimized = optimized_graph.node(i);
|
| arithmetic_optimizer.h | 43 GraphDef* optimized_graph) override;
46 const GraphDef& optimized_graph, double result) override;
78 // Runs peep-hole optimizations on `optimized_graph`, e.g., removing inverse
|
| memory_optimizer.cc | [all...] |
| dependency_optimizer.cc | 549 GraphDef* optimized_graph) {
550 optimized_graph_ = optimized_graph;
584 const GraphDef& /*optimized_graph*/,
|
| dependency_optimizer_test.cc | 35 const GraphDef& optimized_graph, const string& func) {
36 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << func;
39 const NodeDef& optimized = optimized_graph.node(i);
|
| arithmetic_optimizer.cc | [all...] |
| arithmetic_optimizer_test.cc | 36 const GraphDef& optimized_graph, int line) {
37 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << line;
40 const NodeDef& optimized = optimized_graph.node(i);
[all...] |
| /external/tensorflow/tensorflow/core/grappler/costs/ |
| analytical_cost_estimator.h | 57 Status PredictCosts(const GraphDef& optimized_graph, CostGraphDef* cost_graph,
|
| measuring_cost_estimator.h | 61 Status PredictCosts(const GraphDef& optimized_graph, CostGraphDef* cost_graph,
|
| analytical_cost_estimator.cc | 53 Status AnalyticalCostEstimator::PredictCosts(const GraphDef& optimized_graph,
57 item.graph = optimized_graph;
|
| measuring_cost_estimator.cc | 52 Status MeasuringCostEstimator::PredictCosts(const GraphDef& optimized_graph,
66 cluster_->Run(optimized_graph, feed_, fetch_, &metadata);
|
| cost_estimator.h | 176 virtual Status PredictCosts(const GraphDef& optimized_graph,
|
| graph_properties_test.cc | 826 GraphDef optimized_graph; local
[all...] |
| /external/tensorflow/tensorflow/python/grappler/ |
| cost_analyzer_tool.py | 67 optimized_graph = tf_optimizer.OptimizeGraph(rewriter_config, metagraph)
68 metagraph.graph_def.CopyFrom(optimized_graph)
|
| layout_optimizer_test.py | [all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| graph_execution_state.cc | 281 const BuildGraphOptions& options, std::unique_ptr<Graph>* optimized_graph) {
360 optimized_graph->reset(new Graph(OpRegistry::Global()));
362 ConvertGraphDefToGraph(opts, new_graph, optimized_graph->get()));
367 for (Node* node : optimized_graph->get()->nodes()) {
|
| graph_execution_state.h | 181 std::unique_ptr<Graph>* optimized_graph);
|
