2 * libfdt - Flat Device Tree manipulation
3 * Copyright (C) 2006 David Gibson, IBM Corporation.
5 * libfdt is dual licensed: you can use it either under the terms of
6 * the GPL, or the BSD license, at your option.
8 * a) This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License as
10 * published by the Free Software Foundation; either version 2 of the
11 * License, or (at your option) any later version.
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public
19 * License along with this library; if not, write to the Free
20 * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
25 * b) Redistribution and use in source and binary forms, with or
26 * without modification, are permitted provided that the following
29 * 1. Redistributions of source code must retain the above
30 * copyright notice, this list of conditions and the following
32 * 2. Redistributions in binary form must reproduce the above
33 * copyright notice, this list of conditions and the following
34 * disclaimer in the documentation and/or other materials
35 * provided with the distribution.
37 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
38 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
39 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
40 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
41 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
42 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
43 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
44 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
45 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
46 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
47 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
48 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
49 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
51 #include "libfdt_env.h"
60 #include "libfdt_internal.h"
62 int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name,
63 const void *val, int len)
68 propval = fdt_getprop_w(fdt, nodeoffset, name, &proplen);
73 return -FDT_ERR_NOSPACE;
75 memcpy(propval, val, len);
79 static void _fdt_nop_region(void *start, int len)
83 for (p = start; (char *)p < ((char *)start + len); p++)
84 *p = cpu_to_fdt32(FDT_NOP);
87 int fdt_nop_property(void *fdt, int nodeoffset, const char *name)
89 struct fdt_property *prop;
92 prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
96 _fdt_nop_region(prop, len + sizeof(*prop));
101 int _fdt_node_end_offset(void *fdt, int offset)
105 while ((offset >= 0) && (depth >= 0))
106 offset = fdt_next_node(fdt, offset, &depth);
111 int fdt_nop_node(void *fdt, int nodeoffset)
115 endoffset = _fdt_node_end_offset(fdt, nodeoffset);
119 _fdt_nop_region(fdt_offset_ptr_w(fdt, nodeoffset, 0),
120 endoffset - nodeoffset);
124 #define FDT_MAX_DEPTH 32
126 static int str_in_list(const char *str, char * const list[], int count)
130 for (i = 0; i < count; i++)
131 if (!strcmp(list[i], str))
137 int fdt_find_regions(const void *fdt, char * const inc[], int inc_count,
138 char * const exc_prop[], int exc_prop_count,
139 struct fdt_region region[], int max_regions,
140 char *path, int path_len, int add_string_tab)
142 int stack[FDT_MAX_DEPTH];
150 int base = fdt_off_dt_struct(fdt);
155 const struct fdt_property *prop;
164 tag = fdt_next_tag(fdt, offset, &nextoffset);
165 stop_at = nextoffset;
171 prop = fdt_get_property_by_offset(fdt, offset, NULL);
172 str = fdt_string(fdt, fdt32_to_cpu(prop->nameoff));
173 if (str_in_list(str, exc_prop, exc_prop_count))
184 if (depth == FDT_MAX_DEPTH)
185 return -FDT_ERR_BADSTRUCTURE;
186 name = fdt_get_name(fdt, offset, &len);
187 if (end - path + 2 + len >= path_len)
188 return -FDT_ERR_NOSPACE;
196 if (str_in_list(path, inc, inc_count))
207 want = stack[depth--];
208 while (end > path && *--end != '/')
218 if (include && start == -1) {
219 /* Should we merge with previous? */
220 if (count && count <= max_regions &&
221 offset == region[count - 1].offset +
222 region[count - 1].size - base)
223 start = region[--count].offset - base;
228 if (!include && start != -1) {
229 if (count < max_regions) {
230 region[count].offset = base + start;
231 region[count].size = stop_at - start;
236 } while (tag != FDT_END);
238 if (nextoffset != fdt_size_dt_struct(fdt))
239 return -FDT_ERR_BADLAYOUT;
241 /* Add a region for the END tag and the string table */
242 if (count < max_regions) {
243 region[count].offset = base + start;
244 region[count].size = nextoffset - start;
246 region[count].size += fdt_size_dt_strings(fdt);