numa.c 12.7 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
/*
 * NUMA parameter parsing routines
 *
 * Copyright (c) 2014 Fujitsu Ltd.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

25
#include "sysemu/numa.h"
26 27 28
#include "exec/cpu-common.h"
#include "qemu/bitmap.h"
#include "qom/cpu.h"
29 30
#include "qemu/error-report.h"
#include "include/exec/cpu-common.h" /* for RAM_ADDR_FMT */
31 32 33 34
#include "qapi-visit.h"
#include "qapi/opts-visitor.h"
#include "qapi/dealloc-visitor.h"
#include "qapi/qmp/qerror.h"
35
#include "hw/boards.h"
36
#include "sysemu/hostmem.h"
H
Hu Tao 已提交
37
#include "qmp-commands.h"
38
#include "hw/mem/pc-dimm.h"
39 40
#include "qemu/option.h"
#include "qemu/config-file.h"
41 42 43 44 45 46 47 48

QemuOptsList qemu_numa_opts = {
    .name = "numa",
    .implied_opt_name = "type",
    .head = QTAILQ_HEAD_INITIALIZER(qemu_numa_opts.head),
    .desc = { { 0 } } /* validated with OptsVisitor */
};

49
static int have_memdevs = -1;
50 51 52
static int max_numa_nodeid; /* Highest specified NUMA node ID, plus one.
                             * For all nodes, nodeid < max_numa_nodeid
                             */
53 54
int nb_numa_nodes;
NodeInfo numa_info[MAX_NODES];
55

56
static void numa_node_parse(NumaNodeOptions *node, QemuOpts *opts, Error **errp)
57
{
58 59
    uint16_t nodenr;
    uint16List *cpus = NULL;
60

61 62
    if (node->has_nodeid) {
        nodenr = node->nodeid;
63
    } else {
64
        nodenr = nb_numa_nodes;
65 66
    }

67 68 69 70
    if (nodenr >= MAX_NODES) {
        error_setg(errp, "Max number of NUMA nodes reached: %"
                   PRIu16 "\n", nodenr);
        return;
71 72
    }

73 74 75 76 77
    if (numa_info[nodenr].present) {
        error_setg(errp, "Duplicate NUMA nodeid: %" PRIu16, nodenr);
        return;
    }

78 79 80 81 82 83 84
    for (cpus = node->cpus; cpus; cpus = cpus->next) {
        if (cpus->value > MAX_CPUMASK_BITS) {
            error_setg(errp, "CPU number %" PRIu16 " is bigger than %d",
                       cpus->value, MAX_CPUMASK_BITS);
            return;
        }
        bitmap_set(numa_info[nodenr].node_cpu, cpus->value, 1);
85 86
    }

87 88 89 90 91 92 93 94 95 96 97 98 99 100
    if (node->has_mem && node->has_memdev) {
        error_setg(errp, "qemu: cannot specify both mem= and memdev=\n");
        return;
    }

    if (have_memdevs == -1) {
        have_memdevs = node->has_memdev;
    }
    if (node->has_memdev != have_memdevs) {
        error_setg(errp, "qemu: memdev option must be specified for either "
                   "all or no nodes\n");
        return;
    }

101 102 103 104 105 106 107 108 109
    if (node->has_mem) {
        uint64_t mem_size = node->mem;
        const char *mem_str = qemu_opt_get(opts, "mem");
        /* Fix up legacy suffix-less format */
        if (g_ascii_isdigit(mem_str[strlen(mem_str) - 1])) {
            mem_size <<= 20;
        }
        numa_info[nodenr].node_mem = mem_size;
    }
110 111 112 113 114 115 116 117 118 119 120 121
    if (node->has_memdev) {
        Object *o;
        o = object_resolve_path_type(node->memdev, TYPE_MEMORY_BACKEND, NULL);
        if (!o) {
            error_setg(errp, "memdev=%s is ambiguous", node->memdev);
            return;
        }

        object_ref(o);
        numa_info[nodenr].node_mem = object_property_get_int(o, "size", NULL);
        numa_info[nodenr].node_memdev = MEMORY_BACKEND(o);
    }
122 123
    numa_info[nodenr].present = true;
    max_numa_nodeid = MAX(max_numa_nodeid, nodenr + 1);
124 125
}

