Home
last modified time | relevance | path

Searched refs:children_count (Results 1 – 5 of 5) sorted by relevance

/haiku/src/system/kernel/
H A Dcpu.cpp214 newNode->children_count = maxID[level - 1]; in cpu_create_topology_node()
223 newNode->children_count = 0; in cpu_create_topology_node()
238 for (int32 i = 0; i < node->children_count; i++) { in cpu_rebuild_topology_tree()
251 node->children_count = count; in cpu_rebuild_topology_tree()
272 sCPUTopology.children_count = maxID[CPU_TOPOLOGY_LEVELS - 1]; in cpu_build_topology_tree()
H A Dsystem_info.cpp416 for (int32 i = 0; i < node->children_count; i++) in count_topology_nodes()
425 ASSERT(node->children_count > 0); in get_logical_processor()
454 for (int32 i = 0; i < node->children_count && count > 0; i++) in generate_topology_array()
H A Dint.cpp422 int levelSize = node->children_count; in assign_cpu()
/haiku/headers/private/kernel/
H A Dcpu.h45 int children_count; member
/haiku/src/system/kernel/scheduler/
H A Dscheduler.cpp636 for (int32 i = 0; i < node->children_count; i++) in traverse_topology_tree()