| /external/jemalloc_new/test/unit/ |
| D | rb.c | 168 node_remove(tree_t *tree, node_t *node, unsigned nnodes) { in node_remove() argument
193 assert_u_eq(tree_iterate(tree), nnodes-1, in node_remove()
195 assert_u_eq(tree_iterate_reverse(tree), nnodes-1, in node_remove()
201 unsigned *nnodes = (unsigned *)data; in remove_iterate_cb() local
204 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()
221 unsigned *nnodes = (unsigned *)data; in destroy_cb() local
223 assert_u_gt(*nnodes, 0, "Destruction removed too many nodes"); in destroy_cb()
224 (*nnodes)--; in destroy_cb()
[all …]
|
| D | ph.c | 89 unsigned nnodes = 1; in node_validate() local
99 return nnodes; in node_validate()
103 nnodes += node_validate(leftmost_child, node); in node_validate()
110 nnodes += node_validate(sibling, node); in node_validate()
112 return nnodes; in node_validate()
117 unsigned nnodes = 0; in heap_validate() local
124 nnodes += node_validate(heap->ph_root, NULL); in heap_validate()
131 nnodes += node_validate(auxelm, NULL); in heap_validate()
138 return nnodes; in heap_validate()
|
| /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/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 | 40 static int nnodes; variable
62 for (i = 0; i < nnodes; i++) { in test_cpuset()
90 if (get_allowed_nodes_arr(NH_MEMS | NH_CPUS, &nnodes, &nodes) < 0) in setup()
92 if (nnodes <= 1) in setup()
|
| /external/adhd/cras/src/server/ |
| D | cras_dbus_control.c | 533 int ndevs, nnodes; in append_nodes() local
538 nnodes = cras_system_state_get_output_nodes(&nodes); in append_nodes()
541 nnodes = cras_system_state_get_input_nodes(&nodes); in append_nodes()
544 for (i = 0; i < nnodes; i++) { in append_nodes()
|
| /external/adhd/cras/src/libcras/ |
| D | cras_client.c | 2906 size_t ndevs, nnodes; in cras_client_find_output_node() local
2926 nnodes = CRAS_MAX_IONODES; in cras_client_find_output_node()
2928 &nnodes); in cras_client_find_output_node()
2939 for (j = 0; j < nnodes; j++) in cras_client_find_output_node()
2962 size_t ndevs, nnodes; in cras_client_get_node_by_id() local
2988 nnodes = CRAS_MAX_IONODES; in cras_client_get_node_by_id()
2991 &ndevs, &nnodes); in cras_client_get_node_by_id()
2994 &ndevs, &nnodes); in cras_client_get_node_by_id()
2999 for (i = 0; i < nnodes; i++) { in cras_client_get_node_by_id()
|
| /external/arm-optimized-routines/auxiliary/ |
| D | remez.jl | 820 nnodes = 16 * (n+d+1)
822 grid = [ mid - halfwid * cos(pi*i/nnodes) for i=0:1:nnodes ]
|