blob: 7403d5a6dba41a67a0a9a527c0c381ac8e4fa80e [file] [log] [blame]
Kumar Gala8d04f022007-10-24 11:04:22 -05001#ifndef _LIBFDT_H
2#define _LIBFDT_H
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04003/*
4 * libfdt - Flat Device Tree manipulation
5 * Copyright (C) 2006 David Gibson, IBM Corporation.
6 *
Kumar Gala8d04f022007-10-24 11:04:22 -05007 * libfdt is dual licensed: you can use it either under the terms of
8 * the GPL, or the BSD license, at your option.
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04009 *
Kumar Gala8d04f022007-10-24 11:04:22 -050010 * 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.
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040014 *
Kumar Gala8d04f022007-10-24 11:04:22 -050015 * 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:
30 *
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.
38 *
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.
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040052 */
53
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040054#include <libfdt_env.h>
Kumar Gala8d04f022007-10-24 11:04:22 -050055#include <fdt.h>
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040056
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
Kumar Gala8d04f022007-10-24 11:04:22 -050062 /* FDT_ERR_NOTFOUND: The requested node or property does not exist */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040063#define FDT_ERR_EXISTS 2
Kumar Gala8d04f022007-10-24 11:04:22 -050064 /* FDT_ERR_EXISTS: Attemped to create a node or property which
65 * already exists */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040066#define FDT_ERR_NOSPACE 3
Kumar Gala8d04f022007-10-24 11:04:22 -050067 /* 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. */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040071
72/* Error codes: codes for bad parameters */
73#define FDT_ERR_BADOFFSET 4
Kumar Gala8d04f022007-10-24 11:04:22 -050074 /* 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. */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040077#define FDT_ERR_BADPATH 5
Kumar Gala8d04f022007-10-24 11:04:22 -050078 /* 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. */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040088
89/* Error codes: codes for bad device tree blobs */
Kumar Gala8d04f022007-10-24 11:04:22 -050090#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. */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400112
Kumar Gala8d04f022007-10-24 11:04:22 -0500113/* "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. */
118
119#define FDT_ERR_MAX 13
120
121/**********************************************************************/
122/* Low-level functions (you probably don't need these) */
123/**********************************************************************/
124
Jon Loeliger741a6d02008-09-25 11:02:17 -0500125const void *fdt_offset_ptr(const void *fdt, int offset, unsigned int checklen);
Kumar Gala8d04f022007-10-24 11:04:22 -0500126static inline void *fdt_offset_ptr_w(void *fdt, int offset, int checklen)
127{
David Gibsonc6683022008-07-07 10:14:15 +1000128 return (void *)(uintptr_t)fdt_offset_ptr(fdt, offset, checklen);
Kumar Gala8d04f022007-10-24 11:04:22 -0500129}
130
131uint32_t fdt_next_tag(const void *fdt, int offset, int *nextoffset);
132
133/**********************************************************************/
David Gibsonae0b5902008-02-12 11:58:31 +1100134/* Traversal functions */
135/**********************************************************************/
136
137int fdt_next_node(const void *fdt, int offset, int *depth);
138
139/**********************************************************************/
Kumar Gala8d04f022007-10-24 11:04:22 -0500140/* General functions */
141/**********************************************************************/
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400142
143#define fdt_get_header(fdt, field) \
Kumar Gala8d04f022007-10-24 11:04:22 -0500144 (fdt32_to_cpu(((const struct fdt_header *)(fdt))->field))
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200145#define fdt_magic(fdt) (fdt_get_header(fdt, magic))
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400146#define fdt_totalsize(fdt) (fdt_get_header(fdt, totalsize))
147#define fdt_off_dt_struct(fdt) (fdt_get_header(fdt, off_dt_struct))
148#define fdt_off_dt_strings(fdt) (fdt_get_header(fdt, off_dt_strings))
149#define fdt_off_mem_rsvmap(fdt) (fdt_get_header(fdt, off_mem_rsvmap))
150#define fdt_version(fdt) (fdt_get_header(fdt, version))
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200151#define fdt_last_comp_version(fdt) (fdt_get_header(fdt, last_comp_version))
152#define fdt_boot_cpuid_phys(fdt) (fdt_get_header(fdt, boot_cpuid_phys))
153#define fdt_size_dt_strings(fdt) (fdt_get_header(fdt, size_dt_strings))
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400154#define fdt_size_dt_struct(fdt) (fdt_get_header(fdt, size_dt_struct))
155
Kumar Gala8d04f022007-10-24 11:04:22 -0500156#define __fdt_set_hdr(name) \
157 static inline void fdt_set_##name(void *fdt, uint32_t val) \
158 { \
Laurent Gregoire67b89c72009-03-03 14:23:59 +0100159 struct fdt_header *fdth = (struct fdt_header*)fdt; \
Kumar Gala8d04f022007-10-24 11:04:22 -0500160 fdth->name = cpu_to_fdt32(val); \
161 }
162__fdt_set_hdr(magic);
163__fdt_set_hdr(totalsize);
164__fdt_set_hdr(off_dt_struct);
165__fdt_set_hdr(off_dt_strings);
166__fdt_set_hdr(off_mem_rsvmap);
167__fdt_set_hdr(version);
168__fdt_set_hdr(last_comp_version);
169__fdt_set_hdr(boot_cpuid_phys);
170__fdt_set_hdr(size_dt_strings);
171__fdt_set_hdr(size_dt_struct);
172#undef __fdt_set_hdr
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400173
Kumar Gala8d04f022007-10-24 11:04:22 -0500174/**
175 * fdt_check_header - sanity check a device tree or possible device tree
176 * @fdt: pointer to data which might be a flattened device tree
177 *
178 * fdt_check_header() checks that the given buffer contains what
179 * appears to be a flattened device tree with sane information in its
180 * header.
181 *
182 * returns:
183 * 0, if the buffer appears to contain a valid device tree
184 * -FDT_ERR_BADMAGIC,
185 * -FDT_ERR_BADVERSION,
186 * -FDT_ERR_BADSTATE, standard meanings, as above
187 */
Gerald Van Baren6679f922007-04-06 14:17:14 -0400188int fdt_check_header(const void *fdt);
189
Kumar Gala8d04f022007-10-24 11:04:22 -0500190/**
191 * fdt_move - move a device tree around in memory
192 * @fdt: pointer to the device tree to move
193 * @buf: pointer to memory where the device is to be moved
194 * @bufsize: size of the memory space at buf
195 *
196 * fdt_move() relocates, if possible, the device tree blob located at
197 * fdt to the buffer at buf of size bufsize. The buffer may overlap
198 * with the existing device tree blob at fdt. Therefore,
199 * fdt_move(fdt, fdt, fdt_totalsize(fdt))
200 * should always succeed.
201 *
202 * returns:
203 * 0, on success
204 * -FDT_ERR_NOSPACE, bufsize is insufficient to contain the device tree
205 * -FDT_ERR_BADMAGIC,
206 * -FDT_ERR_BADVERSION,
207 * -FDT_ERR_BADSTATE, standard meanings
208 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400209int fdt_move(const void *fdt, void *buf, int bufsize);
210
Kumar Gala8d04f022007-10-24 11:04:22 -0500211/**********************************************************************/
212/* Read-only functions */
213/**********************************************************************/
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400214
Kumar Gala8d04f022007-10-24 11:04:22 -0500215/**
Wolfram Sang46390da2008-07-09 11:22:44 +0200216 * fdt_string - retrieve a string from the strings block of a device tree
Kumar Gala8d04f022007-10-24 11:04:22 -0500217 * @fdt: pointer to the device tree blob
218 * @stroffset: offset of the string within the strings block (native endian)
219 *
220 * fdt_string() retrieves a pointer to a single string from the
221 * strings block of the device tree blob at fdt.
222 *
223 * returns:
224 * a pointer to the string, on success
225 * NULL, if stroffset is out of bounds
226 */
227const char *fdt_string(const void *fdt, int stroffset);
228
229/**
Wolfram Sang46390da2008-07-09 11:22:44 +0200230 * fdt_num_mem_rsv - retrieve the number of memory reserve map entries
Kumar Gala8d04f022007-10-24 11:04:22 -0500231 * @fdt: pointer to the device tree blob
232 *
233 * Returns the number of entries in the device tree blob's memory
234 * reservation map. This does not include the terminating 0,0 entry
235 * or any other (0,0) entries reserved for expansion.
236 *
237 * returns:
238 * the number of entries
239 */
240int fdt_num_mem_rsv(const void *fdt);
241
242/**
Wolfram Sang46390da2008-07-09 11:22:44 +0200243 * fdt_get_mem_rsv - retrieve one memory reserve map entry
Kumar Gala8d04f022007-10-24 11:04:22 -0500244 * @fdt: pointer to the device tree blob
245 * @address, @size: pointers to 64-bit variables
246 *
247 * On success, *address and *size will contain the address and size of
248 * the n-th reserve map entry from the device tree blob, in
249 * native-endian format.
250 *
251 * returns:
252 * 0, on success
253 * -FDT_ERR_BADMAGIC,
254 * -FDT_ERR_BADVERSION,
255 * -FDT_ERR_BADSTATE, standard meanings
256 */
257int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size);
258
259/**
260 * fdt_subnode_offset_namelen - find a subnode based on substring
261 * @fdt: pointer to the device tree blob
262 * @parentoffset: structure block offset of a node
263 * @name: name of the subnode to locate
264 * @namelen: number of characters of name to consider
265 *
266 * Identical to fdt_subnode_offset(), but only examine the first
267 * namelen characters of name for matching the subnode name. This is
268 * useful for finding subnodes based on a portion of a larger string,
269 * such as a full path.
270 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400271int fdt_subnode_offset_namelen(const void *fdt, int parentoffset,
272 const char *name, int namelen);
Kumar Gala8d04f022007-10-24 11:04:22 -0500273/**
274 * fdt_subnode_offset - find a subnode of a given node
275 * @fdt: pointer to the device tree blob
276 * @parentoffset: structure block offset of a node
277 * @name: name of the subnode to locate
278 *
279 * fdt_subnode_offset() finds a subnode of the node at structure block
280 * offset parentoffset with the given name. name may include a unit
281 * address, in which case fdt_subnode_offset() will find the subnode
282 * with that unit address, or the unit address may be omitted, in
283 * which case fdt_subnode_offset() will find an arbitrary subnode
284 * whose name excluding unit address matches the given name.
285 *
286 * returns:
287 * structure block offset of the requested subnode (>=0), on success
288 * -FDT_ERR_NOTFOUND, if the requested subnode does not exist
289 * -FDT_ERR_BADOFFSET, if parentoffset did not point to an FDT_BEGIN_NODE tag
290 * -FDT_ERR_BADMAGIC,
291 * -FDT_ERR_BADVERSION,
292 * -FDT_ERR_BADSTATE,
293 * -FDT_ERR_BADSTRUCTURE,
294 * -FDT_ERR_TRUNCATED, standard meanings.
295 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400296int fdt_subnode_offset(const void *fdt, int parentoffset, const char *name);
297
Kumar Gala8d04f022007-10-24 11:04:22 -0500298/**
299 * fdt_path_offset - find a tree node by its full path
300 * @fdt: pointer to the device tree blob
301 * @path: full path of the node to locate
302 *
303 * fdt_path_offset() finds a node of a given path in the device tree.
304 * Each path component may omit the unit address portion, but the
305 * results of this are undefined if any such path component is
306 * ambiguous (that is if there are multiple nodes at the relevant
307 * level matching the given component, differentiated only by unit
308 * address).
309 *
310 * returns:
311 * structure block offset of the node with the requested path (>=0), on success
312 * -FDT_ERR_BADPATH, given path does not begin with '/' or is invalid
313 * -FDT_ERR_NOTFOUND, if the requested node does not exist
314 * -FDT_ERR_BADMAGIC,
315 * -FDT_ERR_BADVERSION,
316 * -FDT_ERR_BADSTATE,
317 * -FDT_ERR_BADSTRUCTURE,
318 * -FDT_ERR_TRUNCATED, standard meanings.
319 */
320int fdt_path_offset(const void *fdt, const char *path);
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400321
Kumar Gala8d04f022007-10-24 11:04:22 -0500322/**
Wolfram Sang46390da2008-07-09 11:22:44 +0200323 * fdt_get_name - retrieve the name of a given node
Kumar Gala8d04f022007-10-24 11:04:22 -0500324 * @fdt: pointer to the device tree blob
325 * @nodeoffset: structure block offset of the starting node
326 * @lenp: pointer to an integer variable (will be overwritten) or NULL
327 *
328 * fdt_get_name() retrieves the name (including unit address) of the
329 * device tree node at structure block offset nodeoffset. If lenp is
330 * non-NULL, the length of this name is also returned, in the integer
331 * pointed to by lenp.
332 *
333 * returns:
334 * pointer to the node's name, on success
335 * If lenp is non-NULL, *lenp contains the length of that name (>=0)
336 * NULL, on error
337 * if lenp is non-NULL *lenp contains an error code (<0):
338 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
339 * -FDT_ERR_BADMAGIC,
340 * -FDT_ERR_BADVERSION,
341 * -FDT_ERR_BADSTATE, standard meanings
342 */
343const char *fdt_get_name(const void *fdt, int nodeoffset, int *lenp);
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400344
Kumar Gala8d04f022007-10-24 11:04:22 -0500345/**
David Gibsond1c63142010-03-09 17:39:14 +1100346 * fdt_first_property_offset - find the offset of a node's first property
347 * @fdt: pointer to the device tree blob
348 * @nodeoffset: structure block offset of a node
349 *
350 * fdt_first_property_offset() finds the first property of the node at
351 * the given structure block offset.
352 *
353 * returns:
354 * structure block offset of the property (>=0), on success
355 * -FDT_ERR_NOTFOUND, if the requested node has no properties
356 * -FDT_ERR_BADOFFSET, if nodeoffset did not point to an FDT_BEGIN_NODE tag
357 * -FDT_ERR_BADMAGIC,
358 * -FDT_ERR_BADVERSION,
359 * -FDT_ERR_BADSTATE,
360 * -FDT_ERR_BADSTRUCTURE,
361 * -FDT_ERR_TRUNCATED, standard meanings.
362 */
363int fdt_first_property_offset(const void *fdt, int nodeoffset);
364
365/**
366 * fdt_next_property_offset - step through a node's properties
367 * @fdt: pointer to the device tree blob
368 * @offset: structure block offset of a property
369 *
370 * fdt_next_property_offset() finds the property immediately after the
371 * one at the given structure block offset. This will be a property
372 * of the same node as the given property.
373 *
374 * returns:
375 * structure block offset of the next property (>=0), on success
376 * -FDT_ERR_NOTFOUND, if the given property is the last in its node
377 * -FDT_ERR_BADOFFSET, if nodeoffset did not point to an FDT_PROP tag
378 * -FDT_ERR_BADMAGIC,
379 * -FDT_ERR_BADVERSION,
380 * -FDT_ERR_BADSTATE,
381 * -FDT_ERR_BADSTRUCTURE,
382 * -FDT_ERR_TRUNCATED, standard meanings.
383 */
384int fdt_next_property_offset(const void *fdt, int offset);
385
386/**
387 * fdt_get_property_by_offset - retrieve the property at a given offset
388 * @fdt: pointer to the device tree blob
389 * @offset: offset of the property to retrieve
390 * @lenp: pointer to an integer variable (will be overwritten) or NULL
391 *
392 * fdt_get_property_by_offset() retrieves a pointer to the
393 * fdt_property structure within the device tree blob at the given
394 * offset. If lenp is non-NULL, the length of the property value is
395 * also returned, in the integer pointed to by lenp.
396 *
397 * returns:
398 * pointer to the structure representing the property
399 * if lenp is non-NULL, *lenp contains the length of the property
400 * value (>=0)
401 * NULL, on error
402 * if lenp is non-NULL, *lenp contains an error code (<0):
403 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_PROP tag
404 * -FDT_ERR_BADMAGIC,
405 * -FDT_ERR_BADVERSION,
406 * -FDT_ERR_BADSTATE,
407 * -FDT_ERR_BADSTRUCTURE,
408 * -FDT_ERR_TRUNCATED, standard meanings
409 */
410const struct fdt_property *fdt_get_property_by_offset(const void *fdt,
411 int offset,
412 int *lenp);
413
414/**
David Gibson02193992008-08-06 14:50:49 +1000415 * fdt_get_property_namelen - find a property based on substring
416 * @fdt: pointer to the device tree blob
417 * @nodeoffset: offset of the node whose property to find
418 * @name: name of the property to find
419 * @namelen: number of characters of name to consider
420 * @lenp: pointer to an integer variable (will be overwritten) or NULL
421 *
422 * Identical to fdt_get_property_namelen(), but only examine the first
423 * namelen characters of name for matching the property name.
424 */
425const struct fdt_property *fdt_get_property_namelen(const void *fdt,
426 int nodeoffset,
427 const char *name,
428 int namelen, int *lenp);
429
430/**
Kumar Gala8d04f022007-10-24 11:04:22 -0500431 * fdt_get_property - find a given property in a given node
432 * @fdt: pointer to the device tree blob
433 * @nodeoffset: offset of the node whose property to find
434 * @name: name of the property to find
435 * @lenp: pointer to an integer variable (will be overwritten) or NULL
436 *
437 * fdt_get_property() retrieves a pointer to the fdt_property
438 * structure within the device tree blob corresponding to the property
439 * named 'name' of the node at offset nodeoffset. If lenp is
Wolfram Sang46390da2008-07-09 11:22:44 +0200440 * non-NULL, the length of the property value is also returned, in the
Kumar Gala8d04f022007-10-24 11:04:22 -0500441 * integer pointed to by lenp.
442 *
443 * returns:
444 * pointer to the structure representing the property
445 * if lenp is non-NULL, *lenp contains the length of the property
446 * value (>=0)
447 * NULL, on error
448 * if lenp is non-NULL, *lenp contains an error code (<0):
449 * -FDT_ERR_NOTFOUND, node does not have named property
450 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
451 * -FDT_ERR_BADMAGIC,
452 * -FDT_ERR_BADVERSION,
453 * -FDT_ERR_BADSTATE,
454 * -FDT_ERR_BADSTRUCTURE,
455 * -FDT_ERR_TRUNCATED, standard meanings
456 */
457const struct fdt_property *fdt_get_property(const void *fdt, int nodeoffset,
458 const char *name, int *lenp);
459static inline struct fdt_property *fdt_get_property_w(void *fdt, int nodeoffset,
460 const char *name,
461 int *lenp)
462{
David Gibsonc6683022008-07-07 10:14:15 +1000463 return (struct fdt_property *)(uintptr_t)
464 fdt_get_property(fdt, nodeoffset, name, lenp);
Kumar Gala8d04f022007-10-24 11:04:22 -0500465}
Gerald Van Baren3af0d582007-03-31 12:13:43 -0400466
Kumar Gala8d04f022007-10-24 11:04:22 -0500467/**
David Gibsond1c63142010-03-09 17:39:14 +1100468 * fdt_getprop_by_offset - retrieve the value of a property at a given offset
469 * @fdt: pointer to the device tree blob
470 * @ffset: offset of the property to read
471 * @namep: pointer to a string variable (will be overwritten) or NULL
472 * @lenp: pointer to an integer variable (will be overwritten) or NULL
473 *
474 * fdt_getprop_by_offset() retrieves a pointer to the value of the
475 * property at structure block offset 'offset' (this will be a pointer
476 * to within the device blob itself, not a copy of the value). If
477 * lenp is non-NULL, the length of the property value is also
478 * returned, in the integer pointed to by lenp. If namep is non-NULL,
479 * the property's namne will also be returned in the char * pointed to
480 * by namep (this will be a pointer to within the device tree's string
481 * block, not a new copy of the name).
482 *
483 * returns:
484 * pointer to the property's value
485 * if lenp is non-NULL, *lenp contains the length of the property
486 * value (>=0)
487 * if namep is non-NULL *namep contiains a pointer to the property
488 * name.
489 * NULL, on error
490 * if lenp is non-NULL, *lenp contains an error code (<0):
491 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_PROP tag
492 * -FDT_ERR_BADMAGIC,
493 * -FDT_ERR_BADVERSION,
494 * -FDT_ERR_BADSTATE,
495 * -FDT_ERR_BADSTRUCTURE,
496 * -FDT_ERR_TRUNCATED, standard meanings
497 */
498const void *fdt_getprop_by_offset(const void *fdt, int offset,
499 const char **namep, int *lenp);
500
501/**
David Gibson02193992008-08-06 14:50:49 +1000502 * fdt_getprop_namelen - get property value based on substring
503 * @fdt: pointer to the device tree blob
504 * @nodeoffset: offset of the node whose property to find
505 * @name: name of the property to find
506 * @namelen: number of characters of name to consider
507 * @lenp: pointer to an integer variable (will be overwritten) or NULL
508 *
509 * Identical to fdt_getprop(), but only examine the first namelen
510 * characters of name for matching the property name.
511 */
512const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
513 const char *name, int namelen, int *lenp);
514
515/**
Kumar Gala8d04f022007-10-24 11:04:22 -0500516 * fdt_getprop - retrieve the value of a given property
517 * @fdt: pointer to the device tree blob
518 * @nodeoffset: offset of the node whose property to find
519 * @name: name of the property to find
520 * @lenp: pointer to an integer variable (will be overwritten) or NULL
521 *
522 * fdt_getprop() retrieves a pointer to the value of the property
523 * named 'name' of the node at offset nodeoffset (this will be a
524 * pointer to within the device blob itself, not a copy of the value).
Wolfram Sang46390da2008-07-09 11:22:44 +0200525 * If lenp is non-NULL, the length of the property value is also
Kumar Gala8d04f022007-10-24 11:04:22 -0500526 * returned, in the integer pointed to by lenp.
527 *
528 * returns:
529 * pointer to the property's value
530 * if lenp is non-NULL, *lenp contains the length of the property
531 * value (>=0)
532 * NULL, on error
533 * if lenp is non-NULL, *lenp contains an error code (<0):
534 * -FDT_ERR_NOTFOUND, node does not have named property
535 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
536 * -FDT_ERR_BADMAGIC,
537 * -FDT_ERR_BADVERSION,
538 * -FDT_ERR_BADSTATE,
539 * -FDT_ERR_BADSTRUCTURE,
540 * -FDT_ERR_TRUNCATED, standard meanings
541 */
542const void *fdt_getprop(const void *fdt, int nodeoffset,
543 const char *name, int *lenp);
544static inline void *fdt_getprop_w(void *fdt, int nodeoffset,
545 const char *name, int *lenp)
546{
David Gibsonc6683022008-07-07 10:14:15 +1000547 return (void *)(uintptr_t)fdt_getprop(fdt, nodeoffset, name, lenp);
Kumar Gala8d04f022007-10-24 11:04:22 -0500548}
549
550/**
Wolfram Sang46390da2008-07-09 11:22:44 +0200551 * fdt_get_phandle - retrieve the phandle of a given node
Kumar Gala8d04f022007-10-24 11:04:22 -0500552 * @fdt: pointer to the device tree blob
553 * @nodeoffset: structure block offset of the node
554 *
555 * fdt_get_phandle() retrieves the phandle of the device tree node at
556 * structure block offset nodeoffset.
557 *
558 * returns:
Wolfram Sang46390da2008-07-09 11:22:44 +0200559 * the phandle of the node at nodeoffset, on success (!= 0, != -1)
Kumar Gala8d04f022007-10-24 11:04:22 -0500560 * 0, if the node has no phandle, or another error occurs
561 */
562uint32_t fdt_get_phandle(const void *fdt, int nodeoffset);
563
564/**
Gerald Van Barencd3cb0d2008-10-04 07:56:06 -0400565 * fdt_get_alias_namelen - get alias based on substring
David Gibson9a6cf732008-08-20 16:55:14 +1000566 * @fdt: pointer to the device tree blob
567 * @name: name of the alias th look up
568 * @namelen: number of characters of name to consider
569 *
570 * Identical to fdt_get_alias(), but only examine the first namelen
571 * characters of name for matching the alias name.
572 */
573const char *fdt_get_alias_namelen(const void *fdt,
574 const char *name, int namelen);
575
576/**
577 * fdt_get_alias - retreive the path referenced by a given alias
578 * @fdt: pointer to the device tree blob
579 * @name: name of the alias th look up
580 *
581 * fdt_get_alias() retrieves the value of a given alias. That is, the
582 * value of the property named 'name' in the node /aliases.
583 *
584 * returns:
François Revolc73bd492013-02-03 00:52:21 +0100585 * a pointer to the expansion of the alias named 'name', if it exists
David Gibson9a6cf732008-08-20 16:55:14 +1000586 * NULL, if the given alias or the /aliases node does not exist
587 */
588const char *fdt_get_alias(const void *fdt, const char *name);
589
590/**
Kumar Gala8d04f022007-10-24 11:04:22 -0500591 * fdt_get_path - determine the full path of a node
592 * @fdt: pointer to the device tree blob
593 * @nodeoffset: offset of the node whose path to find
594 * @buf: character buffer to contain the returned path (will be overwritten)
595 * @buflen: size of the character buffer at buf
596 *
597 * fdt_get_path() computes the full path of the node at offset
598 * nodeoffset, and records that path in the buffer at buf.
599 *
600 * NOTE: This function is expensive, as it must scan the device tree
601 * structure from the start to nodeoffset.
602 *
603 * returns:
604 * 0, on success
605 * buf contains the absolute path of the node at
606 * nodeoffset, as a NUL-terminated string.
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200607 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
Kumar Gala8d04f022007-10-24 11:04:22 -0500608 * -FDT_ERR_NOSPACE, the path of the given node is longer than (bufsize-1)
609 * characters and will not fit in the given buffer.
610 * -FDT_ERR_BADMAGIC,
611 * -FDT_ERR_BADVERSION,
612 * -FDT_ERR_BADSTATE,
613 * -FDT_ERR_BADSTRUCTURE, standard meanings
614 */
615int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen);
616
617/**
618 * fdt_supernode_atdepth_offset - find a specific ancestor of a node
619 * @fdt: pointer to the device tree blob
620 * @nodeoffset: offset of the node whose parent to find
621 * @supernodedepth: depth of the ancestor to find
622 * @nodedepth: pointer to an integer variable (will be overwritten) or NULL
623 *
624 * fdt_supernode_atdepth_offset() finds an ancestor of the given node
625 * at a specific depth from the root (where the root itself has depth
626 * 0, its immediate subnodes depth 1 and so forth). So
627 * fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, NULL);
628 * will always return 0, the offset of the root node. If the node at
629 * nodeoffset has depth D, then:
630 * fdt_supernode_atdepth_offset(fdt, nodeoffset, D, NULL);
631 * will return nodeoffset itself.
632 *
633 * NOTE: This function is expensive, as it must scan the device tree
634 * structure from the start to nodeoffset.
635 *
636 * returns:
637
638 * structure block offset of the node at node offset's ancestor
639 * of depth supernodedepth (>=0), on success
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200640 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
Kumar Gala8d04f022007-10-24 11:04:22 -0500641* -FDT_ERR_NOTFOUND, supernodedepth was greater than the depth of nodeoffset
642 * -FDT_ERR_BADMAGIC,
643 * -FDT_ERR_BADVERSION,
644 * -FDT_ERR_BADSTATE,
645 * -FDT_ERR_BADSTRUCTURE, standard meanings
646 */
647int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
648 int supernodedepth, int *nodedepth);
649
650/**
651 * fdt_node_depth - find the depth of a given node
652 * @fdt: pointer to the device tree blob
653 * @nodeoffset: offset of the node whose parent to find
654 *
655 * fdt_node_depth() finds the depth of a given node. The root node
656 * has depth 0, its immediate subnodes depth 1 and so forth.
657 *
658 * NOTE: This function is expensive, as it must scan the device tree
659 * structure from the start to nodeoffset.
660 *
661 * returns:
662 * depth of the node at nodeoffset (>=0), on success
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200663 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
Kumar Gala8d04f022007-10-24 11:04:22 -0500664 * -FDT_ERR_BADMAGIC,
665 * -FDT_ERR_BADVERSION,
666 * -FDT_ERR_BADSTATE,
667 * -FDT_ERR_BADSTRUCTURE, standard meanings
668 */
669int fdt_node_depth(const void *fdt, int nodeoffset);
670
671/**
672 * fdt_parent_offset - find the parent of a given node
673 * @fdt: pointer to the device tree blob
674 * @nodeoffset: offset of the node whose parent to find
675 *
676 * fdt_parent_offset() locates the parent node of a given node (that
677 * is, it finds the offset of the node which contains the node at
678 * nodeoffset as a subnode).
679 *
680 * NOTE: This function is expensive, as it must scan the device tree
681 * structure from the start to nodeoffset, *twice*.
682 *
683 * returns:
Wolfram Sang46390da2008-07-09 11:22:44 +0200684 * structure block offset of the parent of the node at nodeoffset
Kumar Gala8d04f022007-10-24 11:04:22 -0500685 * (>=0), on success
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200686 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
Kumar Gala8d04f022007-10-24 11:04:22 -0500687 * -FDT_ERR_BADMAGIC,
688 * -FDT_ERR_BADVERSION,
689 * -FDT_ERR_BADSTATE,
690 * -FDT_ERR_BADSTRUCTURE, standard meanings
691 */
692int fdt_parent_offset(const void *fdt, int nodeoffset);
693
694/**
695 * fdt_node_offset_by_prop_value - find nodes with a given property value
696 * @fdt: pointer to the device tree blob
697 * @startoffset: only find nodes after this offset
698 * @propname: property name to check
699 * @propval: property value to search for
700 * @proplen: length of the value in propval
701 *
702 * fdt_node_offset_by_prop_value() returns the offset of the first
703 * node after startoffset, which has a property named propname whose
704 * value is of length proplen and has value equal to propval; or if
705 * startoffset is -1, the very first such node in the tree.
706 *
707 * To iterate through all nodes matching the criterion, the following
708 * idiom can be used:
709 * offset = fdt_node_offset_by_prop_value(fdt, -1, propname,
710 * propval, proplen);
711 * while (offset != -FDT_ERR_NOTFOUND) {
Wolfgang Denk1182e9f2008-01-02 15:58:44 +0100712 * ... other code here ...
Kumar Gala8d04f022007-10-24 11:04:22 -0500713 * offset = fdt_node_offset_by_prop_value(fdt, offset, propname,
714 * propval, proplen);
715 * }
716 *
717 * Note the -1 in the first call to the function, if 0 is used here
718 * instead, the function will never locate the root node, even if it
719 * matches the criterion.
720 *
721 * returns:
722 * structure block offset of the located node (>= 0, >startoffset),
723 * on success
724 * -FDT_ERR_NOTFOUND, no node matching the criterion exists in the
725 * tree after startoffset
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200726 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
Kumar Gala8d04f022007-10-24 11:04:22 -0500727 * -FDT_ERR_BADMAGIC,
728 * -FDT_ERR_BADVERSION,
729 * -FDT_ERR_BADSTATE,
730 * -FDT_ERR_BADSTRUCTURE, standard meanings
731 */
732int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
733 const char *propname,
734 const void *propval, int proplen);
735
736/**
737 * fdt_node_offset_by_phandle - find the node with a given phandle
738 * @fdt: pointer to the device tree blob
739 * @phandle: phandle value
740 *
Wolfram Sang46390da2008-07-09 11:22:44 +0200741 * fdt_node_offset_by_phandle() returns the offset of the node
Kumar Gala8d04f022007-10-24 11:04:22 -0500742 * which has the given phandle value. If there is more than one node
743 * in the tree with the given phandle (an invalid tree), results are
744 * undefined.
745 *
746 * returns:
747 * structure block offset of the located node (>= 0), on success
748 * -FDT_ERR_NOTFOUND, no node with that phandle exists
749 * -FDT_ERR_BADPHANDLE, given phandle value was invalid (0 or -1)
750 * -FDT_ERR_BADMAGIC,
751 * -FDT_ERR_BADVERSION,
752 * -FDT_ERR_BADSTATE,
753 * -FDT_ERR_BADSTRUCTURE, standard meanings
754 */
755int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle);
756
757/**
758 * fdt_node_check_compatible: check a node's compatible property
759 * @fdt: pointer to the device tree blob
760 * @nodeoffset: offset of a tree node
761 * @compatible: string to match against
762 *
763 *
764 * fdt_node_check_compatible() returns 0 if the given node contains a
765 * 'compatible' property with the given string as one of its elements,
766 * it returns non-zero otherwise, or on error.
767 *
768 * returns:
769 * 0, if the node has a 'compatible' property listing the given string
770 * 1, if the node has a 'compatible' property, but it does not list
771 * the given string
772 * -FDT_ERR_NOTFOUND, if the given node has no 'compatible' property
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200773 * -FDT_ERR_BADOFFSET, if nodeoffset does not refer to a BEGIN_NODE tag
Kumar Gala8d04f022007-10-24 11:04:22 -0500774 * -FDT_ERR_BADMAGIC,
775 * -FDT_ERR_BADVERSION,
776 * -FDT_ERR_BADSTATE,
777 * -FDT_ERR_BADSTRUCTURE, standard meanings
778 */
779int fdt_node_check_compatible(const void *fdt, int nodeoffset,
780 const char *compatible);
781
782/**
783 * fdt_node_offset_by_compatible - find nodes with a given 'compatible' value
784 * @fdt: pointer to the device tree blob
785 * @startoffset: only find nodes after this offset
786 * @compatible: 'compatible' string to match against
787 *
788 * fdt_node_offset_by_compatible() returns the offset of the first
789 * node after startoffset, which has a 'compatible' property which
790 * lists the given compatible string; or if startoffset is -1, the
791 * very first such node in the tree.
792 *
793 * To iterate through all nodes matching the criterion, the following
794 * idiom can be used:
795 * offset = fdt_node_offset_by_compatible(fdt, -1, compatible);
796 * while (offset != -FDT_ERR_NOTFOUND) {
Wolfgang Denk1182e9f2008-01-02 15:58:44 +0100797 * ... other code here ...
Kumar Gala8d04f022007-10-24 11:04:22 -0500798 * offset = fdt_node_offset_by_compatible(fdt, offset, compatible);
799 * }
800 *
801 * Note the -1 in the first call to the function, if 0 is used here
802 * instead, the function will never locate the root node, even if it
803 * matches the criterion.
804 *
805 * returns:
806 * structure block offset of the located node (>= 0, >startoffset),
807 * on success
808 * -FDT_ERR_NOTFOUND, no node matching the criterion exists in the
809 * tree after startoffset
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200810 * -FDT_ERR_BADOFFSET, nodeoffset does not refer to a BEGIN_NODE tag
Kumar Gala8d04f022007-10-24 11:04:22 -0500811 * -FDT_ERR_BADMAGIC,
812 * -FDT_ERR_BADVERSION,
813 * -FDT_ERR_BADSTATE,
814 * -FDT_ERR_BADSTRUCTURE, standard meanings
815 */
816int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
817 const char *compatible);
818
Simon Glasse853b322013-01-21 12:59:18 -0800819/**
820 * fdt_stringlist_contains - check a string list property for a string
821 * @strlist: Property containing a list of strings to check
822 * @listlen: Length of property
823 * @str: String to search for
824 *
825 * This is a utility function provided for convenience. The list contains
826 * one or more strings, each terminated by \0, as is found in a device tree
827 * "compatible" property.
828 *
829 * @return: 1 if the string is found in the list, 0 not found, or invalid list
830 */
831int fdt_stringlist_contains(const char *strlist, int listlen, const char *str);
832
Kumar Gala8d04f022007-10-24 11:04:22 -0500833/**********************************************************************/
834/* Write-in-place functions */
835/**********************************************************************/
836
David Gibson9d4450b2007-12-17 14:41:52 +1100837/**
838 * fdt_setprop_inplace - change a property's value, but not its size
839 * @fdt: pointer to the device tree blob
840 * @nodeoffset: offset of the node whose property to change
841 * @name: name of the property to change
842 * @val: pointer to data to replace the property value with
843 * @len: length of the property value
844 *
845 * fdt_setprop_inplace() replaces the value of a given property with
846 * the data in val, of length len. This function cannot change the
847 * size of a property, and so will only work if len is equal to the
848 * current length of the property.
849 *
850 * This function will alter only the bytes in the blob which contain
851 * the given property value, and will not alter or move any other part
852 * of the tree.
853 *
854 * returns:
855 * 0, on success
856 * -FDT_ERR_NOSPACE, if len is not equal to the property's current length
857 * -FDT_ERR_NOTFOUND, node does not have the named property
858 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
859 * -FDT_ERR_BADMAGIC,
860 * -FDT_ERR_BADVERSION,
861 * -FDT_ERR_BADSTATE,
862 * -FDT_ERR_BADSTRUCTURE,
863 * -FDT_ERR_TRUNCATED, standard meanings
864 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400865int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name,
866 const void *val, int len);
David Gibson9d4450b2007-12-17 14:41:52 +1100867
868/**
David Gibson24fa0e52012-08-27 19:39:00 -0500869 * fdt_setprop_inplace_u32 - change the value of a 32-bit integer property
David Gibson9d4450b2007-12-17 14:41:52 +1100870 * @fdt: pointer to the device tree blob
871 * @nodeoffset: offset of the node whose property to change
872 * @name: name of the property to change
David Gibson24fa0e52012-08-27 19:39:00 -0500873 * @val: 32-bit integer value to replace the property with
David Gibson9d4450b2007-12-17 14:41:52 +1100874 *
David Gibson24fa0e52012-08-27 19:39:00 -0500875 * fdt_setprop_inplace_u32() replaces the value of a given property
876 * with the 32-bit integer value in val, converting val to big-endian
877 * if necessary. This function cannot change the size of a property,
878 * and so will only work if the property already exists and has length
879 * 4.
David Gibson9d4450b2007-12-17 14:41:52 +1100880 *
881 * This function will alter only the bytes in the blob which contain
882 * the given property value, and will not alter or move any other part
883 * of the tree.
884 *
885 * returns:
886 * 0, on success
887 * -FDT_ERR_NOSPACE, if the property's length is not equal to 4
David Gibson24fa0e52012-08-27 19:39:00 -0500888 * -FDT_ERR_NOTFOUND, node does not have the named property
David Gibson9d4450b2007-12-17 14:41:52 +1100889 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
890 * -FDT_ERR_BADMAGIC,
891 * -FDT_ERR_BADVERSION,
892 * -FDT_ERR_BADSTATE,
893 * -FDT_ERR_BADSTRUCTURE,
894 * -FDT_ERR_TRUNCATED, standard meanings
895 */
David Gibson24fa0e52012-08-27 19:39:00 -0500896static inline int fdt_setprop_inplace_u32(void *fdt, int nodeoffset,
897 const char *name, uint32_t val)
Kumar Gala8d04f022007-10-24 11:04:22 -0500898{
Kim Phillipsb2ba62a2013-01-16 13:59:50 +0000899 fdt32_t tmp = cpu_to_fdt32(val);
900 return fdt_setprop_inplace(fdt, nodeoffset, name, &tmp, sizeof(tmp));
Kumar Gala8d04f022007-10-24 11:04:22 -0500901}
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400902
David Gibson9d4450b2007-12-17 14:41:52 +1100903/**
David Gibson24fa0e52012-08-27 19:39:00 -0500904 * fdt_setprop_inplace_u64 - change the value of a 64-bit integer property
905 * @fdt: pointer to the device tree blob
906 * @nodeoffset: offset of the node whose property to change
907 * @name: name of the property to change
908 * @val: 64-bit integer value to replace the property with
909 *
910 * fdt_setprop_inplace_u64() replaces the value of a given property
911 * with the 64-bit integer value in val, converting val to big-endian
912 * if necessary. This function cannot change the size of a property,
913 * and so will only work if the property already exists and has length
914 * 8.
915 *
916 * This function will alter only the bytes in the blob which contain
917 * the given property value, and will not alter or move any other part
918 * of the tree.
919 *
920 * returns:
921 * 0, on success
922 * -FDT_ERR_NOSPACE, if the property's length is not equal to 8
923 * -FDT_ERR_NOTFOUND, node does not have the named property
924 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
925 * -FDT_ERR_BADMAGIC,
926 * -FDT_ERR_BADVERSION,
927 * -FDT_ERR_BADSTATE,
928 * -FDT_ERR_BADSTRUCTURE,
929 * -FDT_ERR_TRUNCATED, standard meanings
930 */
931static inline int fdt_setprop_inplace_u64(void *fdt, int nodeoffset,
932 const char *name, uint64_t val)
933{
Kim Phillipsb2ba62a2013-01-16 13:59:50 +0000934 fdt64_t tmp = cpu_to_fdt64(val);
935 return fdt_setprop_inplace(fdt, nodeoffset, name, &tmp, sizeof(tmp));
David Gibson24fa0e52012-08-27 19:39:00 -0500936}
937
938/**
939 * fdt_setprop_inplace_cell - change the value of a single-cell property
940 *
941 * This is an alternative name for fdt_setprop_inplace_u32()
942 */
943static inline int fdt_setprop_inplace_cell(void *fdt, int nodeoffset,
944 const char *name, uint32_t val)
945{
946 return fdt_setprop_inplace_u32(fdt, nodeoffset, name, val);
947}
948
949/**
David Gibson9d4450b2007-12-17 14:41:52 +1100950 * fdt_nop_property - replace a property with nop tags
951 * @fdt: pointer to the device tree blob
952 * @nodeoffset: offset of the node whose property to nop
953 * @name: name of the property to nop
954 *
955 * fdt_nop_property() will replace a given property's representation
956 * in the blob with FDT_NOP tags, effectively removing it from the
957 * tree.
958 *
959 * This function will alter only the bytes in the blob which contain
960 * the property, and will not alter or move any other part of the
961 * tree.
962 *
963 * returns:
964 * 0, on success
965 * -FDT_ERR_NOTFOUND, node does not have the named property
966 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
967 * -FDT_ERR_BADMAGIC,
968 * -FDT_ERR_BADVERSION,
969 * -FDT_ERR_BADSTATE,
970 * -FDT_ERR_BADSTRUCTURE,
971 * -FDT_ERR_TRUNCATED, standard meanings
972 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400973int fdt_nop_property(void *fdt, int nodeoffset, const char *name);
David Gibson9d4450b2007-12-17 14:41:52 +1100974
975/**
976 * fdt_nop_node - replace a node (subtree) with nop tags
977 * @fdt: pointer to the device tree blob
978 * @nodeoffset: offset of the node to nop
979 *
980 * fdt_nop_node() will replace a given node's representation in the
981 * blob, including all its subnodes, if any, with FDT_NOP tags,
982 * effectively removing it from the tree.
983 *
984 * This function will alter only the bytes in the blob which contain
985 * the node and its properties and subnodes, and will not alter or
986 * move any other part of the tree.
987 *
988 * returns:
989 * 0, on success
990 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
991 * -FDT_ERR_BADMAGIC,
992 * -FDT_ERR_BADVERSION,
993 * -FDT_ERR_BADSTATE,
994 * -FDT_ERR_BADSTRUCTURE,
995 * -FDT_ERR_TRUNCATED, standard meanings
996 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400997int fdt_nop_node(void *fdt, int nodeoffset);
Gerald Van Baren3f9f08c2007-04-14 22:46:41 -0400998
Kumar Gala8d04f022007-10-24 11:04:22 -0500999/**********************************************************************/
1000/* Sequential write functions */
1001/**********************************************************************/
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001002
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001003int fdt_create(void *buf, int bufsize);
1004int fdt_add_reservemap_entry(void *fdt, uint64_t addr, uint64_t size);
1005int fdt_finish_reservemap(void *fdt);
1006int fdt_begin_node(void *fdt, const char *name);
1007int fdt_property(void *fdt, const char *name, const void *val, int len);
David Gibson24fa0e52012-08-27 19:39:00 -05001008static inline int fdt_property_u32(void *fdt, const char *name, uint32_t val)
Kumar Gala8d04f022007-10-24 11:04:22 -05001009{
Kim Phillipsb2ba62a2013-01-16 13:59:50 +00001010 fdt32_t tmp = cpu_to_fdt32(val);
1011 return fdt_property(fdt, name, &tmp, sizeof(tmp));
Kumar Gala8d04f022007-10-24 11:04:22 -05001012}
David Gibson24fa0e52012-08-27 19:39:00 -05001013static inline int fdt_property_u64(void *fdt, const char *name, uint64_t val)
1014{
Kim Phillipsb2ba62a2013-01-16 13:59:50 +00001015 fdt64_t tmp = cpu_to_fdt64(val);
1016 return fdt_property(fdt, name, &tmp, sizeof(tmp));
David Gibson24fa0e52012-08-27 19:39:00 -05001017}
1018static inline int fdt_property_cell(void *fdt, const char *name, uint32_t val)
1019{
1020 return fdt_property_u32(fdt, name, val);
1021}
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001022#define fdt_property_string(fdt, name, str) \
1023 fdt_property(fdt, name, str, strlen(str)+1)
1024int fdt_end_node(void *fdt);
1025int fdt_finish(void *fdt);
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001026
Kumar Gala8d04f022007-10-24 11:04:22 -05001027/**********************************************************************/
1028/* Read-write functions */
1029/**********************************************************************/
1030
Gerald Van Barenc71b64f2012-10-15 22:24:36 -04001031int fdt_create_empty_tree(void *buf, int bufsize);
Kumar Gala8d04f022007-10-24 11:04:22 -05001032int fdt_open_into(const void *fdt, void *buf, int bufsize);
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001033int fdt_pack(void *fdt);
1034
David Gibsonaec71352007-12-17 14:42:07 +11001035/**
1036 * fdt_add_mem_rsv - add one memory reserve map entry
1037 * @fdt: pointer to the device tree blob
Wolfram Sang46390da2008-07-09 11:22:44 +02001038 * @address, @size: 64-bit values (native endian)
David Gibsonaec71352007-12-17 14:42:07 +11001039 *
1040 * Adds a reserve map entry to the given blob reserving a region at
1041 * address address of length size.
1042 *
1043 * This function will insert data into the reserve map and will
Wolfram Sang46390da2008-07-09 11:22:44 +02001044 * therefore change the indexes of some entries in the table.
David Gibsonaec71352007-12-17 14:42:07 +11001045 *
1046 * returns:
1047 * 0, on success
1048 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1049 * contain the new reservation entry
1050 * -FDT_ERR_BADMAGIC,
1051 * -FDT_ERR_BADVERSION,
1052 * -FDT_ERR_BADSTATE,
1053 * -FDT_ERR_BADSTRUCTURE,
1054 * -FDT_ERR_BADLAYOUT,
1055 * -FDT_ERR_TRUNCATED, standard meanings
1056 */
Kumar Gala8d04f022007-10-24 11:04:22 -05001057int fdt_add_mem_rsv(void *fdt, uint64_t address, uint64_t size);
David Gibsonaec71352007-12-17 14:42:07 +11001058
1059/**
1060 * fdt_del_mem_rsv - remove a memory reserve map entry
1061 * @fdt: pointer to the device tree blob
1062 * @n: entry to remove
1063 *
1064 * fdt_del_mem_rsv() removes the n-th memory reserve map entry from
1065 * the blob.
1066 *
1067 * This function will delete data from the reservation table and will
Wolfram Sang46390da2008-07-09 11:22:44 +02001068 * therefore change the indexes of some entries in the table.
David Gibsonaec71352007-12-17 14:42:07 +11001069 *
1070 * returns:
1071 * 0, on success
1072 * -FDT_ERR_NOTFOUND, there is no entry of the given index (i.e. there
1073 * are less than n+1 reserve map entries)
1074 * -FDT_ERR_BADMAGIC,
1075 * -FDT_ERR_BADVERSION,
1076 * -FDT_ERR_BADSTATE,
1077 * -FDT_ERR_BADSTRUCTURE,
1078 * -FDT_ERR_BADLAYOUT,
1079 * -FDT_ERR_TRUNCATED, standard meanings
1080 */
Kumar Gala8d04f022007-10-24 11:04:22 -05001081int fdt_del_mem_rsv(void *fdt, int n);
1082
David Gibsonaec71352007-12-17 14:42:07 +11001083/**
David Gibson9eaeb072008-01-11 14:55:05 +11001084 * fdt_set_name - change the name of a given node
1085 * @fdt: pointer to the device tree blob
1086 * @nodeoffset: structure block offset of a node
1087 * @name: name to give the node
1088 *
1089 * fdt_set_name() replaces the name (including unit address, if any)
1090 * of the given node with the given string. NOTE: this function can't
1091 * efficiently check if the new name is unique amongst the given
1092 * node's siblings; results are undefined if this function is invoked
1093 * with a name equal to one of the given node's siblings.
1094 *
1095 * This function may insert or delete data from the blob, and will
1096 * therefore change the offsets of some existing nodes.
1097 *
1098 * returns:
1099 * 0, on success
1100 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob
1101 * to contain the new name
1102 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1103 * -FDT_ERR_BADMAGIC,
1104 * -FDT_ERR_BADVERSION,
1105 * -FDT_ERR_BADSTATE, standard meanings
1106 */
1107int fdt_set_name(void *fdt, int nodeoffset, const char *name);
1108
1109/**
David Gibsonaec71352007-12-17 14:42:07 +11001110 * fdt_setprop - create or change a property
1111 * @fdt: pointer to the device tree blob
1112 * @nodeoffset: offset of the node whose property to change
1113 * @name: name of the property to change
1114 * @val: pointer to data to set the property value to
1115 * @len: length of the property value
1116 *
1117 * fdt_setprop() sets the value of the named property in the given
Wolfram Sang46390da2008-07-09 11:22:44 +02001118 * node to the given value and length, creating the property if it
David Gibsonaec71352007-12-17 14:42:07 +11001119 * does not already exist.
1120 *
1121 * This function may insert or delete data from the blob, and will
1122 * therefore change the offsets of some existing nodes.
1123 *
1124 * returns:
1125 * 0, on success
1126 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1127 * contain the new property value
1128 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1129 * -FDT_ERR_BADLAYOUT,
1130 * -FDT_ERR_BADMAGIC,
1131 * -FDT_ERR_BADVERSION,
1132 * -FDT_ERR_BADSTATE,
1133 * -FDT_ERR_BADSTRUCTURE,
1134 * -FDT_ERR_BADLAYOUT,
1135 * -FDT_ERR_TRUNCATED, standard meanings
1136 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001137int fdt_setprop(void *fdt, int nodeoffset, const char *name,
1138 const void *val, int len);
David Gibsonaec71352007-12-17 14:42:07 +11001139
1140/**
David Gibson24fa0e52012-08-27 19:39:00 -05001141 * fdt_setprop_u32 - set a property to a 32-bit integer
David Gibsonaec71352007-12-17 14:42:07 +11001142 * @fdt: pointer to the device tree blob
1143 * @nodeoffset: offset of the node whose property to change
1144 * @name: name of the property to change
1145 * @val: 32-bit integer value for the property (native endian)
1146 *
David Gibson24fa0e52012-08-27 19:39:00 -05001147 * fdt_setprop_u32() sets the value of the named property in the given
1148 * node to the given 32-bit integer value (converting to big-endian if
David Gibsonaec71352007-12-17 14:42:07 +11001149 * necessary), or creates a new property with that value if it does
1150 * not already exist.
1151 *
1152 * This function may insert or delete data from the blob, and will
1153 * therefore change the offsets of some existing nodes.
1154 *
1155 * returns:
1156 * 0, on success
1157 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1158 * contain the new property value
1159 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1160 * -FDT_ERR_BADLAYOUT,
1161 * -FDT_ERR_BADMAGIC,
1162 * -FDT_ERR_BADVERSION,
1163 * -FDT_ERR_BADSTATE,
1164 * -FDT_ERR_BADSTRUCTURE,
1165 * -FDT_ERR_BADLAYOUT,
1166 * -FDT_ERR_TRUNCATED, standard meanings
1167 */
David Gibson24fa0e52012-08-27 19:39:00 -05001168static inline int fdt_setprop_u32(void *fdt, int nodeoffset, const char *name,
1169 uint32_t val)
Kumar Gala8d04f022007-10-24 11:04:22 -05001170{
Kim Phillipsb2ba62a2013-01-16 13:59:50 +00001171 fdt32_t tmp = cpu_to_fdt32(val);
1172 return fdt_setprop(fdt, nodeoffset, name, &tmp, sizeof(tmp));
Kumar Gala8d04f022007-10-24 11:04:22 -05001173}
David Gibsonaec71352007-12-17 14:42:07 +11001174
1175/**
David Gibson24fa0e52012-08-27 19:39:00 -05001176 * fdt_setprop_u64 - set a property to a 64-bit integer
1177 * @fdt: pointer to the device tree blob
1178 * @nodeoffset: offset of the node whose property to change
1179 * @name: name of the property to change
1180 * @val: 64-bit integer value for the property (native endian)
1181 *
1182 * fdt_setprop_u64() sets the value of the named property in the given
1183 * node to the given 64-bit integer value (converting to big-endian if
1184 * necessary), or creates a new property with that value if it does
1185 * not already exist.
1186 *
1187 * This function may insert or delete data from the blob, and will
1188 * therefore change the offsets of some existing nodes.
1189 *
1190 * returns:
1191 * 0, on success
1192 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1193 * contain the new property value
1194 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1195 * -FDT_ERR_BADLAYOUT,
1196 * -FDT_ERR_BADMAGIC,
1197 * -FDT_ERR_BADVERSION,
1198 * -FDT_ERR_BADSTATE,
1199 * -FDT_ERR_BADSTRUCTURE,
1200 * -FDT_ERR_BADLAYOUT,
1201 * -FDT_ERR_TRUNCATED, standard meanings
1202 */
1203static inline int fdt_setprop_u64(void *fdt, int nodeoffset, const char *name,
1204 uint64_t val)
1205{
Kim Phillipsb2ba62a2013-01-16 13:59:50 +00001206 fdt64_t tmp = cpu_to_fdt64(val);
1207 return fdt_setprop(fdt, nodeoffset, name, &tmp, sizeof(tmp));
David Gibson24fa0e52012-08-27 19:39:00 -05001208}
1209
1210/**
1211 * fdt_setprop_cell - set a property to a single cell value
1212 *
1213 * This is an alternative name for fdt_setprop_u32()
1214 */
1215static inline int fdt_setprop_cell(void *fdt, int nodeoffset, const char *name,
1216 uint32_t val)
1217{
1218 return fdt_setprop_u32(fdt, nodeoffset, name, val);
1219}
1220
1221/**
David Gibsonaec71352007-12-17 14:42:07 +11001222 * fdt_setprop_string - set a property to a string value
1223 * @fdt: pointer to the device tree blob
1224 * @nodeoffset: offset of the node whose property to change
1225 * @name: name of the property to change
1226 * @str: string value for the property
1227 *
1228 * fdt_setprop_string() sets the value of the named property in the
1229 * given node to the given string value (using the length of the
1230 * string to determine the new length of the property), or creates a
1231 * new property with that value if it does not already exist.
1232 *
1233 * This function may insert or delete data from the blob, and will
1234 * therefore change the offsets of some existing nodes.
1235 *
1236 * returns:
1237 * 0, on success
1238 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1239 * contain the new property value
1240 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1241 * -FDT_ERR_BADLAYOUT,
1242 * -FDT_ERR_BADMAGIC,
1243 * -FDT_ERR_BADVERSION,
1244 * -FDT_ERR_BADSTATE,
1245 * -FDT_ERR_BADSTRUCTURE,
1246 * -FDT_ERR_BADLAYOUT,
1247 * -FDT_ERR_TRUNCATED, standard meanings
1248 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001249#define fdt_setprop_string(fdt, nodeoffset, name, str) \
1250 fdt_setprop((fdt), (nodeoffset), (name), (str), strlen(str)+1)
David Gibsonaec71352007-12-17 14:42:07 +11001251
1252/**
Minghuan Lian36ad18a2012-08-27 19:38:59 -05001253 * fdt_appendprop - append to or create a property
1254 * @fdt: pointer to the device tree blob
1255 * @nodeoffset: offset of the node whose property to change
1256 * @name: name of the property to append to
1257 * @val: pointer to data to append to the property value
1258 * @len: length of the data to append to the property value
1259 *
1260 * fdt_appendprop() appends the value to the named property in the
1261 * given node, creating the property if it does not already exist.
1262 *
1263 * This function may insert data into the blob, and will therefore
1264 * change the offsets of some existing nodes.
1265 *
1266 * returns:
1267 * 0, on success
1268 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1269 * contain the new property value
1270 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1271 * -FDT_ERR_BADLAYOUT,
1272 * -FDT_ERR_BADMAGIC,
1273 * -FDT_ERR_BADVERSION,
1274 * -FDT_ERR_BADSTATE,
1275 * -FDT_ERR_BADSTRUCTURE,
1276 * -FDT_ERR_BADLAYOUT,
1277 * -FDT_ERR_TRUNCATED, standard meanings
1278 */
1279int fdt_appendprop(void *fdt, int nodeoffset, const char *name,
1280 const void *val, int len);
1281
1282/**
David Gibson24fa0e52012-08-27 19:39:00 -05001283 * fdt_appendprop_u32 - append a 32-bit integer value to a property
Minghuan Lian36ad18a2012-08-27 19:38:59 -05001284 * @fdt: pointer to the device tree blob
1285 * @nodeoffset: offset of the node whose property to change
1286 * @name: name of the property to change
1287 * @val: 32-bit integer value to append to the property (native endian)
1288 *
David Gibson24fa0e52012-08-27 19:39:00 -05001289 * fdt_appendprop_u32() appends the given 32-bit integer value
1290 * (converting to big-endian if necessary) to the value of the named
1291 * property in the given node, or creates a new property with that
1292 * value if it does not already exist.
Minghuan Lian36ad18a2012-08-27 19:38:59 -05001293 *
1294 * This function may insert data into the blob, and will therefore
1295 * change the offsets of some existing nodes.
1296 *
1297 * returns:
1298 * 0, on success
1299 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1300 * contain the new property value
1301 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1302 * -FDT_ERR_BADLAYOUT,
1303 * -FDT_ERR_BADMAGIC,
1304 * -FDT_ERR_BADVERSION,
1305 * -FDT_ERR_BADSTATE,
1306 * -FDT_ERR_BADSTRUCTURE,
1307 * -FDT_ERR_BADLAYOUT,
1308 * -FDT_ERR_TRUNCATED, standard meanings
1309 */
David Gibson24fa0e52012-08-27 19:39:00 -05001310static inline int fdt_appendprop_u32(void *fdt, int nodeoffset,
1311 const char *name, uint32_t val)
Minghuan Lian36ad18a2012-08-27 19:38:59 -05001312{
Kim Phillipsb2ba62a2013-01-16 13:59:50 +00001313 fdt32_t tmp = cpu_to_fdt32(val);
1314 return fdt_appendprop(fdt, nodeoffset, name, &tmp, sizeof(tmp));
Minghuan Lian36ad18a2012-08-27 19:38:59 -05001315}
1316
1317/**
David Gibson24fa0e52012-08-27 19:39:00 -05001318 * fdt_appendprop_u64 - append a 64-bit integer value to a property
1319 * @fdt: pointer to the device tree blob
1320 * @nodeoffset: offset of the node whose property to change
1321 * @name: name of the property to change
1322 * @val: 64-bit integer value to append to the property (native endian)
1323 *
1324 * fdt_appendprop_u64() appends the given 64-bit integer value
1325 * (converting to big-endian if necessary) to the value of the named
1326 * property in the given node, or creates a new property with that
1327 * value if it does not already exist.
1328 *
1329 * This function may insert data into the blob, and will therefore
1330 * change the offsets of some existing nodes.
1331 *
1332 * returns:
1333 * 0, on success
1334 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1335 * contain the new property value
1336 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1337 * -FDT_ERR_BADLAYOUT,
1338 * -FDT_ERR_BADMAGIC,
1339 * -FDT_ERR_BADVERSION,
1340 * -FDT_ERR_BADSTATE,
1341 * -FDT_ERR_BADSTRUCTURE,
1342 * -FDT_ERR_BADLAYOUT,
1343 * -FDT_ERR_TRUNCATED, standard meanings
1344 */
1345static inline int fdt_appendprop_u64(void *fdt, int nodeoffset,
1346 const char *name, uint64_t val)
1347{
Kim Phillipsb2ba62a2013-01-16 13:59:50 +00001348 fdt64_t tmp = cpu_to_fdt64(val);
1349 return fdt_appendprop(fdt, nodeoffset, name, &tmp, sizeof(tmp));
David Gibson24fa0e52012-08-27 19:39:00 -05001350}
1351
1352/**
1353 * fdt_appendprop_cell - append a single cell value to a property
1354 *
1355 * This is an alternative name for fdt_appendprop_u32()
1356 */
1357static inline int fdt_appendprop_cell(void *fdt, int nodeoffset,
1358 const char *name, uint32_t val)
1359{
1360 return fdt_appendprop_u32(fdt, nodeoffset, name, val);
1361}
1362
1363/**
Minghuan Lian36ad18a2012-08-27 19:38:59 -05001364 * fdt_appendprop_string - append a string to a property
1365 * @fdt: pointer to the device tree blob
1366 * @nodeoffset: offset of the node whose property to change
1367 * @name: name of the property to change
1368 * @str: string value to append to the property
1369 *
1370 * fdt_appendprop_string() appends the given string to the value of
1371 * the named property in the given node, or creates a new property
1372 * with that value if it does not already exist.
1373 *
1374 * This function may insert data into the blob, and will therefore
1375 * change the offsets of some existing nodes.
1376 *
1377 * returns:
1378 * 0, on success
1379 * -FDT_ERR_NOSPACE, there is insufficient free space in the blob to
1380 * contain the new property value
1381 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1382 * -FDT_ERR_BADLAYOUT,
1383 * -FDT_ERR_BADMAGIC,
1384 * -FDT_ERR_BADVERSION,
1385 * -FDT_ERR_BADSTATE,
1386 * -FDT_ERR_BADSTRUCTURE,
1387 * -FDT_ERR_BADLAYOUT,
1388 * -FDT_ERR_TRUNCATED, standard meanings
1389 */
1390#define fdt_appendprop_string(fdt, nodeoffset, name, str) \
1391 fdt_appendprop((fdt), (nodeoffset), (name), (str), strlen(str)+1)
1392
1393/**
David Gibsonaec71352007-12-17 14:42:07 +11001394 * fdt_delprop - delete a property
1395 * @fdt: pointer to the device tree blob
1396 * @nodeoffset: offset of the node whose property to nop
1397 * @name: name of the property to nop
1398 *
1399 * fdt_del_property() will delete the given property.
1400 *
1401 * This function will delete data from the blob, and will therefore
1402 * change the offsets of some existing nodes.
1403 *
1404 * returns:
1405 * 0, on success
1406 * -FDT_ERR_NOTFOUND, node does not have the named property
1407 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1408 * -FDT_ERR_BADLAYOUT,
1409 * -FDT_ERR_BADMAGIC,
1410 * -FDT_ERR_BADVERSION,
1411 * -FDT_ERR_BADSTATE,
1412 * -FDT_ERR_BADSTRUCTURE,
1413 * -FDT_ERR_TRUNCATED, standard meanings
1414 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001415int fdt_delprop(void *fdt, int nodeoffset, const char *name);
David Gibsonaec71352007-12-17 14:42:07 +11001416
1417/**
1418 * fdt_add_subnode_namelen - creates a new node based on substring
1419 * @fdt: pointer to the device tree blob
1420 * @parentoffset: structure block offset of a node
1421 * @name: name of the subnode to locate
1422 * @namelen: number of characters of name to consider
1423 *
1424 * Identical to fdt_add_subnode(), but use only the first namelen
1425 * characters of name as the name of the new node. This is useful for
1426 * creating subnodes based on a portion of a larger string, such as a
1427 * full path.
1428 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001429int fdt_add_subnode_namelen(void *fdt, int parentoffset,
1430 const char *name, int namelen);
David Gibsonaec71352007-12-17 14:42:07 +11001431
1432/**
1433 * fdt_add_subnode - creates a new node
1434 * @fdt: pointer to the device tree blob
1435 * @parentoffset: structure block offset of a node
1436 * @name: name of the subnode to locate
1437 *
1438 * fdt_add_subnode() creates a new node as a subnode of the node at
1439 * structure block offset parentoffset, with the given name (which
1440 * should include the unit address, if any).
1441 *
1442 * This function will insert data into the blob, and will therefore
1443 * change the offsets of some existing nodes.
1444
1445 * returns:
1446 * structure block offset of the created nodeequested subnode (>=0), on success
1447 * -FDT_ERR_NOTFOUND, if the requested subnode does not exist
1448 * -FDT_ERR_BADOFFSET, if parentoffset did not point to an FDT_BEGIN_NODE tag
1449 * -FDT_ERR_EXISTS, if the node at parentoffset already has a subnode of
1450 * the given name
1451 * -FDT_ERR_NOSPACE, if there is insufficient free space in the
1452 * blob to contain the new node
1453 * -FDT_ERR_NOSPACE
1454 * -FDT_ERR_BADLAYOUT
1455 * -FDT_ERR_BADMAGIC,
1456 * -FDT_ERR_BADVERSION,
1457 * -FDT_ERR_BADSTATE,
1458 * -FDT_ERR_BADSTRUCTURE,
1459 * -FDT_ERR_TRUNCATED, standard meanings.
1460 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001461int fdt_add_subnode(void *fdt, int parentoffset, const char *name);
David Gibsonaec71352007-12-17 14:42:07 +11001462
1463/**
1464 * fdt_del_node - delete a node (subtree)
1465 * @fdt: pointer to the device tree blob
1466 * @nodeoffset: offset of the node to nop
1467 *
1468 * fdt_del_node() will remove the given node, including all its
1469 * subnodes if any, from the blob.
1470 *
1471 * This function will delete data from the blob, and will therefore
1472 * change the offsets of some existing nodes.
1473 *
1474 * returns:
1475 * 0, on success
1476 * -FDT_ERR_BADOFFSET, nodeoffset did not point to FDT_BEGIN_NODE tag
1477 * -FDT_ERR_BADLAYOUT,
1478 * -FDT_ERR_BADMAGIC,
1479 * -FDT_ERR_BADVERSION,
1480 * -FDT_ERR_BADSTATE,
1481 * -FDT_ERR_BADSTRUCTURE,
1482 * -FDT_ERR_TRUNCATED, standard meanings
1483 */
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001484int fdt_del_node(void *fdt, int nodeoffset);
1485
Kumar Gala8d04f022007-10-24 11:04:22 -05001486/**********************************************************************/
1487/* Debugging / informational functions */
1488/**********************************************************************/
1489
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001490const char *fdt_strerror(int errval);
1491
1492#endif /* _LIBFDT_H */