fdt_rw.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492
  1. // SPDX-License-Identifier: (GPL-2.0-or-later OR BSD-2-Clause)
  2. /*
  3. * libfdt - Flat Device Tree manipulation
  4. * Copyright (C) 2006 David Gibson, IBM Corporation.
  5. */
  6. #include "libfdt_env.h"
  7. #include <fdt.h>
  8. #include <libfdt.h>
  9. #include "libfdt_internal.h"
  10. static int fdt_blocks_misordered_(const void *fdt,
  11. int mem_rsv_size, int struct_size)
  12. {
  13. if (!fdt_chk_basic())
  14. return false;
  15. return (fdt_off_mem_rsvmap(fdt) < FDT_ALIGN(sizeof(struct fdt_header), 8))
  16. || (fdt_off_dt_struct(fdt) <
  17. (fdt_off_mem_rsvmap(fdt) + mem_rsv_size))
  18. || (fdt_off_dt_strings(fdt) <
  19. (fdt_off_dt_struct(fdt) + struct_size))
  20. || (fdt_totalsize(fdt) <
  21. (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt)));
  22. }
  23. static int fdt_rw_probe_(void *fdt)
  24. {
  25. if (!fdt_chk_basic())
  26. return 0;
  27. FDT_RO_PROBE(fdt);
  28. if (fdt_chk_version() && 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_chk_version() && fdt_version(fdt) > 17)
  34. fdt_set_version(fdt, 17);
  35. return 0;
  36. }
  37. #define FDT_RW_PROBE(fdt) \
  38. { \
  39. int err_; \
  40. if (fdt_chk_extra() && (err_ = fdt_rw_probe_(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. /* Must only be used to roll back in case of error */
  84. static void fdt_del_last_string_(void *fdt, const char *s)
  85. {
  86. int newlen = strlen(s) + 1;
  87. fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) - newlen);
  88. }
  89. static int fdt_splice_string_(void *fdt, int newlen)
  90. {
  91. void *p = (char *)fdt
  92. + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  93. int err;
  94. if ((err = fdt_splice_(fdt, p, 0, newlen)))
  95. return err;
  96. fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen);
  97. return 0;
  98. }
  99. /**
  100. * fdt_find_add_string_() - Find or allocate a string
  101. *
  102. * @fdt: pointer to the device tree to check/adjust
  103. * @s: string to find/add
  104. * @allocated: Set to 0 if the string was found, 1 if not found and so
  105. * allocated. Ignored if !fdt_chk_basic()
  106. * @return offset of string in the string table (whether found or added)
  107. */
  108. static int fdt_find_add_string_(void *fdt, const char *s, int *allocated)
  109. {
  110. char *strtab = (char *)fdt + fdt_off_dt_strings(fdt);
  111. const char *p;
  112. char *new;
  113. int len = strlen(s) + 1;
  114. int err;
  115. if (fdt_chk_basic())
  116. *allocated = 0;
  117. p = fdt_find_string_(strtab, fdt_size_dt_strings(fdt), s);
  118. if (p)
  119. /* found it */
  120. return (p - strtab);
  121. new = strtab + fdt_size_dt_strings(fdt);
  122. err = fdt_splice_string_(fdt, len);
  123. if (err)
  124. return err;
  125. if (fdt_chk_basic())
  126. *allocated = 1;
  127. memcpy(new, s, len);
  128. return (new - strtab);
  129. }
  130. int fdt_add_mem_rsv(void *fdt, uint64_t address, uint64_t size)
  131. {
  132. struct fdt_reserve_entry *re;
  133. int err;
  134. FDT_RW_PROBE(fdt);
  135. re = fdt_mem_rsv_w_(fdt, fdt_num_mem_rsv(fdt));
  136. err = fdt_splice_mem_rsv_(fdt, re, 0, 1);
  137. if (err)
  138. return err;
  139. re->address = cpu_to_fdt64(address);
  140. re->size = cpu_to_fdt64(size);
  141. return 0;
  142. }
  143. int fdt_del_mem_rsv(void *fdt, int n)
  144. {
  145. struct fdt_reserve_entry *re = fdt_mem_rsv_w_(fdt, n);
  146. FDT_RW_PROBE(fdt);
  147. if (n >= fdt_num_mem_rsv(fdt))
  148. return -FDT_ERR_NOTFOUND;
  149. return fdt_splice_mem_rsv_(fdt, re, 1, 0);
  150. }
  151. static int fdt_resize_property_(void *fdt, int nodeoffset, const char *name,
  152. int len, struct fdt_property **prop)
  153. {
  154. int oldlen;
  155. int err;
  156. *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
  157. if (!*prop)
  158. return oldlen;
  159. if ((err = fdt_splice_struct_(fdt, (*prop)->data, FDT_TAGALIGN(oldlen),
  160. FDT_TAGALIGN(len))))
  161. return err;
  162. (*prop)->len = cpu_to_fdt32(len);
  163. return 0;
  164. }
  165. static int fdt_add_property_(void *fdt, int nodeoffset, const char *name,
  166. int len, struct fdt_property **prop)
  167. {
  168. int proplen;
  169. int nextoffset;
  170. int namestroff;
  171. int err;
  172. int allocated;
  173. if ((nextoffset = fdt_check_node_offset_(fdt, nodeoffset)) < 0)
  174. return nextoffset;
  175. namestroff = fdt_find_add_string_(fdt, name, &allocated);
  176. if (namestroff < 0)
  177. return namestroff;
  178. *prop = fdt_offset_ptr_w_(fdt, nextoffset);
  179. proplen = sizeof(**prop) + FDT_TAGALIGN(len);
  180. err = fdt_splice_struct_(fdt, *prop, 0, proplen);
  181. if (err) {
  182. /* Delete the string if we failed to add it */
  183. if (fdt_chk_basic() && allocated)
  184. fdt_del_last_string_(fdt, name);
  185. return err;
  186. }
  187. (*prop)->tag = cpu_to_fdt32(FDT_PROP);
  188. (*prop)->nameoff = cpu_to_fdt32(namestroff);
  189. (*prop)->len = cpu_to_fdt32(len);
  190. return 0;
  191. }
  192. int fdt_set_name(void *fdt, int nodeoffset, const char *name)
  193. {
  194. char *namep;
  195. int oldlen, newlen;
  196. int err;
  197. FDT_RW_PROBE(fdt);
  198. namep = (char *)(uintptr_t)fdt_get_name(fdt, nodeoffset, &oldlen);
  199. if (!namep)
  200. return oldlen;
  201. newlen = strlen(name);
  202. err = fdt_splice_struct_(fdt, namep, FDT_TAGALIGN(oldlen+1),
  203. FDT_TAGALIGN(newlen+1));
  204. if (err)
  205. return err;
  206. memcpy(namep, name, newlen+1);
  207. return 0;
  208. }
  209. int fdt_setprop_placeholder(void *fdt, int nodeoffset, const char *name,
  210. int len, void **prop_data)
  211. {
  212. struct fdt_property *prop;
  213. int err;
  214. FDT_RW_PROBE(fdt);
  215. err = fdt_resize_property_(fdt, nodeoffset, name, len, &prop);
  216. if (err == -FDT_ERR_NOTFOUND)
  217. err = fdt_add_property_(fdt, nodeoffset, name, len, &prop);
  218. if (err)
  219. return err;
  220. *prop_data = prop->data;
  221. return 0;
  222. }
  223. int fdt_setprop(void *fdt, int nodeoffset, const char *name,
  224. const void *val, int len)
  225. {
  226. void *prop_data;
  227. int err;
  228. err = fdt_setprop_placeholder(fdt, nodeoffset, name, len, &prop_data);
  229. if (err)
  230. return err;
  231. if (len)
  232. memcpy(prop_data, val, len);
  233. return 0;
  234. }
  235. int fdt_appendprop(void *fdt, int nodeoffset, const char *name,
  236. const void *val, int len)
  237. {
  238. struct fdt_property *prop;
  239. int err, oldlen, newlen;
  240. FDT_RW_PROBE(fdt);
  241. prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
  242. if (prop) {
  243. newlen = len + oldlen;
  244. err = fdt_splice_struct_(fdt, prop->data,
  245. FDT_TAGALIGN(oldlen),
  246. FDT_TAGALIGN(newlen));
  247. if (err)
  248. return err;
  249. prop->len = cpu_to_fdt32(newlen);
  250. memcpy(prop->data + oldlen, val, len);
  251. } else {
  252. err = fdt_add_property_(fdt, nodeoffset, name, len, &prop);
  253. if (err)
  254. return err;
  255. memcpy(prop->data, val, len);
  256. }
  257. return 0;
  258. }
  259. int fdt_delprop(void *fdt, int nodeoffset, const char *name)
  260. {
  261. struct fdt_property *prop;
  262. int len, proplen;
  263. FDT_RW_PROBE(fdt);
  264. prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
  265. if (!prop)
  266. return len;
  267. proplen = sizeof(*prop) + FDT_TAGALIGN(len);
  268. return fdt_splice_struct_(fdt, prop, proplen, 0);
  269. }
  270. int fdt_add_subnode_namelen(void *fdt, int parentoffset,
  271. const char *name, int namelen)
  272. {
  273. struct fdt_node_header *nh;
  274. int offset, nextoffset;
  275. int nodelen;
  276. int err;
  277. uint32_t tag;
  278. fdt32_t *endtag;
  279. FDT_RW_PROBE(fdt);
  280. offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
  281. if (offset >= 0)
  282. return -FDT_ERR_EXISTS;
  283. else if (offset != -FDT_ERR_NOTFOUND)
  284. return offset;
  285. /* Try to place the new node after the parent's properties */
  286. fdt_next_tag(fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */
  287. do {
  288. offset = nextoffset;
  289. tag = fdt_next_tag(fdt, offset, &nextoffset);
  290. } while ((tag == FDT_PROP) || (tag == FDT_NOP));
  291. nh = fdt_offset_ptr_w_(fdt, offset);
  292. nodelen = sizeof(*nh) + FDT_TAGALIGN(namelen+1) + FDT_TAGSIZE;
  293. err = fdt_splice_struct_(fdt, nh, 0, nodelen);
  294. if (err)
  295. return err;
  296. nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
  297. memset(nh->name, 0, FDT_TAGALIGN(namelen+1));
  298. memcpy(nh->name, name, namelen);
  299. endtag = (fdt32_t *)((char *)nh + nodelen - FDT_TAGSIZE);
  300. *endtag = cpu_to_fdt32(FDT_END_NODE);
  301. return offset;
  302. }
  303. int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
  304. {
  305. return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
  306. }
  307. int fdt_del_node(void *fdt, int nodeoffset)
  308. {
  309. int endoffset;
  310. FDT_RW_PROBE(fdt);
  311. endoffset = fdt_node_end_offset_(fdt, nodeoffset);
  312. if (endoffset < 0)
  313. return endoffset;
  314. return fdt_splice_struct_(fdt, fdt_offset_ptr_w_(fdt, nodeoffset),
  315. endoffset - nodeoffset, 0);
  316. }
  317. static void fdt_packblocks_(const char *old, char *new,
  318. int mem_rsv_size, int struct_size)
  319. {
  320. int mem_rsv_off, struct_off, strings_off;
  321. mem_rsv_off = FDT_ALIGN(sizeof(struct fdt_header), 8);
  322. struct_off = mem_rsv_off + mem_rsv_size;
  323. strings_off = struct_off + struct_size;
  324. memmove(new + mem_rsv_off, old + fdt_off_mem_rsvmap(old), mem_rsv_size);
  325. fdt_set_off_mem_rsvmap(new, mem_rsv_off);
  326. memmove(new + struct_off, old + fdt_off_dt_struct(old), struct_size);
  327. fdt_set_off_dt_struct(new, struct_off);
  328. fdt_set_size_dt_struct(new, struct_size);
  329. memmove(new + strings_off, old + fdt_off_dt_strings(old),
  330. fdt_size_dt_strings(old));
  331. fdt_set_off_dt_strings(new, strings_off);
  332. fdt_set_size_dt_strings(new, fdt_size_dt_strings(old));
  333. }
  334. int fdt_open_into(const void *fdt, void *buf, int bufsize)
  335. {
  336. int err;
  337. int mem_rsv_size, struct_size;
  338. int newsize;
  339. const char *fdtstart = fdt;
  340. const char *fdtend = fdtstart + fdt_totalsize(fdt);
  341. char *tmp;
  342. FDT_RO_PROBE(fdt);
  343. mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
  344. * sizeof(struct fdt_reserve_entry);
  345. if (!fdt_chk_version() || fdt_version(fdt) >= 17) {
  346. struct_size = fdt_size_dt_struct(fdt);
  347. } else {
  348. struct_size = 0;
  349. while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END)
  350. ;
  351. if (struct_size < 0)
  352. return struct_size;
  353. }
  354. if (!fdt_blocks_misordered_(fdt, mem_rsv_size, struct_size)) {
  355. /* no further work necessary */
  356. err = fdt_move(fdt, buf, bufsize);
  357. if (err)
  358. return err;
  359. fdt_set_version(buf, 17);
  360. fdt_set_size_dt_struct(buf, struct_size);
  361. fdt_set_totalsize(buf, bufsize);
  362. return 0;
  363. }
  364. /* Need to reorder */
  365. newsize = FDT_ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size
  366. + struct_size + fdt_size_dt_strings(fdt);
  367. if (bufsize < newsize)
  368. return -FDT_ERR_NOSPACE;
  369. /* First attempt to build converted tree at beginning of buffer */
  370. tmp = buf;
  371. /* But if that overlaps with the old tree... */
  372. if (((tmp + newsize) > fdtstart) && (tmp < fdtend)) {
  373. /* Try right after the old tree instead */
  374. tmp = (char *)(uintptr_t)fdtend;
  375. if ((tmp + newsize) > ((char *)buf + bufsize))
  376. return -FDT_ERR_NOSPACE;
  377. }
  378. fdt_packblocks_(fdt, tmp, mem_rsv_size, struct_size);
  379. memmove(buf, tmp, newsize);
  380. fdt_set_magic(buf, FDT_MAGIC);
  381. fdt_set_totalsize(buf, bufsize);
  382. fdt_set_version(buf, 17);
  383. fdt_set_last_comp_version(buf, 16);
  384. fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt));
  385. return 0;
  386. }
  387. int fdt_pack(void *fdt)
  388. {
  389. int mem_rsv_size;
  390. FDT_RW_PROBE(fdt);
  391. mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
  392. * sizeof(struct fdt_reserve_entry);
  393. fdt_packblocks_(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt));
  394. fdt_set_totalsize(fdt, fdt_data_size_(fdt));
  395. return 0;
  396. }