fdt_wip.c 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148
  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. #ifndef USE_HOSTCC
  53. #include <fdt.h>
  54. #include <libfdt.h>
  55. #else
  56. #include "fdt_host.h"
  57. #endif
  58. #include "libfdt_internal.h"
  59. int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name,
  60. const void *val, int len)
  61. {
  62. void *propval;
  63. int proplen;
  64. propval = fdt_getprop_w(fdt, nodeoffset, name, &proplen);
  65. if (! propval)
  66. return proplen;
  67. if (proplen != len)
  68. return -FDT_ERR_NOSPACE;
  69. memcpy(propval, val, len);
  70. return 0;
  71. }
  72. static void nop_region(void *start, int len)
  73. {
  74. uint32_t *p;
  75. for (p = start; (void *)p < (start + len); p++)
  76. *p = cpu_to_fdt32(FDT_NOP);
  77. }
  78. int fdt_nop_property(void *fdt, int nodeoffset, const char *name)
  79. {
  80. struct fdt_property *prop;
  81. int len;
  82. prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
  83. if (! prop)
  84. return len;
  85. nop_region(prop, len + sizeof(*prop));
  86. return 0;
  87. }
  88. int _fdt_node_end_offset(void *fdt, int nodeoffset)
  89. {
  90. int level = 0;
  91. uint32_t tag;
  92. int offset, nextoffset;
  93. tag = fdt_next_tag(fdt, nodeoffset, &nextoffset);
  94. if (tag != FDT_BEGIN_NODE)
  95. return -FDT_ERR_BADOFFSET;
  96. do {
  97. offset = nextoffset;
  98. tag = fdt_next_tag(fdt, offset, &nextoffset);
  99. switch (tag) {
  100. case FDT_END:
  101. return offset;
  102. case FDT_BEGIN_NODE:
  103. level++;
  104. break;
  105. case FDT_END_NODE:
  106. level--;
  107. break;
  108. case FDT_PROP:
  109. case FDT_NOP:
  110. break;
  111. default:
  112. return -FDT_ERR_BADSTRUCTURE;
  113. }
  114. } while (level >= 0);
  115. return nextoffset;
  116. }
  117. int fdt_nop_node(void *fdt, int nodeoffset)
  118. {
  119. int endoffset;
  120. endoffset = _fdt_node_end_offset(fdt, nodeoffset);
  121. if (endoffset < 0)
  122. return endoffset;
  123. nop_region(fdt_offset_ptr_w(fdt, nodeoffset, 0), endoffset - nodeoffset);
  124. return 0;
  125. }