vbatts
/
grub
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Remove libfdt

This commit is contained in:
Vladimir 'phcoder' Serbinenko 2013-05-17 13:58:47 +02:00
parent c6a8472baf
commit 2a800dc3f3
16 changed files with 1 additions and 3477 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
autogen.sh
View File

@ -33,9 +33,6 @@ for x in mpi-asm-defs.h mpih-add1.c mpih-sub1.c mpih-mul1.c mpih-mul2.c mpih-mul
ln -s generic/"$x" grub-core/lib/libgcrypt-grub/mpi/"$x"
done
echo "Importing libfdt..."
python util/import_libfdt.py grub-core/lib/dtc/ grub-core
echo "Creating Makefile.tpl..."
python gentpl.py | sed -e '/^$/{N;/^\n$/D;}' > Makefile.tpl
@ -49,7 +46,7 @@ if [ "x${GRUB_CONTRIB}" != x ]; then
fi
UTIL_DEFS='Makefile.util.def Makefile.utilgcry.def'
CORE_DEFS='grub-core/Makefile.core.def grub-core/Makefile.gcry.def grub-core/Makefile.libfdt.def'
CORE_DEFS='grub-core/Makefile.core.def grub-core/Makefile.gcry.def'
for extra in contrib/*/Makefile.util.def; do
if test -e "$extra"; then

44
grub-core/lib/dtc/libfdt-grub.diff
View File

@ -1,44 +0,0 @@
diff -purN libfdt.orig/fdt_rw.c libfdt/fdt_rw.c
--- libfdt.orig/fdt_rw.c 2011-05-08 20:45:39.000000000 +0100
+++ libfdt/fdt_rw.c 2012-10-19 15:33:11.085523185 +0100
@@ -88,9 +88,9 @@ static int _fdt_rw_check_header(void *fd
#define FDT_RW_CHECK_HEADER(fdt) \
{ \
- int err; \
- if ((err = _fdt_rw_check_header(fdt)) != 0) \
- return err; \
+ int macro_err; \
+ if ((macro_err = _fdt_rw_check_header(fdt)) != 0) \
+ return macro_err; \
}
static inline int
diff -purN libfdt.orig/libfdt_env.h libfdt/libfdt_env.h
--- libfdt.orig/libfdt_env.h 2011-05-08 20:45:39.000000000 +0100
+++ libfdt/libfdt_env.h 2012-10-19 16:13:19.051344173 +0100
@@ -7,6 +7,8 @@
#include <stddef.h>
#include <stdint.h>
#include <string.h>
+#pragma GCC diagnostic ignored "-Wcast-align"
+#pragma GCC diagnostic ignored "-Wsign-compare"
#define _B(n) ((unsigned long long)((uint8_t *)&x)[n])
static inline uint32_t
diff -purN libfdt.orig/libfdt_internal.h libfdt/libfdt_internal.h
--- libfdt.orig/libfdt_internal.h 2011-05-08 20:45:39.000000000 +0100
+++ libfdt/libfdt_internal.h 2012-10-19 15:33:11.105524731 +0100
@@ -60,9 +60,9 @@
#define FDT_CHECK_HEADER(fdt) \
{ \
- int err; \
- if ((err = fdt_check_header(fdt)) != 0) \
- return err; \
+ int macro_err; \
+ if ((macro_err = fdt_check_header(fdt)) != 0) \
+ return macro_err; \
}
int _fdt_check_node_offset (const void *fdt, int offset);

10
grub-core/lib/dtc/libfdt/Makefile.libfdt
View File

@ -1,10 +0,0 @@
# Makefile.libfdt
#
# This is not a complete Makefile of itself. Instead, it is designed to
# be easily embeddable into other systems of Makefiles.
#
LIBFDT_soname = libfdt.$(SHAREDLIB_EXT).1
LIBFDT_INCLUDES = fdt.h libfdt.h
LIBFDT_VERSION = version.lds
LIBFDT_SRCS = fdt.c fdt_ro.c fdt_wip.c fdt_sw.c fdt_rw.c fdt_strerror.c
LIBFDT_OBJS = $(LIBFDT_SRCS:%.c=%.o)

3
grub-core/lib/dtc/libfdt/TODO
View File

@ -1,3 +0,0 @@
- Tree traversal functions
- Graft function
- Complete libfdt.h documenting comments

241
grub-core/lib/dtc/libfdt/fdt.c
View File

@ -1,241 +0,0 @@
/*
* 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"
int
fdt_check_header (const void *fdt)
{
if (fdt_magic (fdt) == FDT_MAGIC)
{
/* Complete tree */
if (fdt_version (fdt) < FDT_FIRST_SUPPORTED_VERSION)
return -FDT_ERR_BADVERSION;
if (fdt_last_comp_version (fdt) > FDT_LAST_SUPPORTED_VERSION)
return -FDT_ERR_BADVERSION;
}
else if (fdt_magic (fdt) == FDT_SW_MAGIC)
{
/* Unfinished sequential-write blob */
if (fdt_size_dt_struct (fdt) == 0)
return -FDT_ERR_BADSTATE;
}
else
{
return -FDT_ERR_BADMAGIC;
}
return 0;
}
const void *
fdt_offset_ptr (const void *fdt, int offset, unsigned int len)
{
const char *p;
if (fdt_version (fdt) >= 0x11)
if (((offset + len) < offset)
|| ((offset + len) > fdt_size_dt_struct (fdt)))
return NULL;
p = _fdt_offset_ptr (fdt, offset);
if (p + len < p)
return NULL;
return p;
}
uint32_t
fdt_next_tag (const void *fdt, int startoffset, int *nextoffset)
{
const uint32_t *tagp, *lenp;
uint32_t tag;
int offset = startoffset;
const char *p;
*nextoffset = -FDT_ERR_TRUNCATED;
tagp = fdt_offset_ptr (fdt, offset, FDT_TAGSIZE);
if (!tagp)
return FDT_END; /* premature end */
tag = fdt32_to_cpu (*tagp);
offset += FDT_TAGSIZE;
*nextoffset = -FDT_ERR_BADSTRUCTURE;
switch (tag)
{
case FDT_BEGIN_NODE:
/* skip name */
do
{
p = fdt_offset_ptr (fdt, offset++, 1);
}
while (p && (*p != '\0'));
if (!p)
return FDT_END; /* premature end */
break;
case FDT_PROP:
lenp = fdt_offset_ptr (fdt, offset, sizeof (*lenp));
if (!lenp)
return FDT_END; /* premature end */
/* skip-name offset, length and value */
offset += sizeof (struct fdt_property) - FDT_TAGSIZE
+ fdt32_to_cpu (*lenp);
break;
case FDT_END:
case FDT_END_NODE:
case FDT_NOP:
break;
default:
return FDT_END;
}
if (!fdt_offset_ptr (fdt, startoffset, offset - startoffset))
return FDT_END; /* premature end */
*nextoffset = FDT_TAGALIGN (offset);
return tag;
}
int
_fdt_check_node_offset (const void *fdt, int offset)
{
if ((offset < 0) || (offset % FDT_TAGSIZE)
|| (fdt_next_tag (fdt, offset, &offset) != FDT_BEGIN_NODE))
return -FDT_ERR_BADOFFSET;
return offset;
}
int
_fdt_check_prop_offset (const void *fdt, int offset)
{
if ((offset < 0) || (offset % FDT_TAGSIZE)
|| (fdt_next_tag (fdt, offset, &offset) != FDT_PROP))
return -FDT_ERR_BADOFFSET;
return offset;
}
int
fdt_next_node (const void *fdt, int offset, int *depth)
{
int nextoffset = 0;
uint32_t tag;
if (offset >= 0)
if ((nextoffset = _fdt_check_node_offset (fdt, offset)) < 0)
return nextoffset;
do
{
offset = nextoffset;
tag = fdt_next_tag (fdt, offset, &nextoffset);
switch (tag)
{
case FDT_PROP:
case FDT_NOP:
break;
case FDT_BEGIN_NODE:
if (depth)
(*depth)++;
break;
case FDT_END_NODE:
if (depth && ((--(*depth)) < 0))
return nextoffset;
break;
case FDT_END:
if ((nextoffset >= 0)
|| ((nextoffset == -FDT_ERR_TRUNCATED) && !depth))
return -FDT_ERR_NOTFOUND;
else
return nextoffset;
}
}
while (tag != FDT_BEGIN_NODE);
return offset;
}
const char *
_fdt_find_string (const char *strtab, int tabsize, const char *s)
{
int len = strlen (s) + 1;
const char *last = strtab + tabsize - len;
const char *p;
for (p = strtab; p <= last; p++)
if (memcmp (p, s, len) == 0)
return p;
return NULL;
}
int
fdt_move (const void *fdt, void *buf, int bufsize)
{
FDT_CHECK_HEADER (fdt);
if (fdt_totalsize (fdt) > bufsize)
return -FDT_ERR_NOSPACE;
memmove (buf, fdt, fdt_totalsize (fdt));
return 0;
}

