fdt_rw.c 12 KB

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