// SPDX-License-Identifier: GPL-2.0-or-later

/*

 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation.  2007.

 */

#include "dtc.h"

#include "srcpos.h"

#ifdef TRACE_CHECKS

#define TRACE(c, ...) \

	do { \

		fprintf(stderr, "=== %s: ", (c)->name); \

		fprintf(stderr, __VA_ARGS__); \

		fprintf(stderr, "\n"); \

	} while (0)

#else

#define TRACE(c, fmt, ...)	do { } while (0)

#endif

enum checkstatus {

	UNCHECKED = 0,

	PREREQ,

	PASSED,

	FAILED,

};

struct check;

typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);

struct check {

	const char *name;

	check_fn fn;

	void *data;

	bool warn, error;

	enum checkstatus status;

	bool inprogress;

	int num_prereqs;

	struct check **prereq;

};

#define CHECK_ENTRY(nm_, fn_, d_, w_, e_, ...)	       \

	static struct check *nm_##_prereqs[] = { __VA_ARGS__ }; \

	static struct check nm_ = { \

		.name = #nm_, \

		.fn = (fn_), \

		.data = (d_), \

		.warn = (w_), \

		.error = (e_), \

		.status = UNCHECKED, \

		.num_prereqs = ARRAY_SIZE(nm_##_prereqs), \

		.prereq = nm_##_prereqs, \

	};

#define WARNING(nm_, fn_, d_, ...) \

	CHECK_ENTRY(nm_, fn_, d_, true, false, __VA_ARGS__)

#define ERROR(nm_, fn_, d_, ...) \

	CHECK_ENTRY(nm_, fn_, d_, false, true, __VA_ARGS__)

#define CHECK(nm_, fn_, d_, ...) \

	CHECK_ENTRY(nm_, fn_, d_, false, false, __VA_ARGS__)

static inline void  PRINTF(5, 6) check_msg(struct check *c, struct dt_info *dti,

					   struct node *node,

					   struct property *prop,

					   const char *fmt, ...)

{

	va_list ap;

	char *str = NULL;

	struct srcpos *pos = NULL;

	char *file_str;

	if (!(c->warn && (quiet < 1)) && !(c->error && (quiet < 2)))

		return;

	if (prop && prop->srcpos)

		pos = prop->srcpos;

	else if (node && node->srcpos)

		pos = node->srcpos;

	if (pos) {

		file_str = srcpos_string(pos);

		xasprintf(&str, "%s", file_str);

		free(file_str);

	} else if (streq(dti->outname, "-")) {

		xasprintf(&str, "<stdout>");

	} else {

		xasprintf(&str, "%s", dti->outname);

	}

	xasprintf_append(&str, ": %s (%s): ",

			(c->error) ? "ERROR" : "Warning", c->name);

	if (node) {

		if (prop)

			xasprintf_append(&str, "%s:%s: ", node->fullpath, prop->name);

		else

			xasprintf_append(&str, "%s: ", node->fullpath);

	}

	va_start(ap, fmt);

	xavsprintf_append(&str, fmt, ap);

	va_end(ap);

	xasprintf_append(&str, "\n");

	if (!prop && pos) {

		pos = node->srcpos;

		while (pos->next) {

			pos = pos->next;

			file_str = srcpos_string(pos);

			xasprintf_append(&str, "  also defined at %s\n", file_str);

			free(file_str);

		}

	}

	fputs(str, stderr);

}

#define FAIL(c, dti, node, ...)						\

	do {								\

		TRACE((c), "\t\tFAILED at %s:%d", __FILE__, __LINE__);	\

		(c)->status = FAILED;					\

		check_msg((c), dti, node, NULL, __VA_ARGS__);		\

	} while (0)

#define FAIL_PROP(c, dti, node, prop, ...)				\

	do {								\

		TRACE((c), "\t\tFAILED at %s:%d", __FILE__, __LINE__);	\

		(c)->status = FAILED;					\

		check_msg((c), dti, node, prop, __VA_ARGS__);		\

	} while (0)

static void check_nodes_props(struct check *c, struct dt_info *dti, struct node *node)

{

	struct node *child;

	TRACE(c, "%s", node->fullpath);

	if (c->fn)

		c->fn(c, dti, node);

	for_each_child(node, child)

		check_nodes_props(c, dti, child);

}

static bool run_check(struct check *c, struct dt_info *dti)

{

	struct node *dt = dti->dt;

	bool error = false;

	int i;

	assert(!c->inprogress);

	if (c->status != UNCHECKED)

		goto out;

	c->inprogress = true;

	for (i = 0; i < c->num_prereqs; i++) {

		struct check *prq = c->prereq[i];

		error = error || run_check(prq, dti);

		if (prq->status != PASSED) {

			c->status = PREREQ;

			check_msg(c, dti, NULL, NULL, "Failed prerequisite '%s'",

				  c->prereq[i]->name);

		}

	}

	if (c->status != UNCHECKED)

		goto out;

	check_nodes_props(c, dti, dt);

	if (c->status == UNCHECKED)

		c->status = PASSED;

	TRACE(c, "\tCompleted, status %d", c->status);

out:

	c->inprogress = false;

	if ((c->status != PASSED) && (c->error))

		error = true;

	return error;

}

/*

 * Utility check functions

 */

/* A check which always fails, for testing purposes only */

static inline void check_always_fail(struct check *c, struct dt_info *dti,

				     struct node *node)

{

	FAIL(c, dti, node, "always_fail check");

}

CHECK(always_fail, check_always_fail, NULL);

static void check_is_string(struct check *c, struct dt_info *dti,

			    struct node *node)

{

	struct property *prop;

	char *propname = c->data;

	prop = get_property(node, propname);

	if (!prop)

		return; /* Not present, assumed ok */

	if (!data_is_one_string(prop->val))

		FAIL_PROP(c, dti, node, prop, "property is not a string");

}

#define WARNING_IF_NOT_STRING(nm, propname) \

	WARNING(nm, check_is_string, (propname))

#define ERROR_IF_NOT_STRING(nm, propname) \

	ERROR(nm, check_is_string, (propname))

static void check_is_string_list(struct check *c, struct dt_info *dti,

				 struct node *node)

{

	int rem, l;

	struct property *prop;

	char *propname = c->data;

	char *str;

	prop = get_property(node, propname);

	if (!prop)

		return; /* Not present, assumed ok */

	str = prop->val.val;

	rem = prop->val.len;

	while (rem > 0) {

		l = strnlen(str, rem);

		if (l == rem) {

			FAIL_PROP(c, dti, node, prop, "property is not a string list");

			break;

		}

		rem -= l + 1;

		str += l + 1;

	}

}

#define WARNING_IF_NOT_STRING_LIST(nm, propname) \

	WARNING(nm, check_is_string_list, (propname))

#define ERROR_IF_NOT_STRING_LIST(nm, propname) \

	ERROR(nm, check_is_string_list, (propname))

static void check_is_cell(struct check *c, struct dt_info *dti,

			  struct node *node)

{

	struct property *prop;

	char *propname = c->data;

	prop = get_property(node, propname);

	if (!prop)

		return; /* Not present, assumed ok */

	if (prop->val.len != sizeof(cell_t))

		FAIL_PROP(c, dti, node, prop, "property is not a single cell");

}

#define WARNING_IF_NOT_CELL(nm, propname) \

	WARNING(nm, check_is_cell, (propname))

#define ERROR_IF_NOT_CELL(nm, propname) \

	ERROR(nm, check_is_cell, (propname))

/*

 * Structural check functions

 */

static void check_duplicate_node_names(struct check *c, struct dt_info *dti,

				       struct node *node)

{

	struct node *child, *child2;

	for_each_child(node, child)

		for (child2 = child->next_sibling;

		     child2;

		     child2 = child2->next_sibling)

			if (streq(child->name, child2->name))

				FAIL(c, dti, child2, "Duplicate node name");

}

ERROR(duplicate_node_names, check_duplicate_node_names, NULL);

static void check_duplicate_property_names(struct check *c, struct dt_info *dti,

					   struct node *node)

{

	struct property *prop, *prop2;

	for_each_property(node, prop) {

		for (prop2 = prop->next; prop2; prop2 = prop2->next) {

			if (prop2->deleted)

				continue;

			if (streq(prop->name, prop2->name))

				FAIL_PROP(c, dti, node, prop, "Duplicate property name");

		}

	}

}

ERROR(duplicate_property_names, check_duplicate_property_names, NULL);

#define LOWERCASE	"abcdefghijklmnopqrstuvwxyz"

#define UPPERCASE	"ABCDEFGHIJKLMNOPQRSTUVWXYZ"

#define DIGITS		"0123456789"

#define PROPNODECHARS	LOWERCASE UPPERCASE DIGITS ",._+*#?-"

#define PROPNODECHARSSTRICT	LOWERCASE UPPERCASE DIGITS ",-"

static void check_node_name_chars(struct check *c, struct dt_info *dti,

				  struct node *node)

{

	int n = strspn(node->name, c->data);

	if (n < strlen(node->name))

		FAIL(c, dti, node, "Bad character '%c' in node name",

		     node->name[n]);

}

ERROR(node_name_chars, check_node_name_chars, PROPNODECHARS "@");

static void check_node_name_chars_strict(struct check *c, struct dt_info *dti,

					 struct node *node)

{

	int n = strspn(node->name, c->data);

	if (n < node->basenamelen)

		FAIL(c, dti, node, "Character '%c' not recommended in node name",

		     node->name[n]);

}

CHECK(node_name_chars_strict, check_node_name_chars_strict, PROPNODECHARSSTRICT);

static void check_node_name_format(struct check *c, struct dt_info *dti,

				   struct node *node)

{

	if (strchr(get_unitname(node), '@'))

		FAIL(c, dti, node, "multiple '@' characters in node name");

}

ERROR(node_name_format, check_node_name_format, NULL, &node_name_chars);

static void check_unit_address_vs_reg(struct check *c, struct dt_info *dti,

				      struct node *node)

{

	const char *unitname = get_unitname(node);

	struct property *prop = get_property(node, "reg");

	if (get_subnode(node, "__overlay__")) {

		/* HACK: Overlay fragments are a special case */

		return;

	}

	if (!prop) {

		prop = get_property(node, "ranges");

		if (prop && !prop->val.len)

			prop = NULL;

	}

	if (prop) {

		if (!unitname[0])

			FAIL(c, dti, node, "node has a reg or ranges property, but no unit name");

	} else {

		if (unitname[0])

			FAIL(c, dti, node, "node has a unit name, but no reg property");

	}

}

WARNING(unit_address_vs_reg, check_unit_address_vs_reg, NULL);

static void check_property_name_chars(struct check *c, struct dt_info *dti,

				      struct node *node)

{

	struct property *prop;

	for_each_property(node, prop) {

		int n = strspn(prop->name, c->data);

		if (n < strlen(prop->name))

			FAIL_PROP(c, dti, node, prop, "Bad character '%c' in property name",

				  prop->name[n]);

	}

}

ERROR(property_name_chars, check_property_name_chars, PROPNODECHARS);

static void check_property_name_chars_strict(struct check *c,

					     struct dt_info *dti,

					     struct node *node)

{

	struct property *prop;

	for_each_property(node, prop) {

		const char *name = prop->name;

		int n = strspn(name, c->data);

		if (n == strlen(prop->name))

			continue;

		/* Certain names are whitelisted */

		if (streq(name, "device_type"))

			continue;

		/*

		 * # is only allowed at the beginning of property names not counting

		 * the vendor prefix.

		 */

		if (name[n] == '#' && ((n == 0) || (name[n-1] == ','))) {

			name += n + 1;

			n = strspn(name, c->data);

		}

		if (n < strlen(name))

			FAIL_PROP(c, dti, node, prop, "Character '%c' not recommended in property name",

				  name[n]);

	}

}

CHECK(property_name_chars_strict, check_property_name_chars_strict, PROPNODECHARSSTRICT);

#define DESCLABEL_FMT	"%s%s%s%s%s"

#define DESCLABEL_ARGS(node,prop,mark)		\

	((mark) ? "value of " : ""),		\

	((prop) ? "'" : ""), \

	((prop) ? (prop)->name : ""), \

	((prop) ? "' in " : ""), (node)->fullpath

static void check_duplicate_label(struct check *c, struct dt_info *dti,

				  const char *label, struct node *node,

				  struct property *prop, struct marker *mark)

{

	struct node *dt = dti->dt;

	struct node *othernode = NULL;

	struct property *otherprop = NULL;

	struct marker *othermark = NULL;

	othernode = get_node_by_label(dt, label);

	if (!othernode)

		otherprop = get_property_by_label(dt, label, &othernode);

	if (!othernode)

		othermark = get_marker_label(dt, label, &othernode,

					       &otherprop);

	if (!othernode)

		return;

	if ((othernode != node) || (otherprop != prop) || (othermark != mark))

		FAIL(c, dti, node, "Duplicate label '%s' on " DESCLABEL_FMT

		     " and " DESCLABEL_FMT,

		     label, DESCLABEL_ARGS(node, prop, mark),

		     DESCLABEL_ARGS(othernode, otherprop, othermark));

}

static void check_duplicate_label_node(struct check *c, struct dt_info *dti,

				       struct node *node)

{

	struct label *l;

	struct property *prop;

	for_each_label(node->labels, l)

		check_duplicate_label(c, dti, l->label, node, NULL, NULL);

	for_each_property(node, prop) {

		struct marker *m = prop->val.markers;

		for_each_label(prop->labels, l)

			check_duplicate_label(c, dti, l->label, node, prop, NULL);

		for_each_marker_of_type(m, LABEL)

			check_duplicate_label(c, dti, m->ref, node, prop, m);

	}

}

ERROR(duplicate_label, check_duplicate_label_node, NULL);

static cell_t check_phandle_prop(struct check *c, struct dt_info *dti,

				 struct node *node, const char *propname)

{

	struct node *root = dti->dt;

	struct property *prop;

	struct marker *m;

	cell_t phandle;

	prop = get_property(node, propname);

	if (!prop)

		return 0;

	if (prop->val.len != sizeof(cell_t)) {

		FAIL_PROP(c, dti, node, prop, "bad length (%d) %s property",

			  prop->val.len, prop->name);

		return 0;

	}

	m = prop->val.markers;

	for_each_marker_of_type(m, REF_PHANDLE) {

		assert(m->offset == 0);

		if (node != get_node_by_ref(root, m->ref))

			/* "Set this node's phandle equal to some

			 * other node's phandle".  That's nonsensical

			 * by construction. */ {

			FAIL(c, dti, node, "%s is a reference to another node",

			     prop->name);

		}

		/* But setting this node's phandle equal to its own

		 * phandle is allowed - that means allocate a unique

		 * phandle for this node, even if it's not otherwise

		 * referenced.  The value will be filled in later, so

		 * we treat it as having no phandle data for now. */

		return 0;

	}

	phandle = propval_cell(prop);

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

		FAIL_PROP(c, dti, node, prop, "bad value (0x%x) in %s property",

		     phandle, prop->name);

		return 0;

	}

	return phandle;

}