64
grub-core/lib/dtc/libfdt/fdt.h
View File

@ -1,64 +0,0 @@
#ifndef _FDT_H
#define _FDT_H
#ifndef __ASSEMBLY__
struct fdt_header
{
uint32_t magic; /* magic word FDT_MAGIC */
uint32_t totalsize; /* total size of DT block */
uint32_t off_dt_struct; /* offset to structure */
uint32_t off_dt_strings; /* offset to strings */
uint32_t off_mem_rsvmap; /* offset to memory reserve map */
uint32_t version; /* format version */
uint32_t last_comp_version; /* last compatible version */
/* version 2 fields below */
uint32_t boot_cpuid_phys; /* Which physical CPU id we're
booting on */
/* version 3 fields below */
uint32_t size_dt_strings; /* size of the strings block */
/* version 17 fields below */
uint32_t size_dt_struct; /* size of the structure block */
};
struct fdt_reserve_entry
{
uint64_t address;
uint64_t size;
};
struct fdt_node_header
{
uint32_t tag;
char name[0];
};
struct fdt_property
{
uint32_t tag;
uint32_t len;
uint32_t nameoff;
char data[0];
};
#endif /* !__ASSEMBLY */
#define FDT_MAGIC 0xd00dfeed /* 4: version, 4: total size */
#define FDT_TAGSIZE sizeof(uint32_t)
#define FDT_BEGIN_NODE 0x1 /* Start node: full name */
#define FDT_END_NODE 0x2 /* End node */
#define FDT_PROP 0x3 /* Property: name off,
size, content */
#define FDT_NOP 0x4 /* nop */
#define FDT_END 0x9
#define FDT_V1_SIZE (7*sizeof(uint32_t))
#define FDT_V2_SIZE (FDT_V1_SIZE + sizeof(uint32_t))
#define FDT_V3_SIZE (FDT_V2_SIZE + sizeof(uint32_t))
#define FDT_V16_SIZE FDT_V3_SIZE
#define FDT_V17_SIZE (FDT_V16_SIZE + sizeof(uint32_t))
#endif /* _FDT_H */

608
grub-core/lib/dtc/libfdt/fdt_ro.c
View File

