fdt_rw.c 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293
  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 "libfdt_env.h"
  20. #include <fdt.h>
  21. #include <libfdt.h>
  22. #include "libfdt_internal.h"
  23. static int rw_check_header(void *fdt)
  24. {
  25. int err;
  26. if ((err = fdt_check_header(fdt)))
  27. return err;
  28. if (fdt_version(fdt) < 0x11)
  29. return -FDT_ERR_BADVERSION;
  30. if (fdt_off_mem_rsvmap(fdt) < ALIGN(sizeof(struct fdt_header), 8))
  31. return -FDT_ERR_BADLAYOUT;
  32. if (fdt_off_dt_struct(fdt) <
  33. (fdt_off_mem_rsvmap(fdt) + sizeof(struct fdt_reserve_entry)))
  34. return -FDT_ERR_BADLAYOUT;
  35. if (fdt_off_dt_strings(fdt) <
  36. (fdt_off_dt_struct(fdt) + fdt_size_dt_struct(fdt)))
  37. return -FDT_ERR_BADLAYOUT;
  38. if (fdt_totalsize(fdt) <
  39. (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt)))
  40. return -FDT_ERR_BADLAYOUT;
  41. return 0;
  42. }
  43. #define RW_CHECK_HEADER(fdt) \
  44. { \
  45. int err; \
  46. if ((err = rw_check_header(fdt)) != 0) \
  47. return err; \
  48. }
  49. static inline int _blob_data_size(void *fdt)
  50. {
  51. return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  52. }
  53. static int _blob_splice(void *fdt, void *p, int oldlen, int newlen)
  54. {
  55. void *end = fdt + _blob_data_size(fdt);
  56. if (((p + oldlen) < p) || ((p + oldlen) > end))
  57. return -FDT_ERR_BADOFFSET;
  58. if ((end - oldlen + newlen) > (fdt + fdt_totalsize(fdt)))
  59. return -FDT_ERR_NOSPACE;
  60. memmove(p + newlen, p + oldlen, end - p - oldlen);
  61. return 0;
  62. }
  63. static int _blob_splice_struct(void *fdt, void *p,
  64. int oldlen, int newlen)
  65. {
  66. int delta = newlen - oldlen;
  67. int err;
  68. if ((err = _blob_splice(fdt, p, oldlen, newlen)))
  69. return err;
  70. fdt_set_header(fdt, size_dt_struct, fdt_size_dt_struct(fdt) + delta);
  71. fdt_set_header(fdt, off_dt_strings, fdt_off_dt_strings(fdt) + delta);
  72. return 0;
  73. }
  74. static int _blob_splice_string(void *fdt, int newlen)
  75. {
  76. void *p = fdt + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
  77. int err;
  78. if ((err = _blob_splice(fdt, p, 0, newlen)))
  79. return err;
  80. fdt_set_header(fdt, size_dt_strings, fdt_size_dt_strings(fdt) + newlen);
  81. return 0;
  82. }
  83. static int _find_add_string(void *fdt, const char *s)
  84. {
  85. char *strtab = (char *)fdt + fdt_off_dt_strings(fdt);
  86. const char *p;
  87. char *new;
  88. int len = strlen(s) + 1;
  89. int err;
  90. p = _fdt_find_string(strtab, fdt_size_dt_strings(fdt), s);
  91. if (p)
  92. /* found it */
  93. return (p - strtab);
  94. new = strtab + fdt_size_dt_strings(fdt);
  95. err = _blob_splice_string(fdt, len);
  96. if (err)
  97. return err;
  98. memcpy(new, s, len);
  99. return (new - strtab);
  100. }
  101. static int _resize_property(void *fdt, int nodeoffset, const char *name, int len,
  102. struct fdt_property **prop)
  103. {
  104. int oldlen;
  105. int err;
  106. *prop = fdt_get_property(fdt, nodeoffset, name, &oldlen);
  107. if (! (*prop))
  108. return oldlen;
  109. if ((err = _blob_splice_struct(fdt, (*prop)->data,
  110. ALIGN(oldlen, FDT_TAGSIZE),
  111. ALIGN(len, FDT_TAGSIZE))))
  112. return err;
  113. (*prop)->len = cpu_to_fdt32(len);
  114. return 0;
  115. }
  116. static int _add_property(void *fdt, int nodeoffset, const char *name, int len,
  117. struct fdt_property **prop)
  118. {
  119. uint32_t tag;
  120. int proplen;
  121. int nextoffset;
  122. int namestroff;
  123. int err;
  124. tag = fdt_next_tag(fdt, nodeoffset, &nextoffset, NULL);
  125. if (tag != FDT_BEGIN_NODE)
  126. return -FDT_ERR_BADOFFSET;
  127. namestroff = _find_add_string(fdt, name);
  128. if (namestroff < 0)
  129. return namestroff;
  130. *prop = _fdt_offset_ptr(fdt, nextoffset);
  131. proplen = sizeof(**prop) + ALIGN(len, FDT_TAGSIZE);
  132. err = _blob_splice_struct(fdt, *prop, 0, proplen);
  133. if (err)
  134. return err;
  135. (*prop)->tag = cpu_to_fdt32(FDT_PROP);
  136. (*prop)->nameoff = cpu_to_fdt32(namestroff);
  137. (*prop)->len = cpu_to_fdt32(len);
  138. return 0;
  139. }
  140. int fdt_setprop(void *fdt, int nodeoffset, const char *name,
  141. const void *val, int len)
  142. {
  143. struct fdt_property *prop;
  144. int err;
  145. if ((err = rw_check_header(fdt)))
  146. return err;
  147. err = _resize_property(fdt, nodeoffset, name, len, &prop);
  148. if (err == -FDT_ERR_NOTFOUND)
  149. err = _add_property(fdt, nodeoffset, name, len, &prop);
  150. if (err)
  151. return err;
  152. memcpy(prop->data, val, len);
  153. return 0;
  154. }
  155. int fdt_delprop(void *fdt, int nodeoffset, const char *name)
  156. {
  157. struct fdt_property *prop;
  158. int len, proplen;
  159. RW_CHECK_HEADER(fdt);
  160. prop = fdt_get_property(fdt, nodeoffset, name, &len);
  161. if (! prop)
  162. return len;
  163. proplen = sizeof(*prop) + ALIGN(len, FDT_TAGSIZE);
  164. return _blob_splice_struct(fdt, prop, proplen, 0);
  165. }
  166. int fdt_add_subnode_namelen(void *fdt, int parentoffset,
  167. const char *name, int namelen)
  168. {
  169. struct fdt_node_header *nh;
  170. int offset, nextoffset;
  171. int nodelen;
  172. int err;
  173. uint32_t tag;
  174. uint32_t *endtag;
  175. RW_CHECK_HEADER(fdt);
  176. offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
  177. if (offset >= 0)
  178. return -FDT_ERR_EXISTS;
  179. else if (offset != -FDT_ERR_NOTFOUND)
  180. return offset;
  181. /* Try to place the new node after the parent's properties */
  182. fdt_next_tag(fdt, parentoffset, &nextoffset, NULL); /* skip the BEGIN_NODE */
  183. do {
  184. offset = nextoffset;
  185. tag = fdt_next_tag(fdt, offset, &nextoffset, NULL);
  186. } while (tag == FDT_PROP);
  187. nh = _fdt_offset_ptr(fdt, offset);
  188. nodelen = sizeof(*nh) + ALIGN(namelen+1, FDT_TAGSIZE) + FDT_TAGSIZE;
  189. err = _blob_splice_struct(fdt, nh, 0, nodelen);
  190. if (err)
  191. return err;
  192. nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
  193. memset(nh->name, 0, ALIGN(namelen+1, FDT_TAGSIZE));
  194. memcpy(nh->name, name, namelen);
  195. endtag = (uint32_t *)((void *)nh + nodelen - FDT_TAGSIZE);
  196. *endtag = cpu_to_fdt32(FDT_END_NODE);
  197. return offset;
  198. }
  199. int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
  200. {
  201. return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
  202. }
  203. int fdt_del_node(void *fdt, int nodeoffset)
  204. {
  205. int endoffset;
  206. endoffset = _fdt_node_end_offset(fdt, nodeoffset);
  207. if (endoffset < 0)
  208. return endoffset;
  209. return _blob_splice_struct(fdt, _fdt_offset_ptr(fdt, nodeoffset),
  210. endoffset - nodeoffset, 0);
  211. }
  212. int fdt_open_into(void *fdt, void *buf, int bufsize)
  213. {
  214. int err;
  215. err = fdt_move(fdt, buf, bufsize);
  216. if (err)
  217. return err;
  218. fdt = buf;
  219. fdt_set_header(fdt, totalsize, bufsize);
  220. /* FIXME: re-order if necessary */
  221. err = rw_check_header(fdt);
  222. if (err)
  223. return err;
  224. return 0;
  225. }
  226. int fdt_pack(void *fdt)
  227. {
  228. int err;
  229. err = rw_check_header(fdt);
  230. if (err)
  231. return err;
  232. /* FIXME: pack components */
  233. fdt_set_header(fdt, totalsize, _blob_data_size(fdt));
  234. return 0;
  235. }