Lines Matching refs:nr_nodes
126 int nr_nodes; member
228 int i, nr_nodes = 0; in nr_numa_nodes() local
230 for (i = 0; i < g->p.nr_nodes; i++) { in nr_numa_nodes()
232 nr_nodes++; in nr_numa_nodes()
235 return nr_nodes; in nr_numa_nodes()
340 ret = set_mempolicy(MPOL_DEFAULT, NULL, g->p.nr_nodes-1); in mempol_restore()
694 BUG_ON(step <= 0 || step >= g->p.nr_nodes); in parse_setup_node_list()
707 if (bind_node_0 >= g->p.nr_nodes || bind_node_1 >= g->p.nr_nodes) { in parse_setup_node_list()
708 printf("\nTest not applicable, system has only %d nodes.\n", g->p.nr_nodes); in parse_setup_node_list()
897 node_present = (char *)malloc(g->p.nr_nodes * sizeof(char)); in count_process_nodes()
899 for (nodes = 0; nodes < g->p.nr_nodes; nodes++) in count_process_nodes()
921 for (n = 0; n < g->p.nr_nodes; n++) in count_process_nodes()
1007 nodes = (int *)malloc(g->p.nr_nodes * sizeof(int)); in calc_convergence()
1009 for (node = 0; node < g->p.nr_nodes; node++) in calc_convergence()
1038 for (node = 0; node < g->p.nr_nodes; node++) { in calc_convergence()
1062 for (node = 0; node < g->p.nr_nodes; node++) { in calc_convergence()
1429 g->p.nr_nodes = numa_max_node() + 1; in init()
1432 BUG_ON(g->p.nr_nodes < 0); in init()