fdt_sw.c 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231
  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 check_header_sw(void *fdt)
  26. {
  27. if (fdt_magic(fdt) != SW_MAGIC)
  28. return -FDT_ERR_BADMAGIC;
  29. return 0;
  30. }
  31. static void *grab_space(void *fdt, int len)
  32. {
  33. int offset = fdt_size_dt_struct(fdt);
  34. int spaceleft;
  35. spaceleft = fdt_totalsize(fdt) - fdt_off_dt_struct(fdt)
  36. - fdt_size_dt_strings(fdt);
  37. if ((offset + len < offset) || (offset + len > spaceleft))
  38. return NULL;
  39. fdt_set_header(fdt, size_dt_struct, offset + len);
  40. return fdt_offset_ptr(fdt, offset, len);
  41. }
  42. int fdt_create(void *buf, int bufsize)
  43. {
  44. void *fdt = buf;
  45. if (bufsize < sizeof(struct fdt_header))
  46. return -FDT_ERR_NOSPACE;
  47. memset(buf, 0, bufsize);
  48. fdt_set_header(fdt, magic, SW_MAGIC);
  49. fdt_set_header(fdt, version, FDT_LAST_SUPPORTED_VERSION);
  50. fdt_set_header(fdt, last_comp_version, FDT_FIRST_SUPPORTED_VERSION);
  51. fdt_set_header(fdt, totalsize, bufsize);
  52. fdt_set_header(fdt, off_mem_rsvmap, ALIGN(sizeof(struct fdt_header),
  53. sizeof(struct fdt_reserve_entry)));
  54. fdt_set_header(fdt, off_dt_struct, fdt_off_mem_rsvmap(fdt));
  55. fdt_set_header(fdt, off_dt_strings, bufsize);
  56. return 0;
  57. }
  58. int fdt_add_reservemap_entry(void *fdt, uint64_t addr, uint64_t size)
  59. {
  60. struct fdt_reserve_entry *re;
  61. int err = check_header_sw(fdt);
  62. int offset;
  63. if (err)
  64. return err;
  65. if (fdt_size_dt_struct(fdt))
  66. return -FDT_ERR_BADSTATE;
  67. offset = fdt_off_dt_struct(fdt);
  68. if ((offset + sizeof(*re)) > fdt_totalsize(fdt))
  69. return -FDT_ERR_NOSPACE;
  70. re = (struct fdt_reserve_entry *)((void *)fdt + offset);
  71. re->address = cpu_to_fdt64(addr);
  72. re->size = cpu_to_fdt64(size);
  73. fdt_set_header(fdt, off_dt_struct, offset + sizeof(*re));
  74. return 0;
  75. }
  76. int fdt_finish_reservemap(void *fdt)
  77. {
  78. return fdt_add_reservemap_entry(fdt, 0, 0);
  79. }
  80. int fdt_begin_node(void *fdt, const char *name)
  81. {
  82. struct fdt_node_header *nh;
  83. int err = check_header_sw(fdt);
  84. int namelen = strlen(name) + 1;
  85. if (err)
  86. return err;
  87. nh = grab_space(fdt, sizeof(*nh) + ALIGN(namelen, FDT_TAGSIZE));
  88. if (! nh)
  89. return -FDT_ERR_NOSPACE;
  90. nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
  91. memcpy(nh->name, name, namelen);
  92. return 0;
  93. }
  94. int fdt_end_node(void *fdt)
  95. {
  96. uint32_t *en;
  97. int err = check_header_sw(fdt);
  98. if (err)
  99. return err;
  100. en = grab_space(fdt, FDT_TAGSIZE);
  101. if (! en)
  102. return -FDT_ERR_NOSPACE;
  103. *en = cpu_to_fdt32(FDT_END_NODE);
  104. return 0;
  105. }
  106. static int find_add_string(void *fdt, const char *s)
  107. {
  108. char *strtab = (char *)fdt + fdt_totalsize(fdt);
  109. const char *p;
  110. int strtabsize = fdt_size_dt_strings(fdt);
  111. int len = strlen(s) + 1;
  112. int struct_top, offset;
  113. p = _fdt_find_string(strtab - strtabsize, strtabsize, s);
  114. if (p)
  115. return p - strtab;
  116. /* Add it */
  117. offset = -strtabsize - len;
  118. struct_top = fdt_off_dt_struct(fdt) + fdt_size_dt_struct(fdt);
  119. if (fdt_totalsize(fdt) + offset < struct_top)
  120. return 0; /* no more room :( */
  121. memcpy(strtab + offset, s, len);
  122. fdt_set_header(fdt, size_dt_strings, strtabsize + len);
  123. return offset;
  124. }
  125. int fdt_property(void *fdt, const char *name, const void *val, int len)
  126. {
  127. struct fdt_property *prop;
  128. int err = check_header_sw(fdt);
  129. int nameoff;
  130. if (err)
  131. return err;
  132. nameoff = find_add_string(fdt, name);
  133. if (nameoff == 0)
  134. return -FDT_ERR_NOSPACE;
  135. prop = grab_space(fdt, sizeof(*prop) + ALIGN(len, FDT_TAGSIZE));
  136. if (! prop)
  137. return -FDT_ERR_NOSPACE;
  138. prop->tag = cpu_to_fdt32(FDT_PROP);
  139. prop->nameoff = cpu_to_fdt32(nameoff);
  140. prop->len = cpu_to_fdt32(len);
  141. memcpy(prop->data, val, len);
  142. return 0;
  143. }
  144. int fdt_finish(void *fdt)
  145. {
  146. int err = check_header_sw(fdt);
  147. char *p = (char *)fdt;
  148. uint32_t *end;
  149. int oldstroffset, newstroffset;
  150. uint32_t tag;
  151. int offset, nextoffset;
  152. if (err)
  153. return err;
  154. /* Add terminator */
  155. end = grab_space(fdt, sizeof(*end));
  156. if (! end)
  157. return -FDT_ERR_NOSPACE;
  158. *end = cpu_to_fdt32(FDT_END);
  159. /* Relocate the string table */
  160. oldstroffset = fdt_totalsize(fdt) - fdt_size_dt_strings(fdt);
  161. newstroffset = fdt_off_dt_struct(fdt) + fdt_size_dt_struct(fdt);
  162. memmove(p + newstroffset, p + oldstroffset, fdt_size_dt_strings(fdt));
  163. fdt_set_header(fdt, off_dt_strings, newstroffset);
  164. /* Walk the structure, correcting string offsets */
  165. offset = 0;
  166. while ((tag = fdt_next_tag(fdt, offset, &nextoffset, NULL)) != FDT_END) {
  167. if (tag == FDT_PROP) {
  168. struct fdt_property *prop = fdt_offset_ptr(fdt, offset,
  169. sizeof(*prop));
  170. int nameoff;
  171. if (! prop)
  172. return -FDT_ERR_BADSTRUCTURE;
  173. nameoff = fdt32_to_cpu(prop->nameoff);
  174. nameoff += fdt_size_dt_strings(fdt);
  175. prop->nameoff = cpu_to_fdt32(nameoff);
  176. }
  177. offset = nextoffset;
  178. }
  179. /* Finally, adjust the header */
  180. fdt_set_header(fdt, totalsize, newstroffset + fdt_size_dt_strings(fdt));
  181. fdt_set_header(fdt, magic, FDT_MAGIC);
  182. return 0;
  183. }
  184. #endif /* CONFIG_OF_LIBFDT */