@ -1,608 +0,0 @@
/*
* 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"
static int
_fdt_nodename_eq (const void *fdt, int offset, const char *s, int len)
{
const char *p = fdt_offset_ptr (fdt, offset + FDT_TAGSIZE, len + 1);
if (!p)
/* short match */
return 0;
if (memcmp (p, s, len) != 0)
return 0;
if (p[len] == '\0')
return 1;
else if (!memchr (s, '@', len) && (p[len] == '@'))
return 1;
else
return 0;
}
const char *
fdt_string (const void *fdt, int stroffset)
{
return (const char *) fdt + fdt_off_dt_strings (fdt) + stroffset;
}
static int
_fdt_string_eq (const void *fdt, int stroffset, const char *s, int len)
{
const char *p = fdt_string (fdt, stroffset);
return (strlen (p) == len) && (memcmp (p, s, len) == 0);
}
int
fdt_get_mem_rsv (const void *fdt, int n, uint64_t * address, uint64_t * size)
{
FDT_CHECK_HEADER (fdt);
*address = fdt64_to_cpu (_fdt_mem_rsv (fdt, n)->address);
*size = fdt64_to_cpu (_fdt_mem_rsv (fdt, n)->size);
return 0;
}
int
fdt_num_mem_rsv (const void *fdt)
{
int i = 0;
while (fdt64_to_cpu (_fdt_mem_rsv (fdt, i)->size) != 0)
i++;
return i;
}
static int
_nextprop (const void *fdt, int offset)
{
uint32_t tag;
int nextoffset;
do
{
tag = fdt_next_tag (fdt, offset, &nextoffset);
switch (tag)
{
case FDT_END:
if (nextoffset >= 0)
return -FDT_ERR_BADSTRUCTURE;
else
return nextoffset;
case FDT_PROP:
return offset;
}
offset = nextoffset;
}
while (tag == FDT_NOP);
return -FDT_ERR_NOTFOUND;
}
int
fdt_subnode_offset_namelen (const void *fdt, int offset,
const char *name, int namelen)
{
int depth;
FDT_CHECK_HEADER (fdt);
for (depth = 0;
(offset >= 0) && (depth >= 0);
offset = fdt_next_node (fdt, offset, &depth))
if ((depth == 1) && _fdt_nodename_eq (fdt, offset, name, namelen))
return offset;
if (depth < 0)
return -FDT_ERR_NOTFOUND;
return offset; /* error */
}
int
fdt_subnode_offset (const void *fdt, int parentoffset, const char *name)
{
return fdt_subnode_offset_namelen (fdt, parentoffset, name, strlen (name));
}
int
fdt_path_offset (const void *fdt, const char *path)
{
const char *end = path + strlen (path);
const char *p = path;
int offset = 0;
FDT_CHECK_HEADER (fdt);
/* see if we have an alias */
if (*path != '/')
{
const char *q = strchr (path, '/');
if (!q)
q = end;
p = fdt_get_alias_namelen (fdt, p, q - p);
if (!p)
return -FDT_ERR_BADPATH;
offset = fdt_path_offset (fdt, p);
p = q;
}
while (*p)
{
const char *q;
while (*p == '/')
p++;
if (!*p)
return offset;
q = strchr (p, '/');
if (!q)
q = end;
offset = fdt_subnode_offset_namelen (fdt, offset, p, q - p);
if (offset < 0)
return offset;
p = q;
}
return offset;
}
const char *
fdt_get_name (const void *fdt, int nodeoffset, int *len)
{
const struct fdt_node_header *nh = _fdt_offset_ptr (fdt, nodeoffset);
int err;
if (((err = fdt_check_header (fdt)) != 0)
|| ((err = _fdt_check_node_offset (fdt, nodeoffset)) < 0))
goto fail;
if (len)
*len = strlen (nh->name);
return nh->name;
fail:
if (len)
*len = err;
return NULL;
}
int
fdt_first_property_offset (const void *fdt, int nodeoffset)
{
int offset;
if ((offset = _fdt_check_node_offset (fdt, nodeoffset)) < 0)
return offset;
return _nextprop (fdt, offset);
}
int
fdt_next_property_offset (const void *fdt, int offset)
{
if ((offset = _fdt_check_prop_offset (fdt, offset)) < 0)
return offset;
return _nextprop (fdt, offset);
}
const struct fdt_property *
fdt_get_property_by_offset (const void *fdt, int offset, int *lenp)
{
int err;
const struct fdt_property *prop;
if ((err = _fdt_check_prop_offset (fdt, offset)) < 0)
{
if (lenp)
*lenp = err;
return NULL;
}
prop = _fdt_offset_ptr (fdt, offset);
if (lenp)
*lenp = fdt32_to_cpu (prop->len);
return prop;
}
const struct fdt_property *
fdt_get_property_namelen (const void *fdt,
int offset,
const char *name, int namelen, int *lenp)
{
for (offset = fdt_first_property_offset (fdt, offset);
(offset >= 0); (offset = fdt_next_property_offset (fdt, offset)))
{
const struct fdt_property *prop;
if (!(prop = fdt_get_property_by_offset (fdt, offset, lenp)))
{
offset = -FDT_ERR_INTERNAL;
break;
}
if (_fdt_string_eq (fdt, fdt32_to_cpu (prop->nameoff), name, namelen))
return prop;
}
if (lenp)
*lenp = offset;
return NULL;
}
const struct fdt_property *
fdt_get_property (const void *fdt,
int nodeoffset, const char *name, int *lenp)
{
return fdt_get_property_namelen (fdt, nodeoffset, name,
strlen (name), lenp);
}
const void *
fdt_getprop_namelen (const void *fdt, int nodeoffset,
const char *name, int namelen, int *lenp)
{
const struct fdt_property *prop;
prop = fdt_get_property_namelen (fdt, nodeoffset, name, namelen, lenp);
if (!prop)
return NULL;
return prop->data;
}
const void *
fdt_getprop_by_offset (const void *fdt, int offset,
const char **namep, int *lenp)
{
const struct fdt_property *prop;
prop = fdt_get_property_by_offset (fdt, offset, lenp);
if (!prop)
return NULL;
if (namep)
*namep = fdt_string (fdt, fdt32_to_cpu (prop->nameoff));
return prop->data;
}
const void *
fdt_getprop (const void *fdt, int nodeoffset, const char *name, int *lenp)
{
return fdt_getprop_namelen (fdt, nodeoffset, name, strlen (name), lenp);
}
uint32_t
fdt_get_phandle (const void *fdt, int nodeoffset)
{
const uint32_t *php;
int len;
/* FIXME: This is a bit sub-optimal, since we potentially scan
* over all the properties twice. */
php = fdt_getprop (fdt, nodeoffset, "phandle", &len);
if (!php || (len != sizeof (*php)))
{
php = fdt_getprop (fdt, nodeoffset, "linux,phandle", &len);
if (!php || (len != sizeof (*php)))
return 0;
}
return fdt32_to_cpu (*php);
}
const char *
fdt_get_alias_namelen (const void *fdt, const char *name, int namelen)
{
int aliasoffset;
aliasoffset = fdt_path_offset (fdt, "/aliases");
if (aliasoffset < 0)
return NULL;
return fdt_getprop_namelen (fdt, aliasoffset, name, namelen, NULL);
}
const char *
fdt_get_alias (const void *fdt, const char *name)
{
return fdt_get_alias_namelen (fdt, name, strlen (name));
}
int
fdt_get_path (const void *fdt, int nodeoffset, char *buf, int buflen)
{
int pdepth = 0, p = 0;
int offset, depth, namelen;
const char *name;
FDT_CHECK_HEADER (fdt);
if (buflen < 2)
return -FDT_ERR_NOSPACE;
for (offset = 0, depth = 0;
(offset >= 0) && (offset <= nodeoffset);
offset = fdt_next_node (fdt, offset, &depth))
{
while (pdepth > depth)
{
do
{
p--;
}
while (buf[p - 1] != '/');
pdepth--;
}
if (pdepth >= depth)
{
name = fdt_get_name (fdt, offset, &namelen);
if (!name)
return namelen;
if ((p + namelen + 1) <= buflen)
{
memcpy (buf + p, name, namelen);
p += namelen;
buf[p++] = '/';
pdepth++;
}
}
if (offset == nodeoffset)
{
if (pdepth < (depth + 1))
return -FDT_ERR_NOSPACE;
if (p > 1) /* special case so that root path is "/", not "" */
p--;
buf[p] = '\0';
return 0;
}
}
if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
return -FDT_ERR_BADOFFSET;
else if (offset == -FDT_ERR_BADOFFSET)
return -FDT_ERR_BADSTRUCTURE;
return offset; /* error from fdt_next_node() */
}
int
fdt_supernode_atdepth_offset (const void *fdt, int nodeoffset,
int supernodedepth, int *nodedepth)
{
int offset, depth;
int supernodeoffset = -FDT_ERR_INTERNAL;
FDT_CHECK_HEADER (fdt);
if (supernodedepth < 0)
return -FDT_ERR_NOTFOUND;
for (offset = 0, depth = 0;
(offset >= 0) && (offset <= nodeoffset);
offset = fdt_next_node (fdt, offset, &depth))
{
if (depth == supernodedepth)
supernodeoffset = offset;
if (offset == nodeoffset)
{
if (nodedepth)
*nodedepth = depth;
if (supernodedepth > depth)
return -FDT_ERR_NOTFOUND;
else
return supernodeoffset;
}
}
if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
return -FDT_ERR_BADOFFSET;
else if (offset == -FDT_ERR_BADOFFSET)
return -FDT_ERR_BADSTRUCTURE;
return offset; /* error from fdt_next_node() */
}
int
fdt_node_depth (const void *fdt, int nodeoffset)
{
int nodedepth;
int err;
err = fdt_supernode_atdepth_offset (fdt, nodeoffset, 0, &nodedepth);
if (err)
return (err < 0) ? err : -FDT_ERR_INTERNAL;
return nodedepth;
}
int
fdt_parent_offset (const void *fdt, int nodeoffset)
{
int nodedepth = fdt_node_depth (fdt, nodeoffset);
if (nodedepth < 0)
return nodedepth;
return fdt_supernode_atdepth_offset (fdt, nodeoffset, nodedepth - 1, NULL);
}
int
fdt_node_offset_by_prop_value (const void *fdt, int startoffset,
const char *propname,
const void *propval, int proplen)
{
int offset;
const void *val;
int len;
FDT_CHECK_HEADER (fdt);
/* FIXME: The algorithm here is pretty horrible: we scan each
* property of a node in fdt_getprop(), then if that didn't
* find what we want, we scan over them again making our way
* to the next node. Still it's the easiest to implement
* approach; performance can come later. */
for (offset = fdt_next_node (fdt, startoffset, NULL);
offset >= 0; offset = fdt_next_node (fdt, offset, NULL))
{
val = fdt_getprop (fdt, offset, propname, &len);
if (val && (len == proplen) && (memcmp (val, propval, len) == 0))
return offset;
}
return offset; /* error from fdt_next_node() */
}
int
fdt_node_offset_by_phandle (const void *fdt, uint32_t phandle)
{
int offset;
if ((phandle == 0) || (phandle == -1))
return -FDT_ERR_BADPHANDLE;
FDT_CHECK_HEADER (fdt);
/* FIXME: The algorithm here is pretty horrible: we
* potentially scan each property of a node in
* fdt_get_phandle(), then if that didn't find what
* we want, we scan over them again making our way to the next
* node. Still it's the easiest to implement approach;
* performance can come later. */
for (offset = fdt_next_node (fdt, -1, NULL);
offset >= 0; offset = fdt_next_node (fdt, offset, NULL))
{
if (fdt_get_phandle (fdt, offset) == phandle)
return offset;
}
return offset; /* error from fdt_next_node() */
}
static int
_fdt_stringlist_contains (const char *strlist, int listlen, const char *str)
{
int len = strlen (str);
const char *p;
while (listlen >= len)
{
if (memcmp (str, strlist, len + 1) == 0)
return 1;
p = memchr (strlist, '\0', listlen);
if (!p)
return 0; /* malformed strlist.. */
listlen -= (p - strlist) + 1;
strlist = p + 1;
}
return 0;
}
int
fdt_node_check_compatible (const void *fdt, int nodeoffset,
const char *compatible)
{
const void *prop;
int len;
prop = fdt_getprop (fdt, nodeoffset, "compatible", &len);
if (!prop)
return len;
if (_fdt_stringlist_contains (prop, len, compatible))
return 0;
else
return 1;
}
int
fdt_node_offset_by_compatible (const void *fdt, int startoffset,
const char *compatible)
{
int offset, err;
FDT_CHECK_HEADER (fdt);
/* FIXME: The algorithm here is pretty horrible: we scan each
* property of a node in fdt_node_check_compatible(), then if
* that didn't find what we want, we scan over them again
* making our way to the next node. Still it's the easiest to
* implement approach; performance can come later. */
for (offset = fdt_next_node (fdt, startoffset, NULL);
offset >= 0; offset = fdt_next_node (fdt, offset, NULL))
{
err = fdt_node_check_compatible (fdt, offset, compatible);
if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
return err;
else if (err == 0)
return offset;
}
return offset; /* error from fdt_next_node() */
}

