Lines Matching refs:node
37 int child_start; /* Array index of the first child node */
38 int child_end; /* Array index of the last child node */
39 int rover; /* Child node iterator */
43 int start_index; /* Index of first node of a level in a cpuinfo tree */
44 int end_index; /* Index of last node of a level in a cpuinfo tree */
70 * Go to next NUMA node when all cores are used.
136 num_nodes = 1; /* Include the root node */
182 * assumed to be sorted in ascending order based on node, core_id, and
188 struct cpuinfo_node *node;
212 node = &new_tree->nodes[n];
219 node->id = id;
220 node->level = level;
221 node->num_cpus = 1;
223 node->parent_index = (level > CPUINFO_LVL_ROOT)
226 node->child_start = node->child_end = node->rover =
230 prev_id[level] = node->id;
253 node = &new_tree->nodes[level_rover[level]];
254 node->num_cpus = num_cpus[level];
258 node->num_cpus++;
260 /* Connect tree node to parent */
262 node->parent_index = -1;
264 node->parent_index =
268 node->child_end =
271 node->child_end =
275 /* Initialize the next node in the same level */
278 node = &new_tree->nodes[n];
279 node->id = id;
280 node->level = level;
282 /* Connect node to child */
283 node->child_start = node->child_end =
284 node->rover =
300 struct cpuinfo_node *node = &t->nodes[node_index];
304 for (level = node->level; level >= top_level; level--) {
305 node->rover++;
306 if (node->rover <= node->child_end)
309 node->rover = node->child_start;
315 node = &t->nodes[node->parent_index];