blob: 6025fa1fe8feeb046a68605776d0d1ecac1efe9f [file] [log] [blame]
David Gibson3da0f9a2006-11-27 16:21:28 +11001/*
2 * libfdt - Flat Device Tree manipulation
3 * Copyright (C) 2006 David Gibson, IBM Corporation.
4 *
David Gibson94816052007-06-13 16:30:48 +10005 * libfdt is dual licensed: you can use it either under the terms of
6 * the GPL, or the BSD license, at your option.
David Gibson3da0f9a2006-11-27 16:21:28 +11007 *
David Gibson94816052007-06-13 16:30:48 +10008 * 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.
David Gibson3da0f9a2006-11-27 16:21:28 +110012 *
David Gibson94816052007-06-13 16:30:48 +100013 * 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.
David Gibson3da0f9a2006-11-27 16:21:28 +110050 */
51#include "libfdt_env.h"
52
53#include <fdt.h>
54#include <libfdt.h>
55
56#include "libfdt_internal.h"
57
David Gibson73d60922006-12-15 15:12:47 +110058int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name,
David Gibson3da0f9a2006-11-27 16:21:28 +110059 const void *val, int len)
60{
61 void *propval;
62 int proplen;
David Gibson3da0f9a2006-11-27 16:21:28 +110063
David Gibsona6c76f92007-06-13 14:18:10 +100064 propval = fdt_getprop_w(fdt, nodeoffset, name, &proplen);
David Gibsona7ee95d2006-12-15 15:12:49 +110065 if (! propval)
David Gibson9a9fdf52006-12-15 15:12:51 +110066 return proplen;
David Gibson3da0f9a2006-11-27 16:21:28 +110067
68 if (proplen != len)
David Gibson3aea8282006-12-15 15:12:52 +110069 return -FDT_ERR_NOSPACE;
David Gibson3da0f9a2006-11-27 16:21:28 +110070
71 memcpy(propval, val, len);
72 return 0;
73}
74
David Gibsonb6d80a22008-07-09 14:10:24 +100075static void _fdt_nop_region(void *start, int len)
David Gibson3da0f9a2006-11-27 16:21:28 +110076{
77 uint32_t *p;
78
David Gibson36786db2008-07-07 10:10:48 +100079 for (p = start; (char *)p < ((char *)start + len); p++)
David Gibsone25487d2006-12-04 12:52:45 +110080 *p = cpu_to_fdt32(FDT_NOP);
David Gibson3da0f9a2006-11-27 16:21:28 +110081}
82
David Gibson73d60922006-12-15 15:12:47 +110083int fdt_nop_property(void *fdt, int nodeoffset, const char *name)
David Gibson3da0f9a2006-11-27 16:21:28 +110084{
85 struct fdt_property *prop;
86 int len;
David Gibson3da0f9a2006-11-27 16:21:28 +110087
David Gibsona6c76f92007-06-13 14:18:10 +100088 prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
David Gibsona7ee95d2006-12-15 15:12:49 +110089 if (! prop)
David Gibson9a9fdf52006-12-15 15:12:51 +110090 return len;
David Gibson3da0f9a2006-11-27 16:21:28 +110091
David Gibsonb6d80a22008-07-09 14:10:24 +100092 _fdt_nop_region(prop, len + sizeof(*prop));
David Gibson3da0f9a2006-11-27 16:21:28 +110093
94 return 0;
95}
96
David Gibsonce4d9c02009-02-06 14:01:56 +110097int _fdt_node_end_offset(void *fdt, int offset)
David Gibson3da0f9a2006-11-27 16:21:28 +110098{
David Gibsonce4d9c02009-02-06 14:01:56 +110099 int depth = 0;
David Gibson3da0f9a2006-11-27 16:21:28 +1100100
David Gibsonce4d9c02009-02-06 14:01:56 +1100101 while ((offset >= 0) && (depth >= 0))
102 offset = fdt_next_node(fdt, offset, &depth);
David Gibson3da0f9a2006-11-27 16:21:28 +1100103
David Gibsonce4d9c02009-02-06 14:01:56 +1100104 return offset;
David Gibson7ba551f2006-12-01 16:59:43 +1100105}
David Gibson3da0f9a2006-11-27 16:21:28 +1100106
David Gibson73d60922006-12-15 15:12:47 +1100107int fdt_nop_node(void *fdt, int nodeoffset)
David Gibson7ba551f2006-12-01 16:59:43 +1100108{
109 int endoffset;
David Gibson7ba551f2006-12-01 16:59:43 +1100110
111 endoffset = _fdt_node_end_offset(fdt, nodeoffset);
David Gibson9a9fdf52006-12-15 15:12:51 +1100112 if (endoffset < 0)
113 return endoffset;
David Gibson7ba551f2006-12-01 16:59:43 +1100114
David Gibsonb6d80a22008-07-09 14:10:24 +1000115 _fdt_nop_region(fdt_offset_ptr_w(fdt, nodeoffset, 0),
116 endoffset - nodeoffset);
David Gibson7ba551f2006-12-01 16:59:43 +1100117 return 0;
David Gibson3da0f9a2006-11-27 16:21:28 +1100118}