490
grub-core/lib/dtc/libfdt/fdt_rw.c
View File

@ -1,490 +0,0 @@
/*
* 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"
static int
_fdt_blocks_misordered (const void *fdt, int mem_rsv_size, int struct_size)
{
return (fdt_off_mem_rsvmap (fdt) <
FDT_ALIGN (sizeof (struct fdt_header), 8))
|| (fdt_off_dt_struct (fdt) < (fdt_off_mem_rsvmap (fdt) + mem_rsv_size))
|| (fdt_off_dt_strings (fdt) < (fdt_off_dt_struct (fdt) + struct_size))
|| (fdt_totalsize (fdt) <
(fdt_off_dt_strings (fdt) + fdt_size_dt_strings (fdt)));
}
static int
_fdt_rw_check_header (void *fdt)
{
FDT_CHECK_HEADER (fdt);
if (fdt_version (fdt) < 17)
return -FDT_ERR_BADVERSION;
if (_fdt_blocks_misordered (fdt, sizeof (struct fdt_reserve_entry),
fdt_size_dt_struct (fdt)))
return -FDT_ERR_BADLAYOUT;
if (fdt_version (fdt) > 17)
fdt_set_version (fdt, 17);
return 0;
}
#define FDT_RW_CHECK_HEADER(fdt) \
{ \
int err; \
if ((err = _fdt_rw_check_header(fdt)) != 0) \
return err; \
}
static inline int
_fdt_data_size (void *fdt)
{
return fdt_off_dt_strings (fdt) + fdt_size_dt_strings (fdt);
}
static int
_fdt_splice (void *fdt, void *splicepoint, int oldlen, int newlen)
{
char *p = splicepoint;
char *end = (char *) fdt + _fdt_data_size (fdt);
if (((p + oldlen) < p) || ((p + oldlen) > end))
return -FDT_ERR_BADOFFSET;
if ((end - oldlen + newlen) > ((char *) fdt + fdt_totalsize (fdt)))
return -FDT_ERR_NOSPACE;
memmove (p + newlen, p + oldlen, end - p - oldlen);
return 0;
}
static int
_fdt_splice_mem_rsv (void *fdt, struct fdt_reserve_entry *p,
int oldn, int newn)
{
int delta = (newn - oldn) * sizeof (*p);
int err;
err = _fdt_splice (fdt, p, oldn * sizeof (*p), newn * sizeof (*p));
if (err)
return err;
fdt_set_off_dt_struct (fdt, fdt_off_dt_struct (fdt) + delta);
fdt_set_off_dt_strings (fdt, fdt_off_dt_strings (fdt) + delta);
return 0;
}
static int
_fdt_splice_struct (void *fdt, void *p, int oldlen, int newlen)
{
int delta = newlen - oldlen;
int err;
if ((err = _fdt_splice (fdt, p, oldlen, newlen)))
return err;
fdt_set_size_dt_struct (fdt, fdt_size_dt_struct (fdt) + delta);
fdt_set_off_dt_strings (fdt, fdt_off_dt_strings (fdt) + delta);
return 0;
}
static int
_fdt_splice_string (void *fdt, int newlen)
{
void *p = (char *) fdt
+ fdt_off_dt_strings (fdt) + fdt_size_dt_strings (fdt);
int err;
if ((err = _fdt_splice (fdt, p, 0, newlen)))
return err;
fdt_set_size_dt_strings (fdt, fdt_size_dt_strings (fdt) + newlen);
return 0;
}
static int
_fdt_find_add_string (void *fdt, const char *s)
{
char *strtab = (char *) fdt + fdt_off_dt_strings (fdt);
const char *p;
char *new;
int len = strlen (s) + 1;
int err;
p = _fdt_find_string (strtab, fdt_size_dt_strings (fdt), s);
if (p)
/* found it */
return (p - strtab);
new = strtab + fdt_size_dt_strings (fdt);
err = _fdt_splice_string (fdt, len);
if (err)
return err;
memcpy (new, s, len);
return (new - strtab);
}
int
fdt_add_mem_rsv (void *fdt, uint64_t address, uint64_t size)
{
struct fdt_reserve_entry *re;
int err;
FDT_RW_CHECK_HEADER (fdt);
re = _fdt_mem_rsv_w (fdt, fdt_num_mem_rsv (fdt));
err = _fdt_splice_mem_rsv (fdt, re, 0, 1);
if (err)
return err;
re->address = cpu_to_fdt64 (address);
re->size = cpu_to_fdt64 (size);
return 0;
}
int
fdt_del_mem_rsv (void *fdt, int n)
{
struct fdt_reserve_entry *re = _fdt_mem_rsv_w (fdt, n);
int err;
FDT_RW_CHECK_HEADER (fdt);
if (n >= fdt_num_mem_rsv (fdt))
return -FDT_ERR_NOTFOUND;
err = _fdt_splice_mem_rsv (fdt, re, 1, 0);
if (err)
return err;
return 0;
}
static int
_fdt_resize_property (void *fdt, int nodeoffset, const char *name,
int len, struct fdt_property **prop)
{
int oldlen;
int err;
*prop = fdt_get_property_w (fdt, nodeoffset, name, &oldlen);
if (!(*prop))
return oldlen;
if ((err = _fdt_splice_struct (fdt, (*prop)->data, FDT_TAGALIGN (oldlen),
FDT_TAGALIGN (len))))
return err;
(*prop)->len = cpu_to_fdt32 (len);
return 0;
}
static int
_fdt_add_property (void *fdt, int nodeoffset, const char *name,
int len, struct fdt_property **prop)
{
int proplen;
int nextoffset;
int namestroff;
int err;
if ((nextoffset = _fdt_check_node_offset (fdt, nodeoffset)) < 0)
return nextoffset;
namestroff = _fdt_find_add_string (fdt, name);
if (namestroff < 0)
return namestroff;
*prop = _fdt_offset_ptr_w (fdt, nextoffset);
proplen = sizeof (**prop) + FDT_TAGALIGN (len);
err = _fdt_splice_struct (fdt, *prop, 0, proplen);
if (err)
return err;
(*prop)->tag = cpu_to_fdt32 (FDT_PROP);
(*prop)->nameoff = cpu_to_fdt32 (namestroff);
(*prop)->len = cpu_to_fdt32 (len);
return 0;
}
int
fdt_set_name (void *fdt, int nodeoffset, const char *name)
{
char *namep;
int oldlen, newlen;
int err;
FDT_RW_CHECK_HEADER (fdt);
namep = (char *) (uintptr_t) fdt_get_name (fdt, nodeoffset, &oldlen);
if (!namep)
return oldlen;
newlen = strlen (name);
err = _fdt_splice_struct (fdt, namep, FDT_TAGALIGN (oldlen + 1),
FDT_TAGALIGN (newlen + 1));
if (err)
return err;
memcpy (namep, name, newlen + 1);
return 0;
}
int
fdt_setprop (void *fdt, int nodeoffset, const char *name,
const void *val, int len)
{
struct fdt_property *prop;
int err;
FDT_RW_CHECK_HEADER (fdt);
err = _fdt_resize_property (fdt, nodeoffset, name, len, &prop);
if (err == -FDT_ERR_NOTFOUND)
err = _fdt_add_property (fdt, nodeoffset, name, len, &prop);
if (err)
return err;
memcpy (prop->data, val, len);
return 0;
}
int
fdt_delprop (void *fdt, int nodeoffset, const char *name)
{
struct fdt_property *prop;
int len, proplen;
FDT_RW_CHECK_HEADER (fdt);
prop = fdt_get_property_w (fdt, nodeoffset, name, &len);
if (!prop)
return len;
proplen = sizeof (*prop) + FDT_TAGALIGN (len);
return _fdt_splice_struct (fdt, prop, proplen, 0);
}
int
fdt_add_subnode_namelen (void *fdt, int parentoffset,
const char *name, int namelen)
{
struct fdt_node_header *nh;
int offset, nextoffset;
int nodelen;
int err;
uint32_t tag;
uint32_t *endtag;
FDT_RW_CHECK_HEADER (fdt);
offset = fdt_subnode_offset_namelen (fdt, parentoffset, name, namelen);
if (offset >= 0)
return -FDT_ERR_EXISTS;
else if (offset != -FDT_ERR_NOTFOUND)
return offset;
/* Try to place the new node after the parent's properties */
fdt_next_tag (fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */
do
{
offset = nextoffset;
tag = fdt_next_tag (fdt, offset, &nextoffset);
}
while ((tag == FDT_PROP) || (tag == FDT_NOP));
nh = _fdt_offset_ptr_w (fdt, offset);
nodelen = sizeof (*nh) + FDT_TAGALIGN (namelen + 1) + FDT_TAGSIZE;
err = _fdt_splice_struct (fdt, nh, 0, nodelen);
if (err)
return err;
nh->tag = cpu_to_fdt32 (FDT_BEGIN_NODE);
memset (nh->name, 0, FDT_TAGALIGN (namelen + 1));
memcpy (nh->name, name, namelen);
endtag = (uint32_t *) ((char *) nh + nodelen - FDT_TAGSIZE);
*endtag = cpu_to_fdt32 (FDT_END_NODE);
return offset;
}
int
fdt_add_subnode (void *fdt, int parentoffset, const char *name)
{
return fdt_add_subnode_namelen (fdt, parentoffset, name, strlen (name));
}
int
fdt_del_node (void *fdt, int nodeoffset)
{
int endoffset;
FDT_RW_CHECK_HEADER (fdt);
endoffset = _fdt_node_end_offset (fdt, nodeoffset);
if (endoffset < 0)
return endoffset;
return _fdt_splice_struct (fdt, _fdt_offset_ptr_w (fdt, nodeoffset),
endoffset - nodeoffset, 0);
}
static void
_fdt_packblocks (const char *old, char *new,
int mem_rsv_size, int struct_size)
{
int mem_rsv_off, struct_off, strings_off;
mem_rsv_off = FDT_ALIGN (sizeof (struct fdt_header), 8);
struct_off = mem_rsv_off + mem_rsv_size;
strings_off = struct_off + struct_size;
memmove (new + mem_rsv_off, old + fdt_off_mem_rsvmap (old), mem_rsv_size);
fdt_set_off_mem_rsvmap (new, mem_rsv_off);
memmove (new + struct_off, old + fdt_off_dt_struct (old), struct_size);
fdt_set_off_dt_struct (new, struct_off);
fdt_set_size_dt_struct (new, struct_size);
memmove (new + strings_off, old + fdt_off_dt_strings (old),
fdt_size_dt_strings (old));
fdt_set_off_dt_strings (new, strings_off);
fdt_set_size_dt_strings (new, fdt_size_dt_strings (old));
}
int
fdt_open_into (const void *fdt, void *buf, int bufsize)
{
int err;
int mem_rsv_size, struct_size;
int newsize;
const char *fdtstart = fdt;
const char *fdtend = fdtstart + fdt_totalsize (fdt);
char *tmp;
FDT_CHECK_HEADER (fdt);
mem_rsv_size = (fdt_num_mem_rsv (fdt) + 1)
* sizeof (struct fdt_reserve_entry);
if (fdt_version (fdt) >= 17)
{
struct_size = fdt_size_dt_struct (fdt);
}
else
{
struct_size = 0;
while (fdt_next_tag (fdt, struct_size, &struct_size) != FDT_END)
;
if (struct_size < 0)
return struct_size;
}
if (!_fdt_blocks_misordered (fdt, mem_rsv_size, struct_size))
{
/* no further work necessary */
err = fdt_move (fdt, buf, bufsize);
if (err)
return err;
fdt_set_version (buf, 17);
fdt_set_size_dt_struct (buf, struct_size);
fdt_set_totalsize (buf, bufsize);
return 0;
}
/* Need to reorder */
newsize = FDT_ALIGN (sizeof (struct fdt_header), 8) + mem_rsv_size
+ struct_size + fdt_size_dt_strings (fdt);
if (bufsize < newsize)
return -FDT_ERR_NOSPACE;
/* First attempt to build converted tree at beginning of buffer */
tmp = buf;
/* But if that overlaps with the old tree... */
if (((tmp + newsize) > fdtstart) && (tmp < fdtend))
{
/* Try right after the old tree instead */
tmp = (char *) (uintptr_t) fdtend;
if ((tmp + newsize) > ((char *) buf + bufsize))
return -FDT_ERR_NOSPACE;
}
_fdt_packblocks (fdt, tmp, mem_rsv_size, struct_size);
memmove (buf, tmp, newsize);
fdt_set_magic (buf, FDT_MAGIC);
fdt_set_totalsize (buf, bufsize);
fdt_set_version (buf, 17);
fdt_set_last_comp_version (buf, 16);
fdt_set_boot_cpuid_phys (buf, fdt_boot_cpuid_phys (fdt));
return 0;
}
int
fdt_pack (void *fdt)
{
int mem_rsv_size;
FDT_RW_CHECK_HEADER (fdt);
mem_rsv_size = (fdt_num_mem_rsv (fdt) + 1)
* sizeof (struct fdt_reserve_entry);
_fdt_packblocks (fdt, fdt, mem_rsv_size, fdt_size_dt_struct (fdt));
fdt_set_totalsize (fdt, _fdt_data_size (fdt));
return 0;
}

100
grub-core/lib/dtc/libfdt/fdt_strerror.c
View File

@ -1,100 +0,0 @@
/*
* 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"
struct fdt_errtabent
{
const char *str;
};
#define FDT_ERRTABENT(val) \
[(val)] = { .str = #val, }
static struct fdt_errtabent fdt_errtable[] = {
FDT_ERRTABENT (FDT_ERR_NOTFOUND),
FDT_ERRTABENT (FDT_ERR_EXISTS),
FDT_ERRTABENT (FDT_ERR_NOSPACE),
FDT_ERRTABENT (FDT_ERR_BADOFFSET),
FDT_ERRTABENT (FDT_ERR_BADPATH),
FDT_ERRTABENT (FDT_ERR_BADSTATE),
FDT_ERRTABENT (FDT_ERR_TRUNCATED),
FDT_ERRTABENT (FDT_ERR_BADMAGIC),
FDT_ERRTABENT (FDT_ERR_BADVERSION),
FDT_ERRTABENT (FDT_ERR_BADSTRUCTURE),
FDT_ERRTABENT (FDT_ERR_BADLAYOUT),
};
#define FDT_ERRTABSIZE (sizeof(fdt_errtable) / sizeof(fdt_errtable[0]))
const char *
fdt_strerror (int errval)
{
if (errval > 0)
return "<valid offset/length>";
else if (errval == 0)
return "<no error>";
else if (errval > -FDT_ERRTABSIZE)
{
const char *s = fdt_errtable[-errval].str;
if (s)
return s;
}
return "<unknown error>";
}

267
grub-core/lib/dtc/libfdt/fdt_sw.c
View File

@ -1,267 +0,0 @@
/*
* 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"
static int
_fdt_sw_check_header (void *fdt)
{
if (fdt_magic (fdt) != FDT_SW_MAGIC)
return -FDT_ERR_BADMAGIC;
/* FIXME: should check more details about the header state */
return 0;
}
#define FDT_SW_CHECK_HEADER(fdt) \
{ \
int err; \
if ((err = _fdt_sw_check_header(fdt)) != 0) \
return err; \
}
static void *
_fdt_grab_space (void *fdt, size_t len)
{
int offset = fdt_size_dt_struct (fdt);
int spaceleft;
spaceleft = fdt_totalsize (fdt) - fdt_off_dt_struct (fdt)
- fdt_size_dt_strings (fdt);
if ((offset + len < offset) || (offset + len > spaceleft))
return NULL;
fdt_set_size_dt_struct (fdt, offset + len);
return _fdt_offset_ptr_w (fdt, offset);
}
int
fdt_create (void *buf, int bufsize)
{
void *fdt = buf;
if (bufsize < sizeof (struct fdt_header))
return -FDT_ERR_NOSPACE;
memset (buf, 0, bufsize);
fdt_set_magic (fdt, FDT_SW_MAGIC);
fdt_set_version (fdt, FDT_LAST_SUPPORTED_VERSION);
fdt_set_last_comp_version (fdt, FDT_FIRST_SUPPORTED_VERSION);
fdt_set_totalsize (fdt, bufsize);
fdt_set_off_mem_rsvmap (fdt, FDT_ALIGN (sizeof (struct fdt_header),
sizeof (struct fdt_reserve_entry)));
fdt_set_off_dt_struct (fdt, fdt_off_mem_rsvmap (fdt));
fdt_set_off_dt_strings (fdt, bufsize);
return 0;
}
int
fdt_add_reservemap_entry (void *fdt, uint64_t addr, uint64_t size)
{
struct fdt_reserve_entry *re;
int offset;
FDT_SW_CHECK_HEADER (fdt);
if (fdt_size_dt_struct (fdt))
return -FDT_ERR_BADSTATE;
offset = fdt_off_dt_struct (fdt);
if ((offset + sizeof (*re)) > fdt_totalsize (fdt))
return -FDT_ERR_NOSPACE;
re = (struct fdt_reserve_entry *) ((char *) fdt + offset);
re->address = cpu_to_fdt64 (addr);
re->size = cpu_to_fdt64 (size);
fdt_set_off_dt_struct (fdt, offset + sizeof (*re));
return 0;
}
int
fdt_finish_reservemap (void *fdt)
{
return fdt_add_reservemap_entry (fdt, 0, 0);
}
int
fdt_begin_node (void *fdt, const char *name)
{
struct fdt_node_header *nh;
int namelen = strlen (name) + 1;
FDT_SW_CHECK_HEADER (fdt);
nh = _fdt_grab_space (fdt, sizeof (*nh) + FDT_TAGALIGN (namelen));
if (!nh)
return -FDT_ERR_NOSPACE;
nh->tag = cpu_to_fdt32 (FDT_BEGIN_NODE);
memcpy (nh->name, name, namelen);
return 0;
}
int
fdt_end_node (void *fdt)
{
uint32_t *en;
FDT_SW_CHECK_HEADER (fdt);
en = _fdt_grab_space (fdt, FDT_TAGSIZE);
if (!en)
return -FDT_ERR_NOSPACE;
*en = cpu_to_fdt32 (FDT_END_NODE);
return 0;
}
static int
_fdt_find_add_string (void *fdt, const char *s)
{
char *strtab = (char *) fdt + fdt_totalsize (fdt);
const char *p;
int strtabsize = fdt_size_dt_strings (fdt);
int len = strlen (s) + 1;
int struct_top, offset;
p = _fdt_find_string (strtab - strtabsize, strtabsize, s);
if (p)
return p - strtab;
/* Add it */
offset = -strtabsize - len;
struct_top = fdt_off_dt_struct (fdt) + fdt_size_dt_struct (fdt);
if (fdt_totalsize (fdt) + offset < struct_top)
return 0; /* no more room */
memcpy (strtab + offset, s, len);
fdt_set_size_dt_strings (fdt, strtabsize + len);
return offset;
}
int
fdt_property (void *fdt, const char *name, const void *val, int len)
{
struct fdt_property *prop;
int nameoff;
FDT_SW_CHECK_HEADER (fdt);
nameoff = _fdt_find_add_string (fdt, name);
if (nameoff == 0)
return -FDT_ERR_NOSPACE;
prop = _fdt_grab_space (fdt, sizeof (*prop) + FDT_TAGALIGN (len));
if (!prop)
return -FDT_ERR_NOSPACE;
prop->tag = cpu_to_fdt32 (FDT_PROP);
prop->nameoff = cpu_to_fdt32 (nameoff);
prop->len = cpu_to_fdt32 (len);
memcpy (prop->data, val, len);
return 0;
}
int
fdt_finish (void *fdt)
{
char *p = (char *) fdt;
uint32_t *end;
int oldstroffset, newstroffset;
uint32_t tag;
int offset, nextoffset;
FDT_SW_CHECK_HEADER (fdt);
/* Add terminator */
end = _fdt_grab_space (fdt, sizeof (*end));
if (!end)
return -FDT_ERR_NOSPACE;
*end = cpu_to_fdt32 (FDT_END);
/* Relocate the string table */
oldstroffset = fdt_totalsize (fdt) - fdt_size_dt_strings (fdt);
newstroffset = fdt_off_dt_struct (fdt) + fdt_size_dt_struct (fdt);
memmove (p + newstroffset, p + oldstroffset, fdt_size_dt_strings (fdt));
fdt_set_off_dt_strings (fdt, newstroffset);
/* Walk the structure, correcting string offsets */
offset = 0;
while ((tag = fdt_next_tag (fdt, offset, &nextoffset)) != FDT_END)
{
if (tag == FDT_PROP)
{
struct fdt_property *prop = _fdt_offset_ptr_w (fdt, offset);
int nameoff;
nameoff = fdt32_to_cpu (prop->nameoff);
nameoff += fdt_size_dt_strings (fdt);
prop->nameoff = cpu_to_fdt32 (nameoff);
}
offset = nextoffset;
}
if (nextoffset < 0)
return nextoffset;
/* Finally, adjust the header */
fdt_set_totalsize (fdt, newstroffset + fdt_size_dt_strings (fdt));
fdt_set_magic (fdt, FDT_MAGIC);
return 0;
}

