]> git.proxmox.com Git - mirror_qemu.git/blame - softmmu/device_tree.c
softmmu/device_tree: Silence compiler warning with --enable-sanitizers
[mirror_qemu.git] / softmmu / device_tree.c
CommitLineData
f652e6af
AJ
1/*
2 * Functions to help device tree manipulation using libfdt.
3 * It also provides functions to read entries from device tree proc
4 * interface.
5 *
6 * Copyright 2008 IBM Corporation.
7 * Authors: Jerone Young <jyoung5@us.ibm.com>
8 * Hollis Blanchard <hollisb@us.ibm.com>
9 *
10 * This work is licensed under the GNU GPL license version 2 or later.
11 *
12 */
13
d38ea87a 14#include "qemu/osdep.h"
f652e6af 15
60e43e98
EA
16#ifdef CONFIG_LINUX
17#include <dirent.h>
18#endif
19
da34e65c 20#include "qapi/error.h"
db013f81 21#include "qemu/error-report.h"
922a01a0 22#include "qemu/option.h"
58369e22 23#include "qemu/bswap.h"
78da6a1b 24#include "qemu/cutils.h"
9c17d615 25#include "sysemu/device_tree.h"
39b7f20e 26#include "hw/loader.h"
6cabe7fa 27#include "hw/boards.h"
1de7afc9 28#include "qemu/config-file.h"
f652e6af
AJ
29
30#include <libfdt.h>
31
14ec3cbd 32#define FDT_MAX_SIZE 0x100000
ce36252c
AG
33
34void *create_device_tree(int *sizep)
35{
36 void *fdt;
37 int ret;
38
39 *sizep = FDT_MAX_SIZE;
40 fdt = g_malloc0(FDT_MAX_SIZE);
41 ret = fdt_create(fdt, FDT_MAX_SIZE);
42 if (ret < 0) {
43 goto fail;
44 }
ef6de70e
PM
45 ret = fdt_finish_reservemap(fdt);
46 if (ret < 0) {
47 goto fail;
48 }
ce36252c
AG
49 ret = fdt_begin_node(fdt, "");
50 if (ret < 0) {
51 goto fail;
52 }
53 ret = fdt_end_node(fdt);
54 if (ret < 0) {
55 goto fail;
56 }
57 ret = fdt_finish(fdt);
58 if (ret < 0) {
59 goto fail;
60 }
61 ret = fdt_open_into(fdt, fdt, *sizep);
62 if (ret) {
d4fae97d
BB
63 error_report("%s: Unable to copy device tree into memory: %s",
64 __func__, fdt_strerror(ret));
ce36252c
AG
65 exit(1);
66 }
67
68 return fdt;
69fail:
508e221f 70 error_report("%s Couldn't create dt: %s", __func__, fdt_strerror(ret));
ce36252c
AG
71 exit(1);
72}
73
7ec632b4 74void *load_device_tree(const char *filename_path, int *sizep)
f652e6af 75{
7ec632b4 76 int dt_size;
f652e6af 77 int dt_file_load_size;
f652e6af 78 int ret;
7ec632b4 79 void *fdt = NULL;
f652e6af 80
7ec632b4
PB
81 *sizep = 0;
82 dt_size = get_image_size(filename_path);
83 if (dt_size < 0) {
db013f81
LL
84 error_report("Unable to get size of device tree file '%s'",
85 filename_path);
f652e6af
AJ
86 goto fail;
87 }
065e6298
MA
88 if (dt_size > INT_MAX / 2 - 10000) {
89 error_report("Device tree file '%s' is too large", filename_path);
90 goto fail;
91 }
f652e6af 92
7ec632b4 93 /* Expand to 2x size to give enough room for manipulation. */
ded57c5f 94 dt_size += 10000;
7ec632b4 95 dt_size *= 2;
f652e6af 96 /* First allocate space in qemu for device tree */
7267c094 97 fdt = g_malloc0(dt_size);
f652e6af 98
da885fe1 99 dt_file_load_size = load_image_size(filename_path, fdt, dt_size);
7ec632b4 100 if (dt_file_load_size < 0) {
db013f81
LL
101 error_report("Unable to open device tree file '%s'",
102 filename_path);
7ec632b4
PB
103 goto fail;
104 }
f652e6af 105
7ec632b4 106 ret = fdt_open_into(fdt, fdt, dt_size);
f652e6af 107 if (ret) {
d4fae97d
BB
108 error_report("%s: Unable to copy device tree into memory: %s",
109 __func__, fdt_strerror(ret));
f652e6af
AJ
110 goto fail;
111 }
112
113 /* Check sanity of device tree */
114 if (fdt_check_header(fdt)) {
db013f81
LL
115 error_report("Device tree file loaded into memory is invalid: %s",
116 filename_path);
f652e6af
AJ
117 goto fail;
118 }
7ec632b4 119 *sizep = dt_size;
f652e6af
AJ
120 return fdt;
121
122fail:
7267c094 123 g_free(fdt);
f652e6af
AJ
124 return NULL;
125}
126
60e43e98
EA
127#ifdef CONFIG_LINUX
128
129#define SYSFS_DT_BASEDIR "/proc/device-tree"
130
131/**
132 * read_fstree: this function is inspired from dtc read_fstree
133 * @fdt: preallocated fdt blob buffer, to be populated
134 * @dirname: directory to scan under SYSFS_DT_BASEDIR
135 * the search is recursive and the tree is searched down to the
136 * leaves (property files).
137 *
138 * the function asserts in case of error
139 */
140static void read_fstree(void *fdt, const char *dirname)
141{
142 DIR *d;
143 struct dirent *de;
144 struct stat st;
145 const char *root_dir = SYSFS_DT_BASEDIR;
146 const char *parent_node;
147
148 if (strstr(dirname, root_dir) != dirname) {
38754e43
PMD
149 error_report("%s: %s must be searched within %s",
150 __func__, dirname, root_dir);
151 exit(1);
60e43e98
EA
152 }
153 parent_node = &dirname[strlen(SYSFS_DT_BASEDIR)];
154
155 d = opendir(dirname);
156 if (!d) {
38754e43
PMD
157 error_report("%s cannot open %s", __func__, dirname);
158 exit(1);
60e43e98
EA
159 }
160
161 while ((de = readdir(d)) != NULL) {
162 char *tmpnam;
163
164 if (!g_strcmp0(de->d_name, ".")
165 || !g_strcmp0(de->d_name, "..")) {
166 continue;
167 }
168
169 tmpnam = g_strdup_printf("%s/%s", dirname, de->d_name);
170
171 if (lstat(tmpnam, &st) < 0) {
38754e43
PMD
172 error_report("%s cannot lstat %s", __func__, tmpnam);
173 exit(1);
60e43e98
EA
174 }
175
176 if (S_ISREG(st.st_mode)) {
177 gchar *val;
178 gsize len;
179
180 if (!g_file_get_contents(tmpnam, &val, &len, NULL)) {
38754e43
PMD
181 error_report("%s not able to extract info from %s",
182 __func__, tmpnam);
183 exit(1);
60e43e98
EA
184 }
185
186 if (strlen(parent_node) > 0) {
187 qemu_fdt_setprop(fdt, parent_node,
188 de->d_name, val, len);
189 } else {
190 qemu_fdt_setprop(fdt, "/", de->d_name, val, len);
191 }
192 g_free(val);
193 } else if (S_ISDIR(st.st_mode)) {
194 char *node_name;
195
196 node_name = g_strdup_printf("%s/%s",
197 parent_node, de->d_name);
198 qemu_fdt_add_subnode(fdt, node_name);
199 g_free(node_name);
200 read_fstree(fdt, tmpnam);
201 }
202
203 g_free(tmpnam);
204 }
205
206 closedir(d);
207}
208
209/* load_device_tree_from_sysfs: extract the dt blob from host sysfs */
210void *load_device_tree_from_sysfs(void)
211{
212 void *host_fdt;
213 int host_fdt_size;
214
215 host_fdt = create_device_tree(&host_fdt_size);
216 read_fstree(host_fdt, SYSFS_DT_BASEDIR);
217 if (fdt_check_header(host_fdt)) {
38754e43
PMD
218 error_report("%s host device tree extracted into memory is invalid",
219 __func__);
220 exit(1);
60e43e98
EA
221 }
222 return host_fdt;
223}
224
225#endif /* CONFIG_LINUX */
226
ccbcfedd 227static int findnode_nofail(void *fdt, const char *node_path)
f652e6af
AJ
228{
229 int offset;
230
231 offset = fdt_path_offset(fdt, node_path);
ccbcfedd 232 if (offset < 0) {
508e221f
LL
233 error_report("%s Couldn't find node %s: %s", __func__, node_path,
234 fdt_strerror(offset));
ccbcfedd
AG
235 exit(1);
236 }
237
238 return offset;
239}
240
f963cc26
EA
241char **qemu_fdt_node_unit_path(void *fdt, const char *name, Error **errp)
242{
243 char *prefix = g_strdup_printf("%s@", name);
244 unsigned int path_len = 16, n = 0;
245 GSList *path_list = NULL, *iter;
246 const char *iter_name;
247 int offset, len, ret;
248 char **path_array;
249
250 offset = fdt_next_node(fdt, -1, NULL);
251
252 while (offset >= 0) {
253 iter_name = fdt_get_name(fdt, offset, &len);
254 if (!iter_name) {
255 offset = len;
256 break;
257 }
258 if (!strcmp(iter_name, name) || g_str_has_prefix(iter_name, prefix)) {
259 char *path;
260
261 path = g_malloc(path_len);
262 while ((ret = fdt_get_path(fdt, offset, path, path_len))
263 == -FDT_ERR_NOSPACE) {
264 path_len += 16;
265 path = g_realloc(path, path_len);
266 }
267 path_list = g_slist_prepend(path_list, path);
268 n++;
269 }
270 offset = fdt_next_node(fdt, offset, NULL);
271 }
272 g_free(prefix);
273
274 if (offset < 0 && offset != -FDT_ERR_NOTFOUND) {
275 error_setg(errp, "%s: abort parsing dt for %s node units: %s",
276 __func__, name, fdt_strerror(offset));
277 for (iter = path_list; iter; iter = iter->next) {
278 g_free(iter->data);
279 }
280 g_slist_free(path_list);
281 return NULL;
282 }
283
284 path_array = g_new(char *, n + 1);
285 path_array[n--] = NULL;
286
287 for (iter = path_list; iter; iter = iter->next) {
288 path_array[n--] = iter->data;
289 }
290
291 g_slist_free(path_list);
292
293 return path_array;
294}
295
958bae18 296char **qemu_fdt_node_path(void *fdt, const char *name, const char *compat,
6d79566a
EA
297 Error **errp)
298{
299 int offset, len, ret;
300 const char *iter_name;
301 unsigned int path_len = 16, n = 0;
302 GSList *path_list = NULL, *iter;
303 char **path_array;
304
305 offset = fdt_node_offset_by_compatible(fdt, -1, compat);
306
307 while (offset >= 0) {
308 iter_name = fdt_get_name(fdt, offset, &len);
309 if (!iter_name) {
310 offset = len;
311 break;
312 }
80972d3b 313 if (!name || !strcmp(iter_name, name)) {
6d79566a
EA
314 char *path;
315
316 path = g_malloc(path_len);
317 while ((ret = fdt_get_path(fdt, offset, path, path_len))
318 == -FDT_ERR_NOSPACE) {
319 path_len += 16;
320 path = g_realloc(path, path_len);
321 }
322 path_list = g_slist_prepend(path_list, path);
323 n++;
324 }
325 offset = fdt_node_offset_by_compatible(fdt, offset, compat);
326 }
327
328 if (offset < 0 && offset != -FDT_ERR_NOTFOUND) {
329 error_setg(errp, "%s: abort parsing dt for %s/%s: %s",
330 __func__, name, compat, fdt_strerror(offset));
331 for (iter = path_list; iter; iter = iter->next) {
332 g_free(iter->data);
333 }
334 g_slist_free(path_list);
335 return NULL;
336 }
337
338 path_array = g_new(char *, n + 1);
339 path_array[n--] = NULL;
340
341 for (iter = path_list; iter; iter = iter->next) {
342 path_array[n--] = iter->data;
343 }
344
345 g_slist_free(path_list);
346
347 return path_array;
348}
349
5a4348d1 350int qemu_fdt_setprop(void *fdt, const char *node_path,
be5907f2 351 const char *property, const void *val, int size)
ccbcfedd
AG
352{
353 int r;
354
be5907f2 355 r = fdt_setprop(fdt, findnode_nofail(fdt, node_path), property, val, size);
ccbcfedd 356 if (r < 0) {
508e221f
LL
357 error_report("%s: Couldn't set %s/%s: %s", __func__, node_path,
358 property, fdt_strerror(r));
ccbcfedd
AG
359 exit(1);
360 }
f652e6af 361
ccbcfedd 362 return r;
f652e6af
AJ
363}
364
5a4348d1
PC
365int qemu_fdt_setprop_cell(void *fdt, const char *node_path,
366 const char *property, uint32_t val)
f652e6af 367{
ccbcfedd 368 int r;
f652e6af 369
ccbcfedd
AG
370 r = fdt_setprop_cell(fdt, findnode_nofail(fdt, node_path), property, val);
371 if (r < 0) {
508e221f
LL
372 error_report("%s: Couldn't set %s/%s = %#08x: %s", __func__,
373 node_path, property, val, fdt_strerror(r));
ccbcfedd
AG
374 exit(1);
375 }
f652e6af 376
ccbcfedd 377 return r;
f652e6af
AJ
378}
379
5a4348d1
PC
380int qemu_fdt_setprop_u64(void *fdt, const char *node_path,
381 const char *property, uint64_t val)
bb28eb37
AG
382{
383 val = cpu_to_be64(val);
5a4348d1 384 return qemu_fdt_setprop(fdt, node_path, property, &val, sizeof(val));
bb28eb37
AG
385}
386
5a4348d1
PC
387int qemu_fdt_setprop_string(void *fdt, const char *node_path,
388 const char *property, const char *string)
f652e6af 389{
ccbcfedd 390 int r;
f652e6af 391
ccbcfedd
AG
392 r = fdt_setprop_string(fdt, findnode_nofail(fdt, node_path), property, string);
393 if (r < 0) {
508e221f
LL
394 error_report("%s: Couldn't set %s/%s = %s: %s", __func__,
395 node_path, property, string, fdt_strerror(r));
ccbcfedd
AG
396 exit(1);
397 }
f652e6af 398
ccbcfedd 399 return r;
f652e6af 400}
d69a8e63 401
78da6a1b
AB
402/*
403 * libfdt doesn't allow us to add string arrays directly but they are
404 * test a series of null terminated strings with a length. We build
405 * the string up here so we can calculate the final length.
406 */
407int qemu_fdt_setprop_string_array(void *fdt, const char *node_path,
408 const char *prop, char **array, int len)
409{
410 int ret, i, total_len = 0;
411 char *str, *p;
412 for (i = 0; i < len; i++) {
413 total_len += strlen(array[i]) + 1;
414 }
415 p = str = g_malloc0(total_len);
416 for (i = 0; i < len; i++) {
417 int len = strlen(array[i]) + 1;
418 pstrcpy(p, len, array[i]);
419 p += len;
420 }
421
422 ret = qemu_fdt_setprop(fdt, node_path, prop, str, total_len);
423 g_free(str);
424 return ret;
425}
426
5a4348d1 427const void *qemu_fdt_getprop(void *fdt, const char *node_path,
78e24f23 428 const char *property, int *lenp, Error **errp)
f0aa713f
PM
429{
430 int len;
431 const void *r;
78e24f23 432
f0aa713f
PM
433 if (!lenp) {
434 lenp = &len;
435 }
436 r = fdt_getprop(fdt, findnode_nofail(fdt, node_path), property, lenp);
437 if (!r) {
78e24f23
EA
438 error_setg(errp, "%s: Couldn't get %s/%s: %s", __func__,
439 node_path, property, fdt_strerror(*lenp));
f0aa713f
PM
440 }
441 return r;
442}
443
5a4348d1 444uint32_t qemu_fdt_getprop_cell(void *fdt, const char *node_path,
58e71097 445 const char *property, int *lenp, Error **errp)
f0aa713f
PM
446{
447 int len;
58e71097
EA
448 const uint32_t *p;
449
450 if (!lenp) {
451 lenp = &len;
452 }
453 p = qemu_fdt_getprop(fdt, node_path, property, lenp, errp);
454 if (!p) {
455 return 0;
456 } else if (*lenp != 4) {
457 error_setg(errp, "%s: %s/%s not 4 bytes long (not a cell?)",
458 __func__, node_path, property);
459 *lenp = -EINVAL;
460 return 0;
f0aa713f
PM
461 }
462 return be32_to_cpu(*p);
463}
464
5a4348d1 465uint32_t qemu_fdt_get_phandle(void *fdt, const char *path)
7d5fd108
AG
466{
467 uint32_t r;
468
469 r = fdt_get_phandle(fdt, findnode_nofail(fdt, path));
909a196d 470 if (r == 0) {
508e221f
LL
471 error_report("%s: Couldn't get phandle for %s: %s", __func__,
472 path, fdt_strerror(r));
7d5fd108
AG
473 exit(1);
474 }
475
476 return r;
477}
478
5a4348d1
PC
479int qemu_fdt_setprop_phandle(void *fdt, const char *node_path,
480 const char *property,
481 const char *target_node_path)
8535ab12 482{
5a4348d1
PC
483 uint32_t phandle = qemu_fdt_get_phandle(fdt, target_node_path);
484 return qemu_fdt_setprop_cell(fdt, node_path, property, phandle);
8535ab12
AG
485}
486
5a4348d1 487uint32_t qemu_fdt_alloc_phandle(void *fdt)
3601b572 488{
4b1b1c89
AG
489 static int phandle = 0x0;
490
491 /*
492 * We need to find out if the user gave us special instruction at
cc47a16b 493 * which phandle id to start allocating phandles.
4b1b1c89
AG
494 */
495 if (!phandle) {
6cabe7fa 496 phandle = machine_phandle_start(current_machine);
4b1b1c89
AG
497 }
498
499 if (!phandle) {
500 /*
501 * None or invalid phandle given on the command line, so fall back to
502 * default starting point.
503 */
504 phandle = 0x8000;
505 }
3601b572
AG
506
507 return phandle++;
508}
509
5a4348d1 510int qemu_fdt_nop_node(void *fdt, const char *node_path)
d69a8e63 511{
ccbcfedd 512 int r;
d69a8e63 513
ccbcfedd
AG
514 r = fdt_nop_node(fdt, findnode_nofail(fdt, node_path));
515 if (r < 0) {
508e221f
LL
516 error_report("%s: Couldn't nop node %s: %s", __func__, node_path,
517 fdt_strerror(r));
ccbcfedd
AG
518 exit(1);
519 }
d69a8e63 520
ccbcfedd 521 return r;
d69a8e63 522}
80ad7816 523
5a4348d1 524int qemu_fdt_add_subnode(void *fdt, const char *name)
80ad7816 525{
80ad7816
AG
526 char *dupname = g_strdup(name);
527 char *basename = strrchr(dupname, '/');
528 int retval;
c640d088 529 int parent = 0;
80ad7816
AG
530
531 if (!basename) {
bff39b63 532 g_free(dupname);
80ad7816
AG
533 return -1;
534 }
535
536 basename[0] = '\0';
537 basename++;
538
c640d088
AG
539 if (dupname[0]) {
540 parent = findnode_nofail(fdt, dupname);
541 }
542
543 retval = fdt_add_subnode(fdt, parent, basename);
ccbcfedd 544 if (retval < 0) {
b863f0b7
YW
545 error_report("%s: Failed to create subnode %s: %s",
546 __func__, name, fdt_strerror(retval));
ccbcfedd 547 exit(1);
80ad7816
AG
548 }
549
80ad7816
AG
550 g_free(dupname);
551 return retval;
552}
71193433 553
b863f0b7
YW
554/*
555 * qemu_fdt_add_path: Like qemu_fdt_add_subnode(), but will add
556 * all missing subnodes from the given path.
557 */
558int qemu_fdt_add_path(void *fdt, const char *path)
559{
560 const char *name;
561 const char *p = path;
562 int namelen, retval;
563 int parent = 0;
564
565 if (path[0] != '/') {
566 return -1;
567 }
568
cfeeeb48 569 do {
b863f0b7
YW
570 name = p + 1;
571 p = strchr(name, '/');
572 namelen = p != NULL ? p - name : strlen(name);
573
574 retval = fdt_subnode_offset_namelen(fdt, parent, name, namelen);
575 if (retval < 0 && retval != -FDT_ERR_NOTFOUND) {
576 error_report("%s: Unexpected error in finding subnode %.*s: %s",
577 __func__, namelen, name, fdt_strerror(retval));
578 exit(1);
579 } else if (retval == -FDT_ERR_NOTFOUND) {
580 retval = fdt_add_subnode_namelen(fdt, parent, name, namelen);
581 if (retval < 0) {
582 error_report("%s: Failed to create subnode %.*s: %s",
583 __func__, namelen, name, fdt_strerror(retval));
584 exit(1);
585 }
586 }
587
588 parent = retval;
cfeeeb48 589 } while (p);
b863f0b7
YW
590
591 return retval;
592}
593
5a4348d1 594void qemu_fdt_dumpdtb(void *fdt, int size)
71193433 595{
f2ce39b4 596 const char *dumpdtb = current_machine->dumpdtb;
71193433 597
2ff3de68
MA
598 if (dumpdtb) {
599 /* Dump the dtb to a file and quit */
9f252c7c
LB
600 if (g_file_set_contents(dumpdtb, fdt, size, NULL)) {
601 info_report("dtb dumped to %s. Exiting.", dumpdtb);
602 exit(0);
603 }
604 error_report("%s: Failed dumping dtb to %s", __func__, dumpdtb);
605 exit(1);
2ff3de68 606 }
71193433 607}
97c38f8c 608
5a4348d1
PC
609int qemu_fdt_setprop_sized_cells_from_array(void *fdt,
610 const char *node_path,
611 const char *property,
612 int numvalues,
613 uint64_t *values)
97c38f8c
PM
614{
615 uint32_t *propcells;
616 uint64_t value;
617 int cellnum, vnum, ncells;
618 uint32_t hival;
2bf9febc 619 int ret;
97c38f8c
PM
620
621 propcells = g_new0(uint32_t, numvalues * 2);
622
623 cellnum = 0;
624 for (vnum = 0; vnum < numvalues; vnum++) {
625 ncells = values[vnum * 2];
626 if (ncells != 1 && ncells != 2) {
2bf9febc
SF
627 ret = -1;
628 goto out;
97c38f8c
PM
629 }
630 value = values[vnum * 2 + 1];
631 hival = cpu_to_be32(value >> 32);
632 if (ncells > 1) {
633 propcells[cellnum++] = hival;
634 } else if (hival != 0) {
2bf9febc
SF
635 ret = -1;
636 goto out;
97c38f8c
PM
637 }
638 propcells[cellnum++] = cpu_to_be32(value);
639 }
640
2bf9febc
SF
641 ret = qemu_fdt_setprop(fdt, node_path, property, propcells,
642 cellnum * sizeof(uint32_t));
643out:
644 g_free(propcells);
645 return ret;
97c38f8c 646}