Tom Rini | c0e032e | 2017-09-23 12:52:44 -0400 | [diff] [blame] | 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 | |
| 58 | int fdt_setprop_inplace_namelen_partial(void *fdt, int nodeoffset, |
| 59 | const char *name, int namelen, |
| 60 | uint32_t idx, const void *val, |
| 61 | int len) |
| 62 | { |
| 63 | void *propval; |
| 64 | int proplen; |
| 65 | |
| 66 | propval = fdt_getprop_namelen_w(fdt, nodeoffset, name, namelen, |
| 67 | &proplen); |
| 68 | if (!propval) |
| 69 | return proplen; |
| 70 | |
| 71 | if (proplen < (len + idx)) |
| 72 | return -FDT_ERR_NOSPACE; |
| 73 | |
| 74 | memcpy((char *)propval + idx, val, len); |
| 75 | return 0; |
| 76 | } |
| 77 | |
| 78 | int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name, |
| 79 | const void *val, int len) |
| 80 | { |
| 81 | const void *propval; |
| 82 | int proplen; |
| 83 | |
| 84 | propval = fdt_getprop(fdt, nodeoffset, name, &proplen); |
Tom Rini | 2d4c225 | 2017-09-23 17:31:59 -0400 | [diff] [blame^] | 85 | if (!propval) |
Tom Rini | c0e032e | 2017-09-23 12:52:44 -0400 | [diff] [blame] | 86 | return proplen; |
| 87 | |
| 88 | if (proplen != len) |
| 89 | return -FDT_ERR_NOSPACE; |
| 90 | |
| 91 | return fdt_setprop_inplace_namelen_partial(fdt, nodeoffset, name, |
| 92 | strlen(name), 0, |
| 93 | val, len); |
| 94 | } |
| 95 | |
| 96 | static void _fdt_nop_region(void *start, int len) |
| 97 | { |
| 98 | fdt32_t *p; |
| 99 | |
| 100 | for (p = start; (char *)p < ((char *)start + len); p++) |
| 101 | *p = cpu_to_fdt32(FDT_NOP); |
| 102 | } |
| 103 | |
| 104 | int fdt_nop_property(void *fdt, int nodeoffset, const char *name) |
| 105 | { |
| 106 | struct fdt_property *prop; |
| 107 | int len; |
| 108 | |
| 109 | prop = fdt_get_property_w(fdt, nodeoffset, name, &len); |
Tom Rini | 2d4c225 | 2017-09-23 17:31:59 -0400 | [diff] [blame^] | 110 | if (!prop) |
Tom Rini | c0e032e | 2017-09-23 12:52:44 -0400 | [diff] [blame] | 111 | return len; |
| 112 | |
| 113 | _fdt_nop_region(prop, len + sizeof(*prop)); |
| 114 | |
| 115 | return 0; |
| 116 | } |
| 117 | |
| 118 | int _fdt_node_end_offset(void *fdt, int offset) |
| 119 | { |
| 120 | int depth = 0; |
| 121 | |
| 122 | while ((offset >= 0) && (depth >= 0)) |
| 123 | offset = fdt_next_node(fdt, offset, &depth); |
| 124 | |
| 125 | return offset; |
| 126 | } |
| 127 | |
| 128 | int fdt_nop_node(void *fdt, int nodeoffset) |
| 129 | { |
| 130 | int endoffset; |
| 131 | |
| 132 | endoffset = _fdt_node_end_offset(fdt, nodeoffset); |
| 133 | if (endoffset < 0) |
| 134 | return endoffset; |
| 135 | |
| 136 | _fdt_nop_region(fdt_offset_ptr_w(fdt, nodeoffset, 0), |
| 137 | endoffset - nodeoffset); |
| 138 | return 0; |
| 139 | } |