123
grub-core/lib/dtc/libfdt/fdt_wip.c
View File

@ -1,123 +0,0 @@
/*
* 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"
int
fdt_setprop_inplace (void *fdt, int nodeoffset, const char *name,
const void *val, int len)
{
void *propval;
int proplen;
propval = fdt_getprop_w (fdt, nodeoffset, name, &proplen);
if (!propval)
return proplen;
if (proplen != len)
return -FDT_ERR_NOSPACE;
memcpy (propval, val, len);
return 0;
}
static void
_fdt_nop_region (void *start, int len)
{
uint32_t *p;
for (p = start; (char *) p < ((char *) start + len); p++)
*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);
if (!prop)
return len;
_fdt_nop_region (prop, len + sizeof (*prop));
return 0;
}
int
_fdt_node_end_offset (void *fdt, int offset)
{
int depth = 0;
while ((offset >= 0) && (depth >= 0))
offset = fdt_next_node (fdt, offset, &depth);
return offset;
}
int
fdt_nop_node (void *fdt, int nodeoffset)
{
int endoffset;
endoffset = _fdt_node_end_offset (fdt, nodeoffset);
if (endoffset < 0)
return endoffset;
_fdt_nop_region (fdt_offset_ptr_w (fdt, nodeoffset, 0),
endoffset - nodeoffset);
return 0;
}

1239
grub-core/lib/dtc/libfdt/libfdt.h
View File

File diff suppressed because it is too large Load Diff

27
grub-core/lib/dtc/libfdt/libfdt_env.h
View File

@ -1,27 +0,0 @@
#ifndef _LIBFDT_ENV_H
#define _LIBFDT_ENV_H
#include <stddef.h>
#include <stdint.h>
#include <string.h>
#define _B(n) ((unsigned long long)((uint8_t *)&x)[n])
static inline uint32_t
fdt32_to_cpu (uint32_t x)
{
return (_B (0) << 24) | (_B (1) << 16) | (_B (2) << 8) | _B (3);
}
#define cpu_to_fdt32(x) fdt32_to_cpu(x)
static inline uint64_t
fdt64_to_cpu (uint64_t x)
{
return (_B (0) << 56) | (_B (1) << 48) | (_B (2) << 40) | (_B (3) << 32)
| (_B (4) << 24) | (_B (5) << 16) | (_B (6) << 8) | _B (7);
}
#define cpu_to_fdt64(x) fdt64_to_cpu(x)
#undef _B
#endif /* _LIBFDT_ENV_H */

