|
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(void *fdt, int nodeoffset, const char *name, |
|
59 const void *val, int len) |
|
60 { |
|
61 void *propval; |
|
62 int proplen; |
|
63 |
|
64 propval = fdt_getprop_w(fdt, nodeoffset, name, &proplen); |
|
65 if (! propval) |
|
66 return proplen; |
|
67 |
|
68 if (proplen != len) |
|
69 return -FDT_ERR_NOSPACE; |
|
70 |
|
71 memcpy(propval, val, len); |
|
72 return 0; |
|
73 } |
|
74 |
|
75 static void _fdt_nop_region(void *start, int len) |
|
76 { |
|
77 uint32_t *p; |
|
78 |
|
79 for (p = start; (char *)p < ((char *)start + len); p++) |
|
80 *p = cpu_to_fdt32(FDT_NOP); |
|
81 } |
|
82 |
|
83 int fdt_nop_property(void *fdt, int nodeoffset, const char *name) |
|
84 { |
|
85 struct fdt_property *prop; |
|
86 int len; |
|
87 |
|
88 prop = fdt_get_property_w(fdt, nodeoffset, name, &len); |
|
89 if (! prop) |
|
90 return len; |
|
91 |
|
92 _fdt_nop_region(prop, len + sizeof(*prop)); |
|
93 |
|
94 return 0; |
|
95 } |
|
96 |
|
97 int _fdt_node_end_offset(void *fdt, int nodeoffset) |
|
98 { |
|
99 int level = 0; |
|
100 uint32_t tag; |
|
101 int offset, nextoffset; |
|
102 |
|
103 tag = fdt_next_tag(fdt, nodeoffset, &nextoffset); |
|
104 if (tag != FDT_BEGIN_NODE) |
|
105 return -FDT_ERR_BADOFFSET; |
|
106 do { |
|
107 offset = nextoffset; |
|
108 tag = fdt_next_tag(fdt, offset, &nextoffset); |
|
109 |
|
110 switch (tag) { |
|
111 case FDT_END: |
|
112 return offset; |
|
113 |
|
114 case FDT_BEGIN_NODE: |
|
115 level++; |
|
116 break; |
|
117 |
|
118 case FDT_END_NODE: |
|
119 level--; |
|
120 break; |
|
121 |
|
122 case FDT_PROP: |
|
123 case FDT_NOP: |
|
124 break; |
|
125 |
|
126 default: |
|
127 return -FDT_ERR_BADSTRUCTURE; |
|
128 } |
|
129 } while (level >= 0); |
|
130 |
|
131 return nextoffset; |
|
132 } |
|
133 |
|
134 int fdt_nop_node(void *fdt, int nodeoffset) |
|
135 { |
|
136 int endoffset; |
|
137 |
|
138 endoffset = _fdt_node_end_offset(fdt, nodeoffset); |
|
139 if (endoffset < 0) |
|
140 return endoffset; |
|
141 |
|
142 _fdt_nop_region(fdt_offset_ptr_w(fdt, nodeoffset, 0), |
|
143 endoffset - nodeoffset); |
|
144 return 0; |
|
145 } |