static void check_explicit_phandles(struct check *c, struct dt_info *dti,

				    struct node *node)

{

	struct node *root = dti->dt;

	struct node *other;

	cell_t phandle, linux_phandle;

	/* Nothing should have assigned phandles yet */

	assert(!node->phandle);

	phandle = check_phandle_prop(c, dti, node, "phandle");

	linux_phandle = check_phandle_prop(c, dti, node, "linux,phandle");

	if (!phandle && !linux_phandle)

		/* No valid phandles; nothing further to check */

		return;

	if (linux_phandle && phandle && (phandle != linux_phandle))

		FAIL(c, dti, node, "mismatching 'phandle' and 'linux,phandle'"

		     " properties");

	if (linux_phandle && !phandle)

		phandle = linux_phandle;

	other = get_node_by_phandle(root, phandle);

	if (other && (other != node)) {

		FAIL(c, dti, node, "duplicated phandle 0x%x (seen before at %s)",

		     phandle, other->fullpath);

		return;

	}

	node->phandle = phandle;

}

ERROR(explicit_phandles, check_explicit_phandles, NULL);

static void check_name_properties(struct check *c, struct dt_info *dti,

				  struct node *node)

{

	struct property **pp, *prop = NULL;

	for (pp = &node->proplist; *pp; pp = &((*pp)->next))

