1*54fd6939SJiyong Park /*
2*54fd6939SJiyong Park * Copyright (c) 2018-2021, ARM Limited and Contributors. All rights reserved.
3*54fd6939SJiyong Park *
4*54fd6939SJiyong Park * SPDX-License-Identifier: BSD-3-Clause
5*54fd6939SJiyong Park */
6*54fd6939SJiyong Park
7*54fd6939SJiyong Park /* Helper functions to offer easier navigation of Device Tree Blob */
8*54fd6939SJiyong Park
9*54fd6939SJiyong Park #include <assert.h>
10*54fd6939SJiyong Park #include <errno.h>
11*54fd6939SJiyong Park #include <inttypes.h>
12*54fd6939SJiyong Park #include <stdint.h>
13*54fd6939SJiyong Park #include <string.h>
14*54fd6939SJiyong Park
15*54fd6939SJiyong Park #include <libfdt.h>
16*54fd6939SJiyong Park
17*54fd6939SJiyong Park #include <common/debug.h>
18*54fd6939SJiyong Park #include <common/fdt_wrappers.h>
19*54fd6939SJiyong Park #include <common/uuid.h>
20*54fd6939SJiyong Park
21*54fd6939SJiyong Park /*
22*54fd6939SJiyong Park * Read cells from a given property of the given node. Any number of 32-bit
23*54fd6939SJiyong Park * cells of the property can be read. Returns 0 on success, or a negative
24*54fd6939SJiyong Park * FDT error value otherwise.
25*54fd6939SJiyong Park */
fdt_read_uint32_array(const void * dtb,int node,const char * prop_name,unsigned int cells,uint32_t * value)26*54fd6939SJiyong Park int fdt_read_uint32_array(const void *dtb, int node, const char *prop_name,
27*54fd6939SJiyong Park unsigned int cells, uint32_t *value)
28*54fd6939SJiyong Park {
29*54fd6939SJiyong Park const fdt32_t *prop;
30*54fd6939SJiyong Park int value_len;
31*54fd6939SJiyong Park
32*54fd6939SJiyong Park assert(dtb != NULL);
33*54fd6939SJiyong Park assert(prop_name != NULL);
34*54fd6939SJiyong Park assert(value != NULL);
35*54fd6939SJiyong Park assert(node >= 0);
36*54fd6939SJiyong Park
37*54fd6939SJiyong Park /* Access property and obtain its length (in bytes) */
38*54fd6939SJiyong Park prop = fdt_getprop(dtb, node, prop_name, &value_len);
39*54fd6939SJiyong Park if (prop == NULL) {
40*54fd6939SJiyong Park VERBOSE("Couldn't find property %s in dtb\n", prop_name);
41*54fd6939SJiyong Park return -FDT_ERR_NOTFOUND;
42*54fd6939SJiyong Park }
43*54fd6939SJiyong Park
44*54fd6939SJiyong Park /* Verify that property length can fill the entire array. */
45*54fd6939SJiyong Park if (NCELLS((unsigned int)value_len) < cells) {
46*54fd6939SJiyong Park WARN("Property length mismatch\n");
47*54fd6939SJiyong Park return -FDT_ERR_BADVALUE;
48*54fd6939SJiyong Park }
49*54fd6939SJiyong Park
50*54fd6939SJiyong Park for (unsigned int i = 0U; i < cells; i++) {
51*54fd6939SJiyong Park value[i] = fdt32_to_cpu(prop[i]);
52*54fd6939SJiyong Park }
53*54fd6939SJiyong Park
54*54fd6939SJiyong Park return 0;
55*54fd6939SJiyong Park }
56*54fd6939SJiyong Park
fdt_read_uint32(const void * dtb,int node,const char * prop_name,uint32_t * value)57*54fd6939SJiyong Park int fdt_read_uint32(const void *dtb, int node, const char *prop_name,
58*54fd6939SJiyong Park uint32_t *value)
59*54fd6939SJiyong Park {
60*54fd6939SJiyong Park return fdt_read_uint32_array(dtb, node, prop_name, 1, value);
61*54fd6939SJiyong Park }
62*54fd6939SJiyong Park
fdt_read_uint32_default(const void * dtb,int node,const char * prop_name,uint32_t dflt_value)63*54fd6939SJiyong Park uint32_t fdt_read_uint32_default(const void *dtb, int node,
64*54fd6939SJiyong Park const char *prop_name, uint32_t dflt_value)
65*54fd6939SJiyong Park {
66*54fd6939SJiyong Park uint32_t ret = dflt_value;
67*54fd6939SJiyong Park int err = fdt_read_uint32(dtb, node, prop_name, &ret);
68*54fd6939SJiyong Park
69*54fd6939SJiyong Park if (err < 0) {
70*54fd6939SJiyong Park return dflt_value;
71*54fd6939SJiyong Park }
72*54fd6939SJiyong Park
73*54fd6939SJiyong Park return ret;
74*54fd6939SJiyong Park }
75*54fd6939SJiyong Park
fdt_read_uint64(const void * dtb,int node,const char * prop_name,uint64_t * value)76*54fd6939SJiyong Park int fdt_read_uint64(const void *dtb, int node, const char *prop_name,
77*54fd6939SJiyong Park uint64_t *value)
78*54fd6939SJiyong Park {
79*54fd6939SJiyong Park uint32_t array[2] = {0, 0};
80*54fd6939SJiyong Park int ret;
81*54fd6939SJiyong Park
82*54fd6939SJiyong Park ret = fdt_read_uint32_array(dtb, node, prop_name, 2, array);
83*54fd6939SJiyong Park if (ret < 0) {
84*54fd6939SJiyong Park return ret;
85*54fd6939SJiyong Park }
86*54fd6939SJiyong Park
87*54fd6939SJiyong Park *value = ((uint64_t)array[0] << 32) | array[1];
88*54fd6939SJiyong Park return 0;
89*54fd6939SJiyong Park }
90*54fd6939SJiyong Park
91*54fd6939SJiyong Park /*
92*54fd6939SJiyong Park * Read bytes from a given property of the given node. Any number of
93*54fd6939SJiyong Park * bytes of the property can be read. The fdt pointer is updated.
94*54fd6939SJiyong Park * Returns 0 on success, and -1 on error.
95*54fd6939SJiyong Park */
fdtw_read_bytes(const void * dtb,int node,const char * prop,unsigned int length,void * value)96*54fd6939SJiyong Park int fdtw_read_bytes(const void *dtb, int node, const char *prop,
97*54fd6939SJiyong Park unsigned int length, void *value)
98*54fd6939SJiyong Park {
99*54fd6939SJiyong Park const void *ptr;
100*54fd6939SJiyong Park int value_len;
101*54fd6939SJiyong Park
102*54fd6939SJiyong Park assert(dtb != NULL);
103*54fd6939SJiyong Park assert(prop != NULL);
104*54fd6939SJiyong Park assert(value != NULL);
105*54fd6939SJiyong Park assert(node >= 0);
106*54fd6939SJiyong Park
107*54fd6939SJiyong Park /* Access property and obtain its length (in bytes) */
108*54fd6939SJiyong Park ptr = fdt_getprop_namelen(dtb, node, prop, (int)strlen(prop),
109*54fd6939SJiyong Park &value_len);
110*54fd6939SJiyong Park if (ptr == NULL) {
111*54fd6939SJiyong Park WARN("Couldn't find property %s in dtb\n", prop);
112*54fd6939SJiyong Park return -1;
113*54fd6939SJiyong Park }
114*54fd6939SJiyong Park
115*54fd6939SJiyong Park /* Verify that property length is not less than number of bytes */
116*54fd6939SJiyong Park if ((unsigned int)value_len < length) {
117*54fd6939SJiyong Park WARN("Property length mismatch\n");
118*54fd6939SJiyong Park return -1;
119*54fd6939SJiyong Park }
120*54fd6939SJiyong Park
121*54fd6939SJiyong Park (void)memcpy(value, ptr, length);
122*54fd6939SJiyong Park
123*54fd6939SJiyong Park return 0;
124*54fd6939SJiyong Park }
125*54fd6939SJiyong Park
126*54fd6939SJiyong Park /*
127*54fd6939SJiyong Park * Read string from a given property of the given node. Up to 'size - 1'
128*54fd6939SJiyong Park * characters are read, and a NUL terminator is added. Returns 0 on success,
129*54fd6939SJiyong Park * and -1 upon error.
130*54fd6939SJiyong Park */
fdtw_read_string(const void * dtb,int node,const char * prop,char * str,size_t size)131*54fd6939SJiyong Park int fdtw_read_string(const void *dtb, int node, const char *prop,
132*54fd6939SJiyong Park char *str, size_t size)
133*54fd6939SJiyong Park {
134*54fd6939SJiyong Park const char *ptr;
135*54fd6939SJiyong Park size_t len;
136*54fd6939SJiyong Park
137*54fd6939SJiyong Park assert(dtb != NULL);
138*54fd6939SJiyong Park assert(node >= 0);
139*54fd6939SJiyong Park assert(prop != NULL);
140*54fd6939SJiyong Park assert(str != NULL);
141*54fd6939SJiyong Park assert(size > 0U);
142*54fd6939SJiyong Park
143*54fd6939SJiyong Park ptr = fdt_getprop_namelen(dtb, node, prop, (int)strlen(prop), NULL);
144*54fd6939SJiyong Park if (ptr == NULL) {
145*54fd6939SJiyong Park WARN("Couldn't find property %s in dtb\n", prop);
146*54fd6939SJiyong Park return -1;
147*54fd6939SJiyong Park }
148*54fd6939SJiyong Park
149*54fd6939SJiyong Park len = strlcpy(str, ptr, size);
150*54fd6939SJiyong Park if (len >= size) {
151*54fd6939SJiyong Park WARN("String of property %s in dtb has been truncated\n", prop);
152*54fd6939SJiyong Park return -1;
153*54fd6939SJiyong Park }
154*54fd6939SJiyong Park
155*54fd6939SJiyong Park return 0;
156*54fd6939SJiyong Park }
157*54fd6939SJiyong Park
158*54fd6939SJiyong Park /*
159*54fd6939SJiyong Park * Read UUID from a given property of the given node. Returns 0 on success,
160*54fd6939SJiyong Park * and a negative value upon error.
161*54fd6939SJiyong Park */
fdtw_read_uuid(const void * dtb,int node,const char * prop,unsigned int length,uint8_t * uuid)162*54fd6939SJiyong Park int fdtw_read_uuid(const void *dtb, int node, const char *prop,
163*54fd6939SJiyong Park unsigned int length, uint8_t *uuid)
164*54fd6939SJiyong Park {
165*54fd6939SJiyong Park /* Buffer for UUID string (plus NUL terminator) */
166*54fd6939SJiyong Park char uuid_string[UUID_STRING_LENGTH + 1U];
167*54fd6939SJiyong Park int err;
168*54fd6939SJiyong Park
169*54fd6939SJiyong Park assert(dtb != NULL);
170*54fd6939SJiyong Park assert(prop != NULL);
171*54fd6939SJiyong Park assert(uuid != NULL);
172*54fd6939SJiyong Park assert(node >= 0);
173*54fd6939SJiyong Park
174*54fd6939SJiyong Park if (length < UUID_BYTES_LENGTH) {
175*54fd6939SJiyong Park return -EINVAL;
176*54fd6939SJiyong Park }
177*54fd6939SJiyong Park
178*54fd6939SJiyong Park err = fdtw_read_string(dtb, node, prop, uuid_string,
179*54fd6939SJiyong Park UUID_STRING_LENGTH + 1U);
180*54fd6939SJiyong Park if (err != 0) {
181*54fd6939SJiyong Park return err;
182*54fd6939SJiyong Park }
183*54fd6939SJiyong Park
184*54fd6939SJiyong Park if (read_uuid(uuid, uuid_string) != 0) {
185*54fd6939SJiyong Park return -FDT_ERR_BADVALUE;
186*54fd6939SJiyong Park }
187*54fd6939SJiyong Park
188*54fd6939SJiyong Park return 0;
189*54fd6939SJiyong Park }
190*54fd6939SJiyong Park
191*54fd6939SJiyong Park /*
192*54fd6939SJiyong Park * Write cells in place to a given property of the given node. At most 2 cells
193*54fd6939SJiyong Park * of the property are written. Returns 0 on success, and -1 upon error.
194*54fd6939SJiyong Park */
fdtw_write_inplace_cells(void * dtb,int node,const char * prop,unsigned int cells,void * value)195*54fd6939SJiyong Park int fdtw_write_inplace_cells(void *dtb, int node, const char *prop,
196*54fd6939SJiyong Park unsigned int cells, void *value)
197*54fd6939SJiyong Park {
198*54fd6939SJiyong Park int err, len;
199*54fd6939SJiyong Park
200*54fd6939SJiyong Park assert(dtb != NULL);
201*54fd6939SJiyong Park assert(prop != NULL);
202*54fd6939SJiyong Park assert(value != NULL);
203*54fd6939SJiyong Park assert(node >= 0);
204*54fd6939SJiyong Park
205*54fd6939SJiyong Park /* We expect either 1 or 2 cell property */
206*54fd6939SJiyong Park assert(cells <= 2U);
207*54fd6939SJiyong Park
208*54fd6939SJiyong Park if (cells == 2U)
209*54fd6939SJiyong Park *(uint64_t *)value = cpu_to_fdt64(*(uint64_t *)value);
210*54fd6939SJiyong Park else
211*54fd6939SJiyong Park *(uint32_t *)value = cpu_to_fdt32(*(uint32_t *)value);
212*54fd6939SJiyong Park
213*54fd6939SJiyong Park len = (int)cells * 4;
214*54fd6939SJiyong Park
215*54fd6939SJiyong Park /* Set property value in place */
216*54fd6939SJiyong Park err = fdt_setprop_inplace(dtb, node, prop, value, len);
217*54fd6939SJiyong Park if (err != 0) {
218*54fd6939SJiyong Park WARN("Modify property %s failed with error %d\n", prop, err);
219*54fd6939SJiyong Park return -1;
220*54fd6939SJiyong Park }
221*54fd6939SJiyong Park
222*54fd6939SJiyong Park return 0;
223*54fd6939SJiyong Park }
224*54fd6939SJiyong Park
225*54fd6939SJiyong Park /*
226*54fd6939SJiyong Park * Write bytes in place to a given property of the given node.
227*54fd6939SJiyong Park * Any number of bytes of the property can be written.
228*54fd6939SJiyong Park * Returns 0 on success, and < 0 on error.
229*54fd6939SJiyong Park */
fdtw_write_inplace_bytes(void * dtb,int node,const char * prop,unsigned int length,const void * data)230*54fd6939SJiyong Park int fdtw_write_inplace_bytes(void *dtb, int node, const char *prop,
231*54fd6939SJiyong Park unsigned int length, const void *data)
232*54fd6939SJiyong Park {
233*54fd6939SJiyong Park const void *ptr;
234*54fd6939SJiyong Park int namelen, value_len, err;
235*54fd6939SJiyong Park
236*54fd6939SJiyong Park assert(dtb != NULL);
237*54fd6939SJiyong Park assert(prop != NULL);
238*54fd6939SJiyong Park assert(data != NULL);
239*54fd6939SJiyong Park assert(node >= 0);
240*54fd6939SJiyong Park
241*54fd6939SJiyong Park namelen = (int)strlen(prop);
242*54fd6939SJiyong Park
243*54fd6939SJiyong Park /* Access property and obtain its length in bytes */
244*54fd6939SJiyong Park ptr = fdt_getprop_namelen(dtb, node, prop, namelen, &value_len);
245*54fd6939SJiyong Park if (ptr == NULL) {
246*54fd6939SJiyong Park WARN("Couldn't find property %s in dtb\n", prop);
247*54fd6939SJiyong Park return -1;
248*54fd6939SJiyong Park }
249*54fd6939SJiyong Park
250*54fd6939SJiyong Park /* Verify that property length is not less than number of bytes */
251*54fd6939SJiyong Park if ((unsigned int)value_len < length) {
252*54fd6939SJiyong Park WARN("Property length mismatch\n");
253*54fd6939SJiyong Park return -1;
254*54fd6939SJiyong Park }
255*54fd6939SJiyong Park
256*54fd6939SJiyong Park /* Set property value in place */
257*54fd6939SJiyong Park err = fdt_setprop_inplace_namelen_partial(dtb, node, prop,
258*54fd6939SJiyong Park namelen, 0,
259*54fd6939SJiyong Park data, (int)length);
260*54fd6939SJiyong Park if (err != 0) {
261*54fd6939SJiyong Park WARN("Set property %s failed with error %d\n", prop, err);
262*54fd6939SJiyong Park }
263*54fd6939SJiyong Park
264*54fd6939SJiyong Park return err;
265*54fd6939SJiyong Park }
266*54fd6939SJiyong Park
fdt_read_prop_cells(const fdt32_t * prop,int nr_cells)267*54fd6939SJiyong Park static uint64_t fdt_read_prop_cells(const fdt32_t *prop, int nr_cells)
268*54fd6939SJiyong Park {
269*54fd6939SJiyong Park uint64_t reg = fdt32_to_cpu(prop[0]);
270*54fd6939SJiyong Park
271*54fd6939SJiyong Park if (nr_cells > 1) {
272*54fd6939SJiyong Park reg = (reg << 32) | fdt32_to_cpu(prop[1]);
273*54fd6939SJiyong Park }
274*54fd6939SJiyong Park
275*54fd6939SJiyong Park return reg;
276*54fd6939SJiyong Park }
277*54fd6939SJiyong Park
fdt_get_reg_props_by_index(const void * dtb,int node,int index,uintptr_t * base,size_t * size)278*54fd6939SJiyong Park int fdt_get_reg_props_by_index(const void *dtb, int node, int index,
279*54fd6939SJiyong Park uintptr_t *base, size_t *size)
280*54fd6939SJiyong Park {
281*54fd6939SJiyong Park const fdt32_t *prop;
282*54fd6939SJiyong Park int parent, len;
283*54fd6939SJiyong Park int ac, sc;
284*54fd6939SJiyong Park int cell;
285*54fd6939SJiyong Park
286*54fd6939SJiyong Park parent = fdt_parent_offset(dtb, node);
287*54fd6939SJiyong Park if (parent < 0) {
288*54fd6939SJiyong Park return -FDT_ERR_BADOFFSET;
289*54fd6939SJiyong Park }
290*54fd6939SJiyong Park
291*54fd6939SJiyong Park ac = fdt_address_cells(dtb, parent);
292*54fd6939SJiyong Park sc = fdt_size_cells(dtb, parent);
293*54fd6939SJiyong Park
294*54fd6939SJiyong Park cell = index * (ac + sc);
295*54fd6939SJiyong Park
296*54fd6939SJiyong Park prop = fdt_getprop(dtb, node, "reg", &len);
297*54fd6939SJiyong Park if (prop == NULL) {
298*54fd6939SJiyong Park WARN("Couldn't find \"reg\" property in dtb\n");
299*54fd6939SJiyong Park return -FDT_ERR_NOTFOUND;
300*54fd6939SJiyong Park }
301*54fd6939SJiyong Park
302*54fd6939SJiyong Park if (((cell + ac + sc) * (int)sizeof(uint32_t)) > len) {
303*54fd6939SJiyong Park return -FDT_ERR_BADVALUE;
304*54fd6939SJiyong Park }
305*54fd6939SJiyong Park
306*54fd6939SJiyong Park if (base != NULL) {
307*54fd6939SJiyong Park *base = (uintptr_t)fdt_read_prop_cells(&prop[cell], ac);
308*54fd6939SJiyong Park }
309*54fd6939SJiyong Park
310*54fd6939SJiyong Park if (size != NULL) {
311*54fd6939SJiyong Park *size = (size_t)fdt_read_prop_cells(&prop[cell + ac], sc);
312*54fd6939SJiyong Park }
313*54fd6939SJiyong Park
314*54fd6939SJiyong Park return 0;
315*54fd6939SJiyong Park }
316*54fd6939SJiyong Park
317*54fd6939SJiyong Park /*******************************************************************************
318*54fd6939SJiyong Park * This function fills reg node info (base & size) with an index found by
319*54fd6939SJiyong Park * checking the reg-names node.
320*54fd6939SJiyong Park * Returns 0 on success and a negative FDT error code on failure.
321*54fd6939SJiyong Park ******************************************************************************/
fdt_get_reg_props_by_name(const void * dtb,int node,const char * name,uintptr_t * base,size_t * size)322*54fd6939SJiyong Park int fdt_get_reg_props_by_name(const void *dtb, int node, const char *name,
323*54fd6939SJiyong Park uintptr_t *base, size_t *size)
324*54fd6939SJiyong Park {
325*54fd6939SJiyong Park int index;
326*54fd6939SJiyong Park
327*54fd6939SJiyong Park index = fdt_stringlist_search(dtb, node, "reg-names", name);
328*54fd6939SJiyong Park if (index < 0) {
329*54fd6939SJiyong Park return index;
330*54fd6939SJiyong Park }
331*54fd6939SJiyong Park
332*54fd6939SJiyong Park return fdt_get_reg_props_by_index(dtb, node, index, base, size);
333*54fd6939SJiyong Park }
334*54fd6939SJiyong Park
335*54fd6939SJiyong Park /*******************************************************************************
336*54fd6939SJiyong Park * This function gets the stdout path node.
337*54fd6939SJiyong Park * It reads the value indicated inside the device tree.
338*54fd6939SJiyong Park * Returns node offset on success and a negative FDT error code on failure.
339*54fd6939SJiyong Park ******************************************************************************/
fdt_get_stdout_node_offset(const void * dtb)340*54fd6939SJiyong Park int fdt_get_stdout_node_offset(const void *dtb)
341*54fd6939SJiyong Park {
342*54fd6939SJiyong Park int node;
343*54fd6939SJiyong Park const char *prop, *path;
344*54fd6939SJiyong Park int len;
345*54fd6939SJiyong Park
346*54fd6939SJiyong Park /* The /secure-chosen node takes precedence over the standard one. */
347*54fd6939SJiyong Park node = fdt_path_offset(dtb, "/secure-chosen");
348*54fd6939SJiyong Park if (node < 0) {
349*54fd6939SJiyong Park node = fdt_path_offset(dtb, "/chosen");
350*54fd6939SJiyong Park if (node < 0) {
351*54fd6939SJiyong Park return -FDT_ERR_NOTFOUND;
352*54fd6939SJiyong Park }
353*54fd6939SJiyong Park }
354*54fd6939SJiyong Park
355*54fd6939SJiyong Park prop = fdt_getprop(dtb, node, "stdout-path", NULL);
356*54fd6939SJiyong Park if (prop == NULL) {
357*54fd6939SJiyong Park return -FDT_ERR_NOTFOUND;
358*54fd6939SJiyong Park }
359*54fd6939SJiyong Park
360*54fd6939SJiyong Park /* Determine the actual path length, as a colon terminates the path. */
361*54fd6939SJiyong Park path = strchr(prop, ':');
362*54fd6939SJiyong Park if (path == NULL) {
363*54fd6939SJiyong Park len = strlen(prop);
364*54fd6939SJiyong Park } else {
365*54fd6939SJiyong Park len = path - prop;
366*54fd6939SJiyong Park }
367*54fd6939SJiyong Park
368*54fd6939SJiyong Park /* Aliases cannot start with a '/', so it must be the actual path. */
369*54fd6939SJiyong Park if (prop[0] == '/') {
370*54fd6939SJiyong Park return fdt_path_offset_namelen(dtb, prop, len);
371*54fd6939SJiyong Park }
372*54fd6939SJiyong Park
373*54fd6939SJiyong Park /* Lookup the alias, as this contains the actual path. */
374*54fd6939SJiyong Park path = fdt_get_alias_namelen(dtb, prop, len);
375*54fd6939SJiyong Park if (path == NULL) {
376*54fd6939SJiyong Park return -FDT_ERR_NOTFOUND;
377*54fd6939SJiyong Park }
378*54fd6939SJiyong Park
379*54fd6939SJiyong Park return fdt_path_offset(dtb, path);
380*54fd6939SJiyong Park }
381*54fd6939SJiyong Park
382*54fd6939SJiyong Park
383*54fd6939SJiyong Park /*******************************************************************************
384*54fd6939SJiyong Park * Only devices which are direct children of root node use CPU address domain.
385*54fd6939SJiyong Park * All other devices use addresses that are local to the device node and cannot
386*54fd6939SJiyong Park * directly used by CPU. Device tree provides an address translation mechanism
387*54fd6939SJiyong Park * through "ranges" property which provides mappings from local address space to
388*54fd6939SJiyong Park * parent address space. Since a device could be a child of a child node to the
389*54fd6939SJiyong Park * root node, there can be more than one level of address translation needed to
390*54fd6939SJiyong Park * map the device local address space to CPU address space.
391*54fd6939SJiyong Park * fdtw_translate_address() API performs address translation of a local address
392*54fd6939SJiyong Park * to a global address with help of various helper functions.
393*54fd6939SJiyong Park ******************************************************************************/
394*54fd6939SJiyong Park
fdtw_xlat_hit(const uint32_t * value,int child_addr_size,int parent_addr_size,int range_size,uint64_t base_address,uint64_t * translated_addr)395*54fd6939SJiyong Park static bool fdtw_xlat_hit(const uint32_t *value, int child_addr_size,
396*54fd6939SJiyong Park int parent_addr_size, int range_size, uint64_t base_address,
397*54fd6939SJiyong Park uint64_t *translated_addr)
398*54fd6939SJiyong Park {
399*54fd6939SJiyong Park uint64_t local_address, parent_address, addr_range;
400*54fd6939SJiyong Park
401*54fd6939SJiyong Park local_address = fdt_read_prop_cells(value, child_addr_size);
402*54fd6939SJiyong Park parent_address = fdt_read_prop_cells(value + child_addr_size,
403*54fd6939SJiyong Park parent_addr_size);
404*54fd6939SJiyong Park addr_range = fdt_read_prop_cells(value + child_addr_size +
405*54fd6939SJiyong Park parent_addr_size,
406*54fd6939SJiyong Park range_size);
407*54fd6939SJiyong Park VERBOSE("DT: Address %" PRIx64 " mapped to %" PRIx64 " with range %" PRIx64 "\n",
408*54fd6939SJiyong Park local_address, parent_address, addr_range);
409*54fd6939SJiyong Park
410*54fd6939SJiyong Park /* Perform range check */
411*54fd6939SJiyong Park if ((base_address < local_address) ||
412*54fd6939SJiyong Park (base_address >= local_address + addr_range)) {
413*54fd6939SJiyong Park return false;
414*54fd6939SJiyong Park }
415*54fd6939SJiyong Park
416*54fd6939SJiyong Park /* Found hit for the addr range that needs to be translated */
417*54fd6939SJiyong Park *translated_addr = parent_address + (base_address - local_address);
418*54fd6939SJiyong Park VERBOSE("DT: child address %" PRIx64 "mapped to %" PRIx64 " in parent bus\n",
419*54fd6939SJiyong Park local_address, parent_address);
420*54fd6939SJiyong Park return true;
421*54fd6939SJiyong Park }
422*54fd6939SJiyong Park
423*54fd6939SJiyong Park #define ILLEGAL_ADDR ULL(~0)
424*54fd6939SJiyong Park
fdtw_search_all_xlat_entries(const void * dtb,const struct fdt_property * ranges_prop,int local_bus,uint64_t base_address)425*54fd6939SJiyong Park static uint64_t fdtw_search_all_xlat_entries(const void *dtb,
426*54fd6939SJiyong Park const struct fdt_property *ranges_prop,
427*54fd6939SJiyong Park int local_bus, uint64_t base_address)
428*54fd6939SJiyong Park {
429*54fd6939SJiyong Park uint64_t translated_addr;
430*54fd6939SJiyong Park const uint32_t *next_entry;
431*54fd6939SJiyong Park int parent_bus_node, nxlat_entries, length;
432*54fd6939SJiyong Park int self_addr_cells, parent_addr_cells, self_size_cells, ncells_xlat;
433*54fd6939SJiyong Park
434*54fd6939SJiyong Park /*
435*54fd6939SJiyong Park * The number of cells in one translation entry in ranges is the sum of
436*54fd6939SJiyong Park * the following values:
437*54fd6939SJiyong Park * self#address-cells + parent#address-cells + self#size-cells
438*54fd6939SJiyong Park * Ex: the iofpga ranges property has one translation entry with 4 cells
439*54fd6939SJiyong Park * They represent iofpga#addr-cells + motherboard#addr-cells + iofpga#size-cells
440*54fd6939SJiyong Park * = 1 + 2 + 1
441*54fd6939SJiyong Park */
442*54fd6939SJiyong Park
443*54fd6939SJiyong Park parent_bus_node = fdt_parent_offset(dtb, local_bus);
444*54fd6939SJiyong Park self_addr_cells = fdt_address_cells(dtb, local_bus);
445*54fd6939SJiyong Park self_size_cells = fdt_size_cells(dtb, local_bus);
446*54fd6939SJiyong Park parent_addr_cells = fdt_address_cells(dtb, parent_bus_node);
447*54fd6939SJiyong Park
448*54fd6939SJiyong Park /* Number of cells per translation entry i.e., mapping */
449*54fd6939SJiyong Park ncells_xlat = self_addr_cells + parent_addr_cells + self_size_cells;
450*54fd6939SJiyong Park
451*54fd6939SJiyong Park assert(ncells_xlat > 0);
452*54fd6939SJiyong Park
453*54fd6939SJiyong Park /*
454*54fd6939SJiyong Park * Find the number of translations(mappings) specified in the current
455*54fd6939SJiyong Park * `ranges` property. Note that length represents number of bytes and
456*54fd6939SJiyong Park * is stored in big endian mode.
457*54fd6939SJiyong Park */
458*54fd6939SJiyong Park length = fdt32_to_cpu(ranges_prop->len);
459*54fd6939SJiyong Park nxlat_entries = (length/sizeof(uint32_t))/ncells_xlat;
460*54fd6939SJiyong Park
461*54fd6939SJiyong Park assert(nxlat_entries > 0);
462*54fd6939SJiyong Park
463*54fd6939SJiyong Park next_entry = (const uint32_t *)ranges_prop->data;
464*54fd6939SJiyong Park
465*54fd6939SJiyong Park /* Iterate over the entries in the "ranges" */
466*54fd6939SJiyong Park for (int i = 0; i < nxlat_entries; i++) {
467*54fd6939SJiyong Park if (fdtw_xlat_hit(next_entry, self_addr_cells,
468*54fd6939SJiyong Park parent_addr_cells, self_size_cells, base_address,
469*54fd6939SJiyong Park &translated_addr)){
470*54fd6939SJiyong Park return translated_addr;
471*54fd6939SJiyong Park }
472*54fd6939SJiyong Park next_entry = next_entry + ncells_xlat;
473*54fd6939SJiyong Park }
474*54fd6939SJiyong Park
475*54fd6939SJiyong Park INFO("DT: No translation found for address %" PRIx64 " in node %s\n",
476*54fd6939SJiyong Park base_address, fdt_get_name(dtb, local_bus, NULL));
477*54fd6939SJiyong Park return ILLEGAL_ADDR;
478*54fd6939SJiyong Park }
479*54fd6939SJiyong Park
480*54fd6939SJiyong Park
481*54fd6939SJiyong Park /*******************************************************************************
482*54fd6939SJiyong Park * address mapping needs to be done recursively starting from current node to
483*54fd6939SJiyong Park * root node through all intermediate parent nodes.
484*54fd6939SJiyong Park * Sample device tree is shown here:
485*54fd6939SJiyong Park
486*54fd6939SJiyong Park smb@0,0 {
487*54fd6939SJiyong Park compatible = "simple-bus";
488*54fd6939SJiyong Park
489*54fd6939SJiyong Park #address-cells = <2>;
490*54fd6939SJiyong Park #size-cells = <1>;
491*54fd6939SJiyong Park ranges = <0 0 0 0x08000000 0x04000000>,
492*54fd6939SJiyong Park <1 0 0 0x14000000 0x04000000>,
493*54fd6939SJiyong Park <2 0 0 0x18000000 0x04000000>,
494*54fd6939SJiyong Park <3 0 0 0x1c000000 0x04000000>,
495*54fd6939SJiyong Park <4 0 0 0x0c000000 0x04000000>,
496*54fd6939SJiyong Park <5 0 0 0x10000000 0x04000000>;
497*54fd6939SJiyong Park
498*54fd6939SJiyong Park motherboard {
499*54fd6939SJiyong Park arm,v2m-memory-map = "rs1";
500*54fd6939SJiyong Park compatible = "arm,vexpress,v2m-p1", "simple-bus";
501*54fd6939SJiyong Park #address-cells = <2>;
502*54fd6939SJiyong Park #size-cells = <1>;
503*54fd6939SJiyong Park ranges;
504*54fd6939SJiyong Park
505*54fd6939SJiyong Park iofpga@3,00000000 {
506*54fd6939SJiyong Park compatible = "arm,amba-bus", "simple-bus";
507*54fd6939SJiyong Park #address-cells = <1>;
508*54fd6939SJiyong Park #size-cells = <1>;
509*54fd6939SJiyong Park ranges = <0 3 0 0x200000>;
510*54fd6939SJiyong Park v2m_serial1: uart@a0000 {
511*54fd6939SJiyong Park compatible = "arm,pl011", "arm,primecell";
512*54fd6939SJiyong Park reg = <0x0a0000 0x1000>;
513*54fd6939SJiyong Park interrupts = <0 6 4>;
514*54fd6939SJiyong Park clocks = <&v2m_clk24mhz>, <&v2m_clk24mhz>;
515*54fd6939SJiyong Park clock-names = "uartclk", "apb_pclk";
516*54fd6939SJiyong Park };
517*54fd6939SJiyong Park };
518*54fd6939SJiyong Park };
519*54fd6939SJiyong Park
520*54fd6939SJiyong Park * As seen above, there are 3 levels of address translations needed. An empty
521*54fd6939SJiyong Park * `ranges` property denotes identity mapping (as seen in `motherboard` node).
522*54fd6939SJiyong Park * Each ranges property can map a set of child addresses to parent bus. Hence
523*54fd6939SJiyong Park * there can be more than 1 (translation) entry in the ranges property as seen
524*54fd6939SJiyong Park * in the `smb` node which has 6 translation entries.
525*54fd6939SJiyong Park ******************************************************************************/
526*54fd6939SJiyong Park
527*54fd6939SJiyong Park /* Recursive implementation */
fdtw_translate_address(const void * dtb,int node,uint64_t base_address)528*54fd6939SJiyong Park uint64_t fdtw_translate_address(const void *dtb, int node,
529*54fd6939SJiyong Park uint64_t base_address)
530*54fd6939SJiyong Park {
531*54fd6939SJiyong Park int length, local_bus_node;
532*54fd6939SJiyong Park const char *node_name;
533*54fd6939SJiyong Park uint64_t global_address;
534*54fd6939SJiyong Park
535*54fd6939SJiyong Park local_bus_node = fdt_parent_offset(dtb, node);
536*54fd6939SJiyong Park node_name = fdt_get_name(dtb, local_bus_node, NULL);
537*54fd6939SJiyong Park
538*54fd6939SJiyong Park /*
539*54fd6939SJiyong Park * In the example given above, starting from the leaf node:
540*54fd6939SJiyong Park * uart@a000 represents the current node
541*54fd6939SJiyong Park * iofpga@3,00000000 represents the local bus
542*54fd6939SJiyong Park * motherboard represents the parent bus
543*54fd6939SJiyong Park */
544*54fd6939SJiyong Park
545*54fd6939SJiyong Park /* Read the ranges property */
546*54fd6939SJiyong Park const struct fdt_property *property = fdt_get_property(dtb,
547*54fd6939SJiyong Park local_bus_node, "ranges", &length);
548*54fd6939SJiyong Park
549*54fd6939SJiyong Park if (property == NULL) {
550*54fd6939SJiyong Park if (local_bus_node == 0) {
551*54fd6939SJiyong Park /*
552*54fd6939SJiyong Park * root node doesn't have range property as addresses
553*54fd6939SJiyong Park * are in CPU address space.
554*54fd6939SJiyong Park */
555*54fd6939SJiyong Park return base_address;
556*54fd6939SJiyong Park }
557*54fd6939SJiyong Park INFO("DT: Couldn't find ranges property in node %s\n",
558*54fd6939SJiyong Park node_name);
559*54fd6939SJiyong Park return ILLEGAL_ADDR;
560*54fd6939SJiyong Park } else if (length == 0) {
561*54fd6939SJiyong Park /* empty ranges indicates identity map to parent bus */
562*54fd6939SJiyong Park return fdtw_translate_address(dtb, local_bus_node, base_address);
563*54fd6939SJiyong Park }
564*54fd6939SJiyong Park
565*54fd6939SJiyong Park VERBOSE("DT: Translation lookup in node %s at offset %d\n", node_name,
566*54fd6939SJiyong Park local_bus_node);
567*54fd6939SJiyong Park global_address = fdtw_search_all_xlat_entries(dtb, property,
568*54fd6939SJiyong Park local_bus_node, base_address);
569*54fd6939SJiyong Park
570*54fd6939SJiyong Park if (global_address == ILLEGAL_ADDR) {
571*54fd6939SJiyong Park return ILLEGAL_ADDR;
572*54fd6939SJiyong Park }
573*54fd6939SJiyong Park
574*54fd6939SJiyong Park /* Translate the local device address recursively */
575*54fd6939SJiyong Park return fdtw_translate_address(dtb, local_bus_node, global_address);
576*54fd6939SJiyong Park }
577*54fd6939SJiyong Park
578*54fd6939SJiyong Park /*
579*54fd6939SJiyong Park * For every CPU node (`/cpus/cpu@n`) in an FDT, execute a callback passing a
580*54fd6939SJiyong Park * pointer to the FDT and the offset of the CPU node. If the return value of the
581*54fd6939SJiyong Park * callback is negative, it is treated as an error and the loop is aborted. In
582*54fd6939SJiyong Park * this situation, the value of the callback is returned from the function.
583*54fd6939SJiyong Park *
584*54fd6939SJiyong Park * Returns `0` on success, or a negative integer representing an error code.
585*54fd6939SJiyong Park */
fdtw_for_each_cpu(const void * dtb,int (* callback)(const void * dtb,int node,uintptr_t mpidr))586*54fd6939SJiyong Park int fdtw_for_each_cpu(const void *dtb,
587*54fd6939SJiyong Park int (*callback)(const void *dtb, int node, uintptr_t mpidr))
588*54fd6939SJiyong Park {
589*54fd6939SJiyong Park int ret = 0;
590*54fd6939SJiyong Park int parent, node = 0;
591*54fd6939SJiyong Park
592*54fd6939SJiyong Park parent = fdt_path_offset(dtb, "/cpus");
593*54fd6939SJiyong Park if (parent < 0) {
594*54fd6939SJiyong Park return parent;
595*54fd6939SJiyong Park }
596*54fd6939SJiyong Park
597*54fd6939SJiyong Park fdt_for_each_subnode(node, dtb, parent) {
598*54fd6939SJiyong Park const char *name;
599*54fd6939SJiyong Park int len;
600*54fd6939SJiyong Park
601*54fd6939SJiyong Park uintptr_t mpidr = 0U;
602*54fd6939SJiyong Park
603*54fd6939SJiyong Park name = fdt_get_name(dtb, node, &len);
604*54fd6939SJiyong Park if (strncmp(name, "cpu@", 4) != 0) {
605*54fd6939SJiyong Park continue;
606*54fd6939SJiyong Park }
607*54fd6939SJiyong Park
608*54fd6939SJiyong Park ret = fdt_get_reg_props_by_index(dtb, node, 0, &mpidr, NULL);
609*54fd6939SJiyong Park if (ret < 0) {
610*54fd6939SJiyong Park break;
611*54fd6939SJiyong Park }
612*54fd6939SJiyong Park
613*54fd6939SJiyong Park ret = callback(dtb, node, mpidr);
614*54fd6939SJiyong Park if (ret < 0) {
615*54fd6939SJiyong Park break;
616*54fd6939SJiyong Park }
617*54fd6939SJiyong Park }
618*54fd6939SJiyong Park
619*54fd6939SJiyong Park return ret;
620*54fd6939SJiyong Park }
621