blob: 0d15375dfd7975cd888d45685aaedd532b63754c [file] [log] [blame]
Wanlong Gao96d0e262014-05-14 17:43:05 +08001/*
2 * NUMA parameter parsing routines
3 *
4 * Copyright (c) 2014 Fujitsu Ltd.
5 *
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:
12 *
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
15 *
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
22 * THE SOFTWARE.
23 */
24
Eduardo Habkoste35704b2015-02-08 16:51:16 -020025#include "sysemu/numa.h"
Wanlong Gao96d0e262014-05-14 17:43:05 +080026#include "exec/cpu-common.h"
27#include "qemu/bitmap.h"
28#include "qom/cpu.h"
Wanlong Gao2b631ec2014-05-14 17:43:06 +080029#include "qemu/error-report.h"
30#include "include/exec/cpu-common.h" /* for RAM_ADDR_FMT */
Wanlong Gao00421092014-05-14 17:43:08 +080031#include "qapi-visit.h"
32#include "qapi/opts-visitor.h"
33#include "qapi/dealloc-visitor.h"
34#include "qapi/qmp/qerror.h"
Paolo Bonzinidfabb8b2014-05-14 17:43:15 +080035#include "hw/boards.h"
Paolo Bonzini7febe362014-05-14 17:43:17 +080036#include "sysemu/hostmem.h"
Hu Tao76b5d852014-06-16 18:05:41 +080037#include "qmp-commands.h"
zhanghailiang5b009e42014-11-04 19:49:30 +080038#include "hw/mem/pc-dimm.h"
Eduardo Habkost7dcd1d72015-02-08 16:51:20 -020039#include "qemu/option.h"
40#include "qemu/config-file.h"
Wanlong Gao96d0e262014-05-14 17:43:05 +080041
Wanlong Gao00421092014-05-14 17:43:08 +080042QemuOptsList qemu_numa_opts = {
43 .name = "numa",
44 .implied_opt_name = "type",
45 .head = QTAILQ_HEAD_INITIALIZER(qemu_numa_opts.head),
46 .desc = { { 0 } } /* validated with OptsVisitor */
47};
48
Paolo Bonzini7febe362014-05-14 17:43:17 +080049static int have_memdevs = -1;
Eduardo Habkost25712ff2015-02-08 16:51:19 -020050static int max_numa_nodeid; /* Highest specified NUMA node ID, plus one.
51 * For all nodes, nodeid < max_numa_nodeid
52 */
Eduardo Habkostde1a7c82015-02-08 16:51:18 -020053int nb_numa_nodes;
Eduardo Habkostde1a7c82015-02-08 16:51:18 -020054NodeInfo numa_info[MAX_NODES];
Paolo Bonzini7febe362014-05-14 17:43:17 +080055
Wanlong Gao00421092014-05-14 17:43:08 +080056static void numa_node_parse(NumaNodeOptions *node, QemuOpts *opts, Error **errp)
Wanlong Gao96d0e262014-05-14 17:43:05 +080057{
Wanlong Gao00421092014-05-14 17:43:08 +080058 uint16_t nodenr;
59 uint16List *cpus = NULL;
Wanlong Gao96d0e262014-05-14 17:43:05 +080060
Wanlong Gao00421092014-05-14 17:43:08 +080061 if (node->has_nodeid) {
62 nodenr = node->nodeid;
63 } else {
64 nodenr = nb_numa_nodes;
65 }
66
67 if (nodenr >= MAX_NODES) {
68 error_setg(errp, "Max number of NUMA nodes reached: %"
69 PRIu16 "\n", nodenr);
Wanlong Gao96d0e262014-05-14 17:43:05 +080070 return;
71 }
72
Eduardo Habkost1945b9d2014-06-26 18:33:19 -030073 if (numa_info[nodenr].present) {
74 error_setg(errp, "Duplicate NUMA nodeid: %" PRIu16, nodenr);
75 return;
76 }
77
Wanlong Gao00421092014-05-14 17:43:08 +080078 for (cpus = node->cpus; cpus; cpus = cpus->next) {
79 if (cpus->value > MAX_CPUMASK_BITS) {
80 error_setg(errp, "CPU number %" PRIu16 " is bigger than %d",
81 cpus->value, MAX_CPUMASK_BITS);
82 return;
Wanlong Gao96d0e262014-05-14 17:43:05 +080083 }
Wanlong Gao00421092014-05-14 17:43:08 +080084 bitmap_set(numa_info[nodenr].node_cpu, cpus->value, 1);
Wanlong Gao96d0e262014-05-14 17:43:05 +080085 }
86
Paolo Bonzini7febe362014-05-14 17:43:17 +080087 if (node->has_mem && node->has_memdev) {
88 error_setg(errp, "qemu: cannot specify both mem= and memdev=\n");
89 return;
90 }
91
92 if (have_memdevs == -1) {
93 have_memdevs = node->has_memdev;
94 }
95 if (node->has_memdev != have_memdevs) {
96 error_setg(errp, "qemu: memdev option must be specified for either "
97 "all or no nodes\n");
98 return;
99 }
100
Wanlong Gao00421092014-05-14 17:43:08 +0800101 if (node->has_mem) {
102 uint64_t mem_size = node->mem;
103 const char *mem_str = qemu_opt_get(opts, "mem");
104 /* Fix up legacy suffix-less format */
105 if (g_ascii_isdigit(mem_str[strlen(mem_str) - 1])) {
106 mem_size <<= 20;
107 }
108 numa_info[nodenr].node_mem = mem_size;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800109 }
Paolo Bonzini7febe362014-05-14 17:43:17 +0800110 if (node->has_memdev) {
111 Object *o;
112 o = object_resolve_path_type(node->memdev, TYPE_MEMORY_BACKEND, NULL);
113 if (!o) {
114 error_setg(errp, "memdev=%s is ambiguous", node->memdev);
115 return;
116 }
117
118 object_ref(o);
119 numa_info[nodenr].node_mem = object_property_get_int(o, "size", NULL);
120 numa_info[nodenr].node_memdev = MEMORY_BACKEND(o);
121 }
Eduardo Habkost1af878e2014-06-26 18:33:18 -0300122 numa_info[nodenr].present = true;
123 max_numa_nodeid = MAX(max_numa_nodeid, nodenr + 1);
Wanlong Gao96d0e262014-05-14 17:43:05 +0800124}
125
Eduardo Habkost1c1e6732015-02-08 16:51:21 -0200126static int parse_numa(QemuOpts *opts, void *opaque)
Wanlong Gao96d0e262014-05-14 17:43:05 +0800127{
Wanlong Gao00421092014-05-14 17:43:08 +0800128 NumaOptions *object = NULL;
129 Error *err = NULL;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800130
Wanlong Gao00421092014-05-14 17:43:08 +0800131 {
132 OptsVisitor *ov = opts_visitor_new(opts);
133 visit_type_NumaOptions(opts_get_visitor(ov), &object, NULL, &err);
134 opts_visitor_cleanup(ov);
Wanlong Gao96d0e262014-05-14 17:43:05 +0800135 }
Wanlong Gao96d0e262014-05-14 17:43:05 +0800136
Wanlong Gao00421092014-05-14 17:43:08 +0800137 if (err) {
138 goto error;
139 }
Wanlong Gao96d0e262014-05-14 17:43:05 +0800140
Wanlong Gao00421092014-05-14 17:43:08 +0800141 switch (object->kind) {
142 case NUMA_OPTIONS_KIND_NODE:
143 numa_node_parse(object->node, opts, &err);
144 if (err) {
145 goto error;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800146 }
147 nb_numa_nodes++;
Wanlong Gao00421092014-05-14 17:43:08 +0800148 break;
149 default:
150 abort();
Wanlong Gao96d0e262014-05-14 17:43:05 +0800151 }
Wanlong Gao00421092014-05-14 17:43:08 +0800152
153 return 0;
154
155error:
156 qerror_report_err(err);
157 error_free(err);
158
159 if (object) {
160 QapiDeallocVisitor *dv = qapi_dealloc_visitor_new();
161 visit_type_NumaOptions(qapi_dealloc_get_visitor(dv),
162 &object, NULL, NULL);
163 qapi_dealloc_visitor_cleanup(dv);
164 }
165
166 return -1;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800167}
168
Eduardo Habkost1c1e6732015-02-08 16:51:21 -0200169void parse_numa_opts(void)
Wanlong Gao96d0e262014-05-14 17:43:05 +0800170{
Eduardo Habkost12d6e462014-06-26 18:33:20 -0300171 int i;
172
Eduardo Habkost1c1e6732015-02-08 16:51:21 -0200173 if (qemu_opts_foreach(qemu_find_opts("numa"), parse_numa,
Eduardo Habkost7dcd1d72015-02-08 16:51:20 -0200174 NULL, 1) != 0) {
175 exit(1);
176 }
177
Eduardo Habkost12d6e462014-06-26 18:33:20 -0300178 assert(max_numa_nodeid <= MAX_NODES);
179
180 /* No support for sparse NUMA node IDs yet: */
181 for (i = max_numa_nodeid - 1; i >= 0; i--) {
182 /* Report large node IDs first, to make mistakes easier to spot */
183 if (!numa_info[i].present) {
184 error_report("numa: Node ID missing: %d", i);
185 exit(1);
186 }
187 }
188
189 /* This must be always true if all nodes are present: */
190 assert(nb_numa_nodes == max_numa_nodeid);
191
Wanlong Gao96d0e262014-05-14 17:43:05 +0800192 if (nb_numa_nodes > 0) {
Wanlong Gao2b631ec2014-05-14 17:43:06 +0800193 uint64_t numa_total;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800194
195 if (nb_numa_nodes > MAX_NODES) {
196 nb_numa_nodes = MAX_NODES;
197 }
198
Michael S. Tsirkin9851d0f2014-06-24 08:50:30 +0300199 /* If no memory size is given for any node, assume the default case
Wanlong Gao96d0e262014-05-14 17:43:05 +0800200 * and distribute the available memory equally across all nodes
201 */
202 for (i = 0; i < nb_numa_nodes; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800203 if (numa_info[i].node_mem != 0) {
Wanlong Gao96d0e262014-05-14 17:43:05 +0800204 break;
205 }
206 }
207 if (i == nb_numa_nodes) {
208 uint64_t usedmem = 0;
209
Michael S. Tsirkind75e2f62014-06-24 07:43:37 +0300210 /* On Linux, each node's border has to be 8MB aligned,
Wanlong Gao96d0e262014-05-14 17:43:05 +0800211 * the final node gets the rest.
212 */
213 for (i = 0; i < nb_numa_nodes - 1; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800214 numa_info[i].node_mem = (ram_size / nb_numa_nodes) &
215 ~((1 << 23UL) - 1);
216 usedmem += numa_info[i].node_mem;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800217 }
Wanlong Gao8c859012014-05-14 17:43:07 +0800218 numa_info[i].node_mem = ram_size - usedmem;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800219 }
220
Wanlong Gao2b631ec2014-05-14 17:43:06 +0800221 numa_total = 0;
222 for (i = 0; i < nb_numa_nodes; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800223 numa_total += numa_info[i].node_mem;
Wanlong Gao2b631ec2014-05-14 17:43:06 +0800224 }
225 if (numa_total != ram_size) {
Hu Taoc68233a2014-08-04 16:16:09 +0800226 error_report("total memory for NUMA nodes (0x%" PRIx64 ")"
227 " should equal RAM size (0x" RAM_ADDR_FMT ")",
Wanlong Gao2b631ec2014-05-14 17:43:06 +0800228 numa_total, ram_size);
229 exit(1);
230 }
231
Wanlong Gao96d0e262014-05-14 17:43:05 +0800232 for (i = 0; i < nb_numa_nodes; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800233 if (!bitmap_empty(numa_info[i].node_cpu, MAX_CPUMASK_BITS)) {
Wanlong Gao96d0e262014-05-14 17:43:05 +0800234 break;
235 }
236 }
237 /* assigning the VCPUs round-robin is easier to implement, guest OSes
238 * must cope with this anyway, because there are BIOSes out there in
239 * real machines which also use this scheme.
240 */
241 if (i == nb_numa_nodes) {
242 for (i = 0; i < max_cpus; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800243 set_bit(i, numa_info[i % nb_numa_nodes].node_cpu);
Wanlong Gao96d0e262014-05-14 17:43:05 +0800244 }
245 }
246 }
247}
248
Eduardo Habkostdde11112015-02-08 16:51:22 -0200249void numa_post_machine_init(void)
Wanlong Gao96d0e262014-05-14 17:43:05 +0800250{
251 CPUState *cpu;
252 int i;
253
254 CPU_FOREACH(cpu) {
255 for (i = 0; i < nb_numa_nodes; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800256 if (test_bit(cpu->cpu_index, numa_info[i].node_cpu)) {
Wanlong Gao96d0e262014-05-14 17:43:05 +0800257 cpu->numa_node = i;
258 }
259 }
260 }
261}
Paolo Bonzinidfabb8b2014-05-14 17:43:15 +0800262
Paolo Bonzini7febe362014-05-14 17:43:17 +0800263static void allocate_system_memory_nonnuma(MemoryRegion *mr, Object *owner,
264 const char *name,
265 uint64_t ram_size)
266{
Paolo Bonzini0b183fc2014-05-14 17:43:19 +0800267 if (mem_path) {
268#ifdef __linux__
Paolo Bonzini7f56e742014-05-14 17:43:20 +0800269 Error *err = NULL;
Paolo Bonzinidbcb8982014-06-10 19:15:24 +0800270 memory_region_init_ram_from_file(mr, owner, name, ram_size, false,
Paolo Bonzini7f56e742014-05-14 17:43:20 +0800271 mem_path, &err);
272
273 /* Legacy behavior: if allocation failed, fall back to
274 * regular RAM allocation.
275 */
Igor Mammedovc3ba3092014-06-17 12:17:05 +0200276 if (err) {
Paolo Bonzini7f56e742014-05-14 17:43:20 +0800277 qerror_report_err(err);
278 error_free(err);
Hu Tao49946532014-09-09 13:27:55 +0800279 memory_region_init_ram(mr, owner, name, ram_size, &error_abort);
Paolo Bonzini7f56e742014-05-14 17:43:20 +0800280 }
Paolo Bonzini0b183fc2014-05-14 17:43:19 +0800281#else
282 fprintf(stderr, "-mem-path not supported on this host\n");
283 exit(1);
284#endif
285 } else {
Hu Tao49946532014-09-09 13:27:55 +0800286 memory_region_init_ram(mr, owner, name, ram_size, &error_abort);
Paolo Bonzini0b183fc2014-05-14 17:43:19 +0800287 }
Paolo Bonzini7febe362014-05-14 17:43:17 +0800288 vmstate_register_ram_global(mr);
289}
290
Paolo Bonzinidfabb8b2014-05-14 17:43:15 +0800291void memory_region_allocate_system_memory(MemoryRegion *mr, Object *owner,
292 const char *name,
293 uint64_t ram_size)
294{
Paolo Bonzini7febe362014-05-14 17:43:17 +0800295 uint64_t addr = 0;
296 int i;
297
298 if (nb_numa_nodes == 0 || !have_memdevs) {
299 allocate_system_memory_nonnuma(mr, owner, name, ram_size);
300 return;
301 }
302
303 memory_region_init(mr, owner, name, ram_size);
304 for (i = 0; i < MAX_NODES; i++) {
305 Error *local_err = NULL;
306 uint64_t size = numa_info[i].node_mem;
307 HostMemoryBackend *backend = numa_info[i].node_memdev;
308 if (!backend) {
309 continue;
310 }
311 MemoryRegion *seg = host_memory_backend_get_memory(backend, &local_err);
312 if (local_err) {
313 qerror_report_err(local_err);
314 exit(1);
315 }
316
Hu Tao0462fae2014-06-30 18:28:15 +0800317 if (memory_region_is_mapped(seg)) {
318 char *path = object_get_canonical_path_component(OBJECT(backend));
319 error_report("memory backend %s is used multiple times. Each "
320 "-numa option must use a different memdev value.",
321 path);
322 exit(1);
323 }
324
Paolo Bonzini7febe362014-05-14 17:43:17 +0800325 memory_region_add_subregion(mr, addr, seg);
326 vmstate_register_ram_global(seg);
327 addr += size;
328 }
Paolo Bonzinidfabb8b2014-05-14 17:43:15 +0800329}
Hu Tao76b5d852014-06-16 18:05:41 +0800330
zhanghailiang5b009e42014-11-04 19:49:30 +0800331static void numa_stat_memory_devices(uint64_t node_mem[])
332{
333 MemoryDeviceInfoList *info_list = NULL;
334 MemoryDeviceInfoList **prev = &info_list;
335 MemoryDeviceInfoList *info;
336
337 qmp_pc_dimm_device_list(qdev_get_machine(), &prev);
338 for (info = info_list; info; info = info->next) {
339 MemoryDeviceInfo *value = info->value;
340
341 if (value) {
342 switch (value->kind) {
343 case MEMORY_DEVICE_INFO_KIND_DIMM:
344 node_mem[value->dimm->node] += value->dimm->size;
345 break;
346 default:
347 break;
348 }
349 }
350 }
351 qapi_free_MemoryDeviceInfoList(info_list);
352}
353
354void query_numa_node_mem(uint64_t node_mem[])
355{
356 int i;
357
358 if (nb_numa_nodes <= 0) {
359 return;
360 }
361
362 numa_stat_memory_devices(node_mem);
363 for (i = 0; i < nb_numa_nodes; i++) {
364 node_mem[i] += numa_info[i].node_mem;
365 }
366}
367
Hu Tao76b5d852014-06-16 18:05:41 +0800368static int query_memdev(Object *obj, void *opaque)
369{
370 MemdevList **list = opaque;
Chen Fanb0e90182014-08-18 14:46:33 +0800371 MemdevList *m = NULL;
Hu Tao76b5d852014-06-16 18:05:41 +0800372 Error *err = NULL;
373
374 if (object_dynamic_cast(obj, TYPE_MEMORY_BACKEND)) {
Chen Fanb0e90182014-08-18 14:46:33 +0800375 m = g_malloc0(sizeof(*m));
Hu Tao76b5d852014-06-16 18:05:41 +0800376
377 m->value = g_malloc0(sizeof(*m->value));
378
379 m->value->size = object_property_get_int(obj, "size",
380 &err);
381 if (err) {
382 goto error;
383 }
384
385 m->value->merge = object_property_get_bool(obj, "merge",
386 &err);
387 if (err) {
388 goto error;
389 }
390
391 m->value->dump = object_property_get_bool(obj, "dump",
392 &err);
393 if (err) {
394 goto error;
395 }
396
397 m->value->prealloc = object_property_get_bool(obj,
398 "prealloc", &err);
399 if (err) {
400 goto error;
401 }
402
403 m->value->policy = object_property_get_enum(obj,
404 "policy",
405 HostMemPolicy_lookup,
406 &err);
407 if (err) {
408 goto error;
409 }
410
411 object_property_get_uint16List(obj, "host-nodes",
412 &m->value->host_nodes, &err);
413 if (err) {
414 goto error;
415 }
416
417 m->next = *list;
418 *list = m;
419 }
420
421 return 0;
422error:
Chen Fanb0e90182014-08-18 14:46:33 +0800423 g_free(m->value);
424 g_free(m);
425
Hu Tao76b5d852014-06-16 18:05:41 +0800426 return -1;
427}
428
429MemdevList *qmp_query_memdev(Error **errp)
430{
431 Object *obj;
Chen Fanecaf54a2014-08-18 14:46:35 +0800432 MemdevList *list = NULL;
Hu Tao76b5d852014-06-16 18:05:41 +0800433
434 obj = object_resolve_path("/objects", NULL);
435 if (obj == NULL) {
436 return NULL;
437 }
438
439 if (object_child_foreach(obj, query_memdev, &list) != 0) {
440 goto error;
441 }
442
443 return list;
444
445error:
Chen Fanecaf54a2014-08-18 14:46:35 +0800446 qapi_free_MemdevList(list);
Hu Tao76b5d852014-06-16 18:05:41 +0800447 return NULL;
448}