You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
97 lines
3.1 KiB
97 lines
3.1 KiB
11 years ago
|
/*
|
||
|
|
* libfdt - Flat Device Tree manipulation
|
||
|
|
* Copyright (C) 2014 David Gibson <david@gibson.dropbear.id.au>
|
||
|
|
*
|
||
|
|
* 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"
|
||
|
|
|
||
|
|
int fdt_address_cells(const void *fdt, int nodeoffset)
|
||
|
|
{
|
||
|
|
const fdt32_t *ac;
|
||
|
|
int val;
|
||
|
|
int len;
|
||
|
|
|
||
|
|
ac = fdt_getprop(fdt, nodeoffset, "#address-cells", &len);
|
||
|
|
if (!ac)
|
||
|
|
return 2;
|
||
|
|
|
||
|
|
if (len != sizeof(*ac))
|
||
|
|
return -FDT_ERR_BADNCELLS;
|
||
|
|
|
||
|
|
val = fdt32_to_cpu(*ac);
|
||
|
|
if ((val <= 0) || (val > FDT_MAX_NCELLS))
|
||
|
|
return -FDT_ERR_BADNCELLS;
|
||
|
|
|
||
|
|
return val;
|
||
|
|
}
|
||
|
|
|
||
|
|
int fdt_size_cells(const void *fdt, int nodeoffset)
|
||
|
|
{
|
||
|
|
const fdt32_t *sc;
|
||
|
|
int val;
|
||
|
|
int len;
|
||
|
|
|
||
|
|
sc = fdt_getprop(fdt, nodeoffset, "#size-cells", &len);
|
||
|
|
if (!sc)
|
||
|
|
return 2;
|
||
|
|
|
||
|
|
if (len != sizeof(*sc))
|
||
|
|
return -FDT_ERR_BADNCELLS;
|
||
|
|
|
||
|
|
val = fdt32_to_cpu(*sc);
|
||
|
|
if ((val < 0) || (val > FDT_MAX_NCELLS))
|
||
|
|
return -FDT_ERR_BADNCELLS;
|
||
|
|
|
||
|
|
return val;
|
||
|
|
}
|