|
@@ -55,7 +55,6 @@ static int have_mem;
|
|
static int max_numa_nodeid; /* Highest specified NUMA node ID, plus one.
|
|
static int max_numa_nodeid; /* Highest specified NUMA node ID, plus one.
|
|
* For all nodes, nodeid < max_numa_nodeid
|
|
* For all nodes, nodeid < max_numa_nodeid
|
|
*/
|
|
*/
|
|
-int nb_numa_nodes;
|
|
|
|
bool have_numa_distance;
|
|
bool have_numa_distance;
|
|
NodeInfo numa_info[MAX_NODES];
|
|
NodeInfo numa_info[MAX_NODES];
|
|
|
|
|
|
@@ -72,7 +71,7 @@ static void parse_numa_node(MachineState *ms, NumaNodeOptions *node,
|
|
if (node->has_nodeid) {
|
|
if (node->has_nodeid) {
|
|
nodenr = node->nodeid;
|
|
nodenr = node->nodeid;
|
|
} else {
|
|
} else {
|
|
- nodenr = nb_numa_nodes;
|
|
|
|
|
|
+ nodenr = ms->numa_state->num_nodes;
|
|
}
|
|
}
|
|
|
|
|
|
if (nodenr >= MAX_NODES) {
|
|
if (nodenr >= MAX_NODES) {
|
|
@@ -138,10 +137,11 @@ static void parse_numa_node(MachineState *ms, NumaNodeOptions *node,
|
|
}
|
|
}
|
|
numa_info[nodenr].present = true;
|
|
numa_info[nodenr].present = true;
|
|
max_numa_nodeid = MAX(max_numa_nodeid, nodenr + 1);
|
|
max_numa_nodeid = MAX(max_numa_nodeid, nodenr + 1);
|
|
- nb_numa_nodes++;
|
|
|
|
|
|
+ ms->numa_state->num_nodes++;
|
|
}
|
|
}
|
|
|
|
|
|
-static void parse_numa_distance(NumaDistOptions *dist, Error **errp)
|
|
|
|
|
|
+static
|
|
|
|
+void parse_numa_distance(MachineState *ms, NumaDistOptions *dist, Error **errp)
|
|
{
|
|
{
|
|
uint16_t src = dist->src;
|
|
uint16_t src = dist->src;
|
|
uint16_t dst = dist->dst;
|
|
uint16_t dst = dist->dst;
|
|
@@ -179,6 +179,12 @@ static void parse_numa_distance(NumaDistOptions *dist, Error **errp)
|
|
void set_numa_options(MachineState *ms, NumaOptions *object, Error **errp)
|
|
void set_numa_options(MachineState *ms, NumaOptions *object, Error **errp)
|
|
{
|
|
{
|
|
Error *err = NULL;
|
|
Error *err = NULL;
|
|
|
|
+ MachineClass *mc = MACHINE_GET_CLASS(ms);
|
|
|
|
+
|
|
|
|
+ if (!mc->numa_mem_supported) {
|
|
|
|
+ error_setg(errp, "NUMA is not supported by this machine-type");
|
|
|
|
+ goto end;
|
|
|
|
+ }
|
|
|
|
|
|
switch (object->type) {
|
|
switch (object->type) {
|
|
case NUMA_OPTIONS_TYPE_NODE:
|
|
case NUMA_OPTIONS_TYPE_NODE:
|
|
@@ -188,7 +194,7 @@ void set_numa_options(MachineState *ms, NumaOptions *object, Error **errp)
|
|
}
|
|
}
|
|
break;
|
|
break;
|
|
case NUMA_OPTIONS_TYPE_DIST:
|
|
case NUMA_OPTIONS_TYPE_DIST:
|
|
- parse_numa_distance(&object->u.dist, &err);
|
|
|
|
|
|
+ parse_numa_distance(ms, &object->u.dist, &err);
|
|
if (err) {
|
|
if (err) {
|
|
goto end;
|
|
goto end;
|
|
}
|
|
}
|
|
@@ -253,10 +259,11 @@ end:
|
|
* distance from a node to itself is always NUMA_DISTANCE_MIN,
|
|
* distance from a node to itself is always NUMA_DISTANCE_MIN,
|
|
* so providing it is never necessary.
|
|
* so providing it is never necessary.
|
|
*/
|
|
*/
|
|
-static void validate_numa_distance(void)
|
|
|
|
|
|
+static void validate_numa_distance(MachineState *ms)
|
|
{
|
|
{
|
|
int src, dst;
|
|
int src, dst;
|
|
bool is_asymmetrical = false;
|
|
bool is_asymmetrical = false;
|
|
|
|
+ int nb_numa_nodes = ms->numa_state->num_nodes;
|
|
|
|
|
|
for (src = 0; src < nb_numa_nodes; src++) {
|
|
for (src = 0; src < nb_numa_nodes; src++) {
|
|
for (dst = src; dst < nb_numa_nodes; dst++) {
|
|
for (dst = src; dst < nb_numa_nodes; dst++) {
|
|
@@ -294,7 +301,7 @@ static void validate_numa_distance(void)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
-static void complete_init_numa_distance(void)
|
|
|
|
|
|
+static void complete_init_numa_distance(MachineState *ms)
|
|
{
|
|
{
|
|
int src, dst;
|
|
int src, dst;
|
|
|
|
|
|
@@ -303,8 +310,8 @@ static void complete_init_numa_distance(void)
|
|
* there would not be any missing distance except local node, which
|
|
* there would not be any missing distance except local node, which
|
|
* is verified by validate_numa_distance above.
|
|
* is verified by validate_numa_distance above.
|
|
*/
|
|
*/
|
|
- for (src = 0; src < nb_numa_nodes; src++) {
|
|
|
|
- for (dst = 0; dst < nb_numa_nodes; dst++) {
|
|
|
|
|
|
+ for (src = 0; src < ms->numa_state->num_nodes; src++) {
|
|
|
|
+ for (dst = 0; dst < ms->numa_state->num_nodes; dst++) {
|
|
if (numa_info[src].distance[dst] == 0) {
|
|
if (numa_info[src].distance[dst] == 0) {
|
|
if (src == dst) {
|
|
if (src == dst) {
|
|
numa_info[src].distance[dst] = NUMA_DISTANCE_MIN;
|
|
numa_info[src].distance[dst] = NUMA_DISTANCE_MIN;
|
|
@@ -370,7 +377,7 @@ void numa_complete_configuration(MachineState *ms)
|
|
*
|
|
*
|
|
* Enable NUMA implicitly by adding a new NUMA node automatically.
|
|
* Enable NUMA implicitly by adding a new NUMA node automatically.
|
|
*/
|
|
*/
|
|
- if (ms->ram_slots > 0 && nb_numa_nodes == 0 &&
|
|
|
|
|
|
+ if (ms->ram_slots > 0 && ms->numa_state->num_nodes == 0 &&
|
|
mc->auto_enable_numa_with_memhp) {
|
|
mc->auto_enable_numa_with_memhp) {
|
|
NumaNodeOptions node = { };
|
|
NumaNodeOptions node = { };
|
|
parse_numa_node(ms, &node, &error_abort);
|
|
parse_numa_node(ms, &node, &error_abort);
|
|
@@ -388,26 +395,27 @@ void numa_complete_configuration(MachineState *ms)
|
|
}
|
|
}
|
|
|
|
|
|
/* This must be always true if all nodes are present: */
|
|
/* This must be always true if all nodes are present: */
|
|
- assert(nb_numa_nodes == max_numa_nodeid);
|
|
|
|
|
|
+ assert(ms->numa_state->num_nodes == max_numa_nodeid);
|
|
|
|
|
|
- if (nb_numa_nodes > 0) {
|
|
|
|
|
|
+ if (ms->numa_state->num_nodes > 0) {
|
|
uint64_t numa_total;
|
|
uint64_t numa_total;
|
|
|
|
|
|
- if (nb_numa_nodes > MAX_NODES) {
|
|
|
|
- nb_numa_nodes = MAX_NODES;
|
|
|
|
|
|
+ if (ms->numa_state->num_nodes > MAX_NODES) {
|
|
|
|
+ ms->numa_state->num_nodes = MAX_NODES;
|
|
}
|
|
}
|
|
|
|
|
|
/* If no memory size is given for any node, assume the default case
|
|
/* If no memory size is given for any node, assume the default case
|
|
* and distribute the available memory equally across all nodes
|
|
* and distribute the available memory equally across all nodes
|
|
*/
|
|
*/
|
|
- for (i = 0; i < nb_numa_nodes; i++) {
|
|
|
|
|
|
+ for (i = 0; i < ms->numa_state->num_nodes; i++) {
|
|
if (numa_info[i].node_mem != 0) {
|
|
if (numa_info[i].node_mem != 0) {
|
|
break;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
- if (i == nb_numa_nodes) {
|
|
|
|
|
|
+ if (i == ms->numa_state->num_nodes) {
|
|
assert(mc->numa_auto_assign_ram);
|
|
assert(mc->numa_auto_assign_ram);
|
|
- mc->numa_auto_assign_ram(mc, numa_info, nb_numa_nodes, ram_size);
|
|
|
|
|
|
+ mc->numa_auto_assign_ram(mc, numa_info,
|
|
|
|
+ ms->numa_state->num_nodes, ram_size);
|
|
if (!qtest_enabled()) {
|
|
if (!qtest_enabled()) {
|
|
warn_report("Default splitting of RAM between nodes is deprecated,"
|
|
warn_report("Default splitting of RAM between nodes is deprecated,"
|
|
" Use '-numa node,memdev' to explictly define RAM"
|
|
" Use '-numa node,memdev' to explictly define RAM"
|
|
@@ -416,7 +424,7 @@ void numa_complete_configuration(MachineState *ms)
|
|
}
|
|
}
|
|
|
|
|
|
numa_total = 0;
|
|
numa_total = 0;
|
|
- for (i = 0; i < nb_numa_nodes; i++) {
|
|
|
|
|
|
+ for (i = 0; i < ms->numa_state->num_nodes; i++) {
|
|
numa_total += numa_info[i].node_mem;
|
|
numa_total += numa_info[i].node_mem;
|
|
}
|
|
}
|
|
if (numa_total != ram_size) {
|
|
if (numa_total != ram_size) {
|
|
@@ -440,10 +448,10 @@ void numa_complete_configuration(MachineState *ms)
|
|
*/
|
|
*/
|
|
if (have_numa_distance) {
|
|
if (have_numa_distance) {
|
|
/* Validate enough NUMA distance information was provided. */
|
|
/* Validate enough NUMA distance information was provided. */
|
|
- validate_numa_distance();
|
|
|
|
|
|
+ validate_numa_distance(ms);
|
|
|
|
|
|
/* Validation succeeded, now fill in any missing distances. */
|
|
/* Validation succeeded, now fill in any missing distances. */
|
|
- complete_init_numa_distance();
|
|
|
|
|
|
+ complete_init_numa_distance(ms);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
@@ -510,14 +518,16 @@ void memory_region_allocate_system_memory(MemoryRegion *mr, Object *owner,
|
|
{
|
|
{
|
|
uint64_t addr = 0;
|
|
uint64_t addr = 0;
|
|
int i;
|
|
int i;
|
|
|
|
+ MachineState *ms = MACHINE(qdev_get_machine());
|
|
|
|
|
|
- if (nb_numa_nodes == 0 || !have_memdevs) {
|
|
|
|
|
|
+ if (ms->numa_state == NULL ||
|
|
|
|
+ ms->numa_state->num_nodes == 0 || !have_memdevs) {
|
|
allocate_system_memory_nonnuma(mr, owner, name, ram_size);
|
|
allocate_system_memory_nonnuma(mr, owner, name, ram_size);
|
|
return;
|
|
return;
|
|
}
|
|
}
|
|
|
|
|
|
memory_region_init(mr, owner, name, ram_size);
|
|
memory_region_init(mr, owner, name, ram_size);
|
|
- for (i = 0; i < nb_numa_nodes; i++) {
|
|
|
|
|
|
+ for (i = 0; i < ms->numa_state->num_nodes; i++) {
|
|
uint64_t size = numa_info[i].node_mem;
|
|
uint64_t size = numa_info[i].node_mem;
|
|
HostMemoryBackend *backend = numa_info[i].node_memdev;
|
|
HostMemoryBackend *backend = numa_info[i].node_memdev;
|
|
if (!backend) {
|
|
if (!backend) {
|
|
@@ -575,16 +585,16 @@ static void numa_stat_memory_devices(NumaNodeMem node_mem[])
|
|
qapi_free_MemoryDeviceInfoList(info_list);
|
|
qapi_free_MemoryDeviceInfoList(info_list);
|
|
}
|
|
}
|
|
|
|
|
|
-void query_numa_node_mem(NumaNodeMem node_mem[])
|
|
|
|
|
|
+void query_numa_node_mem(NumaNodeMem node_mem[], MachineState *ms)
|
|
{
|
|
{
|
|
int i;
|
|
int i;
|
|
|
|
|
|
- if (nb_numa_nodes <= 0) {
|
|
|
|
|
|
+ if (ms->numa_state == NULL || ms->numa_state->num_nodes <= 0) {
|
|
return;
|
|
return;
|
|
}
|
|
}
|
|
|
|
|
|
numa_stat_memory_devices(node_mem);
|
|
numa_stat_memory_devices(node_mem);
|
|
- for (i = 0; i < nb_numa_nodes; i++) {
|
|
|
|
|
|
+ for (i = 0; i < ms->numa_state->num_nodes; i++) {
|
|
node_mem[i].node_mem += numa_info[i].node_mem;
|
|
node_mem[i].node_mem += numa_info[i].node_mem;
|
|
}
|
|
}
|
|
}
|
|
}
|