| Scott Long | f9f4f1a | 2014-12-03 01:11:57 -0800 | [diff] [blame] | 1 | /* |
| 2 | * libfdt - Flat Device Tree manipulation |
| 3 | * Copyright (C) 2006 David Gibson, IBM Corporation. |
| 4 | * |
| Scott Long | 0646944 | 2014-12-10 10:06:22 -0800 | [diff] [blame] | 5 | * Redistribution and use in source and binary forms, with or |
| 6 | * without modification, are permitted provided that the following |
| 7 | * conditions are met: |
| Scott Long | f9f4f1a | 2014-12-03 01:11:57 -0800 | [diff] [blame] | 8 | * |
| Scott Long | 0646944 | 2014-12-10 10:06:22 -0800 | [diff] [blame] | 9 | * 1. Redistributions of source code must retain the above |
| 10 | * copyright notice, this list of conditions and the following |
| 11 | * disclaimer. |
| 12 | * 2. Redistributions in binary form must reproduce the above |
| 13 | * copyright notice, this list of conditions and the following |
| 14 | * disclaimer in the documentation and/or other materials |
| 15 | * provided with the distribution. |
| Scott Long | f9f4f1a | 2014-12-03 01:11:57 -0800 | [diff] [blame] | 16 | * |
| Scott Long | 0646944 | 2014-12-10 10:06:22 -0800 | [diff] [blame] | 17 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND |
| 18 | * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, |
| 19 | * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| 20 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| 21 | * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR |
| 22 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| 24 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
| 25 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 26 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 27 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR |
| 28 | * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, |
| 29 | * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| Scott Long | f9f4f1a | 2014-12-03 01:11:57 -0800 | [diff] [blame] | 30 | */ |
| 31 | #include "libfdt_env.h" |
| 32 | |
| 33 | #include <fdt.h> |
| 34 | #include <libfdt.h> |
| 35 | |
| 36 | #include "libfdt_internal.h" |
| 37 | |
| 38 | static int _fdt_blocks_misordered(const void *fdt, |
| 39 | int mem_rsv_size, int struct_size) |
| 40 | { |
| 41 | return (fdt_off_mem_rsvmap(fdt) < FDT_ALIGN(sizeof(struct fdt_header), 8)) |
| 42 | || (fdt_off_dt_struct(fdt) < |
| 43 | (fdt_off_mem_rsvmap(fdt) + mem_rsv_size)) |
| 44 | || (fdt_off_dt_strings(fdt) < |
| 45 | (fdt_off_dt_struct(fdt) + struct_size)) |
| 46 | || (fdt_totalsize(fdt) < |
| 47 | (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt))); |
| 48 | } |
| 49 | |
| 50 | static int _fdt_rw_check_header(void *fdt) |
| 51 | { |
| 52 | FDT_CHECK_HEADER(fdt); |
| 53 | |
| 54 | if (fdt_version(fdt) < 17) |
| 55 | return -FDT_ERR_BADVERSION; |
| 56 | if (_fdt_blocks_misordered(fdt, sizeof(struct fdt_reserve_entry), |
| 57 | fdt_size_dt_struct(fdt))) |
| 58 | return -FDT_ERR_BADLAYOUT; |
| 59 | if (fdt_version(fdt) > 17) |
| 60 | fdt_set_version(fdt, 17); |
| 61 | |
| 62 | return 0; |
| 63 | } |
| 64 | |
| 65 | #define FDT_RW_CHECK_HEADER(fdt) \ |
| 66 | { \ |
| 67 | int err; \ |
| 68 | if ((err = _fdt_rw_check_header(fdt)) != 0) \ |
| 69 | return err; \ |
| 70 | } |
| 71 | |
| 72 | static inline int _fdt_data_size(void *fdt) |
| 73 | { |
| 74 | return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt); |
| 75 | } |
| 76 | |
| 77 | static int _fdt_splice(void *fdt, void *splicepoint, int oldlen, int newlen) |
| 78 | { |
| 79 | char *p = splicepoint; |
| 80 | char *end = (char *)fdt + _fdt_data_size(fdt); |
| 81 | |
| 82 | if (((p + oldlen) < p) || ((p + oldlen) > end)) |
| 83 | return -FDT_ERR_BADOFFSET; |
| 84 | if ((end - oldlen + newlen) > ((char *)fdt + fdt_totalsize(fdt))) |
| 85 | return -FDT_ERR_NOSPACE; |
| 86 | memmove(p + newlen, p + oldlen, end - p - oldlen); |
| 87 | return 0; |
| 88 | } |
| 89 | |
| 90 | static int _fdt_splice_mem_rsv(void *fdt, struct fdt_reserve_entry *p, |
| 91 | int oldn, int newn) |
| 92 | { |
| 93 | int delta = (newn - oldn) * sizeof(*p); |
| 94 | int err; |
| 95 | err = _fdt_splice(fdt, p, oldn * sizeof(*p), newn * sizeof(*p)); |
| 96 | if (err) |
| 97 | return err; |
| 98 | fdt_set_off_dt_struct(fdt, fdt_off_dt_struct(fdt) + delta); |
| 99 | fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta); |
| 100 | return 0; |
| 101 | } |
| 102 | |
| 103 | static int _fdt_splice_struct(void *fdt, void *p, |
| 104 | int oldlen, int newlen) |
| 105 | { |
| 106 | int delta = newlen - oldlen; |
| 107 | int err; |
| 108 | |
| 109 | if ((err = _fdt_splice(fdt, p, oldlen, newlen))) |
| 110 | return err; |
| 111 | |
| 112 | fdt_set_size_dt_struct(fdt, fdt_size_dt_struct(fdt) + delta); |
| 113 | fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta); |
| 114 | return 0; |
| 115 | } |
| 116 | |
| 117 | static int _fdt_splice_string(void *fdt, int newlen) |
| 118 | { |
| 119 | void *p = (char *)fdt |
| 120 | + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt); |
| 121 | int err; |
| 122 | |
| 123 | if ((err = _fdt_splice(fdt, p, 0, newlen))) |
| 124 | return err; |
| 125 | |
| 126 | fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen); |
| 127 | return 0; |
| 128 | } |
| 129 | |
| 130 | static int _fdt_find_add_string(void *fdt, const char *s) |
| 131 | { |
| 132 | char *strtab = (char *)fdt + fdt_off_dt_strings(fdt); |
| 133 | const char *p; |
| 134 | char *new; |
| 135 | int len = strlen(s) + 1; |
| 136 | int err; |
| 137 | |
| 138 | p = _fdt_find_string(strtab, fdt_size_dt_strings(fdt), s); |
| 139 | if (p) |
| 140 | /* found it */ |
| 141 | return (p - strtab); |
| 142 | |
| 143 | new = strtab + fdt_size_dt_strings(fdt); |
| 144 | err = _fdt_splice_string(fdt, len); |
| 145 | if (err) |
| 146 | return err; |
| 147 | |
| 148 | memcpy(new, s, len); |
| 149 | return (new - strtab); |
| 150 | } |
| 151 | |
| 152 | int fdt_add_mem_rsv(void *fdt, uint64_t address, uint64_t size) |
| 153 | { |
| 154 | struct fdt_reserve_entry *re; |
| 155 | int err; |
| 156 | |
| 157 | FDT_RW_CHECK_HEADER(fdt); |
| 158 | |
| 159 | re = _fdt_mem_rsv_w(fdt, fdt_num_mem_rsv(fdt)); |
| 160 | err = _fdt_splice_mem_rsv(fdt, re, 0, 1); |
| 161 | if (err) |
| 162 | return err; |
| 163 | |
| 164 | re->address = cpu_to_fdt64(address); |
| 165 | re->size = cpu_to_fdt64(size); |
| 166 | return 0; |
| 167 | } |
| 168 | |
| 169 | int fdt_del_mem_rsv(void *fdt, int n) |
| 170 | { |
| 171 | struct fdt_reserve_entry *re = _fdt_mem_rsv_w(fdt, n); |
| 172 | int err; |
| 173 | |
| 174 | FDT_RW_CHECK_HEADER(fdt); |
| 175 | |
| 176 | if (n >= fdt_num_mem_rsv(fdt)) |
| 177 | return -FDT_ERR_NOTFOUND; |
| 178 | |
| 179 | err = _fdt_splice_mem_rsv(fdt, re, 1, 0); |
| 180 | if (err) |
| 181 | return err; |
| 182 | return 0; |
| 183 | } |
| 184 | |
| 185 | static int _fdt_resize_property(void *fdt, int nodeoffset, const char *name, |
| 186 | int len, struct fdt_property **prop) |
| 187 | { |
| 188 | int oldlen; |
| 189 | int err; |
| 190 | |
| 191 | *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen); |
| 192 | if (! (*prop)) |
| 193 | return oldlen; |
| 194 | |
| 195 | if ((err = _fdt_splice_struct(fdt, (*prop)->data, FDT_TAGALIGN(oldlen), |
| 196 | FDT_TAGALIGN(len)))) |
| 197 | return err; |
| 198 | |
| 199 | (*prop)->len = cpu_to_fdt32(len); |
| 200 | return 0; |
| 201 | } |
| 202 | |
| 203 | static int _fdt_add_property(void *fdt, int nodeoffset, const char *name, |
| 204 | int len, struct fdt_property **prop) |
| 205 | { |
| 206 | int proplen; |
| 207 | int nextoffset; |
| 208 | int namestroff; |
| 209 | int err; |
| 210 | |
| 211 | if ((nextoffset = _fdt_check_node_offset(fdt, nodeoffset)) < 0) |
| 212 | return nextoffset; |
| 213 | |
| 214 | namestroff = _fdt_find_add_string(fdt, name); |
| 215 | if (namestroff < 0) |
| 216 | return namestroff; |
| 217 | |
| 218 | *prop = _fdt_offset_ptr_w(fdt, nextoffset); |
| 219 | proplen = sizeof(**prop) + FDT_TAGALIGN(len); |
| 220 | |
| 221 | err = _fdt_splice_struct(fdt, *prop, 0, proplen); |
| 222 | if (err) |
| 223 | return err; |
| 224 | |
| 225 | (*prop)->tag = cpu_to_fdt32(FDT_PROP); |
| 226 | (*prop)->nameoff = cpu_to_fdt32(namestroff); |
| 227 | (*prop)->len = cpu_to_fdt32(len); |
| 228 | return 0; |
| 229 | } |
| 230 | |
| 231 | int fdt_set_name(void *fdt, int nodeoffset, const char *name) |
| 232 | { |
| 233 | char *namep; |
| 234 | int oldlen, newlen; |
| 235 | int err; |
| 236 | |
| 237 | FDT_RW_CHECK_HEADER(fdt); |
| 238 | |
| 239 | namep = (char *)(uintptr_t)fdt_get_name(fdt, nodeoffset, &oldlen); |
| 240 | if (!namep) |
| 241 | return oldlen; |
| 242 | |
| 243 | newlen = strlen(name); |
| 244 | |
| 245 | err = _fdt_splice_struct(fdt, namep, FDT_TAGALIGN(oldlen+1), |
| 246 | FDT_TAGALIGN(newlen+1)); |
| 247 | if (err) |
| 248 | return err; |
| 249 | |
| 250 | memcpy(namep, name, newlen+1); |
| 251 | return 0; |
| 252 | } |
| 253 | |
| 254 | int fdt_setprop(void *fdt, int nodeoffset, const char *name, |
| 255 | const void *val, int len) |
| 256 | { |
| 257 | struct fdt_property *prop; |
| 258 | int err; |
| 259 | |
| 260 | FDT_RW_CHECK_HEADER(fdt); |
| 261 | |
| 262 | err = _fdt_resize_property(fdt, nodeoffset, name, len, &prop); |
| 263 | if (err == -FDT_ERR_NOTFOUND) |
| 264 | err = _fdt_add_property(fdt, nodeoffset, name, len, &prop); |
| 265 | if (err) |
| 266 | return err; |
| 267 | |
| 268 | memcpy(prop->data, val, len); |
| 269 | return 0; |
| 270 | } |
| 271 | |
| 272 | int fdt_delprop(void *fdt, int nodeoffset, const char *name) |
| 273 | { |
| 274 | struct fdt_property *prop; |
| 275 | int len, proplen; |
| 276 | |
| 277 | FDT_RW_CHECK_HEADER(fdt); |
| 278 | |
| 279 | prop = fdt_get_property_w(fdt, nodeoffset, name, &len); |
| 280 | if (! prop) |
| 281 | return len; |
| 282 | |
| 283 | proplen = sizeof(*prop) + FDT_TAGALIGN(len); |
| 284 | return _fdt_splice_struct(fdt, prop, proplen, 0); |
| 285 | } |
| 286 | |
| 287 | int fdt_add_subnode_namelen(void *fdt, int parentoffset, |
| 288 | const char *name, int namelen) |
| 289 | { |
| 290 | struct fdt_node_header *nh; |
| 291 | int offset, nextoffset; |
| 292 | int nodelen; |
| 293 | int err; |
| 294 | uint32_t tag; |
| 295 | uint32_t *endtag; |
| 296 | |
| 297 | FDT_RW_CHECK_HEADER(fdt); |
| 298 | |
| 299 | offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen); |
| 300 | if (offset >= 0) |
| 301 | return -FDT_ERR_EXISTS; |
| 302 | else if (offset != -FDT_ERR_NOTFOUND) |
| 303 | return offset; |
| 304 | |
| 305 | /* Try to place the new node after the parent's properties */ |
| 306 | fdt_next_tag(fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */ |
| 307 | do { |
| 308 | offset = nextoffset; |
| 309 | tag = fdt_next_tag(fdt, offset, &nextoffset); |
| 310 | } while ((tag == FDT_PROP) || (tag == FDT_NOP)); |
| 311 | |
| 312 | nh = _fdt_offset_ptr_w(fdt, offset); |
| 313 | nodelen = sizeof(*nh) + FDT_TAGALIGN(namelen+1) + FDT_TAGSIZE; |
| 314 | |
| 315 | err = _fdt_splice_struct(fdt, nh, 0, nodelen); |
| 316 | if (err) |
| 317 | return err; |
| 318 | |
| 319 | nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE); |
| 320 | memset(nh->name, 0, FDT_TAGALIGN(namelen+1)); |
| 321 | memcpy(nh->name, name, namelen); |
| 322 | endtag = (uint32_t *)((char *)nh + nodelen - FDT_TAGSIZE); |
| 323 | *endtag = cpu_to_fdt32(FDT_END_NODE); |
| 324 | |
| 325 | return offset; |
| 326 | } |
| 327 | |
| 328 | int fdt_add_subnode(void *fdt, int parentoffset, const char *name) |
| 329 | { |
| 330 | return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name)); |
| 331 | } |
| 332 | |
| 333 | int fdt_del_node(void *fdt, int nodeoffset) |
| 334 | { |
| 335 | int endoffset; |
| 336 | |
| 337 | FDT_RW_CHECK_HEADER(fdt); |
| 338 | |
| 339 | endoffset = _fdt_node_end_offset(fdt, nodeoffset); |
| 340 | if (endoffset < 0) |
| 341 | return endoffset; |
| 342 | |
| 343 | return _fdt_splice_struct(fdt, _fdt_offset_ptr_w(fdt, nodeoffset), |
| 344 | endoffset - nodeoffset, 0); |
| 345 | } |
| 346 | |
| 347 | static void _fdt_packblocks(const char *old, char *new, |
| 348 | int mem_rsv_size, int struct_size) |
| 349 | { |
| 350 | int mem_rsv_off, struct_off, strings_off; |
| 351 | |
| 352 | mem_rsv_off = FDT_ALIGN(sizeof(struct fdt_header), 8); |
| 353 | struct_off = mem_rsv_off + mem_rsv_size; |
| 354 | strings_off = struct_off + struct_size; |
| 355 | |
| 356 | memmove(new + mem_rsv_off, old + fdt_off_mem_rsvmap(old), mem_rsv_size); |
| 357 | fdt_set_off_mem_rsvmap(new, mem_rsv_off); |
| 358 | |
| 359 | memmove(new + struct_off, old + fdt_off_dt_struct(old), struct_size); |
| 360 | fdt_set_off_dt_struct(new, struct_off); |
| 361 | fdt_set_size_dt_struct(new, struct_size); |
| 362 | |
| 363 | memmove(new + strings_off, old + fdt_off_dt_strings(old), |
| 364 | fdt_size_dt_strings(old)); |
| 365 | fdt_set_off_dt_strings(new, strings_off); |
| 366 | fdt_set_size_dt_strings(new, fdt_size_dt_strings(old)); |
| 367 | } |
| 368 | |
| 369 | int fdt_open_into(const void *fdt, void *buf, int bufsize) |
| 370 | { |
| 371 | int err; |
| 372 | int mem_rsv_size, struct_size; |
| 373 | int newsize; |
| 374 | const char *fdtstart = fdt; |
| 375 | const char *fdtend = fdtstart + fdt_totalsize(fdt); |
| 376 | char *tmp; |
| 377 | |
| 378 | FDT_CHECK_HEADER(fdt); |
| 379 | |
| 380 | mem_rsv_size = (fdt_num_mem_rsv(fdt)+1) |
| 381 | * sizeof(struct fdt_reserve_entry); |
| 382 | |
| 383 | if (fdt_version(fdt) >= 17) { |
| 384 | struct_size = fdt_size_dt_struct(fdt); |
| 385 | } else { |
| 386 | struct_size = 0; |
| 387 | while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END) |
| 388 | ; |
| 389 | if (struct_size < 0) |
| 390 | return struct_size; |
| 391 | } |
| 392 | |
| 393 | if (!_fdt_blocks_misordered(fdt, mem_rsv_size, struct_size)) { |
| 394 | /* no further work necessary */ |
| 395 | err = fdt_move(fdt, buf, bufsize); |
| 396 | if (err) |
| 397 | return err; |
| 398 | fdt_set_version(buf, 17); |
| 399 | fdt_set_size_dt_struct(buf, struct_size); |
| 400 | fdt_set_totalsize(buf, bufsize); |
| 401 | return 0; |
| 402 | } |
| 403 | |
| 404 | /* Need to reorder */ |
| 405 | newsize = FDT_ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size |
| 406 | + struct_size + fdt_size_dt_strings(fdt); |
| 407 | |
| 408 | if (bufsize < newsize) |
| 409 | return -FDT_ERR_NOSPACE; |
| 410 | |
| 411 | /* First attempt to build converted tree at beginning of buffer */ |
| 412 | tmp = buf; |
| 413 | /* But if that overlaps with the old tree... */ |
| 414 | if (((tmp + newsize) > fdtstart) && (tmp < fdtend)) { |
| 415 | /* Try right after the old tree instead */ |
| 416 | tmp = (char *)(uintptr_t)fdtend; |
| 417 | if ((tmp + newsize) > ((char *)buf + bufsize)) |
| 418 | return -FDT_ERR_NOSPACE; |
| 419 | } |
| 420 | |
| 421 | _fdt_packblocks(fdt, tmp, mem_rsv_size, struct_size); |
| 422 | memmove(buf, tmp, newsize); |
| 423 | |
| 424 | fdt_set_magic(buf, FDT_MAGIC); |
| 425 | fdt_set_totalsize(buf, bufsize); |
| 426 | fdt_set_version(buf, 17); |
| 427 | fdt_set_last_comp_version(buf, 16); |
| 428 | fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt)); |
| 429 | |
| 430 | return 0; |
| 431 | } |
| 432 | |
| 433 | int fdt_pack(void *fdt) |
| 434 | { |
| 435 | int mem_rsv_size; |
| 436 | |
| 437 | FDT_RW_CHECK_HEADER(fdt); |
| 438 | |
| 439 | mem_rsv_size = (fdt_num_mem_rsv(fdt)+1) |
| 440 | * sizeof(struct fdt_reserve_entry); |
| 441 | _fdt_packblocks(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt)); |
| 442 | fdt_set_totalsize(fdt, _fdt_data_size(fdt)); |
| 443 | |
| 444 | return 0; |
| 445 | } |