]> git.ipfire.org Git - people/ms/u-boot.git/blame - include/libfdt.h
fdt: Add a function to count strings
[people/ms/u-boot.git] / include / libfdt.h
CommitLineData
8d04f02f
KG
1#ifndef _LIBFDT_H
2#define _LIBFDT_H
7cd5da0f
GVB
3/*
4 * libfdt - Flat Device Tree manipulation
5 * Copyright (C) 2006 David Gibson, IBM Corporation.
6 *
8d04f02f
KG
7 * libfdt is dual licensed: you can use it either under the terms of
8 * the GPL, or the BSD license, at your option.
9 *
10 * a) This library is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public License as
12 * published by the Free Software Foundation; either version 2 of the
13 * License, or (at your option) any later version.
14 *
15 * This library is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
19 *
20 * You should have received a copy of the GNU General Public
21 * License along with this library; if not, write to the Free
22 * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
23 * MA 02110-1301 USA
24 *
25 * Alternatively,
26 *
27 * b) Redistribution and use in source and binary forms, with or
28 * without modification, are permitted provided that the following
29 * conditions are met:
7cd5da0f 30 *
8d04f02f
KG
31 * 1. Redistributions of source code must retain the above
32 * copyright notice, this list of conditions and the following
33 * disclaimer.
34 * 2. Redistributions in binary form must reproduce the above
35 * copyright notice, this list of conditions and the following
36 * disclaimer in the documentation and/or other materials
37 * provided with the distribution.
7cd5da0f 38 *
8d04f02f
KG
39 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
40 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
41 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
42 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
43 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
44 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
45 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
46 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
47 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
49 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
50 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
51 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
7cd5da0f
GVB
52 */
53
7cd5da0f 54#include <libfdt_env.h>
8d04f02f 55#include <fdt.h>
7cd5da0f
GVB
56
57#define FDT_FIRST_SUPPORTED_VERSION 0x10
58#define FDT_LAST_SUPPORTED_VERSION 0x11
59
60/* Error codes: informative error codes */
61#define FDT_ERR_NOTFOUND 1
8d04f02f 62 /* FDT_ERR_NOTFOUND: The requested node or property does not exist */
7cd5da0f 63#define FDT_ERR_EXISTS 2
8d04f02f
KG
64 /* FDT_ERR_EXISTS: Attemped to create a node or property which
65 * already exists */
7cd5da0f 66#define FDT_ERR_NOSPACE 3
8d04f02f
KG
67 /* FDT_ERR_NOSPACE: Operation needed to expand the device
68 * tree, but its buffer did not have sufficient space to
69 * contain the expanded tree. Use fdt_open_into() to move the
70 * device tree to a buffer with more space. */
7cd5da0f
GVB
71
72/* Error codes: codes for bad parameters */
73#define FDT_ERR_BADOFFSET 4
8d04f02f
KG
74 /* FDT_ERR_BADOFFSET: Function was passed a structure block
75 * offset which is out-of-bounds, or which points to an
76 * unsuitable part of the structure for the operation. */
7cd5da0f 77#define FDT_ERR_BADPATH 5
8d04f02f
KG
78 /* FDT_ERR_BADPATH: Function was passed a badly formatted path
79 * (e.g. missing a leading / for a function which requires an
80 * absolute path) */
81#define FDT_ERR_BADPHANDLE 6
82 /* FDT_ERR_BADPHANDLE: Function was passed an invalid phandle
83 * value. phandle values of 0 and -1 are not permitted. */
84#define FDT_ERR_BADSTATE 7
85 /* FDT_ERR_BADSTATE: Function was passed an incomplete device
86 * tree created by the sequential-write functions, which is
87 * not sufficiently complete for the requested operation. */
7cd5da0f
GVB
88
89/* Error codes: codes for bad device tree blobs */
8d04f02f
KG
90#define FDT_ERR_TRUNCATED 8
91 /* FDT_ERR_TRUNCATED: Structure block of the given device tree
92 * ends without an FDT_END tag. */
93#define FDT_ERR_BADMAGIC 9
94 /* FDT_ERR_BADMAGIC: Given "device tree" appears not to be a
95 * device tree at all - it is missing the flattened device
96 * tree magic number. */
97#define FDT_ERR_BADVERSION 10
98 /* FDT_ERR_BADVERSION: Given device tree has a version which
99 * can't be handled by the requested operation. For
100 * read-write functions, this may mean that fdt_open_into() is
101 * required to convert the tree to the expected version. */
102#define FDT_ERR_BADSTRUCTURE 11
103 /* FDT_ERR_BADSTRUCTURE: Given device tree has a corrupt
104 * structure block or other serious error (e.g. misnested
105 * nodes, or subnodes preceding properties). */
106#define FDT_ERR_BADLAYOUT 12
107 /* FDT_ERR_BADLAYOUT: For read-write functions, the given
108 * device tree has it's sub-blocks in an order that the
109 * function can't handle (memory reserve map, then structure,
110 * then strings). Use fdt_open_into() to reorganize the tree
111 * into a form suitable for the read-write operations. */
112
113/* "Can't happen" error indicating a bug in libfdt */
114#define FDT_ERR_INTERNAL 13
115 /* FDT_ERR_INTERNAL: libfdt has failed an internal assertion.
116 * Should never be returned, if it is, it indicates a bug in
117 * libfdt itself. */
7cd5da0f 118
0596d35d
SG
119/* Errors in device tree content */
120#define FDT_ERR_BADNCELLS 14
121 /* FDT_ERR_BADNCELLS: Device tree has a #address-cells, #size-cells
122 * or similar property with a bad format or value */
123
124#define FDT_ERR_MAX 14
8d04f02f
KG
125
126/**********************************************************************/
127/* Low-level functions (you probably don't need these) */
128/**********************************************************************/
129
741a6d01 130const void *fdt_offset_ptr(const void *fdt, int offset, unsigned int checklen);
8d04f02f
KG
131static inline void *fdt_offset_ptr_w(void *fdt, int offset, int checklen)
132{
c6683026 133 return (void *)(uintptr_t)fdt_offset_ptr(fdt, offset, checklen);
8d04f02f
KG
134}
135
136uint32_t fdt_next_tag(const void *fdt, int offset, int *nextoffset);
137
ae0b5908
DG
138/**********************************************************************/
139/* Traversal functions */
140/**********************************************************************/
141
142int fdt_next_node(const void *fdt, int offset, int *depth);
143
88f95bba
SG
144/**
145 * fdt_first_subnode() - get offset of first direct subnode
146 *
147 * @fdt: FDT blob
148 * @offset: Offset of node to check
149 * @return offset of first subnode, or -FDT_ERR_NOTFOUND if there is none
150 */
151int fdt_first_subnode(const void *fdt, int offset);
152
153/**
154 * fdt_next_subnode() - get offset of next direct subnode
155 *
156 * After first calling fdt_first_subnode(), call this function repeatedly to
157 * get direct subnodes of a parent node.
158 *
159 * @fdt: FDT blob
160 * @offset: Offset of previous subnode
161 * @return offset of next subnode, or -FDT_ERR_NOTFOUND if there are no more
162 * subnodes
163 */
164int fdt_next_subnode(const void *fdt, int offset);
165
8d04f02f
KG
166/**********************************************************************/
167/* General functions */
168/**********************************************************************/
7cd5da0f
GVB
169
170#define fdt_get_header(fdt, field) \
8d04f02f 171 (fdt32_to_cpu(((const struct fdt_header *)(fdt))->field))
53677ef1 172#define fdt_magic(fdt) (fdt_get_header(fdt, magic))
7cd5da0f
GVB
173#define fdt_totalsize(fdt) (fdt_get_header(fdt, totalsize))
174#define fdt_off_dt_struct(fdt) (fdt_get_header(fdt, off_dt_struct))
175#define fdt_off_dt_strings(fdt) (fdt_get_header(fdt, off_dt_strings))
176#define fdt_off_mem_rsvmap(fdt) (fdt_get_header(fdt, off_mem_rsvmap))
177#define fdt_version(fdt) (fdt_get_header(fdt, version))
53677ef1
WD
178#define fdt_last_comp_version(fdt) (fdt_get_header(fdt, last_comp_version))
179#define fdt_boot_cpuid_phys(fdt) (fdt_get_header(fdt, boot_cpuid_phys))
180#define fdt_size_dt_strings(fdt) (fdt_get_header(fdt, size_dt_strings))
7cd5da0f
GVB
181#define fdt_size_dt_struct(fdt) (fdt_get_header(fdt, size_dt_struct))
182
8d04f02f
KG
183#define __fdt_set_hdr(name) \
184 static inline void fdt_set_##name(void *fdt, uint32_t val) \
185 { \
67b89c79 186 struct fdt_header *fdth = (struct fdt_header*)fdt; \
8d04f02f
KG
187 fdth->name = cpu_to_fdt32(val); \
188 }
189__fdt_set_hdr(magic);
190__fdt_set_hdr(totalsize);
191__fdt_set_hdr(off_dt_struct);
192__fdt_set_hdr(off_dt_strings);
193__fdt_set_hdr(off_mem_rsvmap);
194__fdt_set_hdr(version);
195__fdt_set_hdr(last_comp_version);
196__fdt_set_hdr(boot_cpuid_phys);
197__fdt_set_hdr(size_dt_strings);
198__fdt_set_hdr(size_dt_struct);
199#undef __fdt_set_hdr
7cd5da0f 200
8d04f02f
KG
201/**
202 * fdt_check_header - sanity check a device tree or possible device tree
203 * @fdt: pointer to data which might be a flattened device tree
204 *
205 * fdt_check_header() checks that the given buffer contains what
206 * appears to be a flattened device tree with sane information in its
207 * header.
208 *
209 * returns:
210 * 0, if the buffer appears to contain a valid device tree
211 * -FDT_ERR_BADMAGIC,
212 * -FDT_ERR_BADVERSION,
213 * -FDT_ERR_BADSTATE, standard meanings, as above
214 */
6679f929
GVB
215int fdt_check_header(const void *fdt);
216
8d04f02f
KG
217/**
218 * fdt_move - move a device tree around in memory
219 * @fdt: pointer to the device tree to move
220 * @buf: pointer to memory where the device is to be moved
221 * @bufsize: size of the memory space at buf
222 *
223 * fdt_move() relocates, if possible, the device tree blob located at
224 * fdt to the buffer at buf of size bufsize. The buffer may overlap
225 * with the existing device tree blob at fdt. Therefore,
226 * fdt_move(fdt, fdt, fdt_totalsize(fdt))
227 * should always succeed.
228 *
229 * returns:
230 * 0, on success
231 * -FDT_ERR_NOSPACE, bufsize is insufficient to contain the device tree
232 * -FDT_ERR_BADMAGIC,
233 * -FDT_ERR_BADVERSION,
234 * -FDT_ERR_BADSTATE, standard meanings
235 */
236int fdt_move(const void *fdt, void *buf, int bufsize);
7cd5da0f 237
8d04f02f
KG
238/**********************************************************************/
239/* Read-only functions */
240/**********************************************************************/
7cd5da0f 241
8d04f02f 242/**
46390da1 243 * fdt_string - retrieve a string from the strings block of a device tree
8d04f02f
KG
244 * @fdt: pointer to the device tree blob
245 * @stroffset: offset of the string within the strings block (native endian)
246 *
247 * fdt_string() retrieves a pointer to a single string from the
248 * strings block of the device tree blob at fdt.
249 *
250 * returns:
251 * a pointer to the string, on success
252 * NULL, if stroffset is out of bounds
253 */
254const char *fdt_string(const void *fdt, int stroffset);
7cd5da0f 255
8d04f02f 256/**
46390da1 257 * fdt_num_mem_rsv - retrieve the number of memory reserve map entries
8d04f02f
KG
258 * @fdt: pointer to the device tree blob
259 *
260 * Returns the number of entries in the device tree blob's memory
261 * reservation map. This does not include the terminating 0,0 entry
262 * or any other (0,0) entries reserved for expansion.
263 *
264 * returns:
265 * the number of entries
266 */
267int fdt_num_mem_rsv(const void *fdt);
7cd5da0f 268
8d04f02f 269/**
46390da1 270 * fdt_get_mem_rsv - retrieve one memory reserve map entry
8d04f02f
KG
271 * @fdt: pointer to the device tree blob
272 * @address, @size: pointers to 64-bit variables
273 *
274 * On success, *address and *size will contain the address and size of
275 * the n-th reserve map entry from the device tree blob, in
276 * native-endian format.
277 *
278 * returns:
279 * 0, on success
280 * -FDT_ERR_BADMAGIC,
281 * -FDT_ERR_BADVERSION,
282 * -FDT_ERR_BADSTATE, standard meanings
283 */
284int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size);
285
286/**
287 * fdt_subnode_offset_namelen - find a subnode based on substring
288 * @fdt: pointer to the device tree blob
289 * @parentoffset: structure block offset of a node
290 * @name: name of the subnode to locate
291 * @namelen: number of characters of name to consider
292 *
293 * Identical to fdt_subnode_offset(), but only examine the first
294 * namelen characters of name for matching the subnode name. This is
295 * useful for finding subnodes based on a portion of a larger string,
296 * such as a full path.
297 */
7cd5da0f
GVB
298int fdt_subnode_offset_namelen(const void *fdt, int parentoffset,
299 const char *name, int namelen);
8d04f02f
KG
300/**
301 * fdt_subnode_offset - find a subnode of a given node
302 * @fdt: pointer to the device tree blob
303 * @parentoffset: structure block offset of a node
304 * @name: name of the subnode to locate
305 *
306 * fdt_subnode_offset() finds a subnode of the node at structure block
307 * offset parentoffset with the given name. name may include a unit
308 * address, in which case fdt_subnode_offset() will find the subnode
309 * with that unit address, or the unit address may be omitted, in
310 * which case fdt_subnode_offset() will find an arbitrary subnode
311 * whose name excluding unit address matches the given name.
312 *
313 * returns:
314 * structure block offset of the requested subnode (>=0), on success
315 * -FDT_ERR_NOTFOUND, if the requested subnode does not exist
316 * -FDT_ERR_BADOFFSET, if parentoffset did not point to an FDT_BEGIN_NODE tag
317 * -FDT_ERR_BADMAGIC,
318 * -FDT_ERR_BADVERSION,
319 * -FDT_ERR_BADSTATE,
320 * -FDT_ERR_BADSTRUCTURE,
321 * -FDT_ERR_TRUNCATED, standard meanings.
322 */
7cd5da0f
GVB
323int fdt_subnode_offset(const void *fdt, int parentoffset, const char *name);
324
8d04f02f
KG
325/**
326 * fdt_path_offset - find a tree node by its full path
327 * @fdt: pointer to the device tree blob
328 * @path: full path of the node to locate
329 *
330 * fdt_path_offset() finds a node of a given path in the device tree.
331 * Each path component may omit the unit address portion, but the
332 * results of this are undefined if any such path component is
333 * ambiguous (that is if there are multiple nodes at the relevant
334 * level matching the given component, differentiated only by unit
335 * address).
336 *
337 * returns:
338 * structure block offset of the node with the requested path (>=0), on success
339 * -FDT_ERR_BADPATH, given path does not begin with '/' or is invalid
340 * -FDT_ERR_NOTFOUND, if the requested node does not exist
341 * -FDT_ERR_BADMAGIC,
342 * -FDT_ERR_BADVERSION,
343 * -FDT_ERR_BADSTATE,
344 * -FDT_ERR_BADSTRUCTURE,
345 * -FDT_ERR_TRUNCATED, standard meanings.
346 */
347int fdt_path_offset(const void *fdt, const char *path);
348
349/**
46390da1 350 * fdt_get_name - retrieve the name of a given node
8d04f02f
KG
351 * @fdt: pointer to the device tree blob
352 * @nodeoffset: structure block offset of the starting node
353 * @lenp: pointer to an integer variable (will be overwritten) or NULL
354 *
355 * fdt_get_name() retrieves the name (including unit address) of the
356 * device tree node at structure block offset nodeoffset. If lenp is
357 * non-NULL, the length of this name is also returned, in the integer
358 * pointed to by lenp.
359 *
360 * returns:
361 * pointer to the node's name, on success
362 * If lenp is non-NULL, *lenp contains the length of that name (>=0)
363 * NULL, on error
364 * if lenp is non-NULL *lenp contains an error code (<0):
365 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
366 * -FDT_ERR_BADMAGIC,
367 * -FDT_ERR_BADVERSION,
368 * -FDT_ERR_BADSTATE, standard meanings
369 */
370const char *fdt_get_name(const void *fdt, int nodeoffset, int *lenp);
371
d1c63148
DG
372/**
373 * fdt_first_property_offset - find the offset of a node's first property
374 * @fdt: pointer to the device tree blob
375 * @nodeoffset: structure block offset of a node
376 *
377 * fdt_first_property_offset() finds the first property of the node at
378 * the given structure block offset.
379 *
380 * returns:
381 * structure block offset of the property (>=0), on success
382 * -FDT_ERR_NOTFOUND, if the requested node has no properties
383 * -FDT_ERR_BADOFFSET, if nodeoffset did not point to an FDT_BEGIN_NODE tag
384 * -FDT_ERR_BADMAGIC,
385 * -FDT_ERR_BADVERSION,
386 * -FDT_ERR_BADSTATE,
387 * -FDT_ERR_BADSTRUCTURE,
388 * -FDT_ERR_TRUNCATED, standard meanings.
389 */
390int fdt_first_property_offset(const void *fdt, int nodeoffset);
391
392/**
393 * fdt_next_property_offset - step through a node's properties
394 * @fdt: pointer to the device tree blob
395 * @offset: structure block offset of a property
396 *
397 * fdt_next_property_offset() finds the property immediately after the
398 * one at the given structure block offset. This will be a property
399 * of the same node as the given property.
400 *
401 * returns:
402 * structure block offset of the next property (>=0), on success
403 * -FDT_ERR_NOTFOUND, if the given property is the last in its node
404 * -FDT_ERR_BADOFFSET, if nodeoffset did not point to an FDT_PROP tag
405 * -FDT_ERR_BADMAGIC,
406 * -FDT_ERR_BADVERSION,
407 * -FDT_ERR_BADSTATE,
408 * -FDT_ERR_BADSTRUCTURE,
409 * -FDT_ERR_TRUNCATED, standard meanings.
410 */
411int fdt_next_property_offset(const void *fdt, int offset);
412
413/**
414 * fdt_get_property_by_offset - retrieve the property at a given offset
415 * @fdt: pointer to the device tree blob
416 * @offset: offset of the property to retrieve
417 * @lenp: pointer to an integer variable (will be overwritten) or NULL
418 *
419 * fdt_get_property_by_offset() retrieves a pointer to the
420 * fdt_property structure within the device tree blob at the given
421 * offset. If lenp is non-NULL, the length of the property value is
422 * also returned, in the integer pointed to by lenp.
423 *
424 * returns:
425 * pointer to the structure representing the property
426 * if lenp is non-NULL, *lenp contains the length of the property
427 * value (>=0)
428 * NULL, on error
429 * if lenp is non-NULL, *lenp contains an error code (<0):
430 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_PROP tag
431 * -FDT_ERR_BADMAGIC,
432 * -FDT_ERR_BADVERSION,
433 * -FDT_ERR_BADSTATE,
434 * -FDT_ERR_BADSTRUCTURE,
435 * -FDT_ERR_TRUNCATED, standard meanings
436 */
437const struct fdt_property *fdt_get_property_by_offset(const void *fdt,
438 int offset,
439 int *lenp);
440
0219399a
DG
441/**
442 * fdt_get_property_namelen - find a property based on substring
443 * @fdt: pointer to the device tree blob
444 * @nodeoffset: offset of the node whose property to find
445 * @name: name of the property to find
446 * @namelen: number of characters of name to consider
447 * @lenp: pointer to an integer variable (will be overwritten) or NULL
448 *
449 * Identical to fdt_get_property_namelen(), but only examine the first
450 * namelen characters of name for matching the property name.
451 */
452const struct fdt_property *fdt_get_property_namelen(const void *fdt,
453 int nodeoffset,
454 const char *name,
455 int namelen, int *lenp);
456
8d04f02f
KG
457/**
458 * fdt_get_property - find a given property in a given node
459 * @fdt: pointer to the device tree blob
460 * @nodeoffset: offset of the node whose property to find
461 * @name: name of the property to find
462 * @lenp: pointer to an integer variable (will be overwritten) or NULL
463 *
464 * fdt_get_property() retrieves a pointer to the fdt_property
465 * structure within the device tree blob corresponding to the property
466 * named 'name' of the node at offset nodeoffset. If lenp is
46390da1 467 * non-NULL, the length of the property value is also returned, in the
8d04f02f
KG
468 * integer pointed to by lenp.
469 *
470 * returns:
471 * pointer to the structure representing the property
472 * if lenp is non-NULL, *lenp contains the length of the property
473 * value (>=0)
474 * NULL, on error
475 * if lenp is non-NULL, *lenp contains an error code (<0):
476 * -FDT_ERR_NOTFOUND, node does not have named property
477 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
478 * -FDT_ERR_BADMAGIC,
479 * -FDT_ERR_BADVERSION,
480 * -FDT_ERR_BADSTATE,
481 * -FDT_ERR_BADSTRUCTURE,
482 * -FDT_ERR_TRUNCATED, standard meanings
483 */
484const struct fdt_property *fdt_get_property(const void *fdt, int nodeoffset,
485 const char *name, int *lenp);
486static inline struct fdt_property *fdt_get_property_w(void *fdt, int nodeoffset,
487 const char *name,
488 int *lenp)
489{
c6683026
DG
490 return (struct fdt_property *)(uintptr_t)
491 fdt_get_property(fdt, nodeoffset, name, lenp);
8d04f02f
KG
492}
493
d1c63148
DG
494/**
495 * fdt_getprop_by_offset - retrieve the value of a property at a given offset
496 * @fdt: pointer to the device tree blob
497 * @ffset: offset of the property to read
498 * @namep: pointer to a string variable (will be overwritten) or NULL
499 * @lenp: pointer to an integer variable (will be overwritten) or NULL
500 *
501 * fdt_getprop_by_offset() retrieves a pointer to the value of the
502 * property at structure block offset 'offset' (this will be a pointer
503 * to within the device blob itself, not a copy of the value). If
504 * lenp is non-NULL, the length of the property value is also
505 * returned, in the integer pointed to by lenp. If namep is non-NULL,
506 * the property's namne will also be returned in the char * pointed to
507 * by namep (this will be a pointer to within the device tree's string
508 * block, not a new copy of the name).
509 *
510 * returns:
511 * pointer to the property's value
512 * if lenp is non-NULL, *lenp contains the length of the property
513 * value (>=0)
514 * if namep is non-NULL *namep contiains a pointer to the property
515 * name.
516 * NULL, on error
517 * if lenp is non-NULL, *lenp contains an error code (<0):
518 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_PROP tag
519 * -FDT_ERR_BADMAGIC,
520 * -FDT_ERR_BADVERSION,
521 * -FDT_ERR_BADSTATE,
522 * -FDT_ERR_BADSTRUCTURE,
523 * -FDT_ERR_TRUNCATED, standard meanings
524 */
525const void *fdt_getprop_by_offset(const void *fdt, int offset,
526 const char **namep, int *lenp);
527
0219399a
DG
528/**
529 * fdt_getprop_namelen - get property value based on substring
530 * @fdt: pointer to the device tree blob
531 * @nodeoffset: offset of the node whose property to find
532 * @name: name of the property to find
533 * @namelen: number of characters of name to consider
534 * @lenp: pointer to an integer variable (will be overwritten) or NULL
535 *
536 * Identical to fdt_getprop(), but only examine the first namelen
537 * characters of name for matching the property name.
538 */
539const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
540 const char *name, int namelen, int *lenp);
541
8d04f02f
KG
542/**
543 * fdt_getprop - retrieve the value of a given property
544 * @fdt: pointer to the device tree blob
545 * @nodeoffset: offset of the node whose property to find
546 * @name: name of the property to find
547 * @lenp: pointer to an integer variable (will be overwritten) or NULL
548 *
549 * fdt_getprop() retrieves a pointer to the value of the property
550 * named 'name' of the node at offset nodeoffset (this will be a
551 * pointer to within the device blob itself, not a copy of the value).
46390da1 552 * If lenp is non-NULL, the length of the property value is also
8d04f02f
KG
553 * returned, in the integer pointed to by lenp.
554 *
555 * returns:
556 * pointer to the property's value
557 * if lenp is non-NULL, *lenp contains the length of the property
558 * value (>=0)
559 * NULL, on error
560 * if lenp is non-NULL, *lenp contains an error code (<0):
561 * -FDT_ERR_NOTFOUND, node does not have named property
562 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
563 * -FDT_ERR_BADMAGIC,
564 * -FDT_ERR_BADVERSION,
565 * -FDT_ERR_BADSTATE,
566 * -FDT_ERR_BADSTRUCTURE,
567 * -FDT_ERR_TRUNCATED, standard meanings
568 */
569const void *fdt_getprop(const void *fdt, int nodeoffset,
570 const char *name, int *lenp);
571static inline void *fdt_getprop_w(void *fdt, int nodeoffset,
572 const char *name, int *lenp)
573{
c6683026 574 return (void *)(uintptr_t)fdt_getprop(fdt, nodeoffset, name, lenp);
8d04f02f
KG
575}
576
577/**
46390da1 578 * fdt_get_phandle - retrieve the phandle of a given node
8d04f02f
KG
579 * @fdt: pointer to the device tree blob
580 * @nodeoffset: structure block offset of the node
581 *
582 * fdt_get_phandle() retrieves the phandle of the device tree node at
583 * structure block offset nodeoffset.
584 *
585 * returns:
46390da1 586 * the phandle of the node at nodeoffset, on success (!= 0, != -1)
8d04f02f
KG
587 * 0, if the node has no phandle, or another error occurs
588 */
589uint32_t fdt_get_phandle(const void *fdt, int nodeoffset);
590
9a6cf73a 591/**
cd3cb0d9 592 * fdt_get_alias_namelen - get alias based on substring
9a6cf73a
DG
593 * @fdt: pointer to the device tree blob
594 * @name: name of the alias th look up
595 * @namelen: number of characters of name to consider
596 *
597 * Identical to fdt_get_alias(), but only examine the first namelen
598 * characters of name for matching the alias name.
599 */
600const char *fdt_get_alias_namelen(const void *fdt,
601 const char *name, int namelen);
602
603/**
0596d35d 604 * fdt_get_alias - retreive the path referenced by a given alias
9a6cf73a 605 * @fdt: pointer to the device tree blob
0596d35d 606 * @name: name of the alias th look up
9a6cf73a
DG
607 *
608 * fdt_get_alias() retrieves the value of a given alias. That is, the
609 * value of the property named 'name' in the node /aliases.
610 *
611 * returns:
c73bd49d 612 * a pointer to the expansion of the alias named 'name', if it exists
9a6cf73a
DG
613 * NULL, if the given alias or the /aliases node does not exist
614 */
615const char *fdt_get_alias(const void *fdt, const char *name);
616
8d04f02f
KG
617/**
618 * fdt_get_path - determine the full path of a node
619 * @fdt: pointer to the device tree blob
620 * @nodeoffset: offset of the node whose path to find
621 * @buf: character buffer to contain the returned path (will be overwritten)
622 * @buflen: size of the character buffer at buf
623 *
624 * fdt_get_path() computes the full path of the node at offset
625 * nodeoffset, and records that path in the buffer at buf.
626 *
627 * NOTE: This function is expensive, as it must scan the device tree
628 * structure from the start to nodeoffset.
629 *
630 * returns:
631 * 0, on success
632 * buf contains the absolute path of the node at
633 * nodeoffset, as a NUL-terminated string.
53677ef1 634 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
8d04f02f
KG
635 * -FDT_ERR_NOSPACE, the path of the given node is longer than (bufsize-1)
636 * characters and will not fit in the given buffer.
637 * -FDT_ERR_BADMAGIC,
638 * -FDT_ERR_BADVERSION,
639 * -FDT_ERR_BADSTATE,
640 * -FDT_ERR_BADSTRUCTURE, standard meanings
641 */
642int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen);
643
644/**
645 * fdt_supernode_atdepth_offset - find a specific ancestor of a node
646 * @fdt: pointer to the device tree blob
647 * @nodeoffset: offset of the node whose parent to find
648 * @supernodedepth: depth of the ancestor to find
649 * @nodedepth: pointer to an integer variable (will be overwritten) or NULL
650 *
651 * fdt_supernode_atdepth_offset() finds an ancestor of the given node
652 * at a specific depth from the root (where the root itself has depth
653 * 0, its immediate subnodes depth 1 and so forth). So
654 * fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, NULL);
655 * will always return 0, the offset of the root node. If the node at
656 * nodeoffset has depth D, then:
657 * fdt_supernode_atdepth_offset(fdt, nodeoffset, D, NULL);
658 * will return nodeoffset itself.
659 *
660 * NOTE: This function is expensive, as it must scan the device tree
661 * structure from the start to nodeoffset.
662 *
663 * returns:
664
665 * structure block offset of the node at node offset's ancestor
666 * of depth supernodedepth (>=0), on success
53677ef1 667 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
8d04f02f
KG
668* -FDT_ERR_NOTFOUND, supernodedepth was greater than the depth of nodeoffset
669 * -FDT_ERR_BADMAGIC,
670 * -FDT_ERR_BADVERSION,
671 * -FDT_ERR_BADSTATE,
672 * -FDT_ERR_BADSTRUCTURE, standard meanings
673 */
674int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
675 int supernodedepth, int *nodedepth);
676
677/**
678 * fdt_node_depth - find the depth of a given node
679 * @fdt: pointer to the device tree blob
680 * @nodeoffset: offset of the node whose parent to find
681 *
682 * fdt_node_depth() finds the depth of a given node. The root node
683 * has depth 0, its immediate subnodes depth 1 and so forth.
684 *
685 * NOTE: This function is expensive, as it must scan the device tree
686 * structure from the start to nodeoffset.
687 *
688 * returns:
689 * depth of the node at nodeoffset (>=0), on success
53677ef1 690 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
8d04f02f
KG
691 * -FDT_ERR_BADMAGIC,
692 * -FDT_ERR_BADVERSION,
693 * -FDT_ERR_BADSTATE,
694 * -FDT_ERR_BADSTRUCTURE, standard meanings
695 */
696int fdt_node_depth(const void *fdt, int nodeoffset);
697
698/**
699 * fdt_parent_offset - find the parent of a given node
700 * @fdt: pointer to the device tree blob
701 * @nodeoffset: offset of the node whose parent to find
702 *
703 * fdt_parent_offset() locates the parent node of a given node (that
704 * is, it finds the offset of the node which contains the node at
705 * nodeoffset as a subnode).
706 *
707 * NOTE: This function is expensive, as it must scan the device tree
708 * structure from the start to nodeoffset, *twice*.
709 *
710 * returns:
46390da1 711 * structure block offset of the parent of the node at nodeoffset
8d04f02f 712 * (>=0), on success
53677ef1 713 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
8d04f02f
KG
714 * -FDT_ERR_BADMAGIC,
715 * -FDT_ERR_BADVERSION,
716 * -FDT_ERR_BADSTATE,
717 * -FDT_ERR_BADSTRUCTURE, standard meanings
718 */
719int fdt_parent_offset(const void *fdt, int nodeoffset);
720
721/**
722 * fdt_node_offset_by_prop_value - find nodes with a given property value
723 * @fdt: pointer to the device tree blob
724 * @startoffset: only find nodes after this offset
725 * @propname: property name to check
726 * @propval: property value to search for
727 * @proplen: length of the value in propval
728 *
729 * fdt_node_offset_by_prop_value() returns the offset of the first
730 * node after startoffset, which has a property named propname whose
731 * value is of length proplen and has value equal to propval; or if
732 * startoffset is -1, the very first such node in the tree.
733 *
734 * To iterate through all nodes matching the criterion, the following
735 * idiom can be used:
736 * offset = fdt_node_offset_by_prop_value(fdt, -1, propname,
737 * propval, proplen);
738 * while (offset != -FDT_ERR_NOTFOUND) {
0596d35d 739 * // other code here
8d04f02f
KG
740 * offset = fdt_node_offset_by_prop_value(fdt, offset, propname,
741 * propval, proplen);
742 * }
743 *
744 * Note the -1 in the first call to the function, if 0 is used here
745 * instead, the function will never locate the root node, even if it
746 * matches the criterion.
747 *
748 * returns:
749 * structure block offset of the located node (>= 0, >startoffset),
750 * on success
751 * -FDT_ERR_NOTFOUND, no node matching the criterion exists in the
752 * tree after startoffset
53677ef1 753 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
8d04f02f
KG
754 * -FDT_ERR_BADMAGIC,
755 * -FDT_ERR_BADVERSION,
756 * -FDT_ERR_BADSTATE,
757 * -FDT_ERR_BADSTRUCTURE, standard meanings
758 */
759int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
760 const char *propname,
761 const void *propval, int proplen);
762
763/**
764 * fdt_node_offset_by_phandle - find the node with a given phandle
765 * @fdt: pointer to the device tree blob
766 * @phandle: phandle value
767 *
46390da1 768 * fdt_node_offset_by_phandle() returns the offset of the node
8d04f02f
KG
769 * which has the given phandle value. If there is more than one node
770 * in the tree with the given phandle (an invalid tree), results are
771 * undefined.
772 *
773 * returns:
774 * structure block offset of the located node (>= 0), on success
775 * -FDT_ERR_NOTFOUND, no node with that phandle exists
776 * -FDT_ERR_BADPHANDLE, given phandle value was invalid (0 or -1)
777 * -FDT_ERR_BADMAGIC,
778 * -FDT_ERR_BADVERSION,
779 * -FDT_ERR_BADSTATE,
780 * -FDT_ERR_BADSTRUCTURE, standard meanings
781 */
782int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle);
783
784/**
785 * fdt_node_check_compatible: check a node's compatible property
786 * @fdt: pointer to the device tree blob
787 * @nodeoffset: offset of a tree node
788 * @compatible: string to match against
789 *
790 *
791 * fdt_node_check_compatible() returns 0 if the given node contains a
792 * 'compatible' property with the given string as one of its elements,
793 * it returns non-zero otherwise, or on error.
794 *
795 * returns:
796 * 0, if the node has a 'compatible' property listing the given string
797 * 1, if the node has a 'compatible' property, but it does not list
798 * the given string
799 * -FDT_ERR_NOTFOUND, if the given node has no 'compatible' property
53677ef1 800 * -FDT_ERR_BADOFFSET, if nodeoffset does not refer to a BEGIN_NODE tag
8d04f02f
KG
801 * -FDT_ERR_BADMAGIC,
802 * -FDT_ERR_BADVERSION,
803 * -FDT_ERR_BADSTATE,
804 * -FDT_ERR_BADSTRUCTURE, standard meanings
805 */
806int fdt_node_check_compatible(const void *fdt, int nodeoffset,
807 const char *compatible);
7cd5da0f 808
8d04f02f
KG
809/**
810 * fdt_node_offset_by_compatible - find nodes with a given 'compatible' value
811 * @fdt: pointer to the device tree blob
812 * @startoffset: only find nodes after this offset
813 * @compatible: 'compatible' string to match against
814 *
815 * fdt_node_offset_by_compatible() returns the offset of the first
816 * node after startoffset, which has a 'compatible' property which
817 * lists the given compatible string; or if startoffset is -1, the
818 * very first such node in the tree.
819 *
820 * To iterate through all nodes matching the criterion, the following
821 * idiom can be used:
822 * offset = fdt_node_offset_by_compatible(fdt, -1, compatible);
823 * while (offset != -FDT_ERR_NOTFOUND) {
0596d35d 824 * // other code here
8d04f02f
KG
825 * offset = fdt_node_offset_by_compatible(fdt, offset, compatible);
826 * }
827 *
828 * Note the -1 in the first call to the function, if 0 is used here
829 * instead, the function will never locate the root node, even if it
830 * matches the criterion.
831 *
832 * returns:
833 * structure block offset of the located node (>= 0, >startoffset),
834 * on success
835 * -FDT_ERR_NOTFOUND, no node matching the criterion exists in the
836 * tree after startoffset
53677ef1 837 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
8d04f02f
KG
838 * -FDT_ERR_BADMAGIC,
839 * -FDT_ERR_BADVERSION,
840 * -FDT_ERR_BADSTATE,
841 * -FDT_ERR_BADSTRUCTURE, standard meanings
842 */
843int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
844 const char *compatible);
7cd5da0f 845
e853b324
SG
846/**
847 * fdt_stringlist_contains - check a string list property for a string
848 * @strlist: Property containing a list of strings to check
849 * @listlen: Length of property
850 * @str: String to search for
851 *
852 * This is a utility function provided for convenience. The list contains
853 * one or more strings, each terminated by \0, as is found in a device tree
854 * "compatible" property.
855 *
856 * @return: 1 if the string is found in the list, 0 not found, or invalid list
857 */
858int fdt_stringlist_contains(const char *strlist, int listlen, const char *str);
859
bc4147ab
TR
860/**
861 * fdt_count_strings - count the number of strings in a string list
862 * @fdt: pointer to the device tree blob
863 * @node: offset of the node
864 * @property: name of the property containing the string list
865 * @return: the number of strings in the given property
866 */
867int fdt_count_strings(const void *fdt, int node, const char *property);
868
0596d35d
SG
869/**********************************************************************/
870/* Read-only functions (addressing related) */
871/**********************************************************************/
872
873/**
874 * FDT_MAX_NCELLS - maximum value for #address-cells and #size-cells
875 *
876 * This is the maximum value for #address-cells, #size-cells and
877 * similar properties that will be processed by libfdt. IEE1275
878 * requires that OF implementations handle values up to 4.
879 * Implementations may support larger values, but in practice higher
880 * values aren't used.
881 */
882#define FDT_MAX_NCELLS 4
883
884/**
885 * fdt_address_cells - retrieve address size for a bus represented in the tree
886 * @fdt: pointer to the device tree blob
887 * @nodeoffset: offset of the node to find the address size for
888 *
889 * When the node has a valid #address-cells property, returns its value.
890 *
891 * returns:
892 * 0 <= n < FDT_MAX_NCELLS, on success
893 * 2, if the node has no #address-cells property
894 * -FDT_ERR_BADNCELLS, if the node has a badly formatted or invalid
895 * #address-cells property
896 * -FDT_ERR_BADMAGIC,
897 * -FDT_ERR_BADVERSION,
898 * -FDT_ERR_BADSTATE,
899 * -FDT_ERR_BADSTRUCTURE,
900 * -FDT_ERR_TRUNCATED, standard meanings
901 */
902int fdt_address_cells(const void *fdt, int nodeoffset);
903
904/**
905 * fdt_size_cells - retrieve address range size for a bus represented in the
906 * tree
907 * @fdt: pointer to the device tree blob
908 * @nodeoffset: offset of the node to find the address range size for
909 *
910 * When the node has a valid #size-cells property, returns its value.
911 *
912 * returns:
913 * 0 <= n < FDT_MAX_NCELLS, on success
914 * 2, if the node has no #address-cells property
915 * -FDT_ERR_BADNCELLS, if the node has a badly formatted or invalid
916 * #size-cells property
917 * -FDT_ERR_BADMAGIC,
918 * -FDT_ERR_BADVERSION,
919 * -FDT_ERR_BADSTATE,
920 * -FDT_ERR_BADSTRUCTURE,
921 * -FDT_ERR_TRUNCATED, standard meanings
922 */
923int fdt_size_cells(const void *fdt, int nodeoffset);
924
925
8d04f02f
KG
926/**********************************************************************/
927/* Write-in-place functions */
928/**********************************************************************/
3af0d587 929
9d4450b5
DG
930/**
931 * fdt_setprop_inplace - change a property's value, but not its size
932 * @fdt: pointer to the device tree blob
933 * @nodeoffset: offset of the node whose property to change
934 * @name: name of the property to change
935 * @val: pointer to data to replace the property value with
936 * @len: length of the property value
937 *
938 * fdt_setprop_inplace() replaces the value of a given property with
939 * the data in val, of length len. This function cannot change the
940 * size of a property, and so will only work if len is equal to the
941 * current length of the property.
942 *
943 * This function will alter only the bytes in the blob which contain
944 * the given property value, and will not alter or move any other part
945 * of the tree.
946 *
947 * returns:
948 * 0, on success
949 * -FDT_ERR_NOSPACE, if len is not equal to the property's current length
950 * -FDT_ERR_NOTFOUND, node does not have the named property
951 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
952 * -FDT_ERR_BADMAGIC,
953 * -FDT_ERR_BADVERSION,
954 * -FDT_ERR_BADSTATE,
955 * -FDT_ERR_BADSTRUCTURE,
956 * -FDT_ERR_TRUNCATED, standard meanings
957 */
7cd5da0f
GVB
958int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name,
959 const void *val, int len);
9d4450b5
DG
960
961/**
24fa0e58 962 * fdt_setprop_inplace_u32 - change the value of a 32-bit integer property
9d4450b5
DG
963 * @fdt: pointer to the device tree blob
964 * @nodeoffset: offset of the node whose property to change
965 * @name: name of the property to change
24fa0e58 966 * @val: 32-bit integer value to replace the property with
9d4450b5 967 *
24fa0e58
DG
968 * fdt_setprop_inplace_u32() replaces the value of a given property
969 * with the 32-bit integer value in val, converting val to big-endian
970 * if necessary. This function cannot change the size of a property,
971 * and so will only work if the property already exists and has length
972 * 4.
9d4450b5
DG
973 *
974 * This function will alter only the bytes in the blob which contain
975 * the given property value, and will not alter or move any other part
976 * of the tree.
977 *
978 * returns:
979 * 0, on success
980 * -FDT_ERR_NOSPACE, if the property's length is not equal to 4
24fa0e58 981 * -FDT_ERR_NOTFOUND, node does not have the named property
9d4450b5
DG
982 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
983 * -FDT_ERR_BADMAGIC,
984 * -FDT_ERR_BADVERSION,
985 * -FDT_ERR_BADSTATE,
986 * -FDT_ERR_BADSTRUCTURE,
987 * -FDT_ERR_TRUNCATED, standard meanings
988 */
24fa0e58
DG
989static inline int fdt_setprop_inplace_u32(void *fdt, int nodeoffset,
990 const char *name, uint32_t val)
8d04f02f 991{
b2ba62a1
KP
992 fdt32_t tmp = cpu_to_fdt32(val);
993 return fdt_setprop_inplace(fdt, nodeoffset, name, &tmp, sizeof(tmp));
8d04f02f 994}
7cd5da0f 995
24fa0e58
DG
996/**
997 * fdt_setprop_inplace_u64 - change the value of a 64-bit integer property
998 * @fdt: pointer to the device tree blob
999 * @nodeoffset: offset of the node whose property to change
1000 * @name: name of the property to change
1001 * @val: 64-bit integer value to replace the property with
1002 *
1003 * fdt_setprop_inplace_u64() replaces the value of a given property
1004 * with the 64-bit integer value in val, converting val to big-endian
1005 * if necessary. This function cannot change the size of a property,
1006 * and so will only work if the property already exists and has length
1007 * 8.
1008 *
1009 * This function will alter only the bytes in the blob which contain
1010 * the given property value, and will not alter or move any other part
1011 * of the tree.
1012 *
1013 * returns:
1014 * 0, on success
1015 * -FDT_ERR_NOSPACE, if the property's length is not equal to 8
1016 * -FDT_ERR_NOTFOUND, node does not have the named property
1017 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1018 * -FDT_ERR_BADMAGIC,
1019 * -FDT_ERR_BADVERSION,
1020 * -FDT_ERR_BADSTATE,
1021 * -FDT_ERR_BADSTRUCTURE,
1022 * -FDT_ERR_TRUNCATED, standard meanings
1023 */
1024static inline int fdt_setprop_inplace_u64(void *fdt, int nodeoffset,
1025 const char *name, uint64_t val)
1026{
b2ba62a1
KP
1027 fdt64_t tmp = cpu_to_fdt64(val);
1028 return fdt_setprop_inplace(fdt, nodeoffset, name, &tmp, sizeof(tmp));
24fa0e58
DG
1029}
1030
1031/**
1032 * fdt_setprop_inplace_cell - change the value of a single-cell property
1033 *
1034 * This is an alternative name for fdt_setprop_inplace_u32()
1035 */
1036static inline int fdt_setprop_inplace_cell(void *fdt, int nodeoffset,
1037 const char *name, uint32_t val)
1038{
1039 return fdt_setprop_inplace_u32(fdt, nodeoffset, name, val);
1040}
1041
9d4450b5
DG
1042/**
1043 * fdt_nop_property - replace a property with nop tags
1044 * @fdt: pointer to the device tree blob
1045 * @nodeoffset: offset of the node whose property to nop
1046 * @name: name of the property to nop
1047 *
1048 * fdt_nop_property() will replace a given property's representation
1049 * in the blob with FDT_NOP tags, effectively removing it from the
1050 * tree.
1051 *
1052 * This function will alter only the bytes in the blob which contain
1053 * the property, and will not alter or move any other part of the
1054 * tree.
1055 *
1056 * returns:
1057 * 0, on success
1058 * -FDT_ERR_NOTFOUND, node does not have the named property
1059 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1060 * -FDT_ERR_BADMAGIC,
1061 * -FDT_ERR_BADVERSION,
1062 * -FDT_ERR_BADSTATE,
1063 * -FDT_ERR_BADSTRUCTURE,
1064 * -FDT_ERR_TRUNCATED, standard meanings
1065 */
7cd5da0f 1066int fdt_nop_property(void *fdt, int nodeoffset, const char *name);
9d4450b5
DG
1067
1068/**
1069 * fdt_nop_node - replace a node (subtree) with nop tags
1070 * @fdt: pointer to the device tree blob
1071 * @nodeoffset: offset of the node to nop
1072 *
1073 * fdt_nop_node() will replace a given node's representation in the
1074 * blob, including all its subnodes, if any, with FDT_NOP tags,
1075 * effectively removing it from the tree.
1076 *
1077 * This function will alter only the bytes in the blob which contain
1078 * the node and its properties and subnodes, and will not alter or
1079 * move any other part of the tree.
1080 *
1081 * returns:
1082 * 0, on success
1083 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1084 * -FDT_ERR_BADMAGIC,
1085 * -FDT_ERR_BADVERSION,
1086 * -FDT_ERR_BADSTATE,
1087 * -FDT_ERR_BADSTRUCTURE,
1088 * -FDT_ERR_TRUNCATED, standard meanings
1089 */
7cd5da0f 1090int fdt_nop_node(void *fdt, int nodeoffset);
3f9f08cf 1091
8d04f02f
KG
1092/**********************************************************************/
1093/* Sequential write functions */
1094/**********************************************************************/
7cd5da0f 1095
7cd5da0f 1096int fdt_create(void *buf, int bufsize);
0596d35d 1097int fdt_resize(void *fdt, void *buf, int bufsize);
7cd5da0f
GVB
1098int fdt_add_reservemap_entry(void *fdt, uint64_t addr, uint64_t size);
1099int fdt_finish_reservemap(void *fdt);
1100int fdt_begin_node(void *fdt, const char *name);
1101int fdt_property(void *fdt, const char *name, const void *val, int len);
24fa0e58 1102static inline int fdt_property_u32(void *fdt, const char *name, uint32_t val)
8d04f02f 1103{
b2ba62a1
KP
1104 fdt32_t tmp = cpu_to_fdt32(val);
1105 return fdt_property(fdt, name, &tmp, sizeof(tmp));
8d04f02f 1106}
24fa0e58
DG
1107static inline int fdt_property_u64(void *fdt, const char *name, uint64_t val)
1108{
b2ba62a1
KP
1109 fdt64_t tmp = cpu_to_fdt64(val);
1110 return fdt_property(fdt, name, &tmp, sizeof(tmp));
24fa0e58
DG
1111}
1112static inline int fdt_property_cell(void *fdt, const char *name, uint32_t val)
1113{
1114 return fdt_property_u32(fdt, name, val);
1115}
7cd5da0f
GVB
1116#define fdt_property_string(fdt, name, str) \
1117 fdt_property(fdt, name, str, strlen(str)+1)
1118int fdt_end_node(void *fdt);
1119int fdt_finish(void *fdt);
1120
8d04f02f
KG
1121/**********************************************************************/
1122/* Read-write functions */
1123/**********************************************************************/
1124
c71b64f3 1125int fdt_create_empty_tree(void *buf, int bufsize);
8d04f02f 1126int fdt_open_into(const void *fdt, void *buf, int bufsize);
7cd5da0f
GVB
1127int fdt_pack(void *fdt);
1128
aec7135b
DG
1129/**
1130 * fdt_add_mem_rsv - add one memory reserve map entry
1131 * @fdt: pointer to the device tree blob
46390da1 1132 * @address, @size: 64-bit values (native endian)
aec7135b
DG
1133 *
1134 * Adds a reserve map entry to the given blob reserving a region at
1135 * address address of length size.
1136 *
1137 * This function will insert data into the reserve map and will
46390da1 1138 * therefore change the indexes of some entries in the table.
aec7135b
DG
1139 *
1140 * returns:
1141 * 0, on success
1142 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1143 * contain the new reservation entry
1144 * -FDT_ERR_BADMAGIC,
1145 * -FDT_ERR_BADVERSION,
1146 * -FDT_ERR_BADSTATE,
1147 * -FDT_ERR_BADSTRUCTURE,
1148 * -FDT_ERR_BADLAYOUT,
1149 * -FDT_ERR_TRUNCATED, standard meanings
1150 */
8d04f02f 1151int fdt_add_mem_rsv(void *fdt, uint64_t address, uint64_t size);
aec7135b
DG
1152
1153/**
1154 * fdt_del_mem_rsv - remove a memory reserve map entry
1155 * @fdt: pointer to the device tree blob
1156 * @n: entry to remove
1157 *
1158 * fdt_del_mem_rsv() removes the n-th memory reserve map entry from
1159 * the blob.
1160 *
1161 * This function will delete data from the reservation table and will
46390da1 1162 * therefore change the indexes of some entries in the table.
aec7135b
DG
1163 *
1164 * returns:
1165 * 0, on success
1166 * -FDT_ERR_NOTFOUND, there is no entry of the given index (i.e. there
1167 * are less than n+1 reserve map entries)
1168 * -FDT_ERR_BADMAGIC,
1169 * -FDT_ERR_BADVERSION,
1170 * -FDT_ERR_BADSTATE,
1171 * -FDT_ERR_BADSTRUCTURE,
1172 * -FDT_ERR_BADLAYOUT,
1173 * -FDT_ERR_TRUNCATED, standard meanings
1174 */
8d04f02f
KG
1175int fdt_del_mem_rsv(void *fdt, int n);
1176
9eaeb07a
DG
1177/**
1178 * fdt_set_name - change the name of a given node
1179 * @fdt: pointer to the device tree blob
1180 * @nodeoffset: structure block offset of a node
1181 * @name: name to give the node
1182 *
1183 * fdt_set_name() replaces the name (including unit address, if any)
1184 * of the given node with the given string. NOTE: this function can't
1185 * efficiently check if the new name is unique amongst the given
1186 * node's siblings; results are undefined if this function is invoked
1187 * with a name equal to one of the given node's siblings.
1188 *
1189 * This function may insert or delete data from the blob, and will
1190 * therefore change the offsets of some existing nodes.
1191 *
1192 * returns:
1193 * 0, on success
1194 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob
1195 * to contain the new name
1196 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1197 * -FDT_ERR_BADMAGIC,
1198 * -FDT_ERR_BADVERSION,
1199 * -FDT_ERR_BADSTATE, standard meanings
1200 */
1201int fdt_set_name(void *fdt, int nodeoffset, const char *name);
1202
aec7135b
DG
1203/**
1204 * fdt_setprop - create or change a property
1205 * @fdt: pointer to the device tree blob
1206 * @nodeoffset: offset of the node whose property to change
1207 * @name: name of the property to change
1208 * @val: pointer to data to set the property value to
1209 * @len: length of the property value
1210 *
1211 * fdt_setprop() sets the value of the named property in the given
46390da1 1212 * node to the given value and length, creating the property if it
aec7135b
DG
1213 * does not already exist.
1214 *
1215 * This function may insert or delete data from the blob, and will
1216 * therefore change the offsets of some existing nodes.
1217 *
1218 * returns:
1219 * 0, on success
1220 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1221 * contain the new property value
1222 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1223 * -FDT_ERR_BADLAYOUT,
1224 * -FDT_ERR_BADMAGIC,
1225 * -FDT_ERR_BADVERSION,
1226 * -FDT_ERR_BADSTATE,
1227 * -FDT_ERR_BADSTRUCTURE,
1228 * -FDT_ERR_BADLAYOUT,
1229 * -FDT_ERR_TRUNCATED, standard meanings
1230 */
7cd5da0f
GVB
1231int fdt_setprop(void *fdt, int nodeoffset, const char *name,
1232 const void *val, int len);
aec7135b
DG
1233
1234/**
24fa0e58 1235 * fdt_setprop_u32 - set a property to a 32-bit integer
aec7135b
DG
1236 * @fdt: pointer to the device tree blob
1237 * @nodeoffset: offset of the node whose property to change
1238 * @name: name of the property to change
1239 * @val: 32-bit integer value for the property (native endian)
1240 *
24fa0e58
DG
1241 * fdt_setprop_u32() sets the value of the named property in the given
1242 * node to the given 32-bit integer value (converting to big-endian if
aec7135b
DG
1243 * necessary), or creates a new property with that value if it does
1244 * not already exist.
1245 *
1246 * This function may insert or delete data from the blob, and will
1247 * therefore change the offsets of some existing nodes.
1248 *
1249 * returns:
1250 * 0, on success
1251 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1252 * contain the new property value
1253 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1254 * -FDT_ERR_BADLAYOUT,
1255 * -FDT_ERR_BADMAGIC,
1256 * -FDT_ERR_BADVERSION,
1257 * -FDT_ERR_BADSTATE,
1258 * -FDT_ERR_BADSTRUCTURE,
1259 * -FDT_ERR_BADLAYOUT,
1260 * -FDT_ERR_TRUNCATED, standard meanings
1261 */
24fa0e58
DG
1262static inline int fdt_setprop_u32(void *fdt, int nodeoffset, const char *name,
1263 uint32_t val)
8d04f02f 1264{
b2ba62a1
KP
1265 fdt32_t tmp = cpu_to_fdt32(val);
1266 return fdt_setprop(fdt, nodeoffset, name, &tmp, sizeof(tmp));
8d04f02f 1267}
aec7135b 1268
24fa0e58
DG
1269/**
1270 * fdt_setprop_u64 - set a property to a 64-bit integer
1271 * @fdt: pointer to the device tree blob
1272 * @nodeoffset: offset of the node whose property to change
1273 * @name: name of the property to change
1274 * @val: 64-bit integer value for the property (native endian)
1275 *
1276 * fdt_setprop_u64() sets the value of the named property in the given
1277 * node to the given 64-bit integer value (converting to big-endian if
1278 * necessary), or creates a new property with that value if it does
1279 * not already exist.
1280 *
1281 * This function may insert or delete data from the blob, and will
1282 * therefore change the offsets of some existing nodes.
1283 *
1284 * returns:
1285 * 0, on success
1286 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1287 * contain the new property value
1288 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1289 * -FDT_ERR_BADLAYOUT,
1290 * -FDT_ERR_BADMAGIC,
1291 * -FDT_ERR_BADVERSION,
1292 * -FDT_ERR_BADSTATE,
1293 * -FDT_ERR_BADSTRUCTURE,
1294 * -FDT_ERR_BADLAYOUT,
1295 * -FDT_ERR_TRUNCATED, standard meanings
1296 */
1297static inline int fdt_setprop_u64(void *fdt, int nodeoffset, const char *name,
1298 uint64_t val)
1299{
b2ba62a1
KP
1300 fdt64_t tmp = cpu_to_fdt64(val);
1301 return fdt_setprop(fdt, nodeoffset, name, &tmp, sizeof(tmp));
24fa0e58
DG
1302}
1303
1304/**
1305 * fdt_setprop_cell - set a property to a single cell value
1306 *
1307 * This is an alternative name for fdt_setprop_u32()
1308 */
1309static inline int fdt_setprop_cell(void *fdt, int nodeoffset, const char *name,
1310 uint32_t val)
1311{
1312 return fdt_setprop_u32(fdt, nodeoffset, name, val);
1313}
1314
aec7135b
DG
1315/**
1316 * fdt_setprop_string - set a property to a string value
1317 * @fdt: pointer to the device tree blob
1318 * @nodeoffset: offset of the node whose property to change
1319 * @name: name of the property to change
1320 * @str: string value for the property
1321 *
1322 * fdt_setprop_string() sets the value of the named property in the
1323 * given node to the given string value (using the length of the
1324 * string to determine the new length of the property), or creates a
1325 * new property with that value if it does not already exist.
1326 *
1327 * This function may insert or delete data from the blob, and will
1328 * therefore change the offsets of some existing nodes.
1329 *
1330 * returns:
1331 * 0, on success
1332 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1333 * contain the new property value
1334 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1335 * -FDT_ERR_BADLAYOUT,
1336 * -FDT_ERR_BADMAGIC,
1337 * -FDT_ERR_BADVERSION,
1338 * -FDT_ERR_BADSTATE,
1339 * -FDT_ERR_BADSTRUCTURE,
1340 * -FDT_ERR_BADLAYOUT,
1341 * -FDT_ERR_TRUNCATED, standard meanings
1342 */
7cd5da0f
GVB
1343#define fdt_setprop_string(fdt, nodeoffset, name, str) \
1344 fdt_setprop((fdt), (nodeoffset), (name), (str), strlen(str)+1)
aec7135b 1345
36ad18a6
ML
1346/**
1347 * fdt_appendprop - append to or create a property
1348 * @fdt: pointer to the device tree blob
1349 * @nodeoffset: offset of the node whose property to change
1350 * @name: name of the property to append to
1351 * @val: pointer to data to append to the property value
1352 * @len: length of the data to append to the property value
1353 *
1354 * fdt_appendprop() appends the value to the named property in the
1355 * given node, creating the property if it does not already exist.
1356 *
1357 * This function may insert data into the blob, and will therefore
1358 * change the offsets of some existing nodes.
1359 *
1360 * returns:
1361 * 0, on success
1362 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1363 * contain the new property value
1364 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1365 * -FDT_ERR_BADLAYOUT,
1366 * -FDT_ERR_BADMAGIC,
1367 * -FDT_ERR_BADVERSION,
1368 * -FDT_ERR_BADSTATE,
1369 * -FDT_ERR_BADSTRUCTURE,
1370 * -FDT_ERR_BADLAYOUT,
1371 * -FDT_ERR_TRUNCATED, standard meanings
1372 */
1373int fdt_appendprop(void *fdt, int nodeoffset, const char *name,
1374 const void *val, int len);
1375
1376/**
24fa0e58 1377 * fdt_appendprop_u32 - append a 32-bit integer value to a property
36ad18a6
ML
1378 * @fdt: pointer to the device tree blob
1379 * @nodeoffset: offset of the node whose property to change
1380 * @name: name of the property to change
1381 * @val: 32-bit integer value to append to the property (native endian)
1382 *
24fa0e58
DG
1383 * fdt_appendprop_u32() appends the given 32-bit integer value
1384 * (converting to big-endian if necessary) to the value of the named
1385 * property in the given node, or creates a new property with that
1386 * value if it does not already exist.
36ad18a6
ML
1387 *
1388 * This function may insert data into the blob, and will therefore
1389 * change the offsets of some existing nodes.
1390 *
1391 * returns:
1392 * 0, on success
1393 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1394 * contain the new property value
1395 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1396 * -FDT_ERR_BADLAYOUT,
1397 * -FDT_ERR_BADMAGIC,
1398 * -FDT_ERR_BADVERSION,
1399 * -FDT_ERR_BADSTATE,
1400 * -FDT_ERR_BADSTRUCTURE,
1401 * -FDT_ERR_BADLAYOUT,
1402 * -FDT_ERR_TRUNCATED, standard meanings
1403 */
24fa0e58
DG
1404static inline int fdt_appendprop_u32(void *fdt, int nodeoffset,
1405 const char *name, uint32_t val)
36ad18a6 1406{
b2ba62a1
KP
1407 fdt32_t tmp = cpu_to_fdt32(val);
1408 return fdt_appendprop(fdt, nodeoffset, name, &tmp, sizeof(tmp));
36ad18a6
ML
1409}
1410
24fa0e58
DG
1411/**
1412 * fdt_appendprop_u64 - append a 64-bit integer value to a property
1413 * @fdt: pointer to the device tree blob
1414 * @nodeoffset: offset of the node whose property to change
1415 * @name: name of the property to change
1416 * @val: 64-bit integer value to append to the property (native endian)
1417 *
1418 * fdt_appendprop_u64() appends the given 64-bit integer value
1419 * (converting to big-endian if necessary) to the value of the named
1420 * property in the given node, or creates a new property with that
1421 * value if it does not already exist.
1422 *
1423 * This function may insert data into the blob, and will therefore
1424 * change the offsets of some existing nodes.
1425 *
1426 * returns:
1427 * 0, on success
1428 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1429 * contain the new property value
1430 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1431 * -FDT_ERR_BADLAYOUT,
1432 * -FDT_ERR_BADMAGIC,
1433 * -FDT_ERR_BADVERSION,
1434 * -FDT_ERR_BADSTATE,
1435 * -FDT_ERR_BADSTRUCTURE,
1436 * -FDT_ERR_BADLAYOUT,
1437 * -FDT_ERR_TRUNCATED, standard meanings
1438 */
1439static inline int fdt_appendprop_u64(void *fdt, int nodeoffset,
1440 const char *name, uint64_t val)
1441{
b2ba62a1
KP
1442 fdt64_t tmp = cpu_to_fdt64(val);
1443 return fdt_appendprop(fdt, nodeoffset, name, &tmp, sizeof(tmp));
24fa0e58
DG
1444}
1445
1446/**
1447 * fdt_appendprop_cell - append a single cell value to a property
1448 *
1449 * This is an alternative name for fdt_appendprop_u32()
1450 */
1451static inline int fdt_appendprop_cell(void *fdt, int nodeoffset,
1452 const char *name, uint32_t val)
1453{
1454 return fdt_appendprop_u32(fdt, nodeoffset, name, val);
1455}
1456
36ad18a6
ML
1457/**
1458 * fdt_appendprop_string - append a string to a property
1459 * @fdt: pointer to the device tree blob
1460 * @nodeoffset: offset of the node whose property to change
1461 * @name: name of the property to change
1462 * @str: string value to append to the property
1463 *
1464 * fdt_appendprop_string() appends the given string to the value of
1465 * the named property in the given node, or creates a new property
1466 * with that value if it does not already exist.
1467 *
1468 * This function may insert data into the blob, and will therefore
1469 * change the offsets of some existing nodes.
1470 *
1471 * returns:
1472 * 0, on success
1473 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1474 * contain the new property value
1475 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1476 * -FDT_ERR_BADLAYOUT,
1477 * -FDT_ERR_BADMAGIC,
1478 * -FDT_ERR_BADVERSION,
1479 * -FDT_ERR_BADSTATE,
1480 * -FDT_ERR_BADSTRUCTURE,
1481 * -FDT_ERR_BADLAYOUT,
1482 * -FDT_ERR_TRUNCATED, standard meanings
1483 */
1484#define fdt_appendprop_string(fdt, nodeoffset, name, str) \
1485 fdt_appendprop((fdt), (nodeoffset), (name), (str), strlen(str)+1)
1486
aec7135b
DG
1487/**
1488 * fdt_delprop - delete a property
1489 * @fdt: pointer to the device tree blob
1490 * @nodeoffset: offset of the node whose property to nop
1491 * @name: name of the property to nop
1492 *
1493 * fdt_del_property() will delete the given property.
1494 *
1495 * This function will delete data from the blob, and will therefore
1496 * change the offsets of some existing nodes.
1497 *
1498 * returns:
1499 * 0, on success
1500 * -FDT_ERR_NOTFOUND, node does not have the named property
1501 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1502 * -FDT_ERR_BADLAYOUT,
1503 * -FDT_ERR_BADMAGIC,
1504 * -FDT_ERR_BADVERSION,
1505 * -FDT_ERR_BADSTATE,
1506 * -FDT_ERR_BADSTRUCTURE,
1507 * -FDT_ERR_TRUNCATED, standard meanings
1508 */
7cd5da0f 1509int fdt_delprop(void *fdt, int nodeoffset, const char *name);
aec7135b
DG
1510
1511/**
1512 * fdt_add_subnode_namelen - creates a new node based on substring
1513 * @fdt: pointer to the device tree blob
1514 * @parentoffset: structure block offset of a node
1515 * @name: name of the subnode to locate
1516 * @namelen: number of characters of name to consider
1517 *
1518 * Identical to fdt_add_subnode(), but use only the first namelen
1519 * characters of name as the name of the new node. This is useful for
1520 * creating subnodes based on a portion of a larger string, such as a
1521 * full path.
1522 */
7cd5da0f
GVB
1523int fdt_add_subnode_namelen(void *fdt, int parentoffset,
1524 const char *name, int namelen);
aec7135b
DG
1525
1526/**
1527 * fdt_add_subnode - creates a new node
1528 * @fdt: pointer to the device tree blob
1529 * @parentoffset: structure block offset of a node
1530 * @name: name of the subnode to locate
1531 *
1532 * fdt_add_subnode() creates a new node as a subnode of the node at
1533 * structure block offset parentoffset, with the given name (which
1534 * should include the unit address, if any).
1535 *
1536 * This function will insert data into the blob, and will therefore
1537 * change the offsets of some existing nodes.
1538
1539 * returns:
1540 * structure block offset of the created nodeequested subnode (>=0), on success
1541 * -FDT_ERR_NOTFOUND, if the requested subnode does not exist
1542 * -FDT_ERR_BADOFFSET, if parentoffset did not point to an FDT_BEGIN_NODE tag
1543 * -FDT_ERR_EXISTS, if the node at parentoffset already has a subnode of
1544 * the given name
1545 * -FDT_ERR_NOSPACE, if there is insufficient free space in the
1546 * blob to contain the new node
1547 * -FDT_ERR_NOSPACE
1548 * -FDT_ERR_BADLAYOUT
1549 * -FDT_ERR_BADMAGIC,
1550 * -FDT_ERR_BADVERSION,
1551 * -FDT_ERR_BADSTATE,
1552 * -FDT_ERR_BADSTRUCTURE,
1553 * -FDT_ERR_TRUNCATED, standard meanings.
1554 */
7cd5da0f 1555int fdt_add_subnode(void *fdt, int parentoffset, const char *name);
aec7135b
DG
1556
1557/**
1558 * fdt_del_node - delete a node (subtree)
1559 * @fdt: pointer to the device tree blob
1560 * @nodeoffset: offset of the node to nop
1561 *
1562 * fdt_del_node() will remove the given node, including all its
1563 * subnodes if any, from the blob.
1564 *
1565 * This function will delete data from the blob, and will therefore
1566 * change the offsets of some existing nodes.
1567 *
1568 * returns:
1569 * 0, on success
1570 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1571 * -FDT_ERR_BADLAYOUT,
1572 * -FDT_ERR_BADMAGIC,
1573 * -FDT_ERR_BADVERSION,
1574 * -FDT_ERR_BADSTATE,
1575 * -FDT_ERR_BADSTRUCTURE,
1576 * -FDT_ERR_TRUNCATED, standard meanings
1577 */
7cd5da0f
GVB
1578int fdt_del_node(void *fdt, int nodeoffset);
1579
8d04f02f
KG
1580/**********************************************************************/
1581/* Debugging / informational functions */
1582/**********************************************************************/
1583
7cd5da0f
GVB
1584const char *fdt_strerror(int errval);
1585
3e06cd1f
SG
1586struct fdt_region {
1587 int offset;
1588 int size;
1589};
1590
1591/**
1592 * fdt_find_regions() - find regions in device tree
1593 *
1594 * Given a list of nodes to include and properties to exclude, find
1595 * the regions of the device tree which describe those included parts.
1596 *
1597 * The intent is to get a list of regions which will be invariant provided
1598 * those parts are invariant. For example, if you request a list of regions
1599 * for all nodes but exclude the property "data", then you will get the
1600 * same region contents regardless of any change to "data" properties.
1601 *
1602 * This function can be used to produce a byte-stream to send to a hashing
1603 * function to verify that critical parts of the FDT have not changed.
1604 *
1605 * Nodes which are given in 'inc' are included in the region list, as
1606 * are the names of the immediate subnodes nodes (but not the properties
1607 * or subnodes of those subnodes).
1608 *
1609 * For eaxample "/" means to include the root node, all root properties
1610 * and the FDT_BEGIN_NODE and FDT_END_NODE of all subnodes of /. The latter
1611 * ensures that we capture the names of the subnodes. In a hashing situation
1612 * it prevents the root node from changing at all Any change to non-excluded
1613 * properties, names of subnodes or number of subnodes would be detected.
1614 *
1615 * When used with FITs this provides the ability to hash and sign parts of
1616 * the FIT based on different configurations in the FIT. Then it is
1617 * impossible to change anything about that configuration (include images
1618 * attached to the configuration), but it may be possible to add new
1619 * configurations, new images or new signatures within the existing
1620 * framework.
1621 *
1622 * Adding new properties to a device tree may result in the string table
1623 * being extended (if the new property names are different from those
1624 * already added). This function can optionally include a region for
1625 * the string table so that this can be part of the hash too.
1626 *
1627 * The device tree header is not included in the list.
1628 *
1629 * @fdt: Device tree to check
1630 * @inc: List of node paths to included
1631 * @inc_count: Number of node paths in list
1632 * @exc_prop: List of properties names to exclude
1633 * @exc_prop_count: Number of properties in exclude list
1634 * @region: Returns list of regions
1635 * @max_region: Maximum length of region list
1636 * @path: Pointer to a temporary string for the function to use for
1637 * building path names
1638 * @path_len: Length of path, must be large enough to hold the longest
1639 * path in the tree
1640 * @add_string_tab: 1 to add a region for the string table
1641 * @return number of regions in list. If this is >max_regions then the
1642 * region array was exhausted. You should increase max_regions and try
1643 * the call again.
1644 */
1645int fdt_find_regions(const void *fdt, char * const inc[], int inc_count,
1646 char * const exc_prop[], int exc_prop_count,
1647 struct fdt_region region[], int max_regions,
1648 char *path, int path_len, int add_string_tab);
1649
7cd5da0f 1650#endif /* _LIBFDT_H */