Home
last modified time | relevance | path

Searched refs:node_size (Results 1 – 25 of 94) sorted by relevance

1234

/external/tensorflow/tensorflow/core/kernels/
Dremote_fused_graph_execute_utils_test.cc454 EXPECT_EQ(def.node_size(), execute_info0.remote_graph().node_size()); in TEST()
557 EXPECT_EQ(3, subgraph_def.node_size()); in TEST()
566 EXPECT_EQ(6, subgraph_def.node_size()); in TEST()
575 EXPECT_EQ(10, subgraph_def.node_size()); in TEST()
585 EXPECT_EQ(11, subgraph_def.node_size()); in TEST()
593 EXPECT_EQ(3, subgraph_def.node_size()); in TEST()
602 EXPECT_EQ(11, graph_def_.node_size()); in TEST_F()
603 EXPECT_EQ(11, result_graph_def_.node_size()) in TEST_F()
615 EXPECT_EQ(11, graph_def_.node_size()); in TEST_F()
616 EXPECT_EQ(9, result_graph_def_.node_size()) in TEST_F()
[all …]
/external/tensorflow/tensorflow/core/grappler/optimizers/
Ddependency_optimizer_test.cc38 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << func; in VerifyGraphsEqual()
39 for (int i = 0; i < original_graph.node_size(); ++i) { in VerifyGraphsEqual()
92 EXPECT_EQ(5, output.node_size()); in TEST_F()
126 EXPECT_EQ(item.graph.node_size(), output.node_size()); in TEST_F()
128 for (int i = 0; i < item.graph.node_size(); ++i) { in TEST_F()
169 EXPECT_EQ(item.graph.node_size(), output.node_size()); in TEST_F()
171 for (int i = 0; i < item.graph.node_size(); ++i) { in TEST_F()
223 EXPECT_EQ(item.graph.node_size() - 1, output.node_size()); in TEST_F()
224 for (int i = 0; i < output.node_size(); ++i) { in TEST_F()
281 EXPECT_EQ(item.graph.node_size(), output.node_size()); in TEST_F()
[all …]
Dmodel_pruner_test.cc46 EXPECT_EQ(item.graph.node_size(), output.node_size()); in TEST_F()
47 for (int i = 0; i < item.graph.node_size(); ++i) { in TEST_F()
77 EXPECT_EQ(5, output.node_size()); in TEST_F()
120 EXPECT_EQ(5, output.node_size()); in TEST_F()
169 EXPECT_EQ(7, output.node_size()); in TEST_F()
228 EXPECT_EQ(5, output.node_size()); in TEST_F()
272 EXPECT_EQ(5, output.node_size()); in TEST_F()
326 EXPECT_EQ(item.graph.node_size(), output.node_size()); in TEST_F()
361 ASSERT_EQ(5, output.node_size()); in TEST_F()
456 EXPECT_EQ(3, output.node_size()); in TEST_F()
Darithmetic_optimizer_test.cc76 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << line; in VerifyGraphsMatch()
77 for (int i = 0; i < original_graph.node_size(); ++i) { in VerifyGraphsMatch()
119 EXPECT_EQ(2, output.node_size()); in TEST_F()
160 EXPECT_EQ(5, output.node_size()); in TEST_F()
192 EXPECT_EQ(4, output.node_size()); in TEST_F()
231 EXPECT_EQ(4, output.node_size()); in TEST_F()
269 EXPECT_EQ(2, output.node_size()); in TEST_F()
302 EXPECT_EQ(3, output.node_size()); in TEST_F()
373 EXPECT_EQ(5, output.node_size()); in TEST_F()
417 EXPECT_EQ(6, output.node_size()); in TEST_F()
[all …]
Dmeta_optimizer.cc66 return strings::StrCat("Graph size after: ", after.node_size(), " nodes (", in PrintSizesBeforeAfter()
67 after.node_size() - before.node_size(), "), ", in PrintSizesBeforeAfter()
107 for (int i = 0; i < graph->node_size(); ++i) { in CompressConstants()
327 if (item.graph.node_size() < min_graph_nodes) { in OptimizeGraph()
360 << ", num nodes = " << item.graph.node_size(); in OptimizeGraph()
380 if (optimized_graph->node_size() < min_graph_nodes) { in OptimizeGraph()
382 << ", graph is tiny (#nodes = " << optimized_graph->node_size() in OptimizeGraph()
Dstatic_schedule_test.cc61 EXPECT_EQ(item.graph.node_size(), completion_times.size()); in TEST_F()
107 EXPECT_EQ(item.graph.node_size(), completion_times.size()); in TEST_F()
141 EXPECT_EQ(item.graph.node_size(), required_times.size()); in TEST_F()
Dmemory_optimizer_test.cc54 EXPECT_EQ(6, item.graph.node_size()); in TEST_F()
65 EXPECT_EQ(8, output.node_size()); in TEST_F()
94 EXPECT_EQ(6, item.graph.node_size()); in TEST_F()
104 EXPECT_EQ(6, output.node_size()); in TEST_F()
117 EXPECT_EQ(3, item.graph.node_size()); in TEST_F()
132 EXPECT_EQ(7, output.node_size()); in TEST_F()
157 EXPECT_EQ(9, item.graph.node_size()); in TEST_F()
171 EXPECT_EQ(13, first_pass_output.node_size()); in TEST_F()
244 EXPECT_EQ(7, item.graph.node_size()); in TEST_F()
257 EXPECT_EQ(9, output.node_size()); in TEST_F()
Dimplementation_selector_test.cc57 EXPECT_EQ(item.graph.node_size(), output.node_size()); in TEST_F()
86 EXPECT_EQ(output.node_size(), 5); in TEST_F()
Ddependency_optimizer.cc438 for (int i = 0; i < optimized_graph_->node_size(); ++i) { in CleanControlInputs()
446 for (int i = 0; i < optimized_graph_->node_size(); ++i) { in OptimizeDependencies()
464 << optimized_graph_->node_size() << " nodes."; in OptimizeDependencies()
474 const int num_nodes = optimized_graph_->node_size(); in TransitiveReduction()
583 for (int i = 0; i < optimized_graph_->node_size(); ++i) { in BuildNodeToIdx()
597 const int num_nodes = optimized_graph_->node_size(); in GroupCrossDeviceControlEdges()
Dmodel_pruner.cc379 IdentityNTerminalPorts(node_map, terminal_nodes, graph->node_size())) { in SplitIdentityNInputs()
498 pruned_graph->mutable_node()->Reserve(runnable_item.graph.node_size()); in Optimize()
512 << pruned_graph->node_size() << " nodes."; in Optimize()
513 CHECK_LE(pruned_graph->node_size(), item.graph.node_size()); in Optimize()
Dauto_parallel.cc81 LOG(INFO) << "Original graph size: " << graph_.node_size(); in Initialize()
113 for (int i = 0; i < graph_.node_size(); i++) { in Initialize()
260 LOG(INFO) << "Parallelized graph size: " << graph->node_size(); in BuildGraph()
Dremapper_test.cc134 for (int i = 0; i < item.graph.node_size(); ++i) { in TEST_F()
198 for (int i = 0; i < item.graph.node_size(); ++i) { in TEST_F()
273 for (int i = 0; i < item.graph.node_size(); ++i) { in TEST_F()
351 for (int i = 0; i < item.graph.node_size(); ++i) { in TEST_F()
423 for (int i = 0; i < item.graph.node_size(); ++i) { in TEST_F()
/external/tensorflow/tensorflow/core/grappler/utils/
Dcolocation_test.cc51 EXPECT_EQ(1, gdef.node_size()); in TEST()
57 EXPECT_EQ(1, gdef.node_size()); in TEST()
93 EXPECT_EQ(5, gdef.node_size()); in TEST()
102 EXPECT_EQ(5, gdef.node_size()); in TEST()
161 EXPECT_EQ(7, gdef.node_size()); in TEST()
172 EXPECT_EQ(7, gdef.node_size()); in TEST()
Dtopological_sort.cc58 std::vector<int> num_ready_inputs(graph.node_size(), 0); in ComputeTopologicalOrder()
61 ready_nodes->reserve(graph.node_size()); in ComputeTopologicalOrder()
66 for (int i = 0; i < graph.node_size(); i++) { in ComputeTopologicalOrder()
Dfunctions_test.cc252 EXPECT_EQ(5, item.function_body().node_size()); in TEST_F()
334 EXPECT_EQ(14, item.function_body().node_size()); in TEST_F()
537 EXPECT_EQ(8, item.function_body().node_size()); in TEST_F()
604 EXPECT_EQ(3, item.function_body().node_size()); in TEST_F()
641 EXPECT_EQ(3, item.function_body().node_size()); in TEST_F()
668 EXPECT_EQ(3, item.function_body().node_size()); in TEST_F()
751 ASSERT_EQ(4, item.function_body().node_size()); in TEST_F()
/external/tensorflow/tensorflow/core/grappler/graph_analyzer/
Dgraph_analyzer_tool.cc64 << metagraph.graph_def().node_size() - graph->node_size() in MaybePruneGraph()
66 << metagraph.graph_def().node_size() in MaybePruneGraph()
67 << ". New graph size: " << graph->node_size() << "."; in MaybePruneGraph()
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dgraph_utils.cc46 for (int i = 0; i < graph.node_size(); ++i) { in CreateNameIndex()
49 std::vector<int> index(graph.node_size()); in CreateNameIndex()
161 if (g1.node_size() != g2.node_size()) { in Compare()
166 for (int i = 0; i < g1.node_size(); ++i) { in Compare()
245 int id = graph->node_size(); in SetUniqueGraphNodeName()
313 for (int i = 0; i < graph_def.node_size(); ++i) { in FindSinkNode()
/external/tensorflow/tensorflow/core/grappler/
Dmutable_graph_view_test.cc90 EXPECT_EQ(mutable_graph.graph()->node_size(), in CheckGraph()
91 immutable_graph.graph()->node_size()); in CheckGraph()
860 EXPECT_EQ(graph.graph()->node_size(), 5); in TEST()
882 EXPECT_EQ(graph.graph()->node_size(), 5); in TEST()
1699 EXPECT_EQ(graph.graph()->node_size(), 3); in TestUpdateFaninFromFaninToNodeAsSwitchControl()
2119 EXPECT_EQ(graph.graph()->node_size(), 11); in TEST()
2416 ASSERT_EQ(graph.graph()->node_size(), 2); in TEST()
2434 ASSERT_EQ(graph.graph()->node_size(), 2); in TEST()
2452 ASSERT_EQ(graph.graph()->node_size(), 2); in TEST()
2474 ASSERT_EQ(graph.graph()->node_size(), 2); in TEST()
[all …]
/external/tensorflow/tensorflow/core/framework/
Dgraph_def_util.cc63 if (node_offset > graph_def->node_size()) { in AddDefaultAttrsToGraphDef()
67 node_offset, " with total nodes in graph: ", graph_def->node_size()); in AddDefaultAttrsToGraphDef()
70 for (int i = node_offset; i < graph_def->node_size(); ++i) { in AddDefaultAttrsToGraphDef()
142 for (int n = 0; n < graph_def->node_size(); ++n) { in RemoveNewDefaultAttrsFromGraphDef()
/external/tensorflow/tensorflow/core/grappler/clusters/
Dsingle_machine.cc386 graph_costs->mutable_node()->Reserve(graph_costs->node_size() + in MergeCosts()
387 init_costs.node_size() + in MergeCosts()
388 queue_costs.node_size()); in MergeCosts()
390 int queue_costs_id_offset = graph_costs->node_size(); in MergeCosts()
398 int init_costs_id_offset = queue_costs_id_offset + queue_costs.node_size(); in MergeCosts()
/external/u-boot/arch/arm/include/asm/
Dmemory.h100 ((pfn - (nd->node_start_paddr >> PAGE_SHIFT)) < nd->node_size));\
124 ((unsigned)((page) - NODE_MEM_MAP(node)) < NODE_DATA(node)->node_size)); \
/external/ltp/testcases/kernel/syscalls/migrate_pages/
Dmigrate_pages02.c74 long long node_size, freep; in print_mem_stats() local
88 node_size = numa_node_size64(node, &freep); in print_mem_stats()
90 node, node_size, freep); in print_mem_stats()
/external/tensorflow/tensorflow/python/grappler/
Dcost_analyzer.cc65 VLOG(1) << "Graph size: " << item_->graph.node_size(); in GatherCosts()
66 VLOG(1) << "cost_graph_measured size: " << cost_graph_measured.node_size(); in GatherCosts()
72 << cost_graph_analytical.node_size(); in GatherCosts()
93 << cost_graph_analytical_filtered.node_size(); in GatherCosts()
/external/toybox/toys/posix/
Ddu.c47 typedef struct node_size { struct
50 } node_size; argument
/external/tensorflow/tensorflow/contrib/hvx/hvx_ops_support_checker/
Dhvx_ops_support_checker_main.cc104 const int subgraph_node_size = info.remote_graph().node_size(); in DumpRemoteFusedGraph()
116 LOG(INFO) << "Checking " << graph_def.node_size() << " nodes"; in CheckOpsSupport()

1234