fdt_rw.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324
  1. /*
  2. * libfdt - Flat Device Tree manipulation
  3. * Copyright (C) 2006 David Gibson, IBM Corporation.
  4. *
  5. * This library is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU Lesser General Public License
  7. * as published by the Free Software Foundation; either version 2.1 of
  8. * the License, or (at your option) any later version.
  9. *
  10. * This library is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * Lesser General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Lesser General Public
  16. * License along with this library; if not, write to the Free Software
  17. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  18. */
  19. #include "config.h"
  20. #if CONFIG_OF_LIBFDT
  21. #include "libfdt_env.h"
  22. #include <fdt.h>
  23. #include <libfdt.h>
  24. #include "libfdt_internal.h"
  25. static int rw_check_header(void *fdt)
  26. {
  27. int err;
  28. if ((err = fdt_check_header(fdt)))
  29. return err;
  30. if (fdt_version(fdt) < 0x11)
  31. return -FDT_ERR_BADVERSION;
  32. if (fdt_off_mem_rsvmap(fdt) < ALIGN(sizeof(struct fdt_header), 8))
  33. return -FDT_ERR_BADLAYOUT;
  34. if (fdt_off_dt_struct(fdt) <
  35. (fdt_off_mem_rsvmap(fdt) + sizeof(struct fdt_reserve_entry)))
  36. return -FDT_ERR_BADLAYOUT;
  37. if (fdt_off_dt_strings(fdt) <
  38. (fdt_off_dt_struct(fdt) + fdt_size_dt_struct(fdt)))
  39. return -FDT_ERR_BADLAYOUT;
  40. if (fdt_totalsize(fdt) <
  41. (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt)))
  42. return -FDT_ERR_BADLAYOUT;
  43. return 0;
  44. }
  45. #define RW_CHECK_HEADER(fdt) \
  46. { \
  47. int err; \
  48. if ((err = rw_check_header(fdt)) != 0) \
  49. return err; \
  50. }
  51. static inline int _blob_data_size(void *fdt)
  52. {
  53. return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  54. }
  55. static int _blob_splice(void *fdt, void *p, int oldlen, int newlen)
  56. {
  57. void *end = fdt + _blob_data_size(fdt);
  58. if (((p + oldlen) < p) || ((p + oldlen) > end))
  59. return -FDT_ERR_BADOFFSET;
  60. if ((end - oldlen + newlen) > (fdt + fdt_totalsize(fdt)))
  61. return -FDT_ERR_NOSPACE;
  62. memmove(p + newlen, p + oldlen, end - p - oldlen);
  63. return 0;
  64. }
  65. static int _blob_splice_struct(void *fdt, void *p,
  66. int oldlen, int newlen)
  67. {
  68. int delta = newlen - oldlen;
  69. int err;
  70. if ((err = _blob_splice(fdt, p, oldlen, newlen)))
  71. return err;
  72. fdt_set_header(fdt, size_dt_struct, fdt_size_dt_struct(fdt) + delta);
  73. fdt_set_header(fdt, off_dt_strings, fdt_off_dt_strings(fdt) + delta);
  74. return 0;
  75. }
  76. static int _blob_splice_string(void *fdt, int newlen)
  77. {
  78. void *p = fdt + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  79. int err;
  80. if ((err = _blob_splice(fdt, p, 0, newlen)))
  81. return err;
  82. fdt_set_header(fdt, size_dt_strings, fdt_size_dt_strings(fdt) + newlen);
  83. return 0;
  84. }
  85. static int _find_add_string(void *fdt, const char *s)
  86. {
  87. char *strtab = (char *)fdt + fdt_off_dt_strings(fdt);
  88. const char *p;
  89. char *new;
  90. int len = strlen(s) + 1;
  91. int err;
  92. p = _fdt_find_string(strtab, fdt_size_dt_strings(fdt), s);
  93. if (p)
  94. /* found it */
  95. return (p - strtab);
  96. new = strtab + fdt_size_dt_strings(fdt);
  97. err = _blob_splice_string(fdt, len);
  98. if (err)
  99. return err;
  100. memcpy(new, s, len);
  101. return (new - strtab);
  102. }
  103. static int _resize_property(void *fdt, int nodeoffset, const char *name, int len,
  104. struct fdt_property **prop)
  105. {
  106. int oldlen;
  107. int err;
  108. *prop = fdt_get_property(fdt, nodeoffset, name, &oldlen);
  109. if (! (*prop))
  110. return oldlen;
  111. if ((err = _blob_splice_struct(fdt, (*prop)->data,
  112. ALIGN(oldlen, FDT_TAGSIZE),
  113. ALIGN(len, FDT_TAGSIZE))))
  114. return err;
  115. (*prop)->len = cpu_to_fdt32(len);
  116. return 0;
  117. }
  118. static int _add_property(void *fdt, int nodeoffset, const char *name, int len,
  119. struct fdt_property **prop)
  120. {
  121. uint32_t tag;
  122. int proplen;
  123. int nextoffset;
  124. int namestroff;
  125. int err;
  126. tag = fdt_next_tag(fdt, nodeoffset, &nextoffset, NULL);
  127. if (tag != FDT_BEGIN_NODE)
  128. return -FDT_ERR_BADOFFSET;
  129. namestroff = _find_add_string(fdt, name);
  130. if (namestroff < 0)
  131. return namestroff;
  132. *prop = _fdt_offset_ptr(fdt, nextoffset);
  133. proplen = sizeof(**prop) + ALIGN(len, FDT_TAGSIZE);
  134. err = _blob_splice_struct(fdt, *prop, 0, proplen);
  135. if (err)
  136. return err;
  137. (*prop)->tag = cpu_to_fdt32(FDT_PROP);
  138. (*prop)->nameoff = cpu_to_fdt32(namestroff);
  139. (*prop)->len = cpu_to_fdt32(len);
  140. return 0;
  141. }
  142. int fdt_setprop(void *fdt, int nodeoffset, const char *name,
  143. const void *val, int len)
  144. {
  145. struct fdt_property *prop;
  146. int err;
  147. if ((err = rw_check_header(fdt)))
  148. return err;
  149. err = _resize_property(fdt, nodeoffset, name, len, &prop);
  150. if (err == -FDT_ERR_NOTFOUND)
  151. err = _add_property(fdt, nodeoffset, name, len, &prop);
  152. if (err)
  153. return err;
  154. memcpy(prop->data, val, len);
  155. return 0;
  156. }
  157. /**
  158. * fdt_find_and_setprop: Find a node and set it's property
  159. *
  160. * @fdt: ptr to device tree
  161. * @node: path of node
  162. * @prop: property name
  163. * @val: ptr to new value
  164. * @len: length of new property value
  165. * @create: flag to create the property if it doesn't exist
  166. *
  167. * Convenience function to directly set a property given the path to the node.
  168. */
  169. int fdt_find_and_setprop(void *fdt, const char *node, const char *prop,
  170. const void *val, int len, int create)
  171. {
  172. int nodeoff = fdt_find_node_by_path(fdt, node);
  173. if (nodeoff < 0)
  174. return nodeoff;
  175. if ((!create) && (fdt_get_property(fdt, nodeoff, prop, 0) == NULL))
  176. return 0; /* create flag not set; so exit quietly */
  177. return fdt_setprop(fdt, nodeoff, prop, val, len);
  178. }
  179. int fdt_delprop(void *fdt, int nodeoffset, const char *name)
  180. {
  181. struct fdt_property *prop;
  182. int len, proplen;
  183. RW_CHECK_HEADER(fdt);
  184. prop = fdt_get_property(fdt, nodeoffset, name, &len);
  185. if (! prop)
  186. return len;
  187. proplen = sizeof(*prop) + ALIGN(len, FDT_TAGSIZE);
  188. return _blob_splice_struct(fdt, prop, proplen, 0);
  189. }
  190. int fdt_add_subnode_namelen(void *fdt, int parentoffset,
  191. const char *name, int namelen)
  192. {
  193. struct fdt_node_header *nh;
  194. int offset, nextoffset;
  195. int nodelen;
  196. int err;
  197. uint32_t tag;
  198. uint32_t *endtag;
  199. RW_CHECK_HEADER(fdt);
  200. offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
  201. if (offset >= 0)
  202. return -FDT_ERR_EXISTS;
  203. else if (offset != -FDT_ERR_NOTFOUND)
  204. return offset;
  205. /* Try to place the new node after the parent's properties */
  206. fdt_next_tag(fdt, parentoffset, &nextoffset, NULL); /* skip the BEGIN_NODE */
  207. do {
  208. offset = nextoffset;
  209. tag = fdt_next_tag(fdt, offset, &nextoffset, NULL);
  210. } while (tag == FDT_PROP);
  211. nh = _fdt_offset_ptr(fdt, offset);
  212. nodelen = sizeof(*nh) + ALIGN(namelen+1, FDT_TAGSIZE) + FDT_TAGSIZE;
  213. err = _blob_splice_struct(fdt, nh, 0, nodelen);
  214. if (err)
  215. return err;
  216. nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
  217. memset(nh->name, 0, ALIGN(namelen+1, FDT_TAGSIZE));
  218. memcpy(nh->name, name, namelen);
  219. endtag = (uint32_t *)((void *)nh + nodelen - FDT_TAGSIZE);
  220. *endtag = cpu_to_fdt32(FDT_END_NODE);
  221. return offset;
  222. }
  223. int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
  224. {
  225. return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
  226. }
  227. int fdt_del_node(void *fdt, int nodeoffset)
  228. {
  229. int endoffset;
  230. endoffset = _fdt_node_end_offset(fdt, nodeoffset);
  231. if (endoffset < 0)
  232. return endoffset;
  233. return _blob_splice_struct(fdt, _fdt_offset_ptr(fdt, nodeoffset),
  234. endoffset - nodeoffset, 0);
  235. }
  236. int fdt_open_into(void *fdt, void *buf, int bufsize)
  237. {
  238. int err;
  239. err = fdt_move(fdt, buf, bufsize);
  240. if (err)
  241. return err;
  242. fdt = buf;
  243. fdt_set_header(fdt, totalsize, bufsize);
  244. /* FIXME: re-order if necessary */
  245. err = rw_check_header(fdt);
  246. if (err)
  247. return err;
  248. return 0;
  249. }
  250. int fdt_pack(void *fdt)
  251. {
  252. int err;
  253. err = rw_check_header(fdt);
  254. if (err)
  255. return err;
  256. /* FIXME: pack components */
  257. fdt_set_header(fdt, totalsize, _blob_data_size(fdt));
  258. return 0;
  259. }
  260. #endif /* CONFIG_OF_LIBFDT */