blob: 1933010fd8f170a020ee1ab7cffd282ce2ff00d2 [file] [log] [blame]
Gerald Van Baren35748172007-03-31 12:00:56 -04001/*
2 * libfdt - Flat Device Tree manipulation
3 * Copyright (C) 2006 David Gibson, IBM Corporation.
4 *
Kumar Gala8d04f022007-10-24 11:04:22 -05005 * libfdt is dual licensed: you can use it either under the terms of
6 * the GPL, or the BSD license, at your option.
Gerald Van Baren35748172007-03-31 12:00:56 -04007 *
Kumar Gala8d04f022007-10-24 11:04:22 -05008 * 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.
Gerald Van Baren35748172007-03-31 12:00:56 -040012 *
Kumar Gala8d04f022007-10-24 11:04:22 -050013 * 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.
Gerald Van Baren35748172007-03-31 12:00:56 -040050 */
51#include "libfdt_env.h"
52
Bartlomiej Sieka8cf30802008-02-29 16:00:24 +010053#ifndef USE_HOSTCC
Gerald Van Baren35748172007-03-31 12:00:56 -040054#include <fdt.h>
55#include <libfdt.h>
Bartlomiej Sieka8cf30802008-02-29 16:00:24 +010056#else
57#include "fdt_host.h"
58#endif
Gerald Van Baren35748172007-03-31 12:00:56 -040059
60#include "libfdt_internal.h"
61
David Gibsonfc7758e2008-07-09 14:10:24 +100062static int _fdt_nodename_eq(const void *fdt, int offset,
63 const char *s, int len)
Gerald Van Baren35748172007-03-31 12:00:56 -040064{
David Gibsonae0b5902008-02-12 11:58:31 +110065 const char *p = fdt_offset_ptr(fdt, offset + FDT_TAGSIZE, len+1);
Gerald Van Baren35748172007-03-31 12:00:56 -040066
67 if (! p)
68 /* short match */
69 return 0;
70
71 if (memcmp(p, s, len) != 0)
72 return 0;
73
Kumar Gala8d04f022007-10-24 11:04:22 -050074 if (p[len] == '\0')
75 return 1;
76 else if (!memchr(s, '@', len) && (p[len] == '@'))
77 return 1;
78 else
Gerald Van Baren35748172007-03-31 12:00:56 -040079 return 0;
Gerald Van Baren35748172007-03-31 12:00:56 -040080}
81
Kumar Gala8d04f022007-10-24 11:04:22 -050082const char *fdt_string(const void *fdt, int stroffset)
Gerald Van Baren35748172007-03-31 12:00:56 -040083{
David Gibsonc6683022008-07-07 10:14:15 +100084 return (const char *)fdt + fdt_off_dt_strings(fdt) + stroffset;
Gerald Van Baren35748172007-03-31 12:00:56 -040085}
86
David Gibson02193992008-08-06 14:50:49 +100087static int _fdt_string_eq(const void *fdt, int stroffset,
88 const char *s, int len)
89{
90 const char *p = fdt_string(fdt, stroffset);
91
92 return (strlen(p) == len) && (memcmp(p, s, len) == 0);
93}
94
Kumar Gala8d04f022007-10-24 11:04:22 -050095int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
96{
David Gibsonfc7758e2008-07-09 14:10:24 +100097 FDT_CHECK_HEADER(fdt);
Kumar Gala8d04f022007-10-24 11:04:22 -050098 *address = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->address);
99 *size = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->size);
100 return 0;
101}
102
103int fdt_num_mem_rsv(const void *fdt)
104{
105 int i = 0;
106
107 while (fdt64_to_cpu(_fdt_mem_rsv(fdt, i)->size) != 0)
108 i++;
109 return i;
110}
111
David Gibsond1c63142010-03-09 17:39:14 +1100112static int _nextprop(const void *fdt, int offset)
113{
114 uint32_t tag;
115 int nextoffset;
116
117 do {
118 tag = fdt_next_tag(fdt, offset, &nextoffset);
119
120 switch (tag) {
121 case FDT_END:
122 if (nextoffset >= 0)
123 return -FDT_ERR_BADSTRUCTURE;
124 else
125 return nextoffset;
126
127 case FDT_PROP:
128 return offset;
129 }
130 offset = nextoffset;
131 } while (tag == FDT_NOP);
132
133 return -FDT_ERR_NOTFOUND;
134}
135
David Gibsonae0b5902008-02-12 11:58:31 +1100136int fdt_subnode_offset_namelen(const void *fdt, int offset,
Gerald Van Baren35748172007-03-31 12:00:56 -0400137 const char *name, int namelen)
138{
David Gibson2c0b8432009-02-06 14:01:56 +1100139 int depth;
Gerald Van Baren35748172007-03-31 12:00:56 -0400140
David Gibsonfc7758e2008-07-09 14:10:24 +1000141 FDT_CHECK_HEADER(fdt);
Gerald Van Baren35748172007-03-31 12:00:56 -0400142
David Gibson2c0b8432009-02-06 14:01:56 +1100143 for (depth = 0;
144 (offset >= 0) && (depth >= 0);
145 offset = fdt_next_node(fdt, offset, &depth))
146 if ((depth == 1)
147 && _fdt_nodename_eq(fdt, offset, name, namelen))
David Gibsonae0b5902008-02-12 11:58:31 +1100148 return offset;
Gerald Van Baren35748172007-03-31 12:00:56 -0400149
David Gibson2c0b8432009-02-06 14:01:56 +1100150 if (depth < 0)
David Gibson4bc7dee2008-10-29 23:27:45 -0500151 return -FDT_ERR_NOTFOUND;
David Gibson2c0b8432009-02-06 14:01:56 +1100152 return offset; /* error */
Gerald Van Baren35748172007-03-31 12:00:56 -0400153}
154
155int fdt_subnode_offset(const void *fdt, int parentoffset,
156 const char *name)
157{
158 return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name));
159}
160
Kumar Gala8d04f022007-10-24 11:04:22 -0500161int fdt_path_offset(const void *fdt, const char *path)
Gerald Van Baren35748172007-03-31 12:00:56 -0400162{
163 const char *end = path + strlen(path);
164 const char *p = path;
165 int offset = 0;
166
David Gibsonfc7758e2008-07-09 14:10:24 +1000167 FDT_CHECK_HEADER(fdt);
Gerald Van Baren35748172007-03-31 12:00:56 -0400168
Kumar Galafeeca3f2008-08-14 08:28:19 -0500169 /* see if we have an alias */
170 if (*path != '/') {
David Gibson9a6cf732008-08-20 16:55:14 +1000171 const char *q = strchr(path, '/');
Kumar Galafeeca3f2008-08-14 08:28:19 -0500172
Kumar Galafeeca3f2008-08-14 08:28:19 -0500173 if (!q)
174 q = end;
175
David Gibson9a6cf732008-08-20 16:55:14 +1000176 p = fdt_get_alias_namelen(fdt, p, q - p);
Kumar Galafeeca3f2008-08-14 08:28:19 -0500177 if (!p)
178 return -FDT_ERR_BADPATH;
179 offset = fdt_path_offset(fdt, p);
180
181 p = q;
182 }
Gerald Van Baren35748172007-03-31 12:00:56 -0400183
184 while (*p) {
185 const char *q;
186
187 while (*p == '/')
188 p++;
189 if (! *p)
Kumar Gala8d04f022007-10-24 11:04:22 -0500190 return offset;
Gerald Van Baren35748172007-03-31 12:00:56 -0400191 q = strchr(p, '/');
192 if (! q)
193 q = end;
194
195 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
196 if (offset < 0)
197 return offset;
198
199 p = q;
200 }
201
Gerald Van Barenaea03c42007-03-31 14:30:53 -0400202 return offset;
Gerald Van Baren35748172007-03-31 12:00:56 -0400203}
204
Kumar Gala8d04f022007-10-24 11:04:22 -0500205const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
Gerald Van Baren35748172007-03-31 12:00:56 -0400206{
David Gibson2f08bfa2008-05-20 17:19:11 +1000207 const struct fdt_node_header *nh = _fdt_offset_ptr(fdt, nodeoffset);
Kumar Gala8d04f022007-10-24 11:04:22 -0500208 int err;
209
David Gibson2f08bfa2008-05-20 17:19:11 +1000210 if (((err = fdt_check_header(fdt)) != 0)
211 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
212 goto fail;
Kumar Gala8d04f022007-10-24 11:04:22 -0500213
214 if (len)
215 *len = strlen(nh->name);
216
217 return nh->name;
218
219 fail:
220 if (len)
221 *len = err;
222 return NULL;
223}
224
David Gibsond1c63142010-03-09 17:39:14 +1100225int fdt_first_property_offset(const void *fdt, int nodeoffset)
226{
227 int offset;
228
229 if ((offset = _fdt_check_node_offset(fdt, nodeoffset)) < 0)
230 return offset;
231
232 return _nextprop(fdt, offset);
233}
234
235int fdt_next_property_offset(const void *fdt, int offset)
236{
237 if ((offset = _fdt_check_prop_offset(fdt, offset)) < 0)
238 return offset;
239
240 return _nextprop(fdt, offset);
241}
242
243const struct fdt_property *fdt_get_property_by_offset(const void *fdt,
244 int offset,
245 int *lenp)
246{
247 int err;
248 const struct fdt_property *prop;
249
250 if ((err = _fdt_check_prop_offset(fdt, offset)) < 0) {
251 if (lenp)
252 *lenp = err;
253 return NULL;
254 }
255
256 prop = _fdt_offset_ptr(fdt, offset);
257
258 if (lenp)
259 *lenp = fdt32_to_cpu(prop->len);
260
261 return prop;
262}
263
David Gibson02193992008-08-06 14:50:49 +1000264const struct fdt_property *fdt_get_property_namelen(const void *fdt,
David Gibsond1c63142010-03-09 17:39:14 +1100265 int offset,
David Gibson02193992008-08-06 14:50:49 +1000266 const char *name,
267 int namelen, int *lenp)
Kumar Gala8d04f022007-10-24 11:04:22 -0500268{
David Gibsond1c63142010-03-09 17:39:14 +1100269 for (offset = fdt_first_property_offset(fdt, offset);
270 (offset >= 0);
271 (offset = fdt_next_property_offset(fdt, offset))) {
272 const struct fdt_property *prop;
Gerald Van Baren35748172007-03-31 12:00:56 -0400273
David Gibsond1c63142010-03-09 17:39:14 +1100274 if (!(prop = fdt_get_property_by_offset(fdt, offset, lenp))) {
275 offset = -FDT_ERR_INTERNAL;
Gerald Van Baren35748172007-03-31 12:00:56 -0400276 break;
Gerald Van Baren35748172007-03-31 12:00:56 -0400277 }
David Gibsond1c63142010-03-09 17:39:14 +1100278 if (_fdt_string_eq(fdt, fdt32_to_cpu(prop->nameoff),
279 name, namelen))
280 return prop;
281 }
Gerald Van Baren35748172007-03-31 12:00:56 -0400282
Gerald Van Baren35748172007-03-31 12:00:56 -0400283 if (lenp)
David Gibsond1c63142010-03-09 17:39:14 +1100284 *lenp = offset;
Gerald Van Baren35748172007-03-31 12:00:56 -0400285 return NULL;
286}
287
David Gibson02193992008-08-06 14:50:49 +1000288const struct fdt_property *fdt_get_property(const void *fdt,
289 int nodeoffset,
290 const char *name, int *lenp)
291{
292 return fdt_get_property_namelen(fdt, nodeoffset, name,
293 strlen(name), lenp);
294}
295
296const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
297 const char *name, int namelen, int *lenp)
Gerald Van Baren35748172007-03-31 12:00:56 -0400298{
299 const struct fdt_property *prop;
300
David Gibson02193992008-08-06 14:50:49 +1000301 prop = fdt_get_property_namelen(fdt, nodeoffset, name, namelen, lenp);
Gerald Van Baren35748172007-03-31 12:00:56 -0400302 if (! prop)
303 return NULL;
304
Kumar Gala8d04f022007-10-24 11:04:22 -0500305 return prop->data;
Gerald Van Baren35748172007-03-31 12:00:56 -0400306}
Gerald Van Baren3af0d582007-03-31 12:13:43 -0400307
David Gibsond1c63142010-03-09 17:39:14 +1100308const void *fdt_getprop_by_offset(const void *fdt, int offset,
309 const char **namep, int *lenp)
310{
311 const struct fdt_property *prop;
312
313 prop = fdt_get_property_by_offset(fdt, offset, lenp);
314 if (!prop)
315 return NULL;
316 if (namep)
317 *namep = fdt_string(fdt, fdt32_to_cpu(prop->nameoff));
318 return prop->data;
319}
320
David Gibson02193992008-08-06 14:50:49 +1000321const void *fdt_getprop(const void *fdt, int nodeoffset,
322 const char *name, int *lenp)
323{
324 return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp);
325}
326
Kumar Gala8d04f022007-10-24 11:04:22 -0500327uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
Gerald Van Baren3af0d582007-03-31 12:13:43 -0400328{
Kumar Gala8d04f022007-10-24 11:04:22 -0500329 const uint32_t *php;
330 int len;
331
David Gibson05a22ba2009-11-26 15:37:13 +1100332 /* FIXME: This is a bit sub-optimal, since we potentially scan
333 * over all the properties twice. */
334 php = fdt_getprop(fdt, nodeoffset, "phandle", &len);
335 if (!php || (len != sizeof(*php))) {
336 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
337 if (!php || (len != sizeof(*php)))
338 return 0;
339 }
Kumar Gala8d04f022007-10-24 11:04:22 -0500340
341 return fdt32_to_cpu(*php);
342}
343
David Gibson9a6cf732008-08-20 16:55:14 +1000344const char *fdt_get_alias_namelen(const void *fdt,
345 const char *name, int namelen)
346{
347 int aliasoffset;
348
349 aliasoffset = fdt_path_offset(fdt, "/aliases");
350 if (aliasoffset < 0)
351 return NULL;
352
353 return fdt_getprop_namelen(fdt, aliasoffset, name, namelen, NULL);
354}
355
356const char *fdt_get_alias(const void *fdt, const char *name)
357{
358 return fdt_get_alias_namelen(fdt, name, strlen(name));
359}
360
Kumar Gala8d04f022007-10-24 11:04:22 -0500361int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
362{
David Gibsonae0b5902008-02-12 11:58:31 +1100363 int pdepth = 0, p = 0;
364 int offset, depth, namelen;
Kumar Gala8d04f022007-10-24 11:04:22 -0500365 const char *name;
Gerald Van Baren3af0d582007-03-31 12:13:43 -0400366
David Gibsonfc7758e2008-07-09 14:10:24 +1000367 FDT_CHECK_HEADER(fdt);
Gerald Van Baren3af0d582007-03-31 12:13:43 -0400368
Kumar Gala8d04f022007-10-24 11:04:22 -0500369 if (buflen < 2)
Gerald Van Baren3f9f08c2007-04-14 22:46:41 -0400370 return -FDT_ERR_NOSPACE;
Kumar Gala8d04f022007-10-24 11:04:22 -0500371
David Gibsonae0b5902008-02-12 11:58:31 +1100372 for (offset = 0, depth = 0;
373 (offset >= 0) && (offset <= nodeoffset);
374 offset = fdt_next_node(fdt, offset, &depth)) {
David Gibsonae0b5902008-02-12 11:58:31 +1100375 while (pdepth > depth) {
376 do {
377 p--;
378 } while (buf[p-1] != '/');
379 pdepth--;
380 }
381
David Gibsonbbdbc7c2008-08-29 14:19:13 +1000382 if (pdepth >= depth) {
383 name = fdt_get_name(fdt, offset, &namelen);
384 if (!name)
385 return namelen;
386 if ((p + namelen + 1) <= buflen) {
387 memcpy(buf + p, name, namelen);
388 p += namelen;
389 buf[p++] = '/';
390 pdepth++;
391 }
David Gibsonae0b5902008-02-12 11:58:31 +1100392 }
Kumar Gala8d04f022007-10-24 11:04:22 -0500393
David Gibsonae0b5902008-02-12 11:58:31 +1100394 if (offset == nodeoffset) {
395 if (pdepth < (depth + 1))
396 return -FDT_ERR_NOSPACE;
397
398 if (p > 1) /* special case so that root path is "/", not "" */
Kumar Gala8d04f022007-10-24 11:04:22 -0500399 p--;
David Gibsonae0b5902008-02-12 11:58:31 +1100400 buf[p] = '\0';
David Gibsonbbdbc7c2008-08-29 14:19:13 +1000401 return 0;
Kumar Gala8d04f022007-10-24 11:04:22 -0500402 }
403 }
404
David Gibsonae0b5902008-02-12 11:58:31 +1100405 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
406 return -FDT_ERR_BADOFFSET;
407 else if (offset == -FDT_ERR_BADOFFSET)
408 return -FDT_ERR_BADSTRUCTURE;
Kumar Gala8d04f022007-10-24 11:04:22 -0500409
David Gibsonae0b5902008-02-12 11:58:31 +1100410 return offset; /* error from fdt_next_node() */
Kumar Gala8d04f022007-10-24 11:04:22 -0500411}
412
413int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
414 int supernodedepth, int *nodedepth)
415{
David Gibsonae0b5902008-02-12 11:58:31 +1100416 int offset, depth;
Kumar Gala8d04f022007-10-24 11:04:22 -0500417 int supernodeoffset = -FDT_ERR_INTERNAL;
418
David Gibsonfc7758e2008-07-09 14:10:24 +1000419 FDT_CHECK_HEADER(fdt);
Kumar Gala8d04f022007-10-24 11:04:22 -0500420
421 if (supernodedepth < 0)
422 return -FDT_ERR_NOTFOUND;
423
David Gibsonae0b5902008-02-12 11:58:31 +1100424 for (offset = 0, depth = 0;
425 (offset >= 0) && (offset <= nodeoffset);
426 offset = fdt_next_node(fdt, offset, &depth)) {
427 if (depth == supernodedepth)
428 supernodeoffset = offset;
Kumar Gala8d04f022007-10-24 11:04:22 -0500429
David Gibsonae0b5902008-02-12 11:58:31 +1100430 if (offset == nodeoffset) {
431 if (nodedepth)
432 *nodedepth = depth;
Kumar Gala8d04f022007-10-24 11:04:22 -0500433
David Gibsonae0b5902008-02-12 11:58:31 +1100434 if (supernodedepth > depth)
435 return -FDT_ERR_NOTFOUND;
436 else
437 return supernodeoffset;
Kumar Gala8d04f022007-10-24 11:04:22 -0500438 }
David Gibsonae0b5902008-02-12 11:58:31 +1100439 }
Kumar Gala8d04f022007-10-24 11:04:22 -0500440
David Gibsonae0b5902008-02-12 11:58:31 +1100441 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
442 return -FDT_ERR_BADOFFSET;
443 else if (offset == -FDT_ERR_BADOFFSET)
444 return -FDT_ERR_BADSTRUCTURE;
Kumar Gala8d04f022007-10-24 11:04:22 -0500445
David Gibsonae0b5902008-02-12 11:58:31 +1100446 return offset; /* error from fdt_next_node() */
Kumar Gala8d04f022007-10-24 11:04:22 -0500447}
448
449int fdt_node_depth(const void *fdt, int nodeoffset)
450{
451 int nodedepth;
452 int err;
453
454 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
455 if (err)
456 return (err < 0) ? err : -FDT_ERR_INTERNAL;
457 return nodedepth;
458}
459
460int fdt_parent_offset(const void *fdt, int nodeoffset)
461{
462 int nodedepth = fdt_node_depth(fdt, nodeoffset);
463
464 if (nodedepth < 0)
465 return nodedepth;
466 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
467 nodedepth - 1, NULL);
468}
469
470int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
471 const char *propname,
472 const void *propval, int proplen)
473{
David Gibsonae0b5902008-02-12 11:58:31 +1100474 int offset;
Kumar Gala8d04f022007-10-24 11:04:22 -0500475 const void *val;
476 int len;
477
David Gibsonfc7758e2008-07-09 14:10:24 +1000478 FDT_CHECK_HEADER(fdt);
Kumar Gala8d04f022007-10-24 11:04:22 -0500479
Kumar Gala8d04f022007-10-24 11:04:22 -0500480 /* FIXME: The algorithm here is pretty horrible: we scan each
481 * property of a node in fdt_getprop(), then if that didn't
482 * find what we want, we scan over them again making our way
483 * to the next node. Still it's the easiest to implement
484 * approach; performance can come later. */
David Gibsonae0b5902008-02-12 11:58:31 +1100485 for (offset = fdt_next_node(fdt, startoffset, NULL);
486 offset >= 0;
487 offset = fdt_next_node(fdt, offset, NULL)) {
488 val = fdt_getprop(fdt, offset, propname, &len);
489 if (val && (len == proplen)
490 && (memcmp(val, propval, len) == 0))
491 return offset;
492 }
Kumar Gala8d04f022007-10-24 11:04:22 -0500493
David Gibsonae0b5902008-02-12 11:58:31 +1100494 return offset; /* error from fdt_next_node() */
Kumar Gala8d04f022007-10-24 11:04:22 -0500495}
496
497int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
498{
David Gibson05a22ba2009-11-26 15:37:13 +1100499 int offset;
500
Kumar Gala8d04f022007-10-24 11:04:22 -0500501 if ((phandle == 0) || (phandle == -1))
502 return -FDT_ERR_BADPHANDLE;
David Gibson05a22ba2009-11-26 15:37:13 +1100503
504 FDT_CHECK_HEADER(fdt);
505
506 /* FIXME: The algorithm here is pretty horrible: we
507 * potentially scan each property of a node in
508 * fdt_get_phandle(), then if that didn't find what
509 * we want, we scan over them again making our way to the next
510 * node. Still it's the easiest to implement approach;
511 * performance can come later. */
512 for (offset = fdt_next_node(fdt, -1, NULL);
513 offset >= 0;
514 offset = fdt_next_node(fdt, offset, NULL)) {
515 if (fdt_get_phandle(fdt, offset) == phandle)
516 return offset;
517 }
518
519 return offset; /* error from fdt_next_node() */
Kumar Gala8d04f022007-10-24 11:04:22 -0500520}
521
David Gibsonf1717462008-07-29 14:51:22 +1000522static int _fdt_stringlist_contains(const char *strlist, int listlen,
523 const char *str)
Kumar Gala8d04f022007-10-24 11:04:22 -0500524{
525 int len = strlen(str);
David Gibsonef4e8ce2008-07-07 10:10:48 +1000526 const char *p;
Kumar Gala8d04f022007-10-24 11:04:22 -0500527
528 while (listlen >= len) {
529 if (memcmp(str, strlist, len+1) == 0)
530 return 1;
531 p = memchr(strlist, '\0', listlen);
532 if (!p)
533 return 0; /* malformed strlist.. */
534 listlen -= (p-strlist) + 1;
535 strlist = p + 1;
Gerald Van Baren3f9f08c2007-04-14 22:46:41 -0400536 }
537 return 0;
538}
Kumar Gala8d04f022007-10-24 11:04:22 -0500539
540int fdt_node_check_compatible(const void *fdt, int nodeoffset,
541 const char *compatible)
542{
543 const void *prop;
544 int len;
545
546 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
547 if (!prop)
548 return len;
David Gibsonf1717462008-07-29 14:51:22 +1000549 if (_fdt_stringlist_contains(prop, len, compatible))
Kumar Gala8d04f022007-10-24 11:04:22 -0500550 return 0;
551 else
552 return 1;
553}
554
555int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
556 const char *compatible)
557{
David Gibson11abe452008-02-18 18:09:04 +1100558 int offset, err;
Kumar Gala8d04f022007-10-24 11:04:22 -0500559
David Gibsonfc7758e2008-07-09 14:10:24 +1000560 FDT_CHECK_HEADER(fdt);
Kumar Gala8d04f022007-10-24 11:04:22 -0500561
Kumar Gala8d04f022007-10-24 11:04:22 -0500562 /* FIXME: The algorithm here is pretty horrible: we scan each
563 * property of a node in fdt_node_check_compatible(), then if
564 * that didn't find what we want, we scan over them again
565 * making our way to the next node. Still it's the easiest to
566 * implement approach; performance can come later. */
David Gibsonae0b5902008-02-12 11:58:31 +1100567 for (offset = fdt_next_node(fdt, startoffset, NULL);
568 offset >= 0;
569 offset = fdt_next_node(fdt, offset, NULL)) {
570 err = fdt_node_check_compatible(fdt, offset, compatible);
571 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
572 return err;
573 else if (err == 0)
574 return offset;
575 }
Kumar Gala8d04f022007-10-24 11:04:22 -0500576
David Gibsonae0b5902008-02-12 11:58:31 +1100577 return offset; /* error from fdt_next_node() */
Kumar Gala8d04f022007-10-24 11:04:22 -0500578}