100
grub-core/lib/dtc/libfdt/libfdt_internal.h
View File

@ -1,100 +0,0 @@
#ifndef _LIBFDT_INTERNAL_H
#define _LIBFDT_INTERNAL_H
/*
* 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 <fdt.h>
#define FDT_ALIGN(x, a) (((x) + (a) - 1) & ~((a) - 1))
#define FDT_TAGALIGN(x) (FDT_ALIGN((x), FDT_TAGSIZE))
#define FDT_CHECK_HEADER(fdt) \
{ \
int err; \
if ((err = fdt_check_header(fdt)) != 0) \
return err; \
}
int _fdt_check_node_offset (const void *fdt, int offset);
int _fdt_check_prop_offset (const void *fdt, int offset);
const char *_fdt_find_string (const char *strtab, int tabsize, const char *s);
int _fdt_node_end_offset (void *fdt, int nodeoffset);
static inline const void *
_fdt_offset_ptr (const void *fdt, int offset)
{
return (const char *) fdt + fdt_off_dt_struct (fdt) + offset;
}
static inline void *
_fdt_offset_ptr_w (void *fdt, int offset)
{
return (void *) (uintptr_t) _fdt_offset_ptr (fdt, offset);
}
static inline const struct fdt_reserve_entry *
_fdt_mem_rsv (const void *fdt, int n)
{
const struct fdt_reserve_entry *rsv_table =
(const struct fdt_reserve_entry *)
((const char *) fdt + fdt_off_mem_rsvmap (fdt));
return rsv_table + n;
}
static inline struct fdt_reserve_entry *
_fdt_mem_rsv_w (void *fdt, int n)
{
return (void *) (uintptr_t) _fdt_mem_rsv (fdt, n);
}
#define FDT_SW_MAGIC (~FDT_MAGIC)
#endif /* _LIBFDT_INTERNAL_H */

