fdt_rw.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451
  1. /*
  2. * libfdt - Flat Device Tree manipulation
  3. * Copyright (C) 2006 David Gibson, IBM Corporation.
  4. * SPDX-License-Identifier: GPL-2.0+ BSD-2-Clause
  5. */
  6. #include "libfdt_env.h"
  7. #ifndef USE_HOSTCC
  8. #include <fdt.h>
  9. #include <libfdt.h>
  10. #else
  11. #include "fdt_host.h"
  12. #endif
  13. #include "libfdt_internal.h"
  14. static int _fdt_blocks_misordered(const void *fdt,
  15. int mem_rsv_size, int struct_size)
  16. {
  17. return (fdt_off_mem_rsvmap(fdt) < FDT_ALIGN(sizeof(struct fdt_header), 8))
  18. || (fdt_off_dt_struct(fdt) <
  19. (fdt_off_mem_rsvmap(fdt) + mem_rsv_size))
  20. || (fdt_off_dt_strings(fdt) <
  21. (fdt_off_dt_struct(fdt) + struct_size))
  22. || (fdt_totalsize(fdt) <
  23. (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt)));
  24. }
  25. static int _fdt_rw_check_header(void *fdt)
  26. {
  27. FDT_CHECK_HEADER(fdt);
  28. if (fdt_version(fdt) < 17)
  29. return -FDT_ERR_BADVERSION;
  30. if (_fdt_blocks_misordered(fdt, sizeof(struct fdt_reserve_entry),
  31. fdt_size_dt_struct(fdt)))
  32. return -FDT_ERR_BADLAYOUT;
  33. if (fdt_version(fdt) > 17)
  34. fdt_set_version(fdt, 17);
  35. return 0;
  36. }
  37. #define FDT_RW_CHECK_HEADER(fdt) \
  38. { \
  39. int err; \
  40. if ((err = _fdt_rw_check_header(fdt)) != 0) \
  41. return err; \
  42. }
  43. static inline int _fdt_data_size(void *fdt)
  44. {
  45. return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  46. }
  47. static int _fdt_splice(void *fdt, void *splicepoint, int oldlen, int newlen)
  48. {
  49. char *p = splicepoint;
  50. char *end = (char *)fdt + _fdt_data_size(fdt);
  51. if (((p + oldlen) < p) || ((p + oldlen) > end))
  52. return -FDT_ERR_BADOFFSET;
  53. if ((end - oldlen + newlen) > ((char *)fdt + fdt_totalsize(fdt)))
  54. return -FDT_ERR_NOSPACE;
  55. memmove(p + newlen, p + oldlen, end - p - oldlen);
  56. return 0;
  57. }
  58. static int _fdt_splice_mem_rsv(void *fdt, struct fdt_reserve_entry *p,
  59. int oldn, int newn)
  60. {
  61. int delta = (newn - oldn) * sizeof(*p);
  62. int err;
  63. err = _fdt_splice(fdt, p, oldn * sizeof(*p), newn * sizeof(*p));
  64. if (err)
  65. return err;
  66. fdt_set_off_dt_struct(fdt, fdt_off_dt_struct(fdt) + delta);
  67. fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
  68. return 0;
  69. }
  70. static int _fdt_splice_struct(void *fdt, void *p,
  71. int oldlen, int newlen)
  72. {
  73. int delta = newlen - oldlen;
  74. int err;
  75. if ((err = _fdt_splice(fdt, p, oldlen, newlen)))
  76. return err;
  77. fdt_set_size_dt_struct(fdt, fdt_size_dt_struct(fdt) + delta);
  78. fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
  79. return 0;
  80. }
  81. static int _fdt_splice_string(void *fdt, int newlen)
  82. {
  83. void *p = (char *)fdt
  84. + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  85. int err;
  86. if ((err = _fdt_splice(fdt, p, 0, newlen)))
  87. return err;
  88. fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen);
  89. return 0;
  90. }
  91. static int _fdt_find_add_string(void *fdt, const char *s)
  92. {
  93. char *strtab = (char *)fdt + fdt_off_dt_strings(fdt);
  94. const char *p;
  95. char *new;
  96. int len = strlen(s) + 1;
  97. int err;
  98. p = _fdt_find_string(strtab, fdt_size_dt_strings(fdt), s);
  99. if (p)
  100. /* found it */
  101. return (p - strtab);
  102. new = strtab + fdt_size_dt_strings(fdt);
  103. err = _fdt_splice_string(fdt, len);
  104. if (err)
  105. return err;
  106. memcpy(new, s, len);
  107. return (new - strtab);
  108. }
  109. int fdt_add_mem_rsv(void *fdt, uint64_t address, uint64_t size)
  110. {
  111. struct fdt_reserve_entry *re;
  112. int err;
  113. FDT_RW_CHECK_HEADER(fdt);
  114. re = _fdt_mem_rsv_w(fdt, fdt_num_mem_rsv(fdt));
  115. err = _fdt_splice_mem_rsv(fdt, re, 0, 1);
  116. if (err)
  117. return err;
  118. re->address = cpu_to_fdt64(address);
  119. re->size = cpu_to_fdt64(size);
  120. return 0;
  121. }
  122. int fdt_del_mem_rsv(void *fdt, int n)
  123. {
  124. struct fdt_reserve_entry *re = _fdt_mem_rsv_w(fdt, n);
  125. int err;
  126. FDT_RW_CHECK_HEADER(fdt);
  127. if (n >= fdt_num_mem_rsv(fdt))
  128. return -FDT_ERR_NOTFOUND;
  129. err = _fdt_splice_mem_rsv(fdt, re, 1, 0);
  130. if (err)
  131. return err;
  132. return 0;
  133. }
  134. static int _fdt_resize_property(void *fdt, int nodeoffset, const char *name,
  135. int len, struct fdt_property **prop)
  136. {
  137. int oldlen;
  138. int err;
  139. *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
  140. if (! (*prop))
  141. return oldlen;
  142. if ((err = _fdt_splice_struct(fdt, (*prop)->data, FDT_TAGALIGN(oldlen),
  143. FDT_TAGALIGN(len))))
  144. return err;
  145. (*prop)->len = cpu_to_fdt32(len);
  146. return 0;
  147. }
  148. static int _fdt_add_property(void *fdt, int nodeoffset, const char *name,
  149. int len, struct fdt_property **prop)
  150. {
  151. int proplen;
  152. int nextoffset;
  153. int namestroff;
  154. int err;
  155. if ((nextoffset = _fdt_check_node_offset(fdt, nodeoffset)) < 0)
  156. return nextoffset;
  157. namestroff = _fdt_find_add_string(fdt, name);
  158. if (namestroff < 0)
  159. return namestroff;
  160. *prop = _fdt_offset_ptr_w(fdt, nextoffset);
  161. proplen = sizeof(**prop) + FDT_TAGALIGN(len);
  162. err = _fdt_splice_struct(fdt, *prop, 0, proplen);
  163. if (err)
  164. return err;
  165. (*prop)->tag = cpu_to_fdt32(FDT_PROP);
  166. (*prop)->nameoff = cpu_to_fdt32(namestroff);
  167. (*prop)->len = cpu_to_fdt32(len);
  168. return 0;
  169. }
  170. int fdt_set_name(void *fdt, int nodeoffset, const char *name)
  171. {
  172. char *namep;
  173. int oldlen, newlen;
  174. int err;
  175. FDT_RW_CHECK_HEADER(fdt);
  176. namep = (char *)(uintptr_t)fdt_get_name(fdt, nodeoffset, &oldlen);
  177. if (!namep)
  178. return oldlen;
  179. newlen = strlen(name);
  180. err = _fdt_splice_struct(fdt, namep, FDT_TAGALIGN(oldlen+1),
  181. FDT_TAGALIGN(newlen+1));
  182. if (err)
  183. return err;
  184. memcpy(namep, name, newlen+1);
  185. return 0;
  186. }
  187. int fdt_setprop(void *fdt, int nodeoffset, const char *name,
  188. const void *val, int len)
  189. {
  190. struct fdt_property *prop;
  191. int err;
  192. FDT_RW_CHECK_HEADER(fdt);
  193. err = _fdt_resize_property(fdt, nodeoffset, name, len, &prop);
  194. if (err == -FDT_ERR_NOTFOUND)
  195. err = _fdt_add_property(fdt, nodeoffset, name, len, &prop);
  196. if (err)
  197. return err;
  198. memcpy(prop->data, val, len);
  199. return 0;
  200. }
  201. int fdt_appendprop(void *fdt, int nodeoffset, const char *name,
  202. const void *val, int len)
  203. {
  204. struct fdt_property *prop;
  205. int err, oldlen, newlen;
  206. FDT_RW_CHECK_HEADER(fdt);
  207. prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
  208. if (prop) {
  209. newlen = len + oldlen;
  210. err = _fdt_splice_struct(fdt, prop->data,
  211. FDT_TAGALIGN(oldlen),
  212. FDT_TAGALIGN(newlen));
  213. if (err)
  214. return err;
  215. prop->len = cpu_to_fdt32(newlen);
  216. memcpy(prop->data + oldlen, val, len);
  217. } else {
  218. err = _fdt_add_property(fdt, nodeoffset, name, len, &prop);
  219. if (err)
  220. return err;
  221. memcpy(prop->data, val, len);
  222. }
  223. return 0;
  224. }
  225. int fdt_delprop(void *fdt, int nodeoffset, const char *name)
  226. {
  227. struct fdt_property *prop;
  228. int len, proplen;
  229. FDT_RW_CHECK_HEADER(fdt);
  230. prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
  231. if (! prop)
  232. return len;
  233. proplen = sizeof(*prop) + FDT_TAGALIGN(len);
  234. return _fdt_splice_struct(fdt, prop, proplen, 0);
  235. }
  236. int fdt_add_subnode_namelen(void *fdt, int parentoffset,
  237. const char *name, int namelen)
  238. {
  239. struct fdt_node_header *nh;
  240. int offset, nextoffset;
  241. int nodelen;
  242. int err;
  243. uint32_t tag;
  244. fdt32_t *endtag;
  245. FDT_RW_CHECK_HEADER(fdt);
  246. offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
  247. if (offset >= 0)
  248. return -FDT_ERR_EXISTS;
  249. else if (offset != -FDT_ERR_NOTFOUND)
  250. return offset;
  251. /* Try to place the new node after the parent's properties */
  252. fdt_next_tag(fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */
  253. do {
  254. offset = nextoffset;
  255. tag = fdt_next_tag(fdt, offset, &nextoffset);
  256. } while ((tag == FDT_PROP) || (tag == FDT_NOP));
  257. nh = _fdt_offset_ptr_w(fdt, offset);
  258. nodelen = sizeof(*nh) + FDT_TAGALIGN(namelen+1) + FDT_TAGSIZE;
  259. err = _fdt_splice_struct(fdt, nh, 0, nodelen);
  260. if (err)
  261. return err;
  262. nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
  263. memset(nh->name, 0, FDT_TAGALIGN(namelen+1));
  264. memcpy(nh->name, name, namelen);
  265. endtag = (fdt32_t *)((char *)nh + nodelen - FDT_TAGSIZE);
  266. *endtag = cpu_to_fdt32(FDT_END_NODE);
  267. return offset;
  268. }
  269. int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
  270. {
  271. return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
  272. }
  273. int fdt_del_node(void *fdt, int nodeoffset)
  274. {
  275. int endoffset;
  276. FDT_RW_CHECK_HEADER(fdt);
  277. endoffset = _fdt_node_end_offset(fdt, nodeoffset);
  278. if (endoffset < 0)
  279. return endoffset;
  280. return _fdt_splice_struct(fdt, _fdt_offset_ptr_w(fdt, nodeoffset),
  281. endoffset - nodeoffset, 0);
  282. }
  283. static void _fdt_packblocks(const char *old, char *new,
  284. int mem_rsv_size, int struct_size)
  285. {
  286. int mem_rsv_off, struct_off, strings_off;
  287. mem_rsv_off = FDT_ALIGN(sizeof(struct fdt_header), 8);
  288. struct_off = mem_rsv_off + mem_rsv_size;
  289. strings_off = struct_off + struct_size;
  290. memmove(new + mem_rsv_off, old + fdt_off_mem_rsvmap(old), mem_rsv_size);
  291. fdt_set_off_mem_rsvmap(new, mem_rsv_off);
  292. memmove(new + struct_off, old + fdt_off_dt_struct(old), struct_size);
  293. fdt_set_off_dt_struct(new, struct_off);
  294. fdt_set_size_dt_struct(new, struct_size);
  295. memmove(new + strings_off, old + fdt_off_dt_strings(old),
  296. fdt_size_dt_strings(old));
  297. fdt_set_off_dt_strings(new, strings_off);
  298. fdt_set_size_dt_strings(new, fdt_size_dt_strings(old));
  299. }
  300. int fdt_open_into(const void *fdt, void *buf, int bufsize)
  301. {
  302. int err;
  303. int mem_rsv_size, struct_size;
  304. int newsize;
  305. const char *fdtstart = fdt;
  306. const char *fdtend = fdtstart + fdt_totalsize(fdt);
  307. char *tmp;
  308. FDT_CHECK_HEADER(fdt);
  309. mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
  310. * sizeof(struct fdt_reserve_entry);
  311. if (fdt_version(fdt) >= 17) {
  312. struct_size = fdt_size_dt_struct(fdt);
  313. } else {
  314. struct_size = 0;
  315. while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END)
  316. ;
  317. if (struct_size < 0)
  318. return struct_size;
  319. }
  320. if (!_fdt_blocks_misordered(fdt, mem_rsv_size, struct_size)) {
  321. /* no further work necessary */
  322. err = fdt_move(fdt, buf, bufsize);
  323. if (err)
  324. return err;
  325. fdt_set_version(buf, 17);
  326. fdt_set_size_dt_struct(buf, struct_size);
  327. fdt_set_totalsize(buf, bufsize);
  328. return 0;
  329. }
  330. /* Need to reorder */
  331. newsize = FDT_ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size
  332. + struct_size + fdt_size_dt_strings(fdt);
  333. if (bufsize < newsize)
  334. return -FDT_ERR_NOSPACE;
  335. /* First attempt to build converted tree at beginning of buffer */
  336. tmp = buf;
  337. /* But if that overlaps with the old tree... */
  338. if (((tmp + newsize) > fdtstart) && (tmp < fdtend)) {
  339. /* Try right after the old tree instead */
  340. tmp = (char *)(uintptr_t)fdtend;
  341. if ((tmp + newsize) > ((char *)buf + bufsize))
  342. return -FDT_ERR_NOSPACE;
  343. }
  344. _fdt_packblocks(fdt, tmp, mem_rsv_size, struct_size);
  345. memmove(buf, tmp, newsize);
  346. fdt_set_magic(buf, FDT_MAGIC);
  347. fdt_set_totalsize(buf, bufsize);
  348. fdt_set_version(buf, 17);
  349. fdt_set_last_comp_version(buf, 16);
  350. fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt));
  351. return 0;
  352. }
  353. int fdt_pack(void *fdt)
  354. {
  355. int mem_rsv_size;
  356. FDT_RW_CHECK_HEADER(fdt);
  357. mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
  358. * sizeof(struct fdt_reserve_entry);
  359. _fdt_packblocks(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt));
  360. fdt_set_totalsize(fdt, _fdt_data_size(fdt));
  361. return 0;
  362. }