Home
last modified time | relevance | path

Searched refs:sizeof_node (Results 1 – 2 of 2) sorted by relevance

/third_party/glib/glib/
Dgbsearcharray.h50 guint sizeof_node; member
129 size = sizeof (GBSearchArray) + bconfig->sizeof_node; in g_bsearch_array_create()
151 guint sizeof_node = bconfig->sizeof_node; in g_bsearch_array_lookup_fuzzy() local
158 check = nodes + i * sizeof_node; in g_bsearch_array_lookup_fuzzy()
169 …IKELY (!sibling_or_after) ? NULL : (sibling_or_after > 1 && cmp > 0) ? check + sizeof_node : check; in g_bsearch_array_lookup_fuzzy()
177 G_BSEARCH_ARRAY_NODES (barray) + nth * bconfig->sizeof_node : in g_bsearch_array_get_nth()
189 distance /= bconfig->sizeof_node; in g_bsearch_array_get_index()
198 guint old_size = barray->n_nodes * bconfig->sizeof_node; in g_bsearch_array_grow()
199 guint new_size = old_size + bconfig->sizeof_node; in g_bsearch_array_grow()
213 node = G_BSEARCH_ARRAY_NODES (barray) + index_ * bconfig->sizeof_node; in g_bsearch_array_grow()
[all …]
/third_party/boost/libs/container/bench/
Dbench_adaptive_node_pool.cpp140 const size_t sizeof_node = 2*sizeof(void*)+sizeof(int); in list_test_template() local
200 … << float(insert_stats.system_bytes)/(num_iterations*num_elements*sizeof_node)*100.0-100.0 in list_test_template()
204 << (float(insert_inuse)/(num_iterations*num_elements*sizeof_node)*100.0)-100.0 in list_test_template()
219 …< "(" << float(insert_stats.system_bytes)/(num_iterations*num_elements*sizeof_node)*100.0-100.0 <<… in list_test_template()
221 …1024*1024) << "(" << (float(insert_inuse)/(num_iterations*num_elements*sizeof_node)*100.0)-100.0 <… in list_test_template()