fdt_rw.c 12 KB

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