fdt_wip.c 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139
  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 fdt_setprop_inplace_namelen_partial(void *fdt, int nodeoffset,
  56. const char *name, int namelen,
  57. uint32_t idx, const void *val,
  58. int len)
  59. {
  60. void *propval;
  61. int proplen;
  62. propval = fdt_getprop_namelen_w(fdt, nodeoffset, name, namelen,
  63. &proplen);
  64. if (!propval)
  65. return proplen;
  66. if (proplen < (len + idx))
  67. return -FDT_ERR_NOSPACE;
  68. memcpy((char *)propval + idx, val, len);
  69. return 0;
  70. }
  71. int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name,
  72. const void *val, int len)
  73. {
  74. const void *propval;
  75. int proplen;
  76. propval = fdt_getprop(fdt, nodeoffset, name, &proplen);
  77. if (!propval)
  78. return proplen;
  79. if (proplen != len)
  80. return -FDT_ERR_NOSPACE;
  81. return fdt_setprop_inplace_namelen_partial(fdt, nodeoffset, name,
  82. strlen(name), 0,
  83. val, len);
  84. }
  85. static void fdt_nop_region_(void *start, int len)
  86. {
  87. fdt32_t *p;
  88. for (p = start; (char *)p < ((char *)start + len); p++)
  89. *p = cpu_to_fdt32(FDT_NOP);
  90. }
  91. int fdt_nop_property(void *fdt, int nodeoffset, const char *name)
  92. {
  93. struct fdt_property *prop;
  94. int len;
  95. prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
  96. if (!prop)
  97. return len;
  98. fdt_nop_region_(prop, len + sizeof(*prop));
  99. return 0;
  100. }
  101. int fdt_node_end_offset_(void *fdt, int offset)
  102. {
  103. int depth = 0;
  104. while ((offset >= 0) && (depth >= 0))
  105. offset = fdt_next_node(fdt, offset, &depth);
  106. return offset;
  107. }
  108. int fdt_nop_node(void *fdt, int nodeoffset)
  109. {
  110. int endoffset;
  111. endoffset = fdt_node_end_offset_(fdt, nodeoffset);
  112. if (endoffset < 0)
  113. return endoffset;
  114. fdt_nop_region_(fdt_offset_ptr_w(fdt, nodeoffset, 0),
  115. endoffset - nodeoffset);
  116. return 0;
  117. }