]>
Commit | Line | Data |
---|---|---|
1e57a462 | 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 | int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name,\r | |
59 | const void *val, int len)\r | |
60 | {\r | |
61 | void *propval;\r | |
62 | int proplen;\r | |
63 | \r | |
64 | propval = fdt_getprop_w(fdt, nodeoffset, name, &proplen);\r | |
65 | if (! propval)\r | |
66 | return proplen;\r | |
67 | \r | |
68 | if (proplen != len)\r | |
69 | return -FDT_ERR_NOSPACE;\r | |
70 | \r | |
71 | memcpy(propval, val, len);\r | |
72 | return 0;\r | |
73 | }\r | |
74 | \r | |
75 | static void _fdt_nop_region(void *start, int len)\r | |
76 | {\r | |
77 | uint32_t *p;\r | |
78 | \r | |
79 | for (p = start; (char *)p < ((char *)start + len); p++)\r | |
80 | *p = cpu_to_fdt32(FDT_NOP);\r | |
81 | }\r | |
82 | \r | |
83 | int fdt_nop_property(void *fdt, int nodeoffset, const char *name)\r | |
84 | {\r | |
85 | struct fdt_property *prop;\r | |
86 | int len;\r | |
87 | \r | |
88 | prop = fdt_get_property_w(fdt, nodeoffset, name, &len);\r | |
89 | if (! prop)\r | |
90 | return len;\r | |
91 | \r | |
92 | _fdt_nop_region(prop, len + sizeof(*prop));\r | |
93 | \r | |
94 | return 0;\r | |
95 | }\r | |
96 | \r | |
97 | int _fdt_node_end_offset(void *fdt, int offset)\r | |
98 | {\r | |
99 | int depth = 0;\r | |
100 | \r | |
101 | while ((offset >= 0) && (depth >= 0))\r | |
102 | offset = fdt_next_node(fdt, offset, &depth);\r | |
103 | \r | |
104 | return offset;\r | |
105 | }\r | |
106 | \r | |
107 | int fdt_nop_node(void *fdt, int nodeoffset)\r | |
108 | {\r | |
109 | int endoffset;\r | |
110 | \r | |
111 | endoffset = _fdt_node_end_offset(fdt, nodeoffset);\r | |
112 | if (endoffset < 0)\r | |
113 | return endoffset;\r | |
114 | \r | |
115 | _fdt_nop_region(fdt_offset_ptr_w(fdt, nodeoffset, 0),\r | |
116 | endoffset - nodeoffset);\r | |
117 | return 0;\r | |
118 | }\r |