Loading...
1// SPDX-License-Identifier: (GPL-2.0-or-later OR BSD-2-Clause)
2/*
3 * libfdt - Flat Device Tree manipulation
4 * Copyright (C) 2006 David Gibson, IBM Corporation.
5 */
6#include "libfdt_env.h"
7
8#include <fdt.h>
9#include <libfdt.h>
10
11#include "libfdt_internal.h"
12
13int fdt_setprop_inplace_namelen_partial(void *fdt, int nodeoffset,
14 const char *name, int namelen,
15 uint32_t idx, const void *val,
16 int len)
17{
18 void *propval;
19 int proplen;
20
21 propval = fdt_getprop_namelen_w(fdt, nodeoffset, name, namelen,
22 &proplen);
23 if (!propval)
24 return proplen;
25
26 if ((unsigned)proplen < (len + idx))
27 return -FDT_ERR_NOSPACE;
28
29 memcpy((char *)propval + idx, val, len);
30 return 0;
31}
32
33int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name,
34 const void *val, int len)
35{
36 const void *propval;
37 int proplen;
38
39 propval = fdt_getprop(fdt, nodeoffset, name, &proplen);
40 if (!propval)
41 return proplen;
42
43 if (proplen != len)
44 return -FDT_ERR_NOSPACE;
45
46 return fdt_setprop_inplace_namelen_partial(fdt, nodeoffset, name,
47 strlen(name), 0,
48 val, len);
49}
50
51static void fdt_nop_region_(void *start, int len)
52{
53 fdt32_t *p;
54
55 for (p = start; (char *)p < ((char *)start + len); p++)
56 *p = cpu_to_fdt32(FDT_NOP);
57}
58
59int fdt_nop_property(void *fdt, int nodeoffset, const char *name)
60{
61 struct fdt_property *prop;
62 int len;
63
64 prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
65 if (!prop)
66 return len;
67
68 fdt_nop_region_(prop, len + sizeof(*prop));
69
70 return 0;
71}
72
73int fdt_node_end_offset_(void *fdt, int offset)
74{
75 int depth = 0;
76
77 while ((offset >= 0) && (depth >= 0))
78 offset = fdt_next_node(fdt, offset, &depth);
79
80 return offset;
81}
82
83int fdt_nop_node(void *fdt, int nodeoffset)
84{
85 int endoffset;
86
87 endoffset = fdt_node_end_offset_(fdt, nodeoffset);
88 if (endoffset < 0)
89 return endoffset;
90
91 fdt_nop_region_(fdt_offset_ptr_w(fdt, nodeoffset, 0),
92 endoffset - nodeoffset);
93 return 0;
94}
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
58int 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
78int 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);
85 if (!propval)
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
96static 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
104int 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);
110 if (!prop)
111 return len;
112
113 fdt_nop_region_(prop, len + sizeof(*prop));
114
115 return 0;
116}
117
118int 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
128int 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}