		if (streq((*pp)->name, "name")) {

			prop = *pp;

			break;

		}

	if (!prop)

		return; /* No name property, that's fine */

	if ((prop->val.len != node->basenamelen+1)

	    || (memcmp(prop->val.val, node->name, node->basenamelen) != 0)) {

		FAIL(c, dti, node, "\"name\" property is incorrect (\"%s\" instead"

		     " of base node name)", prop->val.val);

	} else {

		/* The name property is correct, and therefore redundant.

		 * Delete it */

		*pp = prop->next;

		free(prop->name);

		data_free(prop->val);

		free(prop);

	}

}

ERROR_IF_NOT_STRING(name_is_string, "name");

ERROR(name_properties, check_name_properties, NULL, &name_is_string);

/*

 * Reference fixup functions

 */

static void fixup_phandle_references(struct check *c, struct dt_info *dti,

				     struct node *node)

{

	struct node *dt = dti->dt;

	struct property *prop;

	for_each_property(node, prop) {

		struct marker *m = prop->val.markers;

		struct node *refnode;

		cell_t phandle;

		for_each_marker_of_type(m, REF_PHANDLE) {

			assert(m->offset + sizeof(cell_t) <= prop->val.len);

			refnode = get_node_by_ref(dt, m->ref);

			if (! refnode) {

				if (!(dti->dtsflags & DTSF_PLUGIN))

					FAIL(c, dti, node, "Reference to non-existent node or "

							"label \"%s\"\n", m->ref);

				else /* mark the entry as unresolved */

					*((fdt32_t *)(prop->val.val + m->offset)) =

						cpu_to_fdt32(0xffffffff);

				continue;

			}

			phandle = get_node_phandle(dt, refnode);

			*((fdt32_t *)(prop->val.val + m->offset)) = cpu_to_fdt32(phandle);

			reference_node(refnode);

		}

	}

}

