2019-06-20 23:19:38 +02:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
2007-11-01 06:49:26 +01:00
|
|
|
/*
|
|
|
|
* (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2007.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "dtc.h"
|
2018-11-24 21:47:56 +01:00
|
|
|
#include "srcpos.h"
|
2007-11-01 06:49:26 +01:00
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
#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
|
2007-11-01 06:49:26 +01:00
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
enum checkstatus {
|
|
|
|
UNCHECKED = 0,
|
|
|
|
PREREQ,
|
|
|
|
PASSED,
|
|
|
|
FAILED,
|
|
|
|
};
|
|
|
|
|
|
|
|
struct check;
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
|
|
|
|
struct check {
|
|
|
|
const char *name;
|
2013-11-01 13:57:17 +01:00
|
|
|
check_fn fn;
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
void *data;
|
2012-07-08 15:25:21 +02:00
|
|
|
bool warn, error;
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
enum checkstatus status;
|
2013-10-28 11:06:53 +01:00
|
|
|
bool inprogress;
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
int num_prereqs;
|
|
|
|
struct check **prereq;
|
|
|
|
};
|
|
|
|
|
2017-10-18 07:59:43 +02:00
|
|
|
#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_), \
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
.status = UNCHECKED, \
|
2017-10-18 07:59:43 +02:00
|
|
|
.num_prereqs = ARRAY_SIZE(nm_##_prereqs), \
|
|
|
|
.prereq = nm_##_prereqs, \
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
};
|
2017-10-18 07:59:43 +02:00
|
|
|
#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__)
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
|
2018-01-31 15:57:04 +01:00
|
|
|
static inline void PRINTF(5, 6) check_msg(struct check *c, struct dt_info *dti,
|
2018-01-31 15:57:03 +01:00
|
|
|
struct node *node,
|
2018-01-31 15:57:04 +01:00
|
|
|
struct property *prop,
|
2017-03-06 02:06:15 +01:00
|
|
|
const char *fmt, ...)
|
2007-11-01 06:49:26 +01:00
|
|
|
{
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
va_list ap;
|
2018-11-24 21:47:55 +01:00
|
|
|
char *str = NULL;
|
2018-11-24 21:47:56 +01:00
|
|
|
struct srcpos *pos = NULL;
|
|
|
|
char *file_str;
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
|
2018-11-21 22:53:57 +01:00
|
|
|
if (!(c->warn && (quiet < 1)) && !(c->error && (quiet < 2)))
|
|
|
|
return;
|
|
|
|
|
2018-11-24 21:47:56 +01:00
|
|
|
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);
|
|
|
|
|
2018-11-21 22:53:57 +01:00
|
|
|
if (node) {
|
|
|
|
if (prop)
|
2018-11-24 21:47:55 +01:00
|
|
|
xasprintf_append(&str, "%s:%s: ", node->fullpath, prop->name);
|
|
|
|
else
|
|
|
|
xasprintf_append(&str, "%s: ", node->fullpath);
|
2012-07-08 15:25:21 +02:00
|
|
|
}
|
2018-11-24 21:47:55 +01:00
|
|
|
|
2018-11-21 22:53:57 +01:00
|
|
|
va_start(ap, fmt);
|
2018-11-24 21:47:55 +01:00
|
|
|
xavsprintf_append(&str, fmt, ap);
|
2015-01-12 13:46:56 +01:00
|
|
|
va_end(ap);
|
2018-11-24 21:47:55 +01:00
|
|
|
|
|
|
|
xasprintf_append(&str, "\n");
|
|
|
|
|
2018-11-24 21:47:56 +01:00
|
|
|
if (!prop && pos) {
|
|
|
|
pos = node->srcpos;
|
|
|
|
while (pos->next) {
|
|
|
|
pos = pos->next;
|
|
|
|
|
|
|
|
file_str = srcpos_string(pos);
|
2018-11-27 15:16:30 +01:00
|
|
|
xasprintf_append(&str, " also defined at %s\n", file_str);
|
2018-11-24 21:47:56 +01:00
|
|
|
free(file_str);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-11-24 21:47:55 +01:00
|
|
|
fputs(str, stderr);
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
}
|
|
|
|
|
2018-01-31 15:57:03 +01:00
|
|
|
#define FAIL(c, dti, node, ...) \
|
2017-02-03 09:29:39 +01:00
|
|
|
do { \
|
|
|
|
TRACE((c), "\t\tFAILED at %s:%d", __FILE__, __LINE__); \
|
|
|
|
(c)->status = FAILED; \
|
2018-01-31 15:57:04 +01:00
|
|
|
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__); \
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
} while (0)
|
|
|
|
|
2018-01-31 15:57:04 +01:00
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_nodes_props(struct check *c, struct dt_info *dti, struct node *node)
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
{
|
|
|
|
struct node *child;
|
|
|
|
|
|
|
|
TRACE(c, "%s", node->fullpath);
|
2013-11-01 13:57:17 +01:00
|
|
|
if (c->fn)
|
2016-05-31 03:58:42 +02:00
|
|
|
c->fn(c, dti, node);
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
|
|
|
|
for_each_child(node, child)
|
2016-05-31 03:58:42 +02:00
|
|
|
check_nodes_props(c, dti, child);
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
}
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static bool run_check(struct check *c, struct dt_info *dti)
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
{
|
2016-05-31 03:58:42 +02:00
|
|
|
struct node *dt = dti->dt;
|
2013-10-28 11:06:53 +01:00
|
|
|
bool error = false;
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
int i;
|
|
|
|
|
|
|
|
assert(!c->inprogress);
|
|
|
|
|
|
|
|
if (c->status != UNCHECKED)
|
|
|
|
goto out;
|
|
|
|
|
2013-10-28 11:06:53 +01:00
|
|
|
c->inprogress = true;
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
|
|
|
|
for (i = 0; i < c->num_prereqs; i++) {
|
|
|
|
struct check *prq = c->prereq[i];
|
2016-05-31 03:58:42 +02:00
|
|
|
error = error || run_check(prq, dti);
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
if (prq->status != PASSED) {
|
|
|
|
c->status = PREREQ;
|
2018-01-31 15:57:04 +01:00
|
|
|
check_msg(c, dti, NULL, NULL, "Failed prerequisite '%s'",
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
c->prereq[i]->name);
|
|
|
|
}
|
2007-11-01 06:49:26 +01:00
|
|
|
}
|
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
if (c->status != UNCHECKED)
|
|
|
|
goto out;
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
check_nodes_props(c, dti, dt);
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
|
|
|
|
if (c->status == UNCHECKED)
|
|
|
|
c->status = PASSED;
|
2007-11-01 06:49:26 +01:00
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
TRACE(c, "\tCompleted, status %d", c->status);
|
|
|
|
|
|
|
|
out:
|
2013-10-28 11:06:53 +01:00
|
|
|
c->inprogress = false;
|
2012-07-08 15:25:21 +02:00
|
|
|
if ((c->status != PASSED) && (c->error))
|
2013-10-28 11:06:53 +01:00
|
|
|
error = true;
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2007-12-04 23:40:23 +01:00
|
|
|
/*
|
|
|
|
* Utility check functions
|
|
|
|
*/
|
|
|
|
|
2012-07-08 15:25:22 +02:00
|
|
|
/* A check which always fails, for testing purposes only */
|
2016-05-31 03:58:42 +02:00
|
|
|
static inline void check_always_fail(struct check *c, struct dt_info *dti,
|
2013-10-27 09:18:06 +01:00
|
|
|
struct node *node)
|
2012-07-08 15:25:22 +02:00
|
|
|
{
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "always_fail check");
|
2012-07-08 15:25:22 +02:00
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
CHECK(always_fail, check_always_fail, NULL);
|
2012-07-08 15:25:22 +02:00
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_is_string(struct check *c, struct dt_info *dti,
|
2007-12-04 23:40:23 +01:00
|
|
|
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))
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "property is not a string");
|
2007-12-04 23:40:23 +01:00
|
|
|
}
|
2012-07-08 15:25:21 +02:00
|
|
|
#define WARNING_IF_NOT_STRING(nm, propname) \
|
2013-10-27 12:23:45 +01:00
|
|
|
WARNING(nm, check_is_string, (propname))
|
2012-07-08 15:25:21 +02:00
|
|
|
#define ERROR_IF_NOT_STRING(nm, propname) \
|
2013-10-27 12:23:45 +01:00
|
|
|
ERROR(nm, check_is_string, (propname))
|
2007-12-04 23:40:23 +01:00
|
|
|
|
2017-12-12 23:46:25 +01:00
|
|
|
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) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "property is not a string list");
|
2017-12-12 23:46:25 +01:00
|
|
|
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))
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_is_cell(struct check *c, struct dt_info *dti,
|
2007-12-06 06:59:45 +01:00
|
|
|
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))
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "property is not a single cell");
|
2007-12-06 06:59:45 +01:00
|
|
|
}
|
2012-07-08 15:25:21 +02:00
|
|
|
#define WARNING_IF_NOT_CELL(nm, propname) \
|
2013-10-27 12:23:45 +01:00
|
|
|
WARNING(nm, check_is_cell, (propname))
|
2012-07-08 15:25:21 +02:00
|
|
|
#define ERROR_IF_NOT_CELL(nm, propname) \
|
2013-10-27 12:23:45 +01:00
|
|
|
ERROR(nm, check_is_cell, (propname))
|
2007-12-06 06:59:45 +01:00
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
/*
|
|
|
|
* Structural check functions
|
|
|
|
*/
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_duplicate_node_names(struct check *c, struct dt_info *dti,
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct node *child, *child2;
|
|
|
|
|
|
|
|
for_each_child(node, child)
|
2007-11-01 06:49:26 +01:00
|
|
|
for (child2 = child->next_sibling;
|
|
|
|
child2;
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
child2 = child2->next_sibling)
|
2007-11-01 06:49:26 +01:00
|
|
|
if (streq(child->name, child2->name))
|
2018-03-27 14:13:31 +02:00
|
|
|
FAIL(c, dti, child2, "Duplicate node name");
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
ERROR(duplicate_node_names, check_duplicate_node_names, NULL);
|
2007-11-01 06:49:26 +01:00
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_duplicate_property_names(struct check *c, struct dt_info *dti,
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop, *prop2;
|
|
|
|
|
2012-08-08 06:50:15 +02:00
|
|
|
for_each_property(node, prop) {
|
|
|
|
for (prop2 = prop->next; prop2; prop2 = prop2->next) {
|
|
|
|
if (prop2->deleted)
|
|
|
|
continue;
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
if (streq(prop->name, prop2->name))
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "Duplicate property name");
|
2012-08-08 06:50:15 +02:00
|
|
|
}
|
|
|
|
}
|
2007-11-01 06:49:26 +01:00
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
ERROR(duplicate_property_names, check_duplicate_property_names, NULL);
|
2007-11-01 06:49:26 +01:00
|
|
|
|
2008-02-27 03:45:13 +01:00
|
|
|
#define LOWERCASE "abcdefghijklmnopqrstuvwxyz"
|
|
|
|
#define UPPERCASE "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
|
|
|
|
#define DIGITS "0123456789"
|
|
|
|
#define PROPNODECHARS LOWERCASE UPPERCASE DIGITS ",._+*#?-"
|
2017-02-10 17:47:14 +01:00
|
|
|
#define PROPNODECHARSSTRICT LOWERCASE UPPERCASE DIGITS ",-"
|
2008-02-27 03:45:13 +01:00
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_node_name_chars(struct check *c, struct dt_info *dti,
|
2008-02-27 03:45:13 +01:00
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
int n = strspn(node->name, c->data);
|
|
|
|
|
|
|
|
if (n < strlen(node->name))
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "Bad character '%c' in node name",
|
|
|
|
node->name[n]);
|
2008-02-27 03:45:13 +01:00
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
ERROR(node_name_chars, check_node_name_chars, PROPNODECHARS "@");
|
2008-02-27 03:45:13 +01:00
|
|
|
|
2017-02-10 17:47:15 +01:00
|
|
|
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)
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "Character '%c' not recommended in node name",
|
|
|
|
node->name[n]);
|
2017-02-10 17:47:15 +01:00
|
|
|
}
|
|
|
|
CHECK(node_name_chars_strict, check_node_name_chars_strict, PROPNODECHARSSTRICT);
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_node_name_format(struct check *c, struct dt_info *dti,
|
2008-02-27 03:45:13 +01:00
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
if (strchr(get_unitname(node), '@'))
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "multiple '@' characters in node name");
|
2008-02-27 03:45:13 +01:00
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
ERROR(node_name_format, check_node_name_format, NULL, &node_name_chars);
|
2008-02-27 03:45:13 +01:00
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_unit_address_vs_reg(struct check *c, struct dt_info *dti,
|
2016-11-25 13:32:08 +01:00
|
|
|
struct node *node)
|
2016-02-19 05:59:29 +01:00
|
|
|
{
|
|
|
|
const char *unitname = get_unitname(node);
|
|
|
|
struct property *prop = get_property(node, "reg");
|
|
|
|
|
2018-03-06 04:45:50 +01:00
|
|
|
if (get_subnode(node, "__overlay__")) {
|
|
|
|
/* HACK: Overlay fragments are a special case */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2016-02-19 05:59:29 +01:00
|
|
|
if (!prop) {
|
|
|
|
prop = get_property(node, "ranges");
|
|
|
|
if (prop && !prop->val.len)
|
|
|
|
prop = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (prop) {
|
|
|
|
if (!unitname[0])
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "node has a reg or ranges property, but no unit name");
|
2016-02-19 05:59:29 +01:00
|
|
|
} else {
|
|
|
|
if (unitname[0])
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "node has a unit name, but no reg property");
|
2016-02-19 05:59:29 +01:00
|
|
|
}
|
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
WARNING(unit_address_vs_reg, check_unit_address_vs_reg, NULL);
|
2016-02-19 05:59:29 +01:00
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_property_name_chars(struct check *c, struct dt_info *dti,
|
2013-10-27 12:23:45 +01:00
|
|
|
struct node *node)
|
2008-02-27 03:45:13 +01:00
|
|
|
{
|
2013-10-27 12:23:45 +01:00
|
|
|
struct property *prop;
|
|
|
|
|
|
|
|
for_each_property(node, prop) {
|
|
|
|
int n = strspn(prop->name, c->data);
|
2008-02-27 03:45:13 +01:00
|
|
|
|
2013-10-27 12:23:45 +01:00
|
|
|
if (n < strlen(prop->name))
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "Bad character '%c' in property name",
|
|
|
|
prop->name[n]);
|
2013-10-27 12:23:45 +01:00
|
|
|
}
|
2008-02-27 03:45:13 +01:00
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
ERROR(property_name_chars, check_property_name_chars, PROPNODECHARS);
|
2008-02-27 03:45:13 +01:00
|
|
|
|
2017-02-10 17:47:14 +01:00
|
|
|
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 */
|
2017-02-13 05:57:54 +01:00
|
|
|
if (streq(name, "device_type"))
|
2017-02-10 17:47:14 +01:00
|
|
|
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))
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "Character '%c' not recommended in property name",
|
|
|
|
name[n]);
|
2017-02-10 17:47:14 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
CHECK(property_name_chars_strict, check_property_name_chars_strict, PROPNODECHARSSTRICT);
|
|
|
|
|
2010-02-23 09:56:41 +01:00
|
|
|
#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
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_duplicate_label(struct check *c, struct dt_info *dti,
|
2010-02-23 09:56:41 +01:00
|
|
|
const char *label, struct node *node,
|
|
|
|
struct property *prop, struct marker *mark)
|
|
|
|
{
|
2016-05-31 03:58:42 +02:00
|
|
|
struct node *dt = dti->dt;
|
2010-02-23 09:56:41 +01:00
|
|
|
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))
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "Duplicate label '%s' on " DESCLABEL_FMT
|
2010-02-23 09:56:41 +01:00
|
|
|
" and " DESCLABEL_FMT,
|
|
|
|
label, DESCLABEL_ARGS(node, prop, mark),
|
|
|
|
DESCLABEL_ARGS(othernode, otherprop, othermark));
|
|
|
|
}
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_duplicate_label_node(struct check *c, struct dt_info *dti,
|
2010-02-23 09:56:41 +01:00
|
|
|
struct node *node)
|
|
|
|
{
|
2010-02-24 08:22:17 +01:00
|
|
|
struct label *l;
|
2013-10-27 12:23:45 +01:00
|
|
|
struct property *prop;
|
2010-02-24 08:22:17 +01:00
|
|
|
|
|
|
|
for_each_label(node->labels, l)
|
2016-05-31 03:58:42 +02:00
|
|
|
check_duplicate_label(c, dti, l->label, node, NULL, NULL);
|
2010-02-23 09:56:41 +01:00
|
|
|
|
2013-10-27 12:23:45 +01:00
|
|
|
for_each_property(node, prop) {
|
|
|
|
struct marker *m = prop->val.markers;
|
|
|
|
|
|
|
|
for_each_label(prop->labels, l)
|
2016-05-31 03:58:42 +02:00
|
|
|
check_duplicate_label(c, dti, l->label, node, prop, NULL);
|
2010-02-23 09:56:41 +01:00
|
|
|
|
2013-10-27 12:23:45 +01:00
|
|
|
for_each_marker_of_type(m, LABEL)
|
2016-05-31 03:58:42 +02:00
|
|
|
check_duplicate_label(c, dti, m->ref, node, prop, m);
|
2013-10-27 12:23:45 +01:00
|
|
|
}
|
2010-02-23 09:56:41 +01:00
|
|
|
}
|
2013-10-27 12:23:45 +01:00
|
|
|
ERROR(duplicate_label, check_duplicate_label_node, NULL);
|
2010-02-23 09:56:41 +01:00
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static cell_t check_phandle_prop(struct check *c, struct dt_info *dti,
|
2013-10-27 12:23:45 +01:00
|
|
|
struct node *node, const char *propname)
|
2007-11-01 06:49:26 +01:00
|
|
|
{
|
2016-05-31 03:58:42 +02:00
|
|
|
struct node *root = dti->dt;
|
2013-10-27 12:23:45 +01:00
|
|
|
struct property *prop;
|
dtc: Handle linux,phandle properties which self-reference
Currently, dtc will generate phandles for nodes which are referenced
elsewhere in the tree. phandles can also be explicitly assigned by
defining the linux,phandle property. However, there is no way,
currently to tell dtc to generate a phandle for a node if it is not
referenced elsewhere. This is inconvenient when it's expected that
later processing on the flat tree might add nodes which _will_
the node in question.
One way one might attempt to do this is with the construct:
mynode: mynode {
linux,phandle = <&mynode>;
/* ... */
};
Though it's a trifle odd, there's really only one sensible meaning
which can be assigned to this construct: allocate a unique phandle to
"mynode" and put that in its linux,phandle property (as always).
Currently, however, dtc will choke on this self-reference. This patch
corrects this, making the construct above give the expected results.
It also ensures a more meaningful error message is given if you
attempt to process the nonsensical construct:
mynode: mynode {
linux,phandle = <&someothernode>;
/* ... */
};
The 'references' testcase is extended to cover this case, as well.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2008-11-07 02:49:44 +01:00
|
|
|
struct marker *m;
|
2007-11-01 06:49:26 +01:00
|
|
|
cell_t phandle;
|
|
|
|
|
2013-10-27 12:23:45 +01:00
|
|
|
prop = get_property(node, propname);
|
|
|
|
if (!prop)
|
|
|
|
return 0;
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
|
|
|
|
if (prop->val.len != sizeof(cell_t)) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "bad length (%d) %s property",
|
|
|
|
prop->val.len, prop->name);
|
2013-10-27 12:23:45 +01:00
|
|
|
return 0;
|
2007-11-01 06:49:26 +01:00
|
|
|
}
|
|
|
|
|
dtc: Handle linux,phandle properties which self-reference
Currently, dtc will generate phandles for nodes which are referenced
elsewhere in the tree. phandles can also be explicitly assigned by
defining the linux,phandle property. However, there is no way,
currently to tell dtc to generate a phandle for a node if it is not
referenced elsewhere. This is inconvenient when it's expected that
later processing on the flat tree might add nodes which _will_
the node in question.
One way one might attempt to do this is with the construct:
mynode: mynode {
linux,phandle = <&mynode>;
/* ... */
};
Though it's a trifle odd, there's really only one sensible meaning
which can be assigned to this construct: allocate a unique phandle to
"mynode" and put that in its linux,phandle property (as always).
Currently, however, dtc will choke on this self-reference. This patch
corrects this, making the construct above give the expected results.
It also ensures a more meaningful error message is given if you
attempt to process the nonsensical construct:
mynode: mynode {
linux,phandle = <&someothernode>;
/* ... */
};
The 'references' testcase is extended to cover this case, as well.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2008-11-07 02:49:44 +01:00
|
|
|
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
|
Support ePAPR compliant phandle properties
Currently, the Linux kernel, libfdt and dtc, when using flattened
device trees encode a node's phandle into a property named
"linux,phandle". The ePAPR specification, however - aiming as it is
to not be a Linux specific spec - requires that phandles be encoded in
a property named simply "phandle".
This patch adds support for this newer approach to dtc and libfdt.
Specifically:
- fdt_get_phandle() will now return the correct phandle if it
is supplied in either of these properties
- fdt_node_offset_by_phandle() will correctly find a node with
the given phandle encoded in either property.
- By default, when auto-generating phandles, dtc will encode
it into both properties for maximum compatibility. A new -H
option allows either only old-style or only new-style
properties to be generated.
- If phandle properties are explicitly supplied in the dts
file, dtc will not auto-generate ones in the alternate format.
- If both properties are supplied, dtc will check that they
have the same value.
- Some existing testcases are updated to use a mix of old and
new-style phandles, partially testing the changes.
- A new phandle_format test further tests the libfdt support,
and the -H option.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2009-11-26 05:37:13 +01:00
|
|
|
* by construction. */ {
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "%s is a reference to another node",
|
|
|
|
prop->name);
|
Support ePAPR compliant phandle properties
Currently, the Linux kernel, libfdt and dtc, when using flattened
device trees encode a node's phandle into a property named
"linux,phandle". The ePAPR specification, however - aiming as it is
to not be a Linux specific spec - requires that phandles be encoded in
a property named simply "phandle".
This patch adds support for this newer approach to dtc and libfdt.
Specifically:
- fdt_get_phandle() will now return the correct phandle if it
is supplied in either of these properties
- fdt_node_offset_by_phandle() will correctly find a node with
the given phandle encoded in either property.
- By default, when auto-generating phandles, dtc will encode
it into both properties for maximum compatibility. A new -H
option allows either only old-style or only new-style
properties to be generated.
- If phandle properties are explicitly supplied in the dts
file, dtc will not auto-generate ones in the alternate format.
- If both properties are supplied, dtc will check that they
have the same value.
- Some existing testcases are updated to use a mix of old and
new-style phandles, partially testing the changes.
- A new phandle_format test further tests the libfdt support,
and the -H option.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2009-11-26 05:37:13 +01:00
|
|
|
}
|
dtc: Handle linux,phandle properties which self-reference
Currently, dtc will generate phandles for nodes which are referenced
elsewhere in the tree. phandles can also be explicitly assigned by
defining the linux,phandle property. However, there is no way,
currently to tell dtc to generate a phandle for a node if it is not
referenced elsewhere. This is inconvenient when it's expected that
later processing on the flat tree might add nodes which _will_
the node in question.
One way one might attempt to do this is with the construct:
mynode: mynode {
linux,phandle = <&mynode>;
/* ... */
};
Though it's a trifle odd, there's really only one sensible meaning
which can be assigned to this construct: allocate a unique phandle to
"mynode" and put that in its linux,phandle property (as always).
Currently, however, dtc will choke on this self-reference. This patch
corrects this, making the construct above give the expected results.
It also ensures a more meaningful error message is given if you
attempt to process the nonsensical construct:
mynode: mynode {
linux,phandle = <&someothernode>;
/* ... */
};
The 'references' testcase is extended to cover this case, as well.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2008-11-07 02:49:44 +01:00
|
|
|
/* 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
|
2013-10-27 12:23:45 +01:00
|
|
|
* we treat it as having no phandle data for now. */
|
|
|
|
return 0;
|
dtc: Handle linux,phandle properties which self-reference
Currently, dtc will generate phandles for nodes which are referenced
elsewhere in the tree. phandles can also be explicitly assigned by
defining the linux,phandle property. However, there is no way,
currently to tell dtc to generate a phandle for a node if it is not
referenced elsewhere. This is inconvenient when it's expected that
later processing on the flat tree might add nodes which _will_
the node in question.
One way one might attempt to do this is with the construct:
mynode: mynode {
linux,phandle = <&mynode>;
/* ... */
};
Though it's a trifle odd, there's really only one sensible meaning
which can be assigned to this construct: allocate a unique phandle to
"mynode" and put that in its linux,phandle property (as always).
Currently, however, dtc will choke on this self-reference. This patch
corrects this, making the construct above give the expected results.
It also ensures a more meaningful error message is given if you
attempt to process the nonsensical construct:
mynode: mynode {
linux,phandle = <&someothernode>;
/* ... */
};
The 'references' testcase is extended to cover this case, as well.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2008-11-07 02:49:44 +01:00
|
|
|
}
|
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
phandle = propval_cell(prop);
|
Support ePAPR compliant phandle properties
Currently, the Linux kernel, libfdt and dtc, when using flattened
device trees encode a node's phandle into a property named
"linux,phandle". The ePAPR specification, however - aiming as it is
to not be a Linux specific spec - requires that phandles be encoded in
a property named simply "phandle".
This patch adds support for this newer approach to dtc and libfdt.
Specifically:
- fdt_get_phandle() will now return the correct phandle if it
is supplied in either of these properties
- fdt_node_offset_by_phandle() will correctly find a node with
the given phandle encoded in either property.
- By default, when auto-generating phandles, dtc will encode
it into both properties for maximum compatibility. A new -H
option allows either only old-style or only new-style
properties to be generated.
- If phandle properties are explicitly supplied in the dts
file, dtc will not auto-generate ones in the alternate format.
- If both properties are supplied, dtc will check that they
have the same value.
- Some existing testcases are updated to use a mix of old and
new-style phandles, partially testing the changes.
- A new phandle_format test further tests the libfdt support,
and the -H option.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2009-11-26 05:37:13 +01:00
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
if ((phandle == 0) || (phandle == -1)) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "bad value (0x%x) in %s property",
|
2018-01-31 15:57:03 +01:00
|
|
|
phandle, prop->name);
|
2013-10-27 12:23:45 +01:00
|
|
|
return 0;
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
}
|
|
|
|
|
2013-10-27 12:23:45 +01:00
|
|
|
return phandle;
|
|
|
|
}
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_explicit_phandles(struct check *c, struct dt_info *dti,
|
2013-10-27 12:23:45 +01:00
|
|
|
struct node *node)
|
|
|
|
{
|
2016-05-31 03:58:42 +02:00
|
|
|
struct node *root = dti->dt;
|
2013-10-27 12:23:45 +01:00
|
|
|
struct node *other;
|
|
|
|
cell_t phandle, linux_phandle;
|
|
|
|
|
|
|
|
/* Nothing should have assigned phandles yet */
|
|
|
|
assert(!node->phandle);
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
phandle = check_phandle_prop(c, dti, node, "phandle");
|
2013-10-27 12:23:45 +01:00
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
linux_phandle = check_phandle_prop(c, dti, node, "linux,phandle");
|
2013-10-27 12:23:45 +01:00
|
|
|
|
|
|
|
if (!phandle && !linux_phandle)
|
|
|
|
/* No valid phandles; nothing further to check */
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (linux_phandle && phandle && (phandle != linux_phandle))
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "mismatching 'phandle' and 'linux,phandle'"
|
|
|
|
" properties");
|
2013-10-27 12:23:45 +01:00
|
|
|
|
|
|
|
if (linux_phandle && !phandle)
|
|
|
|
phandle = linux_phandle;
|
Support ePAPR compliant phandle properties
Currently, the Linux kernel, libfdt and dtc, when using flattened
device trees encode a node's phandle into a property named
"linux,phandle". The ePAPR specification, however - aiming as it is
to not be a Linux specific spec - requires that phandles be encoded in
a property named simply "phandle".
This patch adds support for this newer approach to dtc and libfdt.
Specifically:
- fdt_get_phandle() will now return the correct phandle if it
is supplied in either of these properties
- fdt_node_offset_by_phandle() will correctly find a node with
the given phandle encoded in either property.
- By default, when auto-generating phandles, dtc will encode
it into both properties for maximum compatibility. A new -H
option allows either only old-style or only new-style
properties to be generated.
- If phandle properties are explicitly supplied in the dts
file, dtc will not auto-generate ones in the alternate format.
- If both properties are supplied, dtc will check that they
have the same value.
- Some existing testcases are updated to use a mix of old and
new-style phandles, partially testing the changes.
- A new phandle_format test further tests the libfdt support,
and the -H option.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2009-11-26 05:37:13 +01:00
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
other = get_node_by_phandle(root, phandle);
|
Support ePAPR compliant phandle properties
Currently, the Linux kernel, libfdt and dtc, when using flattened
device trees encode a node's phandle into a property named
"linux,phandle". The ePAPR specification, however - aiming as it is
to not be a Linux specific spec - requires that phandles be encoded in
a property named simply "phandle".
This patch adds support for this newer approach to dtc and libfdt.
Specifically:
- fdt_get_phandle() will now return the correct phandle if it
is supplied in either of these properties
- fdt_node_offset_by_phandle() will correctly find a node with
the given phandle encoded in either property.
- By default, when auto-generating phandles, dtc will encode
it into both properties for maximum compatibility. A new -H
option allows either only old-style or only new-style
properties to be generated.
- If phandle properties are explicitly supplied in the dts
file, dtc will not auto-generate ones in the alternate format.
- If both properties are supplied, dtc will check that they
have the same value.
- Some existing testcases are updated to use a mix of old and
new-style phandles, partially testing the changes.
- A new phandle_format test further tests the libfdt support,
and the -H option.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2009-11-26 05:37:13 +01:00
|
|
|
if (other && (other != node)) {
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "duplicated phandle 0x%x (seen before at %s)",
|
|
|
|
phandle, other->fullpath);
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
node->phandle = phandle;
|
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
ERROR(explicit_phandles, check_explicit_phandles, NULL);
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_name_properties(struct check *c, struct dt_info *dti,
|
2007-12-04 23:40:23 +01:00
|
|
|
struct node *node)
|
|
|
|
{
|
2008-02-28 10:53:00 +01:00
|
|
|
struct property **pp, *prop = NULL;
|
|
|
|
|
|
|
|
for (pp = &node->proplist; *pp; pp = &((*pp)->next))
|
|
|
|
if (streq((*pp)->name, "name")) {
|
|
|
|
prop = *pp;
|
|
|
|
break;
|
|
|
|
}
|
2007-12-04 23:40:23 +01:00
|
|
|
|
|
|
|
if (!prop)
|
|
|
|
return; /* No name property, that's fine */
|
|
|
|
|
|
|
|
if ((prop->val.len != node->basenamelen+1)
|
2008-07-07 03:19:13 +02:00
|
|
|
|| (memcmp(prop->val.val, node->name, node->basenamelen) != 0)) {
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "\"name\" property is incorrect (\"%s\" instead"
|
|
|
|
" of base node name)", prop->val.val);
|
2008-07-07 03:19:13 +02:00
|
|
|
} else {
|
|
|
|
/* The name property is correct, and therefore redundant.
|
|
|
|
* Delete it */
|
|
|
|
*pp = prop->next;
|
|
|
|
free(prop->name);
|
|
|
|
data_free(prop->val);
|
|
|
|
free(prop);
|
|
|
|
}
|
2007-12-04 23:40:23 +01:00
|
|
|
}
|
2012-07-08 15:25:21 +02:00
|
|
|
ERROR_IF_NOT_STRING(name_is_string, "name");
|
2013-11-01 13:57:17 +01:00
|
|
|
ERROR(name_properties, check_name_properties, NULL, &name_is_string);
|
2007-12-04 23:40:23 +01:00
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
/*
|
|
|
|
* Reference fixup functions
|
|
|
|
*/
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void fixup_phandle_references(struct check *c, struct dt_info *dti,
|
2013-10-27 12:23:45 +01:00
|
|
|
struct node *node)
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
{
|
2016-05-31 03:58:42 +02:00
|
|
|
struct node *dt = dti->dt;
|
2013-10-27 12:23:45 +01:00
|
|
|
struct property *prop;
|
2008-02-28 06:42:15 +01:00
|
|
|
|
2013-10-27 12:23:45 +01:00
|
|
|
for_each_property(node, prop) {
|
|
|
|
struct marker *m = prop->val.markers;
|
|
|
|
struct node *refnode;
|
|
|
|
cell_t phandle;
|
2008-02-28 06:42:15 +01:00
|
|
|
|
2013-10-27 12:23:45 +01:00
|
|
|
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) {
|
2016-05-31 03:58:42 +02:00
|
|
|
if (!(dti->dtsflags & DTSF_PLUGIN))
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "Reference to non-existent node or "
|
2016-12-07 13:48:18 +01:00
|
|
|
"label \"%s\"\n", m->ref);
|
|
|
|
else /* mark the entry as unresolved */
|
2017-03-06 02:08:53 +01:00
|
|
|
*((fdt32_t *)(prop->val.val + m->offset)) =
|
2016-12-07 13:48:18 +01:00
|
|
|
cpu_to_fdt32(0xffffffff);
|
2013-10-27 12:23:45 +01:00
|
|
|
continue;
|
|
|
|
}
|
2008-02-28 06:42:15 +01:00
|
|
|
|
2013-10-27 12:23:45 +01:00
|
|
|
phandle = get_node_phandle(dt, refnode);
|
2017-03-06 02:08:53 +01:00
|
|
|
*((fdt32_t *)(prop->val.val + m->offset)) = cpu_to_fdt32(phandle);
|
dtc: add ability to make nodes conditional on them being referenced
A number of platforms have a need to reduce the number of DT nodes,
mostly because of two similar constraints: the size of the DT blob, and
the time it takes to parse it.
As the DT is used in more and more SoCs, and by more projects, some
constraints start to appear in bootloaders running from SRAM with an
order of magnitude of 10kB. A typical DT is in the same order of
magnitude, so any effort to reduce the blob size is welcome in such an
environment.
Some platforms also want to reach very fast boot time, and the time it
takes to parse a typical DT starts to be noticeable.
Both of these issues can be mitigated by reducing the number of nodes in
the DT. The biggest provider of nodes is usually the pin controller and
its subnodes, usually one for each valid pin configuration in a given
SoC.
Obviously, a single, fixed, set of these nodes will be used by a given
board, so we can introduce a node property that will tell the DT
compiler to drop the nodes when they are not referenced in the tree, and
as such wouldn't be useful in the targetted system.
Signed-off-by: Maxime Ripard <maxime.ripard@bootlin.com>
Reviewed-by: Rob Herring <robh@kernel.org>
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2018-05-03 22:27:26 +02:00
|
|
|
|
|
|
|
reference_node(refnode);
|
2013-10-27 12:23:45 +01:00
|
|
|
}
|
2008-02-28 06:42:15 +01:00
|
|
|
}
|
2007-11-01 06:49:26 +01:00
|
|
|
}
|
2013-10-27 12:23:45 +01:00
|
|
|
ERROR(phandle_references, fixup_phandle_references, NULL,
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
&duplicate_node_names, &explicit_phandles);
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void fixup_path_references(struct check *c, struct dt_info *dti,
|
2013-10-27 12:23:45 +01:00
|
|
|
struct node *node)
|
2007-12-05 00:43:50 +01:00
|
|
|
{
|
2016-05-31 03:58:42 +02:00
|
|
|
struct node *dt = dti->dt;
|
2013-10-27 12:23:45 +01:00
|
|
|
struct property *prop;
|
2007-12-05 00:43:50 +01:00
|
|
|
|
2013-10-27 12:23:45 +01:00
|
|
|
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) {
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "Reference to non-existent node or label \"%s\"\n",
|
2013-10-27 12:23:45 +01:00
|
|
|
m->ref);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
path = refnode->fullpath;
|
|
|
|
prop->val = data_insert_at_marker(prop->val, m, path,
|
|
|
|
strlen(path) + 1);
|
dtc: add ability to make nodes conditional on them being referenced
A number of platforms have a need to reduce the number of DT nodes,
mostly because of two similar constraints: the size of the DT blob, and
the time it takes to parse it.
As the DT is used in more and more SoCs, and by more projects, some
constraints start to appear in bootloaders running from SRAM with an
order of magnitude of 10kB. A typical DT is in the same order of
magnitude, so any effort to reduce the blob size is welcome in such an
environment.
Some platforms also want to reach very fast boot time, and the time it
takes to parse a typical DT starts to be noticeable.
Both of these issues can be mitigated by reducing the number of nodes in
the DT. The biggest provider of nodes is usually the pin controller and
its subnodes, usually one for each valid pin configuration in a given
SoC.
Obviously, a single, fixed, set of these nodes will be used by a given
board, so we can introduce a node property that will tell the DT
compiler to drop the nodes when they are not referenced in the tree, and
as such wouldn't be useful in the targetted system.
Signed-off-by: Maxime Ripard <maxime.ripard@bootlin.com>
Reviewed-by: Rob Herring <robh@kernel.org>
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2018-05-03 22:27:26 +02:00
|
|
|
|
|
|
|
reference_node(refnode);
|
2013-10-27 12:23:45 +01:00
|
|
|
}
|
2007-12-05 00:43:50 +01:00
|
|
|
}
|
|
|
|
}
|
2013-10-27 12:23:45 +01:00
|
|
|
ERROR(path_references, fixup_path_references, NULL, &duplicate_node_names);
|
2007-12-05 00:43:50 +01:00
|
|
|
|
dtc: add ability to make nodes conditional on them being referenced
A number of platforms have a need to reduce the number of DT nodes,
mostly because of two similar constraints: the size of the DT blob, and
the time it takes to parse it.
As the DT is used in more and more SoCs, and by more projects, some
constraints start to appear in bootloaders running from SRAM with an
order of magnitude of 10kB. A typical DT is in the same order of
magnitude, so any effort to reduce the blob size is welcome in such an
environment.
Some platforms also want to reach very fast boot time, and the time it
takes to parse a typical DT starts to be noticeable.
Both of these issues can be mitigated by reducing the number of nodes in
the DT. The biggest provider of nodes is usually the pin controller and
its subnodes, usually one for each valid pin configuration in a given
SoC.
Obviously, a single, fixed, set of these nodes will be used by a given
board, so we can introduce a node property that will tell the DT
compiler to drop the nodes when they are not referenced in the tree, and
as such wouldn't be useful in the targetted system.
Signed-off-by: Maxime Ripard <maxime.ripard@bootlin.com>
Reviewed-by: Rob Herring <robh@kernel.org>
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2018-05-03 22:27:26 +02:00
|
|
|
static void fixup_omit_unused_nodes(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
2019-03-27 04:53:52 +01:00
|
|
|
if (generate_symbols && node->labels)
|
|
|
|
return;
|
dtc: add ability to make nodes conditional on them being referenced
A number of platforms have a need to reduce the number of DT nodes,
mostly because of two similar constraints: the size of the DT blob, and
the time it takes to parse it.
As the DT is used in more and more SoCs, and by more projects, some
constraints start to appear in bootloaders running from SRAM with an
order of magnitude of 10kB. A typical DT is in the same order of
magnitude, so any effort to reduce the blob size is welcome in such an
environment.
Some platforms also want to reach very fast boot time, and the time it
takes to parse a typical DT starts to be noticeable.
Both of these issues can be mitigated by reducing the number of nodes in
the DT. The biggest provider of nodes is usually the pin controller and
its subnodes, usually one for each valid pin configuration in a given
SoC.
Obviously, a single, fixed, set of these nodes will be used by a given
board, so we can introduce a node property that will tell the DT
compiler to drop the nodes when they are not referenced in the tree, and
as such wouldn't be useful in the targetted system.
Signed-off-by: Maxime Ripard <maxime.ripard@bootlin.com>
Reviewed-by: Rob Herring <robh@kernel.org>
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2018-05-03 22:27:26 +02:00
|
|
|
if (node->omit_if_unused && !node->is_referenced)
|
|
|
|
delete_node(node);
|
|
|
|
}
|
|
|
|
ERROR(omit_unused_nodes, fixup_omit_unused_nodes, NULL, &phandle_references, &path_references);
|
|
|
|
|
2007-12-06 06:59:45 +01:00
|
|
|
/*
|
|
|
|
* Semantic checks
|
|
|
|
*/
|
2012-07-08 15:25:21 +02:00
|
|
|
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");
|
2007-12-06 06:59:45 +01:00
|
|
|
|
2012-07-08 15:25:21 +02:00
|
|
|
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");
|
2017-12-12 23:46:24 +01:00
|
|
|
WARNING_IF_NOT_STRING(label_is_string, "label");
|
2007-12-06 07:01:07 +01:00
|
|
|
|
2017-12-12 23:46:25 +01:00
|
|
|
WARNING_IF_NOT_STRING_LIST(compatible_is_string_list, "compatible");
|
|
|
|
|
2017-12-12 23:46:26 +01:00
|
|
|
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);
|
|
|
|
|
2017-12-12 23:46:28 +01:00
|
|
|
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) {
|
2019-09-04 06:58:28 +02:00
|
|
|
if (streq(prop->name, "phandle")
|
|
|
|
|| streq(prop->name, "linux,phandle")) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2017-12-12 23:46:28 +01:00
|
|
|
if (!prop->val.val || !get_node_by_path(dti->dt, prop->val.val)) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "aliases property is not a valid node (%s)",
|
|
|
|
prop->val.val);
|
2017-12-12 23:46:28 +01:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (strspn(prop->name, LOWERCASE DIGITS "-") != strlen(prop->name))
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL(c, dti, node, "aliases property name must include only lowercase and '-'");
|
2017-12-12 23:46:28 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
WARNING(alias_paths, check_alias_paths, NULL);
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void fixup_addr_size_cells(struct check *c, struct dt_info *dti,
|
2007-12-07 04:05:55 +01:00
|
|
|
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);
|
|
|
|
}
|
2013-10-27 12:23:45 +01:00
|
|
|
WARNING(addr_size_cells, fixup_addr_size_cells, NULL,
|
2012-07-08 15:25:21 +02:00
|
|
|
&address_cells_is_cell, &size_cells_is_cell);
|
2007-12-07 04:05:55 +01:00
|
|
|
|
|
|
|
#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)
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_reg_format(struct check *c, struct dt_info *dti,
|
2007-12-07 04:05:55 +01:00
|
|
|
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) {
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "Root node has a \"reg\" property");
|
2007-12-07 04:05:55 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (prop->val.len == 0)
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "property is empty");
|
2007-12-07 04:05:55 +01:00
|
|
|
|
|
|
|
addr_cells = node_addr_cells(node->parent);
|
|
|
|
size_cells = node_size_cells(node->parent);
|
|
|
|
entrylen = (addr_cells + size_cells) * sizeof(cell_t);
|
|
|
|
|
2015-04-29 21:02:24 +02:00
|
|
|
if (!entrylen || (prop->val.len % entrylen) != 0)
|
2018-01-31 15:57:04 +01:00
|
|
|
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);
|
2007-12-07 04:05:55 +01:00
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
WARNING(reg_format, check_reg_format, NULL, &addr_size_cells);
|
2007-12-07 04:05:55 +01:00
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_ranges_format(struct check *c, struct dt_info *dti,
|
2007-12-07 04:05:55 +01:00
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
int c_addr_cells, p_addr_cells, c_size_cells, p_size_cells, entrylen;
|
|
|
|
|
|
|
|
prop = get_property(node, "ranges");
|
|
|
|
if (!prop)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!node->parent) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "Root node has a \"ranges\" property");
|
2007-12-07 04:05:55 +01:00
|
|
|
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)
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "empty \"ranges\" property but its "
|
|
|
|
"#address-cells (%d) differs from %s (%d)",
|
|
|
|
c_addr_cells, node->parent->fullpath,
|
|
|
|
p_addr_cells);
|
2007-12-07 04:05:55 +01:00
|
|
|
if (p_size_cells != c_size_cells)
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "empty \"ranges\" property but its "
|
|
|
|
"#size-cells (%d) differs from %s (%d)",
|
|
|
|
c_size_cells, node->parent->fullpath,
|
|
|
|
p_size_cells);
|
2007-12-07 04:05:55 +01:00
|
|
|
} else if ((prop->val.len % entrylen) != 0) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "\"ranges\" property has invalid length (%d bytes) "
|
|
|
|
"(parent #address-cells == %d, child #address-cells == %d, "
|
|
|
|
"#size-cells == %d)", prop->val.len,
|
|
|
|
p_addr_cells, c_addr_cells, c_size_cells);
|
2007-12-07 04:05:55 +01:00
|
|
|
}
|
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
WARNING(ranges_format, check_ranges_format, NULL, &addr_size_cells);
|
2007-12-07 04:05:55 +01:00
|
|
|
|
2017-03-20 15:44:16 +01:00
|
|
|
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;
|
|
|
|
|
2017-10-29 22:54:09 +01:00
|
|
|
if (!strprefixeq(node->name, node->basenamelen, "pci") &&
|
|
|
|
!strprefixeq(node->name, node->basenamelen, "pcie"))
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "node name is not \"pci\" or \"pcie\"");
|
2017-03-20 15:44:16 +01:00
|
|
|
|
|
|
|
prop = get_property(node, "ranges");
|
|
|
|
if (!prop)
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "missing ranges for PCI bridge (or not a bridge)");
|
2017-03-20 15:44:16 +01:00
|
|
|
|
|
|
|
if (node_addr_cells(node) != 3)
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "incorrect #address-cells for PCI bridge");
|
2017-03-20 15:44:16 +01:00
|
|
|
if (node_size_cells(node) != 2)
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "incorrect #size-cells for PCI bridge");
|
2017-03-20 15:44:16 +01:00
|
|
|
|
|
|
|
prop = get_property(node, "bus-range");
|
2018-04-20 15:08:23 +02:00
|
|
|
if (!prop)
|
2017-03-20 15:44:16 +01:00
|
|
|
return;
|
2018-04-20 15:08:23 +02:00
|
|
|
|
2017-03-20 15:44:16 +01:00
|
|
|
if (prop->val.len != (sizeof(cell_t) * 2)) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "value must be 2 cells");
|
2017-03-20 15:44:16 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
cells = (cell_t *)prop->val.val;
|
|
|
|
if (fdt32_to_cpu(cells[0]) > fdt32_to_cpu(cells[1]))
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "1st cell must be less than or equal to 2nd cell");
|
2017-03-20 15:44:16 +01:00
|
|
|
if (fdt32_to_cpu(cells[1]) > 0xff)
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "maximum bus number must be less than 256");
|
2017-03-20 15:44:16 +01:00
|
|
|
}
|
|
|
|
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))
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "PCI bus number %d out of range, expected (%d - %d)",
|
|
|
|
bus_num, min_bus, max_bus);
|
2017-03-20 15:44:16 +01:00
|
|
|
}
|
|
|
|
WARNING(pci_device_bus_num, check_pci_device_bus_num, NULL, ®_format, &pci_bridge);
|
|
|
|
|
|
|
|
static void check_pci_device_reg(struct check *c, struct dt_info *dti, struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
const char *unitname = get_unitname(node);
|
|
|
|
char unit_addr[5];
|
|
|
|
unsigned int dev, func, reg;
|
|
|
|
cell_t *cells;
|
|
|
|
|
|
|
|
if (!node->parent || (node->parent->bus != &pci_bus))
|
|
|
|
return;
|
|
|
|
|
|
|
|
prop = get_property(node, "reg");
|
|
|
|
if (!prop) {
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "missing PCI reg property");
|
2017-03-20 15:44:16 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
cells = (cell_t *)prop->val.val;
|
|
|
|
if (cells[1] || cells[2])
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "PCI reg config space address cells 2 and 3 must be 0");
|
2017-03-20 15:44:16 +01:00
|
|
|
|
|
|
|
reg = fdt32_to_cpu(cells[0]);
|
|
|
|
dev = (reg & 0xf800) >> 11;
|
|
|
|
func = (reg & 0x700) >> 8;
|
|
|
|
|
|
|
|
if (reg & 0xff000000)
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "PCI reg address is not configuration space");
|
2017-03-20 15:44:16 +01:00
|
|
|
if (reg & 0x000000ff)
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "PCI reg config space address register number must be 0");
|
2017-03-20 15:44:16 +01:00
|
|
|
|
|
|
|
if (func == 0) {
|
|
|
|
snprintf(unit_addr, sizeof(unit_addr), "%x", dev);
|
|
|
|
if (streq(unitname, unit_addr))
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
snprintf(unit_addr, sizeof(unit_addr), "%x,%x", dev, func);
|
|
|
|
if (streq(unitname, unit_addr))
|
|
|
|
return;
|
|
|
|
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "PCI unit address format error, expected \"%s\"",
|
|
|
|
unit_addr);
|
2017-03-20 15:44:16 +01:00
|
|
|
}
|
|
|
|
WARNING(pci_device_reg, check_pci_device_reg, NULL, ®_format, &pci_bridge);
|
|
|
|
|
2017-03-20 15:44:17 +01:00
|
|
|
static const struct bus_type simple_bus = {
|
|
|
|
.name = "simple-bus",
|
|
|
|
};
|
|
|
|
|
|
|
|
static bool node_is_compatible(struct node *node, const char *compat)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
const char *str, *end;
|
|
|
|
|
|
|
|
prop = get_property(node, "compatible");
|
|
|
|
if (!prop)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for (str = prop->val.val, end = str + prop->val.len; str < end;
|
|
|
|
str += strnlen(str, end - str) + 1) {
|
2018-09-20 23:30:03 +02:00
|
|
|
if (streq(str, compat))
|
2017-03-20 15:44:17 +01:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void check_simple_bus_bridge(struct check *c, struct dt_info *dti, struct node *node)
|
|
|
|
{
|
|
|
|
if (node_is_compatible(node, "simple-bus"))
|
|
|
|
node->bus = &simple_bus;
|
|
|
|
}
|
2018-09-20 23:30:03 +02:00
|
|
|
WARNING(simple_bus_bridge, check_simple_bus_bridge, NULL,
|
|
|
|
&addr_size_cells, &compatible_is_string_list);
|
2017-03-20 15:44:17 +01:00
|
|
|
|
|
|
|
static void check_simple_bus_reg(struct check *c, struct dt_info *dti, struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
const char *unitname = get_unitname(node);
|
|
|
|
char unit_addr[17];
|
|
|
|
unsigned int size;
|
|
|
|
uint64_t reg = 0;
|
|
|
|
cell_t *cells = NULL;
|
|
|
|
|
|
|
|
if (!node->parent || (node->parent->bus != &simple_bus))
|
|
|
|
return;
|
|
|
|
|
|
|
|
prop = get_property(node, "reg");
|
|
|
|
if (prop)
|
|
|
|
cells = (cell_t *)prop->val.val;
|
|
|
|
else {
|
|
|
|
prop = get_property(node, "ranges");
|
|
|
|
if (prop && prop->val.len)
|
|
|
|
/* skip of child address */
|
|
|
|
cells = ((cell_t *)prop->val.val) + node_addr_cells(node);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!cells) {
|
|
|
|
if (node->parent->parent && !(node->bus == &simple_bus))
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "missing or empty reg/ranges property");
|
2017-03-20 15:44:17 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
size = node_addr_cells(node->parent);
|
|
|
|
while (size--)
|
|
|
|
reg = (reg << 32) | fdt32_to_cpu(*(cells++));
|
|
|
|
|
2017-06-08 06:35:16 +02:00
|
|
|
snprintf(unit_addr, sizeof(unit_addr), "%"PRIx64, reg);
|
2017-03-20 15:44:17 +01:00
|
|
|
if (!streq(unitname, unit_addr))
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "simple-bus unit address format error, expected \"%s\"",
|
|
|
|
unit_addr);
|
2017-03-20 15:44:17 +01:00
|
|
|
}
|
|
|
|
WARNING(simple_bus_reg, check_simple_bus_reg, NULL, ®_format, &simple_bus_bridge);
|
|
|
|
|
2018-07-27 05:19:31 +02:00
|
|
|
static const struct bus_type i2c_bus = {
|
|
|
|
.name = "i2c-bus",
|
|
|
|
};
|
|
|
|
|
|
|
|
static void check_i2c_bus_bridge(struct check *c, struct dt_info *dti, struct node *node)
|
|
|
|
{
|
|
|
|
if (strprefixeq(node->name, node->basenamelen, "i2c-bus") ||
|
|
|
|
strprefixeq(node->name, node->basenamelen, "i2c-arb")) {
|
|
|
|
node->bus = &i2c_bus;
|
|
|
|
} else if (strprefixeq(node->name, node->basenamelen, "i2c")) {
|
|
|
|
struct node *child;
|
|
|
|
for_each_child(node, child) {
|
|
|
|
if (strprefixeq(child->name, node->basenamelen, "i2c-bus"))
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
node->bus = &i2c_bus;
|
|
|
|
} else
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!node->children)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (node_addr_cells(node) != 1)
|
|
|
|
FAIL(c, dti, node, "incorrect #address-cells for I2C bus");
|
|
|
|
if (node_size_cells(node) != 0)
|
|
|
|
FAIL(c, dti, node, "incorrect #size-cells for I2C bus");
|
|
|
|
|
|
|
|
}
|
|
|
|
WARNING(i2c_bus_bridge, check_i2c_bus_bridge, NULL, &addr_size_cells);
|
|
|
|
|
|
|
|
static void check_i2c_bus_reg(struct check *c, struct dt_info *dti, struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
const char *unitname = get_unitname(node);
|
|
|
|
char unit_addr[17];
|
|
|
|
uint32_t reg = 0;
|
|
|
|
int len;
|
|
|
|
cell_t *cells = NULL;
|
|
|
|
|
|
|
|
if (!node->parent || (node->parent->bus != &i2c_bus))
|
|
|
|
return;
|
|
|
|
|
|
|
|
prop = get_property(node, "reg");
|
|
|
|
if (prop)
|
|
|
|
cells = (cell_t *)prop->val.val;
|
|
|
|
|
|
|
|
if (!cells) {
|
|
|
|
FAIL(c, dti, node, "missing or empty reg property");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
reg = fdt32_to_cpu(*cells);
|
|
|
|
snprintf(unit_addr, sizeof(unit_addr), "%x", reg);
|
|
|
|
if (!streq(unitname, unit_addr))
|
|
|
|
FAIL(c, dti, node, "I2C bus unit address format error, expected \"%s\"",
|
|
|
|
unit_addr);
|
|
|
|
|
|
|
|
for (len = prop->val.len; len > 0; len -= 4) {
|
|
|
|
reg = fdt32_to_cpu(*(cells++));
|
|
|
|
if (reg > 0x3ff)
|
|
|
|
FAIL_PROP(c, dti, node, prop, "I2C address must be less than 10-bits, got \"0x%x\"",
|
|
|
|
reg);
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
WARNING(i2c_bus_reg, check_i2c_bus_reg, NULL, ®_format, &i2c_bus_bridge);
|
|
|
|
|
2018-07-27 05:19:32 +02:00
|
|
|
static const struct bus_type spi_bus = {
|
|
|
|
.name = "spi-bus",
|
|
|
|
};
|
|
|
|
|
|
|
|
static void check_spi_bus_bridge(struct check *c, struct dt_info *dti, struct node *node)
|
|
|
|
{
|
2018-11-13 23:40:10 +01:00
|
|
|
int spi_addr_cells = 1;
|
2018-07-27 05:19:32 +02:00
|
|
|
|
|
|
|
if (strprefixeq(node->name, node->basenamelen, "spi")) {
|
|
|
|
node->bus = &spi_bus;
|
|
|
|
} else {
|
|
|
|
/* Try to detect SPI buses which don't have proper node name */
|
|
|
|
struct node *child;
|
|
|
|
|
|
|
|
if (node_addr_cells(node) != 1 || node_size_cells(node) != 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_child(node, child) {
|
|
|
|
struct property *prop;
|
|
|
|
for_each_property(child, prop) {
|
|
|
|
if (strprefixeq(prop->name, 4, "spi-")) {
|
|
|
|
node->bus = &spi_bus;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (node->bus == &spi_bus)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (node->bus == &spi_bus && get_property(node, "reg"))
|
|
|
|
FAIL(c, dti, node, "node name for SPI buses should be 'spi'");
|
|
|
|
}
|
|
|
|
if (node->bus != &spi_bus || !node->children)
|
|
|
|
return;
|
|
|
|
|
2018-11-13 23:40:10 +01:00
|
|
|
if (get_property(node, "spi-slave"))
|
|
|
|
spi_addr_cells = 0;
|
|
|
|
if (node_addr_cells(node) != spi_addr_cells)
|
2018-07-27 05:19:32 +02:00
|
|
|
FAIL(c, dti, node, "incorrect #address-cells for SPI bus");
|
|
|
|
if (node_size_cells(node) != 0)
|
|
|
|
FAIL(c, dti, node, "incorrect #size-cells for SPI bus");
|
|
|
|
|
|
|
|
}
|
|
|
|
WARNING(spi_bus_bridge, check_spi_bus_bridge, NULL, &addr_size_cells);
|
|
|
|
|
|
|
|
static void check_spi_bus_reg(struct check *c, struct dt_info *dti, struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
const char *unitname = get_unitname(node);
|
|
|
|
char unit_addr[9];
|
|
|
|
uint32_t reg = 0;
|
|
|
|
cell_t *cells = NULL;
|
|
|
|
|
|
|
|
if (!node->parent || (node->parent->bus != &spi_bus))
|
|
|
|
return;
|
|
|
|
|
2018-11-13 23:40:10 +01:00
|
|
|
if (get_property(node->parent, "spi-slave"))
|
|
|
|
return;
|
|
|
|
|
2018-07-27 05:19:32 +02:00
|
|
|
prop = get_property(node, "reg");
|
|
|
|
if (prop)
|
|
|
|
cells = (cell_t *)prop->val.val;
|
|
|
|
|
|
|
|
if (!cells) {
|
|
|
|
FAIL(c, dti, node, "missing or empty reg property");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
reg = fdt32_to_cpu(*cells);
|
|
|
|
snprintf(unit_addr, sizeof(unit_addr), "%x", reg);
|
|
|
|
if (!streq(unitname, unit_addr))
|
|
|
|
FAIL(c, dti, node, "SPI bus unit address format error, expected \"%s\"",
|
|
|
|
unit_addr);
|
|
|
|
}
|
|
|
|
WARNING(spi_bus_reg, check_spi_bus_reg, NULL, ®_format, &spi_bus_bridge);
|
|
|
|
|
2017-03-20 15:44:18 +01:00
|
|
|
static void check_unit_address_format(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
const char *unitname = get_unitname(node);
|
|
|
|
|
|
|
|
if (node->parent && node->parent->bus)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!unitname[0])
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!strncmp(unitname, "0x", 2)) {
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "unit name should not have leading \"0x\"");
|
2017-03-20 15:44:18 +01:00
|
|
|
/* skip over 0x for next test */
|
|
|
|
unitname += 2;
|
|
|
|
}
|
|
|
|
if (unitname[0] == '0' && isxdigit(unitname[1]))
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "unit name should not have leading 0s");
|
2017-03-20 15:44:18 +01:00
|
|
|
}
|
|
|
|
WARNING(unit_address_format, check_unit_address_format, NULL,
|
|
|
|
&node_name_format, &pci_bridge, &simple_bus_bridge);
|
|
|
|
|
2007-12-07 04:05:55 +01:00
|
|
|
/*
|
|
|
|
* Style checks
|
|
|
|
*/
|
2016-05-31 03:58:42 +02:00
|
|
|
static void check_avoid_default_addr_size(struct check *c, struct dt_info *dti,
|
2007-12-07 04:05:55 +01:00
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct property *reg, *ranges;
|
|
|
|
|
|
|
|
if (!node->parent)
|
|
|
|
return; /* Ignore root node */
|
|
|
|
|
|
|
|
reg = get_property(node, "reg");
|
|
|
|
ranges = get_property(node, "ranges");
|
|
|
|
|
|
|
|
if (!reg && !ranges)
|
|
|
|
return;
|
|
|
|
|
2014-10-18 00:22:11 +02:00
|
|
|
if (node->parent->addr_cells == -1)
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "Relying on default #address-cells value");
|
2007-12-07 04:05:55 +01:00
|
|
|
|
2014-10-18 00:22:11 +02:00
|
|
|
if (node->parent->size_cells == -1)
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "Relying on default #size-cells value");
|
2007-12-07 04:05:55 +01:00
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
WARNING(avoid_default_addr_size, check_avoid_default_addr_size, NULL,
|
|
|
|
&addr_size_cells);
|
2007-12-07 04:05:55 +01:00
|
|
|
|
2017-12-12 23:46:27 +01:00
|
|
|
static void check_avoid_unnecessary_addr_size(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
struct node *child;
|
|
|
|
bool has_reg = false;
|
|
|
|
|
|
|
|
if (!node->parent || node->addr_cells < 0 || node->size_cells < 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (get_property(node, "ranges") || !node->children)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_child(node, child) {
|
|
|
|
prop = get_property(child, "reg");
|
|
|
|
if (prop)
|
|
|
|
has_reg = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!has_reg)
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "unnecessary #address-cells/#size-cells without \"ranges\" or child \"reg\" property");
|
2017-12-12 23:46:27 +01:00
|
|
|
}
|
|
|
|
WARNING(avoid_unnecessary_addr_size, check_avoid_unnecessary_addr_size, NULL, &avoid_default_addr_size);
|
|
|
|
|
2018-12-13 20:30:14 +01:00
|
|
|
static bool node_is_disabled(struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
|
|
|
|
prop = get_property(node, "status");
|
|
|
|
if (prop) {
|
|
|
|
char *str = prop->val.val;
|
|
|
|
if (streq("disabled", str))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void check_unique_unit_address_common(struct check *c,
|
|
|
|
struct dt_info *dti,
|
|
|
|
struct node *node,
|
|
|
|
bool disable_check)
|
2018-03-07 01:49:15 +01:00
|
|
|
{
|
|
|
|
struct node *childa;
|
|
|
|
|
|
|
|
if (node->addr_cells < 0 || node->size_cells < 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!node->children)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_child(node, childa) {
|
|
|
|
struct node *childb;
|
|
|
|
const char *addr_a = get_unitname(childa);
|
|
|
|
|
|
|
|
if (!strlen(addr_a))
|
|
|
|
continue;
|
|
|
|
|
2018-12-13 20:30:14 +01:00
|
|
|
if (disable_check && node_is_disabled(childa))
|
|
|
|
continue;
|
|
|
|
|
2018-03-07 01:49:15 +01:00
|
|
|
for_each_child(node, childb) {
|
|
|
|
const char *addr_b = get_unitname(childb);
|
|
|
|
if (childa == childb)
|
|
|
|
break;
|
|
|
|
|
2018-12-13 20:30:14 +01:00
|
|
|
if (disable_check && node_is_disabled(childb))
|
|
|
|
continue;
|
|
|
|
|
2018-03-07 01:49:15 +01:00
|
|
|
if (streq(addr_a, addr_b))
|
|
|
|
FAIL(c, dti, childb, "duplicate unit-address (also used in node %s)", childa->fullpath);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2018-12-13 20:30:14 +01:00
|
|
|
|
|
|
|
static void check_unique_unit_address(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
check_unique_unit_address_common(c, dti, node, false);
|
|
|
|
}
|
2018-03-07 01:49:15 +01:00
|
|
|
WARNING(unique_unit_address, check_unique_unit_address, NULL, &avoid_default_addr_size);
|
|
|
|
|
2018-12-13 20:30:14 +01:00
|
|
|
static void check_unique_unit_address_if_enabled(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
check_unique_unit_address_common(c, dti, node, true);
|
|
|
|
}
|
|
|
|
CHECK_ENTRY(unique_unit_address_if_enabled, check_unique_unit_address_if_enabled,
|
|
|
|
NULL, false, false, &avoid_default_addr_size);
|
|
|
|
|
2007-12-07 04:06:11 +01:00
|
|
|
static void check_obsolete_chosen_interrupt_controller(struct check *c,
|
2016-05-31 03:58:42 +02:00
|
|
|
struct dt_info *dti,
|
2013-10-27 09:18:06 +01:00
|
|
|
struct node *node)
|
2007-12-07 04:06:11 +01:00
|
|
|
{
|
2016-05-31 03:58:42 +02:00
|
|
|
struct node *dt = dti->dt;
|
2007-12-07 04:06:11 +01:00
|
|
|
struct node *chosen;
|
|
|
|
struct property *prop;
|
|
|
|
|
2013-10-27 09:18:06 +01:00
|
|
|
if (node != dt)
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
2007-12-07 04:06:11 +01:00
|
|
|
chosen = get_node_by_path(dt, "/chosen");
|
|
|
|
if (!chosen)
|
|
|
|
return;
|
|
|
|
|
|
|
|
prop = get_property(chosen, "interrupt-controller");
|
|
|
|
if (prop)
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop,
|
|
|
|
"/chosen has obsolete \"interrupt-controller\" property");
|
2007-12-07 04:06:11 +01:00
|
|
|
}
|
2013-11-01 13:57:17 +01:00
|
|
|
WARNING(obsolete_chosen_interrupt_controller,
|
|
|
|
check_obsolete_chosen_interrupt_controller, NULL);
|
2007-12-07 04:06:11 +01:00
|
|
|
|
2017-12-14 23:40:01 +01:00
|
|
|
static void check_chosen_node_is_root(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
if (!streq(node->name, "chosen"))
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (node->parent != dti->dt)
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "chosen node must be at root node");
|
2017-12-14 23:40:01 +01:00
|
|
|
}
|
|
|
|
WARNING(chosen_node_is_root, check_chosen_node_is_root, NULL);
|
|
|
|
|
|
|
|
static void check_chosen_node_bootargs(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
|
|
|
|
if (!streq(node->name, "chosen"))
|
|
|
|
return;
|
|
|
|
|
|
|
|
prop = get_property(node, "bootargs");
|
|
|
|
if (!prop)
|
|
|
|
return;
|
|
|
|
|
|
|
|
c->data = prop->name;
|
|
|
|
check_is_string(c, dti, node);
|
|
|
|
}
|
|
|
|
WARNING(chosen_node_bootargs, check_chosen_node_bootargs, NULL);
|
|
|
|
|
|
|
|
static void check_chosen_node_stdout_path(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
|
|
|
|
if (!streq(node->name, "chosen"))
|
|
|
|
return;
|
|
|
|
|
|
|
|
prop = get_property(node, "stdout-path");
|
|
|
|
if (!prop) {
|
|
|
|
prop = get_property(node, "linux,stdout-path");
|
|
|
|
if (!prop)
|
|
|
|
return;
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop, "Use 'stdout-path' instead");
|
2017-12-14 23:40:01 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
c->data = prop->name;
|
|
|
|
check_is_string(c, dti, node);
|
|
|
|
}
|
|
|
|
WARNING(chosen_node_stdout_path, check_chosen_node_stdout_path, NULL);
|
|
|
|
|
2017-09-01 20:53:01 +02:00
|
|
|
struct provider {
|
|
|
|
const char *prop_name;
|
|
|
|
const char *cell_name;
|
|
|
|
bool optional;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void check_property_phandle_args(struct check *c,
|
|
|
|
struct dt_info *dti,
|
|
|
|
struct node *node,
|
|
|
|
struct property *prop,
|
|
|
|
const struct provider *provider)
|
|
|
|
{
|
|
|
|
struct node *root = dti->dt;
|
|
|
|
int cell, cellsize = 0;
|
|
|
|
|
|
|
|
if (prop->val.len % sizeof(cell_t)) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop,
|
|
|
|
"property size (%d) is invalid, expected multiple of %zu",
|
|
|
|
prop->val.len, sizeof(cell_t));
|
2017-09-01 20:53:01 +02:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (cell = 0; cell < prop->val.len / sizeof(cell_t); cell += cellsize + 1) {
|
|
|
|
struct node *provider_node;
|
|
|
|
struct property *cellprop;
|
|
|
|
int phandle;
|
|
|
|
|
|
|
|
phandle = propval_cell_n(prop, cell);
|
|
|
|
/*
|
|
|
|
* Some bindings use a cell value 0 or -1 to skip over optional
|
|
|
|
* entries when each index position has a specific definition.
|
|
|
|
*/
|
|
|
|
if (phandle == 0 || phandle == -1) {
|
2017-10-18 23:29:14 +02:00
|
|
|
/* Give up if this is an overlay with external references */
|
|
|
|
if (dti->dtsflags & DTSF_PLUGIN)
|
|
|
|
break;
|
|
|
|
|
2017-09-01 20:53:01 +02:00
|
|
|
cellsize = 0;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* If we have markers, verify the current cell is a phandle */
|
|
|
|
if (prop->val.markers) {
|
|
|
|
struct marker *m = prop->val.markers;
|
|
|
|
for_each_marker_of_type(m, REF_PHANDLE) {
|
|
|
|
if (m->offset == (cell * sizeof(cell_t)))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!m)
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop,
|
|
|
|
"cell %d is not a phandle reference",
|
|
|
|
cell);
|
2017-09-01 20:53:01 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
provider_node = get_node_by_phandle(root, phandle);
|
|
|
|
if (!provider_node) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop,
|
|
|
|
"Could not get phandle node for (cell %d)",
|
|
|
|
cell);
|
2017-09-01 20:53:01 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
cellprop = get_property(provider_node, provider->cell_name);
|
|
|
|
if (cellprop) {
|
|
|
|
cellsize = propval_cell(cellprop);
|
|
|
|
} else if (provider->optional) {
|
|
|
|
cellsize = 0;
|
|
|
|
} else {
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "Missing property '%s' in node %s or bad phandle (referred from %s[%d])",
|
2017-09-01 20:53:01 +02:00
|
|
|
provider->cell_name,
|
|
|
|
provider_node->fullpath,
|
2018-01-31 15:57:03 +01:00
|
|
|
prop->name, cell);
|
2017-09-01 20:53:01 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (prop->val.len < ((cell + cellsize + 1) * sizeof(cell_t))) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop,
|
|
|
|
"property size (%d) too small for cell size %d",
|
|
|
|
prop->val.len, cellsize);
|
2017-09-01 20:53:01 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void check_provider_cells_property(struct check *c,
|
|
|
|
struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct provider *provider = c->data;
|
|
|
|
struct property *prop;
|
|
|
|
|
|
|
|
prop = get_property(node, provider->prop_name);
|
|
|
|
if (!prop)
|
|
|
|
return;
|
|
|
|
|
|
|
|
check_property_phandle_args(c, dti, node, prop, provider);
|
|
|
|
}
|
|
|
|
#define WARNING_PROPERTY_PHANDLE_CELLS(nm, propname, cells_name, ...) \
|
|
|
|
static struct provider nm##_provider = { (propname), (cells_name), __VA_ARGS__ }; \
|
|
|
|
WARNING(nm##_property, check_provider_cells_property, &nm##_provider, &phandle_references);
|
|
|
|
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(clocks, "clocks", "#clock-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(cooling_device, "cooling-device", "#cooling-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(dmas, "dmas", "#dma-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(hwlocks, "hwlocks", "#hwlock-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(interrupts_extended, "interrupts-extended", "#interrupt-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(io_channels, "io-channels", "#io-channel-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(iommus, "iommus", "#iommu-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(mboxes, "mboxes", "#mbox-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(msi_parent, "msi-parent", "#msi-cells", true);
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(mux_controls, "mux-controls", "#mux-control-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(phys, "phys", "#phy-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(power_domains, "power-domains", "#power-domain-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(pwms, "pwms", "#pwm-cells");
|
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(resets, "resets", "#reset-cells");
|
2017-12-04 10:07:23 +01:00
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(sound_dai, "sound-dai", "#sound-dai-cells");
|
2017-09-01 20:53:01 +02:00
|
|
|
WARNING_PROPERTY_PHANDLE_CELLS(thermal_sensors, "thermal-sensors", "#thermal-sensor-cells");
|
|
|
|
|
2017-09-01 20:53:02 +02:00
|
|
|
static bool prop_is_gpio(struct property *prop)
|
|
|
|
{
|
|
|
|
char *str;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* *-gpios and *-gpio can appear in property names,
|
|
|
|
* so skip over any false matches (only one known ATM)
|
|
|
|
*/
|
|
|
|
if (strstr(prop->name, "nr-gpio"))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
str = strrchr(prop->name, '-');
|
|
|
|
if (str)
|
|
|
|
str++;
|
|
|
|
else
|
|
|
|
str = prop->name;
|
|
|
|
if (!(streq(str, "gpios") || streq(str, "gpio")))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void check_gpios_property(struct check *c,
|
|
|
|
struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
|
|
|
|
/* Skip GPIO hog nodes which have 'gpios' property */
|
|
|
|
if (get_property(node, "gpio-hog"))
|
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_property(node, prop) {
|
|
|
|
struct provider provider;
|
|
|
|
|
|
|
|
if (!prop_is_gpio(prop))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
provider.prop_name = prop->name;
|
|
|
|
provider.cell_name = "#gpio-cells";
|
|
|
|
provider.optional = false;
|
|
|
|
check_property_phandle_args(c, dti, node, prop, &provider);
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
WARNING(gpios_property, check_gpios_property, NULL, &phandle_references);
|
|
|
|
|
|
|
|
static void check_deprecated_gpio_property(struct check *c,
|
|
|
|
struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
|
|
|
|
for_each_property(node, prop) {
|
|
|
|
char *str;
|
|
|
|
|
|
|
|
if (!prop_is_gpio(prop))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
str = strstr(prop->name, "gpio");
|
|
|
|
if (!streq(str, "gpio"))
|
|
|
|
continue;
|
|
|
|
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop,
|
|
|
|
"'[*-]gpio' is deprecated, use '[*-]gpios' instead");
|
2017-09-01 20:53:02 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
CHECK(deprecated_gpio_property, check_deprecated_gpio_property, NULL);
|
|
|
|
|
2017-09-01 20:53:03 +02:00
|
|
|
static bool node_is_interrupt_provider(struct node *node)
|
|
|
|
{
|
|
|
|
struct property *prop;
|
|
|
|
|
|
|
|
prop = get_property(node, "interrupt-controller");
|
|
|
|
if (prop)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
prop = get_property(node, "interrupt-map");
|
|
|
|
if (prop)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
static void check_interrupts_property(struct check *c,
|
|
|
|
struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct node *root = dti->dt;
|
|
|
|
struct node *irq_node = NULL, *parent = node;
|
|
|
|
struct property *irq_prop, *prop = NULL;
|
|
|
|
int irq_cells, phandle;
|
|
|
|
|
|
|
|
irq_prop = get_property(node, "interrupts");
|
|
|
|
if (!irq_prop)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (irq_prop->val.len % sizeof(cell_t))
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, irq_prop, "size (%d) is invalid, expected multiple of %zu",
|
|
|
|
irq_prop->val.len, sizeof(cell_t));
|
2017-09-01 20:53:03 +02:00
|
|
|
|
|
|
|
while (parent && !prop) {
|
|
|
|
if (parent != node && node_is_interrupt_provider(parent)) {
|
|
|
|
irq_node = parent;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
prop = get_property(parent, "interrupt-parent");
|
|
|
|
if (prop) {
|
|
|
|
phandle = propval_cell(prop);
|
2019-05-06 09:00:07 +02:00
|
|
|
if ((phandle == 0) || (phandle == -1)) {
|
|
|
|
/* Give up if this is an overlay with
|
|
|
|
* external references */
|
|
|
|
if (dti->dtsflags & DTSF_PLUGIN)
|
2017-10-18 23:29:14 +02:00
|
|
|
return;
|
2019-05-06 09:00:07 +02:00
|
|
|
FAIL_PROP(c, dti, parent, prop, "Invalid phandle");
|
|
|
|
continue;
|
|
|
|
}
|
2017-10-18 23:29:14 +02:00
|
|
|
|
2017-09-01 20:53:03 +02:00
|
|
|
irq_node = get_node_by_phandle(root, phandle);
|
|
|
|
if (!irq_node) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, parent, prop, "Bad phandle");
|
2017-09-01 20:53:03 +02:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (!node_is_interrupt_provider(irq_node))
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, irq_node,
|
|
|
|
"Missing interrupt-controller or interrupt-map property");
|
2017-09-01 20:53:03 +02:00
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
parent = parent->parent;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!irq_node) {
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, node, "Missing interrupt-parent");
|
2017-09-01 20:53:03 +02:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
prop = get_property(irq_node, "#interrupt-cells");
|
|
|
|
if (!prop) {
|
2018-01-31 15:57:03 +01:00
|
|
|
FAIL(c, dti, irq_node, "Missing #interrupt-cells in interrupt-parent");
|
2017-09-01 20:53:03 +02:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
irq_cells = propval_cell(prop);
|
|
|
|
if (irq_prop->val.len % (irq_cells * sizeof(cell_t))) {
|
2018-01-31 15:57:04 +01:00
|
|
|
FAIL_PROP(c, dti, node, prop,
|
|
|
|
"size is (%d), expected multiple of %d",
|
|
|
|
irq_prop->val.len, (int)(irq_cells * sizeof(cell_t)));
|
2017-09-01 20:53:03 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
WARNING(interrupts_property, check_interrupts_property, &phandle_references);
|
|
|
|
|
2018-02-14 00:00:59 +01:00
|
|
|
static const struct bus_type graph_port_bus = {
|
|
|
|
.name = "graph-port",
|
|
|
|
};
|
|
|
|
|
|
|
|
static const struct bus_type graph_ports_bus = {
|
|
|
|
.name = "graph-ports",
|
|
|
|
};
|
|
|
|
|
|
|
|
static void check_graph_nodes(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct node *child;
|
|
|
|
|
|
|
|
for_each_child(node, child) {
|
|
|
|
if (!(strprefixeq(child->name, child->basenamelen, "endpoint") ||
|
|
|
|
get_property(child, "remote-endpoint")))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
node->bus = &graph_port_bus;
|
|
|
|
|
|
|
|
/* The parent of 'port' nodes can be either 'ports' or a device */
|
|
|
|
if (!node->parent->bus &&
|
|
|
|
(streq(node->parent->name, "ports") || get_property(node, "reg")))
|
|
|
|
node->parent->bus = &graph_ports_bus;
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
WARNING(graph_nodes, check_graph_nodes, NULL);
|
|
|
|
|
|
|
|
static void check_graph_child_address(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
int cnt = 0;
|
|
|
|
struct node *child;
|
|
|
|
|
|
|
|
if (node->bus != &graph_ports_bus && node->bus != &graph_port_bus)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_child(node, child) {
|
|
|
|
struct property *prop = get_property(child, "reg");
|
|
|
|
|
|
|
|
/* No error if we have any non-zero unit address */
|
|
|
|
if (prop && propval_cell(prop) != 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
cnt++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cnt == 1 && node->addr_cells != -1)
|
|
|
|
FAIL(c, dti, node, "graph node has single child node '%s', #address-cells/#size-cells are not necessary",
|
|
|
|
node->children->name);
|
|
|
|
}
|
|
|
|
WARNING(graph_child_address, check_graph_child_address, NULL, &graph_nodes);
|
|
|
|
|
|
|
|
static void check_graph_reg(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
char unit_addr[9];
|
|
|
|
const char *unitname = get_unitname(node);
|
|
|
|
struct property *prop;
|
|
|
|
|
|
|
|
prop = get_property(node, "reg");
|
|
|
|
if (!prop || !unitname)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!(prop->val.val && prop->val.len == sizeof(cell_t))) {
|
|
|
|
FAIL(c, dti, node, "graph node malformed 'reg' property");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
snprintf(unit_addr, sizeof(unit_addr), "%x", propval_cell(prop));
|
|
|
|
if (!streq(unitname, unit_addr))
|
|
|
|
FAIL(c, dti, node, "graph node unit address error, expected \"%s\"",
|
|
|
|
unit_addr);
|
|
|
|
|
|
|
|
if (node->parent->addr_cells != 1)
|
|
|
|
FAIL_PROP(c, dti, node, get_property(node, "#address-cells"),
|
|
|
|
"graph node '#address-cells' is %d, must be 1",
|
|
|
|
node->parent->addr_cells);
|
|
|
|
if (node->parent->size_cells != 0)
|
|
|
|
FAIL_PROP(c, dti, node, get_property(node, "#size-cells"),
|
|
|
|
"graph node '#size-cells' is %d, must be 0",
|
|
|
|
node->parent->size_cells);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void check_graph_port(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
if (node->bus != &graph_port_bus)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!strprefixeq(node->name, node->basenamelen, "port"))
|
|
|
|
FAIL(c, dti, node, "graph port node name should be 'port'");
|
|
|
|
|
|
|
|
check_graph_reg(c, dti, node);
|
|
|
|
}
|
|
|
|
WARNING(graph_port, check_graph_port, NULL, &graph_nodes);
|
|
|
|
|
|
|
|
static struct node *get_remote_endpoint(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *endpoint)
|
|
|
|
{
|
|
|
|
int phandle;
|
|
|
|
struct node *node;
|
|
|
|
struct property *prop;
|
|
|
|
|
|
|
|
prop = get_property(endpoint, "remote-endpoint");
|
|
|
|
if (!prop)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
phandle = propval_cell(prop);
|
|
|
|
/* Give up if this is an overlay with external references */
|
|
|
|
if (phandle == 0 || phandle == -1)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
node = get_node_by_phandle(dti->dt, phandle);
|
|
|
|
if (!node)
|
|
|
|
FAIL_PROP(c, dti, endpoint, prop, "graph phandle is not valid");
|
|
|
|
|
|
|
|
return node;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void check_graph_endpoint(struct check *c, struct dt_info *dti,
|
|
|
|
struct node *node)
|
|
|
|
{
|
|
|
|
struct node *remote_node;
|
|
|
|
|
|
|
|
if (!node->parent || node->parent->bus != &graph_port_bus)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!strprefixeq(node->name, node->basenamelen, "endpoint"))
|
2019-03-11 19:24:20 +01:00
|
|
|
FAIL(c, dti, node, "graph endpoint node name should be 'endpoint'");
|
2018-02-14 00:00:59 +01:00
|
|
|
|
|
|
|
check_graph_reg(c, dti, node);
|
|
|
|
|
|
|
|
remote_node = get_remote_endpoint(c, dti, node);
|
|
|
|
if (!remote_node)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (get_remote_endpoint(c, dti, remote_node) != node)
|
|
|
|
FAIL(c, dti, node, "graph connection to node '%s' is not bidirectional",
|
|
|
|
remote_node->fullpath);
|
|
|
|
}
|
|
|
|
WARNING(graph_endpoint, check_graph_endpoint, NULL, &graph_nodes);
|
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
static struct check *check_table[] = {
|
|
|
|
&duplicate_node_names, &duplicate_property_names,
|
2008-02-27 03:45:13 +01:00
|
|
|
&node_name_chars, &node_name_format, &property_name_chars,
|
2007-12-04 23:40:23 +01:00
|
|
|
&name_is_string, &name_properties,
|
2010-02-23 09:56:41 +01:00
|
|
|
|
|
|
|
&duplicate_label,
|
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
&explicit_phandles,
|
2007-12-05 00:43:50 +01:00
|
|
|
&phandle_references, &path_references,
|
dtc: add ability to make nodes conditional on them being referenced
A number of platforms have a need to reduce the number of DT nodes,
mostly because of two similar constraints: the size of the DT blob, and
the time it takes to parse it.
As the DT is used in more and more SoCs, and by more projects, some
constraints start to appear in bootloaders running from SRAM with an
order of magnitude of 10kB. A typical DT is in the same order of
magnitude, so any effort to reduce the blob size is welcome in such an
environment.
Some platforms also want to reach very fast boot time, and the time it
takes to parse a typical DT starts to be noticeable.
Both of these issues can be mitigated by reducing the number of nodes in
the DT. The biggest provider of nodes is usually the pin controller and
its subnodes, usually one for each valid pin configuration in a given
SoC.
Obviously, a single, fixed, set of these nodes will be used by a given
board, so we can introduce a node property that will tell the DT
compiler to drop the nodes when they are not referenced in the tree, and
as such wouldn't be useful in the targetted system.
Signed-off-by: Maxime Ripard <maxime.ripard@bootlin.com>
Reviewed-by: Rob Herring <robh@kernel.org>
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2018-05-03 22:27:26 +02:00
|
|
|
&omit_unused_nodes,
|
2007-12-06 06:59:45 +01:00
|
|
|
|
|
|
|
&address_cells_is_cell, &size_cells_is_cell, &interrupt_cells_is_cell,
|
2007-12-06 07:01:07 +01:00
|
|
|
&device_type_is_string, &model_is_string, &status_is_string,
|
2017-12-12 23:46:24 +01:00
|
|
|
&label_is_string,
|
2007-12-07 04:05:55 +01:00
|
|
|
|
2017-12-12 23:46:26 +01:00
|
|
|
&compatible_is_string_list, &names_is_string_list,
|
2017-12-12 23:46:25 +01:00
|
|
|
|
2017-02-10 17:47:14 +01:00
|
|
|
&property_name_chars_strict,
|
2017-02-10 17:47:15 +01:00
|
|
|
&node_name_chars_strict,
|
2017-02-10 17:47:14 +01:00
|
|
|
|
2007-12-07 04:05:55 +01:00
|
|
|
&addr_size_cells, ®_format, &ranges_format,
|
|
|
|
|
2016-02-19 05:59:29 +01:00
|
|
|
&unit_address_vs_reg,
|
2017-03-20 15:44:18 +01:00
|
|
|
&unit_address_format,
|
2016-02-19 05:59:29 +01:00
|
|
|
|
2017-03-20 15:44:16 +01:00
|
|
|
&pci_bridge,
|
|
|
|
&pci_device_reg,
|
|
|
|
&pci_device_bus_num,
|
|
|
|
|
2017-03-20 15:44:17 +01:00
|
|
|
&simple_bus_bridge,
|
|
|
|
&simple_bus_reg,
|
|
|
|
|
2018-07-27 05:19:31 +02:00
|
|
|
&i2c_bus_bridge,
|
|
|
|
&i2c_bus_reg,
|
|
|
|
|
2018-07-27 05:19:32 +02:00
|
|
|
&spi_bus_bridge,
|
|
|
|
&spi_bus_reg,
|
|
|
|
|
2007-12-07 04:05:55 +01:00
|
|
|
&avoid_default_addr_size,
|
2017-12-12 23:46:27 +01:00
|
|
|
&avoid_unnecessary_addr_size,
|
2018-03-07 01:49:15 +01:00
|
|
|
&unique_unit_address,
|
2018-12-13 20:30:14 +01:00
|
|
|
&unique_unit_address_if_enabled,
|
2007-12-07 04:06:11 +01:00
|
|
|
&obsolete_chosen_interrupt_controller,
|
2017-12-14 23:40:01 +01:00
|
|
|
&chosen_node_is_root, &chosen_node_bootargs, &chosen_node_stdout_path,
|
2012-07-08 15:25:22 +02:00
|
|
|
|
2017-09-01 20:53:01 +02:00
|
|
|
&clocks_property,
|
|
|
|
&cooling_device_property,
|
|
|
|
&dmas_property,
|
|
|
|
&hwlocks_property,
|
|
|
|
&interrupts_extended_property,
|
|
|
|
&io_channels_property,
|
|
|
|
&iommus_property,
|
|
|
|
&mboxes_property,
|
|
|
|
&msi_parent_property,
|
|
|
|
&mux_controls_property,
|
|
|
|
&phys_property,
|
|
|
|
&power_domains_property,
|
|
|
|
&pwms_property,
|
|
|
|
&resets_property,
|
2017-12-04 10:07:23 +01:00
|
|
|
&sound_dai_property,
|
2017-09-01 20:53:01 +02:00
|
|
|
&thermal_sensors_property,
|
|
|
|
|
2017-09-01 20:53:02 +02:00
|
|
|
&deprecated_gpio_property,
|
|
|
|
&gpios_property,
|
2017-09-01 20:53:03 +02:00
|
|
|
&interrupts_property,
|
2017-09-01 20:53:02 +02:00
|
|
|
|
2017-12-12 23:46:28 +01:00
|
|
|
&alias_paths,
|
|
|
|
|
2018-02-14 00:00:59 +01:00
|
|
|
&graph_nodes, &graph_child_address, &graph_port, &graph_endpoint,
|
|
|
|
|
2012-07-08 15:25:22 +02:00
|
|
|
&always_fail,
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
};
|
2007-11-01 06:49:26 +01:00
|
|
|
|
2012-07-08 15:25:22 +02:00
|
|
|
static void enable_warning_error(struct check *c, bool warn, bool error)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* Raising level, also raise it for prereqs */
|
|
|
|
if ((warn && !c->warn) || (error && !c->error))
|
|
|
|
for (i = 0; i < c->num_prereqs; i++)
|
|
|
|
enable_warning_error(c->prereq[i], warn, error);
|
|
|
|
|
|
|
|
c->warn = c->warn || warn;
|
|
|
|
c->error = c->error || error;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void disable_warning_error(struct check *c, bool warn, bool error)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* Lowering level, also lower it for things this is the prereq
|
|
|
|
* for */
|
|
|
|
if ((warn && c->warn) || (error && c->error)) {
|
|
|
|
for (i = 0; i < ARRAY_SIZE(check_table); i++) {
|
|
|
|
struct check *cc = check_table[i];
|
|
|
|
int j;
|
|
|
|
|
|
|
|
for (j = 0; j < cc->num_prereqs; j++)
|
|
|
|
if (cc->prereq[j] == c)
|
|
|
|
disable_warning_error(cc, warn, error);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
c->warn = c->warn && !warn;
|
|
|
|
c->error = c->error && !error;
|
|
|
|
}
|
|
|
|
|
2014-02-01 06:41:59 +01:00
|
|
|
void parse_checks_option(bool warn, bool error, const char *arg)
|
2012-07-08 15:25:22 +02:00
|
|
|
{
|
|
|
|
int i;
|
2014-02-01 06:41:59 +01:00
|
|
|
const char *name = arg;
|
2012-07-08 15:25:22 +02:00
|
|
|
bool enable = true;
|
|
|
|
|
2014-02-01 06:41:59 +01:00
|
|
|
if ((strncmp(arg, "no-", 3) == 0)
|
|
|
|
|| (strncmp(arg, "no_", 3) == 0)) {
|
|
|
|
name = arg + 3;
|
2012-07-08 15:25:22 +02:00
|
|
|
enable = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(check_table); i++) {
|
|
|
|
struct check *c = check_table[i];
|
|
|
|
|
|
|
|
if (streq(c->name, name)) {
|
|
|
|
if (enable)
|
|
|
|
enable_warning_error(c, warn, error);
|
|
|
|
else
|
|
|
|
disable_warning_error(c, warn, error);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
die("Unrecognized check name \"%s\"\n", name);
|
|
|
|
}
|
|
|
|
|
2016-05-31 03:58:42 +02:00
|
|
|
void process_checks(bool force, struct dt_info *dti)
|
2007-11-01 06:49:26 +01:00
|
|
|
{
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
int i;
|
|
|
|
int error = 0;
|
2007-11-01 06:49:26 +01:00
|
|
|
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
for (i = 0; i < ARRAY_SIZE(check_table); i++) {
|
|
|
|
struct check *c = check_table[i];
|
2007-11-01 06:49:26 +01:00
|
|
|
|
2012-07-08 15:25:21 +02:00
|
|
|
if (c->warn || c->error)
|
2016-05-31 03:58:42 +02:00
|
|
|
error = error || run_check(c, dti);
|
dtc: Flexible tree checking infrastructure (v2)
dtc: Flexible tree checking infrastructure
Here, at last, is a substantial start on revising dtc's infrastructure
for checking the tree; this is the rework I've been saying was
necessary practically since dtc was first release.
In the new model, we have a table of "check" structures, each with a
name, references to checking functions, and status variables. Each
check can (in principle) be individually switched off or on (as either
a warning or error). Checks have a list of prerequisites, so if
checks need to rely on results from earlier checks to make sense (or
even to avoid crashing) they just need to list the relevant other
checks there.
For now, only the "structural" checks and the fixups for phandle
references are converted to the new mechanism. The rather more
involved semantic checks (which is where this new mechanism will
really be useful) will have to be converted in future patches.
At present, there's no user interface for turning on/off the checks -
the -f option now forces output even if "error" level checks fail.
Again, future patches will be needed to add the fine-grained control,
but that should be quite straightforward with the infrastructure
implemented here.
Also adds a testcase for the handling of bad references, which catches
a bug encountered while developing this patch.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
2007-11-22 04:38:07 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if (error) {
|
|
|
|
if (!force) {
|
|
|
|
fprintf(stderr, "ERROR: Input tree has errors, aborting "
|
|
|
|
"(use -f to force output)\n");
|
|
|
|
exit(2);
|
|
|
|
} else if (quiet < 3) {
|
|
|
|
fprintf(stderr, "Warning: Input tree has errors, "
|
|
|
|
"output forced\n");
|
|
|
|
}
|
|
|
|
}
|
2007-11-01 06:49:26 +01:00
|
|
|
}
|