Home
last modified time | relevance | path

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

123456

/external/rust/android-crates-io/crates/taffy/src/compute/
Dleaf.rs36 let (node_size, node_min_size, node_max_size, aspect_ratio) = match sizing_mode { in compute_leaf_layout()
38 let node_size = known_dimensions; in compute_leaf_layout() localVariable
41 (node_size, node_min_size, node_max_size, None) in compute_leaf_layout()
57 let node_size = known_dimensions.or(style_size); in compute_leaf_layout() localVariable
58 (node_size, style_min_size, style_max_size, aspect_ratio) in compute_leaf_layout()
82 || matches!(node_size.height, Some(h) if h > 0.0) in compute_leaf_layout()
86 debug_log!("node_size", dbg:node_size); in compute_leaf_layout()
92 if let Size { width: Some(width), height: Some(height) } = node_size { in compute_leaf_layout()
116 .maybe_set(node_size.width) in compute_leaf_layout()
127 .maybe_set(node_size.height) in compute_leaf_layout()
[all …]
/external/sdv/vsomeip/third_party/boost/multi_index/perf/
Dtest_perf.cpp192 size_t node_size(const Container&) in node_size() function
200 size_t node_size(const Container&) in node_size() function
208 size_t node_size(const list<Value,Allocator>&) in node_size() function
214 size_t node_size(const list_wrapper<List>&) in node_size() function
224 size_t node_size(const Container&) in node_size() function
257 static size_t node_size() in node_size() function
259 return ::node_size(Container()); in node_size()
290 static size_t node_size() in node_size() function
292 return ::node_size(Container1())+::node_size(Container2()); in node_size()
327 static size_t node_size() in node_size() function
[all …]
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Ddisable_intra_op_parallelism_test.cc72 EXPECT_EQ(item.graph.node_size(), 7); in TEST_P()
78 EXPECT_EQ(output.node_size(), 7); in TEST_P()
116 EXPECT_EQ(item.graph.node_size(), 5); in TEST_P()
124 EXPECT_EQ(output.node_size(), 5); in TEST_P()
131 EXPECT_EQ(output.node_size(), 5); in TEST_P()
135 EXPECT_EQ(output.node_size(), 7); in TEST_P()
172 EXPECT_EQ(item.graph.node_size(), 6); in TEST()
179 EXPECT_EQ(output.node_size(), 8); in TEST()
Duse_private_thread_pool_test.cc70 EXPECT_EQ(item.graph.node_size(), 7); in TEST_P()
77 EXPECT_EQ(output.node_size(), 7); in TEST_P()
112 EXPECT_EQ(item.graph.node_size(), 5); in TEST_P()
120 EXPECT_EQ(output.node_size(), 5); in TEST_P()
127 EXPECT_EQ(output.node_size(), 5); in TEST_P()
131 EXPECT_EQ(output.node_size(), 7); in TEST_P()
168 EXPECT_EQ(item.graph.node_size(), 6); in TEST()
175 EXPECT_EQ(output.node_size(), 8); in TEST()
Dinject_prefetch_test.cc121 EXPECT_EQ(6, output.node_size()); in TEST()
144 EXPECT_EQ(6, output.node_size()); in TEST()
170 EXPECT_EQ(7, output.node_size()); in TEST()
Dgraph_utils.cc56 for (int i = 0; i < graph.node_size(); ++i) { in CreateNameIndex()
59 std::vector<int> index(graph.node_size()); in CreateNameIndex()
211 if (g1.node_size() != g2.node_size()) { in Compare()
216 for (int i = 0; i < g1.node_size(); ++i) { in Compare()
307 int id = graph->node_size(); in SetUniqueGraphNodeName()
/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()
Dcanonicalizer.cc50 for (int i = 0; i < graph->node_size(); ++i) { in CanonicalizeGraph()
56 for (int i = 0; i < graph->node_size(); ++i) { in CompressConstants()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Ddependency_optimizer_test.cc40 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << func; in VerifyGraphsEqual()
41 for (int i = 0; i < original_graph.node_size(); ++i) { in VerifyGraphsEqual()
94 EXPECT_EQ(5, output.node_size()); in TEST_F()
128 EXPECT_EQ(item.graph.node_size(), output.node_size()); in TEST_F()
130 for (int i = 0; i < item.graph.node_size(); ++i) { in TEST_F()
170 EXPECT_EQ(item.graph.node_size(), output.node_size()); in TEST_F()
172 for (int i = 0; i < item.graph.node_size(); ++i) { in TEST_F()
224 EXPECT_EQ(item.graph.node_size() - 1, output.node_size()); in TEST_F()
225 for (int i = 0; i < output.node_size(); ++i) { in TEST_F()
282 EXPECT_EQ(item.graph.node_size(), output.node_size()); in TEST_F()
[all …]
Dcommon_subgraph_elimination_test.cc39 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << line; in VerifyGraphsMatch()
40 for (int i = 0; i < original_graph.node_size(); ++i) { in VerifyGraphsMatch()
84 EXPECT_EQ(output.node_size(), 2); in TEST_F()
125 EXPECT_EQ(output.node_size(), 6); in TEST_F()
156 EXPECT_EQ(output.node_size(), 4); in TEST_F()
Dauto_mixed_precision_test.cc73 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << func; in VerifyGraphsEquivalent()
75 for (int i = 0; i < original_graph.node_size(); ++i) { in VerifyGraphsEquivalent()
316 EXPECT_EQ(output.node_size(), item.graph.node_size() + 2); in TEST_F()
368 EXPECT_EQ(output.node_size(), item.graph.node_size() + 4); in TEST_F()
413 EXPECT_EQ(output.node_size(), item.graph.node_size() + 3); in TEST_F()
454 EXPECT_EQ(output.node_size(), item.graph.node_size() + 2); in TEST_F()
499 EXPECT_EQ(output.node_size(), item.graph.node_size() + 2); in TEST_F()
542 EXPECT_EQ(output.node_size(), item.graph.node_size() + 5); in TEST_F()
599 EXPECT_EQ(output.node_size(), item.graph.node_size() + 3); in TEST_F()
641 EXPECT_EQ(output.node_size(), item.graph.node_size() + 2); in TEST_F()
[all …]
Dmodel_pruner.cc397 IdentityNTerminalPorts(node_map, terminal_nodes, graph->node_size())) { in SplitIdentityNInputs()
433 pruned_graph->mutable_node()->Reserve(item.graph.node_size()); in Optimize()
462 for (int i = 0; i < pruned_graph->node_size(); ++i) { in Optimize()
512 optimized_graph->mutable_node()->Reserve(pruned_graph->node_size()); in Optimize()
525 << optimized_graph->node_size() << " nodes."; in Optimize()
526 if (optimized_graph->node_size() > item.graph.node_size()) { in Optimize()
Dcommon_subgraph_elimination.cc188 for (int i = 0; i < optimized_graph->node_size(); ++i) { in DedupComputations()
204 std::vector<bool> can_dedup(optimized_graph->node_size()); in DedupComputations()
205 for (int i = 0; i < optimized_graph->node_size(); ++i) { in DedupComputations()
217 for (int i = 0; i < optimized_graph->node_size(); ++i) { in DedupComputations()
Darithmetic_optimizer_test.cc85 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << line; in VerifyGraphsMatch()
86 for (int i = 0; i < original_graph.node_size(); ++i) { in VerifyGraphsMatch()
134 EXPECT_EQ(g.node_size(), 4); in TEST_F()
177 EXPECT_EQ(g.node_size(), 4); in TEST_F()
211 EXPECT_EQ(g.node_size(), 4); in TEST_F()
242 EXPECT_EQ(g.node_size(), 4); in TEST_F()
272 EXPECT_EQ(g.node_size(), 4); in TEST_F()
307 EXPECT_EQ(g.node_size(), 8); in TEST_F()
339 EXPECT_EQ(g.node_size(), 6); in TEST_F()
368 EXPECT_EQ(output.node_size(), 6); in TEST_F()
[all …]
Dstatic_schedule_test.cc98 EXPECT_EQ(item.graph.node_size(), completion_times.size()); in TEST_F()
143 EXPECT_EQ(item.graph.node_size(), completion_times.size()); in TEST_F()
179 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()
245 EXPECT_EQ(7, item.graph.node_size()); in TEST_F()
258 EXPECT_EQ(9, output.node_size()); in TEST_F()
/external/mesa3d/src/util/
Dsparse_array.c40 size_t elem_size, size_t node_size) in util_sparse_array_init() argument
44 arr->node_size_log2 = util_logbase2_64(node_size); in util_sparse_array_init()
45 assert(node_size >= 2 && node_size == (1ull << arr->node_size_log2)); in util_sparse_array_init()
79 size_t node_size = 1ull << arr->node_size_log2; in _util_sparse_array_node_finish() local
80 for (size_t i = 0; i < node_size; i++) { in _util_sparse_array_node_finish()
202 size_t node_size = 1ull << arr->node_size_log2; in validate_node_level() local
203 for (size_t i = 0; i < node_size; i++) { in validate_node_level()
/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/rust/android-crates-io/crates/uefi/src/proto/device_path/
Dbuild.rs105 let node_size = usize::from(node.size_in_bytes()?); in push() localVariable
110 buf.get_mut(*offset..*offset + node_size) in push()
113 *offset += node_size; in push()
118 vec.reserve(node_size); in push()
119 let buf = &mut vec.spare_capacity_mut()[..node_size]; in push()
122 vec.set_len(old_size + node_size); in push()
/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/mesa3d/src/util/tests/
Dsparse_array_test.cpp51 size_t node_size = 4 << (run_idx / 2); in TEST() local
54 util_sparse_array_init(&arr, sizeof(uint32_t), node_size); in TEST()
/external/tensorflow/tensorflow/core/framework/
Dgraph_def_util.cc64 if (node_offset > graph_def->node_size()) { in AddDefaultAttrsToGraphDef()
68 node_offset, " with total nodes in graph: ", graph_def->node_size()); in AddDefaultAttrsToGraphDef()
71 for (int i = node_offset; i < graph_def->node_size(); ++i) { in AddDefaultAttrsToGraphDef()
143 for (int n = 0; n < graph_def->node_size(); ++n) { in RemoveNewDefaultAttrsFromGraphDef()
/external/tensorflow/tensorflow/core/grappler/clusters/
Dsingle_machine.cc385 graph_costs->mutable_node()->Reserve(graph_costs->node_size() + in MergeCosts()
386 init_costs.node_size() + in MergeCosts()
387 queue_costs.node_size()); in MergeCosts()
389 int queue_costs_id_offset = graph_costs->node_size(); in MergeCosts()
397 int init_costs_id_offset = queue_costs_id_offset + queue_costs.node_size(); in MergeCosts()
/external/ltp/testcases/kernel/syscalls/migrate_pages/
Dmigrate_pages02.c50 long long node_size, freep; in print_mem_stats() local
64 node_size = numa_node_size64(node, &freep); in print_mem_stats()
66 node, node_size, freep); in print_mem_stats()

123456