2008-12-16 13:43:48 +03:00
|
|
|
/*
|
|
|
|
* Functions to help device tree manipulation using libfdt.
|
|
|
|
* It also provides functions to read entries from device tree proc
|
|
|
|
* interface.
|
|
|
|
*
|
|
|
|
* Copyright 2008 IBM Corporation.
|
|
|
|
* Authors: Jerone Young <jyoung5@us.ibm.com>
|
|
|
|
* Hollis Blanchard <hollisb@us.ibm.com>
|
|
|
|
*
|
|
|
|
* This work is licensed under the GNU GPL license version 2 or later.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2016-01-29 20:50:05 +03:00
|
|
|
#include "qemu/osdep.h"
|
2008-12-16 13:43:48 +03:00
|
|
|
|
2016-02-19 19:42:29 +03:00
|
|
|
#ifdef CONFIG_LINUX
|
|
|
|
#include <dirent.h>
|
|
|
|
#endif
|
|
|
|
|
include/qemu/osdep.h: Don't include qapi/error.h
Commit 57cb38b included qapi/error.h into qemu/osdep.h to get the
Error typedef. Since then, we've moved to include qemu/osdep.h
everywhere. Its file comment explains: "To avoid getting into
possible circular include dependencies, this file should not include
any other QEMU headers, with the exceptions of config-host.h,
compiler.h, os-posix.h and os-win32.h, all of which are doing a
similar job to this file and are under similar constraints."
qapi/error.h doesn't do a similar job, and it doesn't adhere to
similar constraints: it includes qapi-types.h. That's in excess of
100KiB of crap most .c files don't actually need.
Add the typedef to qemu/typedefs.h, and include that instead of
qapi/error.h. Include qapi/error.h in .c files that need it and don't
get it now. Include qapi-types.h in qom/object.h for uint16List.
Update scripts/clean-includes accordingly. Update it further to match
reality: replace config.h by config-target.h, add sysemu/os-posix.h,
sysemu/os-win32.h. Update the list of includes in the qemu/osdep.h
comment quoted above similarly.
This reduces the number of objects depending on qapi/error.h from "all
of them" to less than a third. Unfortunately, the number depending on
qapi-types.h shrinks only a little. More work is needed for that one.
Signed-off-by: Markus Armbruster <armbru@redhat.com>
[Fix compilation without the spice devel packages. - Paolo]
Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
2016-03-14 11:01:28 +03:00
|
|
|
#include "qapi/error.h"
|
2014-08-26 10:38:02 +04:00
|
|
|
#include "qemu/error-report.h"
|
2018-02-01 14:18:46 +03:00
|
|
|
#include "qemu/option.h"
|
2016-03-15 19:22:36 +03:00
|
|
|
#include "qemu/bswap.h"
|
2021-03-03 20:36:38 +03:00
|
|
|
#include "qemu/cutils.h"
|
2022-10-25 03:43:18 +03:00
|
|
|
#include "qemu/guest-random.h"
|
2012-12-17 21:20:04 +04:00
|
|
|
#include "sysemu/device_tree.h"
|
2009-09-22 21:51:36 +04:00
|
|
|
#include "hw/loader.h"
|
2015-02-04 18:43:53 +03:00
|
|
|
#include "hw/boards.h"
|
2012-12-17 21:20:00 +04:00
|
|
|
#include "qemu/config-file.h"
|
2022-09-26 20:38:40 +03:00
|
|
|
#include "qapi/qapi-commands-machine.h"
|
|
|
|
#include "qapi/qmp/qdict.h"
|
|
|
|
#include "monitor/hmp.h"
|
2008-12-16 13:43:48 +03:00
|
|
|
|
|
|
|
#include <libfdt.h>
|
|
|
|
|
2018-04-26 13:04:38 +03:00
|
|
|
#define FDT_MAX_SIZE 0x100000
|
2012-05-17 17:33:54 +04:00
|
|
|
|
|
|
|
void *create_device_tree(int *sizep)
|
|
|
|
{
|
|
|
|
void *fdt;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
*sizep = FDT_MAX_SIZE;
|
|
|
|
fdt = g_malloc0(FDT_MAX_SIZE);
|
|
|
|
ret = fdt_create(fdt, FDT_MAX_SIZE);
|
|
|
|
if (ret < 0) {
|
|
|
|
goto fail;
|
|
|
|
}
|
2013-11-22 21:17:09 +04:00
|
|
|
ret = fdt_finish_reservemap(fdt);
|
|
|
|
if (ret < 0) {
|
|
|
|
goto fail;
|
|
|
|
}
|
2012-05-17 17:33:54 +04:00
|
|
|
ret = fdt_begin_node(fdt, "");
|
|
|
|
if (ret < 0) {
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
ret = fdt_end_node(fdt);
|
|
|
|
if (ret < 0) {
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
ret = fdt_finish(fdt);
|
|
|
|
if (ret < 0) {
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
ret = fdt_open_into(fdt, fdt, *sizep);
|
|
|
|
if (ret) {
|
2022-01-16 14:46:49 +03:00
|
|
|
error_report("%s: Unable to copy device tree into memory: %s",
|
|
|
|
__func__, fdt_strerror(ret));
|
2012-05-17 17:33:54 +04:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return fdt;
|
|
|
|
fail:
|
2014-08-26 10:38:03 +04:00
|
|
|
error_report("%s Couldn't create dt: %s", __func__, fdt_strerror(ret));
|
2012-05-17 17:33:54 +04:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
2009-04-10 20:23:59 +04:00
|
|
|
void *load_device_tree(const char *filename_path, int *sizep)
|
2008-12-16 13:43:48 +03:00
|
|
|
{
|
2009-04-10 20:23:59 +04:00
|
|
|
int dt_size;
|
2008-12-16 13:43:48 +03:00
|
|
|
int dt_file_load_size;
|
|
|
|
int ret;
|
2009-04-10 20:23:59 +04:00
|
|
|
void *fdt = NULL;
|
2008-12-16 13:43:48 +03:00
|
|
|
|
2009-04-10 20:23:59 +04:00
|
|
|
*sizep = 0;
|
|
|
|
dt_size = get_image_size(filename_path);
|
|
|
|
if (dt_size < 0) {
|
2014-08-26 10:38:02 +04:00
|
|
|
error_report("Unable to get size of device tree file '%s'",
|
|
|
|
filename_path);
|
2008-12-16 13:43:48 +03:00
|
|
|
goto fail;
|
|
|
|
}
|
2019-04-09 20:40:18 +03:00
|
|
|
if (dt_size > INT_MAX / 2 - 10000) {
|
|
|
|
error_report("Device tree file '%s' is too large", filename_path);
|
|
|
|
goto fail;
|
|
|
|
}
|
2008-12-16 13:43:48 +03:00
|
|
|
|
2009-04-10 20:23:59 +04:00
|
|
|
/* Expand to 2x size to give enough room for manipulation. */
|
2011-07-23 12:54:11 +04:00
|
|
|
dt_size += 10000;
|
2009-04-10 20:23:59 +04:00
|
|
|
dt_size *= 2;
|
2008-12-16 13:43:48 +03:00
|
|
|
/* First allocate space in qemu for device tree */
|
2011-08-21 07:09:37 +04:00
|
|
|
fdt = g_malloc0(dt_size);
|
2008-12-16 13:43:48 +03:00
|
|
|
|
2018-12-14 16:30:52 +03:00
|
|
|
dt_file_load_size = load_image_size(filename_path, fdt, dt_size);
|
2009-04-10 20:23:59 +04:00
|
|
|
if (dt_file_load_size < 0) {
|
2014-08-26 10:38:02 +04:00
|
|
|
error_report("Unable to open device tree file '%s'",
|
|
|
|
filename_path);
|
2009-04-10 20:23:59 +04:00
|
|
|
goto fail;
|
|
|
|
}
|
2008-12-16 13:43:48 +03:00
|
|
|
|
2009-04-10 20:23:59 +04:00
|
|
|
ret = fdt_open_into(fdt, fdt, dt_size);
|
2008-12-16 13:43:48 +03:00
|
|
|
if (ret) {
|
2022-01-16 14:46:49 +03:00
|
|
|
error_report("%s: Unable to copy device tree into memory: %s",
|
|
|
|
__func__, fdt_strerror(ret));
|
2008-12-16 13:43:48 +03:00
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check sanity of device tree */
|
|
|
|
if (fdt_check_header(fdt)) {
|
2014-08-26 10:38:02 +04:00
|
|
|
error_report("Device tree file loaded into memory is invalid: %s",
|
|
|
|
filename_path);
|
2008-12-16 13:43:48 +03:00
|
|
|
goto fail;
|
|
|
|
}
|
2009-04-10 20:23:59 +04:00
|
|
|
*sizep = dt_size;
|
2008-12-16 13:43:48 +03:00
|
|
|
return fdt;
|
|
|
|
|
|
|
|
fail:
|
2011-08-21 07:09:37 +04:00
|
|
|
g_free(fdt);
|
2008-12-16 13:43:48 +03:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2016-02-19 19:42:29 +03:00
|
|
|
#ifdef CONFIG_LINUX
|
|
|
|
|
|
|
|
#define SYSFS_DT_BASEDIR "/proc/device-tree"
|
|
|
|
|
|
|
|
/**
|
|
|
|
* read_fstree: this function is inspired from dtc read_fstree
|
|
|
|
* @fdt: preallocated fdt blob buffer, to be populated
|
|
|
|
* @dirname: directory to scan under SYSFS_DT_BASEDIR
|
|
|
|
* the search is recursive and the tree is searched down to the
|
|
|
|
* leaves (property files).
|
|
|
|
*
|
|
|
|
* the function asserts in case of error
|
|
|
|
*/
|
|
|
|
static void read_fstree(void *fdt, const char *dirname)
|
|
|
|
{
|
|
|
|
DIR *d;
|
|
|
|
struct dirent *de;
|
|
|
|
struct stat st;
|
|
|
|
const char *root_dir = SYSFS_DT_BASEDIR;
|
|
|
|
const char *parent_node;
|
|
|
|
|
|
|
|
if (strstr(dirname, root_dir) != dirname) {
|
2018-06-29 17:11:00 +03:00
|
|
|
error_report("%s: %s must be searched within %s",
|
|
|
|
__func__, dirname, root_dir);
|
|
|
|
exit(1);
|
2016-02-19 19:42:29 +03:00
|
|
|
}
|
|
|
|
parent_node = &dirname[strlen(SYSFS_DT_BASEDIR)];
|
|
|
|
|
|
|
|
d = opendir(dirname);
|
|
|
|
if (!d) {
|
2018-06-29 17:11:00 +03:00
|
|
|
error_report("%s cannot open %s", __func__, dirname);
|
|
|
|
exit(1);
|
2016-02-19 19:42:29 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
while ((de = readdir(d)) != NULL) {
|
|
|
|
char *tmpnam;
|
|
|
|
|
|
|
|
if (!g_strcmp0(de->d_name, ".")
|
|
|
|
|| !g_strcmp0(de->d_name, "..")) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
tmpnam = g_strdup_printf("%s/%s", dirname, de->d_name);
|
|
|
|
|
|
|
|
if (lstat(tmpnam, &st) < 0) {
|
2018-06-29 17:11:00 +03:00
|
|
|
error_report("%s cannot lstat %s", __func__, tmpnam);
|
|
|
|
exit(1);
|
2016-02-19 19:42:29 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
if (S_ISREG(st.st_mode)) {
|
|
|
|
gchar *val;
|
|
|
|
gsize len;
|
|
|
|
|
|
|
|
if (!g_file_get_contents(tmpnam, &val, &len, NULL)) {
|
2018-06-29 17:11:00 +03:00
|
|
|
error_report("%s not able to extract info from %s",
|
|
|
|
__func__, tmpnam);
|
|
|
|
exit(1);
|
2016-02-19 19:42:29 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
if (strlen(parent_node) > 0) {
|
|
|
|
qemu_fdt_setprop(fdt, parent_node,
|
|
|
|
de->d_name, val, len);
|
|
|
|
} else {
|
|
|
|
qemu_fdt_setprop(fdt, "/", de->d_name, val, len);
|
|
|
|
}
|
|
|
|
g_free(val);
|
|
|
|
} else if (S_ISDIR(st.st_mode)) {
|
|
|
|
char *node_name;
|
|
|
|
|
|
|
|
node_name = g_strdup_printf("%s/%s",
|
|
|
|
parent_node, de->d_name);
|
|
|
|
qemu_fdt_add_subnode(fdt, node_name);
|
|
|
|
g_free(node_name);
|
|
|
|
read_fstree(fdt, tmpnam);
|
|
|
|
}
|
|
|
|
|
|
|
|
g_free(tmpnam);
|
|
|
|
}
|
|
|
|
|
|
|
|
closedir(d);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* load_device_tree_from_sysfs: extract the dt blob from host sysfs */
|
|
|
|
void *load_device_tree_from_sysfs(void)
|
|
|
|
{
|
|
|
|
void *host_fdt;
|
|
|
|
int host_fdt_size;
|
|
|
|
|
|
|
|
host_fdt = create_device_tree(&host_fdt_size);
|
|
|
|
read_fstree(host_fdt, SYSFS_DT_BASEDIR);
|
|
|
|
if (fdt_check_header(host_fdt)) {
|
2018-06-29 17:11:00 +03:00
|
|
|
error_report("%s host device tree extracted into memory is invalid",
|
|
|
|
__func__);
|
|
|
|
exit(1);
|
2016-02-19 19:42:29 +03:00
|
|
|
}
|
|
|
|
return host_fdt;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* CONFIG_LINUX */
|
|
|
|
|
2011-07-23 12:52:00 +04:00
|
|
|
static int findnode_nofail(void *fdt, const char *node_path)
|
2008-12-16 13:43:48 +03:00
|
|
|
{
|
|
|
|
int offset;
|
|
|
|
|
|
|
|
offset = fdt_path_offset(fdt, node_path);
|
2011-07-23 12:52:00 +04:00
|
|
|
if (offset < 0) {
|
2014-08-26 10:38:03 +04:00
|
|
|
error_report("%s Couldn't find node %s: %s", __func__, node_path,
|
|
|
|
fdt_strerror(offset));
|
2011-07-23 12:52:00 +04:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return offset;
|
|
|
|
}
|
|
|
|
|
2018-06-29 17:11:01 +03:00
|
|
|
char **qemu_fdt_node_unit_path(void *fdt, const char *name, Error **errp)
|
|
|
|
{
|
|
|
|
char *prefix = g_strdup_printf("%s@", name);
|
|
|
|
unsigned int path_len = 16, n = 0;
|
|
|
|
GSList *path_list = NULL, *iter;
|
|
|
|
const char *iter_name;
|
|
|
|
int offset, len, ret;
|
|
|
|
char **path_array;
|
|
|
|
|
|
|
|
offset = fdt_next_node(fdt, -1, NULL);
|
|
|
|
|
|
|
|
while (offset >= 0) {
|
|
|
|
iter_name = fdt_get_name(fdt, offset, &len);
|
|
|
|
if (!iter_name) {
|
|
|
|
offset = len;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!strcmp(iter_name, name) || g_str_has_prefix(iter_name, prefix)) {
|
|
|
|
char *path;
|
|
|
|
|
|
|
|
path = g_malloc(path_len);
|
|
|
|
while ((ret = fdt_get_path(fdt, offset, path, path_len))
|
|
|
|
== -FDT_ERR_NOSPACE) {
|
|
|
|
path_len += 16;
|
|
|
|
path = g_realloc(path, path_len);
|
|
|
|
}
|
|
|
|
path_list = g_slist_prepend(path_list, path);
|
|
|
|
n++;
|
|
|
|
}
|
|
|
|
offset = fdt_next_node(fdt, offset, NULL);
|
|
|
|
}
|
|
|
|
g_free(prefix);
|
|
|
|
|
|
|
|
if (offset < 0 && offset != -FDT_ERR_NOTFOUND) {
|
|
|
|
error_setg(errp, "%s: abort parsing dt for %s node units: %s",
|
|
|
|
__func__, name, fdt_strerror(offset));
|
|
|
|
for (iter = path_list; iter; iter = iter->next) {
|
|
|
|
g_free(iter->data);
|
|
|
|
}
|
|
|
|
g_slist_free(path_list);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
path_array = g_new(char *, n + 1);
|
|
|
|
path_array[n--] = NULL;
|
|
|
|
|
|
|
|
for (iter = path_list; iter; iter = iter->next) {
|
|
|
|
path_array[n--] = iter->data;
|
|
|
|
}
|
|
|
|
|
|
|
|
g_slist_free(path_list);
|
|
|
|
|
|
|
|
return path_array;
|
|
|
|
}
|
|
|
|
|
2020-04-23 15:11:12 +03:00
|
|
|
char **qemu_fdt_node_path(void *fdt, const char *name, const char *compat,
|
2016-02-19 19:42:30 +03:00
|
|
|
Error **errp)
|
|
|
|
{
|
|
|
|
int offset, len, ret;
|
|
|
|
const char *iter_name;
|
|
|
|
unsigned int path_len = 16, n = 0;
|
|
|
|
GSList *path_list = NULL, *iter;
|
|
|
|
char **path_array;
|
|
|
|
|
|
|
|
offset = fdt_node_offset_by_compatible(fdt, -1, compat);
|
|
|
|
|
|
|
|
while (offset >= 0) {
|
|
|
|
iter_name = fdt_get_name(fdt, offset, &len);
|
|
|
|
if (!iter_name) {
|
|
|
|
offset = len;
|
|
|
|
break;
|
|
|
|
}
|
2020-04-23 15:11:11 +03:00
|
|
|
if (!name || !strcmp(iter_name, name)) {
|
2016-02-19 19:42:30 +03:00
|
|
|
char *path;
|
|
|
|
|
|
|
|
path = g_malloc(path_len);
|
|
|
|
while ((ret = fdt_get_path(fdt, offset, path, path_len))
|
|
|
|
== -FDT_ERR_NOSPACE) {
|
|
|
|
path_len += 16;
|
|
|
|
path = g_realloc(path, path_len);
|
|
|
|
}
|
|
|
|
path_list = g_slist_prepend(path_list, path);
|
|
|
|
n++;
|
|
|
|
}
|
|
|
|
offset = fdt_node_offset_by_compatible(fdt, offset, compat);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (offset < 0 && offset != -FDT_ERR_NOTFOUND) {
|
|
|
|
error_setg(errp, "%s: abort parsing dt for %s/%s: %s",
|
|
|
|
__func__, name, compat, fdt_strerror(offset));
|
|
|
|
for (iter = path_list; iter; iter = iter->next) {
|
|
|
|
g_free(iter->data);
|
|
|
|
}
|
|
|
|
g_slist_free(path_list);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
path_array = g_new(char *, n + 1);
|
|
|
|
path_array[n--] = NULL;
|
|
|
|
|
|
|
|
for (iter = path_list; iter; iter = iter->next) {
|
|
|
|
path_array[n--] = iter->data;
|
|
|
|
}
|
|
|
|
|
|
|
|
g_slist_free(path_list);
|
|
|
|
|
|
|
|
return path_array;
|
|
|
|
}
|
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
int qemu_fdt_setprop(void *fdt, const char *node_path,
|
2013-11-11 12:15:21 +04:00
|
|
|
const char *property, const void *val, int size)
|
2011-07-23 12:52:00 +04:00
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
2013-11-11 12:15:21 +04:00
|
|
|
r = fdt_setprop(fdt, findnode_nofail(fdt, node_path), property, val, size);
|
2011-07-23 12:52:00 +04:00
|
|
|
if (r < 0) {
|
2014-08-26 10:38:03 +04:00
|
|
|
error_report("%s: Couldn't set %s/%s: %s", __func__, node_path,
|
|
|
|
property, fdt_strerror(r));
|
2011-07-23 12:52:00 +04:00
|
|
|
exit(1);
|
|
|
|
}
|
2008-12-16 13:43:48 +03:00
|
|
|
|
2011-07-23 12:52:00 +04:00
|
|
|
return r;
|
2008-12-16 13:43:48 +03:00
|
|
|
}
|
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
int qemu_fdt_setprop_cell(void *fdt, const char *node_path,
|
|
|
|
const char *property, uint32_t val)
|
2008-12-16 13:43:48 +03:00
|
|
|
{
|
2011-07-23 12:52:00 +04:00
|
|
|
int r;
|
2008-12-16 13:43:48 +03:00
|
|
|
|
2011-07-23 12:52:00 +04:00
|
|
|
r = fdt_setprop_cell(fdt, findnode_nofail(fdt, node_path), property, val);
|
|
|
|
if (r < 0) {
|
2014-08-26 10:38:03 +04:00
|
|
|
error_report("%s: Couldn't set %s/%s = %#08x: %s", __func__,
|
|
|
|
node_path, property, val, fdt_strerror(r));
|
2011-07-23 12:52:00 +04:00
|
|
|
exit(1);
|
|
|
|
}
|
2008-12-16 13:43:48 +03:00
|
|
|
|
2011-07-23 12:52:00 +04:00
|
|
|
return r;
|
2008-12-16 13:43:48 +03:00
|
|
|
}
|
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
int qemu_fdt_setprop_u64(void *fdt, const char *node_path,
|
|
|
|
const char *property, uint64_t val)
|
2012-05-18 03:53:01 +04:00
|
|
|
{
|
|
|
|
val = cpu_to_be64(val);
|
2013-11-11 12:14:41 +04:00
|
|
|
return qemu_fdt_setprop(fdt, node_path, property, &val, sizeof(val));
|
2012-05-18 03:53:01 +04:00
|
|
|
}
|
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
int qemu_fdt_setprop_string(void *fdt, const char *node_path,
|
|
|
|
const char *property, const char *string)
|
2008-12-16 13:43:48 +03:00
|
|
|
{
|
2011-07-23 12:52:00 +04:00
|
|
|
int r;
|
2008-12-16 13:43:48 +03:00
|
|
|
|
2011-07-23 12:52:00 +04:00
|
|
|
r = fdt_setprop_string(fdt, findnode_nofail(fdt, node_path), property, string);
|
|
|
|
if (r < 0) {
|
2014-08-26 10:38:03 +04:00
|
|
|
error_report("%s: Couldn't set %s/%s = %s: %s", __func__,
|
|
|
|
node_path, property, string, fdt_strerror(r));
|
2011-07-23 12:52:00 +04:00
|
|
|
exit(1);
|
|
|
|
}
|
2008-12-16 13:43:48 +03:00
|
|
|
|
2011-07-23 12:52:00 +04:00
|
|
|
return r;
|
2008-12-16 13:43:48 +03:00
|
|
|
}
|
2011-07-21 03:52:57 +04:00
|
|
|
|
2021-03-03 20:36:38 +03:00
|
|
|
/*
|
|
|
|
* libfdt doesn't allow us to add string arrays directly but they are
|
|
|
|
* test a series of null terminated strings with a length. We build
|
|
|
|
* the string up here so we can calculate the final length.
|
|
|
|
*/
|
|
|
|
int qemu_fdt_setprop_string_array(void *fdt, const char *node_path,
|
|
|
|
const char *prop, char **array, int len)
|
|
|
|
{
|
|
|
|
int ret, i, total_len = 0;
|
|
|
|
char *str, *p;
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
total_len += strlen(array[i]) + 1;
|
|
|
|
}
|
|
|
|
p = str = g_malloc0(total_len);
|
|
|
|
for (i = 0; i < len; i++) {
|
2023-09-25 07:30:23 +03:00
|
|
|
int offset = strlen(array[i]) + 1;
|
|
|
|
pstrcpy(p, offset, array[i]);
|
|
|
|
p += offset;
|
2021-03-03 20:36:38 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
ret = qemu_fdt_setprop(fdt, node_path, prop, str, total_len);
|
|
|
|
g_free(str);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
const void *qemu_fdt_getprop(void *fdt, const char *node_path,
|
2016-02-19 19:42:30 +03:00
|
|
|
const char *property, int *lenp, Error **errp)
|
2012-07-20 16:34:50 +04:00
|
|
|
{
|
|
|
|
int len;
|
|
|
|
const void *r;
|
2016-02-19 19:42:30 +03:00
|
|
|
|
2012-07-20 16:34:50 +04:00
|
|
|
if (!lenp) {
|
|
|
|
lenp = &len;
|
|
|
|
}
|
|
|
|
r = fdt_getprop(fdt, findnode_nofail(fdt, node_path), property, lenp);
|
|
|
|
if (!r) {
|
2016-02-19 19:42:30 +03:00
|
|
|
error_setg(errp, "%s: Couldn't get %s/%s: %s", __func__,
|
|
|
|
node_path, property, fdt_strerror(*lenp));
|
2012-07-20 16:34:50 +04:00
|
|
|
}
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
uint32_t qemu_fdt_getprop_cell(void *fdt, const char *node_path,
|
2016-02-19 19:42:30 +03:00
|
|
|
const char *property, int *lenp, Error **errp)
|
2012-07-20 16:34:50 +04:00
|
|
|
{
|
|
|
|
int len;
|
2016-02-19 19:42:30 +03:00
|
|
|
const uint32_t *p;
|
|
|
|
|
|
|
|
if (!lenp) {
|
|
|
|
lenp = &len;
|
|
|
|
}
|
|
|
|
p = qemu_fdt_getprop(fdt, node_path, property, lenp, errp);
|
|
|
|
if (!p) {
|
|
|
|
return 0;
|
|
|
|
} else if (*lenp != 4) {
|
|
|
|
error_setg(errp, "%s: %s/%s not 4 bytes long (not a cell?)",
|
|
|
|
__func__, node_path, property);
|
|
|
|
*lenp = -EINVAL;
|
|
|
|
return 0;
|
2012-07-20 16:34:50 +04:00
|
|
|
}
|
|
|
|
return be32_to_cpu(*p);
|
|
|
|
}
|
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
uint32_t qemu_fdt_get_phandle(void *fdt, const char *path)
|
2012-05-17 17:23:39 +04:00
|
|
|
{
|
|
|
|
uint32_t r;
|
|
|
|
|
|
|
|
r = fdt_get_phandle(fdt, findnode_nofail(fdt, path));
|
2013-06-11 00:12:25 +04:00
|
|
|
if (r == 0) {
|
2014-08-26 10:38:03 +04:00
|
|
|
error_report("%s: Couldn't get phandle for %s: %s", __func__,
|
|
|
|
path, fdt_strerror(r));
|
2012-05-17 17:23:39 +04:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
int qemu_fdt_setprop_phandle(void *fdt, const char *node_path,
|
|
|
|
const char *property,
|
|
|
|
const char *target_node_path)
|
2012-05-17 16:11:52 +04:00
|
|
|
{
|
2013-11-11 12:14:41 +04:00
|
|
|
uint32_t phandle = qemu_fdt_get_phandle(fdt, target_node_path);
|
|
|
|
return qemu_fdt_setprop_cell(fdt, node_path, property, phandle);
|
2012-05-17 16:11:52 +04:00
|
|
|
}
|
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
uint32_t qemu_fdt_alloc_phandle(void *fdt)
|
2012-05-17 18:58:55 +04:00
|
|
|
{
|
2012-06-06 03:01:23 +04:00
|
|
|
static int phandle = 0x0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We need to find out if the user gave us special instruction at
|
2015-07-24 11:18:13 +03:00
|
|
|
* which phandle id to start allocating phandles.
|
2012-06-06 03:01:23 +04:00
|
|
|
*/
|
|
|
|
if (!phandle) {
|
2015-02-04 18:43:53 +03:00
|
|
|
phandle = machine_phandle_start(current_machine);
|
2012-06-06 03:01:23 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!phandle) {
|
|
|
|
/*
|
|
|
|
* None or invalid phandle given on the command line, so fall back to
|
|
|
|
* default starting point.
|
|
|
|
*/
|
|
|
|
phandle = 0x8000;
|
|
|
|
}
|
2012-05-17 18:58:55 +04:00
|
|
|
|
|
|
|
return phandle++;
|
|
|
|
}
|
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
int qemu_fdt_nop_node(void *fdt, const char *node_path)
|
2011-07-21 03:52:57 +04:00
|
|
|
{
|
2011-07-23 12:52:00 +04:00
|
|
|
int r;
|
2011-07-21 03:52:57 +04:00
|
|
|
|
2011-07-23 12:52:00 +04:00
|
|
|
r = fdt_nop_node(fdt, findnode_nofail(fdt, node_path));
|
|
|
|
if (r < 0) {
|
2014-08-26 10:38:03 +04:00
|
|
|
error_report("%s: Couldn't nop node %s: %s", __func__, node_path,
|
|
|
|
fdt_strerror(r));
|
2011-07-23 12:52:00 +04:00
|
|
|
exit(1);
|
|
|
|
}
|
2011-07-21 03:52:57 +04:00
|
|
|
|
2011-07-23 12:52:00 +04:00
|
|
|
return r;
|
2011-07-21 03:52:57 +04:00
|
|
|
}
|
2011-07-22 15:55:37 +04:00
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
int qemu_fdt_add_subnode(void *fdt, const char *name)
|
2011-07-22 15:55:37 +04:00
|
|
|
{
|
|
|
|
char *dupname = g_strdup(name);
|
|
|
|
char *basename = strrchr(dupname, '/');
|
|
|
|
int retval;
|
2012-05-17 13:40:42 +04:00
|
|
|
int parent = 0;
|
2011-07-22 15:55:37 +04:00
|
|
|
|
|
|
|
if (!basename) {
|
2011-10-18 00:12:09 +04:00
|
|
|
g_free(dupname);
|
2011-07-22 15:55:37 +04:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
basename[0] = '\0';
|
|
|
|
basename++;
|
|
|
|
|
2012-05-17 13:40:42 +04:00
|
|
|
if (dupname[0]) {
|
|
|
|
parent = findnode_nofail(fdt, dupname);
|
|
|
|
}
|
|
|
|
|
|
|
|
retval = fdt_add_subnode(fdt, parent, basename);
|
2011-07-23 12:52:00 +04:00
|
|
|
if (retval < 0) {
|
2021-10-20 17:21:19 +03:00
|
|
|
error_report("%s: Failed to create subnode %s: %s",
|
|
|
|
__func__, name, fdt_strerror(retval));
|
2011-07-23 12:52:00 +04:00
|
|
|
exit(1);
|
2011-07-22 15:55:37 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
g_free(dupname);
|
|
|
|
return retval;
|
|
|
|
}
|
2012-09-23 10:37:59 +04:00
|
|
|
|
2021-10-20 17:21:19 +03:00
|
|
|
/*
|
|
|
|
* qemu_fdt_add_path: Like qemu_fdt_add_subnode(), but will add
|
|
|
|
* all missing subnodes from the given path.
|
|
|
|
*/
|
|
|
|
int qemu_fdt_add_path(void *fdt, const char *path)
|
|
|
|
{
|
|
|
|
const char *name;
|
|
|
|
int namelen, retval;
|
|
|
|
int parent = 0;
|
|
|
|
|
|
|
|
if (path[0] != '/') {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2022-01-07 16:38:44 +03:00
|
|
|
do {
|
2022-01-11 06:27:58 +03:00
|
|
|
name = path + 1;
|
|
|
|
path = strchr(name, '/');
|
|
|
|
namelen = path != NULL ? path - name : strlen(name);
|
2021-10-20 17:21:19 +03:00
|
|
|
|
|
|
|
retval = fdt_subnode_offset_namelen(fdt, parent, name, namelen);
|
|
|
|
if (retval < 0 && retval != -FDT_ERR_NOTFOUND) {
|
|
|
|
error_report("%s: Unexpected error in finding subnode %.*s: %s",
|
|
|
|
__func__, namelen, name, fdt_strerror(retval));
|
|
|
|
exit(1);
|
|
|
|
} else if (retval == -FDT_ERR_NOTFOUND) {
|
|
|
|
retval = fdt_add_subnode_namelen(fdt, parent, name, namelen);
|
|
|
|
if (retval < 0) {
|
|
|
|
error_report("%s: Failed to create subnode %.*s: %s",
|
|
|
|
__func__, namelen, name, fdt_strerror(retval));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
parent = retval;
|
2022-01-11 06:27:58 +03:00
|
|
|
} while (path);
|
2021-10-20 17:21:19 +03:00
|
|
|
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
void qemu_fdt_dumpdtb(void *fdt, int size)
|
2012-09-23 10:37:59 +04:00
|
|
|
{
|
2020-11-02 17:44:36 +03:00
|
|
|
const char *dumpdtb = current_machine->dumpdtb;
|
2012-09-23 10:37:59 +04:00
|
|
|
|
2013-07-04 17:09:22 +04:00
|
|
|
if (dumpdtb) {
|
|
|
|
/* Dump the dtb to a file and quit */
|
2020-03-19 07:03:26 +03:00
|
|
|
if (g_file_set_contents(dumpdtb, fdt, size, NULL)) {
|
|
|
|
info_report("dtb dumped to %s. Exiting.", dumpdtb);
|
|
|
|
exit(0);
|
|
|
|
}
|
|
|
|
error_report("%s: Failed dumping dtb to %s", __func__, dumpdtb);
|
|
|
|
exit(1);
|
2013-07-04 17:09:22 +04:00
|
|
|
}
|
2012-09-23 10:37:59 +04:00
|
|
|
}
|
2013-07-16 16:25:05 +04:00
|
|
|
|
2013-11-11 12:14:41 +04:00
|
|
|
int qemu_fdt_setprop_sized_cells_from_array(void *fdt,
|
|
|
|
const char *node_path,
|
|
|
|
const char *property,
|
|
|
|
int numvalues,
|
|
|
|
uint64_t *values)
|
2013-07-16 16:25:05 +04:00
|
|
|
{
|
|
|
|
uint32_t *propcells;
|
|
|
|
uint64_t value;
|
|
|
|
int cellnum, vnum, ncells;
|
|
|
|
uint32_t hival;
|
2014-12-11 18:45:05 +03:00
|
|
|
int ret;
|
2013-07-16 16:25:05 +04:00
|
|
|
|
|
|
|
propcells = g_new0(uint32_t, numvalues * 2);
|
|
|
|
|
|
|
|
cellnum = 0;
|
|
|
|
for (vnum = 0; vnum < numvalues; vnum++) {
|
|
|
|
ncells = values[vnum * 2];
|
|
|
|
if (ncells != 1 && ncells != 2) {
|
2014-12-11 18:45:05 +03:00
|
|
|
ret = -1;
|
|
|
|
goto out;
|
2013-07-16 16:25:05 +04:00
|
|
|
}
|
|
|
|
value = values[vnum * 2 + 1];
|
|
|
|
hival = cpu_to_be32(value >> 32);
|
|
|
|
if (ncells > 1) {
|
|
|
|
propcells[cellnum++] = hival;
|
|
|
|
} else if (hival != 0) {
|
2014-12-11 18:45:05 +03:00
|
|
|
ret = -1;
|
|
|
|
goto out;
|
2013-07-16 16:25:05 +04:00
|
|
|
}
|
|
|
|
propcells[cellnum++] = cpu_to_be32(value);
|
|
|
|
}
|
|
|
|
|
2014-12-11 18:45:05 +03:00
|
|
|
ret = qemu_fdt_setprop(fdt, node_path, property, propcells,
|
|
|
|
cellnum * sizeof(uint32_t));
|
|
|
|
out:
|
|
|
|
g_free(propcells);
|
|
|
|
return ret;
|
2013-07-16 16:25:05 +04:00
|
|
|
}
|
2022-09-26 20:38:40 +03:00
|
|
|
|
|
|
|
void qmp_dumpdtb(const char *filename, Error **errp)
|
|
|
|
{
|
|
|
|
g_autoptr(GError) err = NULL;
|
|
|
|
uint32_t size;
|
|
|
|
|
|
|
|
if (!current_machine->fdt) {
|
|
|
|
error_setg(errp, "This machine doesn't have a FDT");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
size = fdt_totalsize(current_machine->fdt);
|
|
|
|
|
|
|
|
g_assert(size > 0);
|
|
|
|
|
|
|
|
if (!g_file_set_contents(filename, current_machine->fdt, size, &err)) {
|
|
|
|
error_setg(errp, "Error saving FDT to file %s: %s",
|
|
|
|
filename, err->message);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-10-25 03:43:18 +03:00
|
|
|
void qemu_fdt_randomize_seeds(void *fdt)
|
|
|
|
{
|
|
|
|
int noffset, poffset, len;
|
|
|
|
const char *name;
|
|
|
|
uint8_t *data;
|
|
|
|
|
|
|
|
for (noffset = fdt_next_node(fdt, 0, NULL);
|
|
|
|
noffset >= 0;
|
|
|
|
noffset = fdt_next_node(fdt, noffset, NULL)) {
|
|
|
|
for (poffset = fdt_first_property_offset(fdt, noffset);
|
|
|
|
poffset >= 0;
|
|
|
|
poffset = fdt_next_property_offset(fdt, poffset)) {
|
|
|
|
data = (uint8_t *)fdt_getprop_by_offset(fdt, poffset, &name, &len);
|
|
|
|
if (!data || strcmp(name, "rng-seed"))
|
|
|
|
continue;
|
|
|
|
qemu_guest_getrandom_nofail(data, len);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|