fdt_rw.c 11 KB

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