xref: /utopia/UTPA2-700.0.x/projects/build/scripts/dtc/libfdt/fdt_wip.c (revision 53ee8cc121a030b8d368113ac3e966b4705770ef)
1*53ee8cc1Swenshuai.xi /*
2*53ee8cc1Swenshuai.xi  * libfdt - Flat Device Tree manipulation
3*53ee8cc1Swenshuai.xi  * Copyright (C) 2006 David Gibson, IBM Corporation.
4*53ee8cc1Swenshuai.xi  *
5*53ee8cc1Swenshuai.xi  * libfdt is dual licensed: you can use it either under the terms of
6*53ee8cc1Swenshuai.xi  * the GPL, or the BSD license, at your option.
7*53ee8cc1Swenshuai.xi  *
8*53ee8cc1Swenshuai.xi  *  a) This library is free software; you can redistribute it and/or
9*53ee8cc1Swenshuai.xi  *     modify it under the terms of the GNU General Public License as
10*53ee8cc1Swenshuai.xi  *     published by the Free Software Foundation; either version 2 of the
11*53ee8cc1Swenshuai.xi  *     License, or (at your option) any later version.
12*53ee8cc1Swenshuai.xi  *
13*53ee8cc1Swenshuai.xi  *     This library is distributed in the hope that it will be useful,
14*53ee8cc1Swenshuai.xi  *     but WITHOUT ANY WARRANTY; without even the implied warranty of
15*53ee8cc1Swenshuai.xi  *     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
16*53ee8cc1Swenshuai.xi  *     GNU General Public License for more details.
17*53ee8cc1Swenshuai.xi  *
18*53ee8cc1Swenshuai.xi  *     You should have received a copy of the GNU General Public
19*53ee8cc1Swenshuai.xi  *     License along with this library; if not, write to the Free
20*53ee8cc1Swenshuai.xi  *     Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
21*53ee8cc1Swenshuai.xi  *     MA 02110-1301 USA
22*53ee8cc1Swenshuai.xi  *
23*53ee8cc1Swenshuai.xi  * Alternatively,
24*53ee8cc1Swenshuai.xi  *
25*53ee8cc1Swenshuai.xi  *  b) Redistribution and use in source and binary forms, with or
26*53ee8cc1Swenshuai.xi  *     without modification, are permitted provided that the following
27*53ee8cc1Swenshuai.xi  *     conditions are met:
28*53ee8cc1Swenshuai.xi  *
29*53ee8cc1Swenshuai.xi  *     1. Redistributions of source code must retain the above
30*53ee8cc1Swenshuai.xi  *        copyright notice, this list of conditions and the following
31*53ee8cc1Swenshuai.xi  *        disclaimer.
32*53ee8cc1Swenshuai.xi  *     2. Redistributions in binary form must reproduce the above
33*53ee8cc1Swenshuai.xi  *        copyright notice, this list of conditions and the following
34*53ee8cc1Swenshuai.xi  *        disclaimer in the documentation and/or other materials
35*53ee8cc1Swenshuai.xi  *        provided with the distribution.
36*53ee8cc1Swenshuai.xi  *
37*53ee8cc1Swenshuai.xi  *     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
38*53ee8cc1Swenshuai.xi  *     CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
39*53ee8cc1Swenshuai.xi  *     INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
40*53ee8cc1Swenshuai.xi  *     MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
41*53ee8cc1Swenshuai.xi  *     DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
42*53ee8cc1Swenshuai.xi  *     CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
43*53ee8cc1Swenshuai.xi  *     SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
44*53ee8cc1Swenshuai.xi  *     NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
45*53ee8cc1Swenshuai.xi  *     LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
46*53ee8cc1Swenshuai.xi  *     HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
47*53ee8cc1Swenshuai.xi  *     CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
48*53ee8cc1Swenshuai.xi  *     OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
49*53ee8cc1Swenshuai.xi  *     EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
50*53ee8cc1Swenshuai.xi  */
51*53ee8cc1Swenshuai.xi #include "libfdt_env.h"
52*53ee8cc1Swenshuai.xi 
53*53ee8cc1Swenshuai.xi #include <fdt.h>
54*53ee8cc1Swenshuai.xi #include <libfdt.h>
55*53ee8cc1Swenshuai.xi 
56*53ee8cc1Swenshuai.xi #include "libfdt_internal.h"
57*53ee8cc1Swenshuai.xi 
fdt_setprop_inplace(void * fdt,int nodeoffset,const char * name,const void * val,int len)58*53ee8cc1Swenshuai.xi int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name,
59*53ee8cc1Swenshuai.xi 			const void *val, int len)
60*53ee8cc1Swenshuai.xi {
61*53ee8cc1Swenshuai.xi 	void *propval;
62*53ee8cc1Swenshuai.xi 	int proplen;
63*53ee8cc1Swenshuai.xi 
64*53ee8cc1Swenshuai.xi 	propval = fdt_getprop_w(fdt, nodeoffset, name, &proplen);
65*53ee8cc1Swenshuai.xi 	if (! propval)
66*53ee8cc1Swenshuai.xi 		return proplen;
67*53ee8cc1Swenshuai.xi 
68*53ee8cc1Swenshuai.xi 	if (proplen != len)
69*53ee8cc1Swenshuai.xi 		return -FDT_ERR_NOSPACE;
70*53ee8cc1Swenshuai.xi 
71*53ee8cc1Swenshuai.xi 	memcpy(propval, val, len);
72*53ee8cc1Swenshuai.xi 	return 0;
73*53ee8cc1Swenshuai.xi }
74*53ee8cc1Swenshuai.xi 
_fdt_nop_region(void * start,int len)75*53ee8cc1Swenshuai.xi static void _fdt_nop_region(void *start, int len)
76*53ee8cc1Swenshuai.xi {
77*53ee8cc1Swenshuai.xi 	uint32_t *p;
78*53ee8cc1Swenshuai.xi 
79*53ee8cc1Swenshuai.xi 	for (p = start; (char *)p < ((char *)start + len); p++)
80*53ee8cc1Swenshuai.xi 		*p = cpu_to_fdt32(FDT_NOP);
81*53ee8cc1Swenshuai.xi }
82*53ee8cc1Swenshuai.xi 
fdt_nop_property(void * fdt,int nodeoffset,const char * name)83*53ee8cc1Swenshuai.xi int fdt_nop_property(void *fdt, int nodeoffset, const char *name)
84*53ee8cc1Swenshuai.xi {
85*53ee8cc1Swenshuai.xi 	struct fdt_property *prop;
86*53ee8cc1Swenshuai.xi 	int len;
87*53ee8cc1Swenshuai.xi 
88*53ee8cc1Swenshuai.xi 	prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
89*53ee8cc1Swenshuai.xi 	if (! prop)
90*53ee8cc1Swenshuai.xi 		return len;
91*53ee8cc1Swenshuai.xi 
92*53ee8cc1Swenshuai.xi 	_fdt_nop_region(prop, len + sizeof(*prop));
93*53ee8cc1Swenshuai.xi 
94*53ee8cc1Swenshuai.xi 	return 0;
95*53ee8cc1Swenshuai.xi }
96*53ee8cc1Swenshuai.xi 
_fdt_node_end_offset(void * fdt,int nodeoffset)97*53ee8cc1Swenshuai.xi int _fdt_node_end_offset(void *fdt, int nodeoffset)
98*53ee8cc1Swenshuai.xi {
99*53ee8cc1Swenshuai.xi 	int level = 0;
100*53ee8cc1Swenshuai.xi 	uint32_t tag;
101*53ee8cc1Swenshuai.xi 	int offset, nextoffset;
102*53ee8cc1Swenshuai.xi 
103*53ee8cc1Swenshuai.xi 	tag = fdt_next_tag(fdt, nodeoffset, &nextoffset);
104*53ee8cc1Swenshuai.xi 	if (tag != FDT_BEGIN_NODE)
105*53ee8cc1Swenshuai.xi 		return -FDT_ERR_BADOFFSET;
106*53ee8cc1Swenshuai.xi 	do {
107*53ee8cc1Swenshuai.xi 		offset = nextoffset;
108*53ee8cc1Swenshuai.xi 		tag = fdt_next_tag(fdt, offset, &nextoffset);
109*53ee8cc1Swenshuai.xi 
110*53ee8cc1Swenshuai.xi 		switch (tag) {
111*53ee8cc1Swenshuai.xi 		case FDT_END:
112*53ee8cc1Swenshuai.xi 			return offset;
113*53ee8cc1Swenshuai.xi 
114*53ee8cc1Swenshuai.xi 		case FDT_BEGIN_NODE:
115*53ee8cc1Swenshuai.xi 			level++;
116*53ee8cc1Swenshuai.xi 			break;
117*53ee8cc1Swenshuai.xi 
118*53ee8cc1Swenshuai.xi 		case FDT_END_NODE:
119*53ee8cc1Swenshuai.xi 			level--;
120*53ee8cc1Swenshuai.xi 			break;
121*53ee8cc1Swenshuai.xi 
122*53ee8cc1Swenshuai.xi 		case FDT_PROP:
123*53ee8cc1Swenshuai.xi 		case FDT_NOP:
124*53ee8cc1Swenshuai.xi 			break;
125*53ee8cc1Swenshuai.xi 
126*53ee8cc1Swenshuai.xi 		default:
127*53ee8cc1Swenshuai.xi 			return -FDT_ERR_BADSTRUCTURE;
128*53ee8cc1Swenshuai.xi 		}
129*53ee8cc1Swenshuai.xi 	} while (level >= 0);
130*53ee8cc1Swenshuai.xi 
131*53ee8cc1Swenshuai.xi 	return nextoffset;
132*53ee8cc1Swenshuai.xi }
133*53ee8cc1Swenshuai.xi 
fdt_nop_node(void * fdt,int nodeoffset)134*53ee8cc1Swenshuai.xi int fdt_nop_node(void *fdt, int nodeoffset)
135*53ee8cc1Swenshuai.xi {
136*53ee8cc1Swenshuai.xi 	int endoffset;
137*53ee8cc1Swenshuai.xi 
138*53ee8cc1Swenshuai.xi 	endoffset = _fdt_node_end_offset(fdt, nodeoffset);
139*53ee8cc1Swenshuai.xi 	if (endoffset < 0)
140*53ee8cc1Swenshuai.xi 		return endoffset;
141*53ee8cc1Swenshuai.xi 
142*53ee8cc1Swenshuai.xi 	_fdt_nop_region(fdt_offset_ptr_w(fdt, nodeoffset, 0),
143*53ee8cc1Swenshuai.xi 			endoffset - nodeoffset);
144*53ee8cc1Swenshuai.xi 	return 0;
145*53ee8cc1Swenshuai.xi }
146