]>
Commit | Line | Data |
---|---|---|
1 | /*\r | |
2 | * libfdt - Flat Device Tree manipulation\r | |
3 | * Copyright (C) 2006 David Gibson, IBM Corporation.\r | |
4 | *\r | |
5 | * libfdt is dual licensed: you can use it either under the terms of\r | |
6 | * the GPL, or the BSD license, at your option.\r | |
7 | *\r | |
8 | * a) This library is free software; you can redistribute it and/or\r | |
9 | * modify it under the terms of the GNU General Public License as\r | |
10 | * published by the Free Software Foundation; either version 2 of the\r | |
11 | * License, or (at your option) any later version.\r | |
12 | *\r | |
13 | * This library is distributed in the hope that it will be useful,\r | |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of\r | |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r | |
16 | * GNU General Public License for more details.\r | |
17 | *\r | |
18 | * You should have received a copy of the GNU General Public\r | |
19 | * License along with this library; if not, write to the Free\r | |
20 | * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,\r | |
21 | * MA 02110-1301 USA\r | |
22 | *\r | |
23 | * Alternatively,\r | |
24 | *\r | |
25 | * b) Redistribution and use in source and binary forms, with or\r | |
26 | * without modification, are permitted provided that the following\r | |
27 | * conditions are met:\r | |
28 | *\r | |
29 | * 1. Redistributions of source code must retain the above\r | |
30 | * copyright notice, this list of conditions and the following\r | |
31 | * disclaimer.\r | |
32 | * 2. Redistributions in binary form must reproduce the above\r | |
33 | * copyright notice, this list of conditions and the following\r | |
34 | * disclaimer in the documentation and/or other materials\r | |
35 | * provided with the distribution.\r | |
36 | *\r | |
37 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND\r | |
38 | * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,\r | |
39 | * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\r | |
40 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\r | |
41 | * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\r | |
42 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\r | |
43 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT\r | |
44 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\r | |
45 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r | |
46 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\r | |
47 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\r | |
48 | * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\r | |
49 | * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r | |
50 | */\r | |
51 | #include "libfdt_env.h"\r | |
52 | \r | |
53 | #include <fdt.h>\r | |
54 | #include <libfdt.h>\r | |
55 | \r | |
56 | #include "libfdt_internal.h"\r | |
57 | \r | |
58 | static int _fdt_blocks_misordered(const void *fdt,\r | |
59 | int mem_rsv_size, int struct_size)\r | |
60 | {\r | |
61 | return (fdt_off_mem_rsvmap(fdt) < FDT_ALIGN(sizeof(struct fdt_header), 8))\r | |
62 | || (fdt_off_dt_struct(fdt) <\r | |
63 | (fdt_off_mem_rsvmap(fdt) + mem_rsv_size))\r | |
64 | || (fdt_off_dt_strings(fdt) <\r | |
65 | (fdt_off_dt_struct(fdt) + struct_size))\r | |
66 | || (fdt_totalsize(fdt) <\r | |
67 | (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt)));\r | |
68 | }\r | |
69 | \r | |
70 | static int _fdt_rw_check_header(void *fdt)\r | |
71 | {\r | |
72 | FDT_CHECK_HEADER(fdt);\r | |
73 | \r | |
74 | if (fdt_version(fdt) < 17)\r | |
75 | return -FDT_ERR_BADVERSION;\r | |
76 | if (_fdt_blocks_misordered(fdt, sizeof(struct fdt_reserve_entry),\r | |
77 | fdt_size_dt_struct(fdt)))\r | |
78 | return -FDT_ERR_BADLAYOUT;\r | |
79 | if (fdt_version(fdt) > 17)\r | |
80 | fdt_set_version(fdt, 17);\r | |
81 | \r | |
82 | return 0;\r | |
83 | }\r | |
84 | \r | |
85 | #define FDT_RW_CHECK_HEADER(fdt) \\r | |
86 | { \\r | |
87 | int err; \\r | |
88 | if ((err = _fdt_rw_check_header(fdt)) != 0) \\r | |
89 | return err; \\r | |
90 | }\r | |
91 | \r | |
92 | static inline int _fdt_data_size(void *fdt)\r | |
93 | {\r | |
94 | return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);\r | |
95 | }\r | |
96 | \r | |
97 | static int _fdt_splice(void *fdt, void *splicepoint, int oldlen, int newlen)\r | |
98 | {\r | |
99 | char *p = splicepoint;\r | |
100 | char *end = (char *)fdt + _fdt_data_size(fdt);\r | |
101 | \r | |
102 | if (((p + oldlen) < p) || ((p + oldlen) > end))\r | |
103 | return -FDT_ERR_BADOFFSET;\r | |
104 | if ((end - oldlen + newlen) > ((char *)fdt + fdt_totalsize(fdt)))\r | |
105 | return -FDT_ERR_NOSPACE;\r | |
106 | memmove(p + newlen, p + oldlen, end - p - oldlen);\r | |
107 | return 0;\r | |
108 | }\r | |
109 | \r | |
110 | static int _fdt_splice_mem_rsv(void *fdt, struct fdt_reserve_entry *p,\r | |
111 | int oldn, int newn)\r | |
112 | {\r | |
113 | int delta = (newn - oldn) * sizeof(*p);\r | |
114 | int err;\r | |
115 | err = _fdt_splice(fdt, p, oldn * sizeof(*p), newn * sizeof(*p));\r | |
116 | if (err)\r | |
117 | return err;\r | |
118 | fdt_set_off_dt_struct(fdt, fdt_off_dt_struct(fdt) + delta);\r | |
119 | fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);\r | |
120 | return 0;\r | |
121 | }\r | |
122 | \r | |
123 | static int _fdt_splice_struct(void *fdt, void *p,\r | |
124 | int oldlen, int newlen)\r | |
125 | {\r | |
126 | int delta = newlen - oldlen;\r | |
127 | int err;\r | |
128 | \r | |
129 | err = _fdt_splice(fdt, p, oldlen, newlen);\r | |
130 | if (err)\r | |
131 | return err;\r | |
132 | \r | |
133 | fdt_set_size_dt_struct(fdt, fdt_size_dt_struct(fdt) + delta);\r | |
134 | fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);\r | |
135 | return 0;\r | |
136 | }\r | |
137 | \r | |
138 | static int _fdt_splice_string(void *fdt, int newlen)\r | |
139 | {\r | |
140 | void *p = (char *)fdt\r | |
141 | + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);\r | |
142 | int err;\r | |
143 | \r | |
144 | err = _fdt_splice(fdt, p, 0, newlen);\r | |
145 | if (err)\r | |
146 | return err;\r | |
147 | \r | |
148 | fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen);\r | |
149 | return 0;\r | |
150 | }\r | |
151 | \r | |
152 | static int _fdt_find_add_string(void *fdt, const char *s)\r | |
153 | {\r | |
154 | char *strtab = (char *)fdt + fdt_off_dt_strings(fdt);\r | |
155 | const char *p;\r | |
156 | char *new;\r | |
157 | int len = strlen(s) + 1;\r | |
158 | int err;\r | |
159 | \r | |
160 | p = _fdt_find_string(strtab, fdt_size_dt_strings(fdt), s);\r | |
161 | if (p)\r | |
162 | /* found it */\r | |
163 | return (p - strtab);\r | |
164 | \r | |
165 | new = strtab + fdt_size_dt_strings(fdt);\r | |
166 | err = _fdt_splice_string(fdt, len);\r | |
167 | if (err)\r | |
168 | return err;\r | |
169 | \r | |
170 | memcpy(new, s, len);\r | |
171 | return (new - strtab);\r | |
172 | }\r | |
173 | \r | |
174 | int fdt_add_mem_rsv(void *fdt, uint64_t address, uint64_t size)\r | |
175 | {\r | |
176 | struct fdt_reserve_entry *re;\r | |
177 | int err;\r | |
178 | \r | |
179 | FDT_RW_CHECK_HEADER(fdt);\r | |
180 | \r | |
181 | re = _fdt_mem_rsv_w(fdt, fdt_num_mem_rsv(fdt));\r | |
182 | err = _fdt_splice_mem_rsv(fdt, re, 0, 1);\r | |
183 | if (err)\r | |
184 | return err;\r | |
185 | \r | |
186 | re->address = cpu_to_fdt64(address);\r | |
187 | re->size = cpu_to_fdt64(size);\r | |
188 | return 0;\r | |
189 | }\r | |
190 | \r | |
191 | int fdt_del_mem_rsv(void *fdt, int n)\r | |
192 | {\r | |
193 | struct fdt_reserve_entry *re = _fdt_mem_rsv_w(fdt, n);\r | |
194 | int err;\r | |
195 | \r | |
196 | FDT_RW_CHECK_HEADER(fdt);\r | |
197 | \r | |
198 | if (n >= fdt_num_mem_rsv(fdt))\r | |
199 | return -FDT_ERR_NOTFOUND;\r | |
200 | \r | |
201 | err = _fdt_splice_mem_rsv(fdt, re, 1, 0);\r | |
202 | if (err)\r | |
203 | return err;\r | |
204 | return 0;\r | |
205 | }\r | |
206 | \r | |
207 | static int _fdt_resize_property(void *fdt, int nodeoffset, const char *name,\r | |
208 | int len, struct fdt_property **prop)\r | |
209 | {\r | |
210 | int oldlen;\r | |
211 | int err;\r | |
212 | \r | |
213 | *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);\r | |
214 | if (! (*prop))\r | |
215 | return oldlen;\r | |
216 | \r | |
217 | err = _fdt_splice_struct(fdt, (*prop)->data, FDT_TAGALIGN(oldlen),\r | |
218 | FDT_TAGALIGN(len));\r | |
219 | if (err)\r | |
220 | return err;\r | |
221 | \r | |
222 | (*prop)->len = cpu_to_fdt32(len);\r | |
223 | return 0;\r | |
224 | }\r | |
225 | \r | |
226 | static int _fdt_add_property(void *fdt, int nodeoffset, const char *name,\r | |
227 | int len, struct fdt_property **prop)\r | |
228 | {\r | |
229 | int proplen;\r | |
230 | int nextoffset;\r | |
231 | int namestroff;\r | |
232 | int err;\r | |
233 | \r | |
234 | if ((nextoffset = _fdt_check_node_offset(fdt, nodeoffset)) < 0)\r | |
235 | return nextoffset;\r | |
236 | \r | |
237 | namestroff = _fdt_find_add_string(fdt, name);\r | |
238 | if (namestroff < 0)\r | |
239 | return namestroff;\r | |
240 | \r | |
241 | *prop = _fdt_offset_ptr_w(fdt, nextoffset);\r | |
242 | proplen = sizeof(**prop) + FDT_TAGALIGN(len);\r | |
243 | \r | |
244 | err = _fdt_splice_struct(fdt, *prop, 0, proplen);\r | |
245 | if (err)\r | |
246 | return err;\r | |
247 | \r | |
248 | (*prop)->tag = cpu_to_fdt32(FDT_PROP);\r | |
249 | (*prop)->nameoff = cpu_to_fdt32(namestroff);\r | |
250 | (*prop)->len = cpu_to_fdt32(len);\r | |
251 | return 0;\r | |
252 | }\r | |
253 | \r | |
254 | int fdt_set_name(void *fdt, int nodeoffset, const char *name)\r | |
255 | {\r | |
256 | char *namep;\r | |
257 | int oldlen, newlen;\r | |
258 | int err;\r | |
259 | \r | |
260 | FDT_RW_CHECK_HEADER(fdt);\r | |
261 | \r | |
262 | namep = (char *)(uintptr_t)fdt_get_name(fdt, nodeoffset, &oldlen);\r | |
263 | if (!namep)\r | |
264 | return oldlen;\r | |
265 | \r | |
266 | newlen = strlen(name);\r | |
267 | \r | |
268 | err = _fdt_splice_struct(fdt, namep, FDT_TAGALIGN(oldlen+1),\r | |
269 | FDT_TAGALIGN(newlen+1));\r | |
270 | if (err)\r | |
271 | return err;\r | |
272 | \r | |
273 | memcpy(namep, name, newlen+1);\r | |
274 | return 0;\r | |
275 | }\r | |
276 | \r | |
277 | int fdt_setprop(void *fdt, int nodeoffset, const char *name,\r | |
278 | const void *val, int len)\r | |
279 | {\r | |
280 | struct fdt_property *prop;\r | |
281 | int err;\r | |
282 | \r | |
283 | FDT_RW_CHECK_HEADER(fdt);\r | |
284 | \r | |
285 | err = _fdt_resize_property(fdt, nodeoffset, name, len, &prop);\r | |
286 | if (err == -FDT_ERR_NOTFOUND)\r | |
287 | err = _fdt_add_property(fdt, nodeoffset, name, len, &prop);\r | |
288 | if (err)\r | |
289 | return err;\r | |
290 | \r | |
291 | memcpy(prop->data, val, len);\r | |
292 | return 0;\r | |
293 | }\r | |
294 | \r | |
295 | int fdt_appendprop(void *fdt, int nodeoffset, const char *name,\r | |
296 | const void *val, int len)\r | |
297 | {\r | |
298 | struct fdt_property *prop;\r | |
299 | int err, oldlen, newlen;\r | |
300 | \r | |
301 | FDT_RW_CHECK_HEADER(fdt);\r | |
302 | \r | |
303 | prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);\r | |
304 | if (prop) {\r | |
305 | newlen = len + oldlen;\r | |
306 | err = _fdt_splice_struct(fdt, prop->data,\r | |
307 | FDT_TAGALIGN(oldlen),\r | |
308 | FDT_TAGALIGN(newlen));\r | |
309 | if (err)\r | |
310 | return err;\r | |
311 | prop->len = cpu_to_fdt32(newlen);\r | |
312 | memcpy(prop->data + oldlen, val, len);\r | |
313 | } else {\r | |
314 | err = _fdt_add_property(fdt, nodeoffset, name, len, &prop);\r | |
315 | if (err)\r | |
316 | return err;\r | |
317 | memcpy(prop->data, val, len);\r | |
318 | }\r | |
319 | return 0;\r | |
320 | }\r | |
321 | \r | |
322 | int fdt_delprop(void *fdt, int nodeoffset, const char *name)\r | |
323 | {\r | |
324 | struct fdt_property *prop;\r | |
325 | int len, proplen;\r | |
326 | \r | |
327 | FDT_RW_CHECK_HEADER(fdt);\r | |
328 | \r | |
329 | prop = fdt_get_property_w(fdt, nodeoffset, name, &len);\r | |
330 | if (! prop)\r | |
331 | return len;\r | |
332 | \r | |
333 | proplen = sizeof(*prop) + FDT_TAGALIGN(len);\r | |
334 | return _fdt_splice_struct(fdt, prop, proplen, 0);\r | |
335 | }\r | |
336 | \r | |
337 | int fdt_add_subnode_namelen(void *fdt, int parentoffset,\r | |
338 | const char *name, int namelen)\r | |
339 | {\r | |
340 | struct fdt_node_header *nh;\r | |
341 | int offset, nextoffset;\r | |
342 | int nodelen;\r | |
343 | int err;\r | |
344 | uint32_t tag;\r | |
345 | uint32_t *endtag;\r | |
346 | \r | |
347 | FDT_RW_CHECK_HEADER(fdt);\r | |
348 | \r | |
349 | offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);\r | |
350 | if (offset >= 0)\r | |
351 | return -FDT_ERR_EXISTS;\r | |
352 | else if (offset != -FDT_ERR_NOTFOUND)\r | |
353 | return offset;\r | |
354 | \r | |
355 | /* Try to place the new node after the parent's properties */\r | |
356 | fdt_next_tag(fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */\r | |
357 | do {\r | |
358 | offset = nextoffset;\r | |
359 | tag = fdt_next_tag(fdt, offset, &nextoffset);\r | |
360 | } while ((tag == FDT_PROP) || (tag == FDT_NOP));\r | |
361 | \r | |
362 | nh = _fdt_offset_ptr_w(fdt, offset);\r | |
363 | nodelen = sizeof(*nh) + FDT_TAGALIGN(namelen+1) + FDT_TAGSIZE;\r | |
364 | \r | |
365 | err = _fdt_splice_struct(fdt, nh, 0, nodelen);\r | |
366 | if (err)\r | |
367 | return err;\r | |
368 | \r | |
369 | nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);\r | |
370 | memset(nh->name, 0, FDT_TAGALIGN(namelen+1));\r | |
371 | memcpy(nh->name, name, namelen);\r | |
372 | endtag = (uint32_t *)((char *)nh + nodelen - FDT_TAGSIZE);\r | |
373 | *endtag = cpu_to_fdt32(FDT_END_NODE);\r | |
374 | \r | |
375 | return offset;\r | |
376 | }\r | |
377 | \r | |
378 | int fdt_add_subnode(void *fdt, int parentoffset, const char *name)\r | |
379 | {\r | |
380 | return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));\r | |
381 | }\r | |
382 | \r | |
383 | int fdt_del_node(void *fdt, int nodeoffset)\r | |
384 | {\r | |
385 | int endoffset;\r | |
386 | \r | |
387 | FDT_RW_CHECK_HEADER(fdt);\r | |
388 | \r | |
389 | endoffset = _fdt_node_end_offset(fdt, nodeoffset);\r | |
390 | if (endoffset < 0)\r | |
391 | return endoffset;\r | |
392 | \r | |
393 | return _fdt_splice_struct(fdt, _fdt_offset_ptr_w(fdt, nodeoffset),\r | |
394 | endoffset - nodeoffset, 0);\r | |
395 | }\r | |
396 | \r | |
397 | static void _fdt_packblocks(const char *old, char *new,\r | |
398 | int mem_rsv_size, int struct_size)\r | |
399 | {\r | |
400 | int mem_rsv_off, struct_off, strings_off;\r | |
401 | \r | |
402 | mem_rsv_off = FDT_ALIGN(sizeof(struct fdt_header), 8);\r | |
403 | struct_off = mem_rsv_off + mem_rsv_size;\r | |
404 | strings_off = struct_off + struct_size;\r | |
405 | \r | |
406 | memmove(new + mem_rsv_off, old + fdt_off_mem_rsvmap(old), mem_rsv_size);\r | |
407 | fdt_set_off_mem_rsvmap(new, mem_rsv_off);\r | |
408 | \r | |
409 | memmove(new + struct_off, old + fdt_off_dt_struct(old), struct_size);\r | |
410 | fdt_set_off_dt_struct(new, struct_off);\r | |
411 | fdt_set_size_dt_struct(new, struct_size);\r | |
412 | \r | |
413 | memmove(new + strings_off, old + fdt_off_dt_strings(old),\r | |
414 | fdt_size_dt_strings(old));\r | |
415 | fdt_set_off_dt_strings(new, strings_off);\r | |
416 | fdt_set_size_dt_strings(new, fdt_size_dt_strings(old));\r | |
417 | }\r | |
418 | \r | |
419 | int fdt_open_into(const void *fdt, void *buf, int bufsize)\r | |
420 | {\r | |
421 | int err;\r | |
422 | int mem_rsv_size, struct_size;\r | |
423 | int newsize;\r | |
424 | const char *fdtstart = fdt;\r | |
425 | const char *fdtend = fdtstart + fdt_totalsize(fdt);\r | |
426 | char *tmp;\r | |
427 | \r | |
428 | FDT_CHECK_HEADER(fdt);\r | |
429 | \r | |
430 | mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)\r | |
431 | * sizeof(struct fdt_reserve_entry);\r | |
432 | \r | |
433 | if (fdt_version(fdt) >= 17) {\r | |
434 | struct_size = fdt_size_dt_struct(fdt);\r | |
435 | } else {\r | |
436 | struct_size = 0;\r | |
437 | while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END)\r | |
438 | ;\r | |
439 | if (struct_size < 0)\r | |
440 | return struct_size;\r | |
441 | }\r | |
442 | \r | |
443 | if (!_fdt_blocks_misordered(fdt, mem_rsv_size, struct_size)) {\r | |
444 | /* no further work necessary */\r | |
445 | err = fdt_move(fdt, buf, bufsize);\r | |
446 | if (err)\r | |
447 | return err;\r | |
448 | fdt_set_version(buf, 17);\r | |
449 | fdt_set_size_dt_struct(buf, struct_size);\r | |
450 | fdt_set_totalsize(buf, bufsize);\r | |
451 | return 0;\r | |
452 | }\r | |
453 | \r | |
454 | /* Need to reorder */\r | |
455 | newsize = FDT_ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size\r | |
456 | + struct_size + fdt_size_dt_strings(fdt);\r | |
457 | \r | |
458 | if (bufsize < newsize)\r | |
459 | return -FDT_ERR_NOSPACE;\r | |
460 | \r | |
461 | /* First attempt to build converted tree at beginning of buffer */\r | |
462 | tmp = buf;\r | |
463 | /* But if that overlaps with the old tree... */\r | |
464 | if (((tmp + newsize) > fdtstart) && (tmp < fdtend)) {\r | |
465 | /* Try right after the old tree instead */\r | |
466 | tmp = (char *)(uintptr_t)fdtend;\r | |
467 | if ((tmp + newsize) > ((char *)buf + bufsize))\r | |
468 | return -FDT_ERR_NOSPACE;\r | |
469 | }\r | |
470 | \r | |
471 | _fdt_packblocks(fdt, tmp, mem_rsv_size, struct_size);\r | |
472 | memmove(buf, tmp, newsize);\r | |
473 | \r | |
474 | fdt_set_magic(buf, FDT_MAGIC);\r | |
475 | fdt_set_totalsize(buf, bufsize);\r | |
476 | fdt_set_version(buf, 17);\r | |
477 | fdt_set_last_comp_version(buf, 16);\r | |
478 | fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt));\r | |
479 | \r | |
480 | return 0;\r | |
481 | }\r | |
482 | \r | |
483 | int fdt_pack(void *fdt)\r | |
484 | {\r | |
485 | int mem_rsv_size;\r | |
486 | \r | |
487 | FDT_RW_CHECK_HEADER(fdt);\r | |
488 | \r | |
489 | mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)\r | |
490 | * sizeof(struct fdt_reserve_entry);\r | |
491 | _fdt_packblocks(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt));\r | |
492 | fdt_set_totalsize(fdt, _fdt_data_size(fdt));\r | |
493 | \r | |
494 | return 0;\r | |
495 | }\r |