126
static int parse_numa(QemuOpts *opts, void *opaque)
127
{
128 129
    NumaOptions *object = NULL;
    Error *err = NULL;
130

131 132 133 134
    {
        OptsVisitor *ov = opts_visitor_new(opts);
        visit_type_NumaOptions(opts_get_visitor(ov), &object, NULL, &err);
        opts_visitor_cleanup(ov);
135 136
    }

137 138 139
    if (err) {
        goto error;
    }
140

141 142 143 144 145
    switch (object->kind) {
    case NUMA_OPTIONS_KIND_NODE:
        numa_node_parse(object->node, opts, &err);
        if (err) {
            goto error;
146
        }
147 148 149 150 151
        nb_numa_nodes++;
        break;
    default:
        abort();
    }
152

153
    return 0;
154

155 156 157 158 159 160 161 162 163
error:
    qerror_report_err(err);
    error_free(err);

    if (object) {
        QapiDeallocVisitor *dv = qapi_dealloc_visitor_new();
        visit_type_NumaOptions(qapi_dealloc_get_visitor(dv),
                               &object, NULL, NULL);
        qapi_dealloc_visitor_cleanup(dv);
164
    }
165 166

    return -1;
167 168
}

169
void parse_numa_opts(void)
170
{
171 172
    int i;

173
    if (qemu_opts_foreach(qemu_find_opts("numa"), parse_numa,
174 175 176 177
                          NULL, 1) != 0) {
        exit(1);
    }

178 179 180 181 182 183 184 185 186 187 188 189 190 191
    assert(max_numa_nodeid <= MAX_NODES);

    /* No support for sparse NUMA node IDs yet: */
    for (i = max_numa_nodeid - 1; i >= 0; i--) {
        /* Report large node IDs first, to make mistakes easier to spot */
        if (!numa_info[i].present) {
            error_report("numa: Node ID missing: %d", i);
            exit(1);
        }
    }

    /* This must be always true if all nodes are present: */
    assert(nb_numa_nodes == max_numa_nodeid);

192
    if (nb_numa_nodes > 0) {
193
        uint64_t numa_total;
194 195 196 197 198

        if (nb_numa_nodes > MAX_NODES) {
            nb_numa_nodes = MAX_NODES;
        }

M
Michael S. Tsirkin 已提交
199
        /* If no memory size is given for any node, assume the default case
200 201 202
         * and distribute the available memory equally across all nodes
         */
        for (i = 0; i < nb_numa_nodes; i++) {
203
            if (numa_info[i].node_mem != 0) {
204 205 206 207 208 209
                break;
            }
        }
        if (i == nb_numa_nodes) {
            uint64_t usedmem = 0;

M
Michael S. Tsirkin 已提交
210
            /* On Linux, each node's border has to be 8MB aligned,
211 212 213
             * the final node gets the rest.
             */
            for (i = 0; i < nb_numa_nodes - 1; i++) {
214 215 216
                numa_info[i].node_mem = (ram_size / nb_numa_nodes) &
                                        ~((1 << 23UL) - 1);
                usedmem += numa_info[i].node_mem;
217
            }
218
            numa_info[i].node_mem = ram_size - usedmem;
219 220
        }

221 222
        numa_total = 0;
        for (i = 0; i < nb_numa_nodes; i++) {
223
            numa_total += numa_info[i].node_mem;
224 225
        }
        if (numa_total != ram_size) {
226 227
            error_report("total memory for NUMA nodes (0x%" PRIx64 ")"
                         " should equal RAM size (0x" RAM_ADDR_FMT ")",
228 229 230 231
                         numa_total, ram_size);
            exit(1);
        }

232
        for (i = 0; i < nb_numa_nodes; i++) {
233
            if (!bitmap_empty(numa_info[i].node_cpu, MAX_CPUMASK_BITS)) {
234 235 236 237 238 239 240 241 242
                break;
            }
        }
        /* assigning the VCPUs round-robin is easier to implement, guest OSes
         * must cope with this anyway, because there are BIOSes out there in
         * real machines which also use this scheme.
         */
        if (i == nb_numa_nodes) {
            for (i = 0; i < max_cpus; i++) {
243
                set_bit(i, numa_info[i % nb_numa_nodes].node_cpu);
244 245 246 247 248 249 250 251 252 253 254 255
            }
        }
    }
}

void set_numa_modes(void)
{
    CPUState *cpu;
    int i;

    CPU_FOREACH(cpu) {
        for (i = 0; i < nb_numa_nodes; i++) {
256
            if (test_bit(cpu->cpu_index, numa_info[i].node_cpu)) {
257 258 259 260 261
                cpu->numa_node = i;
            }
        }
    }
}
262

263 264 265 266
static void allocate_system_memory_nonnuma(MemoryRegion *mr, Object *owner,
                                           const char *name,
                                           uint64_t ram_size)
{
267 268
    if (mem_path) {
#ifdef __linux__
269
        Error *err = NULL;
270
        memory_region_init_ram_from_file(mr, owner, name, ram_size, false,
271 272 273 274 275
                                         mem_path, &err);

        /* Legacy behavior: if allocation failed, fall back to
         * regular RAM allocation.
         */
276
        if (err) {
277 278
            qerror_report_err(err);
            error_free(err);
279
            memory_region_init_ram(mr, owner, name, ram_size, &error_abort);
280
        }
281 282 283 284 285
#else
        fprintf(stderr, "-mem-path not supported on this host\n");
        exit(1);
#endif
    } else {
286
        memory_region_init_ram(mr, owner, name, ram_size, &error_abort);
287
    }
288 289 290
    vmstate_register_ram_global(mr);
}