54
grub-core/lib/dtc/libfdt/version.lds
View File

@ -1,54 +0,0 @@
LIBFDT_1.2 {
global:
fdt_next_node;
fdt_check_header;
fdt_move;
fdt_string;
fdt_num_mem_rsv;
fdt_get_mem_rsv;
fdt_subnode_offset_namelen;
fdt_subnode_offset;
fdt_path_offset;
fdt_get_name;
fdt_get_property_namelen;
fdt_get_property;
fdt_getprop_namelen;
fdt_getprop;
fdt_get_phandle;
fdt_get_alias_namelen;
fdt_get_alias;
fdt_get_path;
fdt_supernode_atdepth_offset;
fdt_node_depth;
fdt_parent_offset;
fdt_node_offset_by_prop_value;
fdt_node_offset_by_phandle;
fdt_node_check_compatible;
fdt_node_offset_by_compatible;
fdt_setprop_inplace;
fdt_nop_property;
fdt_nop_node;
fdt_create;
fdt_add_reservemap_entry;
fdt_finish_reservemap;
fdt_begin_node;
fdt_property;
fdt_end_node;
fdt_finish;
fdt_open_into;
fdt_pack;
fdt_add_mem_rsv;
fdt_del_mem_rsv;
fdt_set_name;
fdt_setprop;
fdt_delprop;
fdt_add_subnode_namelen;
fdt_add_subnode;
fdt_del_node;
fdt_strerror;
fdt_offset_ptr;
fdt_next_tag;
local:
*;
};

