libfdt_internal.h 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192
  1. /* SPDX-License-Identifier: (GPL-2.0-or-later OR BSD-2-Clause) */
  2. #ifndef LIBFDT_INTERNAL_H
  3. #define LIBFDT_INTERNAL_H
  4. /*
  5. * libfdt - Flat Device Tree manipulation
  6. * Copyright (C) 2006 David Gibson, IBM Corporation.
  7. */
  8. #include <fdt.h>
  9. #define FDT_ALIGN(x, a) (((x) + (a) - 1) & ~((a) - 1))
  10. #define FDT_TAGALIGN(x) (FDT_ALIGN((x), FDT_TAGSIZE))
  11. int32_t fdt_ro_probe_(const void *fdt);
  12. #define FDT_RO_PROBE(fdt) \
  13. { \
  14. int32_t totalsize_; \
  15. if ((totalsize_ = fdt_ro_probe_(fdt)) < 0) \
  16. return totalsize_; \
  17. }
  18. int fdt_check_node_offset_(const void *fdt, int offset);
  19. int fdt_check_prop_offset_(const void *fdt, int offset);
  20. const char *fdt_find_string_(const char *strtab, int tabsize, const char *s);
  21. int fdt_node_end_offset_(void *fdt, int nodeoffset);
  22. static inline const void *fdt_offset_ptr_(const void *fdt, int offset)
  23. {
  24. return (const char *)fdt + fdt_off_dt_struct(fdt) + offset;
  25. }
  26. static inline void *fdt_offset_ptr_w_(void *fdt, int offset)
  27. {
  28. return (void *)(uintptr_t)fdt_offset_ptr_(fdt, offset);
  29. }
  30. static inline const struct fdt_reserve_entry *fdt_mem_rsv_(const void *fdt, int n)
  31. {
  32. const struct fdt_reserve_entry *rsv_table =
  33. (const struct fdt_reserve_entry *)
  34. ((const char *)fdt + fdt_off_mem_rsvmap(fdt));
  35. return rsv_table + n;
  36. }
  37. static inline struct fdt_reserve_entry *fdt_mem_rsv_w_(void *fdt, int n)
  38. {
  39. return (void *)(uintptr_t)fdt_mem_rsv_(fdt, n);
  40. }
  41. /*
  42. * Internal helpers to access tructural elements of the device tree
  43. * blob (rather than for exaple reading integers from within property
  44. * values). We assume that we are either given a naturally aligned
  45. * address for the platform or if we are not, we are on a platform
  46. * where unaligned memory reads will be handled in a graceful manner.
  47. * If not the external helpers fdtXX_ld() from libfdt.h can be used
  48. * instead.
  49. */
  50. static inline uint32_t fdt32_ld_(const fdt32_t *p)
  51. {
  52. return fdt32_to_cpu(*p);
  53. }
  54. static inline uint64_t fdt64_ld_(const fdt64_t *p)
  55. {
  56. return fdt64_to_cpu(*p);
  57. }
  58. #define FDT_SW_MAGIC (~FDT_MAGIC)
  59. /**********************************************************************/
  60. /* Checking controls */
  61. /**********************************************************************/
  62. #ifndef FDT_ASSUME_MASK
  63. #define FDT_ASSUME_MASK 0
  64. #endif
  65. /*
  66. * Defines assumptions which can be enabled. Each of these can be enabled
  67. * individually. For maximum safety, don't enable any assumptions!
  68. *
  69. * For minimal code size and no safety, use ASSUME_PERFECT at your own risk.
  70. * You should have another method of validating the device tree, such as a
  71. * signature or hash check before using libfdt.
  72. *
  73. * For situations where security is not a concern it may be safe to enable
  74. * ASSUME_SANE.
  75. */
  76. enum {
  77. /*
  78. * This does essentially no checks. Only the latest device-tree
  79. * version is correctly handled. Inconsistencies or errors in the device
  80. * tree may cause undefined behaviour or crashes. Invalid parameters
  81. * passed to libfdt may do the same.
  82. *
  83. * If an error occurs when modifying the tree it may leave the tree in
  84. * an intermediate (but valid) state. As an example, adding a property
  85. * where there is insufficient space may result in the property name
  86. * being added to the string table even though the property itself is
  87. * not added to the struct section.
  88. *
  89. * Only use this if you have a fully validated device tree with
  90. * the latest supported version and wish to minimise code size.
  91. */
  92. ASSUME_PERFECT = 0xff,
  93. /*
  94. * This assumes that the device tree is sane. i.e. header metadata
  95. * and basic hierarchy are correct.
  96. *
  97. * With this assumption enabled, normal device trees produced by libfdt
  98. * and the compiler should be handled safely. Malicious device trees and
  99. * complete garbage may cause libfdt to behave badly or crash. Truncated
  100. * device trees (e.g. those only partially loaded) can also cause
  101. * problems.
  102. *
  103. * Note: Only checks that relate exclusively to the device tree itself
  104. * (not the parameters passed to libfdt) are disabled by this
  105. * assumption. This includes checking headers, tags and the like.
  106. */
  107. ASSUME_VALID_DTB = 1 << 0,
  108. /*
  109. * This builds on ASSUME_VALID_DTB and further assumes that libfdt
  110. * functions are called with valid parameters, i.e. not trigger
  111. * FDT_ERR_BADOFFSET or offsets that are out of bounds. It disables any
  112. * extensive checking of parameters and the device tree, making various
  113. * assumptions about correctness.
  114. *
  115. * It doesn't make sense to enable this assumption unless
  116. * ASSUME_VALID_DTB is also enabled.
  117. */
  118. ASSUME_VALID_INPUT = 1 << 1,
  119. /*
  120. * This disables checks for device-tree version and removes all code
  121. * which handles older versions.
  122. *
  123. * Only enable this if you know you have a device tree with the latest
  124. * version.
  125. */
  126. ASSUME_LATEST = 1 << 2,
  127. /*
  128. * This assumes that it is OK for a failed addition to the device tree,
  129. * due to lack of space or some other problem, to skip any rollback
  130. * steps (such as dropping the property name from the string table).
  131. * This is safe to enable in most circumstances, even though it may
  132. * leave the tree in a sub-optimal state.
  133. */
  134. ASSUME_NO_ROLLBACK = 1 << 3,
  135. /*
  136. * This assumes that the device tree components appear in a 'convenient'
  137. * order, i.e. the memory reservation block first, then the structure
  138. * block and finally the string block.
  139. *
  140. * This order is not specified by the device-tree specification,
  141. * but is expected by libfdt. The device-tree compiler always created
  142. * device trees with this order.
  143. *
  144. * This assumption disables a check in fdt_open_into() and removes the
  145. * ability to fix the problem there. This is safe if you know that the
  146. * device tree is correctly ordered. See fdt_blocks_misordered_().
  147. */
  148. ASSUME_LIBFDT_ORDER = 1 << 4,
  149. /*
  150. * This assumes that libfdt itself does not have any internal bugs. It
  151. * drops certain checks that should never be needed unless libfdt has an
  152. * undiscovered bug.
  153. *
  154. * This can generally be considered safe to enable.
  155. */
  156. ASSUME_LIBFDT_FLAWLESS = 1 << 5,
  157. };
  158. /**
  159. * can_assume_() - check if a particular assumption is enabled
  160. *
  161. * @mask: Mask to check (ASSUME_...)
  162. * @return true if that assumption is enabled, else false
  163. */
  164. static inline bool can_assume_(int mask)
  165. {
  166. return FDT_ASSUME_MASK & mask;
  167. }
  168. /** helper macros for checking assumptions */
  169. #define can_assume(_assume) can_assume_(ASSUME_ ## _assume)
  170. #endif /* LIBFDT_INTERNAL_H */