Searched refs:nnodes (Results 1 – 5 of 5) sorted by relevance
| /external/jemalloc/test/unit/ |
| D | rb.c | 165 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 …]
|
| D | ph.c | 88 unsigned nnodes = 1; in node_validate() local
98 return (nnodes); in node_validate()
101 nnodes += node_validate(leftmost_child, node); in node_validate()
108 nnodes += node_validate(sibling, node); in node_validate()
110 return (nnodes); in node_validate()
116 unsigned nnodes = 0; in heap_validate() local
122 nnodes += node_validate(heap->ph_root, NULL); in heap_validate()
129 nnodes += node_validate(auxelm, NULL); in heap_validate()
135 return (nnodes); in heap_validate()
|
| /external/fio/t/ |
| D | genzipf.c | 184 static void output_csv(struct node *nodes, unsigned long nnodes) in output_csv() argument
189 for (i = 0; i < nnodes; i++) in output_csv()
193 static void output_normal(struct node *nodes, unsigned long nnodes, in output_normal() argument
197 unsigned long blocks = percentage * nnodes / 100; in output_normal()
203 interval_step = (nnodes - 1) / output_nranges + 1; in output_normal()
214 for (i = 0; i < nnodes; i++) { in output_normal()
220 if (i == (next_interval) -1 || i == nnodes - 1) { in output_normal()
284 unsigned long nnodes; in main() local
340 nnodes = j; in main()
343 output_csv(nodes, nnodes); in main()
[all …]
|
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
| D | LigatureTree.java | 127 Lignode[] nnodes = new Lignode[subnodes.length + 1]; in insert() local
130 System.arraycopy(subnodes, 0, nnodes, 0, i); in insert()
133 nnodes[i] = new Lignode(c); in insert()
136 System.arraycopy(subnodes, i, nnodes, i + 1, subnodes.length - i); in insert()
139 subnodes = nnodes; in insert()
|
| /external/ltp/testcases/kernel/mem/cpuset/ |
| D | cpuset01.c | 62 static int nnodes; variable
77 if (get_allowed_nodes_arr(NH_MEMS | NH_CPUS, &nnodes, &nodes) < 0) in main()
79 if (nnodes <= 1) in main()
105 for (i = 0; i < nnodes; i++) { in testcpuset()
|