fdt_wip.c 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189
  1. /*
  2. * libfdt - Flat Device Tree manipulation
  3. * Copyright (C) 2006 David Gibson, IBM Corporation.
  4. *
  5. * libfdt is dual licensed: you can use it either under the terms of
  6. * the GPL, or the BSD license, at your option.
  7. *
  8. * a) This library is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU General Public License as
  10. * published by the Free Software Foundation; either version 2 of the
  11. * License, or (at your option) any later version.
  12. *
  13. * This library is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public
  19. * License along with this library; if not, write to the Free
  20. * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
  21. * MA 02110-1301 USA
  22. *
  23. * Alternatively,
  24. *
  25. * b) Redistribution and use in source and binary forms, with or
  26. * without modification, are permitted provided that the following
  27. * conditions are met:
  28. *
  29. * 1. Redistributions of source code must retain the above
  30. * copyright notice, this list of conditions and the following
  31. * disclaimer.
  32. * 2. Redistributions in binary form must reproduce the above
  33. * copyright notice, this list of conditions and the following
  34. * disclaimer in the documentation and/or other materials
  35. * provided with the distribution.
  36. *
  37. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  38. * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  39. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
  40. * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  41. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  42. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  43. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  44. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  45. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  46. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  47. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
  48. * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
  49. * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  50. */
  51. #include "libfdt_env.h"
  52. #include <fdt.h>
  53. #include <libfdt.h>
  54. #include "libfdt_internal.h"
  55. int
  56. fdt_setprop_inplace_namelen_partial (
  57. void *fdt,
  58. int nodeoffset,
  59. const char *name,
  60. int namelen,
  61. uint32_t idx,
  62. const void *val,
  63. int len
  64. )
  65. {
  66. void *propval;
  67. int proplen;
  68. propval = fdt_getprop_namelen_w (
  69. fdt,
  70. nodeoffset,
  71. name,
  72. namelen,
  73. &proplen
  74. );
  75. if (!propval) {
  76. return proplen;
  77. }
  78. if (proplen < (len + idx)) {
  79. return -FDT_ERR_NOSPACE;
  80. }
  81. memcpy ((char *)propval + idx, val, len);
  82. return 0;
  83. }
  84. int
  85. fdt_setprop_inplace (
  86. void *fdt,
  87. int nodeoffset,
  88. const char *name,
  89. const void *val,
  90. int len
  91. )
  92. {
  93. const void *propval;
  94. int proplen;
  95. propval = fdt_getprop (fdt, nodeoffset, name, &proplen);
  96. if (!propval) {
  97. return proplen;
  98. }
  99. if (proplen != len) {
  100. return -FDT_ERR_NOSPACE;
  101. }
  102. return fdt_setprop_inplace_namelen_partial (
  103. fdt,
  104. nodeoffset,
  105. name,
  106. strlen (name),
  107. 0,
  108. val,
  109. len
  110. );
  111. }
  112. static void
  113. _fdt_nop_region (
  114. void *start,
  115. int len
  116. )
  117. {
  118. fdt32_t *p;
  119. for (p = start; (char *)p < ((char *)start + len); p++) {
  120. *p = cpu_to_fdt32 (FDT_NOP);
  121. }
  122. }
  123. int
  124. fdt_nop_property (
  125. void *fdt,
  126. int nodeoffset,
  127. const char *name
  128. )
  129. {
  130. struct fdt_property *prop;
  131. int len;
  132. prop = fdt_get_property_w (fdt, nodeoffset, name, &len);
  133. if (!prop) {
  134. return len;
  135. }
  136. _fdt_nop_region (prop, len + sizeof (*prop));
  137. return 0;
  138. }
  139. int
  140. _fdt_node_end_offset (
  141. void *fdt,
  142. int offset
  143. )
  144. {
  145. int depth = 0;
  146. while ((offset >= 0) && (depth >= 0)) {
  147. offset = fdt_next_node (fdt, offset, &depth);
  148. }
  149. return offset;
  150. }
  151. int
  152. fdt_nop_node (
  153. void *fdt,
  154. int nodeoffset
  155. )
  156. {
  157. int endoffset;
  158. endoffset = _fdt_node_end_offset (fdt, nodeoffset);
  159. if (endoffset < 0) {
  160. return endoffset;
  161. }
  162. _fdt_nop_region (
  163. fdt_offset_ptr_w (fdt, nodeoffset, 0),
  164. endoffset - nodeoffset
  165. );
  166. return 0;
  167. }