Home
last modified time | relevance | path

Searched refs:nnodes (Results 1 – 4 of 4) sorted by relevance

/external/jemalloc/test/unit/
Drb.c165 node_remove(tree_t *tree, node_t *node, unsigned nnodes) in node_remove() argument
191 assert_u_eq(tree_iterate(tree), nnodes-1, in node_remove()
193 assert_u_eq(tree_iterate_reverse(tree), nnodes-1, in node_remove()
200 unsigned *nnodes = (unsigned *)data; in remove_iterate_cb() local
203 node_remove(tree, node, *nnodes); in remove_iterate_cb()
211 unsigned *nnodes = (unsigned *)data; in remove_reverse_iterate_cb() local
214 node_remove(tree, node, *nnodes); in remove_reverse_iterate_cb()
222 unsigned *nnodes = (unsigned *)data; in destroy_cb() local
224 assert_u_gt(*nnodes, 0, "Destruction removed too many nodes"); in destroy_cb()
225 (*nnodes)--; in destroy_cb()
[all …]
/external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/
DLigatureTree.java125 Lignode[] nnodes = new Lignode[subnodes.length + 1]; in insert() local
128 System.arraycopy(subnodes, 0, nnodes, 0, i); in insert()
131 nnodes[i] = new Lignode(c); in insert()
134 System.arraycopy(subnodes, i, nnodes, i + 1, subnodes.length - i); in insert()
137 subnodes = nnodes; in insert()
/external/fio/t/
Dgenzipf.c174 unsigned long i, j, k, nr_vals, cur_vals, interval, total_vals, nnodes; in main() local
228 nnodes = j; in main()
229 nr_vals = nnodes; in main()
233 for (k = 0; k < nnodes; k++) in main()
246 for (k = 0; k < nnodes; k++) { in main()
/external/opencv3/modules/objdetect/src/
Dcascadedetect_convert.cpp148 int nnodes = (int)weaknode.size(); in convert() local
150 for( n = 0; n < nnodes; n++ ) in convert()
229 int nnodes = (int)c.nodes.size(), nleaves = (int)c.leaves.size(); in convert() local
230 for( k = 0; k < nnodes; k++ ) in convert()