| /src/external/bsd/mdocml/dist/ |
| tag.c | 45 size_t nnodes; member in struct:tag_entry
187 entry->maxnodes = entry->nnodes = 0;
206 while (entry->nnodes > 0) {
207 nold = entry->nodes[--entry->nnodes];
220 if (entry->maxnodes == entry->nnodes) {
225 entry->nodes[entry->nnodes++] = n;
|
| /src/external/bsd/jemalloc/dist/test/unit/ |
| ph.c | 103 unsigned nnodes = 1; local
113 return nnodes;
117 nnodes += node_validate(leftmost_child, node);
123 nnodes += node_validate(sibling, node);
125 return nnodes;
130 unsigned nnodes = 0; local
137 nnodes += node_validate(heap->ph.root, NULL);
143 nnodes += node_validate(auxelm, NULL);
150 return nnodes;
185 #define NNODES 2
[all...] |
| rb.c | 284 node_remove(tree_t *tree, node_t *node, unsigned nnodes) {
309 expect_u_eq(tree_iterate(tree), nnodes-1,
311 expect_u_eq(tree_iterate_reverse(tree), nnodes-1,
317 unsigned *nnodes = (unsigned *)data; local
320 node_remove(tree, node, *nnodes);
327 unsigned *nnodes = (unsigned *)data; local
330 node_remove(tree, node, *nnodes);
337 unsigned *nnodes = (unsigned *)data; local
339 expect_u_gt(*nnodes, 0, "Destruction removed too many nodes");
340 (*nnodes)--
439 unsigned nnodes = j; local
452 unsigned nnodes = j; local
465 unsigned nnodes = j; local
1004 unsigned nnodes = 0; local
[all...] |
| /src/external/bsd/jemalloc.old/dist/test/unit/ |
| ph.c | 89 unsigned nnodes = 1; local
99 return nnodes;
103 nnodes += node_validate(leftmost_child, node);
110 nnodes += node_validate(sibling, node);
112 return nnodes;
117 unsigned nnodes = 0; local
124 nnodes += node_validate(heap->ph_root, NULL);
131 nnodes += node_validate(auxelm, NULL);
138 return nnodes;
173 #define NNODES 2
[all...] |
| rb.c | 168 node_remove(tree_t *tree, node_t *node, unsigned nnodes) {
193 assert_u_eq(tree_iterate(tree), nnodes-1,
195 assert_u_eq(tree_iterate_reverse(tree), nnodes-1,
201 unsigned *nnodes = (unsigned *)data; local
204 node_remove(tree, node, *nnodes);
211 unsigned *nnodes = (unsigned *)data; local
214 node_remove(tree, node, *nnodes);
221 unsigned *nnodes = (unsigned *)data; local
223 assert_u_gt(*nnodes, 0, "Destruction removed too many nodes");
224 (*nnodes)--
307 unsigned nnodes = j; local
320 unsigned nnodes = j; local
333 unsigned nnodes = j; local
[all...] |
| /src/external/gpl2/mkhybrid/dist/libhfs_iso/ |
| btree.c | 339 unsigned int nnodes; local
342 nnodes = nrecs * (bt->hdr.bthDepth + 1);
344 if (nnodes <= bt->hdr.bthFree)
359 nnodes = space * (bt->f.vol->mdb.drAlBlkSiz / bt->hdr.bthNodeSize);
361 bt->hdr.bthNNodes += nnodes;
362 bt->hdr.bthFree += nnodes;
|
| /src/external/gpl2/lvm2/dist/daemons/clvmd/ |
| clvmd-cman.c | 141 int nnodes = 0; local
146 nnodes++;
148 return nnodes;
|
| /src/sys/dev/acpi/ |
| acpi_srat.c | 46 static uint32_t nnodes; /* Number of NUMA nodes */ variable
368 nnodes = MAX(cnodes, mnodes) + 1;
370 if (nnodes == 0 || nmems == 0 || ncpus == 0) {
375 node_array = kmem_zalloc(nnodes * sizeof(struct acpisrat_node),
396 for (i = 0; i < nnodes; i++) {
451 for (i = 0; i < nnodes; i++) {
459 kmem_free(node_array, nnodes * sizeof(struct acpisrat_node));
471 nnodes = 0;
536 return nnodes;
583 for (i = 0; i < nnodes; i++)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| ipa-cp.cc | 623 int nnodes, stack_top; member in class:ipa_topo_info
628 ipa_topo_info () : order(NULL), stack(NULL), nnodes(0), stack_top(0),
657 topo->nnodes = ipa_reduced_postorder (topo->order, true,
3842 for (i = topo->nnodes - 1; i >= 0; i--)
6245 for (i = topo->nnodes - 1; i >= 0; i--)
|
| ipa-inline.cc | 2785 int nnodes; local
2796 nnodes = ipa_reverse_postorder (order);
2822 for (i = nnodes - 1, j = i; i >= 0; i--)
2834 /* After the above loop, order[j + 1] ... order[nnodes - 1] contain
2841 * XXXMRG: added "nnodes > 1" as -O2 (but not -O) warn:
2844 if (nnodes > 1 && j < nnodes - 2)
2854 for (i = nnodes - 1; i > j; i--)
2871 if (j < nnodes - 2)
|
| passes.cc | 1747 unsigned nnodes = symtab->cgraph_count;
1748 cgraph_node **order = XNEWVEC (cgraph_node *, nnodes);
1750 nnodes = ipa_reverse_postorder (order);
1751 for (i = nnodes - 1; i >= 0; i--)
1762 for (i = nnodes - 1; i >= 0; i--)
1746 unsigned nnodes = symtab->cgraph_count; local
|
| /src/common/lib/libc/gen/ |
| radixtree.c | 1470 unsigned int nnodes = 100000; local
1479 nodes = malloc(nnodes * sizeof(*nodes));
1484 for (i = 0; i < nnodes; i++) {
1492 n->idx %= nnodes * 2;
1512 for (i = 0; i < nnodes; i++) {
1517 printops(title, "lookup", 0, nnodes, &stv, &etv);
1523 for (i = 0; i < nnodes; i++) {
1539 printops(title, "get_tag", tagmask, nnodes, &stv, &etv);
1543 for (i = 0; i < nnodes; i++) {
1548 printops(title, "remove", 0, nnodes, &stv, &etv)
[all...] |
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| Experiment.h | 532 long nnodes; member in class:Experiment
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| Experiment.h | 532 long nnodes; member in class:Experiment
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ipa-inline.cc | 2662 int nnodes; local
2673 nnodes = ipa_reverse_postorder (order);
2699 for (i = nnodes - 1, j = i; i >= 0; i--)
2711 /* After the above loop, order[j + 1] ... order[nnodes - 1] contain
2718 * XXXMRG: added "nnodes > 1" as -O2 (but not -O) warn:
2721 if (nnodes > 1 && j < nnodes - 2)
2731 for (i = nnodes - 1; i > j; i--)
2748 if (j < nnodes - 2)
|
| passes.cc | 1747 unsigned nnodes = symtab->cgraph_count;
1748 cgraph_node **order = XNEWVEC (cgraph_node *, nnodes);
1750 nnodes = ipa_reverse_postorder (order);
1751 for (i = nnodes - 1; i >= 0; i--)
1762 for (i = nnodes - 1; i >= 0; i--)
1746 unsigned nnodes = symtab->cgraph_count; local
|
| ipa-cp.cc | 868 int nnodes, stack_top; member in class:ipa_topo_info
873 ipa_topo_info () : order(NULL), stack(NULL), nnodes(0), stack_top(0),
902 topo->nnodes = ipa_reduced_postorder (topo->order, true,
3833 for (i = topo->nnodes - 1; i >= 0; i--)
6403 for (i = topo->nnodes - 1; i >= 0; i--)
|
