1553125dfSNikos Nikoleris /* SPDX-License-Identifier: (GPL-2.0-or-later OR BSD-2-Clause) */
2553125dfSNikos Nikoleris #ifndef LIBFDT_INTERNAL_H
3553125dfSNikos Nikoleris #define LIBFDT_INTERNAL_H
4a322d4c5SAndrew Jones /*
5a322d4c5SAndrew Jones * libfdt - Flat Device Tree manipulation
6a322d4c5SAndrew Jones * Copyright (C) 2006 David Gibson, IBM Corporation.
7a322d4c5SAndrew Jones */
8a322d4c5SAndrew Jones #include <fdt.h>
9a322d4c5SAndrew Jones
10a322d4c5SAndrew Jones #define FDT_ALIGN(x, a) (((x) + (a) - 1) & ~((a) - 1))
11a322d4c5SAndrew Jones #define FDT_TAGALIGN(x) (FDT_ALIGN((x), FDT_TAGSIZE))
12a322d4c5SAndrew Jones
13553125dfSNikos Nikoleris int32_t fdt_ro_probe_(const void *fdt);
14553125dfSNikos Nikoleris #define FDT_RO_PROBE(fdt) \
15a322d4c5SAndrew Jones { \
16553125dfSNikos Nikoleris int32_t totalsize_; \
17553125dfSNikos Nikoleris if ((totalsize_ = fdt_ro_probe_(fdt)) < 0) \
18553125dfSNikos Nikoleris return totalsize_; \
19a322d4c5SAndrew Jones }
20a322d4c5SAndrew Jones
21553125dfSNikos Nikoleris int fdt_check_node_offset_(const void *fdt, int offset);
22553125dfSNikos Nikoleris int fdt_check_prop_offset_(const void *fdt, int offset);
23553125dfSNikos Nikoleris const char *fdt_find_string_(const char *strtab, int tabsize, const char *s);
24553125dfSNikos Nikoleris int fdt_node_end_offset_(void *fdt, int nodeoffset);
25a322d4c5SAndrew Jones
fdt_offset_ptr_(const void * fdt,int offset)26553125dfSNikos Nikoleris static inline const void *fdt_offset_ptr_(const void *fdt, int offset)
27a322d4c5SAndrew Jones {
28a322d4c5SAndrew Jones return (const char *)fdt + fdt_off_dt_struct(fdt) + offset;
29a322d4c5SAndrew Jones }
30a322d4c5SAndrew Jones
fdt_offset_ptr_w_(void * fdt,int offset)31553125dfSNikos Nikoleris static inline void *fdt_offset_ptr_w_(void *fdt, int offset)
32a322d4c5SAndrew Jones {
33553125dfSNikos Nikoleris return (void *)(uintptr_t)fdt_offset_ptr_(fdt, offset);
34a322d4c5SAndrew Jones }
35a322d4c5SAndrew Jones
fdt_mem_rsv_(const void * fdt,int n)36553125dfSNikos Nikoleris static inline const struct fdt_reserve_entry *fdt_mem_rsv_(const void *fdt, int n)
37a322d4c5SAndrew Jones {
38a322d4c5SAndrew Jones const struct fdt_reserve_entry *rsv_table =
39a322d4c5SAndrew Jones (const struct fdt_reserve_entry *)
40a322d4c5SAndrew Jones ((const char *)fdt + fdt_off_mem_rsvmap(fdt));
41a322d4c5SAndrew Jones
42a322d4c5SAndrew Jones return rsv_table + n;
43a322d4c5SAndrew Jones }
fdt_mem_rsv_w_(void * fdt,int n)44553125dfSNikos Nikoleris static inline struct fdt_reserve_entry *fdt_mem_rsv_w_(void *fdt, int n)
45a322d4c5SAndrew Jones {
46553125dfSNikos Nikoleris return (void *)(uintptr_t)fdt_mem_rsv_(fdt, n);
47a322d4c5SAndrew Jones }
48a322d4c5SAndrew Jones
49*80a6d74fSAndrew Jones /*
50*80a6d74fSAndrew Jones * Internal helpers to access tructural elements of the device tree
51*80a6d74fSAndrew Jones * blob (rather than for exaple reading integers from within property
52*80a6d74fSAndrew Jones * values). We assume that we are either given a naturally aligned
53*80a6d74fSAndrew Jones * address for the platform or if we are not, we are on a platform
54*80a6d74fSAndrew Jones * where unaligned memory reads will be handled in a graceful manner.
55*80a6d74fSAndrew Jones * If not the external helpers fdtXX_ld() from libfdt.h can be used
56*80a6d74fSAndrew Jones * instead.
57*80a6d74fSAndrew Jones */
fdt32_ld_(const fdt32_t * p)58*80a6d74fSAndrew Jones static inline uint32_t fdt32_ld_(const fdt32_t *p)
59*80a6d74fSAndrew Jones {
60*80a6d74fSAndrew Jones return fdt32_to_cpu(*p);
61*80a6d74fSAndrew Jones }
62*80a6d74fSAndrew Jones
fdt64_ld_(const fdt64_t * p)63*80a6d74fSAndrew Jones static inline uint64_t fdt64_ld_(const fdt64_t *p)
64*80a6d74fSAndrew Jones {
65*80a6d74fSAndrew Jones return fdt64_to_cpu(*p);
66*80a6d74fSAndrew Jones }
67*80a6d74fSAndrew Jones
68a322d4c5SAndrew Jones #define FDT_SW_MAGIC (~FDT_MAGIC)
69a322d4c5SAndrew Jones
70553125dfSNikos Nikoleris /**********************************************************************/
71553125dfSNikos Nikoleris /* Checking controls */
72553125dfSNikos Nikoleris /**********************************************************************/
73553125dfSNikos Nikoleris
74553125dfSNikos Nikoleris #ifndef FDT_ASSUME_MASK
75553125dfSNikos Nikoleris #define FDT_ASSUME_MASK 0
76553125dfSNikos Nikoleris #endif
77553125dfSNikos Nikoleris
78553125dfSNikos Nikoleris /*
79553125dfSNikos Nikoleris * Defines assumptions which can be enabled. Each of these can be enabled
80553125dfSNikos Nikoleris * individually. For maximum safety, don't enable any assumptions!
81553125dfSNikos Nikoleris *
82553125dfSNikos Nikoleris * For minimal code size and no safety, use ASSUME_PERFECT at your own risk.
83553125dfSNikos Nikoleris * You should have another method of validating the device tree, such as a
84553125dfSNikos Nikoleris * signature or hash check before using libfdt.
85553125dfSNikos Nikoleris *
86553125dfSNikos Nikoleris * For situations where security is not a concern it may be safe to enable
87553125dfSNikos Nikoleris * ASSUME_SANE.
88553125dfSNikos Nikoleris */
89553125dfSNikos Nikoleris enum {
90553125dfSNikos Nikoleris /*
91553125dfSNikos Nikoleris * This does essentially no checks. Only the latest device-tree
92553125dfSNikos Nikoleris * version is correctly handled. Inconsistencies or errors in the device
93553125dfSNikos Nikoleris * tree may cause undefined behaviour or crashes. Invalid parameters
94553125dfSNikos Nikoleris * passed to libfdt may do the same.
95553125dfSNikos Nikoleris *
96553125dfSNikos Nikoleris * If an error occurs when modifying the tree it may leave the tree in
97553125dfSNikos Nikoleris * an intermediate (but valid) state. As an example, adding a property
98553125dfSNikos Nikoleris * where there is insufficient space may result in the property name
99553125dfSNikos Nikoleris * being added to the string table even though the property itself is
100553125dfSNikos Nikoleris * not added to the struct section.
101553125dfSNikos Nikoleris *
102553125dfSNikos Nikoleris * Only use this if you have a fully validated device tree with
103553125dfSNikos Nikoleris * the latest supported version and wish to minimise code size.
104553125dfSNikos Nikoleris */
105553125dfSNikos Nikoleris ASSUME_PERFECT = 0xff,
106553125dfSNikos Nikoleris
107553125dfSNikos Nikoleris /*
108553125dfSNikos Nikoleris * This assumes that the device tree is sane. i.e. header metadata
109553125dfSNikos Nikoleris * and basic hierarchy are correct.
110553125dfSNikos Nikoleris *
111553125dfSNikos Nikoleris * With this assumption enabled, normal device trees produced by libfdt
112553125dfSNikos Nikoleris * and the compiler should be handled safely. Malicious device trees and
113553125dfSNikos Nikoleris * complete garbage may cause libfdt to behave badly or crash. Truncated
114553125dfSNikos Nikoleris * device trees (e.g. those only partially loaded) can also cause
115553125dfSNikos Nikoleris * problems.
116553125dfSNikos Nikoleris *
117553125dfSNikos Nikoleris * Note: Only checks that relate exclusively to the device tree itself
118553125dfSNikos Nikoleris * (not the parameters passed to libfdt) are disabled by this
119553125dfSNikos Nikoleris * assumption. This includes checking headers, tags and the like.
120553125dfSNikos Nikoleris */
121553125dfSNikos Nikoleris ASSUME_VALID_DTB = 1 << 0,
122553125dfSNikos Nikoleris
123553125dfSNikos Nikoleris /*
124553125dfSNikos Nikoleris * This builds on ASSUME_VALID_DTB and further assumes that libfdt
125553125dfSNikos Nikoleris * functions are called with valid parameters, i.e. not trigger
126553125dfSNikos Nikoleris * FDT_ERR_BADOFFSET or offsets that are out of bounds. It disables any
127553125dfSNikos Nikoleris * extensive checking of parameters and the device tree, making various
128553125dfSNikos Nikoleris * assumptions about correctness.
129553125dfSNikos Nikoleris *
130553125dfSNikos Nikoleris * It doesn't make sense to enable this assumption unless
131553125dfSNikos Nikoleris * ASSUME_VALID_DTB is also enabled.
132553125dfSNikos Nikoleris */
133553125dfSNikos Nikoleris ASSUME_VALID_INPUT = 1 << 1,
134553125dfSNikos Nikoleris
135553125dfSNikos Nikoleris /*
136553125dfSNikos Nikoleris * This disables checks for device-tree version and removes all code
137553125dfSNikos Nikoleris * which handles older versions.
138553125dfSNikos Nikoleris *
139553125dfSNikos Nikoleris * Only enable this if you know you have a device tree with the latest
140553125dfSNikos Nikoleris * version.
141553125dfSNikos Nikoleris */
142553125dfSNikos Nikoleris ASSUME_LATEST = 1 << 2,
143553125dfSNikos Nikoleris
144553125dfSNikos Nikoleris /*
145553125dfSNikos Nikoleris * This assumes that it is OK for a failed addition to the device tree,
146553125dfSNikos Nikoleris * due to lack of space or some other problem, to skip any rollback
147553125dfSNikos Nikoleris * steps (such as dropping the property name from the string table).
148553125dfSNikos Nikoleris * This is safe to enable in most circumstances, even though it may
149553125dfSNikos Nikoleris * leave the tree in a sub-optimal state.
150553125dfSNikos Nikoleris */
151553125dfSNikos Nikoleris ASSUME_NO_ROLLBACK = 1 << 3,
152553125dfSNikos Nikoleris
153553125dfSNikos Nikoleris /*
154553125dfSNikos Nikoleris * This assumes that the device tree components appear in a 'convenient'
155553125dfSNikos Nikoleris * order, i.e. the memory reservation block first, then the structure
156553125dfSNikos Nikoleris * block and finally the string block.
157553125dfSNikos Nikoleris *
158553125dfSNikos Nikoleris * This order is not specified by the device-tree specification,
159553125dfSNikos Nikoleris * but is expected by libfdt. The device-tree compiler always created
160553125dfSNikos Nikoleris * device trees with this order.
161553125dfSNikos Nikoleris *
162553125dfSNikos Nikoleris * This assumption disables a check in fdt_open_into() and removes the
163553125dfSNikos Nikoleris * ability to fix the problem there. This is safe if you know that the
164553125dfSNikos Nikoleris * device tree is correctly ordered. See fdt_blocks_misordered_().
165553125dfSNikos Nikoleris */
166553125dfSNikos Nikoleris ASSUME_LIBFDT_ORDER = 1 << 4,
167553125dfSNikos Nikoleris
168553125dfSNikos Nikoleris /*
169553125dfSNikos Nikoleris * This assumes that libfdt itself does not have any internal bugs. It
170553125dfSNikos Nikoleris * drops certain checks that should never be needed unless libfdt has an
171553125dfSNikos Nikoleris * undiscovered bug.
172553125dfSNikos Nikoleris *
173553125dfSNikos Nikoleris * This can generally be considered safe to enable.
174553125dfSNikos Nikoleris */
175553125dfSNikos Nikoleris ASSUME_LIBFDT_FLAWLESS = 1 << 5,
176553125dfSNikos Nikoleris };
177553125dfSNikos Nikoleris
178553125dfSNikos Nikoleris /**
179553125dfSNikos Nikoleris * can_assume_() - check if a particular assumption is enabled
180553125dfSNikos Nikoleris *
181553125dfSNikos Nikoleris * @mask: Mask to check (ASSUME_...)
182553125dfSNikos Nikoleris * @return true if that assumption is enabled, else false
183553125dfSNikos Nikoleris */
can_assume_(int mask)184553125dfSNikos Nikoleris static inline bool can_assume_(int mask)
185553125dfSNikos Nikoleris {
186553125dfSNikos Nikoleris return FDT_ASSUME_MASK & mask;
187553125dfSNikos Nikoleris }
188553125dfSNikos Nikoleris
189553125dfSNikos Nikoleris /** helper macros for checking assumptions */
190553125dfSNikos Nikoleris #define can_assume(_assume) can_assume_(ASSUME_ ## _assume)
191553125dfSNikos Nikoleris
192553125dfSNikos Nikoleris #endif /* LIBFDT_INTERNAL_H */
193