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#include <fdt.h> 54#include <libfdt.h> 55 56#include "libfdt_internal.h" 57 58static int _fdt_blocks_misordered(const void *fdt, 59 int mem_rsv_size, int struct_size) 60{ 61 return (fdt_off_mem_rsvmap(fdt) < FDT_ALIGN(sizeof(struct fdt_header), 8)) 62 || (fdt_off_dt_struct(fdt) < 63 (fdt_off_mem_rsvmap(fdt) + mem_rsv_size)) 64 || (fdt_off_dt_strings(fdt) < 65 (fdt_off_dt_struct(fdt) + struct_size)) 66 || (fdt_totalsize(fdt) < 67 (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt))); 68} 69 70static int _fdt_rw_check_header(void *fdt) 71{ 72 FDT_CHECK_HEADER(fdt); 73 74 if (fdt_version(fdt) < 17) 75 return -FDT_ERR_BADVERSION; 76 if (_fdt_blocks_misordered(fdt, sizeof(struct fdt_reserve_entry), 77 fdt_size_dt_struct(fdt))) 78 return -FDT_ERR_BADLAYOUT; 79 if (fdt_version(fdt) > 17) 80 fdt_set_version(fdt, 17); 81 82 return 0; 83} 84 85#define FDT_RW_CHECK_HEADER(fdt) \ 86 { \ 87 int __err; \ 88 if ((__err = _fdt_rw_check_header(fdt)) != 0) \ 89 return __err; \ 90 } 91 92static inline int _fdt_data_size(void *fdt) 93{ 94 return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt); 95} 96 97static int _fdt_splice(void *fdt, void *splicepoint, int oldlen, int newlen) 98{ 99 char *p = splicepoint; 100 char *end = (char *)fdt + _fdt_data_size(fdt); 101 102 if (((p + oldlen) < p) || ((p + oldlen) > end)) 103 return -FDT_ERR_BADOFFSET; 104 if ((p < (char *)fdt) || ((end - oldlen + newlen) < (char *)fdt)) 105 return -FDT_ERR_BADOFFSET; 106 if ((end - oldlen + newlen) > ((char *)fdt + fdt_totalsize(fdt))) 107 return -FDT_ERR_NOSPACE; 108 memmove(p + newlen, p + oldlen, end - p - oldlen); 109 return 0; 110} 111 112static int _fdt_splice_mem_rsv(void *fdt, struct fdt_reserve_entry *p, 113 int oldn, int newn) 114{ 115 int delta = (newn - oldn) * sizeof(*p); 116 int err; 117 err = _fdt_splice(fdt, p, oldn * sizeof(*p), newn * sizeof(*p)); 118 if (err) 119 return err; 120 fdt_set_off_dt_struct(fdt, fdt_off_dt_struct(fdt) + delta); 121 fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta); 122 return 0; 123} 124 125static int _fdt_splice_struct(void *fdt, void *p, 126 int oldlen, int newlen) 127{ 128 int delta = newlen - oldlen; 129 int err; 130 131 if ((err = _fdt_splice(fdt, p, oldlen, newlen))) 132 return err; 133 134 fdt_set_size_dt_struct(fdt, fdt_size_dt_struct(fdt) + delta); 135 fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta); 136 return 0; 137} 138 139static int _fdt_splice_string(void *fdt, int newlen) 140{ 141 void *p = (char *)fdt 142 + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt); 143 int err; 144 145 if ((err = _fdt_splice(fdt, p, 0, newlen))) 146 return err; 147 148 fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen); 149 return 0; 150} 151 152static int _fdt_find_add_string(void *fdt, const char *s) 153{ 154 char *strtab = (char *)fdt + fdt_off_dt_strings(fdt); 155 const char *p; 156 char *new; 157 int len = strlen(s) + 1; 158 int err; 159 160 p = _fdt_find_string(strtab, fdt_size_dt_strings(fdt), s); 161 if (p) 162 /* found it */ 163 return (p - strtab); 164 165 new = strtab + fdt_size_dt_strings(fdt); 166 err = _fdt_splice_string(fdt, len); 167 if (err) 168 return err; 169 170 memcpy(new, s, len); 171 return (new - strtab); 172} 173 174int fdt_add_mem_rsv(void *fdt, uint64_t address, uint64_t size) 175{ 176 struct fdt_reserve_entry *re; 177 int err; 178 179 FDT_RW_CHECK_HEADER(fdt); 180 181 re = _fdt_mem_rsv_w(fdt, fdt_num_mem_rsv(fdt)); 182 err = _fdt_splice_mem_rsv(fdt, re, 0, 1); 183 if (err) 184 return err; 185 186 re->address = cpu_to_fdt64(address); 187 re->size = cpu_to_fdt64(size); 188 return 0; 189} 190 191int fdt_del_mem_rsv(void *fdt, int n) 192{ 193 struct fdt_reserve_entry *re = _fdt_mem_rsv_w(fdt, n); 194 195 FDT_RW_CHECK_HEADER(fdt); 196 197 if (n >= fdt_num_mem_rsv(fdt)) 198 return -FDT_ERR_NOTFOUND; 199 200 return _fdt_splice_mem_rsv(fdt, re, 1, 0); 201} 202 203static int _fdt_resize_property(void *fdt, int nodeoffset, const char *name, 204 int len, struct fdt_property **prop) 205{ 206 int oldlen; 207 int err; 208 209 *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen); 210 if (! (*prop)) 211 return oldlen; 212 213 if ((err = _fdt_splice_struct(fdt, (*prop)->data, FDT_TAGALIGN(oldlen), 214 FDT_TAGALIGN(len)))) 215 return err; 216 217 (*prop)->len = cpu_to_fdt32(len); 218 return 0; 219} 220 221static int _fdt_add_property(void *fdt, int nodeoffset, const char *name, 222 int len, struct fdt_property **prop) 223{ 224 int proplen; 225 int nextoffset; 226 int namestroff; 227 int err; 228 229 if ((nextoffset = _fdt_check_node_offset(fdt, nodeoffset)) < 0) 230 return nextoffset; 231 232 namestroff = _fdt_find_add_string(fdt, name); 233 if (namestroff < 0) 234 return namestroff; 235 236 *prop = _fdt_offset_ptr_w(fdt, nextoffset); 237 proplen = sizeof(**prop) + FDT_TAGALIGN(len); 238 239 err = _fdt_splice_struct(fdt, *prop, 0, proplen); 240 if (err) 241 return err; 242 243 (*prop)->tag = cpu_to_fdt32(FDT_PROP); 244 (*prop)->nameoff = cpu_to_fdt32(namestroff); 245 (*prop)->len = cpu_to_fdt32(len); 246 return 0; 247} 248 249int fdt_set_name(void *fdt, int nodeoffset, const char *name) 250{ 251 char *namep; 252 int oldlen, newlen; 253 int err; 254 255 FDT_RW_CHECK_HEADER(fdt); 256 257 namep = (char *)(uintptr_t)fdt_get_name(fdt, nodeoffset, &oldlen); 258 if (!namep) 259 return oldlen; 260 261 newlen = strlen(name); 262 263 err = _fdt_splice_struct(fdt, namep, FDT_TAGALIGN(oldlen+1), 264 FDT_TAGALIGN(newlen+1)); 265 if (err) 266 return err; 267 268 memcpy(namep, name, newlen+1); 269 return 0; 270} 271 272int fdt_setprop(void *fdt, int nodeoffset, const char *name, 273 const void *val, int len) 274{ 275 struct fdt_property *prop; 276 int err; 277 278 FDT_RW_CHECK_HEADER(fdt); 279 280 err = _fdt_resize_property(fdt, nodeoffset, name, len, &prop); 281 if (err == -FDT_ERR_NOTFOUND) 282 err = _fdt_add_property(fdt, nodeoffset, name, len, &prop); 283 if (err) 284 return err; 285 286 memcpy(prop->data, val, len); 287 return 0; 288} 289 290int fdt_appendprop(void *fdt, int nodeoffset, const char *name, 291 const void *val, int len) 292{ 293 struct fdt_property *prop; 294 int err, oldlen, newlen; 295 296 FDT_RW_CHECK_HEADER(fdt); 297 298 prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen); 299 if (prop) { 300 newlen = len + oldlen; 301 err = _fdt_splice_struct(fdt, prop->data, 302 FDT_TAGALIGN(oldlen), 303 FDT_TAGALIGN(newlen)); 304 if (err) 305 return err; 306 prop->len = cpu_to_fdt32(newlen); 307 memcpy(prop->data + oldlen, val, len); 308 } else { 309 err = _fdt_add_property(fdt, nodeoffset, name, len, &prop); 310 if (err) 311 return err; 312 memcpy(prop->data, val, len); 313 } 314 return 0; 315} 316 317int fdt_delprop(void *fdt, int nodeoffset, const char *name) 318{ 319 struct fdt_property *prop; 320 int len, proplen; 321 322 FDT_RW_CHECK_HEADER(fdt); 323 324 prop = fdt_get_property_w(fdt, nodeoffset, name, &len); 325 if (! prop) 326 return len; 327 328 proplen = sizeof(*prop) + FDT_TAGALIGN(len); 329 return _fdt_splice_struct(fdt, prop, proplen, 0); 330} 331 332int fdt_add_subnode_namelen(void *fdt, int parentoffset, 333 const char *name, int namelen) 334{ 335 struct fdt_node_header *nh; 336 int offset, nextoffset; 337 int nodelen; 338 int err; 339 uint32_t tag; 340 fdt32_t *endtag; 341 342 FDT_RW_CHECK_HEADER(fdt); 343 344 offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen); 345 if (offset >= 0) 346 return -FDT_ERR_EXISTS; 347 else if (offset != -FDT_ERR_NOTFOUND) 348 return offset; 349 350 /* Try to place the new node after the parent's properties */ 351 fdt_next_tag(fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */ 352 do { 353 offset = nextoffset; 354 tag = fdt_next_tag(fdt, offset, &nextoffset); 355 } while ((tag == FDT_PROP) || (tag == FDT_NOP)); 356 357 nh = _fdt_offset_ptr_w(fdt, offset); 358 nodelen = sizeof(*nh) + FDT_TAGALIGN(namelen+1) + FDT_TAGSIZE; 359 360 err = _fdt_splice_struct(fdt, nh, 0, nodelen); 361 if (err) 362 return err; 363 364 nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE); 365 memset(nh->name, 0, FDT_TAGALIGN(namelen+1)); 366 memcpy(nh->name, name, namelen); 367 endtag = (fdt32_t *)((char *)nh + nodelen - FDT_TAGSIZE); 368 *endtag = cpu_to_fdt32(FDT_END_NODE); 369 370 return offset; 371} 372 373int fdt_add_subnode(void *fdt, int parentoffset, const char *name) 374{ 375 return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name)); 376} 377 378int fdt_del_node(void *fdt, int nodeoffset) 379{ 380 int endoffset; 381 382 FDT_RW_CHECK_HEADER(fdt); 383 384 endoffset = _fdt_node_end_offset(fdt, nodeoffset); 385 if (endoffset < 0) 386 return endoffset; 387 388 return _fdt_splice_struct(fdt, _fdt_offset_ptr_w(fdt, nodeoffset), 389 endoffset - nodeoffset, 0); 390} 391 392static void _fdt_packblocks(const char *old, char *new, 393 int mem_rsv_size, int struct_size) 394{ 395 int mem_rsv_off, struct_off, strings_off; 396 397 mem_rsv_off = FDT_ALIGN(sizeof(struct fdt_header), 8); 398 struct_off = mem_rsv_off + mem_rsv_size; 399 strings_off = struct_off + struct_size; 400 401 memmove(new + mem_rsv_off, old + fdt_off_mem_rsvmap(old), mem_rsv_size); 402 fdt_set_off_mem_rsvmap(new, mem_rsv_off); 403 404 memmove(new + struct_off, old + fdt_off_dt_struct(old), struct_size); 405 fdt_set_off_dt_struct(new, struct_off); 406 fdt_set_size_dt_struct(new, struct_size); 407 408 memmove(new + strings_off, old + fdt_off_dt_strings(old), 409 fdt_size_dt_strings(old)); 410 fdt_set_off_dt_strings(new, strings_off); 411 fdt_set_size_dt_strings(new, fdt_size_dt_strings(old)); 412} 413 414int fdt_open_into(const void *fdt, void *buf, int bufsize) 415{ 416 int err; 417 int mem_rsv_size, struct_size; 418 int newsize; 419 const char *fdtstart = fdt; 420 const char *fdtend = fdtstart + fdt_totalsize(fdt); 421 char *tmp; 422 423 FDT_CHECK_HEADER(fdt); 424 425 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1) 426 * sizeof(struct fdt_reserve_entry); 427 428 if (fdt_version(fdt) >= 17) { 429 struct_size = fdt_size_dt_struct(fdt); 430 } else { 431 struct_size = 0; 432 while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END) 433 ; 434 if (struct_size < 0) 435 return struct_size; 436 } 437 438 if (!_fdt_blocks_misordered(fdt, mem_rsv_size, struct_size)) { 439 /* no further work necessary */ 440 err = fdt_move(fdt, buf, bufsize); 441 if (err) 442 return err; 443 fdt_set_version(buf, 17); 444 fdt_set_size_dt_struct(buf, struct_size); 445 fdt_set_totalsize(buf, bufsize); 446 return 0; 447 } 448 449 /* Need to reorder */ 450 newsize = FDT_ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size 451 + struct_size + fdt_size_dt_strings(fdt); 452 453 if (bufsize < newsize) 454 return -FDT_ERR_NOSPACE; 455 456 /* First attempt to build converted tree at beginning of buffer */ 457 tmp = buf; 458 /* But if that overlaps with the old tree... */ 459 if (((tmp + newsize) > fdtstart) && (tmp < fdtend)) { 460 /* Try right after the old tree instead */ 461 tmp = (char *)(uintptr_t)fdtend; 462 if ((tmp + newsize) > ((char *)buf + bufsize)) 463 return -FDT_ERR_NOSPACE; 464 } 465 466 _fdt_packblocks(fdt, tmp, mem_rsv_size, struct_size); 467 memmove(buf, tmp, newsize); 468 469 fdt_set_magic(buf, FDT_MAGIC); 470 fdt_set_totalsize(buf, bufsize); 471 fdt_set_version(buf, 17); 472 fdt_set_last_comp_version(buf, 16); 473 fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt)); 474 475 return 0; 476} 477 478int fdt_pack(void *fdt) 479{ 480 int mem_rsv_size; 481 482 FDT_RW_CHECK_HEADER(fdt); 483 484 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1) 485 * sizeof(struct fdt_reserve_entry); 486 _fdt_packblocks(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt)); 487 fdt_set_totalsize(fdt, _fdt_data_size(fdt)); 488 489 return 0; 490} 491