Loading...
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
53#include <fdt.h>
54#include <libfdt.h>
55
56#include "libfdt_internal.h"
57
58static int _fdt_nodename_eq(const void *fdt, int offset,
59 const char *s, int len)
60{
61 const char *p = fdt_offset_ptr(fdt, offset + FDT_TAGSIZE, len+1);
62
63 if (! p)
64 /* short match */
65 return 0;
66
67 if (memcmp(p, s, len) != 0)
68 return 0;
69
70 if (p[len] == '\0')
71 return 1;
72 else if (!memchr(s, '@', len) && (p[len] == '@'))
73 return 1;
74 else
75 return 0;
76}
77
78const char *fdt_string(const void *fdt, int stroffset)
79{
80 return (const char *)fdt + fdt_off_dt_strings(fdt) + stroffset;
81}
82
83int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
84{
85 FDT_CHECK_HEADER(fdt);
86 *address = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->address);
87 *size = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->size);
88 return 0;
89}
90
91int fdt_num_mem_rsv(const void *fdt)
92{
93 int i = 0;
94
95 while (fdt64_to_cpu(_fdt_mem_rsv(fdt, i)->size) != 0)
96 i++;
97 return i;
98}
99
100int fdt_subnode_offset_namelen(const void *fdt, int offset,
101 const char *name, int namelen)
102{
103 int depth;
104
105 FDT_CHECK_HEADER(fdt);
106
107 for (depth = 0, offset = fdt_next_node(fdt, offset, &depth);
108 (offset >= 0) && (depth > 0);
109 offset = fdt_next_node(fdt, offset, &depth)) {
110 if (depth < 0)
111 return -FDT_ERR_NOTFOUND;
112 else if ((depth == 1)
113 && _fdt_nodename_eq(fdt, offset, name, namelen))
114 return offset;
115 }
116
117 if (offset < 0)
118 return offset; /* error */
119 else
120 return -FDT_ERR_NOTFOUND;
121}
122
123int fdt_subnode_offset(const void *fdt, int parentoffset,
124 const char *name)
125{
126 return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name));
127}
128
129int fdt_path_offset(const void *fdt, const char *path)
130{
131 const char *end = path + strlen(path);
132 const char *p = path;
133 int offset = 0;
134
135 FDT_CHECK_HEADER(fdt);
136
137 if (*path != '/')
138 return -FDT_ERR_BADPATH;
139
140 while (*p) {
141 const char *q;
142
143 while (*p == '/')
144 p++;
145 if (! *p)
146 return offset;
147 q = strchr(p, '/');
148 if (! q)
149 q = end;
150
151 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
152 if (offset < 0)
153 return offset;
154
155 p = q;
156 }
157
158 return offset;
159}
160
161const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
162{
163 const struct fdt_node_header *nh = _fdt_offset_ptr(fdt, nodeoffset);
164 int err;
165
166 if (((err = fdt_check_header(fdt)) != 0)
167 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
168 goto fail;
169
170 if (len)
171 *len = strlen(nh->name);
172
173 return nh->name;
174
175 fail:
176 if (len)
177 *len = err;
178 return NULL;
179}
180
181const struct fdt_property *fdt_get_property(const void *fdt,
182 int nodeoffset,
183 const char *name, int *lenp)
184{
185 uint32_t tag;
186 const struct fdt_property *prop;
187 int namestroff;
188 int offset, nextoffset;
189 int err;
190
191 if (((err = fdt_check_header(fdt)) != 0)
192 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
193 goto fail;
194
195 nextoffset = err;
196 do {
197 offset = nextoffset;
198
199 tag = fdt_next_tag(fdt, offset, &nextoffset);
200 switch (tag) {
201 case FDT_END:
202 err = -FDT_ERR_TRUNCATED;
203 goto fail;
204
205 case FDT_BEGIN_NODE:
206 case FDT_END_NODE:
207 case FDT_NOP:
208 break;
209
210 case FDT_PROP:
211 err = -FDT_ERR_BADSTRUCTURE;
212 prop = fdt_offset_ptr(fdt, offset, sizeof(*prop));
213 if (! prop)
214 goto fail;
215 namestroff = fdt32_to_cpu(prop->nameoff);
216 if (strcmp(fdt_string(fdt, namestroff), name) == 0) {
217 /* Found it! */
218 int len = fdt32_to_cpu(prop->len);
219 prop = fdt_offset_ptr(fdt, offset,
220 sizeof(*prop)+len);
221 if (! prop)
222 goto fail;
223
224 if (lenp)
225 *lenp = len;
226
227 return prop;
228 }
229 break;
230
231 default:
232 err = -FDT_ERR_BADSTRUCTURE;
233 goto fail;
234 }
235 } while ((tag != FDT_BEGIN_NODE) && (tag != FDT_END_NODE));
236
237 err = -FDT_ERR_NOTFOUND;
238 fail:
239 if (lenp)
240 *lenp = err;
241 return NULL;
242}
243
244const void *fdt_getprop(const void *fdt, int nodeoffset,
245 const char *name, int *lenp)
246{
247 const struct fdt_property *prop;
248
249 prop = fdt_get_property(fdt, nodeoffset, name, lenp);
250 if (! prop)
251 return NULL;
252
253 return prop->data;
254}
255
256uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
257{
258 const uint32_t *php;
259 int len;
260
261 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
262 if (!php || (len != sizeof(*php)))
263 return 0;
264
265 return fdt32_to_cpu(*php);
266}
267
268int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
269{
270 int pdepth = 0, p = 0;
271 int offset, depth, namelen;
272 const char *name;
273
274 FDT_CHECK_HEADER(fdt);
275
276 if (buflen < 2)
277 return -FDT_ERR_NOSPACE;
278
279 for (offset = 0, depth = 0;
280 (offset >= 0) && (offset <= nodeoffset);
281 offset = fdt_next_node(fdt, offset, &depth)) {
282 if (pdepth < depth)
283 continue; /* overflowed buffer */
284
285 while (pdepth > depth) {
286 do {
287 p--;
288 } while (buf[p-1] != '/');
289 pdepth--;
290 }
291
292 name = fdt_get_name(fdt, offset, &namelen);
293 if (!name)
294 return namelen;
295 if ((p + namelen + 1) <= buflen) {
296 memcpy(buf + p, name, namelen);
297 p += namelen;
298 buf[p++] = '/';
299 pdepth++;
300 }
301
302 if (offset == nodeoffset) {
303 if (pdepth < (depth + 1))
304 return -FDT_ERR_NOSPACE;
305
306 if (p > 1) /* special case so that root path is "/", not "" */
307 p--;
308 buf[p] = '\0';
309 return p;
310 }
311 }
312
313 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
314 return -FDT_ERR_BADOFFSET;
315 else if (offset == -FDT_ERR_BADOFFSET)
316 return -FDT_ERR_BADSTRUCTURE;
317
318 return offset; /* error from fdt_next_node() */
319}
320
321int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
322 int supernodedepth, int *nodedepth)
323{
324 int offset, depth;
325 int supernodeoffset = -FDT_ERR_INTERNAL;
326
327 FDT_CHECK_HEADER(fdt);
328
329 if (supernodedepth < 0)
330 return -FDT_ERR_NOTFOUND;
331
332 for (offset = 0, depth = 0;
333 (offset >= 0) && (offset <= nodeoffset);
334 offset = fdt_next_node(fdt, offset, &depth)) {
335 if (depth == supernodedepth)
336 supernodeoffset = offset;
337
338 if (offset == nodeoffset) {
339 if (nodedepth)
340 *nodedepth = depth;
341
342 if (supernodedepth > depth)
343 return -FDT_ERR_NOTFOUND;
344 else
345 return supernodeoffset;
346 }
347 }
348
349 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
350 return -FDT_ERR_BADOFFSET;
351 else if (offset == -FDT_ERR_BADOFFSET)
352 return -FDT_ERR_BADSTRUCTURE;
353
354 return offset; /* error from fdt_next_node() */
355}
356
357int fdt_node_depth(const void *fdt, int nodeoffset)
358{
359 int nodedepth;
360 int err;
361
362 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
363 if (err)
364 return (err < 0) ? err : -FDT_ERR_INTERNAL;
365 return nodedepth;
366}
367
368int fdt_parent_offset(const void *fdt, int nodeoffset)
369{
370 int nodedepth = fdt_node_depth(fdt, nodeoffset);
371
372 if (nodedepth < 0)
373 return nodedepth;
374 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
375 nodedepth - 1, NULL);
376}
377
378int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
379 const char *propname,
380 const void *propval, int proplen)
381{
382 int offset;
383 const void *val;
384 int len;
385
386 FDT_CHECK_HEADER(fdt);
387
388 /* FIXME: The algorithm here is pretty horrible: we scan each
389 * property of a node in fdt_getprop(), then if that didn't
390 * find what we want, we scan over them again making our way
391 * to the next node. Still it's the easiest to implement
392 * approach; performance can come later. */
393 for (offset = fdt_next_node(fdt, startoffset, NULL);
394 offset >= 0;
395 offset = fdt_next_node(fdt, offset, NULL)) {
396 val = fdt_getprop(fdt, offset, propname, &len);
397 if (val && (len == proplen)
398 && (memcmp(val, propval, len) == 0))
399 return offset;
400 }
401
402 return offset; /* error from fdt_next_node() */
403}
404
405int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
406{
407 if ((phandle == 0) || (phandle == -1))
408 return -FDT_ERR_BADPHANDLE;
409 phandle = cpu_to_fdt32(phandle);
410 return fdt_node_offset_by_prop_value(fdt, -1, "linux,phandle",
411 &phandle, sizeof(phandle));
412}
413
414static int _stringlist_contains(const char *strlist, int listlen, const char *str)
415{
416 int len = strlen(str);
417 const char *p;
418
419 while (listlen >= len) {
420 if (memcmp(str, strlist, len+1) == 0)
421 return 1;
422 p = memchr(strlist, '\0', listlen);
423 if (!p)
424 return 0; /* malformed strlist.. */
425 listlen -= (p-strlist) + 1;
426 strlist = p + 1;
427 }
428 return 0;
429}
430
431int fdt_node_check_compatible(const void *fdt, int nodeoffset,
432 const char *compatible)
433{
434 const void *prop;
435 int len;
436
437 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
438 if (!prop)
439 return len;
440 if (_stringlist_contains(prop, len, compatible))
441 return 0;
442 else
443 return 1;
444}
445
446int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
447 const char *compatible)
448{
449 int offset, err;
450
451 FDT_CHECK_HEADER(fdt);
452
453 /* FIXME: The algorithm here is pretty horrible: we scan each
454 * property of a node in fdt_node_check_compatible(), then if
455 * that didn't find what we want, we scan over them again
456 * making our way to the next node. Still it's the easiest to
457 * implement approach; performance can come later. */
458 for (offset = fdt_next_node(fdt, startoffset, NULL);
459 offset >= 0;
460 offset = fdt_next_node(fdt, offset, NULL)) {
461 err = fdt_node_check_compatible(fdt, offset, compatible);
462 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
463 return err;
464 else if (err == 0)
465 return offset;
466 }
467
468 return offset; /* error from fdt_next_node() */
469}
1// SPDX-License-Identifier: (GPL-2.0-or-later OR BSD-2-Clause)
2/*
3 * libfdt - Flat Device Tree manipulation
4 * Copyright (C) 2006 David Gibson, IBM Corporation.
5 */
6#include "libfdt_env.h"
7
8#include <fdt.h>
9#include <libfdt.h>
10
11#include "libfdt_internal.h"
12
13static int fdt_nodename_eq_(const void *fdt, int offset,
14 const char *s, int len)
15{
16 int olen;
17 const char *p = fdt_get_name(fdt, offset, &olen);
18
19 if (!p || olen < len)
20 /* short match */
21 return 0;
22
23 if (memcmp(p, s, len) != 0)
24 return 0;
25
26 if (p[len] == '\0')
27 return 1;
28 else if (!memchr(s, '@', len) && (p[len] == '@'))
29 return 1;
30 else
31 return 0;
32}
33
34const char *fdt_get_string(const void *fdt, int stroffset, int *lenp)
35{
36 int32_t totalsize;
37 uint32_t absoffset;
38 size_t len;
39 int err;
40 const char *s, *n;
41
42 if (can_assume(VALID_INPUT)) {
43 s = (const char *)fdt + fdt_off_dt_strings(fdt) + stroffset;
44
45 if (lenp)
46 *lenp = strlen(s);
47 return s;
48 }
49 totalsize = fdt_ro_probe_(fdt);
50 err = totalsize;
51 if (totalsize < 0)
52 goto fail;
53
54 err = -FDT_ERR_BADOFFSET;
55 absoffset = stroffset + fdt_off_dt_strings(fdt);
56 if (absoffset >= totalsize)
57 goto fail;
58 len = totalsize - absoffset;
59
60 if (fdt_magic(fdt) == FDT_MAGIC) {
61 if (stroffset < 0)
62 goto fail;
63 if (can_assume(LATEST) || fdt_version(fdt) >= 17) {
64 if (stroffset >= fdt_size_dt_strings(fdt))
65 goto fail;
66 if ((fdt_size_dt_strings(fdt) - stroffset) < len)
67 len = fdt_size_dt_strings(fdt) - stroffset;
68 }
69 } else if (fdt_magic(fdt) == FDT_SW_MAGIC) {
70 if ((stroffset >= 0)
71 || (stroffset < -fdt_size_dt_strings(fdt)))
72 goto fail;
73 if ((-stroffset) < len)
74 len = -stroffset;
75 } else {
76 err = -FDT_ERR_INTERNAL;
77 goto fail;
78 }
79
80 s = (const char *)fdt + absoffset;
81 n = memchr(s, '\0', len);
82 if (!n) {
83 /* missing terminating NULL */
84 err = -FDT_ERR_TRUNCATED;
85 goto fail;
86 }
87
88 if (lenp)
89 *lenp = n - s;
90 return s;
91
92fail:
93 if (lenp)
94 *lenp = err;
95 return NULL;
96}
97
98const char *fdt_string(const void *fdt, int stroffset)
99{
100 return fdt_get_string(fdt, stroffset, NULL);
101}
102
103static int fdt_string_eq_(const void *fdt, int stroffset,
104 const char *s, int len)
105{
106 int slen;
107 const char *p = fdt_get_string(fdt, stroffset, &slen);
108
109 return p && (slen == len) && (memcmp(p, s, len) == 0);
110}
111
112int fdt_find_max_phandle(const void *fdt, uint32_t *phandle)
113{
114 uint32_t max = 0;
115 int offset = -1;
116
117 while (true) {
118 uint32_t value;
119
120 offset = fdt_next_node(fdt, offset, NULL);
121 if (offset < 0) {
122 if (offset == -FDT_ERR_NOTFOUND)
123 break;
124
125 return offset;
126 }
127
128 value = fdt_get_phandle(fdt, offset);
129
130 if (value > max)
131 max = value;
132 }
133
134 if (phandle)
135 *phandle = max;
136
137 return 0;
138}
139
140int fdt_generate_phandle(const void *fdt, uint32_t *phandle)
141{
142 uint32_t max;
143 int err;
144
145 err = fdt_find_max_phandle(fdt, &max);
146 if (err < 0)
147 return err;
148
149 if (max == FDT_MAX_PHANDLE)
150 return -FDT_ERR_NOPHANDLES;
151
152 if (phandle)
153 *phandle = max + 1;
154
155 return 0;
156}
157
158static const struct fdt_reserve_entry *fdt_mem_rsv(const void *fdt, int n)
159{
160 int offset = n * sizeof(struct fdt_reserve_entry);
161 int absoffset = fdt_off_mem_rsvmap(fdt) + offset;
162
163 if (!can_assume(VALID_INPUT)) {
164 if (absoffset < fdt_off_mem_rsvmap(fdt))
165 return NULL;
166 if (absoffset > fdt_totalsize(fdt) -
167 sizeof(struct fdt_reserve_entry))
168 return NULL;
169 }
170 return fdt_mem_rsv_(fdt, n);
171}
172
173int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
174{
175 const struct fdt_reserve_entry *re;
176
177 FDT_RO_PROBE(fdt);
178 re = fdt_mem_rsv(fdt, n);
179 if (!can_assume(VALID_INPUT) && !re)
180 return -FDT_ERR_BADOFFSET;
181
182 *address = fdt64_ld(&re->address);
183 *size = fdt64_ld(&re->size);
184 return 0;
185}
186
187int fdt_num_mem_rsv(const void *fdt)
188{
189 int i;
190 const struct fdt_reserve_entry *re;
191
192 for (i = 0; (re = fdt_mem_rsv(fdt, i)) != NULL; i++) {
193 if (fdt64_ld(&re->size) == 0)
194 return i;
195 }
196 return -FDT_ERR_TRUNCATED;
197}
198
199static int nextprop_(const void *fdt, int offset)
200{
201 uint32_t tag;
202 int nextoffset;
203
204 do {
205 tag = fdt_next_tag(fdt, offset, &nextoffset);
206
207 switch (tag) {
208 case FDT_END:
209 if (nextoffset >= 0)
210 return -FDT_ERR_BADSTRUCTURE;
211 else
212 return nextoffset;
213
214 case FDT_PROP:
215 return offset;
216 }
217 offset = nextoffset;
218 } while (tag == FDT_NOP);
219
220 return -FDT_ERR_NOTFOUND;
221}
222
223int fdt_subnode_offset_namelen(const void *fdt, int offset,
224 const char *name, int namelen)
225{
226 int depth;
227
228 FDT_RO_PROBE(fdt);
229
230 for (depth = 0;
231 (offset >= 0) && (depth >= 0);
232 offset = fdt_next_node(fdt, offset, &depth))
233 if ((depth == 1)
234 && fdt_nodename_eq_(fdt, offset, name, namelen))
235 return offset;
236
237 if (depth < 0)
238 return -FDT_ERR_NOTFOUND;
239 return offset; /* error */
240}
241
242int fdt_subnode_offset(const void *fdt, int parentoffset,
243 const char *name)
244{
245 return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name));
246}
247
248int fdt_path_offset_namelen(const void *fdt, const char *path, int namelen)
249{
250 const char *end = path + namelen;
251 const char *p = path;
252 int offset = 0;
253
254 FDT_RO_PROBE(fdt);
255
256 /* see if we have an alias */
257 if (*path != '/') {
258 const char *q = memchr(path, '/', end - p);
259
260 if (!q)
261 q = end;
262
263 p = fdt_get_alias_namelen(fdt, p, q - p);
264 if (!p)
265 return -FDT_ERR_BADPATH;
266 offset = fdt_path_offset(fdt, p);
267
268 p = q;
269 }
270
271 while (p < end) {
272 const char *q;
273
274 while (*p == '/') {
275 p++;
276 if (p == end)
277 return offset;
278 }
279 q = memchr(p, '/', end - p);
280 if (! q)
281 q = end;
282
283 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
284 if (offset < 0)
285 return offset;
286
287 p = q;
288 }
289
290 return offset;
291}
292
293int fdt_path_offset(const void *fdt, const char *path)
294{
295 return fdt_path_offset_namelen(fdt, path, strlen(path));
296}
297
298const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
299{
300 const struct fdt_node_header *nh = fdt_offset_ptr_(fdt, nodeoffset);
301 const char *nameptr;
302 int err;
303
304 if (((err = fdt_ro_probe_(fdt)) < 0)
305 || ((err = fdt_check_node_offset_(fdt, nodeoffset)) < 0))
306 goto fail;
307
308 nameptr = nh->name;
309
310 if (!can_assume(LATEST) && fdt_version(fdt) < 0x10) {
311 /*
312 * For old FDT versions, match the naming conventions of V16:
313 * give only the leaf name (after all /). The actual tree
314 * contents are loosely checked.
315 */
316 const char *leaf;
317 leaf = strrchr(nameptr, '/');
318 if (leaf == NULL) {
319 err = -FDT_ERR_BADSTRUCTURE;
320 goto fail;
321 }
322 nameptr = leaf+1;
323 }
324
325 if (len)
326 *len = strlen(nameptr);
327
328 return nameptr;
329
330 fail:
331 if (len)
332 *len = err;
333 return NULL;
334}
335
336int fdt_first_property_offset(const void *fdt, int nodeoffset)
337{
338 int offset;
339
340 if ((offset = fdt_check_node_offset_(fdt, nodeoffset)) < 0)
341 return offset;
342
343 return nextprop_(fdt, offset);
344}
345
346int fdt_next_property_offset(const void *fdt, int offset)
347{
348 if ((offset = fdt_check_prop_offset_(fdt, offset)) < 0)
349 return offset;
350
351 return nextprop_(fdt, offset);
352}
353
354static const struct fdt_property *fdt_get_property_by_offset_(const void *fdt,
355 int offset,
356 int *lenp)
357{
358 int err;
359 const struct fdt_property *prop;
360
361 if (!can_assume(VALID_INPUT) &&
362 (err = fdt_check_prop_offset_(fdt, offset)) < 0) {
363 if (lenp)
364 *lenp = err;
365 return NULL;
366 }
367
368 prop = fdt_offset_ptr_(fdt, offset);
369
370 if (lenp)
371 *lenp = fdt32_ld(&prop->len);
372
373 return prop;
374}
375
376const struct fdt_property *fdt_get_property_by_offset(const void *fdt,
377 int offset,
378 int *lenp)
379{
380 /* Prior to version 16, properties may need realignment
381 * and this API does not work. fdt_getprop_*() will, however. */
382
383 if (!can_assume(LATEST) && fdt_version(fdt) < 0x10) {
384 if (lenp)
385 *lenp = -FDT_ERR_BADVERSION;
386 return NULL;
387 }
388
389 return fdt_get_property_by_offset_(fdt, offset, lenp);
390}
391
392static const struct fdt_property *fdt_get_property_namelen_(const void *fdt,
393 int offset,
394 const char *name,
395 int namelen,
396 int *lenp,
397 int *poffset)
398{
399 for (offset = fdt_first_property_offset(fdt, offset);
400 (offset >= 0);
401 (offset = fdt_next_property_offset(fdt, offset))) {
402 const struct fdt_property *prop;
403
404 prop = fdt_get_property_by_offset_(fdt, offset, lenp);
405 if (!can_assume(LIBFDT_FLAWLESS) && !prop) {
406 offset = -FDT_ERR_INTERNAL;
407 break;
408 }
409 if (fdt_string_eq_(fdt, fdt32_ld(&prop->nameoff),
410 name, namelen)) {
411 if (poffset)
412 *poffset = offset;
413 return prop;
414 }
415 }
416
417 if (lenp)
418 *lenp = offset;
419 return NULL;
420}
421
422
423const struct fdt_property *fdt_get_property_namelen(const void *fdt,
424 int offset,
425 const char *name,
426 int namelen, int *lenp)
427{
428 /* Prior to version 16, properties may need realignment
429 * and this API does not work. fdt_getprop_*() will, however. */
430 if (!can_assume(LATEST) && fdt_version(fdt) < 0x10) {
431 if (lenp)
432 *lenp = -FDT_ERR_BADVERSION;
433 return NULL;
434 }
435
436 return fdt_get_property_namelen_(fdt, offset, name, namelen, lenp,
437 NULL);
438}
439
440
441const struct fdt_property *fdt_get_property(const void *fdt,
442 int nodeoffset,
443 const char *name, int *lenp)
444{
445 return fdt_get_property_namelen(fdt, nodeoffset, name,
446 strlen(name), lenp);
447}
448
449const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
450 const char *name, int namelen, int *lenp)
451{
452 int poffset;
453 const struct fdt_property *prop;
454
455 prop = fdt_get_property_namelen_(fdt, nodeoffset, name, namelen, lenp,
456 &poffset);
457 if (!prop)
458 return NULL;
459
460 /* Handle realignment */
461 if (!can_assume(LATEST) && fdt_version(fdt) < 0x10 &&
462 (poffset + sizeof(*prop)) % 8 && fdt32_ld(&prop->len) >= 8)
463 return prop->data + 4;
464 return prop->data;
465}
466
467const void *fdt_getprop_by_offset(const void *fdt, int offset,
468 const char **namep, int *lenp)
469{
470 const struct fdt_property *prop;
471
472 prop = fdt_get_property_by_offset_(fdt, offset, lenp);
473 if (!prop)
474 return NULL;
475 if (namep) {
476 const char *name;
477 int namelen;
478
479 if (!can_assume(VALID_INPUT)) {
480 name = fdt_get_string(fdt, fdt32_ld(&prop->nameoff),
481 &namelen);
482 if (!name) {
483 if (lenp)
484 *lenp = namelen;
485 return NULL;
486 }
487 *namep = name;
488 } else {
489 *namep = fdt_string(fdt, fdt32_ld(&prop->nameoff));
490 }
491 }
492
493 /* Handle realignment */
494 if (!can_assume(LATEST) && fdt_version(fdt) < 0x10 &&
495 (offset + sizeof(*prop)) % 8 && fdt32_ld(&prop->len) >= 8)
496 return prop->data + 4;
497 return prop->data;
498}
499
500const void *fdt_getprop(const void *fdt, int nodeoffset,
501 const char *name, int *lenp)
502{
503 return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp);
504}
505
506uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
507{
508 const fdt32_t *php;
509 int len;
510
511 /* FIXME: This is a bit sub-optimal, since we potentially scan
512 * over all the properties twice. */
513 php = fdt_getprop(fdt, nodeoffset, "phandle", &len);
514 if (!php || (len != sizeof(*php))) {
515 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
516 if (!php || (len != sizeof(*php)))
517 return 0;
518 }
519
520 return fdt32_ld(php);
521}
522
523const char *fdt_get_alias_namelen(const void *fdt,
524 const char *name, int namelen)
525{
526 int aliasoffset;
527
528 aliasoffset = fdt_path_offset(fdt, "/aliases");
529 if (aliasoffset < 0)
530 return NULL;
531
532 return fdt_getprop_namelen(fdt, aliasoffset, name, namelen, NULL);
533}
534
535const char *fdt_get_alias(const void *fdt, const char *name)
536{
537 return fdt_get_alias_namelen(fdt, name, strlen(name));
538}
539
540int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
541{
542 int pdepth = 0, p = 0;
543 int offset, depth, namelen;
544 const char *name;
545
546 FDT_RO_PROBE(fdt);
547
548 if (buflen < 2)
549 return -FDT_ERR_NOSPACE;
550
551 for (offset = 0, depth = 0;
552 (offset >= 0) && (offset <= nodeoffset);
553 offset = fdt_next_node(fdt, offset, &depth)) {
554 while (pdepth > depth) {
555 do {
556 p--;
557 } while (buf[p-1] != '/');
558 pdepth--;
559 }
560
561 if (pdepth >= depth) {
562 name = fdt_get_name(fdt, offset, &namelen);
563 if (!name)
564 return namelen;
565 if ((p + namelen + 1) <= buflen) {
566 memcpy(buf + p, name, namelen);
567 p += namelen;
568 buf[p++] = '/';
569 pdepth++;
570 }
571 }
572
573 if (offset == nodeoffset) {
574 if (pdepth < (depth + 1))
575 return -FDT_ERR_NOSPACE;
576
577 if (p > 1) /* special case so that root path is "/", not "" */
578 p--;
579 buf[p] = '\0';
580 return 0;
581 }
582 }
583
584 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
585 return -FDT_ERR_BADOFFSET;
586 else if (offset == -FDT_ERR_BADOFFSET)
587 return -FDT_ERR_BADSTRUCTURE;
588
589 return offset; /* error from fdt_next_node() */
590}
591
592int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
593 int supernodedepth, int *nodedepth)
594{
595 int offset, depth;
596 int supernodeoffset = -FDT_ERR_INTERNAL;
597
598 FDT_RO_PROBE(fdt);
599
600 if (supernodedepth < 0)
601 return -FDT_ERR_NOTFOUND;
602
603 for (offset = 0, depth = 0;
604 (offset >= 0) && (offset <= nodeoffset);
605 offset = fdt_next_node(fdt, offset, &depth)) {
606 if (depth == supernodedepth)
607 supernodeoffset = offset;
608
609 if (offset == nodeoffset) {
610 if (nodedepth)
611 *nodedepth = depth;
612
613 if (supernodedepth > depth)
614 return -FDT_ERR_NOTFOUND;
615 else
616 return supernodeoffset;
617 }
618 }
619
620 if (!can_assume(VALID_INPUT)) {
621 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
622 return -FDT_ERR_BADOFFSET;
623 else if (offset == -FDT_ERR_BADOFFSET)
624 return -FDT_ERR_BADSTRUCTURE;
625 }
626
627 return offset; /* error from fdt_next_node() */
628}
629
630int fdt_node_depth(const void *fdt, int nodeoffset)
631{
632 int nodedepth;
633 int err;
634
635 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
636 if (err)
637 return (can_assume(LIBFDT_FLAWLESS) || err < 0) ? err :
638 -FDT_ERR_INTERNAL;
639 return nodedepth;
640}
641
642int fdt_parent_offset(const void *fdt, int nodeoffset)
643{
644 int nodedepth = fdt_node_depth(fdt, nodeoffset);
645
646 if (nodedepth < 0)
647 return nodedepth;
648 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
649 nodedepth - 1, NULL);
650}
651
652int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
653 const char *propname,
654 const void *propval, int proplen)
655{
656 int offset;
657 const void *val;
658 int len;
659
660 FDT_RO_PROBE(fdt);
661
662 /* FIXME: The algorithm here is pretty horrible: we scan each
663 * property of a node in fdt_getprop(), then if that didn't
664 * find what we want, we scan over them again making our way
665 * to the next node. Still it's the easiest to implement
666 * approach; performance can come later. */
667 for (offset = fdt_next_node(fdt, startoffset, NULL);
668 offset >= 0;
669 offset = fdt_next_node(fdt, offset, NULL)) {
670 val = fdt_getprop(fdt, offset, propname, &len);
671 if (val && (len == proplen)
672 && (memcmp(val, propval, len) == 0))
673 return offset;
674 }
675
676 return offset; /* error from fdt_next_node() */
677}
678
679int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
680{
681 int offset;
682
683 if ((phandle == 0) || (phandle == -1))
684 return -FDT_ERR_BADPHANDLE;
685
686 FDT_RO_PROBE(fdt);
687
688 /* FIXME: The algorithm here is pretty horrible: we
689 * potentially scan each property of a node in
690 * fdt_get_phandle(), then if that didn't find what
691 * we want, we scan over them again making our way to the next
692 * node. Still it's the easiest to implement approach;
693 * performance can come later. */
694 for (offset = fdt_next_node(fdt, -1, NULL);
695 offset >= 0;
696 offset = fdt_next_node(fdt, offset, NULL)) {
697 if (fdt_get_phandle(fdt, offset) == phandle)
698 return offset;
699 }
700
701 return offset; /* error from fdt_next_node() */
702}
703
704int fdt_stringlist_contains(const char *strlist, int listlen, const char *str)
705{
706 int len = strlen(str);
707 const char *p;
708
709 while (listlen >= len) {
710 if (memcmp(str, strlist, len+1) == 0)
711 return 1;
712 p = memchr(strlist, '\0', listlen);
713 if (!p)
714 return 0; /* malformed strlist.. */
715 listlen -= (p-strlist) + 1;
716 strlist = p + 1;
717 }
718 return 0;
719}
720
721int fdt_stringlist_count(const void *fdt, int nodeoffset, const char *property)
722{
723 const char *list, *end;
724 int length, count = 0;
725
726 list = fdt_getprop(fdt, nodeoffset, property, &length);
727 if (!list)
728 return length;
729
730 end = list + length;
731
732 while (list < end) {
733 length = strnlen(list, end - list) + 1;
734
735 /* Abort if the last string isn't properly NUL-terminated. */
736 if (list + length > end)
737 return -FDT_ERR_BADVALUE;
738
739 list += length;
740 count++;
741 }
742
743 return count;
744}
745
746int fdt_stringlist_search(const void *fdt, int nodeoffset, const char *property,
747 const char *string)
748{
749 int length, len, idx = 0;
750 const char *list, *end;
751
752 list = fdt_getprop(fdt, nodeoffset, property, &length);
753 if (!list)
754 return length;
755
756 len = strlen(string) + 1;
757 end = list + length;
758
759 while (list < end) {
760 length = strnlen(list, end - list) + 1;
761
762 /* Abort if the last string isn't properly NUL-terminated. */
763 if (list + length > end)
764 return -FDT_ERR_BADVALUE;
765
766 if (length == len && memcmp(list, string, length) == 0)
767 return idx;
768
769 list += length;
770 idx++;
771 }
772
773 return -FDT_ERR_NOTFOUND;
774}
775
776const char *fdt_stringlist_get(const void *fdt, int nodeoffset,
777 const char *property, int idx,
778 int *lenp)
779{
780 const char *list, *end;
781 int length;
782
783 list = fdt_getprop(fdt, nodeoffset, property, &length);
784 if (!list) {
785 if (lenp)
786 *lenp = length;
787
788 return NULL;
789 }
790
791 end = list + length;
792
793 while (list < end) {
794 length = strnlen(list, end - list) + 1;
795
796 /* Abort if the last string isn't properly NUL-terminated. */
797 if (list + length > end) {
798 if (lenp)
799 *lenp = -FDT_ERR_BADVALUE;
800
801 return NULL;
802 }
803
804 if (idx == 0) {
805 if (lenp)
806 *lenp = length - 1;
807
808 return list;
809 }
810
811 list += length;
812 idx--;
813 }
814
815 if (lenp)
816 *lenp = -FDT_ERR_NOTFOUND;
817
818 return NULL;
819}
820
821int fdt_node_check_compatible(const void *fdt, int nodeoffset,
822 const char *compatible)
823{
824 const void *prop;
825 int len;
826
827 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
828 if (!prop)
829 return len;
830
831 return !fdt_stringlist_contains(prop, len, compatible);
832}
833
834int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
835 const char *compatible)
836{
837 int offset, err;
838
839 FDT_RO_PROBE(fdt);
840
841 /* FIXME: The algorithm here is pretty horrible: we scan each
842 * property of a node in fdt_node_check_compatible(), then if
843 * that didn't find what we want, we scan over them again
844 * making our way to the next node. Still it's the easiest to
845 * implement approach; performance can come later. */
846 for (offset = fdt_next_node(fdt, startoffset, NULL);
847 offset >= 0;
848 offset = fdt_next_node(fdt, offset, NULL)) {
849 err = fdt_node_check_compatible(fdt, offset, compatible);
850 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
851 return err;
852 else if (err == 0)
853 return offset;
854 }
855
856 return offset; /* error from fdt_next_node() */
857}