blob: 4157b21efda2eb11585a0e1bf08d94cd8e754a24 [file] [log] [blame]
Gerald Van Baren7cd5da02007-03-31 11:59:59 -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 Baren7cd5da02007-03-31 11:59:59 -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 Baren7cd5da02007-03-31 11:59:59 -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 Baren7cd5da02007-03-31 11:59:59 -040050 */
51#include "libfdt_env.h"
52
Bartlomiej Sieka8cf30802008-02-29 16:00:24 +010053#ifndef USE_HOSTCC
Gerald Van Baren7cd5da02007-03-31 11:59:59 -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 Baren7cd5da02007-03-31 11:59:59 -040059
60#include "libfdt_internal.h"
61
Gerald Van Baren6679f922007-04-06 14:17:14 -040062int fdt_check_header(const void *fdt)
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040063{
64 if (fdt_magic(fdt) == FDT_MAGIC) {
65 /* Complete tree */
66 if (fdt_version(fdt) < FDT_FIRST_SUPPORTED_VERSION)
67 return -FDT_ERR_BADVERSION;
68 if (fdt_last_comp_version(fdt) > FDT_LAST_SUPPORTED_VERSION)
69 return -FDT_ERR_BADVERSION;
David Gibsonfc7758e2008-07-09 14:10:24 +100070 } else if (fdt_magic(fdt) == FDT_SW_MAGIC) {
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040071 /* Unfinished sequential-write blob */
72 if (fdt_size_dt_struct(fdt) == 0)
73 return -FDT_ERR_BADSTATE;
74 } else {
75 return -FDT_ERR_BADMAGIC;
76 }
77
78 return 0;
79}
80
Jon Loeliger741a6d02008-09-25 11:02:17 -050081const void *fdt_offset_ptr(const void *fdt, int offset, unsigned int len)
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040082{
David Gibsonef4e8ce2008-07-07 10:10:48 +100083 const char *p;
Gerald Van Baren7cd5da02007-03-31 11:59:59 -040084
85 if (fdt_version(fdt) >= 0x11)
86 if (((offset + len) < offset)
87 || ((offset + len) > fdt_size_dt_struct(fdt)))
88 return NULL;
89
90 p = _fdt_offset_ptr(fdt, offset);
91
92 if (p + len < p)
93 return NULL;
94 return p;
95}
96
David Gibsona22d9cf2009-02-06 14:03:24 +110097uint32_t fdt_next_tag(const void *fdt, int startoffset, int *nextoffset)
Kumar Gala8d04f022007-10-24 11:04:22 -050098{
99 const uint32_t *tagp, *lenp;
100 uint32_t tag;
David Gibsona22d9cf2009-02-06 14:03:24 +1100101 int offset = startoffset;
Kumar Gala8d04f022007-10-24 11:04:22 -0500102 const char *p;
103
David Gibsona22d9cf2009-02-06 14:03:24 +1100104 *nextoffset = -FDT_ERR_TRUNCATED;
Kumar Gala8d04f022007-10-24 11:04:22 -0500105 tagp = fdt_offset_ptr(fdt, offset, FDT_TAGSIZE);
David Gibsona22d9cf2009-02-06 14:03:24 +1100106 if (!tagp)
Kumar Gala8d04f022007-10-24 11:04:22 -0500107 return FDT_END; /* premature end */
108 tag = fdt32_to_cpu(*tagp);
109 offset += FDT_TAGSIZE;
110
David Gibsona22d9cf2009-02-06 14:03:24 +1100111 *nextoffset = -FDT_ERR_BADSTRUCTURE;
Kumar Gala8d04f022007-10-24 11:04:22 -0500112 switch (tag) {
113 case FDT_BEGIN_NODE:
114 /* skip name */
115 do {
116 p = fdt_offset_ptr(fdt, offset++, 1);
117 } while (p && (*p != '\0'));
David Gibsona22d9cf2009-02-06 14:03:24 +1100118 if (!p)
119 return FDT_END; /* premature end */
Kumar Gala8d04f022007-10-24 11:04:22 -0500120 break;
David Gibsona22d9cf2009-02-06 14:03:24 +1100121
Kumar Gala8d04f022007-10-24 11:04:22 -0500122 case FDT_PROP:
123 lenp = fdt_offset_ptr(fdt, offset, sizeof(*lenp));
David Gibsona22d9cf2009-02-06 14:03:24 +1100124 if (!lenp)
125 return FDT_END; /* premature end */
126 /* skip-name offset, length and value */
127 offset += sizeof(struct fdt_property) - FDT_TAGSIZE
128 + fdt32_to_cpu(*lenp);
Kumar Gala8d04f022007-10-24 11:04:22 -0500129 break;
David Gibsona22d9cf2009-02-06 14:03:24 +1100130
131 case FDT_END:
132 case FDT_END_NODE:
133 case FDT_NOP:
134 break;
135
136 default:
137 return FDT_END;
Kumar Gala8d04f022007-10-24 11:04:22 -0500138 }
139
David Gibsona22d9cf2009-02-06 14:03:24 +1100140 if (!fdt_offset_ptr(fdt, startoffset, offset - startoffset))
141 return FDT_END; /* premature end */
Kumar Gala8d04f022007-10-24 11:04:22 -0500142
David Gibsona22d9cf2009-02-06 14:03:24 +1100143 *nextoffset = FDT_TAGALIGN(offset);
Kumar Gala8d04f022007-10-24 11:04:22 -0500144 return tag;
145}
146
David Gibson2f08bfa2008-05-20 17:19:11 +1000147int _fdt_check_node_offset(const void *fdt, int offset)
148{
149 if ((offset < 0) || (offset % FDT_TAGSIZE)
150 || (fdt_next_tag(fdt, offset, &offset) != FDT_BEGIN_NODE))
151 return -FDT_ERR_BADOFFSET;
152
153 return offset;
154}
155
David Gibsond1c63142010-03-09 17:39:14 +1100156int _fdt_check_prop_offset(const void *fdt, int offset)
157{
158 if ((offset < 0) || (offset % FDT_TAGSIZE)
159 || (fdt_next_tag(fdt, offset, &offset) != FDT_PROP))
160 return -FDT_ERR_BADOFFSET;
161
162 return offset;
163}
164
David Gibsonae0b5902008-02-12 11:58:31 +1100165int fdt_next_node(const void *fdt, int offset, int *depth)
166{
167 int nextoffset = 0;
168 uint32_t tag;
169
David Gibson2f08bfa2008-05-20 17:19:11 +1000170 if (offset >= 0)
171 if ((nextoffset = _fdt_check_node_offset(fdt, offset)) < 0)
172 return nextoffset;
David Gibsonae0b5902008-02-12 11:58:31 +1100173
174 do {
175 offset = nextoffset;
176 tag = fdt_next_tag(fdt, offset, &nextoffset);
177
178 switch (tag) {
179 case FDT_PROP:
180 case FDT_NOP:
181 break;
182
183 case FDT_BEGIN_NODE:
184 if (depth)
185 (*depth)++;
186 break;
187
188 case FDT_END_NODE:
David Gibson2c0b8432009-02-06 14:01:56 +1100189 if (depth && ((--(*depth)) < 0))
190 return nextoffset;
David Gibsonae0b5902008-02-12 11:58:31 +1100191 break;
192
193 case FDT_END:
David Gibsona22d9cf2009-02-06 14:03:24 +1100194 if ((nextoffset >= 0)
195 || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth))
196 return -FDT_ERR_NOTFOUND;
197 else
198 return nextoffset;
David Gibsonae0b5902008-02-12 11:58:31 +1100199 }
200 } while (tag != FDT_BEGIN_NODE);
201
202 return offset;
203}
204
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400205const char *_fdt_find_string(const char *strtab, int tabsize, const char *s)
206{
207 int len = strlen(s) + 1;
208 const char *last = strtab + tabsize - len;
209 const char *p;
210
211 for (p = strtab; p <= last; p++)
David Gibsonfc7758e2008-07-09 14:10:24 +1000212 if (memcmp(p, s, len) == 0)
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400213 return p;
214 return NULL;
215}
216
217int fdt_move(const void *fdt, void *buf, int bufsize)
218{
David Gibsonfc7758e2008-07-09 14:10:24 +1000219 FDT_CHECK_HEADER(fdt);
Gerald Van Baren7cd5da02007-03-31 11:59:59 -0400220
221 if (fdt_totalsize(fdt) > bufsize)
222 return -FDT_ERR_NOSPACE;
223
224 memmove(buf, fdt, fdt_totalsize(fdt));
225 return 0;
226}