| /src/sys/dev/acpi/ |
| acpi_srat.c | 46 static uint32_t nnodes; /* Number of NUMA nodes */ variable in typeref:typename:uint32_t
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...] |
| acpi_srat.c | 46 static uint32_t nnodes; /* Number of NUMA nodes */ variable in typeref:typename:uint32_t
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/common/lib/libc/gen/ |
| radixtree.c | 1470 unsigned int nnodes = 100000; local in function:test2
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...] |
| radixtree.c | 1470 unsigned int nnodes = 100000; local in function:test2
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...] |
