blob: c25412750414d484b155a150f37188fd3fffb405 [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
25#include "sysemu/sysemu.h"
26#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"
Wanlong Gao96d0e262014-05-14 17:43:05 +080038
Wanlong Gao00421092014-05-14 17:43:08 +080039QemuOptsList qemu_numa_opts = {
40 .name = "numa",
41 .implied_opt_name = "type",
42 .head = QTAILQ_HEAD_INITIALIZER(qemu_numa_opts.head),
43 .desc = { { 0 } } /* validated with OptsVisitor */
44};
45
Paolo Bonzini7febe362014-05-14 17:43:17 +080046static int have_memdevs = -1;
47
Wanlong Gao00421092014-05-14 17:43:08 +080048static void numa_node_parse(NumaNodeOptions *node, QemuOpts *opts, Error **errp)
Wanlong Gao96d0e262014-05-14 17:43:05 +080049{
Wanlong Gao00421092014-05-14 17:43:08 +080050 uint16_t nodenr;
51 uint16List *cpus = NULL;
Wanlong Gao96d0e262014-05-14 17:43:05 +080052
Wanlong Gao00421092014-05-14 17:43:08 +080053 if (node->has_nodeid) {
54 nodenr = node->nodeid;
55 } else {
56 nodenr = nb_numa_nodes;
57 }
58
59 if (nodenr >= MAX_NODES) {
60 error_setg(errp, "Max number of NUMA nodes reached: %"
61 PRIu16 "\n", nodenr);
Wanlong Gao96d0e262014-05-14 17:43:05 +080062 return;
63 }
64
Eduardo Habkost1945b9d2014-06-26 18:33:19 -030065 if (numa_info[nodenr].present) {
66 error_setg(errp, "Duplicate NUMA nodeid: %" PRIu16, nodenr);
67 return;
68 }
69
Wanlong Gao00421092014-05-14 17:43:08 +080070 for (cpus = node->cpus; cpus; cpus = cpus->next) {
71 if (cpus->value > MAX_CPUMASK_BITS) {
72 error_setg(errp, "CPU number %" PRIu16 " is bigger than %d",
73 cpus->value, MAX_CPUMASK_BITS);
74 return;
Wanlong Gao96d0e262014-05-14 17:43:05 +080075 }
Wanlong Gao00421092014-05-14 17:43:08 +080076 bitmap_set(numa_info[nodenr].node_cpu, cpus->value, 1);
Wanlong Gao96d0e262014-05-14 17:43:05 +080077 }
78
Paolo Bonzini7febe362014-05-14 17:43:17 +080079 if (node->has_mem && node->has_memdev) {
80 error_setg(errp, "qemu: cannot specify both mem= and memdev=\n");
81 return;
82 }
83
84 if (have_memdevs == -1) {
85 have_memdevs = node->has_memdev;
86 }
87 if (node->has_memdev != have_memdevs) {
88 error_setg(errp, "qemu: memdev option must be specified for either "
89 "all or no nodes\n");
90 return;
91 }
92
Wanlong Gao00421092014-05-14 17:43:08 +080093 if (node->has_mem) {
94 uint64_t mem_size = node->mem;
95 const char *mem_str = qemu_opt_get(opts, "mem");
96 /* Fix up legacy suffix-less format */
97 if (g_ascii_isdigit(mem_str[strlen(mem_str) - 1])) {
98 mem_size <<= 20;
99 }
100 numa_info[nodenr].node_mem = mem_size;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800101 }
Paolo Bonzini7febe362014-05-14 17:43:17 +0800102 if (node->has_memdev) {
103 Object *o;
104 o = object_resolve_path_type(node->memdev, TYPE_MEMORY_BACKEND, NULL);
105 if (!o) {
106 error_setg(errp, "memdev=%s is ambiguous", node->memdev);
107 return;
108 }
109
110 object_ref(o);
111 numa_info[nodenr].node_mem = object_property_get_int(o, "size", NULL);
112 numa_info[nodenr].node_memdev = MEMORY_BACKEND(o);
113 }
Eduardo Habkost1af878e2014-06-26 18:33:18 -0300114 numa_info[nodenr].present = true;
115 max_numa_nodeid = MAX(max_numa_nodeid, nodenr + 1);
Wanlong Gao96d0e262014-05-14 17:43:05 +0800116}
117
Wanlong Gao00421092014-05-14 17:43:08 +0800118int numa_init_func(QemuOpts *opts, void *opaque)
Wanlong Gao96d0e262014-05-14 17:43:05 +0800119{
Wanlong Gao00421092014-05-14 17:43:08 +0800120 NumaOptions *object = NULL;
121 Error *err = NULL;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800122
Wanlong Gao00421092014-05-14 17:43:08 +0800123 {
124 OptsVisitor *ov = opts_visitor_new(opts);
125 visit_type_NumaOptions(opts_get_visitor(ov), &object, NULL, &err);
126 opts_visitor_cleanup(ov);
Wanlong Gao96d0e262014-05-14 17:43:05 +0800127 }
Wanlong Gao96d0e262014-05-14 17:43:05 +0800128
Wanlong Gao00421092014-05-14 17:43:08 +0800129 if (err) {
130 goto error;
131 }
Wanlong Gao96d0e262014-05-14 17:43:05 +0800132
Wanlong Gao00421092014-05-14 17:43:08 +0800133 switch (object->kind) {
134 case NUMA_OPTIONS_KIND_NODE:
135 numa_node_parse(object->node, opts, &err);
136 if (err) {
137 goto error;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800138 }
139 nb_numa_nodes++;
Wanlong Gao00421092014-05-14 17:43:08 +0800140 break;
141 default:
142 abort();
Wanlong Gao96d0e262014-05-14 17:43:05 +0800143 }
Wanlong Gao00421092014-05-14 17:43:08 +0800144
145 return 0;
146
147error:
148 qerror_report_err(err);
149 error_free(err);
150
151 if (object) {
152 QapiDeallocVisitor *dv = qapi_dealloc_visitor_new();
153 visit_type_NumaOptions(qapi_dealloc_get_visitor(dv),
154 &object, NULL, NULL);
155 qapi_dealloc_visitor_cleanup(dv);
156 }
157
158 return -1;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800159}
160
161void set_numa_nodes(void)
162{
163 if (nb_numa_nodes > 0) {
Wanlong Gao2b631ec2014-05-14 17:43:06 +0800164 uint64_t numa_total;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800165 int i;
166
167 if (nb_numa_nodes > MAX_NODES) {
168 nb_numa_nodes = MAX_NODES;
169 }
170
Michael S. Tsirkin9851d0f2014-06-24 08:50:30 +0300171 /* If no memory size is given for any node, assume the default case
Wanlong Gao96d0e262014-05-14 17:43:05 +0800172 * and distribute the available memory equally across all nodes
173 */
174 for (i = 0; i < nb_numa_nodes; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800175 if (numa_info[i].node_mem != 0) {
Wanlong Gao96d0e262014-05-14 17:43:05 +0800176 break;
177 }
178 }
179 if (i == nb_numa_nodes) {
180 uint64_t usedmem = 0;
181
Michael S. Tsirkind75e2f62014-06-24 07:43:37 +0300182 /* On Linux, each node's border has to be 8MB aligned,
Wanlong Gao96d0e262014-05-14 17:43:05 +0800183 * the final node gets the rest.
184 */
185 for (i = 0; i < nb_numa_nodes - 1; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800186 numa_info[i].node_mem = (ram_size / nb_numa_nodes) &
187 ~((1 << 23UL) - 1);
188 usedmem += numa_info[i].node_mem;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800189 }
Wanlong Gao8c859012014-05-14 17:43:07 +0800190 numa_info[i].node_mem = ram_size - usedmem;
Wanlong Gao96d0e262014-05-14 17:43:05 +0800191 }
192
Wanlong Gao2b631ec2014-05-14 17:43:06 +0800193 numa_total = 0;
194 for (i = 0; i < nb_numa_nodes; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800195 numa_total += numa_info[i].node_mem;
Wanlong Gao2b631ec2014-05-14 17:43:06 +0800196 }
197 if (numa_total != ram_size) {
198 error_report("total memory for NUMA nodes (%" PRIu64 ")"
199 " should equal RAM size (" RAM_ADDR_FMT ")",
200 numa_total, ram_size);
201 exit(1);
202 }
203
Wanlong Gao96d0e262014-05-14 17:43:05 +0800204 for (i = 0; i < nb_numa_nodes; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800205 if (!bitmap_empty(numa_info[i].node_cpu, MAX_CPUMASK_BITS)) {
Wanlong Gao96d0e262014-05-14 17:43:05 +0800206 break;
207 }
208 }
209 /* assigning the VCPUs round-robin is easier to implement, guest OSes
210 * must cope with this anyway, because there are BIOSes out there in
211 * real machines which also use this scheme.
212 */
213 if (i == nb_numa_nodes) {
214 for (i = 0; i < max_cpus; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800215 set_bit(i, numa_info[i % nb_numa_nodes].node_cpu);
Wanlong Gao96d0e262014-05-14 17:43:05 +0800216 }
217 }
218 }
219}
220
221void set_numa_modes(void)
222{
223 CPUState *cpu;
224 int i;
225
226 CPU_FOREACH(cpu) {
227 for (i = 0; i < nb_numa_nodes; i++) {
Wanlong Gao8c859012014-05-14 17:43:07 +0800228 if (test_bit(cpu->cpu_index, numa_info[i].node_cpu)) {
Wanlong Gao96d0e262014-05-14 17:43:05 +0800229 cpu->numa_node = i;
230 }
231 }
232 }
233}
Paolo Bonzinidfabb8b2014-05-14 17:43:15 +0800234
Paolo Bonzini7febe362014-05-14 17:43:17 +0800235static void allocate_system_memory_nonnuma(MemoryRegion *mr, Object *owner,
236 const char *name,
237 uint64_t ram_size)
238{
Paolo Bonzini0b183fc2014-05-14 17:43:19 +0800239 if (mem_path) {
240#ifdef __linux__
Paolo Bonzini7f56e742014-05-14 17:43:20 +0800241 Error *err = NULL;
Paolo Bonzinidbcb8982014-06-10 19:15:24 +0800242 memory_region_init_ram_from_file(mr, owner, name, ram_size, false,
Paolo Bonzini7f56e742014-05-14 17:43:20 +0800243 mem_path, &err);
244
245 /* Legacy behavior: if allocation failed, fall back to
246 * regular RAM allocation.
247 */
Igor Mammedovc3ba3092014-06-17 12:17:05 +0200248 if (err) {
Paolo Bonzini7f56e742014-05-14 17:43:20 +0800249 qerror_report_err(err);
250 error_free(err);
251 memory_region_init_ram(mr, owner, name, ram_size);
252 }
Paolo Bonzini0b183fc2014-05-14 17:43:19 +0800253#else
254 fprintf(stderr, "-mem-path not supported on this host\n");
255 exit(1);
256#endif
257 } else {
258 memory_region_init_ram(mr, owner, name, ram_size);
259 }
Paolo Bonzini7febe362014-05-14 17:43:17 +0800260 vmstate_register_ram_global(mr);
261}
262
Paolo Bonzinidfabb8b2014-05-14 17:43:15 +0800263void memory_region_allocate_system_memory(MemoryRegion *mr, Object *owner,
264 const char *name,
265 uint64_t ram_size)
266{
Paolo Bonzini7febe362014-05-14 17:43:17 +0800267 uint64_t addr = 0;
268 int i;
269
270 if (nb_numa_nodes == 0 || !have_memdevs) {
271 allocate_system_memory_nonnuma(mr, owner, name, ram_size);
272 return;
273 }
274
275 memory_region_init(mr, owner, name, ram_size);
276 for (i = 0; i < MAX_NODES; i++) {
277 Error *local_err = NULL;
278 uint64_t size = numa_info[i].node_mem;
279 HostMemoryBackend *backend = numa_info[i].node_memdev;
280 if (!backend) {
281 continue;
282 }
283 MemoryRegion *seg = host_memory_backend_get_memory(backend, &local_err);
284 if (local_err) {
285 qerror_report_err(local_err);
286 exit(1);
287 }
288
289 memory_region_add_subregion(mr, addr, seg);
290 vmstate_register_ram_global(seg);
291 addr += size;
292 }
Paolo Bonzinidfabb8b2014-05-14 17:43:15 +0800293}
Hu Tao76b5d852014-06-16 18:05:41 +0800294
295static int query_memdev(Object *obj, void *opaque)
296{
297 MemdevList **list = opaque;
298 Error *err = NULL;
299
300 if (object_dynamic_cast(obj, TYPE_MEMORY_BACKEND)) {
301 MemdevList *m = g_malloc0(sizeof(*m));
302
303 m->value = g_malloc0(sizeof(*m->value));
304
305 m->value->size = object_property_get_int(obj, "size",
306 &err);
307 if (err) {
308 goto error;
309 }
310
311 m->value->merge = object_property_get_bool(obj, "merge",
312 &err);
313 if (err) {
314 goto error;
315 }
316
317 m->value->dump = object_property_get_bool(obj, "dump",
318 &err);
319 if (err) {
320 goto error;
321 }
322
323 m->value->prealloc = object_property_get_bool(obj,
324 "prealloc", &err);
325 if (err) {
326 goto error;
327 }
328
329 m->value->policy = object_property_get_enum(obj,
330 "policy",
331 HostMemPolicy_lookup,
332 &err);
333 if (err) {
334 goto error;
335 }
336
337 object_property_get_uint16List(obj, "host-nodes",
338 &m->value->host_nodes, &err);
339 if (err) {
340 goto error;
341 }
342
343 m->next = *list;
344 *list = m;
345 }
346
347 return 0;
348error:
349 return -1;
350}
351
352MemdevList *qmp_query_memdev(Error **errp)
353{
354 Object *obj;
355 MemdevList *list = NULL, *m;
356
357 obj = object_resolve_path("/objects", NULL);
358 if (obj == NULL) {
359 return NULL;
360 }
361
362 if (object_child_foreach(obj, query_memdev, &list) != 0) {
363 goto error;
364 }
365
366 return list;
367
368error:
369 while (list) {
370 m = list;
371 list = list->next;
372 g_free(m->value);
373 g_free(m);
374 }
375 return NULL;
376}