/external/jemalloc/test/unit/ |
rb.c | 159 node_remove(tree_t *tree, node_t *node, unsigned nnodes) 186 assert_u_eq(tree_iterate(tree), nnodes-1, 188 assert_u_eq(tree_iterate_reverse(tree), nnodes-1, 195 unsigned *nnodes = (unsigned *)data; local 198 node_remove(tree, node, *nnodes); 206 unsigned *nnodes = (unsigned *)data; local 209 node_remove(tree, node, *nnodes); 216 #define NNODES 25 220 uint64_t bag[NNODES]; 222 node_t nodes[NNODES]; 289 unsigned nnodes = j; local 302 unsigned nnodes = j; local [all...] |
/external/fio/t/ |
genzipf.c | 174 unsigned long i, j, k, nr_vals, cur_vals, interval, total_vals, nnodes; local 228 nnodes = j; 229 nr_vals = nnodes; 233 for (k = 0; k < nnodes; k++) 246 for (k = 0; k < nnodes; k++) {
|
/external/srec/srec/clib/ |
srec_arb.c | 371 unsigned short nnodes; member in struct:__anon34805 387 if (tree_topo->nnodes > 255) 390 tree_topo->nnodes++; 423 topo.nnodes = 0; 425 return topo.nnodes; 450 topo.nnodes = 0; 454 if (topo.nnodes == 256) return 0;
|
/external/srec/tools/test_g2g/ |
test_g2g.c | 48 unsigned short nnodes; member in struct:__anon34900 349 tree_topo->nnodes++; 370 topo.nnodes = 0; 372 return topo.nnodes;
|