103
util/import_libfdt.py
View File

@ -1,103 +0,0 @@
#*
#* GRUB -- GRand Unified Bootloader
#* Copyright (C) 2013 Free Software Foundation, Inc.
#*
#* GRUB 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 3 of the License, or
#* (at your option) any later version.
#*
#* GRUB 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 GRUB. If not, see <http://www.gnu.org/licenses/>.
#*
import re
import sys
import os
import codecs
import datetime
if len (sys.argv) < 3:
print ("Usage: %s SOURCE DESTINATION" % sys.argv[0])
exit (0)
dtcdir = sys.argv[1]
indir = os.path.join (dtcdir, "libfdt/")
outdir = os.path.join (sys.argv[2], "lib/dtc-grub/libfdt/")
try:
os.makedirs (outdir)
except:
print ("WARNING: %s already exists" % outdir)
conf = codecs.open (os.path.join ("grub-core/", "Makefile.libfdt.def"), "w", "utf-8")
conf.write ("AutoGen definitions Makefile.tpl;\n\n")
conf.write ("module = {\n")
conf.write (" name = fdt;\n")
conf.write (" common = lib/dtc-grub/libfdt/fdt.c;\n")
conf.write (" common = lib/dtc-grub/libfdt/fdt_ro.c;\n")
conf.write (" common = lib/dtc-grub/libfdt/fdt_rw.c;\n")
conf.write (" common = lib/dtc-grub/libfdt/fdt_strerror.c;\n")
conf.write (" common = lib/dtc-grub/libfdt/fdt_sw.c;\n")
conf.write (" common = lib/dtc-grub/libfdt/fdt_wip.c;\n")
conf.write (" cppflags = '$(CPPFLAGS_POSIX) $(CPPFLAGS_LIBFDT)';\n")
conf.write ("\n")
conf.write (" enable = fdt;\n")
conf.write ("};\n")
conf.close ();
libfdt_files = sorted (os.listdir (indir))
chlog = ""
for libfdt_file in libfdt_files:
infile = os.path.join (indir, (libfdt_file))
outfile = os.path.join (outdir, (libfdt_file))
if not re.match (".*\.[ch]$", libfdt_file):
chlog = "%s * %s: Removed\n" % (chlog, libfdt_file)
continue
# print ("file: %s, infile: %s, outfile: %s" % (libfdt_file, infile, outfile))
f = codecs.open (infile, "r", "utf-8")
fw = codecs.open (outfile, "w", "utf-8")
lineno = 1
fw.write ("/* This file was automatically imported with \n")
fw.write (" import_libfdt.py. Please don't modify it */\n")
fw.write ("#include <grub/dl.h>\n")
# libfdt is dual-licensed: BSD or GPLv2+
if re.match (".*\.c$", libfdt_file):
fw.write ("GRUB_MOD_LICENSE (\"GPLv2+\");\n")
lines = f.readlines()
for line in lines:
fw.write (line)
f.close ()
fw.close ()
patchfile = os.path.join (dtcdir, "libfdt-grub.diff")
#print "Patchfile: %s\n" % patchfile
ret = os.system("patch -d %s -p1 < %s" % (outdir, patchfile))
if ret:
chlog = "%s * Applied Grub build patch\n" % chlog
dt = datetime.date.today ()
fw = codecs.open (os.path.join (outdir, "ImportLog"), "w", "utf-8")
fw.write ("%04d-%02d-%02d Automatic import tool\n" % \
(dt.year,dt.month, dt.day))
fw.write ("\n")
fw.write (" Imported libfdt to GRUB\n")
fw.write ("\n")
fw.write (chlog)
fw.close ()