2007-12-10 11:28:39 +08:00
|
|
|
/*
|
|
|
|
* libfdt - Flat Device Tree manipulation
|
|
|
|
* Copyright (C) 2006 David Gibson, IBM Corporation.
|
|
|
|
*
|
|
|
|
* libfdt is dual licensed: you can use it either under the terms of
|
|
|
|
* the GPL, or the BSD license, at your option.
|
|
|
|
*
|
|
|
|
* a) This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License as
|
|
|
|
* published by the Free Software Foundation; either version 2 of the
|
|
|
|
* License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public
|
|
|
|
* License along with this library; if not, write to the Free
|
|
|
|
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
|
|
|
|
* MA 02110-1301 USA
|
|
|
|
*
|
|
|
|
* Alternatively,
|
|
|
|
*
|
|
|
|
* b) Redistribution and use in source and binary forms, with or
|
|
|
|
* without modification, are permitted provided that the following
|
|
|
|
* conditions are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above
|
|
|
|
* copyright notice, this list of conditions and the following
|
|
|
|
* disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above
|
|
|
|
* copyright notice, this list of conditions and the following
|
|
|
|
* disclaimer in the documentation and/or other materials
|
|
|
|
* provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
|
|
|
|
* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
|
|
|
|
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
|
|
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
|
|
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
|
|
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
|
|
|
* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
#include "libfdt_env.h"
|
|
|
|
|
|
|
|
#include <fdt.h>
|
|
|
|
#include <libfdt.h>
|
|
|
|
|
|
|
|
#include "libfdt_internal.h"
|
|
|
|
|
2017-01-05 00:45:20 +08:00
|
|
|
int fdt_setprop_inplace_namelen_partial(void *fdt, int nodeoffset,
|
|
|
|
const char *name, int namelen,
|
|
|
|
uint32_t idx, const void *val,
|
|
|
|
int len)
|
|
|
|
{
|
|
|
|
void *propval;
|
|
|
|
int proplen;
|
|
|
|
|
|
|
|
propval = fdt_getprop_namelen_w(fdt, nodeoffset, name, namelen,
|
|
|
|
&proplen);
|
|
|
|
if (!propval)
|
|
|
|
return proplen;
|
|
|
|
|
|
|
|
if (proplen < (len + idx))
|
|
|
|
return -FDT_ERR_NOSPACE;
|
|
|
|
|
|
|
|
memcpy((char *)propval + idx, val, len);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-12-10 11:28:39 +08:00
|
|
|
int fdt_setprop_inplace(void *fdt, int nodeoffset, const char *name,
|
|
|
|
const void *val, int len)
|
|
|
|
{
|
2017-01-05 00:45:20 +08:00
|
|
|
const void *propval;
|
2007-12-10 11:28:39 +08:00
|
|
|
int proplen;
|
|
|
|
|
2017-01-05 00:45:20 +08:00
|
|
|
propval = fdt_getprop(fdt, nodeoffset, name, &proplen);
|
2017-10-04 00:37:04 +08:00
|
|
|
if (!propval)
|
2007-12-10 11:28:39 +08:00
|
|
|
return proplen;
|
|
|
|
|
|
|
|
if (proplen != len)
|
|
|
|
return -FDT_ERR_NOSPACE;
|
|
|
|
|
2017-01-05 00:45:20 +08:00
|
|
|
return fdt_setprop_inplace_namelen_partial(fdt, nodeoffset, name,
|
|
|
|
strlen(name), 0,
|
|
|
|
val, len);
|
2007-12-10 11:28:39 +08:00
|
|
|
}
|
|
|
|
|
2018-02-28 07:40:38 +08:00
|
|
|
static void fdt_nop_region_(void *start, int len)
|
2007-12-10 11:28:39 +08:00
|
|
|
{
|
2015-04-30 05:00:05 +08:00
|
|
|
fdt32_t *p;
|
2007-12-10 11:28:39 +08:00
|
|
|
|
2008-08-07 10:24:17 +08:00
|
|
|
for (p = start; (char *)p < ((char *)start + len); p++)
|
2007-12-10 11:28:39 +08:00
|
|
|
*p = cpu_to_fdt32(FDT_NOP);
|
|
|
|
}
|
|
|
|
|
|
|
|
int fdt_nop_property(void *fdt, int nodeoffset, const char *name)
|
|
|
|
{
|
|
|
|
struct fdt_property *prop;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
|
2017-10-04 00:37:04 +08:00
|
|
|
if (!prop)
|
2007-12-10 11:28:39 +08:00
|
|
|
return len;
|
|
|
|
|
2018-02-28 07:40:38 +08:00
|
|
|
fdt_nop_region_(prop, len + sizeof(*prop));
|
2007-12-10 11:28:39 +08:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2018-02-28 07:40:38 +08:00
|
|
|
int fdt_node_end_offset_(void *fdt, int offset)
|
2007-12-10 11:28:39 +08:00
|
|
|
{
|
2012-09-29 05:25:59 +08:00
|
|
|
int depth = 0;
|
|
|
|
|
|
|
|
while ((offset >= 0) && (depth >= 0))
|
|
|
|
offset = fdt_next_node(fdt, offset, &depth);
|
|
|
|
|
|
|
|
return offset;
|
2007-12-10 11:28:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int fdt_nop_node(void *fdt, int nodeoffset)
|
|
|
|
{
|
|
|
|
int endoffset;
|
|
|
|
|
2018-02-28 07:40:38 +08:00
|
|
|
endoffset = fdt_node_end_offset_(fdt, nodeoffset);
|
2007-12-10 11:28:39 +08:00
|
|
|
if (endoffset < 0)
|
|
|
|
return endoffset;
|
|
|
|
|
2018-02-28 07:40:38 +08:00
|
|
|
fdt_nop_region_(fdt_offset_ptr_w(fdt, nodeoffset, 0),
|
2008-08-07 10:24:17 +08:00
|
|
|
endoffset - nodeoffset);
|
2007-12-10 11:28:39 +08:00
|
|
|
return 0;
|
|
|
|
}
|