]>
Commit | Line | Data |
---|---|---|
96d0e26c WG |
1 | /* |
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" | |
2b631ec2 WG |
29 | #include "qemu/error-report.h" |
30 | #include "include/exec/cpu-common.h" /* for RAM_ADDR_FMT */ | |
0042109a WG |
31 | #include "qapi-visit.h" |
32 | #include "qapi/opts-visitor.h" | |
33 | #include "qapi/dealloc-visitor.h" | |
34 | #include "qapi/qmp/qerror.h" | |
dfabb8b9 | 35 | #include "hw/boards.h" |
7febe36f | 36 | #include "sysemu/hostmem.h" |
0042109a WG |
37 | |
38 | QemuOptsList qemu_numa_opts = { | |
39 | .name = "numa", | |
40 | .implied_opt_name = "type", | |
41 | .head = QTAILQ_HEAD_INITIALIZER(qemu_numa_opts.head), | |
42 | .desc = { { 0 } } /* validated with OptsVisitor */ | |
43 | }; | |
44 | ||
7febe36f PB |
45 | static int have_memdevs = -1; |
46 | ||
0042109a | 47 | static void numa_node_parse(NumaNodeOptions *node, QemuOpts *opts, Error **errp) |
96d0e26c | 48 | { |
0042109a WG |
49 | uint16_t nodenr; |
50 | uint16List *cpus = NULL; | |
96d0e26c | 51 | |
0042109a WG |
52 | if (node->has_nodeid) { |
53 | nodenr = node->nodeid; | |
96d0e26c | 54 | } else { |
0042109a | 55 | nodenr = nb_numa_nodes; |
96d0e26c WG |
56 | } |
57 | ||
0042109a WG |
58 | if (nodenr >= MAX_NODES) { |
59 | error_setg(errp, "Max number of NUMA nodes reached: %" | |
60 | PRIu16 "\n", nodenr); | |
61 | return; | |
96d0e26c WG |
62 | } |
63 | ||
0042109a WG |
64 | for (cpus = node->cpus; cpus; cpus = cpus->next) { |
65 | if (cpus->value > MAX_CPUMASK_BITS) { | |
66 | error_setg(errp, "CPU number %" PRIu16 " is bigger than %d", | |
67 | cpus->value, MAX_CPUMASK_BITS); | |
68 | return; | |
69 | } | |
70 | bitmap_set(numa_info[nodenr].node_cpu, cpus->value, 1); | |
96d0e26c WG |
71 | } |
72 | ||
7febe36f PB |
73 | if (node->has_mem && node->has_memdev) { |
74 | error_setg(errp, "qemu: cannot specify both mem= and memdev=\n"); | |
75 | return; | |
76 | } | |
77 | ||
78 | if (have_memdevs == -1) { | |
79 | have_memdevs = node->has_memdev; | |
80 | } | |
81 | if (node->has_memdev != have_memdevs) { | |
82 | error_setg(errp, "qemu: memdev option must be specified for either " | |
83 | "all or no nodes\n"); | |
84 | return; | |
85 | } | |
86 | ||
0042109a WG |
87 | if (node->has_mem) { |
88 | uint64_t mem_size = node->mem; | |
89 | const char *mem_str = qemu_opt_get(opts, "mem"); | |
90 | /* Fix up legacy suffix-less format */ | |
91 | if (g_ascii_isdigit(mem_str[strlen(mem_str) - 1])) { | |
92 | mem_size <<= 20; | |
93 | } | |
94 | numa_info[nodenr].node_mem = mem_size; | |
95 | } | |
7febe36f PB |
96 | if (node->has_memdev) { |
97 | Object *o; | |
98 | o = object_resolve_path_type(node->memdev, TYPE_MEMORY_BACKEND, NULL); | |
99 | if (!o) { | |
100 | error_setg(errp, "memdev=%s is ambiguous", node->memdev); | |
101 | return; | |
102 | } | |
103 | ||
104 | object_ref(o); | |
105 | numa_info[nodenr].node_mem = object_property_get_int(o, "size", NULL); | |
106 | numa_info[nodenr].node_memdev = MEMORY_BACKEND(o); | |
107 | } | |
96d0e26c WG |
108 | } |
109 | ||
0042109a | 110 | int numa_init_func(QemuOpts *opts, void *opaque) |
96d0e26c | 111 | { |
0042109a WG |
112 | NumaOptions *object = NULL; |
113 | Error *err = NULL; | |
96d0e26c | 114 | |
0042109a WG |
115 | { |
116 | OptsVisitor *ov = opts_visitor_new(opts); | |
117 | visit_type_NumaOptions(opts_get_visitor(ov), &object, NULL, &err); | |
118 | opts_visitor_cleanup(ov); | |
96d0e26c | 119 | } |
96d0e26c | 120 | |
0042109a WG |
121 | if (err) { |
122 | goto error; | |
123 | } | |
96d0e26c | 124 | |
0042109a WG |
125 | switch (object->kind) { |
126 | case NUMA_OPTIONS_KIND_NODE: | |
127 | numa_node_parse(object->node, opts, &err); | |
128 | if (err) { | |
129 | goto error; | |
96d0e26c | 130 | } |
0042109a WG |
131 | nb_numa_nodes++; |
132 | break; | |
133 | default: | |
134 | abort(); | |
135 | } | |
96d0e26c | 136 | |
0042109a | 137 | return 0; |
96d0e26c | 138 | |
0042109a WG |
139 | error: |
140 | qerror_report_err(err); | |
141 | error_free(err); | |
142 | ||
143 | if (object) { | |
144 | QapiDeallocVisitor *dv = qapi_dealloc_visitor_new(); | |
145 | visit_type_NumaOptions(qapi_dealloc_get_visitor(dv), | |
146 | &object, NULL, NULL); | |
147 | qapi_dealloc_visitor_cleanup(dv); | |
96d0e26c | 148 | } |
0042109a WG |
149 | |
150 | return -1; | |
96d0e26c WG |
151 | } |
152 | ||
153 | void set_numa_nodes(void) | |
154 | { | |
155 | if (nb_numa_nodes > 0) { | |
2b631ec2 | 156 | uint64_t numa_total; |
96d0e26c WG |
157 | int i; |
158 | ||
159 | if (nb_numa_nodes > MAX_NODES) { | |
160 | nb_numa_nodes = MAX_NODES; | |
161 | } | |
162 | ||
163 | /* If no memory size if given for any node, assume the default case | |
164 | * and distribute the available memory equally across all nodes | |
165 | */ | |
166 | for (i = 0; i < nb_numa_nodes; i++) { | |
8c85901e | 167 | if (numa_info[i].node_mem != 0) { |
96d0e26c WG |
168 | break; |
169 | } | |
170 | } | |
171 | if (i == nb_numa_nodes) { | |
172 | uint64_t usedmem = 0; | |
173 | ||
174 | /* On Linux, the each node's border has to be 8MB aligned, | |
175 | * the final node gets the rest. | |
176 | */ | |
177 | for (i = 0; i < nb_numa_nodes - 1; i++) { | |
8c85901e WG |
178 | numa_info[i].node_mem = (ram_size / nb_numa_nodes) & |
179 | ~((1 << 23UL) - 1); | |
180 | usedmem += numa_info[i].node_mem; | |
96d0e26c | 181 | } |
8c85901e | 182 | numa_info[i].node_mem = ram_size - usedmem; |
96d0e26c WG |
183 | } |
184 | ||
2b631ec2 WG |
185 | numa_total = 0; |
186 | for (i = 0; i < nb_numa_nodes; i++) { | |
8c85901e | 187 | numa_total += numa_info[i].node_mem; |
2b631ec2 WG |
188 | } |
189 | if (numa_total != ram_size) { | |
190 | error_report("total memory for NUMA nodes (%" PRIu64 ")" | |
191 | " should equal RAM size (" RAM_ADDR_FMT ")", | |
192 | numa_total, ram_size); | |
193 | exit(1); | |
194 | } | |
195 | ||
96d0e26c | 196 | for (i = 0; i < nb_numa_nodes; i++) { |
8c85901e | 197 | if (!bitmap_empty(numa_info[i].node_cpu, MAX_CPUMASK_BITS)) { |
96d0e26c WG |
198 | break; |
199 | } | |
200 | } | |
201 | /* assigning the VCPUs round-robin is easier to implement, guest OSes | |
202 | * must cope with this anyway, because there are BIOSes out there in | |
203 | * real machines which also use this scheme. | |
204 | */ | |
205 | if (i == nb_numa_nodes) { | |
206 | for (i = 0; i < max_cpus; i++) { | |
8c85901e | 207 | set_bit(i, numa_info[i % nb_numa_nodes].node_cpu); |
96d0e26c WG |
208 | } |
209 | } | |
210 | } | |
211 | } | |
212 | ||
213 | void set_numa_modes(void) | |
214 | { | |
215 | CPUState *cpu; | |
216 | int i; | |
217 | ||
218 | CPU_FOREACH(cpu) { | |
219 | for (i = 0; i < nb_numa_nodes; i++) { | |
8c85901e | 220 | if (test_bit(cpu->cpu_index, numa_info[i].node_cpu)) { |
96d0e26c WG |
221 | cpu->numa_node = i; |
222 | } | |
223 | } | |
224 | } | |
225 | } | |
dfabb8b9 | 226 | |
7febe36f PB |
227 | static void allocate_system_memory_nonnuma(MemoryRegion *mr, Object *owner, |
228 | const char *name, | |
229 | uint64_t ram_size) | |
230 | { | |
0b183fc8 PB |
231 | if (mem_path) { |
232 | #ifdef __linux__ | |
233 | memory_region_init_ram_from_file(mr, owner, name, ram_size, mem_path); | |
234 | #else | |
235 | fprintf(stderr, "-mem-path not supported on this host\n"); | |
236 | exit(1); | |
237 | #endif | |
238 | } else { | |
239 | memory_region_init_ram(mr, owner, name, ram_size); | |
240 | } | |
7febe36f PB |
241 | vmstate_register_ram_global(mr); |
242 | } | |
243 | ||
dfabb8b9 PB |
244 | void memory_region_allocate_system_memory(MemoryRegion *mr, Object *owner, |
245 | const char *name, | |
246 | uint64_t ram_size) | |
247 | { | |
7febe36f PB |
248 | uint64_t addr = 0; |
249 | int i; | |
250 | ||
251 | if (nb_numa_nodes == 0 || !have_memdevs) { | |
252 | allocate_system_memory_nonnuma(mr, owner, name, ram_size); | |
253 | return; | |
254 | } | |
255 | ||
256 | memory_region_init(mr, owner, name, ram_size); | |
257 | for (i = 0; i < MAX_NODES; i++) { | |
258 | Error *local_err = NULL; | |
259 | uint64_t size = numa_info[i].node_mem; | |
260 | HostMemoryBackend *backend = numa_info[i].node_memdev; | |
261 | if (!backend) { | |
262 | continue; | |
263 | } | |
264 | MemoryRegion *seg = host_memory_backend_get_memory(backend, &local_err); | |
265 | if (local_err) { | |
266 | qerror_report_err(local_err); | |
267 | exit(1); | |
268 | } | |
269 | ||
270 | memory_region_add_subregion(mr, addr, seg); | |
271 | vmstate_register_ram_global(seg); | |
272 | addr += size; | |
273 | } | |
dfabb8b9 | 274 | } |