fdt_sw.c 5.5 KB

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