fdt_rw.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507
  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. return (fdt_off_mem_rsvmap(fdt) < FDT_ALIGN(sizeof(struct fdt_header), 8))
  14. || (fdt_off_dt_struct(fdt) <
  15. (fdt_off_mem_rsvmap(fdt) + mem_rsv_size))
  16. || (fdt_off_dt_strings(fdt) <
  17. (fdt_off_dt_struct(fdt) + struct_size))
  18. || (fdt_totalsize(fdt) <
  19. (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt)));
  20. }
  21. static int fdt_rw_probe_(void *fdt)
  22. {
  23. if (can_assume(VALID_DTB))
  24. return 0;
  25. FDT_RO_PROBE(fdt);
  26. if (!can_assume(LATEST) && fdt_version(fdt) < 17)
  27. return -FDT_ERR_BADVERSION;
  28. if (fdt_blocks_misordered_(fdt, sizeof(struct fdt_reserve_entry),
  29. fdt_size_dt_struct(fdt)))
  30. return -FDT_ERR_BADLAYOUT;
  31. if (!can_assume(LATEST) && fdt_version(fdt) > 17)
  32. fdt_set_version(fdt, 17);
  33. return 0;
  34. }
  35. #define FDT_RW_PROBE(fdt) \
  36. { \
  37. int err_; \
  38. if ((err_ = fdt_rw_probe_(fdt)) != 0) \
  39. return err_; \
  40. }
  41. static inline unsigned int fdt_data_size_(void *fdt)
  42. {
  43. return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  44. }
  45. static int fdt_splice_(void *fdt, void *splicepoint, int oldlen, int newlen)
  46. {
  47. char *p = splicepoint;
  48. unsigned int dsize = fdt_data_size_(fdt);
  49. size_t soff = p - (char *)fdt;
  50. if ((oldlen < 0) || (soff + oldlen < soff) || (soff + oldlen > dsize))
  51. return -FDT_ERR_BADOFFSET;
  52. if ((p < (char *)fdt) || (dsize + newlen < (unsigned)oldlen))
  53. return -FDT_ERR_BADOFFSET;
  54. if (dsize - oldlen + newlen > fdt_totalsize(fdt))
  55. return -FDT_ERR_NOSPACE;
  56. memmove(p + newlen, p + oldlen, ((char *)fdt + dsize) - (p + oldlen));
  57. return 0;
  58. }
  59. static int fdt_splice_mem_rsv_(void *fdt, struct fdt_reserve_entry *p,
  60. int oldn, int newn)
  61. {
  62. int delta = (newn - oldn) * sizeof(*p);
  63. int err;
  64. err = fdt_splice_(fdt, p, oldn * sizeof(*p), newn * sizeof(*p));
  65. if (err)
  66. return err;
  67. fdt_set_off_dt_struct(fdt, fdt_off_dt_struct(fdt) + delta);
  68. fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
  69. return 0;
  70. }
  71. static int fdt_splice_struct_(void *fdt, void *p,
  72. int oldlen, int newlen)
  73. {
  74. int delta = newlen - oldlen;
  75. int err;
  76. if ((err = fdt_splice_(fdt, p, oldlen, newlen)))
  77. return err;
  78. fdt_set_size_dt_struct(fdt, fdt_size_dt_struct(fdt) + delta);
  79. fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
  80. return 0;
  81. }
  82. /* Must only be used to roll back in case of error */
  83. static void fdt_del_last_string_(void *fdt, const char *s)
  84. {
  85. int newlen = strlen(s) + 1;
  86. fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) - newlen);
  87. }
  88. static int fdt_splice_string_(void *fdt, int newlen)
  89. {
  90. void *p = (char *)fdt
  91. + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  92. int err;
  93. if ((err = fdt_splice_(fdt, p, 0, newlen)))
  94. return err;
  95. fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen);
  96. return 0;
  97. }
  98. /**
  99. * fdt_find_add_string_() - Find or allocate a string
  100. *
  101. * @fdt: pointer to the device tree to check/adjust
  102. * @s: string to find/add
  103. * @allocated: Set to 0 if the string was found, 1 if not found and so
  104. * allocated. Ignored if can_assume(NO_ROLLBACK)
  105. * @return offset of string in the string table (whether found or added)
  106. */
  107. static int fdt_find_add_string_(void *fdt, const char *s, int slen,
  108. int *allocated)
  109. {
  110. char *strtab = (char *)fdt + fdt_off_dt_strings(fdt);
  111. const char *p;
  112. char *new;
  113. int err;
  114. if (!can_assume(NO_ROLLBACK))
  115. *allocated = 0;
  116. p = fdt_find_string_len_(strtab, fdt_size_dt_strings(fdt), s, slen);
  117. if (p)
  118. /* found it */
  119. return (p - strtab);
  120. new = strtab + fdt_size_dt_strings(fdt);
  121. err = fdt_splice_string_(fdt, slen + 1);
  122. if (err)
  123. return err;
  124. if (!can_assume(NO_ROLLBACK))
  125. *allocated = 1;
  126. memcpy(new, s, slen);
  127. new[slen] = '\0';
  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,
  152. const char *name, int namelen,
  153. int len, struct fdt_property **prop)
  154. {
  155. int oldlen;
  156. int err;
  157. *prop = fdt_get_property_namelen_w(fdt, nodeoffset, name, namelen,
  158. &oldlen);
  159. if (!*prop)
  160. return oldlen;
  161. if ((err = fdt_splice_struct_(fdt, (*prop)->data, FDT_TAGALIGN(oldlen),
  162. FDT_TAGALIGN(len))))
  163. return err;
  164. (*prop)->len = cpu_to_fdt32(len);
  165. return 0;
  166. }
  167. static int fdt_add_property_(void *fdt, int nodeoffset, const char *name,
  168. int namelen, int len, struct fdt_property **prop)
  169. {
  170. int proplen;
  171. int nextoffset;
  172. int namestroff;
  173. int err;
  174. int allocated;
  175. if ((nextoffset = fdt_check_node_offset_(fdt, nodeoffset)) < 0)
  176. return nextoffset;
  177. namestroff = fdt_find_add_string_(fdt, name, namelen, &allocated);
  178. if (namestroff < 0)
  179. return namestroff;
  180. *prop = fdt_offset_ptr_w_(fdt, nextoffset);
  181. proplen = sizeof(**prop) + FDT_TAGALIGN(len);
  182. err = fdt_splice_struct_(fdt, *prop, 0, proplen);
  183. if (err) {
  184. /* Delete the string if we failed to add it */
  185. if (!can_assume(NO_ROLLBACK) && allocated)
  186. fdt_del_last_string_(fdt, name);
  187. return err;
  188. }
  189. (*prop)->tag = cpu_to_fdt32(FDT_PROP);
  190. (*prop)->nameoff = cpu_to_fdt32(namestroff);
  191. (*prop)->len = cpu_to_fdt32(len);
  192. return 0;
  193. }
  194. int fdt_set_name(void *fdt, int nodeoffset, const char *name)
  195. {
  196. char *namep;
  197. int oldlen, newlen;
  198. int err;
  199. FDT_RW_PROBE(fdt);
  200. namep = (char *)(uintptr_t)fdt_get_name(fdt, nodeoffset, &oldlen);
  201. if (!namep)
  202. return oldlen;
  203. newlen = strlen(name);
  204. err = fdt_splice_struct_(fdt, namep, FDT_TAGALIGN(oldlen+1),
  205. FDT_TAGALIGN(newlen+1));
  206. if (err)
  207. return err;
  208. memcpy(namep, name, newlen+1);
  209. return 0;
  210. }
  211. int fdt_setprop_placeholder_namelen(void *fdt, int nodeoffset, const char *name,
  212. int namelen, int len, void **prop_data)
  213. {
  214. struct fdt_property *prop;
  215. int err;
  216. FDT_RW_PROBE(fdt);
  217. err = fdt_resize_property_(fdt, nodeoffset, name, namelen, len, &prop);
  218. if (err == -FDT_ERR_NOTFOUND)
  219. err = fdt_add_property_(fdt, nodeoffset, name, namelen, len,
  220. &prop);
  221. if (err)
  222. return err;
  223. *prop_data = prop->data;
  224. return 0;
  225. }
  226. int fdt_setprop_namelen(void *fdt, int nodeoffset, const char *name,
  227. int namelen, const void *val, int len)
  228. {
  229. void *prop_data;
  230. int err;
  231. err = fdt_setprop_placeholder_namelen(fdt, nodeoffset, name, namelen,
  232. len, &prop_data);
  233. if (err)
  234. return err;
  235. if (len)
  236. memcpy(prop_data, val, len);
  237. return 0;
  238. }
  239. int fdt_appendprop(void *fdt, int nodeoffset, const char *name,
  240. const void *val, int len)
  241. {
  242. struct fdt_property *prop;
  243. int err, oldlen, newlen;
  244. FDT_RW_PROBE(fdt);
  245. prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
  246. if (prop) {
  247. newlen = len + oldlen;
  248. err = fdt_splice_struct_(fdt, prop->data,
  249. FDT_TAGALIGN(oldlen),
  250. FDT_TAGALIGN(newlen));
  251. if (err)
  252. return err;
  253. prop->len = cpu_to_fdt32(newlen);
  254. memcpy(prop->data + oldlen, val, len);
  255. } else {
  256. err = fdt_add_property_(fdt, nodeoffset, name, strlen(name),
  257. len, &prop);
  258. if (err)
  259. return err;
  260. memcpy(prop->data, val, len);
  261. }
  262. return 0;
  263. }
  264. int fdt_delprop(void *fdt, int nodeoffset, const char *name)
  265. {
  266. struct fdt_property *prop;
  267. int len, proplen;
  268. FDT_RW_PROBE(fdt);
  269. prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
  270. if (!prop)
  271. return len;
  272. proplen = sizeof(*prop) + FDT_TAGALIGN(len);
  273. return fdt_splice_struct_(fdt, prop, proplen, 0);
  274. }
  275. int fdt_add_subnode_namelen(void *fdt, int parentoffset,
  276. const char *name, int namelen)
  277. {
  278. struct fdt_node_header *nh;
  279. int offset, nextoffset;
  280. int nodelen;
  281. int err;
  282. uint32_t tag;
  283. fdt32_t *endtag;
  284. FDT_RW_PROBE(fdt);
  285. offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
  286. if (offset >= 0)
  287. return -FDT_ERR_EXISTS;
  288. else if (offset != -FDT_ERR_NOTFOUND)
  289. return offset;
  290. /* Try to place the new node after the parent's properties */
  291. tag = fdt_next_tag(fdt, parentoffset, &nextoffset);
  292. /* the fdt_subnode_offset_namelen() should ensure this never hits */
  293. if (!can_assume(LIBFDT_FLAWLESS) && (tag != FDT_BEGIN_NODE))
  294. return -FDT_ERR_INTERNAL;
  295. do {
  296. offset = nextoffset;
  297. tag = fdt_next_tag(fdt, offset, &nextoffset);
  298. } while ((tag == FDT_PROP) || (tag == FDT_NOP));
  299. nh = fdt_offset_ptr_w_(fdt, offset);
  300. nodelen = sizeof(*nh) + FDT_TAGALIGN(namelen+1) + FDT_TAGSIZE;
  301. err = fdt_splice_struct_(fdt, nh, 0, nodelen);
  302. if (err)
  303. return err;
  304. nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
  305. memset(nh->name, 0, FDT_TAGALIGN(namelen+1));
  306. memcpy(nh->name, name, namelen);
  307. endtag = (fdt32_t *)((char *)nh + nodelen - FDT_TAGSIZE);
  308. *endtag = cpu_to_fdt32(FDT_END_NODE);
  309. return offset;
  310. }
  311. int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
  312. {
  313. return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
  314. }
  315. int fdt_del_node(void *fdt, int nodeoffset)
  316. {
  317. int endoffset;
  318. FDT_RW_PROBE(fdt);
  319. endoffset = fdt_node_end_offset_(fdt, nodeoffset);
  320. if (endoffset < 0)
  321. return endoffset;
  322. return fdt_splice_struct_(fdt, fdt_offset_ptr_w_(fdt, nodeoffset),
  323. endoffset - nodeoffset, 0);
  324. }
  325. static void fdt_packblocks_(const char *old, char *new,
  326. int mem_rsv_size,
  327. int struct_size,
  328. int strings_size)
  329. {
  330. int mem_rsv_off, struct_off, strings_off;
  331. mem_rsv_off = FDT_ALIGN(sizeof(struct fdt_header), 8);
  332. struct_off = mem_rsv_off + mem_rsv_size;
  333. strings_off = struct_off + struct_size;
  334. memmove(new + mem_rsv_off, old + fdt_off_mem_rsvmap(old), mem_rsv_size);
  335. fdt_set_off_mem_rsvmap(new, mem_rsv_off);
  336. memmove(new + struct_off, old + fdt_off_dt_struct(old), struct_size);
  337. fdt_set_off_dt_struct(new, struct_off);
  338. fdt_set_size_dt_struct(new, struct_size);
  339. memmove(new + strings_off, old + fdt_off_dt_strings(old), strings_size);
  340. fdt_set_off_dt_strings(new, strings_off);
  341. fdt_set_size_dt_strings(new, fdt_size_dt_strings(old));
  342. }
  343. int fdt_open_into(const void *fdt, void *buf, int bufsize)
  344. {
  345. int err;
  346. int mem_rsv_size, struct_size;
  347. int newsize;
  348. const char *fdtstart = fdt;
  349. const char *fdtend = fdtstart + fdt_totalsize(fdt);
  350. char *tmp;
  351. FDT_RO_PROBE(fdt);
  352. mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
  353. * sizeof(struct fdt_reserve_entry);
  354. if (can_assume(LATEST) || fdt_version(fdt) >= 17) {
  355. struct_size = fdt_size_dt_struct(fdt);
  356. } else if (fdt_version(fdt) == 16) {
  357. struct_size = 0;
  358. while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END)
  359. ;
  360. if (struct_size < 0)
  361. return struct_size;
  362. } else {
  363. return -FDT_ERR_BADVERSION;
  364. }
  365. if (can_assume(LIBFDT_ORDER) ||
  366. !fdt_blocks_misordered_(fdt, mem_rsv_size, struct_size)) {
  367. /* no further work necessary */
  368. err = fdt_move(fdt, buf, bufsize);
  369. if (err)
  370. return err;
  371. fdt_set_version(buf, 17);
  372. fdt_set_size_dt_struct(buf, struct_size);
  373. fdt_set_totalsize(buf, bufsize);
  374. return 0;
  375. }
  376. /* Need to reorder */
  377. newsize = FDT_ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size
  378. + struct_size + fdt_size_dt_strings(fdt);
  379. if (bufsize < newsize)
  380. return -FDT_ERR_NOSPACE;
  381. /* First attempt to build converted tree at beginning of buffer */
  382. tmp = buf;
  383. /* But if that overlaps with the old tree... */
  384. if (((tmp + newsize) > fdtstart) && (tmp < fdtend)) {
  385. /* Try right after the old tree instead */
  386. tmp = (char *)(uintptr_t)fdtend;
  387. if ((tmp + newsize) > ((char *)buf + bufsize))
  388. return -FDT_ERR_NOSPACE;
  389. }
  390. fdt_packblocks_(fdt, tmp, mem_rsv_size, struct_size,
  391. fdt_size_dt_strings(fdt));
  392. memmove(buf, tmp, newsize);
  393. fdt_set_magic(buf, FDT_MAGIC);
  394. fdt_set_totalsize(buf, bufsize);
  395. fdt_set_version(buf, 17);
  396. fdt_set_last_comp_version(buf, 16);
  397. fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt));
  398. return 0;
  399. }
  400. int fdt_pack(void *fdt)
  401. {
  402. int mem_rsv_size;
  403. FDT_RW_PROBE(fdt);
  404. mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
  405. * sizeof(struct fdt_reserve_entry);
  406. fdt_packblocks_(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt),
  407. fdt_size_dt_strings(fdt));
  408. fdt_set_totalsize(fdt, fdt_data_size_(fdt));
  409. return 0;
  410. }