blob: 9a82cd0ba2f9714c748d40ba75cd61cb6fe25005 [file] [log] [blame]
Simon Glassa5e1a582019-10-27 09:47:42 -06001// SPDX-License-Identifier: (GPL-2.0-or-later OR BSD-2-Clause)
Masahiro Yamada09a9dca2017-10-17 13:42:42 +09002/*
3 * libfdt - Flat Device Tree manipulation
4 * Copyright (C) 2014 David Gibson <david@gibson.dropbear.id.au>
Matthias Brugger76ddba12019-09-05 10:48:46 +02005 * Copyright (C) 2018 embedded brains GmbH
Masahiro Yamada09a9dca2017-10-17 13:42:42 +09006 */
7#include "libfdt_env.h"
8
9#include <fdt.h>
10#include <libfdt.h>
11
12#include "libfdt_internal.h"
13
Matthias Brugger76ddba12019-09-05 10:48:46 +020014static int fdt_cells(const void *fdt, int nodeoffset, const char *name)
Masahiro Yamada09a9dca2017-10-17 13:42:42 +090015{
Matthias Brugger76ddba12019-09-05 10:48:46 +020016 const fdt32_t *c;
Matthias Bruggerab742cf2019-09-05 10:48:48 +020017 uint32_t val;
Masahiro Yamada09a9dca2017-10-17 13:42:42 +090018 int len;
19
Matthias Brugger76ddba12019-09-05 10:48:46 +020020 c = fdt_getprop(fdt, nodeoffset, name, &len);
21 if (!c)
Matthias Bruggera1d7a432019-09-05 10:48:47 +020022 return len;
Masahiro Yamada09a9dca2017-10-17 13:42:42 +090023
Matthias Brugger76ddba12019-09-05 10:48:46 +020024 if (len != sizeof(*c))
Masahiro Yamada09a9dca2017-10-17 13:42:42 +090025 return -FDT_ERR_BADNCELLS;
26
Matthias Brugger76ddba12019-09-05 10:48:46 +020027 val = fdt32_to_cpu(*c);
Matthias Bruggerab742cf2019-09-05 10:48:48 +020028 if (val > FDT_MAX_NCELLS)
Masahiro Yamada09a9dca2017-10-17 13:42:42 +090029 return -FDT_ERR_BADNCELLS;
30
Matthias Bruggerab742cf2019-09-05 10:48:48 +020031 return (int)val;
Masahiro Yamada09a9dca2017-10-17 13:42:42 +090032}
33
Matthias Brugger76ddba12019-09-05 10:48:46 +020034int fdt_address_cells(const void *fdt, int nodeoffset)
Masahiro Yamada09a9dca2017-10-17 13:42:42 +090035{
Matthias Bruggera1d7a432019-09-05 10:48:47 +020036 int val;
37
38 val = fdt_cells(fdt, nodeoffset, "#address-cells");
Matthias Bruggerab742cf2019-09-05 10:48:48 +020039 if (val == 0)
40 return -FDT_ERR_BADNCELLS;
Matthias Bruggera1d7a432019-09-05 10:48:47 +020041 if (val == -FDT_ERR_NOTFOUND)
42 return 2;
43 return val;
Matthias Brugger76ddba12019-09-05 10:48:46 +020044}
Masahiro Yamada09a9dca2017-10-17 13:42:42 +090045
Matthias Brugger76ddba12019-09-05 10:48:46 +020046int fdt_size_cells(const void *fdt, int nodeoffset)
47{
Matthias Bruggera1d7a432019-09-05 10:48:47 +020048 int val;
49
50 val = fdt_cells(fdt, nodeoffset, "#size-cells");
51 if (val == -FDT_ERR_NOTFOUND)
52 return 1;
53 return val;
Masahiro Yamada09a9dca2017-10-17 13:42:42 +090054}
Simon Glassa5e1a582019-10-27 09:47:42 -060055
56/* This function assumes that [address|size]_cells is 1 or 2 */
57int fdt_appendprop_addrrange(void *fdt, int parent, int nodeoffset,
58 const char *name, uint64_t addr, uint64_t size)
59{
60 int addr_cells, size_cells, ret;
61 uint8_t data[sizeof(fdt64_t) * 2], *prop;
62
63 ret = fdt_address_cells(fdt, parent);
64 if (ret < 0)
65 return ret;
66 addr_cells = ret;
67
68 ret = fdt_size_cells(fdt, parent);
69 if (ret < 0)
70 return ret;
71 size_cells = ret;
72
73 /* check validity of address */
74 prop = data;
75 if (addr_cells == 1) {
76 if ((addr > UINT32_MAX) || ((UINT32_MAX + 1 - addr) < size))
77 return -FDT_ERR_BADVALUE;
78
79 fdt32_st(prop, (uint32_t)addr);
80 } else if (addr_cells == 2) {
81 fdt64_st(prop, addr);
82 } else {
83 return -FDT_ERR_BADNCELLS;
84 }
85
86 /* check validity of size */
87 prop += addr_cells * sizeof(fdt32_t);
88 if (size_cells == 1) {
89 if (size > UINT32_MAX)
90 return -FDT_ERR_BADVALUE;
91
92 fdt32_st(prop, (uint32_t)size);
93 } else if (size_cells == 2) {
94 fdt64_st(prop, size);
95 } else {
96 return -FDT_ERR_BADNCELLS;
97 }
98
99 return fdt_appendprop(fdt, nodeoffset, name, data,
100 (addr_cells + size_cells) * sizeof(fdt32_t));
101}