fdt_rw.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491
  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 _fdt_blocks_misordered(const void *fdt,
  56. int mem_rsv_size, int struct_size)
  57. {
  58. return (fdt_off_mem_rsvmap(fdt) < 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 _fdt_rw_check_header(void *fdt)
  67. {
  68. FDT_CHECK_HEADER(fdt);
  69. if (fdt_version(fdt) < 17)
  70. return -FDT_ERR_BADVERSION;
  71. if (_fdt_blocks_misordered(fdt, sizeof(struct fdt_reserve_entry),
  72. fdt_size_dt_struct(fdt)))
  73. return -FDT_ERR_BADLAYOUT;
  74. if (fdt_version(fdt) > 17)
  75. fdt_set_version(fdt, 17);
  76. return 0;
  77. }
  78. #define FDT_RW_CHECK_HEADER(fdt) \
  79. { \
  80. int __err; \
  81. if ((__err = _fdt_rw_check_header(fdt)) != 0) \
  82. return __err; \
  83. }
  84. static inline int _fdt_data_size(void *fdt)
  85. {
  86. return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  87. }
  88. static int _fdt_splice(void *fdt, void *splicepoint, int oldlen, int newlen)
  89. {
  90. char *p = splicepoint;
  91. char *end = (char *)fdt + _fdt_data_size(fdt);
  92. if (((p + oldlen) < p) || ((p + oldlen) > end))
  93. return -FDT_ERR_BADOFFSET;
  94. if ((p < (char *)fdt) || ((end - oldlen + newlen) < (char *)fdt))
  95. return -FDT_ERR_BADOFFSET;
  96. if ((end - oldlen + newlen) > ((char *)fdt + fdt_totalsize(fdt)))
  97. return -FDT_ERR_NOSPACE;
  98. memmove(p + newlen, p + oldlen, end - p - oldlen);
  99. return 0;
  100. }
  101. static int _fdt_splice_mem_rsv(void *fdt, struct fdt_reserve_entry *p,
  102. int oldn, int newn)
  103. {
  104. int delta = (newn - oldn) * sizeof(*p);
  105. int err;
  106. err = _fdt_splice(fdt, p, oldn * sizeof(*p), newn * sizeof(*p));
  107. if (err)
  108. return err;
  109. fdt_set_off_dt_struct(fdt, fdt_off_dt_struct(fdt) + delta);
  110. fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
  111. return 0;
  112. }
  113. static int _fdt_splice_struct(void *fdt, void *p,
  114. int oldlen, int newlen)
  115. {
  116. int delta = newlen - oldlen;
  117. int err;
  118. if ((err = _fdt_splice(fdt, p, oldlen, newlen)))
  119. return err;
  120. fdt_set_size_dt_struct(fdt, fdt_size_dt_struct(fdt) + delta);
  121. fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
  122. return 0;
  123. }
  124. static int _fdt_splice_string(void *fdt, int newlen)
  125. {
  126. void *p = (char *)fdt
  127. + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  128. int err;
  129. if ((err = _fdt_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 _fdt_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 = _fdt_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. FDT_RW_CHECK_HEADER(fdt);
  157. re = _fdt_mem_rsv_w(fdt, fdt_num_mem_rsv(fdt));
  158. err = _fdt_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. FDT_RW_CHECK_HEADER(fdt);
  169. if (n >= fdt_num_mem_rsv(fdt))
  170. return -FDT_ERR_NOTFOUND;
  171. return _fdt_splice_mem_rsv(fdt, re, 1, 0);
  172. }
  173. static int _fdt_resize_property(void *fdt, int nodeoffset, const char *name,
  174. int len, struct fdt_property **prop)
  175. {
  176. int oldlen;
  177. int err;
  178. *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
  179. if (! (*prop))
  180. return oldlen;
  181. if ((err = _fdt_splice_struct(fdt, (*prop)->data, FDT_TAGALIGN(oldlen),
  182. FDT_TAGALIGN(len))))
  183. return err;
  184. (*prop)->len = cpu_to_fdt32(len);
  185. return 0;
  186. }
  187. static int _fdt_add_property(void *fdt, int nodeoffset, const char *name,
  188. int len, struct fdt_property **prop)
  189. {
  190. int proplen;
  191. int nextoffset;
  192. int namestroff;
  193. int err;
  194. if ((nextoffset = _fdt_check_node_offset(fdt, nodeoffset)) < 0)
  195. return nextoffset;
  196. namestroff = _fdt_find_add_string(fdt, name);
  197. if (namestroff < 0)
  198. return namestroff;
  199. *prop = _fdt_offset_ptr_w(fdt, nextoffset);
  200. proplen = sizeof(**prop) + FDT_TAGALIGN(len);
  201. err = _fdt_splice_struct(fdt, *prop, 0, proplen);
  202. if (err)
  203. return err;
  204. (*prop)->tag = cpu_to_fdt32(FDT_PROP);
  205. (*prop)->nameoff = cpu_to_fdt32(namestroff);
  206. (*prop)->len = cpu_to_fdt32(len);
  207. return 0;
  208. }
  209. int fdt_set_name(void *fdt, int nodeoffset, const char *name)
  210. {
  211. char *namep;
  212. int oldlen, newlen;
  213. int err;
  214. FDT_RW_CHECK_HEADER(fdt);
  215. namep = (char *)(uintptr_t)fdt_get_name(fdt, nodeoffset, &oldlen);
  216. if (!namep)
  217. return oldlen;
  218. newlen = strlen(name);
  219. err = _fdt_splice_struct(fdt, namep, FDT_TAGALIGN(oldlen+1),
  220. FDT_TAGALIGN(newlen+1));
  221. if (err)
  222. return err;
  223. memcpy(namep, name, newlen+1);
  224. return 0;
  225. }
  226. int fdt_setprop(void *fdt, int nodeoffset, const char *name,
  227. const void *val, int len)
  228. {
  229. struct fdt_property *prop;
  230. int err;
  231. FDT_RW_CHECK_HEADER(fdt);
  232. err = _fdt_resize_property(fdt, nodeoffset, name, len, &prop);
  233. if (err == -FDT_ERR_NOTFOUND)
  234. err = _fdt_add_property(fdt, nodeoffset, name, len, &prop);
  235. if (err)
  236. return err;
  237. if (len)
  238. memcpy(prop->data, val, len);
  239. return 0;
  240. }
  241. int fdt_appendprop(void *fdt, int nodeoffset, const char *name,
  242. const void *val, int len)
  243. {
  244. struct fdt_property *prop;
  245. int err, oldlen, newlen;
  246. FDT_RW_CHECK_HEADER(fdt);
  247. prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
  248. if (prop) {
  249. newlen = len + oldlen;
  250. err = _fdt_splice_struct(fdt, prop->data,
  251. FDT_TAGALIGN(oldlen),
  252. FDT_TAGALIGN(newlen));
  253. if (err)
  254. return err;
  255. prop->len = cpu_to_fdt32(newlen);
  256. memcpy(prop->data + oldlen, val, len);
  257. } else {
  258. err = _fdt_add_property(fdt, nodeoffset, name, len, &prop);
  259. if (err)
  260. return err;
  261. memcpy(prop->data, val, len);
  262. }
  263. return 0;
  264. }
  265. int fdt_delprop(void *fdt, int nodeoffset, const char *name)
  266. {
  267. struct fdt_property *prop;
  268. int len, proplen;
  269. FDT_RW_CHECK_HEADER(fdt);
  270. prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
  271. if (! prop)
  272. return len;
  273. proplen = sizeof(*prop) + FDT_TAGALIGN(len);
  274. return _fdt_splice_struct(fdt, prop, proplen, 0);
  275. }
  276. int fdt_add_subnode_namelen(void *fdt, int parentoffset,
  277. const char *name, int namelen)
  278. {
  279. struct fdt_node_header *nh;
  280. int offset, nextoffset;
  281. int nodelen;
  282. int err;
  283. uint32_t tag;
  284. fdt32_t *endtag;
  285. FDT_RW_CHECK_HEADER(fdt);
  286. offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
  287. if (offset >= 0)
  288. return -FDT_ERR_EXISTS;
  289. else if (offset != -FDT_ERR_NOTFOUND)
  290. return offset;
  291. /* Try to place the new node after the parent's properties */
  292. fdt_next_tag(fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */
  293. do {
  294. offset = nextoffset;
  295. tag = fdt_next_tag(fdt, offset, &nextoffset);
  296. } while ((tag == FDT_PROP) || (tag == FDT_NOP));
  297. nh = _fdt_offset_ptr_w(fdt, offset);
  298. nodelen = sizeof(*nh) + FDT_TAGALIGN(namelen+1) + FDT_TAGSIZE;
  299. err = _fdt_splice_struct(fdt, nh, 0, nodelen);
  300. if (err)
  301. return err;
  302. nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
  303. memset(nh->name, 0, FDT_TAGALIGN(namelen+1));
  304. memcpy(nh->name, name, namelen);
  305. endtag = (fdt32_t *)((char *)nh + nodelen - FDT_TAGSIZE);
  306. *endtag = cpu_to_fdt32(FDT_END_NODE);
  307. return offset;
  308. }
  309. int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
  310. {
  311. return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
  312. }
  313. int fdt_del_node(void *fdt, int nodeoffset)
  314. {
  315. int endoffset;
  316. FDT_RW_CHECK_HEADER(fdt);
  317. endoffset = _fdt_node_end_offset(fdt, nodeoffset);
  318. if (endoffset < 0)
  319. return endoffset;
  320. return _fdt_splice_struct(fdt, _fdt_offset_ptr_w(fdt, nodeoffset),
  321. endoffset - nodeoffset, 0);
  322. }
  323. static void _fdt_packblocks(const char *old, char *new,
  324. int mem_rsv_size, int struct_size)
  325. {
  326. int mem_rsv_off, struct_off, strings_off;
  327. mem_rsv_off = FDT_ALIGN(sizeof(struct fdt_header), 8);
  328. struct_off = mem_rsv_off + mem_rsv_size;
  329. strings_off = struct_off + struct_size;
  330. memmove(new + mem_rsv_off, old + fdt_off_mem_rsvmap(old), mem_rsv_size);
  331. fdt_set_off_mem_rsvmap(new, mem_rsv_off);
  332. memmove(new + struct_off, old + fdt_off_dt_struct(old), struct_size);
  333. fdt_set_off_dt_struct(new, struct_off);
  334. fdt_set_size_dt_struct(new, struct_size);
  335. memmove(new + strings_off, old + fdt_off_dt_strings(old),
  336. fdt_size_dt_strings(old));
  337. fdt_set_off_dt_strings(new, strings_off);
  338. fdt_set_size_dt_strings(new, fdt_size_dt_strings(old));
  339. }
  340. int fdt_open_into(const void *fdt, void *buf, int bufsize)
  341. {
  342. int err;
  343. int mem_rsv_size, struct_size;
  344. int newsize;
  345. const char *fdtstart = fdt;
  346. const char *fdtend = fdtstart + fdt_totalsize(fdt);
  347. char *tmp;
  348. FDT_CHECK_HEADER(fdt);
  349. mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
  350. * sizeof(struct fdt_reserve_entry);
  351. if (fdt_version(fdt) >= 17) {
  352. struct_size = fdt_size_dt_struct(fdt);
  353. } else {
  354. struct_size = 0;
  355. while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END)
  356. ;
  357. if (struct_size < 0)
  358. return struct_size;
  359. }
  360. if (!_fdt_blocks_misordered(fdt, mem_rsv_size, struct_size)) {
  361. /* no further work necessary */
  362. err = fdt_move(fdt, buf, bufsize);
  363. if (err)
  364. return err;
  365. fdt_set_version(buf, 17);
  366. fdt_set_size_dt_struct(buf, struct_size);
  367. fdt_set_totalsize(buf, bufsize);
  368. return 0;
  369. }
  370. /* Need to reorder */
  371. newsize = FDT_ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size
  372. + struct_size + fdt_size_dt_strings(fdt);
  373. if (bufsize < newsize)
  374. return -FDT_ERR_NOSPACE;
  375. /* First attempt to build converted tree at beginning of buffer */
  376. tmp = buf;
  377. /* But if that overlaps with the old tree... */
  378. if (((tmp + newsize) > fdtstart) && (tmp < fdtend)) {
  379. /* Try right after the old tree instead */
  380. tmp = (char *)(uintptr_t)fdtend;
  381. if ((tmp + newsize) > ((char *)buf + bufsize))
  382. return -FDT_ERR_NOSPACE;
  383. }
  384. _fdt_packblocks(fdt, tmp, mem_rsv_size, struct_size);
  385. memmove(buf, tmp, newsize);
  386. fdt_set_magic(buf, FDT_MAGIC);
  387. fdt_set_totalsize(buf, bufsize);
  388. fdt_set_version(buf, 17);
  389. fdt_set_last_comp_version(buf, 16);
  390. fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt));
  391. return 0;
  392. }
  393. int fdt_pack(void *fdt)
  394. {
  395. int mem_rsv_size;
  396. FDT_RW_CHECK_HEADER(fdt);
  397. mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
  398. * sizeof(struct fdt_reserve_entry);
  399. _fdt_packblocks(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt));
  400. fdt_set_totalsize(fdt, _fdt_data_size(fdt));
  401. return 0;
  402. }