1 /* 2 * libfdt - Flat Device Tree manipulation 3 * Copyright (C) 2006 David Gibson, IBM Corporation. 4 * 5 * libfdt is dual licensed: you can use it either under the terms of 6 * the GPL, or the BSD license, at your option. 7 * 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. 12 * 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. 17 * 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, 21 * MA 02110-1301 USA 22 * 23 * Alternatively, 24 * 25 * b) Redistribution and use in source and binary forms, with or 26 * without modification, are permitted provided that the following 27 * conditions are met: 28 * 29 * 1. Redistributions of source code must retain the above 30 * copyright notice, this list of conditions and the following 31 * disclaimer. 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. 36 * 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. 50 */ 51 #include "libfdt_env.h" 52 53 #ifndef USE_HOSTCC 54 #include <fdt.h> 55 #include <libfdt.h> 56 #else 57 #include "fdt_host.h" 58 #endif 59 60 #include "libfdt_internal.h" 61 62 int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name, 63 const void *val, int len) 64 { 65 void *propval; 66 int proplen; 67 68 propval = fdt_getprop_w(fdt, nodeoffset, name, &proplen); 69 if (! propval) 70 return proplen; 71 72 if (proplen != len) 73 return -FDT_ERR_NOSPACE; 74 75 memcpy(propval, val, len); 76 return 0; 77 } 78 79 static void _fdt_nop_region(void *start, int len) 80 { 81 fdt32_t *p; 82 83 for (p = start; (char *)p < ((char *)start + len); p++) 84 *p = cpu_to_fdt32(FDT_NOP); 85 } 86 87 int fdt_nop_property(void *fdt, int nodeoffset, const char *name) 88 { 89 struct fdt_property *prop; 90 int len; 91 92 prop = fdt_get_property_w(fdt, nodeoffset, name, &len); 93 if (! prop) 94 return len; 95 96 _fdt_nop_region(prop, len + sizeof(*prop)); 97 98 return 0; 99 } 100 101 int _fdt_node_end_offset(void *fdt, int offset) 102 { 103 int depth = 0; 104 105 while ((offset >= 0) && (depth >= 0)) 106 offset = fdt_next_node(fdt, offset, &depth); 107 108 return offset; 109 } 110 111 int fdt_nop_node(void *fdt, int nodeoffset) 112 { 113 int endoffset; 114 115 endoffset = _fdt_node_end_offset(fdt, nodeoffset); 116 if (endoffset < 0) 117 return endoffset; 118 119 _fdt_nop_region(fdt_offset_ptr_w(fdt, nodeoffset, 0), 120 endoffset - nodeoffset); 121 return 0; 122 } 123 124 #define FDT_MAX_DEPTH 32 125 126 static int str_in_list(const char *str, char * const list[], int count) 127 { 128 int i; 129 130 for (i = 0; i < count; i++) 131 if (!strcmp(list[i], str)) 132 return 1; 133 134 return 0; 135 } 136 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) 141 { 142 int stack[FDT_MAX_DEPTH]; 143 char *end; 144 int nextoffset = 0; 145 uint32_t tag; 146 int count = 0; 147 int start = -1; 148 int depth = -1; 149 int want = 0; 150 int base = fdt_off_dt_struct(fdt); 151 152 end = path; 153 *end = '\0'; 154 do { 155 const struct fdt_property *prop; 156 const char *name; 157 const char *str; 158 int include = 0; 159 int stop_at = 0; 160 int offset; 161 int len; 162 163 offset = nextoffset; 164 tag = fdt_next_tag(fdt, offset, &nextoffset); 165 stop_at = nextoffset; 166 167 switch (tag) { 168 case FDT_PROP: 169 include = want >= 2; 170 stop_at = offset; 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)) 174 include = 0; 175 break; 176 177 case FDT_NOP: 178 include = want >= 2; 179 stop_at = offset; 180 break; 181 182 case FDT_BEGIN_NODE: 183 depth++; 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; 189 if (end != path + 1) 190 *end++ = '/'; 191 strcpy(end, name); 192 end += len; 193 stack[depth] = want; 194 if (want == 1) 195 stop_at = offset; 196 if (str_in_list(path, inc, inc_count)) 197 want = 2; 198 else if (want) 199 want--; 200 else 201 stop_at = offset; 202 include = want; 203 break; 204 205 case FDT_END_NODE: 206 include = want; 207 want = stack[depth--]; 208 while (end > path && *--end != '/') 209 ; 210 *end = '\0'; 211 break; 212 213 case FDT_END: 214 include = 1; 215 break; 216 } 217 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; 224 else 225 start = offset; 226 } 227 228 if (!include && start != -1) { 229 if (count < max_regions) { 230 region[count].offset = base + start; 231 region[count].size = stop_at - start; 232 } 233 count++; 234 start = -1; 235 } 236 } while (tag != FDT_END); 237 238 if (nextoffset != fdt_size_dt_struct(fdt)) 239 return -FDT_ERR_BADLAYOUT; 240 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; 245 if (add_string_tab) 246 region[count].size += fdt_size_dt_strings(fdt); 247 } 248 count++; 249 250 return count; 251 } 252