mirror of
				https://xff.cz/git/u-boot/
				synced 2025-10-31 10:26:10 +01:00 
			
		
		
		
	For ages, we've been talking about adding functions to libfdt to allow iteration through properties. So, finally, here are some. I got bogged down on this for a long time because I didn't want to expose offsets directly to properties to the callers. But without that, attempting to make reasonable iteration functions just became horrible. So eventually, I settled on an interface which does now expose property offsets. fdt_first_property_offset() and fdt_next_property_offset() are used to step through the offsets of the properties starting from a particularly node offset. The details of the property at each offset can then be retrieved with either fdt_get_property_by_offset() or fdt_getprop_by_offset() which have interfaces similar to fdt_get_property() and fdt_getprop() respectively. No explicit testcases are included, but we do use the new functions to reimplement the existing fdt_get_property() function. Signed-off-by: David Gibson <david@gibson.dropbear.id.au> This was extracted from the DTC commit: 73dca9ae0b9abe6924ba640164ecce9f8df69c5a Mon Sep 17 00:00:00 2001 Signed-off-by: Gerald Van Baren <vanbaren@cideas.com>
		
			
				
	
	
		
			96 lines
		
	
	
		
			3.6 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			96 lines
		
	
	
		
			3.6 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| #ifndef _LIBFDT_INTERNAL_H
 | |
| #define _LIBFDT_INTERNAL_H
 | |
| /*
 | |
|  * libfdt - Flat Device Tree manipulation
 | |
|  * Copyright (C) 2006 David Gibson, IBM Corporation.
 | |
|  *
 | |
|  * libfdt is dual licensed: you can use it either under the terms of
 | |
|  * the GPL, or the BSD license, at your option.
 | |
|  *
 | |
|  *  a) This library is free software; you can redistribute it and/or
 | |
|  *     modify it under the terms of the GNU General Public License as
 | |
|  *     published by the Free Software Foundation; either version 2 of the
 | |
|  *     License, or (at your option) any later version.
 | |
|  *
 | |
|  *     This library is distributed in the hope that it will be useful,
 | |
|  *     but WITHOUT ANY WARRANTY; without even the implied warranty of
 | |
|  *     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | |
|  *     GNU General Public License for more details.
 | |
|  *
 | |
|  *     You should have received a copy of the GNU General Public
 | |
|  *     License along with this library; if not, write to the Free
 | |
|  *     Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
 | |
|  *     MA 02110-1301 USA
 | |
|  *
 | |
|  * Alternatively,
 | |
|  *
 | |
|  *  b) Redistribution and use in source and binary forms, with or
 | |
|  *     without modification, are permitted provided that the following
 | |
|  *     conditions are met:
 | |
|  *
 | |
|  *     1. Redistributions of source code must retain the above
 | |
|  *        copyright notice, this list of conditions and the following
 | |
|  *        disclaimer.
 | |
|  *     2. Redistributions in binary form must reproduce the above
 | |
|  *        copyright notice, this list of conditions and the following
 | |
|  *        disclaimer in the documentation and/or other materials
 | |
|  *        provided with the distribution.
 | |
|  *
 | |
|  *     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
 | |
|  *     CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
 | |
|  *     INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
 | |
|  *     MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 | |
|  *     DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
 | |
|  *     CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 | |
|  *     SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 | |
|  *     NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 | |
|  *     LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 | |
|  *     HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 | |
|  *     CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
 | |
|  *     OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
 | |
|  *     EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 | |
|  */
 | |
| #include <fdt.h>
 | |
| 
 | |
| #define FDT_ALIGN(x, a)		(((x) + (a) - 1) & ~((a) - 1))
 | |
| #define FDT_TAGALIGN(x)		(FDT_ALIGN((x), FDT_TAGSIZE))
 | |
| 
 | |
| #define FDT_CHECK_HEADER(fdt) \
 | |
| 	{ \
 | |
| 		int err; \
 | |
| 		if ((err = fdt_check_header(fdt)) != 0) \
 | |
| 			return err; \
 | |
| 	}
 | |
| 
 | |
| int _fdt_check_node_offset(const void *fdt, int offset);
 | |
| int _fdt_check_prop_offset(const void *fdt, int offset);
 | |
| const char *_fdt_find_string(const char *strtab, int tabsize, const char *s);
 | |
| int _fdt_node_end_offset(void *fdt, int nodeoffset);
 | |
| 
 | |
| static inline const void *_fdt_offset_ptr(const void *fdt, int offset)
 | |
| {
 | |
| 	return (const char *)fdt + fdt_off_dt_struct(fdt) + offset;
 | |
| }
 | |
| 
 | |
| static inline void *_fdt_offset_ptr_w(void *fdt, int offset)
 | |
| {
 | |
| 	return (void *)(uintptr_t)_fdt_offset_ptr(fdt, offset);
 | |
| }
 | |
| 
 | |
| static inline const struct fdt_reserve_entry *_fdt_mem_rsv(const void *fdt, int n)
 | |
| {
 | |
| 	const struct fdt_reserve_entry *rsv_table =
 | |
| 		(const struct fdt_reserve_entry *)
 | |
| 		((const char *)fdt + fdt_off_mem_rsvmap(fdt));
 | |
| 
 | |
| 	return rsv_table + n;
 | |
| }
 | |
| static inline struct fdt_reserve_entry *_fdt_mem_rsv_w(void *fdt, int n)
 | |
| {
 | |
| 	return (void *)(uintptr_t)_fdt_mem_rsv(fdt, n);
 | |
| }
 | |
| 
 | |
| #define FDT_SW_MAGIC		(~FDT_MAGIC)
 | |
| 
 | |
| #endif /* _LIBFDT_INTERNAL_H */
 |