ERROR(phandle_references, fixup_phandle_references, NULL,

      &duplicate_node_names, &explicit_phandles);

static void fixup_path_references(struct check *c, struct dt_info *dti,

				  struct node *node)

{

	struct node *dt = dti->dt;

	struct property *prop;

	for_each_property(node, prop) {

		struct marker *m = prop->val.markers;

		struct node *refnode;

		char *path;

		for_each_marker_of_type(m, REF_PATH) {

			assert(m->offset <= prop->val.len);

			refnode = get_node_by_ref(dt, m->ref);

			if (!refnode) {

				FAIL(c, dti, node, "Reference to non-existent node or label \"%s\"\n",

				     m->ref);

				continue;

			}

			path = refnode->fullpath;

			prop->val = data_insert_at_marker(prop->val, m, path,

							  strlen(path) + 1);

			reference_node(refnode);

		}

	}

}

ERROR(path_references, fixup_path_references, NULL, &duplicate_node_names);

static void fixup_omit_unused_nodes(struct check *c, struct dt_info *dti,

				    struct node *node)

{

	if (generate_symbols && node->labels)

		return;

	if (node->omit_if_unused && !node->is_referenced)

		delete_node(node);

}

ERROR(omit_unused_nodes, fixup_omit_unused_nodes, NULL, &phandle_references, &path_references);

