Lines Matching full:node
57 * Retrieves the ibm,associativity array of NUMA node 'node_id'
69 * Wrapper that returns node distance from ms->numa_state->nodes
82 * In case QEMU adds a default NUMA single node when the user in get_numa_distance()
152 * considered a match with associativity domains of node 0. in spapr_numa_define_FORM1_domains()
170 * ascending order, starting from node id 0 (the first node in spapr_numa_define_FORM1_domains()
172 * the algorithm because the associativity domains that node 0 in spapr_numa_define_FORM1_domains()
173 * defines will be carried over to other nodes, and node 1 in spapr_numa_define_FORM1_domains()
174 * associativities will be carried over after taking node 0 in spapr_numa_define_FORM1_domains()
179 * The PPC kernel expects the associativity domains of node 0 to in spapr_numa_define_FORM1_domains()
221 * Check we don't have a memory-less/cpu-less NUMA node in spapr_numa_FORM1_affinity_check()
229 /* check for memory-less node */ in spapr_numa_FORM1_affinity_check()
233 /* check for cpu-less node */ in spapr_numa_FORM1_affinity_check()
241 /* memory-less and cpu-less node */ in spapr_numa_FORM1_affinity_check()
244 "Memory-less/cpu-less nodes are not supported with FORM1 NUMA (node %d)", i); in spapr_numa_FORM1_affinity_check()
298 * Same thing with guests that have only one NUMA node. in spapr_numa_FORM1_affinity_init()
514 * ibm,numa-distance-table: contains all node distances. First in spapr_numa_FORM2_write_rtas_tables()
516 * by all the uint8 distances from the first NUMA node, then all in spapr_numa_FORM2_write_rtas_tables()
517 * distances from the second NUMA node and so on. in spapr_numa_FORM2_write_rtas_tables()
520 * array because NUMA ids can be sparse (node 0 is the first, in spapr_numa_FORM2_write_rtas_tables()
521 * node 8 is the second ...). in spapr_numa_FORM2_write_rtas_tables()
560 * to retrieve all other attributes of the node (distance, in spapr_numa_FORM2_write_rtas_dt()
657 /* Virtual Processor Home Node */ in spapr_numa_register_types()