[POWERPC] Merge libfdt upstream source

# 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))

/*

 * 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;

}

#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 */

/*

 * 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"

#define CHECK_HEADER(fdt) \

	{ \

		int err; \

		if ((err = fdt_check_header(fdt)) != 0) \

			return err; \

	}

static int nodename_eq(const void *fdt, int offset,

		       const char *s, int len)

{

	const char *p = fdt_offset_ptr(fdt, offset, 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 (char *)fdt + fdt_off_dt_strings(fdt) + stroffset;

}

int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)

{

	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;

}

int fdt_subnode_offset_namelen(const void *fdt, int parentoffset,

			       const char *name, int namelen)

{

	int level = 0;

	uint32_t tag;

	int offset, nextoffset;

	CHECK_HEADER(fdt);

	tag = fdt_next_tag(fdt, parentoffset, &nextoffset);

	if (tag != FDT_BEGIN_NODE)

		return -FDT_ERR_BADOFFSET;

	do {

		offset = nextoffset;

		tag = fdt_next_tag(fdt, offset, &nextoffset);

		switch (tag) {

		case FDT_END:

			return -FDT_ERR_TRUNCATED;

		case FDT_BEGIN_NODE:

			level++;

			if (level != 1)

				continue;

			if (nodename_eq(fdt, offset+FDT_TAGSIZE, name, namelen))

				/* Found it! */

				return offset;

			break;

		case FDT_END_NODE:

			level--;

			break;

		case FDT_PROP:

		case FDT_NOP:

			break;

		default:

			return -FDT_ERR_BADSTRUCTURE;

		}

	} while (level >= 0);

	return -FDT_ERR_NOTFOUND;

}

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;

	CHECK_HEADER(fdt);

	if (*path != '/')

		return -FDT_ERR_BADPATH;

	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;

	int err;

	if ((err = fdt_check_header(fdt)) != 0)

		goto fail;

	err = -FDT_ERR_BADOFFSET;

	nh = fdt_offset_ptr(fdt, nodeoffset, sizeof(*nh));

	if (!nh || (fdt32_to_cpu(nh->tag) != FDT_BEGIN_NODE))

		goto fail;

	if (len)

		*len = strlen(nh->name);

	return nh->name;

 fail:

	if (len)

		*len = err;

	return NULL;

}

const struct fdt_property *fdt_get_property(const void *fdt,

					    int nodeoffset,

					    const char *name, int *lenp)

{

	uint32_t tag;

	const struct fdt_property *prop;

	int namestroff;

	int offset, nextoffset;

	int err;

	if ((err = fdt_check_header(fdt)) != 0)

		goto fail;

	err = -FDT_ERR_BADOFFSET;

	if (nodeoffset % FDT_TAGSIZE)

		goto fail;

	tag = fdt_next_tag(fdt, nodeoffset, &nextoffset);

	if (tag != FDT_BEGIN_NODE)

		goto fail;

	do {

		offset = nextoffset;

		tag = fdt_next_tag(fdt, offset, &nextoffset);

		switch (tag) {

		case FDT_END:

			err = -FDT_ERR_TRUNCATED;

			goto fail;

		case FDT_BEGIN_NODE:

		case FDT_END_NODE:

		case FDT_NOP:

			break;

		case FDT_PROP:

			err = -FDT_ERR_BADSTRUCTURE;

			prop = fdt_offset_ptr(fdt, offset, sizeof(*prop));

			if (! prop)

				goto fail;

			namestroff = fdt32_to_cpu(prop->nameoff);

			if (streq(fdt_string(fdt, namestroff), name)) {

				/* Found it! */

				int len = fdt32_to_cpu(prop->len);

				prop = fdt_offset_ptr(fdt, offset,

						      sizeof(*prop)+len);

				if (! prop)

					goto fail;

				if (lenp)

					*lenp = len;

				return prop;

			}

			break;

		default:

			err = -FDT_ERR_BADSTRUCTURE;

			goto fail;

		}

	} while ((tag != FDT_BEGIN_NODE) && (tag != FDT_END_NODE));

	err = -FDT_ERR_NOTFOUND;

 fail:

	if (lenp)

		*lenp = err;

	return NULL;

}

const void *fdt_getprop(const void *fdt, int nodeoffset,

		  const char *name, int *lenp)

{

	const struct fdt_property *prop;

	prop = fdt_get_property(fdt, nodeoffset, name, lenp);

	if (! prop)

		return NULL;

	return prop->data;

}

uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)

{

	const uint32_t *php;

	int len;

	php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);

	if (!php || (len != sizeof(*php)))

		return 0;

	return fdt32_to_cpu(*php);

}

int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)

{

	uint32_t tag;

	int p = 0, overflow = 0;

	int offset, nextoffset, namelen;

	const char *name;

	CHECK_HEADER(fdt);

	tag = fdt_next_tag(fdt, 0, &nextoffset);

	if (tag != FDT_BEGIN_NODE)

		return -FDT_ERR_BADSTRUCTURE;

	if (buflen < 2)

		return -FDT_ERR_NOSPACE;

	buf[0] = '/';

	p = 1;

	while (nextoffset <= nodeoffset) {

		offset = nextoffset;

		tag = fdt_next_tag(fdt, offset, &nextoffset);

		switch (tag) {

		case FDT_END:

			return -FDT_ERR_BADOFFSET;

		case FDT_BEGIN_NODE:

			name = fdt_get_name(fdt, offset, &namelen);

			if (!name)

				return namelen;

			if (overflow || ((p + namelen + 1) > buflen)) {

				overflow++;

				break;

			}

			memcpy(buf + p, name, namelen);

			p += namelen;

			buf[p++] = '/';

			break;

		case FDT_END_NODE:

			if (overflow) {

				overflow--;

				break;

			}

			do {

				p--;

			} while  (buf[p-1] != '/');

			break;

		case FDT_PROP:

		case FDT_NOP:

			break;

		default:

			return -FDT_ERR_BADSTRUCTURE;

		}

	}

	if (overflow)

		return -FDT_ERR_NOSPACE;

	if (p > 1) /* special case so that root path is "/", not "" */

		p--;

	buf[p] = '\0';

	return p;

}

int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,

				 int supernodedepth, int *nodedepth)

{

	int level = -1;

	uint32_t tag;

	int offset, nextoffset = 0;

	int supernodeoffset = -FDT_ERR_INTERNAL;

	CHECK_HEADER(fdt);

	if (supernodedepth < 0)

		return -FDT_ERR_NOTFOUND;

	do {

		offset = nextoffset;

		tag = fdt_next_tag(fdt, offset, &nextoffset);

		switch (tag) {

		case FDT_END:

			return -FDT_ERR_BADOFFSET;

		case FDT_BEGIN_NODE:

			level++;

			if (level == supernodedepth)

				supernodeoffset = offset;

			break;

		case FDT_END_NODE:

			level--;

			break;

		case FDT_PROP:

		case FDT_NOP:

			break;

		default:

			return -FDT_ERR_BADSTRUCTURE;

		}

	} while (offset < nodeoffset);

	if (nodedepth)

		*nodedepth = level;

	if (supernodedepth > level)

		return -FDT_ERR_NOTFOUND;

	return supernodeoffset;

}

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)

{

	uint32_t tag;

	int offset, nextoffset;

	const void *val;

	int len;

	CHECK_HEADER(fdt);

	if (startoffset >= 0) {

		tag = fdt_next_tag(fdt, startoffset, &nextoffset);

		if (tag != FDT_BEGIN_NODE)

			return -FDT_ERR_BADOFFSET;

	} else {

		nextoffset = 0;

	}

	/* 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. */

	do {

		offset = nextoffset;

		tag = fdt_next_tag(fdt, offset, &nextoffset);

		switch (tag) {

		case FDT_BEGIN_NODE:

			val = fdt_getprop(fdt, offset, propname, &len);

			if (val

			    && (len == proplen)

			    && (memcmp(val, propval, len) == 0))

				return offset;

			break;

		case FDT_PROP:

		case FDT_END:

		case FDT_END_NODE:

		case FDT_NOP:

			break;

		default:

			return -FDT_ERR_BADSTRUCTURE;

		}

	} while (tag != FDT_END);

	return -FDT_ERR_NOTFOUND;

}

int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)

{

	if ((phandle == 0) || (phandle == -1))

		return -FDT_ERR_BADPHANDLE;

	phandle = cpu_to_fdt32(phandle);

	return fdt_node_offset_by_prop_value(fdt, -1, "linux,phandle",

					     &phandle, sizeof(phandle));

}

int _stringlist_contains(const void *strlist, int listlen, const char *str)

{

	int len = strlen(str);

	const void *p;

	while (listlen >= len) {

		if (memcmp(str, strlist, len+1) == 0)

			return 1;