/*

 * Semantic checks

 */

WARNING_IF_NOT_CELL(address_cells_is_cell, "#address-cells");

WARNING_IF_NOT_CELL(size_cells_is_cell, "#size-cells");

WARNING_IF_NOT_CELL(interrupt_cells_is_cell, "#interrupt-cells");

WARNING_IF_NOT_STRING(device_type_is_string, "device_type");

WARNING_IF_NOT_STRING(model_is_string, "model");

WARNING_IF_NOT_STRING(status_is_string, "status");

WARNING_IF_NOT_STRING(label_is_string, "label");

WARNING_IF_NOT_STRING_LIST(compatible_is_string_list, "compatible");

static void check_names_is_string_list(struct check *c, struct dt_info *dti,

				       struct node *node)

{

	struct property *prop;

	for_each_property(node, prop) {

		const char *s = strrchr(prop->name, '-');

		if (!s || !streq(s, "-names"))

			continue;

		c->data = prop->name;

		check_is_string_list(c, dti, node);

	}

}

WARNING(names_is_string_list, check_names_is_string_list, NULL);

static void check_alias_paths(struct check *c, struct dt_info *dti,

				    struct node *node)

{

	struct property *prop;

	if (!streq(node->name, "aliases"))

		return;

	for_each_property(node, prop) {

		if (streq(prop->name, "phandle")

		    || streq(prop->name, "linux,phandle")) {

			continue;

		}

		if (!prop->val.val || !get_node_by_path(dti->dt, prop->val.val)) {

			FAIL_PROP(c, dti, node, prop, "aliases property is not a valid node (%s)",

				  prop->val.val);

			continue;

		}

		if (strspn(prop->name, LOWERCASE DIGITS "-") != strlen(prop->name))

			FAIL(c, dti, node, "aliases property name must include only lowercase and '-'");

	}

}

