Lines Matching refs:node
187 struct cpuinfo_node *node; in build_cpuinfo_tree() local
211 node = &new_tree->nodes[n]; in build_cpuinfo_tree()
218 node->id = id; in build_cpuinfo_tree()
219 node->level = level; in build_cpuinfo_tree()
220 node->num_cpus = 1; in build_cpuinfo_tree()
222 node->parent_index = (level > CPUINFO_LVL_ROOT) in build_cpuinfo_tree()
225 node->child_start = node->child_end = node->rover = in build_cpuinfo_tree()
229 prev_id[level] = node->id; in build_cpuinfo_tree()
252 node = &new_tree->nodes[level_rover[level]]; in build_cpuinfo_tree()
253 node->num_cpus = num_cpus[level]; in build_cpuinfo_tree()
257 node->num_cpus++; in build_cpuinfo_tree()
261 node->parent_index = -1; in build_cpuinfo_tree()
263 node->parent_index = in build_cpuinfo_tree()
267 node->child_end = in build_cpuinfo_tree()
270 node->child_end = in build_cpuinfo_tree()
277 node = &new_tree->nodes[n]; in build_cpuinfo_tree()
278 node->id = id; in build_cpuinfo_tree()
279 node->level = level; in build_cpuinfo_tree()
282 node->child_start = node->child_end = in build_cpuinfo_tree()
283 node->rover = in build_cpuinfo_tree()
299 struct cpuinfo_node *node = &t->nodes[node_index]; in increment_rover() local
303 for (level = node->level; level >= top_level; level--) { in increment_rover()
304 node->rover++; in increment_rover()
305 if (node->rover <= node->child_end) in increment_rover()
308 node->rover = node->child_start; in increment_rover()
314 node = &t->nodes[node->parent_index]; in increment_rover()