fdt_rw.c 11 KB

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