fdt_rw.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463
  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. #ifndef USE_HOSTCC
  53. #include <fdt.h>
  54. #include <libfdt.h>
  55. #else
  56. #include "fdt_host.h"
  57. #endif
  58. #include "libfdt_internal.h"
  59. static int _blocks_misordered(const void *fdt,
  60. int mem_rsv_size, int struct_size)
  61. {
  62. return (fdt_off_mem_rsvmap(fdt) < ALIGN(sizeof(struct fdt_header), 8))
  63. || (fdt_off_dt_struct(fdt) <
  64. (fdt_off_mem_rsvmap(fdt) + mem_rsv_size))
  65. || (fdt_off_dt_strings(fdt) <
  66. (fdt_off_dt_struct(fdt) + struct_size))
  67. || (fdt_totalsize(fdt) <
  68. (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt)));
  69. }
  70. static int rw_check_header(void *fdt)
  71. {
  72. CHECK_HEADER(fdt);
  73. if (fdt_version(fdt) < 17)
  74. return -FDT_ERR_BADVERSION;
  75. if (_blocks_misordered(fdt, sizeof(struct fdt_reserve_entry),
  76. fdt_size_dt_struct(fdt)))
  77. return -FDT_ERR_BADLAYOUT;
  78. if (fdt_version(fdt) > 17)
  79. fdt_set_version(fdt, 17);
  80. return 0;
  81. }
  82. #define RW_CHECK_HEADER(fdt) \
  83. { \
  84. int err; \
  85. if ((err = rw_check_header(fdt)) != 0) \
  86. return err; \
  87. }
  88. static inline int _blob_data_size(void *fdt)
  89. {
  90. return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  91. }
  92. static int _blob_splice(void *fdt, void *p, int oldlen, int newlen)
  93. {
  94. void *end = fdt + _blob_data_size(fdt);
  95. if (((p + oldlen) < p) || ((p + oldlen) > end))
  96. return -FDT_ERR_BADOFFSET;
  97. if ((end - oldlen + newlen) > (fdt + fdt_totalsize(fdt)))
  98. return -FDT_ERR_NOSPACE;
  99. memmove(p + newlen, p + oldlen, end - p - oldlen);
  100. return 0;
  101. }
  102. static int _blob_splice_mem_rsv(void *fdt, struct fdt_reserve_entry *p,
  103. int oldn, int newn)
  104. {
  105. int delta = (newn - oldn) * sizeof(*p);
  106. int err;
  107. err = _blob_splice(fdt, p, oldn * sizeof(*p), newn * sizeof(*p));
  108. if (err)
  109. return err;
  110. fdt_set_off_dt_struct(fdt, fdt_off_dt_struct(fdt) + delta);
  111. fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
  112. return 0;
  113. }
  114. static int _blob_splice_struct(void *fdt, void *p,
  115. int oldlen, int newlen)
  116. {
  117. int delta = newlen - oldlen;
  118. int err;
  119. if ((err = _blob_splice(fdt, p, oldlen, newlen)))
  120. return err;
  121. fdt_set_size_dt_struct(fdt, fdt_size_dt_struct(fdt) + delta);
  122. fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
  123. return 0;
  124. }
  125. static int _blob_splice_string(void *fdt, int newlen)
  126. {
  127. void *p = fdt + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  128. int err;
  129. if ((err = _blob_splice(fdt, p, 0, newlen)))
  130. return err;
  131. fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen);
  132. return 0;
  133. }
  134. static int _find_add_string(void *fdt, const char *s)
  135. {
  136. char *strtab = (char *)fdt + fdt_off_dt_strings(fdt);
  137. const char *p;
  138. char *new;
  139. int len = strlen(s) + 1;
  140. int err;
  141. p = _fdt_find_string(strtab, fdt_size_dt_strings(fdt), s);
  142. if (p)
  143. /* found it */
  144. return (p - strtab);
  145. new = strtab + fdt_size_dt_strings(fdt);
  146. err = _blob_splice_string(fdt, len);
  147. if (err)
  148. return err;
  149. memcpy(new, s, len);
  150. return (new - strtab);
  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. RW_CHECK_HEADER(fdt);
  157. re = _fdt_mem_rsv_w(fdt, fdt_num_mem_rsv(fdt));
  158. err = _blob_splice_mem_rsv(fdt, re, 0, 1);
  159. if (err)
  160. return err;
  161. re->address = cpu_to_fdt64(address);
  162. re->size = cpu_to_fdt64(size);
  163. return 0;
  164. }
  165. int fdt_del_mem_rsv(void *fdt, int n)
  166. {
  167. struct fdt_reserve_entry *re = _fdt_mem_rsv_w(fdt, n);
  168. int err;
  169. RW_CHECK_HEADER(fdt);
  170. if (n >= fdt_num_mem_rsv(fdt))
  171. return -FDT_ERR_NOTFOUND;
  172. err = _blob_splice_mem_rsv(fdt, re, 1, 0);
  173. if (err)
  174. return err;
  175. return 0;
  176. }
  177. static int _resize_property(void *fdt, int nodeoffset, const char *name, int len,
  178. struct fdt_property **prop)
  179. {
  180. int oldlen;
  181. int err;
  182. *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
  183. if (! (*prop))
  184. return oldlen;
  185. if ((err = _blob_splice_struct(fdt, (*prop)->data,
  186. ALIGN(oldlen, FDT_TAGSIZE),
  187. ALIGN(len, FDT_TAGSIZE))))
  188. return err;
  189. (*prop)->len = cpu_to_fdt32(len);
  190. return 0;
  191. }
  192. static int _add_property(void *fdt, int nodeoffset, const char *name, int len,
  193. struct fdt_property **prop)
  194. {
  195. int proplen;
  196. int nextoffset;
  197. int namestroff;
  198. int err;
  199. if ((nextoffset = _fdt_check_node_offset(fdt, nodeoffset)) < 0)
  200. return nextoffset;
  201. namestroff = _find_add_string(fdt, name);
  202. if (namestroff < 0)
  203. return namestroff;
  204. *prop = _fdt_offset_ptr_w(fdt, nextoffset);
  205. proplen = sizeof(**prop) + ALIGN(len, FDT_TAGSIZE);
  206. err = _blob_splice_struct(fdt, *prop, 0, proplen);
  207. if (err)
  208. return err;
  209. (*prop)->tag = cpu_to_fdt32(FDT_PROP);
  210. (*prop)->nameoff = cpu_to_fdt32(namestroff);
  211. (*prop)->len = cpu_to_fdt32(len);
  212. return 0;
  213. }
  214. int fdt_set_name(void *fdt, int nodeoffset, const char *name)
  215. {
  216. char *namep;
  217. int oldlen, newlen;
  218. int err;
  219. RW_CHECK_HEADER(fdt);
  220. namep = (char *)fdt_get_name(fdt, nodeoffset, &oldlen);
  221. if (!namep)
  222. return oldlen;
  223. newlen = strlen(name);
  224. err = _blob_splice_struct(fdt, namep, ALIGN(oldlen+1, FDT_TAGSIZE),
  225. ALIGN(newlen+1, FDT_TAGSIZE));
  226. if (err)
  227. return err;
  228. memcpy(namep, name, newlen+1);
  229. return 0;
  230. }
  231. int fdt_setprop(void *fdt, int nodeoffset, const char *name,
  232. const void *val, int len)
  233. {
  234. struct fdt_property *prop;
  235. int err;
  236. RW_CHECK_HEADER(fdt);
  237. err = _resize_property(fdt, nodeoffset, name, len, &prop);
  238. if (err == -FDT_ERR_NOTFOUND)
  239. err = _add_property(fdt, nodeoffset, name, len, &prop);
  240. if (err)
  241. return err;
  242. memcpy(prop->data, val, len);
  243. return 0;
  244. }
  245. int fdt_delprop(void *fdt, int nodeoffset, const char *name)
  246. {
  247. struct fdt_property *prop;
  248. int len, proplen;
  249. RW_CHECK_HEADER(fdt);
  250. prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
  251. if (! prop)
  252. return len;
  253. proplen = sizeof(*prop) + ALIGN(len, FDT_TAGSIZE);
  254. return _blob_splice_struct(fdt, prop, proplen, 0);
  255. }
  256. int fdt_add_subnode_namelen(void *fdt, int parentoffset,
  257. const char *name, int namelen)
  258. {
  259. struct fdt_node_header *nh;
  260. int offset, nextoffset;
  261. int nodelen;
  262. int err;
  263. uint32_t tag;
  264. uint32_t *endtag;
  265. RW_CHECK_HEADER(fdt);
  266. offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
  267. if (offset >= 0)
  268. return -FDT_ERR_EXISTS;
  269. else if (offset != -FDT_ERR_NOTFOUND)
  270. return offset;
  271. /* Try to place the new node after the parent's properties */
  272. fdt_next_tag(fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */
  273. do {
  274. offset = nextoffset;
  275. tag = fdt_next_tag(fdt, offset, &nextoffset);
  276. } while ((tag == FDT_PROP) || (tag == FDT_NOP));
  277. nh = _fdt_offset_ptr_w(fdt, offset);
  278. nodelen = sizeof(*nh) + ALIGN(namelen+1, FDT_TAGSIZE) + FDT_TAGSIZE;
  279. err = _blob_splice_struct(fdt, nh, 0, nodelen);
  280. if (err)
  281. return err;
  282. nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
  283. memset(nh->name, 0, ALIGN(namelen+1, FDT_TAGSIZE));
  284. memcpy(nh->name, name, namelen);
  285. endtag = (uint32_t *)((void *)nh + nodelen - FDT_TAGSIZE);
  286. *endtag = cpu_to_fdt32(FDT_END_NODE);
  287. return offset;
  288. }
  289. int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
  290. {
  291. return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
  292. }
  293. int fdt_del_node(void *fdt, int nodeoffset)
  294. {
  295. int endoffset;
  296. RW_CHECK_HEADER(fdt);
  297. endoffset = _fdt_node_end_offset(fdt, nodeoffset);
  298. if (endoffset < 0)
  299. return endoffset;
  300. return _blob_splice_struct(fdt, _fdt_offset_ptr_w(fdt, nodeoffset),
  301. endoffset - nodeoffset, 0);
  302. }
  303. static void _packblocks(const void *fdt, void *buf,
  304. int mem_rsv_size, int struct_size)
  305. {
  306. int mem_rsv_off, struct_off, strings_off;
  307. mem_rsv_off = ALIGN(sizeof(struct fdt_header), 8);
  308. struct_off = mem_rsv_off + mem_rsv_size;
  309. strings_off = struct_off + struct_size;
  310. memmove(buf + mem_rsv_off, fdt + fdt_off_mem_rsvmap(fdt), mem_rsv_size);
  311. fdt_set_off_mem_rsvmap(buf, mem_rsv_off);
  312. memmove(buf + struct_off, fdt + fdt_off_dt_struct(fdt), struct_size);
  313. fdt_set_off_dt_struct(buf, struct_off);
  314. fdt_set_size_dt_struct(buf, struct_size);
  315. memmove(buf + strings_off, fdt + fdt_off_dt_strings(fdt),
  316. fdt_size_dt_strings(fdt));
  317. fdt_set_off_dt_strings(buf, strings_off);
  318. fdt_set_size_dt_strings(buf, fdt_size_dt_strings(fdt));
  319. }
  320. int fdt_open_into(const void *fdt, void *buf, int bufsize)
  321. {
  322. int err;
  323. int mem_rsv_size, struct_size;
  324. int newsize;
  325. void *tmp;
  326. CHECK_HEADER(fdt);
  327. mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
  328. * sizeof(struct fdt_reserve_entry);
  329. if (fdt_version(fdt) >= 17) {
  330. struct_size = fdt_size_dt_struct(fdt);
  331. } else {
  332. struct_size = 0;
  333. while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END)
  334. ;
  335. }
  336. if (!_blocks_misordered(fdt, mem_rsv_size, struct_size)) {
  337. /* no further work necessary */
  338. err = fdt_move(fdt, buf, bufsize);
  339. if (err)
  340. return err;
  341. fdt_set_version(buf, 17);
  342. fdt_set_size_dt_struct(buf, struct_size);
  343. fdt_set_totalsize(buf, bufsize);
  344. return 0;
  345. }
  346. /* Need to reorder */
  347. newsize = ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size
  348. + struct_size + fdt_size_dt_strings(fdt);
  349. if (bufsize < newsize)
  350. return -FDT_ERR_NOSPACE;
  351. if (((buf + newsize) <= fdt)
  352. || (buf >= (fdt + fdt_totalsize(fdt)))) {
  353. tmp = buf;
  354. } else {
  355. tmp = (void *)fdt + fdt_totalsize(fdt);
  356. if ((tmp + newsize) > (buf + bufsize))
  357. return -FDT_ERR_NOSPACE;
  358. }
  359. _packblocks(fdt, tmp, mem_rsv_size, struct_size);
  360. memmove(buf, tmp, newsize);
  361. fdt_set_magic(buf, FDT_MAGIC);
  362. fdt_set_totalsize(buf, bufsize);
  363. fdt_set_version(buf, 17);
  364. fdt_set_last_comp_version(buf, 16);
  365. fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt));
  366. return 0;
  367. }
  368. int fdt_pack(void *fdt)
  369. {
  370. int mem_rsv_size;
  371. RW_CHECK_HEADER(fdt);
  372. mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
  373. * sizeof(struct fdt_reserve_entry);
  374. _packblocks(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt));
  375. fdt_set_totalsize(fdt, _blob_data_size(fdt));
  376. return 0;
  377. }