lib/numa/numa.c

47 struct numa_topology numa_topology;
69     err = numa_get_topology_from_skb(&numa_topology);
75     numa_dump_topology(&numa_topology);
84     for (coreid_t i = 0; i < numa_topology.num_cores; ++i) {
85         bitmap_set_bit(numa_all_cpus_ptr, numa_topology.cores[i]->id);
98     for (nodeid_t i = 0; i < numa_topology.num_nodes; ++i) {
99         bitmap_set_bit(numa_all_nodes_ptr, numa_topology.nodes[i].id);
141     numa_free_topology(&numa_topology);
157     return numa_topology.num_nodes - 1;
170     return numa_topology.num_cores - 1;
183     return numa_topology.cores[disp_get_current_core_id()]->node->id;
211     return numa_topology.num_nodes;
243     return numa_topology.num_cores;
256     return numa_topology.num_cores;
270     return numa_topology.num_nodes;
294     return (numa_topology.nodes[node].mem_limit - numa_topology.nodes[node].mem_base);
308     return numa_topology.nodes[node].mem_base;
336     if (node >= numa_topology.num_nodes) {
338                      PRIuNODEID, node, numa_topology.num_nodes);
342     numa_topology.preferred = node;
408         numa_topology.bind = strict;
410         numa_topology.bind = NUMA_POLICY_PREFERRED;
429         numa_topology.strict = strict;
431         numa_topology.strict = NUMA_POLICY_PREFERRED;
451     if (from >= numa_topology.num_nodes || to >= numa_topology.num_nodes) {
455     return numa_topology.distances[from * numa_topology.num_nodes + to];
504     return numa_topology.pagesize;
525     if (!(node < numa_topology.num_nodes)) {
529     if (bitmap_get_nbits(mask) < numa_topology.num_cores) {
535     struct numa_node *nnode = &numa_topology.nodes[node];
562     return numa_topology.cores[cpu]->node->id;
575     if (node >= numa_topology.num_nodes) {
577                       PRIuNODEID, node, numa_topology.num_nodes);
581     return numa_topology.nodes[node].num_cores;