2018-05-06 21:58:06 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0+
|
2011-10-24 19:15:32 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2011 The Chromium OS Authors.
|
|
|
|
*/
|
|
|
|
|
2014-03-03 11:19:30 +00:00
|
|
|
#ifndef USE_HOSTCC
|
2011-10-24 19:15:32 +00:00
|
|
|
#include <common.h>
|
2017-09-15 10:57:31 +00:00
|
|
|
#include <boot_fit.h>
|
2015-11-29 20:17:54 +00:00
|
|
|
#include <dm.h>
|
2019-12-28 17:45:07 +00:00
|
|
|
#include <hang.h>
|
2019-12-28 17:45:05 +00:00
|
|
|
#include <init.h>
|
2020-05-10 17:40:05 +00:00
|
|
|
#include <log.h>
|
2020-02-03 14:36:16 +00:00
|
|
|
#include <malloc.h>
|
2020-05-10 17:39:56 +00:00
|
|
|
#include <net.h>
|
2017-09-15 10:57:31 +00:00
|
|
|
#include <dm/of_extra.h>
|
2019-08-01 15:46:48 +00:00
|
|
|
#include <env.h>
|
2014-07-23 12:55:09 +00:00
|
|
|
#include <errno.h>
|
2011-10-24 19:15:32 +00:00
|
|
|
#include <fdtdec.h>
|
2017-09-15 10:57:31 +00:00
|
|
|
#include <fdt_support.h>
|
2019-08-01 15:46:36 +00:00
|
|
|
#include <gzip.h>
|
2018-11-18 16:58:50 +00:00
|
|
|
#include <mapmem.h>
|
2018-03-04 16:20:11 +00:00
|
|
|
#include <linux/libfdt.h>
|
2017-09-15 10:57:31 +00:00
|
|
|
#include <serial.h>
|
2020-10-31 03:38:53 +00:00
|
|
|
#include <asm/global_data.h>
|
2015-02-28 05:06:34 +00:00
|
|
|
#include <asm/sections.h>
|
2014-07-23 12:55:09 +00:00
|
|
|
#include <linux/ctype.h>
|
2017-09-15 10:57:32 +00:00
|
|
|
#include <linux/lzo.h>
|
2020-07-10 11:34:44 +00:00
|
|
|
#include <linux/ioport.h>
|
2011-10-24 19:15:32 +00:00
|
|
|
|
|
|
|
DECLARE_GLOBAL_DATA_PTR;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Here are the type we know about. One day we might allow drivers to
|
|
|
|
* register. For now we just put them here. The COMPAT macro allows us to
|
|
|
|
* turn this into a sparse list later, and keeps the ID with the name.
|
2016-06-19 23:33:13 +00:00
|
|
|
*
|
|
|
|
* NOTE: This list is basically a TODO list for things that need to be
|
|
|
|
* converted to driver model. So don't add new things here unless there is a
|
|
|
|
* good reason why driver-model conversion is infeasible. Examples include
|
|
|
|
* things which are used before driver model is available.
|
2011-10-24 19:15:32 +00:00
|
|
|
*/
|
|
|
|
#define COMPAT(id, name) name
|
|
|
|
static const char * const compat_names[COMPAT_COUNT] = {
|
2012-02-27 10:52:34 +00:00
|
|
|
COMPAT(UNKNOWN, "<none>"),
|
2012-04-02 13:18:52 +00:00
|
|
|
COMPAT(NVIDIA_TEGRA20_EMC, "nvidia,tegra20-emc"),
|
|
|
|
COMPAT(NVIDIA_TEGRA20_EMC_TABLE, "nvidia,tegra20-emc-table"),
|
2012-07-29 20:53:29 +00:00
|
|
|
COMPAT(NVIDIA_TEGRA20_NAND, "nvidia,tegra20-nand"),
|
2014-12-10 05:25:09 +00:00
|
|
|
COMPAT(NVIDIA_TEGRA124_XUSB_PADCTL, "nvidia,tegra124-xusb-padctl"),
|
2015-03-04 23:36:00 +00:00
|
|
|
COMPAT(NVIDIA_TEGRA210_XUSB_PADCTL, "nvidia,tegra210-xusb-padctl"),
|
2012-12-11 00:52:46 +00:00
|
|
|
COMPAT(SMSC_LAN9215, "smsc,lan9215"),
|
|
|
|
COMPAT(SAMSUNG_EXYNOS5_SROMC, "samsung,exynos-sromc"),
|
2013-01-07 23:35:05 +00:00
|
|
|
COMPAT(SAMSUNG_EXYNOS_USB_PHY, "samsung,exynos-usb-phy"),
|
2013-09-14 08:32:48 +00:00
|
|
|
COMPAT(SAMSUNG_EXYNOS5_USB3_PHY, "samsung,exynos5250-usb3-phy"),
|
2013-02-25 01:13:01 +00:00
|
|
|
COMPAT(SAMSUNG_EXYNOS_TMU, "samsung,exynos-tmu"),
|
2014-03-07 13:59:39 +00:00
|
|
|
COMPAT(SAMSUNG_EXYNOS_MIPI_DSI, "samsung,exynos-mipi-dsi"),
|
2014-05-16 04:59:51 +00:00
|
|
|
COMPAT(SAMSUNG_EXYNOS_DWMMC, "samsung,exynos-dwmmc"),
|
2019-02-10 10:16:21 +00:00
|
|
|
COMPAT(GENERIC_SPI_FLASH, "jedec,spi-nor"),
|
2014-09-05 11:23:33 +00:00
|
|
|
COMPAT(SAMSUNG_EXYNOS_SYSMMU, "samsung,sysmmu-v3.3"),
|
2014-11-13 05:42:21 +00:00
|
|
|
COMPAT(INTEL_MICROCODE, "intel,microcode"),
|
2015-02-05 15:42:26 +00:00
|
|
|
COMPAT(INTEL_QRK_MRC, "intel,quark-mrc"),
|
2015-07-25 17:33:56 +00:00
|
|
|
COMPAT(ALTERA_SOCFPGA_DWMAC, "altr,socfpga-stmmac"),
|
2015-07-25 08:48:14 +00:00
|
|
|
COMPAT(ALTERA_SOCFPGA_DWMMC, "altr,socfpga-dw-mshc"),
|
2015-12-05 18:28:44 +00:00
|
|
|
COMPAT(ALTERA_SOCFPGA_DWC2USB, "snps,dwc2"),
|
2016-06-19 23:33:14 +00:00
|
|
|
COMPAT(INTEL_BAYTRAIL_FSP, "intel,baytrail-fsp"),
|
|
|
|
COMPAT(INTEL_BAYTRAIL_FSP_MDP, "intel,baytrail-fsp-mdp"),
|
|
|
|
COMPAT(INTEL_IVYBRIDGE_FSP, "intel,ivybridge-fsp"),
|
2016-06-15 19:09:23 +00:00
|
|
|
COMPAT(COMPAT_SUNXI_NAND, "allwinner,sun4i-a10-nand"),
|
2017-04-05 09:32:47 +00:00
|
|
|
COMPAT(ALTERA_SOCFPGA_CLK, "altr,clk-mgr"),
|
|
|
|
COMPAT(ALTERA_SOCFPGA_PINCTRL_SINGLE, "pinctrl-single"),
|
|
|
|
COMPAT(ALTERA_SOCFPGA_H2F_BRG, "altr,socfpga-hps2fpga-bridge"),
|
|
|
|
COMPAT(ALTERA_SOCFPGA_LWH2F_BRG, "altr,socfpga-lwhps2fpga-bridge"),
|
|
|
|
COMPAT(ALTERA_SOCFPGA_F2H_BRG, "altr,socfpga-fpga2hps-bridge"),
|
|
|
|
COMPAT(ALTERA_SOCFPGA_F2SDR0, "altr,socfpga-fpga2sdram0-bridge"),
|
|
|
|
COMPAT(ALTERA_SOCFPGA_F2SDR1, "altr,socfpga-fpga2sdram1-bridge"),
|
|
|
|
COMPAT(ALTERA_SOCFPGA_F2SDR2, "altr,socfpga-fpga2sdram2-bridge"),
|
2017-09-25 08:40:03 +00:00
|
|
|
COMPAT(ALTERA_SOCFPGA_FPGA0, "altr,socfpga-a10-fpga-mgr"),
|
|
|
|
COMPAT(ALTERA_SOCFPGA_NOC, "altr,socfpga-a10-noc"),
|
2018-05-12 09:56:10 +00:00
|
|
|
COMPAT(ALTERA_SOCFPGA_CLK_INIT, "altr,socfpga-a10-clk-init")
|
2011-10-24 19:15:32 +00:00
|
|
|
};
|
|
|
|
|
2012-01-17 08:20:50 +00:00
|
|
|
const char *fdtdec_get_compatible(enum fdt_compat_id id)
|
|
|
|
{
|
|
|
|
/* We allow reading of the 'unknown' ID for testing purposes */
|
|
|
|
assert(id >= 0 && id < COMPAT_COUNT);
|
|
|
|
return compat_names[id];
|
|
|
|
}
|
|
|
|
|
2015-08-06 21:31:02 +00:00
|
|
|
fdt_addr_t fdtdec_get_addr_size_fixed(const void *blob, int node,
|
2018-01-15 10:07:35 +00:00
|
|
|
const char *prop_name, int index, int na,
|
|
|
|
int ns, fdt_size_t *sizep,
|
|
|
|
bool translate)
|
2011-10-24 19:15:32 +00:00
|
|
|
{
|
2015-08-06 21:31:02 +00:00
|
|
|
const fdt32_t *prop, *prop_end;
|
|
|
|
const fdt32_t *prop_addr, *prop_size, *prop_after_size;
|
2015-08-03 00:13:50 +00:00
|
|
|
int len;
|
2015-08-06 21:31:02 +00:00
|
|
|
fdt_addr_t addr;
|
2011-10-24 19:15:32 +00:00
|
|
|
|
2012-07-12 05:25:01 +00:00
|
|
|
debug("%s: %s: ", __func__, prop_name);
|
2015-08-06 21:31:02 +00:00
|
|
|
|
|
|
|
prop = fdt_getprop(blob, node, prop_name, &len);
|
|
|
|
if (!prop) {
|
|
|
|
debug("(not found)\n");
|
|
|
|
return FDT_ADDR_T_NONE;
|
|
|
|
}
|
|
|
|
prop_end = prop + (len / sizeof(*prop));
|
|
|
|
|
|
|
|
prop_addr = prop + (index * (na + ns));
|
|
|
|
prop_size = prop_addr + na;
|
|
|
|
prop_after_size = prop_size + ns;
|
|
|
|
if (prop_after_size > prop_end) {
|
|
|
|
debug("(not enough data: expected >= %d cells, got %d cells)\n",
|
|
|
|
(u32)(prop_after_size - prop), ((u32)(prop_end - prop)));
|
|
|
|
return FDT_ADDR_T_NONE;
|
|
|
|
}
|
|
|
|
|
2017-03-20 04:34:38 +00:00
|
|
|
#if CONFIG_IS_ENABLED(OF_TRANSLATE)
|
2016-08-05 15:47:51 +00:00
|
|
|
if (translate)
|
|
|
|
addr = fdt_translate_address(blob, node, prop_addr);
|
|
|
|
else
|
|
|
|
#endif
|
|
|
|
addr = fdtdec_get_number(prop_addr, na);
|
2015-08-06 21:31:02 +00:00
|
|
|
|
|
|
|
if (sizep) {
|
|
|
|
*sizep = fdtdec_get_number(prop_size, ns);
|
2016-02-29 22:25:37 +00:00
|
|
|
debug("addr=%08llx, size=%llx\n", (unsigned long long)addr,
|
|
|
|
(unsigned long long)*sizep);
|
2015-08-06 21:31:02 +00:00
|
|
|
} else {
|
2016-02-29 22:25:37 +00:00
|
|
|
debug("addr=%08llx\n", (unsigned long long)addr);
|
2015-08-06 21:31:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return addr;
|
|
|
|
}
|
|
|
|
|
|
|
|
fdt_addr_t fdtdec_get_addr_size_auto_parent(const void *blob, int parent,
|
2018-01-15 10:07:35 +00:00
|
|
|
int node, const char *prop_name,
|
|
|
|
int index, fdt_size_t *sizep,
|
|
|
|
bool translate)
|
2015-08-06 21:31:02 +00:00
|
|
|
{
|
|
|
|
int na, ns;
|
|
|
|
|
|
|
|
debug("%s: ", __func__);
|
|
|
|
|
|
|
|
na = fdt_address_cells(blob, parent);
|
|
|
|
if (na < 1) {
|
|
|
|
debug("(bad #address-cells)\n");
|
|
|
|
return FDT_ADDR_T_NONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
ns = fdt_size_cells(blob, parent);
|
fdtdec: fix parsing 'reg' property with zero value in '#size-cells'
After rework of lib/fdtdec.c by:
commit: 02464e3 fdt: add new fdt address parsing functions
the function fdtdec_get_addr() doesn't work as previous,
because the implementation assumes that properties '#address-cells'
and '#size-cells' are equal to 1, which can be not true sometimes.
The new API introduced fdtdec_get_addr_size_auto_parent() for the 'reg'
property parsing, but the implementation assumes, that #size-cells
can't be less than 1.
This causes that the following children's 'reg' property can't be reached:
parent@0x0 {
#address-cells = <1>;
#size-cells = <0>;
children@0x100 {
reg = < 0x100 >;
};
};
Change the condition value from '1' to '0', which allows parsing property
with at least zero #size-cells, fixes the issue.
Now, fdtdec_get_addr_size_auto_parent() works properly.
Tested on: Odroid U3/X2, Trats, Trats2, Odroid XU3, Snow (by Simon).
Signed-off-by: Przemyslaw Marczak <p.marczak@samsung.com>
Acked-by: Stephen Warren <swarren@nvidia.com>
Acked-by: Simon Glass <sjg@chromium.org>
Tested-by: Simon Glass <sjg@chromium.org>
2015-09-30 11:14:50 +00:00
|
|
|
if (ns < 0) {
|
2015-08-06 21:31:02 +00:00
|
|
|
debug("(bad #size-cells)\n");
|
|
|
|
return FDT_ADDR_T_NONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
debug("na=%d, ns=%d, ", na, ns);
|
|
|
|
|
|
|
|
return fdtdec_get_addr_size_fixed(blob, node, prop_name, index, na,
|
2016-08-05 15:47:51 +00:00
|
|
|
ns, sizep, translate);
|
2015-08-06 21:31:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
fdt_addr_t fdtdec_get_addr_size_auto_noparent(const void *blob, int node,
|
2018-01-15 10:07:35 +00:00
|
|
|
const char *prop_name, int index,
|
|
|
|
fdt_size_t *sizep,
|
|
|
|
bool translate)
|
2015-08-06 21:31:02 +00:00
|
|
|
{
|
|
|
|
int parent;
|
|
|
|
|
|
|
|
debug("%s: ", __func__);
|
|
|
|
|
|
|
|
parent = fdt_parent_offset(blob, node);
|
|
|
|
if (parent < 0) {
|
|
|
|
debug("(no parent found)\n");
|
|
|
|
return FDT_ADDR_T_NONE;
|
2015-07-23 16:51:30 +00:00
|
|
|
}
|
2015-08-06 21:31:02 +00:00
|
|
|
|
|
|
|
return fdtdec_get_addr_size_auto_parent(blob, parent, node, prop_name,
|
2016-08-05 15:47:51 +00:00
|
|
|
index, sizep, translate);
|
2015-08-06 21:31:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
fdt_addr_t fdtdec_get_addr_size(const void *blob, int node,
|
2018-01-15 10:07:35 +00:00
|
|
|
const char *prop_name, fdt_size_t *sizep)
|
2015-08-06 21:31:02 +00:00
|
|
|
{
|
fdt: fix fdtdec_get_addr_size not to require any size cells
fdtdec_get_addr_size() may be used in two cases:
a) With sizep supplied, in which case both an address and a size are
parsed from DT. In this case, the DT property must be large enough to
contain both values.
b) With sizep NULL, in which case only an address is parsed from DT.
In this case, the DT property only need be large enough to contain this
address value. Commit 02464e386bb5 "fdt: add new fdt address parsing
functions" broke this relaxed checking, and required the DT property to
contain both an address and a size value in all cases.
Fix fdtdec_get_addr_size() to vary ns based on whether the size value
is being parsed from the DT or not. This is safe since the function only
parses the first entry in the property, so the overall value of (na + ns)
need not be accurate, since it is never used to step through the property
data to find other entries. Besides, this fixed behaviour essentially
matches the original behaviour before the patch this patch fixes. (The
original code validated that the property was exactly the length of
either na or (na + ns), whereas the current code only validates that the
property is at least that long. For non-failure cases, the two behaviours
are identical).
Cc: Przemyslaw Marczak <p.marczak@samsung.com>
Cc: Simon Glass <sjg@chromium.org>
Cc: Thierry Reding <treding@nvidia.com>
Cc: Bin Meng <bmeng.cn@gmail.com>
Cc: Michal Suchanek <hramrach@gmail.com>
Fixes: 02464e386bb5 ("fdt: add new fdt address parsing functions")
Reported-by: Przemyslaw Marczak <p.marczak@samsung.com>
Signed-off-by: Stephen Warren <swarren@nvidia.com>
Tested-by: Przemyslaw Marczak <p.marczak@samsung.com>
Acked-by: Simon Glass <sjg@chromium.org>
2015-09-25 16:11:41 +00:00
|
|
|
int ns = sizep ? (sizeof(fdt_size_t) / sizeof(fdt32_t)) : 0;
|
|
|
|
|
2015-08-06 21:31:02 +00:00
|
|
|
return fdtdec_get_addr_size_fixed(blob, node, prop_name, 0,
|
|
|
|
sizeof(fdt_addr_t) / sizeof(fdt32_t),
|
2016-08-05 15:47:51 +00:00
|
|
|
ns, sizep, false);
|
2011-10-24 19:15:32 +00:00
|
|
|
}
|
|
|
|
|
2018-01-15 10:07:35 +00:00
|
|
|
fdt_addr_t fdtdec_get_addr(const void *blob, int node, const char *prop_name)
|
2013-03-19 04:58:51 +00:00
|
|
|
{
|
|
|
|
return fdtdec_get_addr_size(blob, node, prop_name, NULL);
|
|
|
|
}
|
|
|
|
|
2018-12-06 10:10:08 +00:00
|
|
|
#if CONFIG_IS_ENABLED(PCI) && defined(CONFIG_DM_PCI)
|
2014-12-31 08:05:11 +00:00
|
|
|
int fdtdec_get_pci_vendev(const void *blob, int node, u16 *vendor, u16 *device)
|
|
|
|
{
|
|
|
|
const char *list, *end;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
list = fdt_getprop(blob, node, "compatible", &len);
|
|
|
|
if (!list)
|
|
|
|
return -ENOENT;
|
|
|
|
|
|
|
|
end = list + len;
|
|
|
|
while (list < end) {
|
|
|
|
len = strlen(list);
|
|
|
|
if (len >= strlen("pciVVVV,DDDD")) {
|
2018-01-15 10:07:36 +00:00
|
|
|
char *s = strstr(list, "pci");
|
2014-12-31 08:05:11 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* check if the string is something like pciVVVV,DDDD.RR
|
|
|
|
* or just pciVVVV,DDDD
|
|
|
|
*/
|
|
|
|
if (s && s[7] == ',' &&
|
|
|
|
(s[12] == '.' || s[12] == 0)) {
|
|
|
|
s += 3;
|
|
|
|
*vendor = simple_strtol(s, NULL, 16);
|
|
|
|
|
|
|
|
s += 5;
|
|
|
|
*device = simple_strtol(s, NULL, 16);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
2015-08-20 13:40:25 +00:00
|
|
|
list += (len + 1);
|
2014-12-31 08:05:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
|
2020-01-27 15:49:38 +00:00
|
|
|
int fdtdec_get_pci_bar32(const struct udevice *dev, struct fdt_pci_addr *addr,
|
2015-11-29 20:17:54 +00:00
|
|
|
u32 *bar)
|
2014-12-31 08:05:11 +00:00
|
|
|
{
|
|
|
|
int barnum;
|
|
|
|
|
|
|
|
/* extract the bar number from fdt_pci_addr */
|
|
|
|
barnum = addr->phys_hi & 0xff;
|
2018-01-15 10:07:36 +00:00
|
|
|
if (barnum < PCI_BASE_ADDRESS_0 || barnum > PCI_CARDBUS_CIS)
|
2014-12-31 08:05:11 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
barnum = (barnum - PCI_BASE_ADDRESS_0) / 4;
|
2015-11-29 20:17:54 +00:00
|
|
|
*bar = dm_pci_read_bar32(dev, barnum);
|
2014-12-31 08:05:11 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2019-10-19 22:19:35 +00:00
|
|
|
|
|
|
|
int fdtdec_get_pci_bus_range(const void *blob, int node,
|
|
|
|
struct fdt_resource *res)
|
|
|
|
{
|
|
|
|
const u32 *values;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
values = fdt_getprop(blob, node, "bus-range", &len);
|
|
|
|
if (!values || len < sizeof(*values) * 2)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
res->start = fdt32_to_cpu(*values++);
|
|
|
|
res->end = fdt32_to_cpu(*values);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2014-12-31 08:05:11 +00:00
|
|
|
#endif
|
|
|
|
|
2012-10-25 16:31:05 +00:00
|
|
|
uint64_t fdtdec_get_uint64(const void *blob, int node, const char *prop_name,
|
2018-01-15 10:07:35 +00:00
|
|
|
uint64_t default_val)
|
2012-10-25 16:31:05 +00:00
|
|
|
{
|
2019-10-22 08:05:22 +00:00
|
|
|
const unaligned_fdt64_t *cell64;
|
2012-10-25 16:31:05 +00:00
|
|
|
int length;
|
|
|
|
|
|
|
|
cell64 = fdt_getprop(blob, node, prop_name, &length);
|
|
|
|
if (!cell64 || length < sizeof(*cell64))
|
|
|
|
return default_val;
|
|
|
|
|
|
|
|
return fdt64_to_cpu(*cell64);
|
|
|
|
}
|
|
|
|
|
2012-02-27 10:52:34 +00:00
|
|
|
int fdtdec_get_is_enabled(const void *blob, int node)
|
2011-10-24 19:15:32 +00:00
|
|
|
{
|
|
|
|
const char *cell;
|
|
|
|
|
2012-02-27 10:52:34 +00:00
|
|
|
/*
|
|
|
|
* It should say "okay", so only allow that. Some fdts use "ok" but
|
|
|
|
* this is a bug. Please fix your device tree source file. See here
|
|
|
|
* for discussion:
|
|
|
|
*
|
|
|
|
* http://www.mail-archive.com/u-boot@lists.denx.de/msg71598.html
|
|
|
|
*/
|
2011-10-24 19:15:32 +00:00
|
|
|
cell = fdt_getprop(blob, node, "status", NULL);
|
|
|
|
if (cell)
|
2018-01-15 10:07:36 +00:00
|
|
|
return strcmp(cell, "okay") == 0;
|
2012-02-27 10:52:34 +00:00
|
|
|
return 1;
|
2011-10-24 19:15:32 +00:00
|
|
|
}
|
|
|
|
|
2012-11-13 04:13:54 +00:00
|
|
|
enum fdt_compat_id fdtdec_lookup(const void *blob, int node)
|
2011-10-24 19:15:32 +00:00
|
|
|
{
|
|
|
|
enum fdt_compat_id id;
|
|
|
|
|
|
|
|
/* Search our drivers */
|
|
|
|
for (id = COMPAT_UNKNOWN; id < COMPAT_COUNT; id++)
|
2018-01-15 10:07:36 +00:00
|
|
|
if (fdt_node_check_compatible(blob, node,
|
|
|
|
compat_names[id]) == 0)
|
2011-10-24 19:15:32 +00:00
|
|
|
return id;
|
|
|
|
return COMPAT_UNKNOWN;
|
|
|
|
}
|
|
|
|
|
2018-01-15 10:07:35 +00:00
|
|
|
int fdtdec_next_compatible(const void *blob, int node, enum fdt_compat_id id)
|
2011-10-24 19:15:32 +00:00
|
|
|
{
|
|
|
|
return fdt_node_offset_by_compatible(blob, node, compat_names[id]);
|
|
|
|
}
|
|
|
|
|
2012-04-02 13:18:42 +00:00
|
|
|
int fdtdec_next_compatible_subnode(const void *blob, int node,
|
2018-01-15 10:07:35 +00:00
|
|
|
enum fdt_compat_id id, int *depthp)
|
2012-04-02 13:18:42 +00:00
|
|
|
{
|
|
|
|
do {
|
|
|
|
node = fdt_next_node(blob, node, depthp);
|
|
|
|
} while (*depthp > 1);
|
|
|
|
|
|
|
|
/* If this is a direct subnode, and compatible, return it */
|
|
|
|
if (*depthp == 1 && 0 == fdt_node_check_compatible(
|
|
|
|
blob, node, compat_names[id]))
|
|
|
|
return node;
|
|
|
|
|
|
|
|
return -FDT_ERR_NOTFOUND;
|
|
|
|
}
|
|
|
|
|
2018-01-15 10:07:35 +00:00
|
|
|
int fdtdec_next_alias(const void *blob, const char *name, enum fdt_compat_id id,
|
|
|
|
int *upto)
|
2011-10-24 19:15:32 +00:00
|
|
|
{
|
|
|
|
#define MAX_STR_LEN 20
|
|
|
|
char str[MAX_STR_LEN + 20];
|
|
|
|
int node, err;
|
|
|
|
|
|
|
|
/* snprintf() is not available */
|
|
|
|
assert(strlen(name) < MAX_STR_LEN);
|
|
|
|
sprintf(str, "%.*s%d", MAX_STR_LEN, name, *upto);
|
2012-10-31 14:02:42 +00:00
|
|
|
node = fdt_path_offset(blob, str);
|
2011-10-24 19:15:32 +00:00
|
|
|
if (node < 0)
|
|
|
|
return node;
|
|
|
|
err = fdt_node_check_compatible(blob, node, compat_names[id]);
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
2012-02-27 10:52:34 +00:00
|
|
|
if (err)
|
|
|
|
return -FDT_ERR_NOTFOUND;
|
|
|
|
(*upto)++;
|
|
|
|
return node;
|
2011-10-24 19:15:32 +00:00
|
|
|
}
|
|
|
|
|
2012-01-17 08:20:50 +00:00
|
|
|
int fdtdec_find_aliases_for_id(const void *blob, const char *name,
|
2018-01-15 10:07:35 +00:00
|
|
|
enum fdt_compat_id id, int *node_list,
|
|
|
|
int maxcount)
|
2012-02-03 15:13:53 +00:00
|
|
|
{
|
|
|
|
memset(node_list, '\0', sizeof(*node_list) * maxcount);
|
|
|
|
|
|
|
|
return fdtdec_add_aliases_for_id(blob, name, id, node_list, maxcount);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* TODO: Can we tighten this code up a little? */
|
|
|
|
int fdtdec_add_aliases_for_id(const void *blob, const char *name,
|
2018-01-15 10:07:35 +00:00
|
|
|
enum fdt_compat_id id, int *node_list,
|
|
|
|
int maxcount)
|
2012-01-17 08:20:50 +00:00
|
|
|
{
|
|
|
|
int name_len = strlen(name);
|
|
|
|
int nodes[maxcount];
|
|
|
|
int num_found = 0;
|
|
|
|
int offset, node;
|
|
|
|
int alias_node;
|
|
|
|
int count;
|
|
|
|
int i, j;
|
|
|
|
|
|
|
|
/* find the alias node if present */
|
|
|
|
alias_node = fdt_path_offset(blob, "/aliases");
|
|
|
|
|
|
|
|
/*
|
|
|
|
* start with nothing, and we can assume that the root node can't
|
|
|
|
* match
|
|
|
|
*/
|
|
|
|
memset(nodes, '\0', sizeof(nodes));
|
|
|
|
|
|
|
|
/* First find all the compatible nodes */
|
|
|
|
for (node = count = 0; node >= 0 && count < maxcount;) {
|
|
|
|
node = fdtdec_next_compatible(blob, node, id);
|
|
|
|
if (node >= 0)
|
|
|
|
nodes[count++] = node;
|
|
|
|
}
|
|
|
|
if (node >= 0)
|
|
|
|
debug("%s: warning: maxcount exceeded with alias '%s'\n",
|
2018-01-15 10:07:35 +00:00
|
|
|
__func__, name);
|
2012-01-17 08:20:50 +00:00
|
|
|
|
|
|
|
/* Now find all the aliases */
|
|
|
|
for (offset = fdt_first_property_offset(blob, alias_node);
|
|
|
|
offset > 0;
|
|
|
|
offset = fdt_next_property_offset(blob, offset)) {
|
|
|
|
const struct fdt_property *prop;
|
|
|
|
const char *path;
|
|
|
|
int number;
|
|
|
|
int found;
|
|
|
|
|
|
|
|
node = 0;
|
|
|
|
prop = fdt_get_property_by_offset(blob, offset, NULL);
|
|
|
|
path = fdt_string(blob, fdt32_to_cpu(prop->nameoff));
|
|
|
|
if (prop->len && 0 == strncmp(path, name, name_len))
|
|
|
|
node = fdt_path_offset(blob, prop->data);
|
|
|
|
if (node <= 0)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* Get the alias number */
|
|
|
|
number = simple_strtoul(path + name_len, NULL, 10);
|
|
|
|
if (number < 0 || number >= maxcount) {
|
|
|
|
debug("%s: warning: alias '%s' is out of range\n",
|
2018-01-15 10:07:35 +00:00
|
|
|
__func__, path);
|
2012-01-17 08:20:50 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Make sure the node we found is actually in our list! */
|
|
|
|
found = -1;
|
|
|
|
for (j = 0; j < count; j++)
|
|
|
|
if (nodes[j] == node) {
|
|
|
|
found = j;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (found == -1) {
|
|
|
|
debug("%s: warning: alias '%s' points to a node "
|
|
|
|
"'%s' that is missing or is not compatible "
|
|
|
|
" with '%s'\n", __func__, path,
|
|
|
|
fdt_get_name(blob, node, NULL),
|
|
|
|
compat_names[id]);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Add this node to our list in the right place, and mark
|
|
|
|
* it as done.
|
|
|
|
*/
|
|
|
|
if (fdtdec_get_is_enabled(blob, node)) {
|
2012-02-03 15:13:53 +00:00
|
|
|
if (node_list[number]) {
|
|
|
|
debug("%s: warning: alias '%s' requires that "
|
|
|
|
"a node be placed in the list in a "
|
|
|
|
"position which is already filled by "
|
|
|
|
"node '%s'\n", __func__, path,
|
|
|
|
fdt_get_name(blob, node, NULL));
|
|
|
|
continue;
|
|
|
|
}
|
2012-01-17 08:20:50 +00:00
|
|
|
node_list[number] = node;
|
|
|
|
if (number >= num_found)
|
|
|
|
num_found = number + 1;
|
|
|
|
}
|
2012-02-03 15:13:53 +00:00
|
|
|
nodes[found] = 0;
|
2012-01-17 08:20:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Add any nodes not mentioned by an alias */
|
|
|
|
for (i = j = 0; i < maxcount; i++) {
|
|
|
|
if (!node_list[i]) {
|
|
|
|
for (; j < maxcount; j++)
|
|
|
|
if (nodes[j] &&
|
2018-01-15 10:07:35 +00:00
|
|
|
fdtdec_get_is_enabled(blob, nodes[j]))
|
2012-01-17 08:20:50 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
/* Have we run out of nodes to add? */
|
|
|
|
if (j == maxcount)
|
|
|
|
break;
|
|
|
|
|
|
|
|
assert(!node_list[i]);
|
|
|
|
node_list[i] = nodes[j++];
|
|
|
|
if (i >= num_found)
|
|
|
|
num_found = i + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return num_found;
|
|
|
|
}
|
|
|
|
|
2014-07-23 12:55:09 +00:00
|
|
|
int fdtdec_get_alias_seq(const void *blob, const char *base, int offset,
|
|
|
|
int *seqp)
|
|
|
|
{
|
|
|
|
int base_len = strlen(base);
|
|
|
|
const char *find_name;
|
|
|
|
int find_namelen;
|
|
|
|
int prop_offset;
|
|
|
|
int aliases;
|
|
|
|
|
|
|
|
find_name = fdt_get_name(blob, offset, &find_namelen);
|
|
|
|
debug("Looking for '%s' at %d, name %s\n", base, offset, find_name);
|
|
|
|
|
|
|
|
aliases = fdt_path_offset(blob, "/aliases");
|
|
|
|
for (prop_offset = fdt_first_property_offset(blob, aliases);
|
|
|
|
prop_offset > 0;
|
|
|
|
prop_offset = fdt_next_property_offset(blob, prop_offset)) {
|
|
|
|
const char *prop;
|
|
|
|
const char *name;
|
|
|
|
const char *slash;
|
2015-06-23 21:39:08 +00:00
|
|
|
int len, val;
|
2014-07-23 12:55:09 +00:00
|
|
|
|
|
|
|
prop = fdt_getprop_by_offset(blob, prop_offset, &name, &len);
|
|
|
|
debug(" - %s, %s\n", name, prop);
|
|
|
|
if (len < find_namelen || *prop != '/' || prop[len - 1] ||
|
|
|
|
strncmp(name, base, base_len))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
slash = strrchr(prop, '/');
|
|
|
|
if (strcmp(slash + 1, find_name))
|
|
|
|
continue;
|
2020-12-03 05:25:45 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Adding an extra check to distinguish DT nodes with
|
|
|
|
* same name
|
|
|
|
*/
|
|
|
|
if (IS_ENABLED(CONFIG_PHANDLE_CHECK_SEQ)) {
|
|
|
|
if (fdt_get_phandle(blob, offset) !=
|
|
|
|
fdt_get_phandle(blob, fdt_path_offset(blob, prop)))
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2015-06-23 21:39:08 +00:00
|
|
|
val = trailing_strtol(name);
|
|
|
|
if (val != -1) {
|
|
|
|
*seqp = val;
|
|
|
|
debug("Found seq %d\n", *seqp);
|
|
|
|
return 0;
|
2014-07-23 12:55:09 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
debug("Not found\n");
|
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
|
2019-01-31 15:30:58 +00:00
|
|
|
int fdtdec_get_alias_highest_id(const void *blob, const char *base)
|
|
|
|
{
|
|
|
|
int base_len = strlen(base);
|
|
|
|
int prop_offset;
|
|
|
|
int aliases;
|
|
|
|
int max = -1;
|
|
|
|
|
|
|
|
debug("Looking for highest alias id for '%s'\n", base);
|
|
|
|
|
|
|
|
aliases = fdt_path_offset(blob, "/aliases");
|
|
|
|
for (prop_offset = fdt_first_property_offset(blob, aliases);
|
|
|
|
prop_offset > 0;
|
|
|
|
prop_offset = fdt_next_property_offset(blob, prop_offset)) {
|
|
|
|
const char *prop;
|
|
|
|
const char *name;
|
|
|
|
int len, val;
|
|
|
|
|
|
|
|
prop = fdt_getprop_by_offset(blob, prop_offset, &name, &len);
|
|
|
|
debug(" - %s, %s\n", name, prop);
|
|
|
|
if (*prop != '/' || prop[len - 1] ||
|
|
|
|
strncmp(name, base, base_len))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
val = trailing_strtol(name);
|
|
|
|
if (val > max) {
|
|
|
|
debug("Found seq %d\n", val);
|
|
|
|
max = val;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return max;
|
|
|
|
}
|
|
|
|
|
2015-10-18 01:41:14 +00:00
|
|
|
const char *fdtdec_get_chosen_prop(const void *blob, const char *name)
|
2014-09-04 22:27:24 +00:00
|
|
|
{
|
|
|
|
int chosen_node;
|
|
|
|
|
|
|
|
if (!blob)
|
2015-10-18 01:41:14 +00:00
|
|
|
return NULL;
|
2014-09-04 22:27:24 +00:00
|
|
|
chosen_node = fdt_path_offset(blob, "/chosen");
|
2015-10-18 01:41:14 +00:00
|
|
|
return fdt_getprop(blob, chosen_node, name, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
int fdtdec_get_chosen_node(const void *blob, const char *name)
|
|
|
|
{
|
|
|
|
const char *prop;
|
|
|
|
|
|
|
|
prop = fdtdec_get_chosen_prop(blob, name);
|
2014-09-04 22:27:24 +00:00
|
|
|
if (!prop)
|
|
|
|
return -FDT_ERR_NOTFOUND;
|
|
|
|
return fdt_path_offset(blob, prop);
|
|
|
|
}
|
|
|
|
|
2012-03-28 10:08:24 +00:00
|
|
|
int fdtdec_check_fdt(void)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* We must have an FDT, but we cannot panic() yet since the console
|
|
|
|
* is not ready. So for now, just assert(). Boards which need an early
|
|
|
|
* FDT (prior to console ready) will need to make their own
|
|
|
|
* arrangements and do their own checks.
|
|
|
|
*/
|
|
|
|
assert(!fdtdec_prepare_fdt());
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-10-24 19:15:32 +00:00
|
|
|
/*
|
|
|
|
* This function is a little odd in that it accesses global data. At some
|
|
|
|
* point if the architecture board.c files merge this will make more sense.
|
|
|
|
* Even now, it is common code.
|
|
|
|
*/
|
2012-03-28 10:08:24 +00:00
|
|
|
int fdtdec_prepare_fdt(void)
|
2011-10-24 19:15:32 +00:00
|
|
|
{
|
2013-04-20 08:42:46 +00:00
|
|
|
if (!gd->fdt_blob || ((uintptr_t)gd->fdt_blob & 3) ||
|
|
|
|
fdt_check_header(gd->fdt_blob)) {
|
2015-02-28 05:06:32 +00:00
|
|
|
#ifdef CONFIG_SPL_BUILD
|
|
|
|
puts("Missing DTB\n");
|
|
|
|
#else
|
2021-01-14 03:29:48 +00:00
|
|
|
printf("No valid device tree binary found at %p\n",
|
|
|
|
gd->fdt_blob);
|
2015-06-23 21:39:09 +00:00
|
|
|
# ifdef DEBUG
|
|
|
|
if (gd->fdt_blob) {
|
|
|
|
printf("fdt_blob=%p\n", gd->fdt_blob);
|
|
|
|
print_buffer((ulong)gd->fdt_blob, gd->fdt_blob, 4,
|
|
|
|
32, 0);
|
|
|
|
}
|
|
|
|
# endif
|
2015-02-28 05:06:32 +00:00
|
|
|
#endif
|
2012-03-28 10:08:24 +00:00
|
|
|
return -1;
|
|
|
|
}
|
2011-10-24 19:15:32 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2012-02-27 10:52:35 +00:00
|
|
|
|
|
|
|
int fdtdec_lookup_phandle(const void *blob, int node, const char *prop_name)
|
|
|
|
{
|
|
|
|
const u32 *phandle;
|
|
|
|
int lookup;
|
|
|
|
|
2012-07-12 05:25:01 +00:00
|
|
|
debug("%s: %s\n", __func__, prop_name);
|
2012-02-27 10:52:35 +00:00
|
|
|
phandle = fdt_getprop(blob, node, prop_name, NULL);
|
|
|
|
if (!phandle)
|
|
|
|
return -FDT_ERR_NOTFOUND;
|
|
|
|
|
|
|
|
lookup = fdt_node_offset_by_phandle(blob, fdt32_to_cpu(*phandle));
|
|
|
|
return lookup;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Look up a property in a node and check that it has a minimum length.
|
|
|
|
*
|
|
|
|
* @param blob FDT blob
|
|
|
|
* @param node node to examine
|
|
|
|
* @param prop_name name of property to find
|
|
|
|
* @param min_len minimum property length in bytes
|
|
|
|
* @param err 0 if ok, or -FDT_ERR_NOTFOUND if the property is not
|
|
|
|
found, or -FDT_ERR_BADLAYOUT if not enough data
|
|
|
|
* @return pointer to cell, which is only valid if err == 0
|
|
|
|
*/
|
|
|
|
static const void *get_prop_check_min_len(const void *blob, int node,
|
2018-01-15 10:07:35 +00:00
|
|
|
const char *prop_name, int min_len,
|
|
|
|
int *err)
|
2012-02-27 10:52:35 +00:00
|
|
|
{
|
|
|
|
const void *cell;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
debug("%s: %s\n", __func__, prop_name);
|
|
|
|
cell = fdt_getprop(blob, node, prop_name, &len);
|
|
|
|
if (!cell)
|
|
|
|
*err = -FDT_ERR_NOTFOUND;
|
|
|
|
else if (len < min_len)
|
|
|
|
*err = -FDT_ERR_BADLAYOUT;
|
|
|
|
else
|
|
|
|
*err = 0;
|
|
|
|
return cell;
|
|
|
|
}
|
|
|
|
|
|
|
|
int fdtdec_get_int_array(const void *blob, int node, const char *prop_name,
|
2018-01-15 10:07:35 +00:00
|
|
|
u32 *array, int count)
|
2012-02-27 10:52:35 +00:00
|
|
|
{
|
|
|
|
const u32 *cell;
|
2018-01-15 10:07:36 +00:00
|
|
|
int err = 0;
|
2012-02-27 10:52:35 +00:00
|
|
|
|
|
|
|
debug("%s: %s\n", __func__, prop_name);
|
|
|
|
cell = get_prop_check_min_len(blob, node, prop_name,
|
|
|
|
sizeof(u32) * count, &err);
|
|
|
|
if (!err) {
|
2018-01-15 10:07:36 +00:00
|
|
|
int i;
|
|
|
|
|
2012-02-27 10:52:35 +00:00
|
|
|
for (i = 0; i < count; i++)
|
|
|
|
array[i] = fdt32_to_cpu(cell[i]);
|
|
|
|
}
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2014-11-11 01:00:19 +00:00
|
|
|
int fdtdec_get_int_array_count(const void *blob, int node,
|
|
|
|
const char *prop_name, u32 *array, int count)
|
|
|
|
{
|
|
|
|
const u32 *cell;
|
|
|
|
int len, elems;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
debug("%s: %s\n", __func__, prop_name);
|
|
|
|
cell = fdt_getprop(blob, node, prop_name, &len);
|
|
|
|
if (!cell)
|
|
|
|
return -FDT_ERR_NOTFOUND;
|
|
|
|
elems = len / sizeof(u32);
|
|
|
|
if (count > elems)
|
|
|
|
count = elems;
|
|
|
|
for (i = 0; i < count; i++)
|
|
|
|
array[i] = fdt32_to_cpu(cell[i]);
|
|
|
|
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
2012-04-02 13:18:41 +00:00
|
|
|
const u32 *fdtdec_locate_array(const void *blob, int node,
|
|
|
|
const char *prop_name, int count)
|
|
|
|
{
|
|
|
|
const u32 *cell;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
cell = get_prop_check_min_len(blob, node, prop_name,
|
|
|
|
sizeof(u32) * count, &err);
|
|
|
|
return err ? NULL : cell;
|
|
|
|
}
|
|
|
|
|
2012-02-27 10:52:35 +00:00
|
|
|
int fdtdec_get_bool(const void *blob, int node, const char *prop_name)
|
|
|
|
{
|
|
|
|
const s32 *cell;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
debug("%s: %s\n", __func__, prop_name);
|
|
|
|
cell = fdt_getprop(blob, node, prop_name, &len);
|
|
|
|
return cell != NULL;
|
|
|
|
}
|
2012-02-27 10:52:36 +00:00
|
|
|
|
2015-01-06 03:05:26 +00:00
|
|
|
int fdtdec_parse_phandle_with_args(const void *blob, int src_node,
|
|
|
|
const char *list_name,
|
|
|
|
const char *cells_name,
|
|
|
|
int cell_count, int index,
|
|
|
|
struct fdtdec_phandle_args *out_args)
|
|
|
|
{
|
|
|
|
const __be32 *list, *list_end;
|
|
|
|
int rc = 0, size, cur_index = 0;
|
|
|
|
uint32_t count = 0;
|
|
|
|
int node = -1;
|
|
|
|
int phandle;
|
|
|
|
|
|
|
|
/* Retrieve the phandle list property */
|
|
|
|
list = fdt_getprop(blob, src_node, list_name, &size);
|
|
|
|
if (!list)
|
|
|
|
return -ENOENT;
|
|
|
|
list_end = list + size / sizeof(*list);
|
|
|
|
|
|
|
|
/* Loop over the phandles until all the requested entry is found */
|
|
|
|
while (list < list_end) {
|
|
|
|
rc = -EINVAL;
|
|
|
|
count = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If phandle is 0, then it is an empty entry with no
|
|
|
|
* arguments. Skip forward to the next entry.
|
|
|
|
*/
|
|
|
|
phandle = be32_to_cpup(list++);
|
|
|
|
if (phandle) {
|
|
|
|
/*
|
|
|
|
* Find the provider node and parse the #*-cells
|
|
|
|
* property to determine the argument length.
|
|
|
|
*
|
|
|
|
* This is not needed if the cell count is hard-coded
|
|
|
|
* (i.e. cells_name not set, but cell_count is set),
|
|
|
|
* except when we're going to return the found node
|
|
|
|
* below.
|
|
|
|
*/
|
|
|
|
if (cells_name || cur_index == index) {
|
|
|
|
node = fdt_node_offset_by_phandle(blob,
|
|
|
|
phandle);
|
2020-09-25 07:41:15 +00:00
|
|
|
if (node < 0) {
|
2015-01-06 03:05:26 +00:00
|
|
|
debug("%s: could not find phandle\n",
|
|
|
|
fdt_get_name(blob, src_node,
|
|
|
|
NULL));
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cells_name) {
|
|
|
|
count = fdtdec_get_int(blob, node, cells_name,
|
|
|
|
-1);
|
|
|
|
if (count == -1) {
|
|
|
|
debug("%s: could not get %s for %s\n",
|
|
|
|
fdt_get_name(blob, src_node,
|
|
|
|
NULL),
|
|
|
|
cells_name,
|
|
|
|
fdt_get_name(blob, node,
|
|
|
|
NULL));
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
count = cell_count;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Make sure that the arguments actually fit in the
|
|
|
|
* remaining property data length
|
|
|
|
*/
|
|
|
|
if (list + count > list_end) {
|
|
|
|
debug("%s: arguments longer than property\n",
|
|
|
|
fdt_get_name(blob, src_node, NULL));
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* All of the error cases above bail out of the loop, so at
|
|
|
|
* this point, the parsing is successful. If the requested
|
|
|
|
* index matches, then fill the out_args structure and return,
|
|
|
|
* or return -ENOENT for an empty entry.
|
|
|
|
*/
|
|
|
|
rc = -ENOENT;
|
|
|
|
if (cur_index == index) {
|
|
|
|
if (!phandle)
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
if (out_args) {
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (count > MAX_PHANDLE_ARGS) {
|
|
|
|
debug("%s: too many arguments %d\n",
|
|
|
|
fdt_get_name(blob, src_node,
|
|
|
|
NULL), count);
|
|
|
|
count = MAX_PHANDLE_ARGS;
|
|
|
|
}
|
|
|
|
out_args->node = node;
|
|
|
|
out_args->args_count = count;
|
|
|
|
for (i = 0; i < count; i++) {
|
|
|
|
out_args->args[i] =
|
|
|
|
be32_to_cpup(list++);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Found it! return success */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
node = -1;
|
|
|
|
list += count;
|
|
|
|
cur_index++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Result will be one of:
|
|
|
|
* -ENOENT : index is for empty phandle
|
|
|
|
* -EINVAL : parsing error on data
|
|
|
|
* [1..n] : Number of phandle (count mode; when index = -1)
|
|
|
|
*/
|
|
|
|
rc = index < 0 ? cur_index : -ENOENT;
|
|
|
|
err:
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2012-04-17 09:01:28 +00:00
|
|
|
int fdtdec_get_byte_array(const void *blob, int node, const char *prop_name,
|
2018-01-15 10:07:35 +00:00
|
|
|
u8 *array, int count)
|
2012-04-17 09:01:28 +00:00
|
|
|
{
|
|
|
|
const u8 *cell;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
cell = get_prop_check_min_len(blob, node, prop_name, count, &err);
|
|
|
|
if (!err)
|
|
|
|
memcpy(array, cell, count);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
const u8 *fdtdec_locate_byte_array(const void *blob, int node,
|
2018-01-15 10:07:35 +00:00
|
|
|
const char *prop_name, int count)
|
2012-04-17 09:01:28 +00:00
|
|
|
{
|
|
|
|
const u8 *cell;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
cell = get_prop_check_min_len(blob, node, prop_name, count, &err);
|
|
|
|
if (err)
|
|
|
|
return NULL;
|
|
|
|
return cell;
|
|
|
|
}
|
2012-10-25 16:30:58 +00:00
|
|
|
|
|
|
|
int fdtdec_get_config_int(const void *blob, const char *prop_name,
|
2018-01-15 10:07:35 +00:00
|
|
|
int default_val)
|
2012-10-25 16:30:58 +00:00
|
|
|
{
|
|
|
|
int config_node;
|
|
|
|
|
|
|
|
debug("%s: %s\n", __func__, prop_name);
|
|
|
|
config_node = fdt_path_offset(blob, "/config");
|
|
|
|
if (config_node < 0)
|
|
|
|
return default_val;
|
|
|
|
return fdtdec_get_int(blob, config_node, prop_name, default_val);
|
|
|
|
}
|
2012-10-25 16:30:59 +00:00
|
|
|
|
2012-10-25 16:31:04 +00:00
|
|
|
int fdtdec_get_config_bool(const void *blob, const char *prop_name)
|
|
|
|
{
|
|
|
|
int config_node;
|
|
|
|
const void *prop;
|
|
|
|
|
|
|
|
debug("%s: %s\n", __func__, prop_name);
|
|
|
|
config_node = fdt_path_offset(blob, "/config");
|
|
|
|
if (config_node < 0)
|
|
|
|
return 0;
|
|
|
|
prop = fdt_get_property(blob, config_node, prop_name, NULL);
|
|
|
|
|
|
|
|
return prop != NULL;
|
|
|
|
}
|
|
|
|
|
2012-10-25 16:30:59 +00:00
|
|
|
char *fdtdec_get_config_string(const void *blob, const char *prop_name)
|
|
|
|
{
|
|
|
|
const char *nodep;
|
|
|
|
int nodeoffset;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
debug("%s: %s\n", __func__, prop_name);
|
|
|
|
nodeoffset = fdt_path_offset(blob, "/config");
|
|
|
|
if (nodeoffset < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
nodep = fdt_getprop(blob, nodeoffset, prop_name, &len);
|
|
|
|
if (!nodep)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return (char *)nodep;
|
|
|
|
}
|
2012-10-25 16:31:00 +00:00
|
|
|
|
2015-03-05 19:25:14 +00:00
|
|
|
u64 fdtdec_get_number(const fdt32_t *ptr, unsigned int cells)
|
2014-08-26 15:33:53 +00:00
|
|
|
{
|
|
|
|
u64 number = 0;
|
|
|
|
|
|
|
|
while (cells--)
|
|
|
|
number = (number << 32) | fdt32_to_cpu(*ptr++);
|
|
|
|
|
|
|
|
return number;
|
|
|
|
}
|
|
|
|
|
|
|
|
int fdt_get_resource(const void *fdt, int node, const char *property,
|
|
|
|
unsigned int index, struct fdt_resource *res)
|
|
|
|
{
|
|
|
|
const fdt32_t *ptr, *end;
|
|
|
|
int na, ns, len, parent;
|
|
|
|
unsigned int i = 0;
|
|
|
|
|
|
|
|
parent = fdt_parent_offset(fdt, node);
|
|
|
|
if (parent < 0)
|
|
|
|
return parent;
|
|
|
|
|
|
|
|
na = fdt_address_cells(fdt, parent);
|
|
|
|
ns = fdt_size_cells(fdt, parent);
|
|
|
|
|
|
|
|
ptr = fdt_getprop(fdt, node, property, &len);
|
|
|
|
if (!ptr)
|
|
|
|
return len;
|
|
|
|
|
|
|
|
end = ptr + len / sizeof(*ptr);
|
|
|
|
|
|
|
|
while (ptr + na + ns <= end) {
|
|
|
|
if (i == index) {
|
2018-01-15 10:07:36 +00:00
|
|
|
res->start = fdtdec_get_number(ptr, na);
|
|
|
|
res->end = res->start;
|
2014-08-26 15:33:53 +00:00
|
|
|
res->end += fdtdec_get_number(&ptr[na], ns) - 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
ptr += na + ns;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return -FDT_ERR_NOTFOUND;
|
|
|
|
}
|
|
|
|
|
|
|
|
int fdt_get_named_resource(const void *fdt, int node, const char *property,
|
|
|
|
const char *prop_names, const char *name,
|
|
|
|
struct fdt_resource *res)
|
|
|
|
{
|
|
|
|
int index;
|
|
|
|
|
2016-10-02 23:59:28 +00:00
|
|
|
index = fdt_stringlist_search(fdt, node, prop_names, name);
|
2014-08-26 15:33:53 +00:00
|
|
|
if (index < 0)
|
|
|
|
return index;
|
|
|
|
|
|
|
|
return fdt_get_resource(fdt, node, property, index, res);
|
|
|
|
}
|
2014-08-26 15:33:54 +00:00
|
|
|
|
2015-04-15 03:03:21 +00:00
|
|
|
static int decode_timing_property(const void *blob, int node, const char *name,
|
|
|
|
struct timing_entry *result)
|
|
|
|
{
|
|
|
|
int length, ret = 0;
|
|
|
|
const u32 *prop;
|
|
|
|
|
|
|
|
prop = fdt_getprop(blob, node, name, &length);
|
|
|
|
if (!prop) {
|
|
|
|
debug("%s: could not find property %s\n",
|
|
|
|
fdt_get_name(blob, node, NULL), name);
|
|
|
|
return length;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (length == sizeof(u32)) {
|
|
|
|
result->typ = fdtdec_get_int(blob, node, name, 0);
|
|
|
|
result->min = result->typ;
|
|
|
|
result->max = result->typ;
|
|
|
|
} else {
|
|
|
|
ret = fdtdec_get_int_array(blob, node, name, &result->min, 3);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int fdtdec_decode_display_timing(const void *blob, int parent, int index,
|
|
|
|
struct display_timing *dt)
|
|
|
|
{
|
|
|
|
int i, node, timings_node;
|
|
|
|
u32 val = 0;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
timings_node = fdt_subnode_offset(blob, parent, "display-timings");
|
|
|
|
if (timings_node < 0)
|
|
|
|
return timings_node;
|
|
|
|
|
|
|
|
for (i = 0, node = fdt_first_subnode(blob, timings_node);
|
|
|
|
node > 0 && i != index;
|
|
|
|
node = fdt_next_subnode(blob, node))
|
|
|
|
i++;
|
|
|
|
|
|
|
|
if (node < 0)
|
|
|
|
return node;
|
|
|
|
|
|
|
|
memset(dt, 0, sizeof(*dt));
|
|
|
|
|
|
|
|
ret |= decode_timing_property(blob, node, "hback-porch",
|
|
|
|
&dt->hback_porch);
|
|
|
|
ret |= decode_timing_property(blob, node, "hfront-porch",
|
|
|
|
&dt->hfront_porch);
|
|
|
|
ret |= decode_timing_property(blob, node, "hactive", &dt->hactive);
|
|
|
|
ret |= decode_timing_property(blob, node, "hsync-len", &dt->hsync_len);
|
|
|
|
ret |= decode_timing_property(blob, node, "vback-porch",
|
|
|
|
&dt->vback_porch);
|
|
|
|
ret |= decode_timing_property(blob, node, "vfront-porch",
|
|
|
|
&dt->vfront_porch);
|
|
|
|
ret |= decode_timing_property(blob, node, "vactive", &dt->vactive);
|
|
|
|
ret |= decode_timing_property(blob, node, "vsync-len", &dt->vsync_len);
|
|
|
|
ret |= decode_timing_property(blob, node, "clock-frequency",
|
|
|
|
&dt->pixelclock);
|
|
|
|
|
|
|
|
dt->flags = 0;
|
|
|
|
val = fdtdec_get_int(blob, node, "vsync-active", -1);
|
|
|
|
if (val != -1) {
|
|
|
|
dt->flags |= val ? DISPLAY_FLAGS_VSYNC_HIGH :
|
|
|
|
DISPLAY_FLAGS_VSYNC_LOW;
|
|
|
|
}
|
|
|
|
val = fdtdec_get_int(blob, node, "hsync-active", -1);
|
|
|
|
if (val != -1) {
|
|
|
|
dt->flags |= val ? DISPLAY_FLAGS_HSYNC_HIGH :
|
|
|
|
DISPLAY_FLAGS_HSYNC_LOW;
|
|
|
|
}
|
|
|
|
val = fdtdec_get_int(blob, node, "de-active", -1);
|
|
|
|
if (val != -1) {
|
|
|
|
dt->flags |= val ? DISPLAY_FLAGS_DE_HIGH :
|
|
|
|
DISPLAY_FLAGS_DE_LOW;
|
|
|
|
}
|
|
|
|
val = fdtdec_get_int(blob, node, "pixelclk-active", -1);
|
|
|
|
if (val != -1) {
|
|
|
|
dt->flags |= val ? DISPLAY_FLAGS_PIXDATA_POSEDGE :
|
|
|
|
DISPLAY_FLAGS_PIXDATA_NEGEDGE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (fdtdec_get_bool(blob, node, "interlaced"))
|
|
|
|
dt->flags |= DISPLAY_FLAGS_INTERLACED;
|
|
|
|
if (fdtdec_get_bool(blob, node, "doublescan"))
|
|
|
|
dt->flags |= DISPLAY_FLAGS_DOUBLESCAN;
|
|
|
|
if (fdtdec_get_bool(blob, node, "doubleclk"))
|
|
|
|
dt->flags |= DISPLAY_FLAGS_DOUBLECLK;
|
|
|
|
|
2016-05-05 13:28:21 +00:00
|
|
|
return ret;
|
2015-04-15 03:03:21 +00:00
|
|
|
}
|
|
|
|
|
2020-07-10 11:16:50 +00:00
|
|
|
int fdtdec_setup_mem_size_base(void)
|
2016-12-18 14:03:34 +00:00
|
|
|
{
|
2020-07-10 11:34:44 +00:00
|
|
|
int ret;
|
|
|
|
ofnode mem;
|
|
|
|
struct resource res;
|
2016-12-18 14:03:34 +00:00
|
|
|
|
2020-07-10 11:34:44 +00:00
|
|
|
mem = ofnode_path("/memory");
|
|
|
|
if (!ofnode_valid(mem)) {
|
2016-12-18 14:03:34 +00:00
|
|
|
debug("%s: Missing /memory node\n", __func__);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
2020-07-10 11:34:44 +00:00
|
|
|
ret = ofnode_read_resource(mem, 0, &res);
|
2016-12-18 14:03:34 +00:00
|
|
|
if (ret != 0) {
|
|
|
|
debug("%s: Unable to decode first memory bank\n", __func__);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
gd->ram_size = (phys_size_t)(res.end - res.start + 1);
|
2018-07-16 10:26:10 +00:00
|
|
|
gd->ram_base = (unsigned long)res.start;
|
2017-05-27 13:38:13 +00:00
|
|
|
debug("%s: Initial DRAM size %llx\n", __func__,
|
|
|
|
(unsigned long long)gd->ram_size);
|
2016-12-18 14:03:34 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-07-10 11:34:44 +00:00
|
|
|
ofnode get_next_memory_node(ofnode mem)
|
2018-07-13 10:12:11 +00:00
|
|
|
{
|
|
|
|
do {
|
2020-07-10 11:34:44 +00:00
|
|
|
mem = ofnode_by_prop_value(mem, "device_type", "memory", 7);
|
|
|
|
} while (!ofnode_is_available(mem));
|
2018-07-13 10:12:11 +00:00
|
|
|
|
|
|
|
return mem;
|
|
|
|
}
|
|
|
|
|
2020-07-10 11:16:49 +00:00
|
|
|
int fdtdec_setup_memory_banksize(void)
|
2016-12-18 14:03:34 +00:00
|
|
|
{
|
2020-07-10 11:34:44 +00:00
|
|
|
int bank, ret, reg = 0;
|
|
|
|
struct resource res;
|
|
|
|
ofnode mem = ofnode_null();
|
2016-12-18 14:03:34 +00:00
|
|
|
|
2020-07-10 11:34:44 +00:00
|
|
|
mem = get_next_memory_node(mem);
|
|
|
|
if (!ofnode_valid(mem)) {
|
2018-10-03 13:53:52 +00:00
|
|
|
debug("%s: Missing /memory node\n", __func__);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
2016-12-18 14:03:34 +00:00
|
|
|
|
|
|
|
for (bank = 0; bank < CONFIG_NR_DRAM_BANKS; bank++) {
|
2020-07-10 11:34:44 +00:00
|
|
|
ret = ofnode_read_resource(mem, reg++, &res);
|
|
|
|
if (ret < 0) {
|
2017-11-27 04:32:42 +00:00
|
|
|
reg = 0;
|
2020-07-10 11:34:44 +00:00
|
|
|
mem = get_next_memory_node(mem);
|
2020-09-12 10:42:52 +00:00
|
|
|
if (!ofnode_valid(mem))
|
2018-10-03 13:53:52 +00:00
|
|
|
break;
|
|
|
|
|
2020-07-10 11:34:44 +00:00
|
|
|
ret = ofnode_read_resource(mem, reg++, &res);
|
|
|
|
if (ret < 0)
|
2018-10-03 13:53:52 +00:00
|
|
|
break;
|
|
|
|
}
|
2020-07-10 11:34:44 +00:00
|
|
|
|
|
|
|
if (ret != 0)
|
2018-10-03 13:53:52 +00:00
|
|
|
return -EINVAL;
|
2016-12-18 14:03:34 +00:00
|
|
|
|
|
|
|
gd->bd->bi_dram[bank].start = (phys_addr_t)res.start;
|
|
|
|
gd->bd->bi_dram[bank].size =
|
|
|
|
(phys_size_t)(res.end - res.start + 1);
|
|
|
|
|
|
|
|
debug("%s: DRAM Bank #%d: start = 0x%llx, size = 0x%llx\n",
|
|
|
|
__func__, bank,
|
|
|
|
(unsigned long long)gd->bd->bi_dram[bank].start,
|
|
|
|
(unsigned long long)gd->bd->bi_dram[bank].size);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2020-07-09 12:09:52 +00:00
|
|
|
|
|
|
|
int fdtdec_setup_mem_size_base_lowest(void)
|
|
|
|
{
|
2020-07-10 11:34:44 +00:00
|
|
|
int bank, ret, reg = 0;
|
|
|
|
struct resource res;
|
2020-07-09 12:09:52 +00:00
|
|
|
unsigned long base;
|
|
|
|
phys_size_t size;
|
2020-07-10 11:34:44 +00:00
|
|
|
ofnode mem = ofnode_null();
|
2020-07-09 12:09:52 +00:00
|
|
|
|
|
|
|
gd->ram_base = (unsigned long)~0;
|
|
|
|
|
2020-07-10 11:34:44 +00:00
|
|
|
mem = get_next_memory_node(mem);
|
|
|
|
if (!ofnode_valid(mem)) {
|
2020-07-09 12:09:52 +00:00
|
|
|
debug("%s: Missing /memory node\n", __func__);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (bank = 0; bank < CONFIG_NR_DRAM_BANKS; bank++) {
|
2020-07-10 11:34:44 +00:00
|
|
|
ret = ofnode_read_resource(mem, reg++, &res);
|
|
|
|
if (ret < 0) {
|
2020-07-09 12:09:52 +00:00
|
|
|
reg = 0;
|
2020-07-10 11:34:44 +00:00
|
|
|
mem = get_next_memory_node(mem);
|
2020-09-12 10:42:52 +00:00
|
|
|
if (!ofnode_valid(mem))
|
2020-07-09 12:09:52 +00:00
|
|
|
break;
|
|
|
|
|
2020-07-10 11:34:44 +00:00
|
|
|
ret = ofnode_read_resource(mem, reg++, &res);
|
|
|
|
if (ret < 0)
|
2020-07-09 12:09:52 +00:00
|
|
|
break;
|
|
|
|
}
|
2020-07-10 11:34:44 +00:00
|
|
|
|
2020-07-09 12:09:52 +00:00
|
|
|
if (ret != 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
base = (unsigned long)res.start;
|
|
|
|
size = (phys_size_t)(res.end - res.start + 1);
|
|
|
|
|
|
|
|
if (gd->ram_base > base && size) {
|
|
|
|
gd->ram_base = base;
|
|
|
|
gd->ram_size = size;
|
|
|
|
debug("%s: Initial DRAM base %lx size %lx\n",
|
|
|
|
__func__, base, (unsigned long)size);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2016-12-18 14:03:34 +00:00
|
|
|
|
2017-09-15 10:57:32 +00:00
|
|
|
#if CONFIG_IS_ENABLED(MULTI_DTB_FIT)
|
|
|
|
# if CONFIG_IS_ENABLED(MULTI_DTB_FIT_GZIP) ||\
|
|
|
|
CONFIG_IS_ENABLED(MULTI_DTB_FIT_LZO)
|
|
|
|
static int uncompress_blob(const void *src, ulong sz_src, void **dstp)
|
|
|
|
{
|
2019-03-08 15:06:55 +00:00
|
|
|
size_t sz_out = CONFIG_VAL(MULTI_DTB_FIT_UNCOMPRESS_SZ);
|
2019-03-13 20:11:22 +00:00
|
|
|
bool gzip = 0, lzo = 0;
|
2017-09-15 10:57:32 +00:00
|
|
|
ulong sz_in = sz_src;
|
|
|
|
void *dst;
|
|
|
|
int rc;
|
|
|
|
|
|
|
|
if (CONFIG_IS_ENABLED(GZIP))
|
2019-03-13 20:11:22 +00:00
|
|
|
if (gzip_parse_header(src, sz_in) >= 0)
|
|
|
|
gzip = 1;
|
2017-09-15 10:57:32 +00:00
|
|
|
if (CONFIG_IS_ENABLED(LZO))
|
2019-03-13 20:11:22 +00:00
|
|
|
if (!gzip && lzop_is_valid_header(src))
|
|
|
|
lzo = 1;
|
|
|
|
|
|
|
|
if (!gzip && !lzo)
|
|
|
|
return -EBADMSG;
|
|
|
|
|
2017-09-15 10:57:32 +00:00
|
|
|
|
|
|
|
if (CONFIG_IS_ENABLED(MULTI_DTB_FIT_DYN_ALLOC)) {
|
|
|
|
dst = malloc(sz_out);
|
|
|
|
if (!dst) {
|
|
|
|
puts("uncompress_blob: Unable to allocate memory\n");
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
# if CONFIG_IS_ENABLED(MULTI_DTB_FIT_USER_DEFINED_AREA)
|
|
|
|
dst = (void *)CONFIG_VAL(MULTI_DTB_FIT_USER_DEF_ADDR);
|
|
|
|
# else
|
|
|
|
return -ENOTSUPP;
|
|
|
|
# endif
|
|
|
|
}
|
|
|
|
|
2019-03-13 20:11:22 +00:00
|
|
|
if (CONFIG_IS_ENABLED(GZIP) && gzip)
|
2017-09-15 10:57:32 +00:00
|
|
|
rc = gunzip(dst, sz_out, (u8 *)src, &sz_in);
|
2019-03-13 20:11:22 +00:00
|
|
|
else if (CONFIG_IS_ENABLED(LZO) && lzo)
|
2017-09-15 10:57:32 +00:00
|
|
|
rc = lzop_decompress(src, sz_in, dst, &sz_out);
|
2019-03-13 20:11:22 +00:00
|
|
|
else
|
|
|
|
hang();
|
2017-09-15 10:57:32 +00:00
|
|
|
|
|
|
|
if (rc < 0) {
|
|
|
|
/* not a valid compressed blob */
|
|
|
|
puts("uncompress_blob: Unable to uncompress\n");
|
|
|
|
if (CONFIG_IS_ENABLED(MULTI_DTB_FIT_DYN_ALLOC))
|
|
|
|
free(dst);
|
|
|
|
return -EBADMSG;
|
|
|
|
}
|
|
|
|
*dstp = dst;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
# else
|
|
|
|
static int uncompress_blob(const void *src, ulong sz_src, void **dstp)
|
|
|
|
{
|
2018-10-18 18:37:05 +00:00
|
|
|
*dstp = (void *)src;
|
|
|
|
return 0;
|
2017-09-15 10:57:32 +00:00
|
|
|
}
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
2018-01-10 10:34:37 +00:00
|
|
|
#if defined(CONFIG_OF_BOARD) || defined(CONFIG_OF_SEPARATE)
|
|
|
|
/*
|
|
|
|
* For CONFIG_OF_SEPARATE, the board may optionally implement this to
|
|
|
|
* provide and/or fixup the fdt.
|
|
|
|
*/
|
|
|
|
__weak void *board_fdt_blob_setup(void)
|
|
|
|
{
|
|
|
|
void *fdt_blob = NULL;
|
|
|
|
#ifdef CONFIG_SPL_BUILD
|
|
|
|
/* FDT is at end of BSS unless it is in a different memory region */
|
2021-02-14 19:08:17 +00:00
|
|
|
if (IS_ENABLED(CONFIG_SPL_SEPARATE_BSS))
|
2018-01-10 10:34:37 +00:00
|
|
|
fdt_blob = (ulong *)&_image_binary_end;
|
|
|
|
else
|
|
|
|
fdt_blob = (ulong *)&__bss_end;
|
|
|
|
#else
|
|
|
|
/* FDT is at end of image */
|
|
|
|
fdt_blob = (ulong *)&_end;
|
|
|
|
#endif
|
|
|
|
return fdt_blob;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2019-04-15 09:32:13 +00:00
|
|
|
int fdtdec_set_ethernet_mac_address(void *fdt, const u8 *mac, size_t size)
|
|
|
|
{
|
|
|
|
const char *path;
|
|
|
|
int offset, err;
|
|
|
|
|
|
|
|
if (!is_valid_ethaddr(mac))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
path = fdt_get_alias(fdt, "ethernet");
|
|
|
|
if (!path)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
debug("ethernet alias found: %s\n", path);
|
|
|
|
|
|
|
|
offset = fdt_path_offset(fdt, path);
|
|
|
|
if (offset < 0) {
|
|
|
|
debug("ethernet alias points to absent node %s\n", path);
|
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
|
|
|
|
err = fdt_setprop_inplace(fdt, offset, "local-mac-address", mac, size);
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
debug("MAC address: %pM\n", mac);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-03-21 18:10:02 +00:00
|
|
|
static int fdtdec_init_reserved_memory(void *blob)
|
|
|
|
{
|
|
|
|
int na, ns, node, err;
|
|
|
|
fdt32_t value;
|
|
|
|
|
|
|
|
/* inherit #address-cells and #size-cells from the root node */
|
|
|
|
na = fdt_address_cells(blob, 0);
|
|
|
|
ns = fdt_size_cells(blob, 0);
|
|
|
|
|
|
|
|
node = fdt_add_subnode(blob, 0, "reserved-memory");
|
|
|
|
if (node < 0)
|
|
|
|
return node;
|
|
|
|
|
|
|
|
err = fdt_setprop(blob, node, "ranges", NULL, 0);
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
value = cpu_to_fdt32(ns);
|
|
|
|
|
|
|
|
err = fdt_setprop(blob, node, "#size-cells", &value, sizeof(value));
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
value = cpu_to_fdt32(na);
|
|
|
|
|
|
|
|
err = fdt_setprop(blob, node, "#address-cells", &value, sizeof(value));
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
return node;
|
|
|
|
}
|
|
|
|
|
|
|
|
int fdtdec_add_reserved_memory(void *blob, const char *basename,
|
|
|
|
const struct fdt_memory *carveout,
|
2020-09-10 08:49:59 +00:00
|
|
|
uint32_t *phandlep, bool no_map)
|
2019-03-21 18:10:02 +00:00
|
|
|
{
|
|
|
|
fdt32_t cells[4] = {}, *ptr = cells;
|
|
|
|
uint32_t upper, lower, phandle;
|
|
|
|
int parent, node, na, ns, err;
|
2019-04-15 08:08:21 +00:00
|
|
|
fdt_size_t size;
|
2019-03-21 18:10:02 +00:00
|
|
|
char name[64];
|
|
|
|
|
|
|
|
/* create an empty /reserved-memory node if one doesn't exist */
|
|
|
|
parent = fdt_path_offset(blob, "/reserved-memory");
|
|
|
|
if (parent < 0) {
|
|
|
|
parent = fdtdec_init_reserved_memory(blob);
|
|
|
|
if (parent < 0)
|
|
|
|
return parent;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* only 1 or 2 #address-cells and #size-cells are supported */
|
|
|
|
na = fdt_address_cells(blob, parent);
|
|
|
|
if (na < 1 || na > 2)
|
|
|
|
return -FDT_ERR_BADNCELLS;
|
|
|
|
|
|
|
|
ns = fdt_size_cells(blob, parent);
|
|
|
|
if (ns < 1 || ns > 2)
|
|
|
|
return -FDT_ERR_BADNCELLS;
|
|
|
|
|
|
|
|
/* find a matching node and return the phandle to that */
|
|
|
|
fdt_for_each_subnode(node, blob, parent) {
|
|
|
|
const char *name = fdt_get_name(blob, node, NULL);
|
2020-05-20 06:38:32 +00:00
|
|
|
fdt_addr_t addr;
|
|
|
|
fdt_size_t size;
|
2019-03-21 18:10:02 +00:00
|
|
|
|
2020-05-20 06:38:33 +00:00
|
|
|
addr = fdtdec_get_addr_size_fixed(blob, node, "reg", 0, na, ns,
|
|
|
|
&size, false);
|
2019-03-21 18:10:02 +00:00
|
|
|
if (addr == FDT_ADDR_T_NONE) {
|
|
|
|
debug("failed to read address/size for %s\n", name);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2020-04-21 18:15:00 +00:00
|
|
|
if (addr == carveout->start && (addr + size - 1) ==
|
|
|
|
carveout->end) {
|
2019-10-23 14:46:38 +00:00
|
|
|
if (phandlep)
|
|
|
|
*phandlep = fdt_get_phandle(blob, node);
|
2019-03-21 18:10:02 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Unpack the start address and generate the name of the new node
|
|
|
|
* base on the basename and the unit-address.
|
|
|
|
*/
|
2019-04-15 08:08:21 +00:00
|
|
|
upper = upper_32_bits(carveout->start);
|
|
|
|
lower = lower_32_bits(carveout->start);
|
2019-03-21 18:10:02 +00:00
|
|
|
|
|
|
|
if (na > 1 && upper > 0)
|
|
|
|
snprintf(name, sizeof(name), "%s@%x,%x", basename, upper,
|
|
|
|
lower);
|
|
|
|
else {
|
|
|
|
if (upper > 0) {
|
|
|
|
debug("address %08x:%08x exceeds addressable space\n",
|
|
|
|
upper, lower);
|
|
|
|
return -FDT_ERR_BADVALUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
snprintf(name, sizeof(name), "%s@%x", basename, lower);
|
|
|
|
}
|
|
|
|
|
|
|
|
node = fdt_add_subnode(blob, parent, name);
|
|
|
|
if (node < 0)
|
|
|
|
return node;
|
|
|
|
|
2019-10-23 14:46:39 +00:00
|
|
|
if (phandlep) {
|
|
|
|
err = fdt_generate_phandle(blob, &phandle);
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
err = fdtdec_set_phandle(blob, node, phandle);
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
}
|
2019-03-21 18:10:02 +00:00
|
|
|
|
|
|
|
/* store one or two address cells */
|
|
|
|
if (na > 1)
|
|
|
|
*ptr++ = cpu_to_fdt32(upper);
|
|
|
|
|
|
|
|
*ptr++ = cpu_to_fdt32(lower);
|
|
|
|
|
|
|
|
/* store one or two size cells */
|
2019-04-15 08:08:21 +00:00
|
|
|
size = carveout->end - carveout->start + 1;
|
|
|
|
upper = upper_32_bits(size);
|
|
|
|
lower = lower_32_bits(size);
|
2019-03-21 18:10:02 +00:00
|
|
|
|
|
|
|
if (ns > 1)
|
|
|
|
*ptr++ = cpu_to_fdt32(upper);
|
|
|
|
|
|
|
|
*ptr++ = cpu_to_fdt32(lower);
|
|
|
|
|
|
|
|
err = fdt_setprop(blob, node, "reg", cells, (na + ns) * sizeof(*cells));
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
|
2020-09-10 08:49:59 +00:00
|
|
|
if (no_map) {
|
|
|
|
err = fdt_setprop(blob, node, "no-map", NULL, 0);
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2019-03-21 18:10:02 +00:00
|
|
|
/* return the phandle for the new node for the caller to use */
|
|
|
|
if (phandlep)
|
|
|
|
*phandlep = phandle;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-03-21 18:10:03 +00:00
|
|
|
int fdtdec_get_carveout(const void *blob, const char *node, const char *name,
|
|
|
|
unsigned int index, struct fdt_memory *carveout)
|
|
|
|
{
|
|
|
|
const fdt32_t *prop;
|
|
|
|
uint32_t phandle;
|
|
|
|
int offset, len;
|
|
|
|
fdt_size_t size;
|
|
|
|
|
|
|
|
offset = fdt_path_offset(blob, node);
|
|
|
|
if (offset < 0)
|
|
|
|
return offset;
|
|
|
|
|
|
|
|
prop = fdt_getprop(blob, offset, name, &len);
|
|
|
|
if (!prop) {
|
|
|
|
debug("failed to get %s for %s\n", name, node);
|
|
|
|
return -FDT_ERR_NOTFOUND;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((len % sizeof(phandle)) != 0) {
|
|
|
|
debug("invalid phandle property\n");
|
|
|
|
return -FDT_ERR_BADPHANDLE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (len < (sizeof(phandle) * (index + 1))) {
|
|
|
|
debug("invalid phandle index\n");
|
|
|
|
return -FDT_ERR_BADPHANDLE;
|
|
|
|
}
|
|
|
|
|
|
|
|
phandle = fdt32_to_cpu(prop[index]);
|
|
|
|
|
|
|
|
offset = fdt_node_offset_by_phandle(blob, phandle);
|
|
|
|
if (offset < 0) {
|
|
|
|
debug("failed to find node for phandle %u\n", phandle);
|
|
|
|
return offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
carveout->start = fdtdec_get_addr_size_auto_noparent(blob, offset,
|
|
|
|
"reg", 0, &size,
|
|
|
|
true);
|
|
|
|
if (carveout->start == FDT_ADDR_T_NONE) {
|
|
|
|
debug("failed to read address/size from \"reg\" property\n");
|
|
|
|
return -FDT_ERR_NOTFOUND;
|
|
|
|
}
|
|
|
|
|
|
|
|
carveout->end = carveout->start + size - 1;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int fdtdec_set_carveout(void *blob, const char *node, const char *prop_name,
|
|
|
|
unsigned int index, const char *name,
|
|
|
|
const struct fdt_memory *carveout)
|
|
|
|
{
|
|
|
|
uint32_t phandle;
|
2020-04-03 10:43:03 +00:00
|
|
|
int err, offset, len;
|
2019-03-21 18:10:03 +00:00
|
|
|
fdt32_t value;
|
2020-04-03 10:43:03 +00:00
|
|
|
void *prop;
|
2019-03-21 18:10:03 +00:00
|
|
|
|
2020-09-10 08:49:59 +00:00
|
|
|
err = fdtdec_add_reserved_memory(blob, name, carveout, &phandle, false);
|
2019-03-21 18:10:03 +00:00
|
|
|
if (err < 0) {
|
|
|
|
debug("failed to add reserved memory: %d\n", err);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
offset = fdt_path_offset(blob, node);
|
|
|
|
if (offset < 0) {
|
|
|
|
debug("failed to find offset for node %s: %d\n", node, offset);
|
|
|
|
return offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
value = cpu_to_fdt32(phandle);
|
|
|
|
|
2020-04-03 10:43:03 +00:00
|
|
|
if (!fdt_getprop(blob, offset, prop_name, &len)) {
|
|
|
|
if (len == -FDT_ERR_NOTFOUND)
|
|
|
|
len = 0;
|
|
|
|
else
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((index + 1) * sizeof(value) > len) {
|
|
|
|
err = fdt_setprop_placeholder(blob, offset, prop_name,
|
|
|
|
(index + 1) * sizeof(value),
|
|
|
|
&prop);
|
|
|
|
if (err < 0) {
|
|
|
|
debug("failed to resize reserved memory property: %s\n",
|
|
|
|
fdt_strerror(err));
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
err = fdt_setprop_inplace_namelen_partial(blob, offset, prop_name,
|
|
|
|
strlen(prop_name),
|
|
|
|
index * sizeof(value),
|
|
|
|
&value, sizeof(value));
|
2019-03-21 18:10:03 +00:00
|
|
|
if (err < 0) {
|
2020-04-03 10:43:03 +00:00
|
|
|
debug("failed to update %s property for node %s: %s\n",
|
|
|
|
prop_name, node, fdt_strerror(err));
|
2019-03-21 18:10:03 +00:00
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-04-11 19:18:59 +00:00
|
|
|
__weak int fdtdec_board_setup(const void *fdt_blob)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-02-28 05:06:35 +00:00
|
|
|
int fdtdec_setup(void)
|
2015-02-28 05:06:34 +00:00
|
|
|
{
|
2020-04-11 19:18:59 +00:00
|
|
|
int ret;
|
2015-08-11 22:31:55 +00:00
|
|
|
#if CONFIG_IS_ENABLED(OF_CONTROL)
|
2017-09-15 10:57:32 +00:00
|
|
|
# if CONFIG_IS_ENABLED(MULTI_DTB_FIT)
|
|
|
|
void *fdt_blob;
|
|
|
|
# endif
|
2015-02-28 05:06:34 +00:00
|
|
|
# ifdef CONFIG_OF_EMBED
|
|
|
|
/* Get a pointer to the FDT */
|
2017-11-21 12:29:56 +00:00
|
|
|
# ifdef CONFIG_SPL_BUILD
|
|
|
|
gd->fdt_blob = __dtb_dt_spl_begin;
|
|
|
|
# else
|
2015-02-28 05:06:34 +00:00
|
|
|
gd->fdt_blob = __dtb_dt_begin;
|
2017-11-21 12:29:56 +00:00
|
|
|
# endif
|
2018-01-10 10:34:37 +00:00
|
|
|
# elif defined(CONFIG_OF_BOARD) || defined(CONFIG_OF_SEPARATE)
|
2017-04-02 08:25:20 +00:00
|
|
|
/* Allow the board to override the fdt address. */
|
|
|
|
gd->fdt_blob = board_fdt_blob_setup();
|
2015-02-28 05:06:34 +00:00
|
|
|
# elif defined(CONFIG_OF_HOSTFILE)
|
|
|
|
if (sandbox_read_fdt_from_file()) {
|
|
|
|
puts("Failed to read control FDT\n");
|
|
|
|
return -1;
|
|
|
|
}
|
2019-08-21 19:14:40 +00:00
|
|
|
# elif defined(CONFIG_OF_PRIOR_STAGE)
|
2021-01-31 12:36:03 +00:00
|
|
|
gd->fdt_blob = (void *)(uintptr_t)prior_stage_fdt_address;
|
2015-02-28 05:06:34 +00:00
|
|
|
# endif
|
|
|
|
# ifndef CONFIG_SPL_BUILD
|
|
|
|
/* Allow the early environment to override the fdt address */
|
2018-11-18 16:58:50 +00:00
|
|
|
gd->fdt_blob = map_sysmem
|
|
|
|
(env_get_ulong("fdtcontroladdr", 16,
|
|
|
|
(unsigned long)map_to_sysmem(gd->fdt_blob)), 0);
|
2015-02-28 05:06:34 +00:00
|
|
|
# endif
|
2017-09-15 10:57:32 +00:00
|
|
|
|
|
|
|
# if CONFIG_IS_ENABLED(MULTI_DTB_FIT)
|
|
|
|
/*
|
|
|
|
* Try and uncompress the blob.
|
|
|
|
* Unfortunately there is no way to know how big the input blob really
|
|
|
|
* is. So let us set the maximum input size arbitrarily high. 16MB
|
|
|
|
* ought to be more than enough for packed DTBs.
|
|
|
|
*/
|
|
|
|
if (uncompress_blob(gd->fdt_blob, 0x1000000, &fdt_blob) == 0)
|
|
|
|
gd->fdt_blob = fdt_blob;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check if blob is a FIT images containings DTBs.
|
|
|
|
* If so, pick the most relevant
|
|
|
|
*/
|
|
|
|
fdt_blob = locate_dtb_in_fit(gd->fdt_blob);
|
2018-12-07 13:50:52 +00:00
|
|
|
if (fdt_blob) {
|
|
|
|
gd->multi_dtb_fit = gd->fdt_blob;
|
2017-09-15 10:57:32 +00:00
|
|
|
gd->fdt_blob = fdt_blob;
|
2018-12-07 13:50:52 +00:00
|
|
|
}
|
|
|
|
|
2017-09-15 10:57:32 +00:00
|
|
|
# endif
|
2014-03-03 11:19:30 +00:00
|
|
|
#endif
|
2017-09-15 10:57:32 +00:00
|
|
|
|
2020-04-11 19:18:59 +00:00
|
|
|
ret = fdtdec_prepare_fdt();
|
|
|
|
if (!ret)
|
|
|
|
ret = fdtdec_board_setup(gd->fdt_blob);
|
|
|
|
return ret;
|
2015-02-28 05:06:34 +00:00
|
|
|
}
|
|
|
|
|
2018-12-07 13:50:52 +00:00
|
|
|
#if CONFIG_IS_ENABLED(MULTI_DTB_FIT)
|
|
|
|
int fdtdec_resetup(int *rescan)
|
|
|
|
{
|
|
|
|
void *fdt_blob;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the current DTB is part of a compressed FIT image,
|
|
|
|
* try to locate the best match from the uncompressed
|
|
|
|
* FIT image stillpresent there. Save the time and space
|
|
|
|
* required to uncompress it again.
|
|
|
|
*/
|
|
|
|
if (gd->multi_dtb_fit) {
|
|
|
|
fdt_blob = locate_dtb_in_fit(gd->multi_dtb_fit);
|
|
|
|
|
|
|
|
if (fdt_blob == gd->fdt_blob) {
|
|
|
|
/*
|
|
|
|
* The best match did not change. no need to tear down
|
|
|
|
* the DM and rescan the fdt.
|
|
|
|
*/
|
|
|
|
*rescan = 0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
*rescan = 1;
|
|
|
|
gd->fdt_blob = fdt_blob;
|
|
|
|
return fdtdec_prepare_fdt();
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If multi_dtb_fit is NULL, it means that blob appended to u-boot is
|
|
|
|
* not a FIT image containings DTB, but a single DTB. There is no need
|
|
|
|
* to teard down DM and rescan the DT in this case.
|
|
|
|
*/
|
|
|
|
*rescan = 0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2018-06-11 19:07:09 +00:00
|
|
|
int fdtdec_decode_ram_size(const void *blob, const char *area, int board_id,
|
2020-06-26 06:13:33 +00:00
|
|
|
phys_addr_t *basep, phys_size_t *sizep,
|
|
|
|
struct bd_info *bd)
|
2018-06-11 19:07:09 +00:00
|
|
|
{
|
|
|
|
int addr_cells, size_cells;
|
|
|
|
const u32 *cell, *end;
|
|
|
|
u64 total_size, size, addr;
|
|
|
|
int node, child;
|
|
|
|
bool auto_size;
|
|
|
|
int bank;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
debug("%s: board_id=%d\n", __func__, board_id);
|
|
|
|
if (!area)
|
|
|
|
area = "/memory";
|
|
|
|
node = fdt_path_offset(blob, area);
|
|
|
|
if (node < 0) {
|
|
|
|
debug("No %s node found\n", area);
|
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
|
|
|
|
cell = fdt_getprop(blob, node, "reg", &len);
|
|
|
|
if (!cell) {
|
|
|
|
debug("No reg property found\n");
|
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
|
|
|
|
addr_cells = fdt_address_cells(blob, node);
|
|
|
|
size_cells = fdt_size_cells(blob, node);
|
|
|
|
|
|
|
|
/* Check the board id and mask */
|
|
|
|
for (child = fdt_first_subnode(blob, node);
|
|
|
|
child >= 0;
|
|
|
|
child = fdt_next_subnode(blob, child)) {
|
|
|
|
int match_mask, match_value;
|
|
|
|
|
|
|
|
match_mask = fdtdec_get_int(blob, child, "match-mask", -1);
|
|
|
|
match_value = fdtdec_get_int(blob, child, "match-value", -1);
|
|
|
|
|
|
|
|
if (match_value >= 0 &&
|
|
|
|
((board_id & match_mask) == match_value)) {
|
|
|
|
/* Found matching mask */
|
|
|
|
debug("Found matching mask %d\n", match_mask);
|
|
|
|
node = child;
|
|
|
|
cell = fdt_getprop(blob, node, "reg", &len);
|
|
|
|
if (!cell) {
|
|
|
|
debug("No memory-banks property found\n");
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* Note: if no matching subnode was found we use the parent node */
|
|
|
|
|
|
|
|
if (bd) {
|
|
|
|
memset(bd->bi_dram, '\0', sizeof(bd->bi_dram[0]) *
|
|
|
|
CONFIG_NR_DRAM_BANKS);
|
|
|
|
}
|
|
|
|
|
|
|
|
auto_size = fdtdec_get_bool(blob, node, "auto-size");
|
|
|
|
|
|
|
|
total_size = 0;
|
|
|
|
end = cell + len / 4 - addr_cells - size_cells;
|
|
|
|
debug("cell at %p, end %p\n", cell, end);
|
|
|
|
for (bank = 0; bank < CONFIG_NR_DRAM_BANKS; bank++) {
|
|
|
|
if (cell > end)
|
|
|
|
break;
|
|
|
|
addr = 0;
|
|
|
|
if (addr_cells == 2)
|
|
|
|
addr += (u64)fdt32_to_cpu(*cell++) << 32UL;
|
|
|
|
addr += fdt32_to_cpu(*cell++);
|
|
|
|
if (bd)
|
|
|
|
bd->bi_dram[bank].start = addr;
|
|
|
|
if (basep && !bank)
|
|
|
|
*basep = (phys_addr_t)addr;
|
|
|
|
|
|
|
|
size = 0;
|
|
|
|
if (size_cells == 2)
|
|
|
|
size += (u64)fdt32_to_cpu(*cell++) << 32UL;
|
|
|
|
size += fdt32_to_cpu(*cell++);
|
|
|
|
|
|
|
|
if (auto_size) {
|
|
|
|
u64 new_size;
|
|
|
|
|
2018-08-06 11:47:40 +00:00
|
|
|
debug("Auto-sizing %llx, size %llx: ", addr, size);
|
2018-06-11 19:07:09 +00:00
|
|
|
new_size = get_ram_size((long *)(uintptr_t)addr, size);
|
|
|
|
if (new_size == size) {
|
|
|
|
debug("OK\n");
|
|
|
|
} else {
|
2018-08-06 11:47:40 +00:00
|
|
|
debug("sized to %llx\n", new_size);
|
2018-06-11 19:07:09 +00:00
|
|
|
size = new_size;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (bd)
|
|
|
|
bd->bi_dram[bank].size = size;
|
|
|
|
total_size += size;
|
|
|
|
}
|
|
|
|
|
2018-08-06 11:47:40 +00:00
|
|
|
debug("Memory size %llu\n", total_size);
|
2018-06-11 19:07:09 +00:00
|
|
|
if (sizep)
|
|
|
|
*sizep = (phys_size_t)total_size;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-02-28 05:06:34 +00:00
|
|
|
#endif /* !USE_HOSTCC */
|