2 * NUMA parameter parsing routines
4 * Copyright (c) 2014 Fujitsu Ltd.
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to deal
8 * in the Software without restriction, including without limitation the rights
9 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 * copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
25 #include "qemu/osdep.h"
26 #include "sysemu/numa.h"
27 #include "exec/cpu-common.h"
28 #include "exec/ramlist.h"
29 #include "qemu/bitmap.h"
31 #include "qemu/error-report.h"
32 #include "qapi/error.h"
33 #include "qapi/opts-visitor.h"
34 #include "qapi/qapi-commands-misc.h"
35 #include "qapi/qapi-visit-misc.h"
36 #include "hw/boards.h"
37 #include "sysemu/hostmem.h"
38 #include "hw/mem/pc-dimm.h"
39 #include "hw/mem/memory-device.h"
40 #include "qemu/option.h"
41 #include "qemu/config-file.h"
42 #include "qemu/cutils.h"
44 QemuOptsList qemu_numa_opts
= {
46 .implied_opt_name
= "type",
47 .head
= QTAILQ_HEAD_INITIALIZER(qemu_numa_opts
.head
),
48 .desc
= { { 0 } } /* validated with OptsVisitor */
51 static int have_memdevs
= -1;
52 static int max_numa_nodeid
; /* Highest specified NUMA node ID, plus one.
53 * For all nodes, nodeid < max_numa_nodeid
56 bool have_numa_distance
;
57 NodeInfo numa_info
[MAX_NODES
];
60 static void parse_numa_node(MachineState
*ms
, NumaNodeOptions
*node
,
64 uint16List
*cpus
= NULL
;
65 MachineClass
*mc
= MACHINE_GET_CLASS(ms
);
67 if (node
->has_nodeid
) {
68 nodenr
= node
->nodeid
;
70 nodenr
= nb_numa_nodes
;
73 if (nodenr
>= MAX_NODES
) {
74 error_setg(errp
, "Max number of NUMA nodes reached: %"
79 if (numa_info
[nodenr
].present
) {
80 error_setg(errp
, "Duplicate NUMA nodeid: %" PRIu16
, nodenr
);
84 if (!mc
->cpu_index_to_instance_props
|| !mc
->get_default_cpu_node_id
) {
85 error_report("NUMA is not supported by this machine-type");
88 for (cpus
= node
->cpus
; cpus
; cpus
= cpus
->next
) {
89 CpuInstanceProperties props
;
90 if (cpus
->value
>= max_cpus
) {
92 "CPU index (%" PRIu16
")"
93 " should be smaller than maxcpus (%d)",
94 cpus
->value
, max_cpus
);
97 props
= mc
->cpu_index_to_instance_props(ms
, cpus
->value
);
98 props
.node_id
= nodenr
;
99 props
.has_node_id
= true;
100 machine_set_cpu_numa_node(ms
, &props
, &error_fatal
);
103 if (node
->has_mem
&& node
->has_memdev
) {
104 error_setg(errp
, "cannot specify both mem= and memdev=");
108 if (have_memdevs
== -1) {
109 have_memdevs
= node
->has_memdev
;
111 if (node
->has_memdev
!= have_memdevs
) {
112 error_setg(errp
, "memdev option must be specified for either "
118 numa_info
[nodenr
].node_mem
= node
->mem
;
120 if (node
->has_memdev
) {
122 o
= object_resolve_path_type(node
->memdev
, TYPE_MEMORY_BACKEND
, NULL
);
124 error_setg(errp
, "memdev=%s is ambiguous", node
->memdev
);
129 numa_info
[nodenr
].node_mem
= object_property_get_uint(o
, "size", NULL
);
130 numa_info
[nodenr
].node_memdev
= MEMORY_BACKEND(o
);
132 numa_info
[nodenr
].present
= true;
133 max_numa_nodeid
= MAX(max_numa_nodeid
, nodenr
+ 1);
137 static void parse_numa_distance(NumaDistOptions
*dist
, Error
**errp
)
139 uint16_t src
= dist
->src
;
140 uint16_t dst
= dist
->dst
;
141 uint8_t val
= dist
->val
;
143 if (src
>= MAX_NODES
|| dst
>= MAX_NODES
) {
144 error_setg(errp
, "Parameter '%s' expects an integer between 0 and %d",
145 src
>= MAX_NODES
? "src" : "dst", MAX_NODES
- 1);
149 if (!numa_info
[src
].present
|| !numa_info
[dst
].present
) {
150 error_setg(errp
, "Source/Destination NUMA node is missing. "
151 "Please use '-numa node' option to declare it first.");
155 if (val
< NUMA_DISTANCE_MIN
) {
156 error_setg(errp
, "NUMA distance (%" PRIu8
") is invalid, "
157 "it shouldn't be less than %d.",
158 val
, NUMA_DISTANCE_MIN
);
162 if (src
== dst
&& val
!= NUMA_DISTANCE_MIN
) {
163 error_setg(errp
, "Local distance of node %d should be %d.",
164 src
, NUMA_DISTANCE_MIN
);
168 numa_info
[src
].distance
[dst
] = val
;
169 have_numa_distance
= true;
173 void set_numa_options(MachineState
*ms
, NumaOptions
*object
, Error
**errp
)
177 switch (object
->type
) {
178 case NUMA_OPTIONS_TYPE_NODE
:
179 parse_numa_node(ms
, &object
->u
.node
, &err
);
184 case NUMA_OPTIONS_TYPE_DIST
:
185 parse_numa_distance(&object
->u
.dist
, &err
);
190 case NUMA_OPTIONS_TYPE_CPU
:
191 if (!object
->u
.cpu
.has_node_id
) {
192 error_setg(&err
, "Missing mandatory node-id property");
195 if (!numa_info
[object
->u
.cpu
.node_id
].present
) {
196 error_setg(&err
, "Invalid node-id=%" PRId64
", NUMA node must be "
197 "defined with -numa node,nodeid=ID before it's used with "
198 "-numa cpu,node-id=ID", object
->u
.cpu
.node_id
);
202 machine_set_cpu_numa_node(ms
, qapi_NumaCpuOptions_base(&object
->u
.cpu
),
210 error_propagate(errp
, err
);
213 int parse_numa(void *opaque
, QemuOpts
*opts
, Error
**errp
)
215 NumaOptions
*object
= NULL
;
216 MachineState
*ms
= MACHINE(opaque
);
218 Visitor
*v
= opts_visitor_new(opts
);
220 visit_type_NumaOptions(v
, NULL
, &object
, &err
);
226 /* Fix up legacy suffix-less format */
227 if ((object
->type
== NUMA_OPTIONS_TYPE_NODE
) && object
->u
.node
.has_mem
) {
228 const char *mem_str
= qemu_opt_get(opts
, "mem");
229 qemu_strtosz_MiB(mem_str
, NULL
, &object
->u
.node
.mem
);
232 set_numa_options(ms
, object
, &err
);
235 qapi_free_NumaOptions(object
);
237 error_report_err(err
);
244 /* If all node pair distances are symmetric, then only distances
245 * in one direction are enough. If there is even one asymmetric
246 * pair, though, then all distances must be provided. The
247 * distance from a node to itself is always NUMA_DISTANCE_MIN,
248 * so providing it is never necessary.
250 static void validate_numa_distance(void)
253 bool is_asymmetrical
= false;
255 for (src
= 0; src
< nb_numa_nodes
; src
++) {
256 for (dst
= src
; dst
< nb_numa_nodes
; dst
++) {
257 if (numa_info
[src
].distance
[dst
] == 0 &&
258 numa_info
[dst
].distance
[src
] == 0) {
260 error_report("The distance between node %d and %d is "
261 "missing, at least one distance value "
262 "between each nodes should be provided.",
268 if (numa_info
[src
].distance
[dst
] != 0 &&
269 numa_info
[dst
].distance
[src
] != 0 &&
270 numa_info
[src
].distance
[dst
] !=
271 numa_info
[dst
].distance
[src
]) {
272 is_asymmetrical
= true;
277 if (is_asymmetrical
) {
278 for (src
= 0; src
< nb_numa_nodes
; src
++) {
279 for (dst
= 0; dst
< nb_numa_nodes
; dst
++) {
280 if (src
!= dst
&& numa_info
[src
].distance
[dst
] == 0) {
281 error_report("At least one asymmetrical pair of "
282 "distances is given, please provide distances "
283 "for both directions of all node pairs.");
291 static void complete_init_numa_distance(void)
295 /* Fixup NUMA distance by symmetric policy because if it is an
296 * asymmetric distance table, it should be a complete table and
297 * there would not be any missing distance except local node, which
298 * is verified by validate_numa_distance above.
300 for (src
= 0; src
< nb_numa_nodes
; src
++) {
301 for (dst
= 0; dst
< nb_numa_nodes
; dst
++) {
302 if (numa_info
[src
].distance
[dst
] == 0) {
304 numa_info
[src
].distance
[dst
] = NUMA_DISTANCE_MIN
;
306 numa_info
[src
].distance
[dst
] = numa_info
[dst
].distance
[src
];
313 void numa_legacy_auto_assign_ram(MachineClass
*mc
, NodeInfo
*nodes
,
314 int nb_nodes
, ram_addr_t size
)
317 uint64_t usedmem
= 0;
319 /* Align each node according to the alignment
320 * requirements of the machine class
323 for (i
= 0; i
< nb_nodes
- 1; i
++) {
324 nodes
[i
].node_mem
= (size
/ nb_nodes
) &
325 ~((1 << mc
->numa_mem_align_shift
) - 1);
326 usedmem
+= nodes
[i
].node_mem
;
328 nodes
[i
].node_mem
= size
- usedmem
;
331 void numa_default_auto_assign_ram(MachineClass
*mc
, NodeInfo
*nodes
,
332 int nb_nodes
, ram_addr_t size
)
335 uint64_t usedmem
= 0, node_mem
;
336 uint64_t granularity
= size
/ nb_nodes
;
337 uint64_t propagate
= 0;
339 for (i
= 0; i
< nb_nodes
- 1; i
++) {
340 node_mem
= (granularity
+ propagate
) &
341 ~((1 << mc
->numa_mem_align_shift
) - 1);
342 propagate
= granularity
+ propagate
- node_mem
;
343 nodes
[i
].node_mem
= node_mem
;
346 nodes
[i
].node_mem
= size
- usedmem
;
349 void numa_complete_configuration(MachineState
*ms
)
352 MachineClass
*mc
= MACHINE_GET_CLASS(ms
);
355 * If memory hotplug is enabled (slots > 0) but without '-numa'
356 * options explicitly on CLI, guestes will break.
358 * Windows: won't enable memory hotplug without SRAT table at all
360 * Linux: if QEMU is started with initial memory all below 4Gb
361 * and no SRAT table present, guest kernel will use nommu DMA ops,
362 * which breaks 32bit hw drivers when memory is hotplugged and
363 * guest tries to use it with that drivers.
365 * Enable NUMA implicitly by adding a new NUMA node automatically.
367 if (ms
->ram_slots
> 0 && nb_numa_nodes
== 0 &&
368 mc
->auto_enable_numa_with_memhp
) {
369 NumaNodeOptions node
= { };
370 parse_numa_node(ms
, &node
, NULL
);
373 assert(max_numa_nodeid
<= MAX_NODES
);
375 /* No support for sparse NUMA node IDs yet: */
376 for (i
= max_numa_nodeid
- 1; i
>= 0; i
--) {
377 /* Report large node IDs first, to make mistakes easier to spot */
378 if (!numa_info
[i
].present
) {
379 error_report("numa: Node ID missing: %d", i
);
384 /* This must be always true if all nodes are present: */
385 assert(nb_numa_nodes
== max_numa_nodeid
);
387 if (nb_numa_nodes
> 0) {
390 if (nb_numa_nodes
> MAX_NODES
) {
391 nb_numa_nodes
= MAX_NODES
;
394 /* If no memory size is given for any node, assume the default case
395 * and distribute the available memory equally across all nodes
397 for (i
= 0; i
< nb_numa_nodes
; i
++) {
398 if (numa_info
[i
].node_mem
!= 0) {
402 if (i
== nb_numa_nodes
) {
403 assert(mc
->numa_auto_assign_ram
);
404 mc
->numa_auto_assign_ram(mc
, numa_info
, nb_numa_nodes
, ram_size
);
408 for (i
= 0; i
< nb_numa_nodes
; i
++) {
409 numa_total
+= numa_info
[i
].node_mem
;
411 if (numa_total
!= ram_size
) {
412 error_report("total memory for NUMA nodes (0x%" PRIx64
")"
413 " should equal RAM size (0x" RAM_ADDR_FMT
")",
414 numa_total
, ram_size
);
418 /* QEMU needs at least all unique node pair distances to build
419 * the whole NUMA distance table. QEMU treats the distance table
420 * as symmetric by default, i.e. distance A->B == distance B->A.
421 * Thus, QEMU is able to complete the distance table
422 * initialization even though only distance A->B is provided and
423 * distance B->A is not. QEMU knows the distance of a node to
424 * itself is always 10, so A->A distances may be omitted. When
425 * the distances of two nodes of a pair differ, i.e. distance
426 * A->B != distance B->A, then that means the distance table is
427 * asymmetric. In this case, the distances for both directions
428 * of all node pairs are required.
430 if (have_numa_distance
) {
431 /* Validate enough NUMA distance information was provided. */
432 validate_numa_distance();
434 /* Validation succeeded, now fill in any missing distances. */
435 complete_init_numa_distance();
440 void parse_numa_opts(MachineState
*ms
)
442 if (qemu_opts_foreach(qemu_find_opts("numa"), parse_numa
, ms
, NULL
)) {
447 void qmp_set_numa_node(NumaOptions
*cmd
, Error
**errp
)
449 if (!runstate_check(RUN_STATE_PRECONFIG
)) {
450 error_setg(errp
, "The command is permitted only in '%s' state",
451 RunState_str(RUN_STATE_PRECONFIG
));
455 set_numa_options(MACHINE(qdev_get_machine()), cmd
, errp
);
458 void numa_cpu_pre_plug(const CPUArchId
*slot
, DeviceState
*dev
, Error
**errp
)
460 int node_id
= object_property_get_int(OBJECT(dev
), "node-id", &error_abort
);
462 if (node_id
== CPU_UNSET_NUMA_NODE_ID
) {
463 /* due to bug in libvirt, it doesn't pass node-id from props on
464 * device_add as expected, so we have to fix it up here */
465 if (slot
->props
.has_node_id
) {
466 object_property_set_int(OBJECT(dev
), slot
->props
.node_id
,
469 } else if (node_id
!= slot
->props
.node_id
) {
470 error_setg(errp
, "node-id=%d must match numa node specified "
471 "with -numa option", node_id
);
475 static void allocate_system_memory_nonnuma(MemoryRegion
*mr
, Object
*owner
,
482 memory_region_init_ram_from_file(mr
, owner
, name
, ram_size
, 0, 0,
485 error_report_err(err
);
489 error_report("falling back to regular RAM allocation.");
491 /* Legacy behavior: if allocation failed, fall back to
492 * regular RAM allocation.
495 memory_region_init_ram_nomigrate(mr
, owner
, name
, ram_size
, &error_fatal
);
498 fprintf(stderr
, "-mem-path not supported on this host\n");
502 memory_region_init_ram_nomigrate(mr
, owner
, name
, ram_size
, &error_fatal
);
504 vmstate_register_ram_global(mr
);
507 void memory_region_allocate_system_memory(MemoryRegion
*mr
, Object
*owner
,
514 if (nb_numa_nodes
== 0 || !have_memdevs
) {
515 allocate_system_memory_nonnuma(mr
, owner
, name
, ram_size
);
519 memory_region_init(mr
, owner
, name
, ram_size
);
520 for (i
= 0; i
< nb_numa_nodes
; i
++) {
521 uint64_t size
= numa_info
[i
].node_mem
;
522 HostMemoryBackend
*backend
= numa_info
[i
].node_memdev
;
526 MemoryRegion
*seg
= host_memory_backend_get_memory(backend
);
528 if (memory_region_is_mapped(seg
)) {
529 char *path
= object_get_canonical_path_component(OBJECT(backend
));
530 error_report("memory backend %s is used multiple times. Each "
531 "-numa option must use a different memdev value.",
536 host_memory_backend_set_mapped(backend
, true);
537 memory_region_add_subregion(mr
, addr
, seg
);
538 vmstate_register_ram_global(seg
);
543 static void numa_stat_memory_devices(NumaNodeMem node_mem
[])
545 MemoryDeviceInfoList
*info_list
= qmp_memory_device_list();
546 MemoryDeviceInfoList
*info
;
547 PCDIMMDeviceInfo
*pcdimm_info
;
549 for (info
= info_list
; info
; info
= info
->next
) {
550 MemoryDeviceInfo
*value
= info
->value
;
553 switch (value
->type
) {
554 case MEMORY_DEVICE_INFO_KIND_DIMM
:
555 pcdimm_info
= value
->u
.dimm
.data
;
558 case MEMORY_DEVICE_INFO_KIND_NVDIMM
:
559 pcdimm_info
= value
->u
.nvdimm
.data
;
568 node_mem
[pcdimm_info
->node
].node_mem
+= pcdimm_info
->size
;
569 node_mem
[pcdimm_info
->node
].node_plugged_mem
+=
574 qapi_free_MemoryDeviceInfoList(info_list
);
577 void query_numa_node_mem(NumaNodeMem node_mem
[])
581 if (nb_numa_nodes
<= 0) {
585 numa_stat_memory_devices(node_mem
);
586 for (i
= 0; i
< nb_numa_nodes
; i
++) {
587 node_mem
[i
].node_mem
+= numa_info
[i
].node_mem
;
591 static int query_memdev(Object
*obj
, void *opaque
)
593 MemdevList
**list
= opaque
;
594 MemdevList
*m
= NULL
;
596 if (object_dynamic_cast(obj
, TYPE_MEMORY_BACKEND
)) {
597 m
= g_malloc0(sizeof(*m
));
599 m
->value
= g_malloc0(sizeof(*m
->value
));
601 m
->value
->id
= object_get_canonical_path_component(obj
);
602 m
->value
->has_id
= !!m
->value
->id
;
604 m
->value
->size
= object_property_get_uint(obj
, "size",
606 m
->value
->merge
= object_property_get_bool(obj
, "merge",
608 m
->value
->dump
= object_property_get_bool(obj
, "dump",
610 m
->value
->prealloc
= object_property_get_bool(obj
,
613 m
->value
->policy
= object_property_get_enum(obj
,
617 object_property_get_uint16List(obj
, "host-nodes",
618 &m
->value
->host_nodes
,
628 MemdevList
*qmp_query_memdev(Error
**errp
)
630 Object
*obj
= object_get_objects_root();
631 MemdevList
*list
= NULL
;
633 object_child_foreach(obj
, query_memdev
, &list
);
637 void ram_block_notifier_add(RAMBlockNotifier
*n
)
639 QLIST_INSERT_HEAD(&ram_list
.ramblock_notifiers
, n
, next
);
642 void ram_block_notifier_remove(RAMBlockNotifier
*n
)
644 QLIST_REMOVE(n
, next
);
647 void ram_block_notify_add(void *host
, size_t size
)
649 RAMBlockNotifier
*notifier
;
651 QLIST_FOREACH(notifier
, &ram_list
.ramblock_notifiers
, next
) {
652 notifier
->ram_block_added(notifier
, host
, size
);
656 void ram_block_notify_remove(void *host
, size_t size
)
658 RAMBlockNotifier
*notifier
;
660 QLIST_FOREACH(notifier
, &ram_list
.ramblock_notifiers
, next
) {
661 notifier
->ram_block_removed(notifier
, host
, size
);