291 292 293 294
void memory_region_allocate_system_memory(MemoryRegion *mr, Object *owner,
                                          const char *name,
                                          uint64_t ram_size)
{
295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316
    uint64_t addr = 0;
    int i;

    if (nb_numa_nodes == 0 || !have_memdevs) {
        allocate_system_memory_nonnuma(mr, owner, name, ram_size);
        return;
    }

    memory_region_init(mr, owner, name, ram_size);
    for (i = 0; i < MAX_NODES; i++) {
        Error *local_err = NULL;
        uint64_t size = numa_info[i].node_mem;
        HostMemoryBackend *backend = numa_info[i].node_memdev;
        if (!backend) {
            continue;
        }
        MemoryRegion *seg = host_memory_backend_get_memory(backend, &local_err);
        if (local_err) {
            qerror_report_err(local_err);
            exit(1);
        }

H
Hu Tao 已提交
317 318 319 320 321 322 323 324
        if (memory_region_is_mapped(seg)) {
            char *path = object_get_canonical_path_component(OBJECT(backend));
            error_report("memory backend %s is used multiple times. Each "
                         "-numa option must use a different memdev value.",
                         path);
            exit(1);
        }

325 326 327 328
        memory_region_add_subregion(mr, addr, seg);
        vmstate_register_ram_global(seg);
        addr += size;
    }
329
}
H
Hu Tao 已提交
330

331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367
static void numa_stat_memory_devices(uint64_t node_mem[])
{
    MemoryDeviceInfoList *info_list = NULL;
    MemoryDeviceInfoList **prev = &info_list;
    MemoryDeviceInfoList *info;

    qmp_pc_dimm_device_list(qdev_get_machine(), &prev);
    for (info = info_list; info; info = info->next) {
        MemoryDeviceInfo *value = info->value;

        if (value) {
            switch (value->kind) {
            case MEMORY_DEVICE_INFO_KIND_DIMM:
                node_mem[value->dimm->node] += value->dimm->size;
                break;
            default:
                break;
            }
        }
    }
    qapi_free_MemoryDeviceInfoList(info_list);
}

void query_numa_node_mem(uint64_t node_mem[])
{
    int i;

    if (nb_numa_nodes <= 0) {
        return;
    }

    numa_stat_memory_devices(node_mem);
    for (i = 0; i < nb_numa_nodes; i++) {
        node_mem[i] += numa_info[i].node_mem;
    }
}

H
Hu Tao 已提交
368 369 370
static int query_memdev(Object *obj, void *opaque)
{
    MemdevList **list = opaque;
371
    MemdevList *m = NULL;
H
Hu Tao 已提交
372 373 374
    Error *err = NULL;

    if (object_dynamic_cast(obj, TYPE_MEMORY_BACKEND)) {
375
        m = g_malloc0(sizeof(*m));
H
Hu Tao 已提交
376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422

        m->value = g_malloc0(sizeof(*m->value));

        m->value->size = object_property_get_int(obj, "size",
                                                 &err);
        if (err) {
            goto error;
        }

        m->value->merge = object_property_get_bool(obj, "merge",
                                                   &err);
        if (err) {
            goto error;
        }

        m->value->dump = object_property_get_bool(obj, "dump",
                                                  &err);
        if (err) {
            goto error;
        }

        m->value->prealloc = object_property_get_bool(obj,
                                                      "prealloc", &err);
        if (err) {
            goto error;
        }

        m->value->policy = object_property_get_enum(obj,
                                                    "policy",
                                                    HostMemPolicy_lookup,
                                                    &err);
        if (err) {
            goto error;
        }

        object_property_get_uint16List(obj, "host-nodes",
                                       &m->value->host_nodes, &err);
        if (err) {
            goto error;
        }

        m->next = *list;
        *list = m;
    }

    return 0;
error:
423 424 425
    g_free(m->value);
    g_free(m);

H
Hu Tao 已提交
426 427 428 429 430 431
    return -1;
}

MemdevList *qmp_query_memdev(Error **errp)
{
    Object *obj;
C
Chen Fan 已提交
432
    MemdevList *list = NULL;
H
Hu Tao 已提交
433 434 435 436 437 438 439 440 441 442 443 444 445

    obj = object_resolve_path("/objects", NULL);
    if (obj == NULL) {
        return NULL;
    }

    if (object_child_foreach(obj, query_memdev, &list) != 0) {
        goto error;
    }

    return list;

error:
C
Chen Fan 已提交
446
    qapi_free_MemdevList(list);
H
Hu Tao 已提交
447 448
    return NULL;
}