-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[POWERPC] Merge libfdt upstream source
This incorporates a copy of dtc libfdt into the kernel source, in arch/powerpc/boot/libfdt. This only imports the upstream sources verbatim, later patches are needed to actually link it into the kernel Makefiles. Signed-off-by: David Gibson <david@gibson.dropbear.id.au> Signed-off-by: Paul Mackerras <paulus@samba.org>
- Loading branch information
David Gibson
authored and
Paul Mackerras
committed
Dec 11, 2007
1 parent
b76e5e9
commit 1cade99
Showing
10 changed files
with
2,568 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,14 @@ | ||
# Makefile.libfdt | ||
# | ||
# This is not a complete Makefile of itself. Instead, it is designed to | ||
# be easily embeddable into other systems of Makefiles. | ||
# | ||
LIBFDT_SRCS = fdt.c fdt_ro.c fdt_wip.c fdt_sw.c fdt_rw.c fdt_strerror.c | ||
LIBFDT_INCLUDES = fdt.h libfdt.h | ||
LIBFDT_EXTRA = libfdt_internal.h | ||
LIBFDT_LIB = libfdt/libfdt.a | ||
|
||
LIBFDT_OBJS = $(LIBFDT_SRCS:%.c=%.o) | ||
|
||
$(LIBFDT_objdir)/$(LIBFDT_LIB): $(addprefix $(LIBFDT_objdir)/,$(LIBFDT_OBJS)) | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,156 @@ | ||
/* | ||
* 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) == 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, int len) | ||
{ | ||
const void *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 offset, int *nextoffset) | ||
{ | ||
const uint32_t *tagp, *lenp; | ||
uint32_t tag; | ||
const char *p; | ||
|
||
if (offset % FDT_TAGSIZE) | ||
return -1; | ||
|
||
tagp = fdt_offset_ptr(fdt, offset, FDT_TAGSIZE); | ||
if (! tagp) | ||
return FDT_END; /* premature end */ | ||
tag = fdt32_to_cpu(*tagp); | ||
offset += FDT_TAGSIZE; | ||
|
||
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; | ||
break; | ||
case FDT_PROP: | ||
lenp = fdt_offset_ptr(fdt, offset, sizeof(*lenp)); | ||
if (! lenp) | ||
return FDT_END; | ||
/* skip name offset, length and value */ | ||
offset += 2*FDT_TAGSIZE + fdt32_to_cpu(*lenp); | ||
break; | ||
} | ||
|
||
if (nextoffset) | ||
*nextoffset = ALIGN(offset, FDT_TAGSIZE); | ||
|
||
return tag; | ||
} | ||
|
||
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 (memeq(p, s, len)) | ||
return p; | ||
return NULL; | ||
} | ||
|
||
int fdt_move(const void *fdt, void *buf, int bufsize) | ||
{ | ||
int err = fdt_check_header(fdt); | ||
|
||
if (err) | ||
return err; | ||
|
||
if (fdt_totalsize(fdt) > bufsize) | ||
return -FDT_ERR_NOSPACE; | ||
|
||
memmove(buf, fdt, fdt_totalsize(fdt)); | ||
return 0; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,60 @@ | ||
#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 */ |
Oops, something went wrong.