WARNING(alias_paths, check_alias_paths, NULL);

static void fixup_addr_size_cells(struct check *c, struct dt_info *dti,

				  struct node *node)

{

	struct property *prop;

	node->addr_cells = -1;

	node->size_cells = -1;

	prop = get_property(node, "#address-cells");

	if (prop)

		node->addr_cells = propval_cell(prop);

	prop = get_property(node, "#size-cells");

	if (prop)

		node->size_cells = propval_cell(prop);

}

WARNING(addr_size_cells, fixup_addr_size_cells, NULL,

	&address_cells_is_cell, &size_cells_is_cell);

#define node_addr_cells(n) \

	(((n)->addr_cells == -1) ? 2 : (n)->addr_cells)

#define node_size_cells(n) \

	(((n)->size_cells == -1) ? 1 : (n)->size_cells)

static void check_reg_format(struct check *c, struct dt_info *dti,

			     struct node *node)

{

	struct property *prop;

	int addr_cells, size_cells, entrylen;

	prop = get_property(node, "reg");

	if (!prop)

		return; /* No "reg", that's fine */

	if (!node->parent) {

		FAIL(c, dti, node, "Root node has a \"reg\" property");

		return;

	}

	if (prop->val.len == 0)

		FAIL_PROP(c, dti, node, prop, "property is empty");

	addr_cells = node_addr_cells(node->parent);

	size_cells = node_size_cells(node->parent);

	entrylen = (addr_cells + size_cells) * sizeof(cell_t);

	if (!entrylen || (prop->val.len % entrylen) != 0)

		FAIL_PROP(c, dti, node, prop, "property has invalid length (%d bytes) "

			  "(#address-cells == %d, #size-cells == %d)",

			  prop->val.len, addr_cells, size_cells);

}

WARNING(reg_format, check_reg_format, NULL, &addr_size_cells);

static void check_ranges_format(struct check *c, struct dt_info *dti,

				struct node *node)

{

	struct property *prop;

	int c_addr_cells, p_addr_cells, c_size_cells, p_size_cells, entrylen;

	const char *ranges = c->data;

	prop = get_property(node, ranges);

	if (!prop)

		return;

	if (!node->parent) {

		FAIL_PROP(c, dti, node, prop, "Root node has a \"%s\" property",

			  ranges);

		return;

	}

	p_addr_cells = node_addr_cells(node->parent);

	p_size_cells = node_size_cells(node->parent);

	c_addr_cells = node_addr_cells(node);

	c_size_cells = node_size_cells(node);

	entrylen = (p_addr_cells + c_addr_cells + c_size_cells) * sizeof(cell_t);

