David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 1 | /* |
| 2 | * libfdt - Flat Device Tree manipulation |
| 3 | * Copyright (C) 2006 David Gibson, IBM Corporation. |
| 4 | * |
David Gibson | 9481605 | 2007-06-13 16:30:48 +1000 | [diff] [blame] | 5 | * libfdt is dual licensed: you can use it either under the terms of |
| 6 | * the GPL, or the BSD license, at your option. |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 7 | * |
David Gibson | 9481605 | 2007-06-13 16:30:48 +1000 | [diff] [blame] | 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. |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 12 | * |
David Gibson | 9481605 | 2007-06-13 16:30:48 +1000 | [diff] [blame] | 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. |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 50 | */ |
| 51 | #include "libfdt_env.h" |
| 52 | |
| 53 | #include <fdt.h> |
| 54 | #include <libfdt.h> |
| 55 | |
| 56 | #include "libfdt_internal.h" |
| 57 | |
David Gibson | 96b5fad | 2007-10-24 10:28:52 +1000 | [diff] [blame] | 58 | int fdt_check_header(const void *fdt) |
David Gibson | 4236976 | 2006-12-01 15:07:19 +1100 | [diff] [blame] | 59 | { |
| 60 | if (fdt_magic(fdt) == FDT_MAGIC) { |
| 61 | /* Complete tree */ |
| 62 | if (fdt_version(fdt) < FDT_FIRST_SUPPORTED_VERSION) |
David Gibson | 9a9fdf5 | 2006-12-15 15:12:51 +1100 | [diff] [blame] | 63 | return -FDT_ERR_BADVERSION; |
David Gibson | 4236976 | 2006-12-01 15:07:19 +1100 | [diff] [blame] | 64 | if (fdt_last_comp_version(fdt) > FDT_LAST_SUPPORTED_VERSION) |
David Gibson | 9a9fdf5 | 2006-12-15 15:12:51 +1100 | [diff] [blame] | 65 | return -FDT_ERR_BADVERSION; |
David Gibson | b6d80a2 | 2008-07-09 14:10:24 +1000 | [diff] [blame] | 66 | } else if (fdt_magic(fdt) == FDT_SW_MAGIC) { |
David Gibson | 4236976 | 2006-12-01 15:07:19 +1100 | [diff] [blame] | 67 | /* Unfinished sequential-write blob */ |
David Gibson | fe92f6b | 2006-12-01 16:25:39 +1100 | [diff] [blame] | 68 | if (fdt_size_dt_struct(fdt) == 0) |
David Gibson | 9a9fdf5 | 2006-12-15 15:12:51 +1100 | [diff] [blame] | 69 | return -FDT_ERR_BADSTATE; |
David Gibson | 4236976 | 2006-12-01 15:07:19 +1100 | [diff] [blame] | 70 | } else { |
David Gibson | 9a9fdf5 | 2006-12-15 15:12:51 +1100 | [diff] [blame] | 71 | return -FDT_ERR_BADMAGIC; |
David Gibson | 4236976 | 2006-12-01 15:07:19 +1100 | [diff] [blame] | 72 | } |
David Gibson | 4236976 | 2006-12-01 15:07:19 +1100 | [diff] [blame] | 73 | return 0; |
| 74 | } |
| 75 | |
Jon Loeliger | b236893 | 2008-09-25 11:02:17 -0500 | [diff] [blame] | 76 | const void *fdt_offset_ptr(const void *fdt, int offset, unsigned int len) |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 77 | { |
David Gibson | 36786db | 2008-07-07 10:10:48 +1000 | [diff] [blame] | 78 | const char *p; |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 79 | |
David Gibson | fe92f6b | 2006-12-01 16:25:39 +1100 | [diff] [blame] | 80 | if (fdt_version(fdt) >= 0x11) |
Unnati Gandhi | a7e1fe0 | 2014-07-17 14:45:43 +0530 | [diff] [blame] | 81 | if (((int)(offset + len) < offset) |
David Gibson | fe92f6b | 2006-12-01 16:25:39 +1100 | [diff] [blame] | 82 | || ((offset + len) > fdt_size_dt_struct(fdt))) |
| 83 | return NULL; |
| 84 | |
David Gibson | 568b569 | 2006-12-12 15:46:14 +1100 | [diff] [blame] | 85 | p = _fdt_offset_ptr(fdt, offset); |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 86 | |
| 87 | if (p + len < p) |
| 88 | return NULL; |
| 89 | return p; |
| 90 | } |
| 91 | |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 92 | uint32_t fdt_next_tag(const void *fdt, int startoffset, int *nextoffset) |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 93 | { |
| 94 | const uint32_t *tagp, *lenp; |
| 95 | uint32_t tag; |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 96 | int offset = startoffset; |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 97 | const char *p; |
| 98 | |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 99 | *nextoffset = -FDT_ERR_TRUNCATED; |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 100 | tagp = fdt_offset_ptr(fdt, offset, FDT_TAGSIZE); |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 101 | if (!tagp) |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 102 | return FDT_END; /* premature end */ |
| 103 | tag = fdt32_to_cpu(*tagp); |
| 104 | offset += FDT_TAGSIZE; |
| 105 | |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 106 | *nextoffset = -FDT_ERR_BADSTRUCTURE; |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 107 | switch (tag) { |
| 108 | case FDT_BEGIN_NODE: |
| 109 | /* skip name */ |
| 110 | do { |
| 111 | p = fdt_offset_ptr(fdt, offset++, 1); |
| 112 | } while (p && (*p != '\0')); |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 113 | if (!p) |
| 114 | return FDT_END; /* premature end */ |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 115 | break; |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 116 | |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 117 | case FDT_PROP: |
David Gibson | 07a12a0 | 2007-02-23 14:40:14 +1100 | [diff] [blame] | 118 | lenp = fdt_offset_ptr(fdt, offset, sizeof(*lenp)); |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 119 | if (!lenp) |
| 120 | return FDT_END; /* premature end */ |
| 121 | /* skip-name offset, length and value */ |
| 122 | offset += sizeof(struct fdt_property) - FDT_TAGSIZE |
| 123 | + fdt32_to_cpu(*lenp); |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 124 | break; |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 125 | |
| 126 | case FDT_END: |
| 127 | case FDT_END_NODE: |
| 128 | case FDT_NOP: |
| 129 | break; |
| 130 | |
| 131 | default: |
| 132 | return FDT_END; |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 133 | } |
| 134 | |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 135 | if (!fdt_offset_ptr(fdt, startoffset, offset - startoffset)) |
| 136 | return FDT_END; /* premature end */ |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 137 | |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 138 | *nextoffset = FDT_TAGALIGN(offset); |
David Gibson | 3da0f9a | 2006-11-27 16:21:28 +1100 | [diff] [blame] | 139 | return tag; |
| 140 | } |
David Gibson | 4236976 | 2006-12-01 15:07:19 +1100 | [diff] [blame] | 141 | |
David Gibson | aa1baab | 2008-05-20 17:19:11 +1000 | [diff] [blame] | 142 | int _fdt_check_node_offset(const void *fdt, int offset) |
| 143 | { |
| 144 | if ((offset < 0) || (offset % FDT_TAGSIZE) |
| 145 | || (fdt_next_tag(fdt, offset, &offset) != FDT_BEGIN_NODE)) |
| 146 | return -FDT_ERR_BADOFFSET; |
| 147 | |
| 148 | return offset; |
| 149 | } |
| 150 | |
David Gibson | 73dca9a | 2010-03-09 17:39:14 +1100 | [diff] [blame] | 151 | int _fdt_check_prop_offset(const void *fdt, int offset) |
| 152 | { |
| 153 | if ((offset < 0) || (offset % FDT_TAGSIZE) |
| 154 | || (fdt_next_tag(fdt, offset, &offset) != FDT_PROP)) |
| 155 | return -FDT_ERR_BADOFFSET; |
| 156 | |
| 157 | return offset; |
| 158 | } |
| 159 | |
David Gibson | fc9769a | 2008-02-12 11:58:31 +1100 | [diff] [blame] | 160 | int fdt_next_node(const void *fdt, int offset, int *depth) |
| 161 | { |
| 162 | int nextoffset = 0; |
| 163 | uint32_t tag; |
| 164 | |
David Gibson | aa1baab | 2008-05-20 17:19:11 +1000 | [diff] [blame] | 165 | if (offset >= 0) |
| 166 | if ((nextoffset = _fdt_check_node_offset(fdt, offset)) < 0) |
| 167 | return nextoffset; |
David Gibson | fc9769a | 2008-02-12 11:58:31 +1100 | [diff] [blame] | 168 | |
| 169 | do { |
| 170 | offset = nextoffset; |
| 171 | tag = fdt_next_tag(fdt, offset, &nextoffset); |
| 172 | |
| 173 | switch (tag) { |
| 174 | case FDT_PROP: |
| 175 | case FDT_NOP: |
| 176 | break; |
| 177 | |
| 178 | case FDT_BEGIN_NODE: |
| 179 | if (depth) |
| 180 | (*depth)++; |
| 181 | break; |
| 182 | |
| 183 | case FDT_END_NODE: |
David Gibson | ce4d9c0 | 2009-02-06 14:01:56 +1100 | [diff] [blame] | 184 | if (depth && ((--(*depth)) < 0)) |
| 185 | return nextoffset; |
David Gibson | fc9769a | 2008-02-12 11:58:31 +1100 | [diff] [blame] | 186 | break; |
| 187 | |
| 188 | case FDT_END: |
David Gibson | 1a020e4 | 2009-02-06 14:03:24 +1100 | [diff] [blame] | 189 | if ((nextoffset >= 0) |
| 190 | || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth)) |
| 191 | return -FDT_ERR_NOTFOUND; |
| 192 | else |
| 193 | return nextoffset; |
David Gibson | fc9769a | 2008-02-12 11:58:31 +1100 | [diff] [blame] | 194 | } |
| 195 | } while (tag != FDT_BEGIN_NODE); |
| 196 | |
| 197 | return offset; |
| 198 | } |
| 199 | |
David Gibson | aeddfe2 | 2006-12-01 15:11:58 +1100 | [diff] [blame] | 200 | const char *_fdt_find_string(const char *strtab, int tabsize, const char *s) |
| 201 | { |
| 202 | int len = strlen(s) + 1; |
| 203 | const char *last = strtab + tabsize - len; |
| 204 | const char *p; |
| 205 | |
| 206 | for (p = strtab; p <= last; p++) |
David Gibson | b6d80a2 | 2008-07-09 14:10:24 +1000 | [diff] [blame] | 207 | if (memcmp(p, s, len) == 0) |
David Gibson | aeddfe2 | 2006-12-01 15:11:58 +1100 | [diff] [blame] | 208 | return p; |
| 209 | return NULL; |
| 210 | } |
| 211 | |
David Gibson | 73d6092 | 2006-12-15 15:12:47 +1100 | [diff] [blame] | 212 | int fdt_move(const void *fdt, void *buf, int bufsize) |
David Gibson | 4236976 | 2006-12-01 15:07:19 +1100 | [diff] [blame] | 213 | { |
David Gibson | b6d80a2 | 2008-07-09 14:10:24 +1000 | [diff] [blame] | 214 | FDT_CHECK_HEADER(fdt); |
David Gibson | 4236976 | 2006-12-01 15:07:19 +1100 | [diff] [blame] | 215 | |
Unnati Gandhi | a7e1fe0 | 2014-07-17 14:45:43 +0530 | [diff] [blame] | 216 | if (fdt_totalsize(fdt) > (uint32_t)bufsize) |
David Gibson | 9a9fdf5 | 2006-12-15 15:12:51 +1100 | [diff] [blame] | 217 | return -FDT_ERR_NOSPACE; |
David Gibson | 4236976 | 2006-12-01 15:07:19 +1100 | [diff] [blame] | 218 | |
| 219 | memmove(buf, fdt, fdt_totalsize(fdt)); |
David Gibson | 9a9fdf5 | 2006-12-15 15:12:51 +1100 | [diff] [blame] | 220 | return 0; |
David Gibson | 4236976 | 2006-12-01 15:07:19 +1100 | [diff] [blame] | 221 | } |
Kishor PK | 0a749fe | 2017-07-13 15:32:31 +0530 | [diff] [blame] | 222 | |
| 223 | int fdt_first_subnode(const void *fdt, int offset) |
| 224 | { |
| 225 | int depth = 0; |
| 226 | |
| 227 | offset = fdt_next_node(fdt, offset, &depth); |
| 228 | if (offset < 0 || depth != 1) |
| 229 | return -FDT_ERR_NOTFOUND; |
| 230 | |
| 231 | return offset; |
| 232 | } |
| 233 | |
| 234 | int fdt_next_subnode(const void *fdt, int offset) |
| 235 | { |
| 236 | int depth = 1; |
| 237 | |
| 238 | /* |
| 239 | * With respect to the parent, the depth of the next subnode will be |
| 240 | * the same as the last. |
| 241 | */ |
| 242 | do { |
| 243 | offset = fdt_next_node(fdt, offset, &depth); |
| 244 | if (offset < 0 || depth < 1) |
| 245 | return -FDT_ERR_NOTFOUND; |
| 246 | } while (depth > 1); |
| 247 | |
| 248 | return offset; |
| 249 | } |