	if (prop->val.len == 0) {

		if (p_addr_cells != c_addr_cells)

			FAIL_PROP(c, dti, node, prop, "empty \"%s\" property but its "

				  "#address-cells (%d) differs from %s (%d)",

				  ranges, c_addr_cells, node->parent->fullpath,

				  p_addr_cells);

		if (p_size_cells != c_size_cells)

			FAIL_PROP(c, dti, node, prop, "empty \"%s\" property but its "

				  "#size-cells (%d) differs from %s (%d)",

				  ranges, c_size_cells, node->parent->fullpath,

				  p_size_cells);

	} else if ((prop->val.len % entrylen) != 0) {

		FAIL_PROP(c, dti, node, prop, "\"%s\" property has invalid length (%d bytes) "

			  "(parent #address-cells == %d, child #address-cells == %d, "

			  "#size-cells == %d)", ranges, prop->val.len,

			  p_addr_cells, c_addr_cells, c_size_cells);

	}

}

WARNING(ranges_format, check_ranges_format, "ranges", &addr_size_cells);

WARNING(dma_ranges_format, check_ranges_format, "dma-ranges", &addr_size_cells);

static const struct bus_type pci_bus = {

	.name = "PCI",

};

static void check_pci_bridge(struct check *c, struct dt_info *dti, struct node *node)

{

	struct property *prop;

	cell_t *cells;

	prop = get_property(node, "device_type");

	if (!prop || !streq(prop->val.val, "pci"))

		return;

	node->bus = &pci_bus;

	if (!strprefixeq(node->name, node->basenamelen, "pci") &&

	    !strprefixeq(node->name, node->basenamelen, "pcie"))

		FAIL(c, dti, node, "node name is not \"pci\" or \"pcie\"");

	prop = get_property(node, "ranges");

	if (!prop)

		FAIL(c, dti, node, "missing ranges for PCI bridge (or not a bridge)");

	if (node_addr_cells(node) != 3)

		FAIL(c, dti, node, "incorrect #address-cells for PCI bridge");

	if (node_size_cells(node) != 2)

		FAIL(c, dti, node, "incorrect #size-cells for PCI bridge");

	prop = get_property(node, "bus-range");

	if (!prop)

		return;

	if (prop->val.len != (sizeof(cell_t) * 2)) {

		FAIL_PROP(c, dti, node, prop, "value must be 2 cells");

		return;

	}

	cells = (cell_t *)prop->val.val;

	if (fdt32_to_cpu(cells[0]) > fdt32_to_cpu(cells[1]))

		FAIL_PROP(c, dti, node, prop, "1st cell must be less than or equal to 2nd cell");

	if (fdt32_to_cpu(cells[1]) > 0xff)

		FAIL_PROP(c, dti, node, prop, "maximum bus number must be less than 256");

}

WARNING(pci_bridge, check_pci_bridge, NULL,

	&device_type_is_string, &addr_size_cells);

static void check_pci_device_bus_num(struct check *c, struct dt_info *dti, struct node *node)

{

	struct property *prop;

	unsigned int bus_num, min_bus, max_bus;

	cell_t *cells;

	if (!node->parent || (node->parent->bus != &pci_bus))

		return;

	prop = get_property(node, "reg");

	if (!prop)

		return;

	cells = (cell_t *)prop->val.val;

	bus_num = (fdt32_to_cpu(cells[0]) & 0x00ff0000) >> 16;

	prop = get_property(node->parent, "bus-range");

	if (!prop) {

		min_bus = max_bus = 0;

	} else {

		cells = (cell_t *)prop->val.val;

		min_bus = fdt32_to_cpu(cells[0]);

		max_bus = fdt32_to_cpu(cells[0]);

	}

	if ((bus_num < min_bus) || (bus_num > max_bus))

		FAIL_PROP(c, dti, node, prop, "PCI bus number %d out of range, expected (%d - %d)",

			  bus_num, min_bus, max_bus);

}

WARNING(pci_device_bus_num, check_pci_device_bus_num, NULL, &reg_format, &pci_bridge);