1d18719a4STom Rini /*
2d18719a4STom Rini * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2007.
3d18719a4STom Rini *
4d18719a4STom Rini *
5d18719a4STom Rini * This program is free software; you can redistribute it and/or
6d18719a4STom Rini * modify it under the terms of the GNU General Public License as
7d18719a4STom Rini * published by the Free Software Foundation; either version 2 of the
8d18719a4STom Rini * License, or (at your option) any later version.
9d18719a4STom Rini *
10d18719a4STom Rini * This program is distributed in the hope that it will be useful,
11d18719a4STom Rini * but WITHOUT ANY WARRANTY; without even the implied warranty of
12d18719a4STom Rini * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13d18719a4STom Rini * General Public License for more details.
14d18719a4STom Rini *
15d18719a4STom Rini * You should have received a copy of the GNU General Public License
16d18719a4STom Rini * along with this program; if not, write to the Free Software
17d18719a4STom Rini * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
18d18719a4STom Rini * USA
19d18719a4STom Rini */
20d18719a4STom Rini
21d18719a4STom Rini #include "dtc.h"
22d18719a4STom Rini
23d18719a4STom Rini #ifdef TRACE_CHECKS
24d18719a4STom Rini #define TRACE(c, ...) \
25d18719a4STom Rini do { \
26d18719a4STom Rini fprintf(stderr, "=== %s: ", (c)->name); \
27d18719a4STom Rini fprintf(stderr, __VA_ARGS__); \
28d18719a4STom Rini fprintf(stderr, "\n"); \
29d18719a4STom Rini } while (0)
30d18719a4STom Rini #else
31d18719a4STom Rini #define TRACE(c, fmt, ...) do { } while (0)
32d18719a4STom Rini #endif
33d18719a4STom Rini
34d18719a4STom Rini enum checkstatus {
35d18719a4STom Rini UNCHECKED = 0,
36d18719a4STom Rini PREREQ,
37d18719a4STom Rini PASSED,
38d18719a4STom Rini FAILED,
39d18719a4STom Rini };
40d18719a4STom Rini
41d18719a4STom Rini struct check;
42d18719a4STom Rini
43d18719a4STom Rini typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
44d18719a4STom Rini
45d18719a4STom Rini struct check {
46d18719a4STom Rini const char *name;
47d18719a4STom Rini check_fn fn;
48d18719a4STom Rini void *data;
49d18719a4STom Rini bool warn, error;
50d18719a4STom Rini enum checkstatus status;
51d18719a4STom Rini bool inprogress;
52d18719a4STom Rini int num_prereqs;
53d18719a4STom Rini struct check **prereq;
54d18719a4STom Rini };
55d18719a4STom Rini
56d18719a4STom Rini #define CHECK_ENTRY(_nm, _fn, _d, _w, _e, ...) \
57d18719a4STom Rini static struct check *_nm##_prereqs[] = { __VA_ARGS__ }; \
58d18719a4STom Rini static struct check _nm = { \
59d18719a4STom Rini .name = #_nm, \
60d18719a4STom Rini .fn = (_fn), \
61d18719a4STom Rini .data = (_d), \
62d18719a4STom Rini .warn = (_w), \
63d18719a4STom Rini .error = (_e), \
64d18719a4STom Rini .status = UNCHECKED, \
65d18719a4STom Rini .num_prereqs = ARRAY_SIZE(_nm##_prereqs), \
66d18719a4STom Rini .prereq = _nm##_prereqs, \
67d18719a4STom Rini };
68d18719a4STom Rini #define WARNING(_nm, _fn, _d, ...) \
69d18719a4STom Rini CHECK_ENTRY(_nm, _fn, _d, true, false, __VA_ARGS__)
70d18719a4STom Rini #define ERROR(_nm, _fn, _d, ...) \
71d18719a4STom Rini CHECK_ENTRY(_nm, _fn, _d, false, true, __VA_ARGS__)
72d18719a4STom Rini #define CHECK(_nm, _fn, _d, ...) \
73d18719a4STom Rini CHECK_ENTRY(_nm, _fn, _d, false, false, __VA_ARGS__)
74d18719a4STom Rini
check_msg(struct check * c,struct dt_info * dti,const char * fmt,...)75e23ffda2STom Rini static inline void PRINTF(3, 4) check_msg(struct check *c, struct dt_info *dti,
76d18719a4STom Rini const char *fmt, ...)
77d18719a4STom Rini {
78d18719a4STom Rini va_list ap;
79d18719a4STom Rini va_start(ap, fmt);
80d18719a4STom Rini
81d18719a4STom Rini if ((c->warn && (quiet < 1))
82d18719a4STom Rini || (c->error && (quiet < 2))) {
83d18719a4STom Rini fprintf(stderr, "%s: %s (%s): ",
84d18719a4STom Rini strcmp(dti->outname, "-") ? dti->outname : "<stdout>",
85d18719a4STom Rini (c->error) ? "ERROR" : "Warning", c->name);
86d18719a4STom Rini vfprintf(stderr, fmt, ap);
87d18719a4STom Rini fprintf(stderr, "\n");
88d18719a4STom Rini }
89d18719a4STom Rini va_end(ap);
90d18719a4STom Rini }
91d18719a4STom Rini
92d18719a4STom Rini #define FAIL(c, dti, ...) \
93d18719a4STom Rini do { \
94d18719a4STom Rini TRACE((c), "\t\tFAILED at %s:%d", __FILE__, __LINE__); \
95d18719a4STom Rini (c)->status = FAILED; \
96d18719a4STom Rini check_msg((c), dti, __VA_ARGS__); \
97d18719a4STom Rini } while (0)
98d18719a4STom Rini
check_nodes_props(struct check * c,struct dt_info * dti,struct node * node)99d18719a4STom Rini static void check_nodes_props(struct check *c, struct dt_info *dti, struct node *node)
100d18719a4STom Rini {
101d18719a4STom Rini struct node *child;
102d18719a4STom Rini
103d18719a4STom Rini TRACE(c, "%s", node->fullpath);
104d18719a4STom Rini if (c->fn)
105d18719a4STom Rini c->fn(c, dti, node);
106d18719a4STom Rini
107d18719a4STom Rini for_each_child(node, child)
108d18719a4STom Rini check_nodes_props(c, dti, child);
109d18719a4STom Rini }
110d18719a4STom Rini
run_check(struct check * c,struct dt_info * dti)111d18719a4STom Rini static bool run_check(struct check *c, struct dt_info *dti)
112d18719a4STom Rini {
113d18719a4STom Rini struct node *dt = dti->dt;
114d18719a4STom Rini bool error = false;
115d18719a4STom Rini int i;
116d18719a4STom Rini
117d18719a4STom Rini assert(!c->inprogress);
118d18719a4STom Rini
119d18719a4STom Rini if (c->status != UNCHECKED)
120d18719a4STom Rini goto out;
121d18719a4STom Rini
122d18719a4STom Rini c->inprogress = true;
123d18719a4STom Rini
124d18719a4STom Rini for (i = 0; i < c->num_prereqs; i++) {
125d18719a4STom Rini struct check *prq = c->prereq[i];
126d18719a4STom Rini error = error || run_check(prq, dti);
127d18719a4STom Rini if (prq->status != PASSED) {
128d18719a4STom Rini c->status = PREREQ;
129d18719a4STom Rini check_msg(c, dti, "Failed prerequisite '%s'",
130d18719a4STom Rini c->prereq[i]->name);
131d18719a4STom Rini }
132d18719a4STom Rini }
133d18719a4STom Rini
134d18719a4STom Rini if (c->status != UNCHECKED)
135d18719a4STom Rini goto out;
136d18719a4STom Rini
137d18719a4STom Rini check_nodes_props(c, dti, dt);
138d18719a4STom Rini
139d18719a4STom Rini if (c->status == UNCHECKED)
140d18719a4STom Rini c->status = PASSED;
141d18719a4STom Rini
142d18719a4STom Rini TRACE(c, "\tCompleted, status %d", c->status);
143d18719a4STom Rini
144d18719a4STom Rini out:
145d18719a4STom Rini c->inprogress = false;
146d18719a4STom Rini if ((c->status != PASSED) && (c->error))
147d18719a4STom Rini error = true;
148d18719a4STom Rini return error;
149d18719a4STom Rini }
150d18719a4STom Rini
151d18719a4STom Rini /*
152d18719a4STom Rini * Utility check functions
153d18719a4STom Rini */
154d18719a4STom Rini
155d18719a4STom Rini /* A check which always fails, for testing purposes only */
check_always_fail(struct check * c,struct dt_info * dti,struct node * node)156d18719a4STom Rini static inline void check_always_fail(struct check *c, struct dt_info *dti,
157d18719a4STom Rini struct node *node)
158d18719a4STom Rini {
159d18719a4STom Rini FAIL(c, dti, "always_fail check");
160d18719a4STom Rini }
161d18719a4STom Rini CHECK(always_fail, check_always_fail, NULL);
162d18719a4STom Rini
check_is_string(struct check * c,struct dt_info * dti,struct node * node)163d18719a4STom Rini static void check_is_string(struct check *c, struct dt_info *dti,
164d18719a4STom Rini struct node *node)
165d18719a4STom Rini {
166d18719a4STom Rini struct property *prop;
167d18719a4STom Rini char *propname = c->data;
168d18719a4STom Rini
169d18719a4STom Rini prop = get_property(node, propname);
170d18719a4STom Rini if (!prop)
171d18719a4STom Rini return; /* Not present, assumed ok */
172d18719a4STom Rini
173d18719a4STom Rini if (!data_is_one_string(prop->val))
174d18719a4STom Rini FAIL(c, dti, "\"%s\" property in %s is not a string",
175d18719a4STom Rini propname, node->fullpath);
176d18719a4STom Rini }
177d18719a4STom Rini #define WARNING_IF_NOT_STRING(nm, propname) \
178d18719a4STom Rini WARNING(nm, check_is_string, (propname))
179d18719a4STom Rini #define ERROR_IF_NOT_STRING(nm, propname) \
180d18719a4STom Rini ERROR(nm, check_is_string, (propname))
181d18719a4STom Rini
check_is_cell(struct check * c,struct dt_info * dti,struct node * node)182d18719a4STom Rini static void check_is_cell(struct check *c, struct dt_info *dti,
183d18719a4STom Rini struct node *node)
184d18719a4STom Rini {
185d18719a4STom Rini struct property *prop;
186d18719a4STom Rini char *propname = c->data;
187d18719a4STom Rini
188d18719a4STom Rini prop = get_property(node, propname);
189d18719a4STom Rini if (!prop)
190d18719a4STom Rini return; /* Not present, assumed ok */
191d18719a4STom Rini
192d18719a4STom Rini if (prop->val.len != sizeof(cell_t))
193d18719a4STom Rini FAIL(c, dti, "\"%s\" property in %s is not a single cell",
194d18719a4STom Rini propname, node->fullpath);
195d18719a4STom Rini }
196d18719a4STom Rini #define WARNING_IF_NOT_CELL(nm, propname) \
197d18719a4STom Rini WARNING(nm, check_is_cell, (propname))
198d18719a4STom Rini #define ERROR_IF_NOT_CELL(nm, propname) \
199d18719a4STom Rini ERROR(nm, check_is_cell, (propname))
200d18719a4STom Rini
201d18719a4STom Rini /*
202d18719a4STom Rini * Structural check functions
203d18719a4STom Rini */
204d18719a4STom Rini
check_duplicate_node_names(struct check * c,struct dt_info * dti,struct node * node)205d18719a4STom Rini static void check_duplicate_node_names(struct check *c, struct dt_info *dti,
206d18719a4STom Rini struct node *node)
207d18719a4STom Rini {
208d18719a4STom Rini struct node *child, *child2;
209d18719a4STom Rini
210d18719a4STom Rini for_each_child(node, child)
211d18719a4STom Rini for (child2 = child->next_sibling;
212d18719a4STom Rini child2;
213d18719a4STom Rini child2 = child2->next_sibling)
214d18719a4STom Rini if (streq(child->name, child2->name))
215d18719a4STom Rini FAIL(c, dti, "Duplicate node name %s",
216d18719a4STom Rini child->fullpath);
217d18719a4STom Rini }
218d18719a4STom Rini ERROR(duplicate_node_names, check_duplicate_node_names, NULL);
219d18719a4STom Rini
check_duplicate_property_names(struct check * c,struct dt_info * dti,struct node * node)220d18719a4STom Rini static void check_duplicate_property_names(struct check *c, struct dt_info *dti,
221d18719a4STom Rini struct node *node)
222d18719a4STom Rini {
223d18719a4STom Rini struct property *prop, *prop2;
224d18719a4STom Rini
225d18719a4STom Rini for_each_property(node, prop) {
226d18719a4STom Rini for (prop2 = prop->next; prop2; prop2 = prop2->next) {
227d18719a4STom Rini if (prop2->deleted)
228d18719a4STom Rini continue;
229d18719a4STom Rini if (streq(prop->name, prop2->name))
230d18719a4STom Rini FAIL(c, dti, "Duplicate property name %s in %s",
231d18719a4STom Rini prop->name, node->fullpath);
232d18719a4STom Rini }
233d18719a4STom Rini }
234d18719a4STom Rini }
235d18719a4STom Rini ERROR(duplicate_property_names, check_duplicate_property_names, NULL);
236d18719a4STom Rini
237d18719a4STom Rini #define LOWERCASE "abcdefghijklmnopqrstuvwxyz"
238d18719a4STom Rini #define UPPERCASE "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
239d18719a4STom Rini #define DIGITS "0123456789"
240d18719a4STom Rini #define PROPNODECHARS LOWERCASE UPPERCASE DIGITS ",._+*#?-"
241d18719a4STom Rini #define PROPNODECHARSSTRICT LOWERCASE UPPERCASE DIGITS ",-"
242d18719a4STom Rini
check_node_name_chars(struct check * c,struct dt_info * dti,struct node * node)243d18719a4STom Rini static void check_node_name_chars(struct check *c, struct dt_info *dti,
244d18719a4STom Rini struct node *node)
245d18719a4STom Rini {
246d18719a4STom Rini int n = strspn(node->name, c->data);
247d18719a4STom Rini
248d18719a4STom Rini if (n < strlen(node->name))
249d18719a4STom Rini FAIL(c, dti, "Bad character '%c' in node %s",
250d18719a4STom Rini node->name[n], node->fullpath);
251d18719a4STom Rini }
252d18719a4STom Rini ERROR(node_name_chars, check_node_name_chars, PROPNODECHARS "@");
253d18719a4STom Rini
check_node_name_chars_strict(struct check * c,struct dt_info * dti,struct node * node)254d18719a4STom Rini static void check_node_name_chars_strict(struct check *c, struct dt_info *dti,
255d18719a4STom Rini struct node *node)
256d18719a4STom Rini {
257d18719a4STom Rini int n = strspn(node->name, c->data);
258d18719a4STom Rini
259d18719a4STom Rini if (n < node->basenamelen)
260d18719a4STom Rini FAIL(c, dti, "Character '%c' not recommended in node %s",
261d18719a4STom Rini node->name[n], node->fullpath);
262d18719a4STom Rini }
263d18719a4STom Rini CHECK(node_name_chars_strict, check_node_name_chars_strict, PROPNODECHARSSTRICT);
264d18719a4STom Rini
check_node_name_format(struct check * c,struct dt_info * dti,struct node * node)265d18719a4STom Rini static void check_node_name_format(struct check *c, struct dt_info *dti,
266d18719a4STom Rini struct node *node)
267d18719a4STom Rini {
268d18719a4STom Rini if (strchr(get_unitname(node), '@'))
269d18719a4STom Rini FAIL(c, dti, "Node %s has multiple '@' characters in name",
270d18719a4STom Rini node->fullpath);
271d18719a4STom Rini }
272d18719a4STom Rini ERROR(node_name_format, check_node_name_format, NULL, &node_name_chars);
273d18719a4STom Rini
check_unit_address_vs_reg(struct check * c,struct dt_info * dti,struct node * node)274d18719a4STom Rini static void check_unit_address_vs_reg(struct check *c, struct dt_info *dti,
275d18719a4STom Rini struct node *node)
276d18719a4STom Rini {
277d18719a4STom Rini const char *unitname = get_unitname(node);
278d18719a4STom Rini struct property *prop = get_property(node, "reg");
279d18719a4STom Rini
280d18719a4STom Rini if (!prop) {
281d18719a4STom Rini prop = get_property(node, "ranges");
282d18719a4STom Rini if (prop && !prop->val.len)
283d18719a4STom Rini prop = NULL;
284d18719a4STom Rini }
285d18719a4STom Rini
286d18719a4STom Rini if (prop) {
287d18719a4STom Rini if (!unitname[0])
288d18719a4STom Rini FAIL(c, dti, "Node %s has a reg or ranges property, but no unit name",
289d18719a4STom Rini node->fullpath);
290d18719a4STom Rini } else {
291d18719a4STom Rini if (unitname[0])
292d18719a4STom Rini FAIL(c, dti, "Node %s has a unit name, but no reg property",
293d18719a4STom Rini node->fullpath);
294d18719a4STom Rini }
295d18719a4STom Rini }
296d18719a4STom Rini WARNING(unit_address_vs_reg, check_unit_address_vs_reg, NULL);
297d18719a4STom Rini
check_property_name_chars(struct check * c,struct dt_info * dti,struct node * node)298d18719a4STom Rini static void check_property_name_chars(struct check *c, struct dt_info *dti,
299d18719a4STom Rini struct node *node)
300d18719a4STom Rini {
301d18719a4STom Rini struct property *prop;
302d18719a4STom Rini
303d18719a4STom Rini for_each_property(node, prop) {
304d18719a4STom Rini int n = strspn(prop->name, c->data);
305d18719a4STom Rini
306d18719a4STom Rini if (n < strlen(prop->name))
307d18719a4STom Rini FAIL(c, dti, "Bad character '%c' in property name \"%s\", node %s",
308d18719a4STom Rini prop->name[n], prop->name, node->fullpath);
309d18719a4STom Rini }
310d18719a4STom Rini }
311d18719a4STom Rini ERROR(property_name_chars, check_property_name_chars, PROPNODECHARS);
312d18719a4STom Rini
check_property_name_chars_strict(struct check * c,struct dt_info * dti,struct node * node)313d18719a4STom Rini static void check_property_name_chars_strict(struct check *c,
314d18719a4STom Rini struct dt_info *dti,
315d18719a4STom Rini struct node *node)
316d18719a4STom Rini {
317d18719a4STom Rini struct property *prop;
318d18719a4STom Rini
319d18719a4STom Rini for_each_property(node, prop) {
320d18719a4STom Rini const char *name = prop->name;
321d18719a4STom Rini int n = strspn(name, c->data);
322d18719a4STom Rini
323d18719a4STom Rini if (n == strlen(prop->name))
324d18719a4STom Rini continue;
325d18719a4STom Rini
326d18719a4STom Rini /* Certain names are whitelisted */
327d18719a4STom Rini if (streq(name, "device_type"))
328d18719a4STom Rini continue;
329d18719a4STom Rini
330d18719a4STom Rini /*
331d18719a4STom Rini * # is only allowed at the beginning of property names not counting
332d18719a4STom Rini * the vendor prefix.
333d18719a4STom Rini */
334d18719a4STom Rini if (name[n] == '#' && ((n == 0) || (name[n-1] == ','))) {
335d18719a4STom Rini name += n + 1;
336d18719a4STom Rini n = strspn(name, c->data);
337d18719a4STom Rini }
338d18719a4STom Rini if (n < strlen(name))
339d18719a4STom Rini FAIL(c, dti, "Character '%c' not recommended in property name \"%s\", node %s",
340d18719a4STom Rini name[n], prop->name, node->fullpath);
341d18719a4STom Rini }
342d18719a4STom Rini }
343d18719a4STom Rini CHECK(property_name_chars_strict, check_property_name_chars_strict, PROPNODECHARSSTRICT);
344d18719a4STom Rini
345d18719a4STom Rini #define DESCLABEL_FMT "%s%s%s%s%s"
346d18719a4STom Rini #define DESCLABEL_ARGS(node,prop,mark) \
347d18719a4STom Rini ((mark) ? "value of " : ""), \
348d18719a4STom Rini ((prop) ? "'" : ""), \
349d18719a4STom Rini ((prop) ? (prop)->name : ""), \
350d18719a4STom Rini ((prop) ? "' in " : ""), (node)->fullpath
351d18719a4STom Rini
check_duplicate_label(struct check * c,struct dt_info * dti,const char * label,struct node * node,struct property * prop,struct marker * mark)352d18719a4STom Rini static void check_duplicate_label(struct check *c, struct dt_info *dti,
353d18719a4STom Rini const char *label, struct node *node,
354d18719a4STom Rini struct property *prop, struct marker *mark)
355d18719a4STom Rini {
356d18719a4STom Rini struct node *dt = dti->dt;
357d18719a4STom Rini struct node *othernode = NULL;
358d18719a4STom Rini struct property *otherprop = NULL;
359d18719a4STom Rini struct marker *othermark = NULL;
360d18719a4STom Rini
361d18719a4STom Rini othernode = get_node_by_label(dt, label);
362d18719a4STom Rini
363d18719a4STom Rini if (!othernode)
364d18719a4STom Rini otherprop = get_property_by_label(dt, label, &othernode);
365d18719a4STom Rini if (!othernode)
366d18719a4STom Rini othermark = get_marker_label(dt, label, &othernode,
367d18719a4STom Rini &otherprop);
368d18719a4STom Rini
369d18719a4STom Rini if (!othernode)
370d18719a4STom Rini return;
371d18719a4STom Rini
372d18719a4STom Rini if ((othernode != node) || (otherprop != prop) || (othermark != mark))
373d18719a4STom Rini FAIL(c, dti, "Duplicate label '%s' on " DESCLABEL_FMT
374d18719a4STom Rini " and " DESCLABEL_FMT,
375d18719a4STom Rini label, DESCLABEL_ARGS(node, prop, mark),
376d18719a4STom Rini DESCLABEL_ARGS(othernode, otherprop, othermark));
377d18719a4STom Rini }
378d18719a4STom Rini
check_duplicate_label_node(struct check * c,struct dt_info * dti,struct node * node)379d18719a4STom Rini static void check_duplicate_label_node(struct check *c, struct dt_info *dti,
380d18719a4STom Rini struct node *node)
381d18719a4STom Rini {
382d18719a4STom Rini struct label *l;
383d18719a4STom Rini struct property *prop;
384d18719a4STom Rini
385d18719a4STom Rini for_each_label(node->labels, l)
386d18719a4STom Rini check_duplicate_label(c, dti, l->label, node, NULL, NULL);
387d18719a4STom Rini
388d18719a4STom Rini for_each_property(node, prop) {
389d18719a4STom Rini struct marker *m = prop->val.markers;
390d18719a4STom Rini
391d18719a4STom Rini for_each_label(prop->labels, l)
392d18719a4STom Rini check_duplicate_label(c, dti, l->label, node, prop, NULL);
393d18719a4STom Rini
394d18719a4STom Rini for_each_marker_of_type(m, LABEL)
395d18719a4STom Rini check_duplicate_label(c, dti, m->ref, node, prop, m);
396d18719a4STom Rini }
397d18719a4STom Rini }
398d18719a4STom Rini ERROR(duplicate_label, check_duplicate_label_node, NULL);
399d18719a4STom Rini
check_phandle_prop(struct check * c,struct dt_info * dti,struct node * node,const char * propname)400d18719a4STom Rini static cell_t check_phandle_prop(struct check *c, struct dt_info *dti,
401d18719a4STom Rini struct node *node, const char *propname)
402d18719a4STom Rini {
403d18719a4STom Rini struct node *root = dti->dt;
404d18719a4STom Rini struct property *prop;
405d18719a4STom Rini struct marker *m;
406d18719a4STom Rini cell_t phandle;
407d18719a4STom Rini
408d18719a4STom Rini prop = get_property(node, propname);
409d18719a4STom Rini if (!prop)
410d18719a4STom Rini return 0;
411d18719a4STom Rini
412d18719a4STom Rini if (prop->val.len != sizeof(cell_t)) {
413d18719a4STom Rini FAIL(c, dti, "%s has bad length (%d) %s property",
414d18719a4STom Rini node->fullpath, prop->val.len, prop->name);
415d18719a4STom Rini return 0;
416d18719a4STom Rini }
417d18719a4STom Rini
418d18719a4STom Rini m = prop->val.markers;
419d18719a4STom Rini for_each_marker_of_type(m, REF_PHANDLE) {
420d18719a4STom Rini assert(m->offset == 0);
421d18719a4STom Rini if (node != get_node_by_ref(root, m->ref))
422d18719a4STom Rini /* "Set this node's phandle equal to some
423d18719a4STom Rini * other node's phandle". That's nonsensical
424d18719a4STom Rini * by construction. */ {
425d18719a4STom Rini FAIL(c, dti, "%s in %s is a reference to another node",
426d18719a4STom Rini prop->name, node->fullpath);
427d18719a4STom Rini }
428d18719a4STom Rini /* But setting this node's phandle equal to its own
429d18719a4STom Rini * phandle is allowed - that means allocate a unique
430d18719a4STom Rini * phandle for this node, even if it's not otherwise
431d18719a4STom Rini * referenced. The value will be filled in later, so
432d18719a4STom Rini * we treat it as having no phandle data for now. */
433d18719a4STom Rini return 0;
434d18719a4STom Rini }
435d18719a4STom Rini
436d18719a4STom Rini phandle = propval_cell(prop);
437d18719a4STom Rini
438d18719a4STom Rini if ((phandle == 0) || (phandle == -1)) {
439d18719a4STom Rini FAIL(c, dti, "%s has bad value (0x%x) in %s property",
440d18719a4STom Rini node->fullpath, phandle, prop->name);
441d18719a4STom Rini return 0;
442d18719a4STom Rini }
443d18719a4STom Rini
444d18719a4STom Rini return phandle;
445d18719a4STom Rini }
446d18719a4STom Rini
check_explicit_phandles(struct check * c,struct dt_info * dti,struct node * node)447d18719a4STom Rini static void check_explicit_phandles(struct check *c, struct dt_info *dti,
448d18719a4STom Rini struct node *node)
449d18719a4STom Rini {
450d18719a4STom Rini struct node *root = dti->dt;
451d18719a4STom Rini struct node *other;
452d18719a4STom Rini cell_t phandle, linux_phandle;
453d18719a4STom Rini
454d18719a4STom Rini /* Nothing should have assigned phandles yet */
455d18719a4STom Rini assert(!node->phandle);
456d18719a4STom Rini
457d18719a4STom Rini phandle = check_phandle_prop(c, dti, node, "phandle");
458d18719a4STom Rini
459d18719a4STom Rini linux_phandle = check_phandle_prop(c, dti, node, "linux,phandle");
460d18719a4STom Rini
461d18719a4STom Rini if (!phandle && !linux_phandle)
462d18719a4STom Rini /* No valid phandles; nothing further to check */
463d18719a4STom Rini return;
464d18719a4STom Rini
465d18719a4STom Rini if (linux_phandle && phandle && (phandle != linux_phandle))
466d18719a4STom Rini FAIL(c, dti, "%s has mismatching 'phandle' and 'linux,phandle'"
467d18719a4STom Rini " properties", node->fullpath);
468d18719a4STom Rini
469d18719a4STom Rini if (linux_phandle && !phandle)
470d18719a4STom Rini phandle = linux_phandle;
471d18719a4STom Rini
472d18719a4STom Rini other = get_node_by_phandle(root, phandle);
473d18719a4STom Rini if (other && (other != node)) {
474d18719a4STom Rini FAIL(c, dti, "%s has duplicated phandle 0x%x (seen before at %s)",
475d18719a4STom Rini node->fullpath, phandle, other->fullpath);
476d18719a4STom Rini return;
477d18719a4STom Rini }
478d18719a4STom Rini
479d18719a4STom Rini node->phandle = phandle;
480d18719a4STom Rini }
481d18719a4STom Rini ERROR(explicit_phandles, check_explicit_phandles, NULL);
482d18719a4STom Rini
check_name_properties(struct check * c,struct dt_info * dti,struct node * node)483d18719a4STom Rini static void check_name_properties(struct check *c, struct dt_info *dti,
484d18719a4STom Rini struct node *node)
485d18719a4STom Rini {
486d18719a4STom Rini struct property **pp, *prop = NULL;
487d18719a4STom Rini
488d18719a4STom Rini for (pp = &node->proplist; *pp; pp = &((*pp)->next))
489d18719a4STom Rini if (streq((*pp)->name, "name")) {
490d18719a4STom Rini prop = *pp;
491d18719a4STom Rini break;
492d18719a4STom Rini }
493d18719a4STom Rini
494d18719a4STom Rini if (!prop)
495d18719a4STom Rini return; /* No name property, that's fine */
496d18719a4STom Rini
497d18719a4STom Rini if ((prop->val.len != node->basenamelen+1)
498d18719a4STom Rini || (memcmp(prop->val.val, node->name, node->basenamelen) != 0)) {
499d18719a4STom Rini FAIL(c, dti, "\"name\" property in %s is incorrect (\"%s\" instead"
500d18719a4STom Rini " of base node name)", node->fullpath, prop->val.val);
501d18719a4STom Rini } else {
502d18719a4STom Rini /* The name property is correct, and therefore redundant.
503d18719a4STom Rini * Delete it */
504d18719a4STom Rini *pp = prop->next;
505d18719a4STom Rini free(prop->name);
506d18719a4STom Rini data_free(prop->val);
507d18719a4STom Rini free(prop);
508d18719a4STom Rini }
509d18719a4STom Rini }
510d18719a4STom Rini ERROR_IF_NOT_STRING(name_is_string, "name");
511d18719a4STom Rini ERROR(name_properties, check_name_properties, NULL, &name_is_string);
512d18719a4STom Rini
513d18719a4STom Rini /*
514d18719a4STom Rini * Reference fixup functions
515d18719a4STom Rini */
516d18719a4STom Rini
fixup_phandle_references(struct check * c,struct dt_info * dti,struct node * node)517d18719a4STom Rini static void fixup_phandle_references(struct check *c, struct dt_info *dti,
518d18719a4STom Rini struct node *node)
519d18719a4STom Rini {
520d18719a4STom Rini struct node *dt = dti->dt;
521d18719a4STom Rini struct property *prop;
522d18719a4STom Rini
523d18719a4STom Rini for_each_property(node, prop) {
524d18719a4STom Rini struct marker *m = prop->val.markers;
525d18719a4STom Rini struct node *refnode;
526d18719a4STom Rini cell_t phandle;
527d18719a4STom Rini
528d18719a4STom Rini for_each_marker_of_type(m, REF_PHANDLE) {
529d18719a4STom Rini assert(m->offset + sizeof(cell_t) <= prop->val.len);
530d18719a4STom Rini
531d18719a4STom Rini refnode = get_node_by_ref(dt, m->ref);
532d18719a4STom Rini if (! refnode) {
533d18719a4STom Rini if (!(dti->dtsflags & DTSF_PLUGIN))
534d18719a4STom Rini FAIL(c, dti, "Reference to non-existent node or "
535d18719a4STom Rini "label \"%s\"\n", m->ref);
536d18719a4STom Rini else /* mark the entry as unresolved */
537e23ffda2STom Rini *((fdt32_t *)(prop->val.val + m->offset)) =
538d18719a4STom Rini cpu_to_fdt32(0xffffffff);
539d18719a4STom Rini continue;
540d18719a4STom Rini }
541d18719a4STom Rini
542d18719a4STom Rini phandle = get_node_phandle(dt, refnode);
543e23ffda2STom Rini *((fdt32_t *)(prop->val.val + m->offset)) = cpu_to_fdt32(phandle);
544d18719a4STom Rini }
545d18719a4STom Rini }
546d18719a4STom Rini }
547d18719a4STom Rini ERROR(phandle_references, fixup_phandle_references, NULL,
548d18719a4STom Rini &duplicate_node_names, &explicit_phandles);
549d18719a4STom Rini
fixup_path_references(struct check * c,struct dt_info * dti,struct node * node)550d18719a4STom Rini static void fixup_path_references(struct check *c, struct dt_info *dti,
551d18719a4STom Rini struct node *node)
552d18719a4STom Rini {
553d18719a4STom Rini struct node *dt = dti->dt;
554d18719a4STom Rini struct property *prop;
555d18719a4STom Rini
556d18719a4STom Rini for_each_property(node, prop) {
557d18719a4STom Rini struct marker *m = prop->val.markers;
558d18719a4STom Rini struct node *refnode;
559d18719a4STom Rini char *path;
560d18719a4STom Rini
561d18719a4STom Rini for_each_marker_of_type(m, REF_PATH) {
562d18719a4STom Rini assert(m->offset <= prop->val.len);
563d18719a4STom Rini
564d18719a4STom Rini refnode = get_node_by_ref(dt, m->ref);
565d18719a4STom Rini if (!refnode) {
566d18719a4STom Rini FAIL(c, dti, "Reference to non-existent node or label \"%s\"\n",
567d18719a4STom Rini m->ref);
568d18719a4STom Rini continue;
569d18719a4STom Rini }
570d18719a4STom Rini
571d18719a4STom Rini path = refnode->fullpath;
572d18719a4STom Rini prop->val = data_insert_at_marker(prop->val, m, path,
573d18719a4STom Rini strlen(path) + 1);
574d18719a4STom Rini }
575d18719a4STom Rini }
576d18719a4STom Rini }
577d18719a4STom Rini ERROR(path_references, fixup_path_references, NULL, &duplicate_node_names);
578d18719a4STom Rini
579d18719a4STom Rini /*
580d18719a4STom Rini * Semantic checks
581d18719a4STom Rini */
582d18719a4STom Rini WARNING_IF_NOT_CELL(address_cells_is_cell, "#address-cells");
583d18719a4STom Rini WARNING_IF_NOT_CELL(size_cells_is_cell, "#size-cells");
584d18719a4STom Rini WARNING_IF_NOT_CELL(interrupt_cells_is_cell, "#interrupt-cells");
585d18719a4STom Rini
586d18719a4STom Rini WARNING_IF_NOT_STRING(device_type_is_string, "device_type");
587d18719a4STom Rini WARNING_IF_NOT_STRING(model_is_string, "model");
588d18719a4STom Rini WARNING_IF_NOT_STRING(status_is_string, "status");
589d18719a4STom Rini
fixup_addr_size_cells(struct check * c,struct dt_info * dti,struct node * node)590d18719a4STom Rini static void fixup_addr_size_cells(struct check *c, struct dt_info *dti,
591d18719a4STom Rini struct node *node)
592d18719a4STom Rini {
593d18719a4STom Rini struct property *prop;
594d18719a4STom Rini
595d18719a4STom Rini node->addr_cells = -1;
596d18719a4STom Rini node->size_cells = -1;
597d18719a4STom Rini
598d18719a4STom Rini prop = get_property(node, "#address-cells");
599d18719a4STom Rini if (prop)
600d18719a4STom Rini node->addr_cells = propval_cell(prop);
601d18719a4STom Rini
602d18719a4STom Rini prop = get_property(node, "#size-cells");
603d18719a4STom Rini if (prop)
604d18719a4STom Rini node->size_cells = propval_cell(prop);
605d18719a4STom Rini }
606d18719a4STom Rini WARNING(addr_size_cells, fixup_addr_size_cells, NULL,
607d18719a4STom Rini &address_cells_is_cell, &size_cells_is_cell);
608d18719a4STom Rini
609d18719a4STom Rini #define node_addr_cells(n) \
610d18719a4STom Rini (((n)->addr_cells == -1) ? 2 : (n)->addr_cells)
611d18719a4STom Rini #define node_size_cells(n) \
612d18719a4STom Rini (((n)->size_cells == -1) ? 1 : (n)->size_cells)
613d18719a4STom Rini
check_reg_format(struct check * c,struct dt_info * dti,struct node * node)614d18719a4STom Rini static void check_reg_format(struct check *c, struct dt_info *dti,
615d18719a4STom Rini struct node *node)
616d18719a4STom Rini {
617d18719a4STom Rini struct property *prop;
618d18719a4STom Rini int addr_cells, size_cells, entrylen;
619d18719a4STom Rini
620d18719a4STom Rini prop = get_property(node, "reg");
621d18719a4STom Rini if (!prop)
622d18719a4STom Rini return; /* No "reg", that's fine */
623d18719a4STom Rini
624d18719a4STom Rini if (!node->parent) {
625d18719a4STom Rini FAIL(c, dti, "Root node has a \"reg\" property");
626d18719a4STom Rini return;
627d18719a4STom Rini }
628d18719a4STom Rini
629d18719a4STom Rini if (prop->val.len == 0)
630d18719a4STom Rini FAIL(c, dti, "\"reg\" property in %s is empty", node->fullpath);
631d18719a4STom Rini
632d18719a4STom Rini addr_cells = node_addr_cells(node->parent);
633d18719a4STom Rini size_cells = node_size_cells(node->parent);
634d18719a4STom Rini entrylen = (addr_cells + size_cells) * sizeof(cell_t);
635d18719a4STom Rini
636d18719a4STom Rini if (!entrylen || (prop->val.len % entrylen) != 0)
637d18719a4STom Rini FAIL(c, dti, "\"reg\" property in %s has invalid length (%d bytes) "
638d18719a4STom Rini "(#address-cells == %d, #size-cells == %d)",
639d18719a4STom Rini node->fullpath, prop->val.len, addr_cells, size_cells);
640d18719a4STom Rini }
641d18719a4STom Rini WARNING(reg_format, check_reg_format, NULL, &addr_size_cells);
642d18719a4STom Rini
check_ranges_format(struct check * c,struct dt_info * dti,struct node * node)643d18719a4STom Rini static void check_ranges_format(struct check *c, struct dt_info *dti,
644d18719a4STom Rini struct node *node)
645d18719a4STom Rini {
646d18719a4STom Rini struct property *prop;
647d18719a4STom Rini int c_addr_cells, p_addr_cells, c_size_cells, p_size_cells, entrylen;
648d18719a4STom Rini
649d18719a4STom Rini prop = get_property(node, "ranges");
650d18719a4STom Rini if (!prop)
651d18719a4STom Rini return;
652d18719a4STom Rini
653d18719a4STom Rini if (!node->parent) {
654d18719a4STom Rini FAIL(c, dti, "Root node has a \"ranges\" property");
655d18719a4STom Rini return;
656d18719a4STom Rini }
657d18719a4STom Rini
658d18719a4STom Rini p_addr_cells = node_addr_cells(node->parent);
659d18719a4STom Rini p_size_cells = node_size_cells(node->parent);
660d18719a4STom Rini c_addr_cells = node_addr_cells(node);
661d18719a4STom Rini c_size_cells = node_size_cells(node);
662d18719a4STom Rini entrylen = (p_addr_cells + c_addr_cells + c_size_cells) * sizeof(cell_t);
663d18719a4STom Rini
664d18719a4STom Rini if (prop->val.len == 0) {
665d18719a4STom Rini if (p_addr_cells != c_addr_cells)
666d18719a4STom Rini FAIL(c, dti, "%s has empty \"ranges\" property but its "
667d18719a4STom Rini "#address-cells (%d) differs from %s (%d)",
668d18719a4STom Rini node->fullpath, c_addr_cells, node->parent->fullpath,
669d18719a4STom Rini p_addr_cells);
670d18719a4STom Rini if (p_size_cells != c_size_cells)
671d18719a4STom Rini FAIL(c, dti, "%s has empty \"ranges\" property but its "
672d18719a4STom Rini "#size-cells (%d) differs from %s (%d)",
673d18719a4STom Rini node->fullpath, c_size_cells, node->parent->fullpath,
674d18719a4STom Rini p_size_cells);
675d18719a4STom Rini } else if ((prop->val.len % entrylen) != 0) {
676d18719a4STom Rini FAIL(c, dti, "\"ranges\" property in %s has invalid length (%d bytes) "
677d18719a4STom Rini "(parent #address-cells == %d, child #address-cells == %d, "
678d18719a4STom Rini "#size-cells == %d)", node->fullpath, prop->val.len,
679d18719a4STom Rini p_addr_cells, c_addr_cells, c_size_cells);
680d18719a4STom Rini }
681d18719a4STom Rini }
682d18719a4STom Rini WARNING(ranges_format, check_ranges_format, NULL, &addr_size_cells);
683d18719a4STom Rini
684d7857e40STom Rini static const struct bus_type pci_bus = {
685d7857e40STom Rini .name = "PCI",
686d7857e40STom Rini };
687d7857e40STom Rini
check_pci_bridge(struct check * c,struct dt_info * dti,struct node * node)688d7857e40STom Rini static void check_pci_bridge(struct check *c, struct dt_info *dti, struct node *node)
689d7857e40STom Rini {
690d7857e40STom Rini struct property *prop;
691d7857e40STom Rini cell_t *cells;
692d7857e40STom Rini
693d7857e40STom Rini prop = get_property(node, "device_type");
694d7857e40STom Rini if (!prop || !streq(prop->val.val, "pci"))
695d7857e40STom Rini return;
696d7857e40STom Rini
697d7857e40STom Rini node->bus = &pci_bus;
698d7857e40STom Rini
699d7857e40STom Rini if (!strneq(node->name, "pci", node->basenamelen) &&
700d7857e40STom Rini !strneq(node->name, "pcie", node->basenamelen))
701d7857e40STom Rini FAIL(c, dti, "Node %s node name is not \"pci\" or \"pcie\"",
702d7857e40STom Rini node->fullpath);
703d7857e40STom Rini
704d7857e40STom Rini prop = get_property(node, "ranges");
705d7857e40STom Rini if (!prop)
706d7857e40STom Rini FAIL(c, dti, "Node %s missing ranges for PCI bridge (or not a bridge)",
707d7857e40STom Rini node->fullpath);
708d7857e40STom Rini
709d7857e40STom Rini if (node_addr_cells(node) != 3)
710d7857e40STom Rini FAIL(c, dti, "Node %s incorrect #address-cells for PCI bridge",
711d7857e40STom Rini node->fullpath);
712d7857e40STom Rini if (node_size_cells(node) != 2)
713d7857e40STom Rini FAIL(c, dti, "Node %s incorrect #size-cells for PCI bridge",
714d7857e40STom Rini node->fullpath);
715d7857e40STom Rini
716d7857e40STom Rini prop = get_property(node, "bus-range");
717d7857e40STom Rini if (!prop) {
718d7857e40STom Rini FAIL(c, dti, "Node %s missing bus-range for PCI bridge",
719d7857e40STom Rini node->fullpath);
720d7857e40STom Rini return;
721d7857e40STom Rini }
722d7857e40STom Rini if (prop->val.len != (sizeof(cell_t) * 2)) {
723d7857e40STom Rini FAIL(c, dti, "Node %s bus-range must be 2 cells",
724d7857e40STom Rini node->fullpath);
725d7857e40STom Rini return;
726d7857e40STom Rini }
727d7857e40STom Rini cells = (cell_t *)prop->val.val;
728d7857e40STom Rini if (fdt32_to_cpu(cells[0]) > fdt32_to_cpu(cells[1]))
729d7857e40STom Rini FAIL(c, dti, "Node %s bus-range 1st cell must be less than or equal to 2nd cell",
730d7857e40STom Rini node->fullpath);
731d7857e40STom Rini if (fdt32_to_cpu(cells[1]) > 0xff)
732d7857e40STom Rini FAIL(c, dti, "Node %s bus-range maximum bus number must be less than 256",
733d7857e40STom Rini node->fullpath);
734d7857e40STom Rini }
735d7857e40STom Rini WARNING(pci_bridge, check_pci_bridge, NULL,
736d7857e40STom Rini &device_type_is_string, &addr_size_cells);
737d7857e40STom Rini
check_pci_device_bus_num(struct check * c,struct dt_info * dti,struct node * node)738d7857e40STom Rini static void check_pci_device_bus_num(struct check *c, struct dt_info *dti, struct node *node)
739d7857e40STom Rini {
740d7857e40STom Rini struct property *prop;
741d7857e40STom Rini unsigned int bus_num, min_bus, max_bus;
742d7857e40STom Rini cell_t *cells;
743d7857e40STom Rini
744d7857e40STom Rini if (!node->parent || (node->parent->bus != &pci_bus))
745d7857e40STom Rini return;
746d7857e40STom Rini
747d7857e40STom Rini prop = get_property(node, "reg");
748d7857e40STom Rini if (!prop)
749d7857e40STom Rini return;
750d7857e40STom Rini
751d7857e40STom Rini cells = (cell_t *)prop->val.val;
752d7857e40STom Rini bus_num = (fdt32_to_cpu(cells[0]) & 0x00ff0000) >> 16;
753d7857e40STom Rini
754d7857e40STom Rini prop = get_property(node->parent, "bus-range");
755d7857e40STom Rini if (!prop) {
756d7857e40STom Rini min_bus = max_bus = 0;
757d7857e40STom Rini } else {
758d7857e40STom Rini cells = (cell_t *)prop->val.val;
759d7857e40STom Rini min_bus = fdt32_to_cpu(cells[0]);
760d7857e40STom Rini max_bus = fdt32_to_cpu(cells[0]);
761d7857e40STom Rini }
762d7857e40STom Rini if ((bus_num < min_bus) || (bus_num > max_bus))
763d7857e40STom Rini FAIL(c, dti, "Node %s PCI bus number %d out of range, expected (%d - %d)",
764d7857e40STom Rini node->fullpath, bus_num, min_bus, max_bus);
765d7857e40STom Rini }
766d7857e40STom Rini WARNING(pci_device_bus_num, check_pci_device_bus_num, NULL, ®_format, &pci_bridge);
767d7857e40STom Rini
check_pci_device_reg(struct check * c,struct dt_info * dti,struct node * node)768d7857e40STom Rini static void check_pci_device_reg(struct check *c, struct dt_info *dti, struct node *node)
769d7857e40STom Rini {
770d7857e40STom Rini struct property *prop;
771d7857e40STom Rini const char *unitname = get_unitname(node);
772d7857e40STom Rini char unit_addr[5];
773d7857e40STom Rini unsigned int dev, func, reg;
774d7857e40STom Rini cell_t *cells;
775d7857e40STom Rini
776d7857e40STom Rini if (!node->parent || (node->parent->bus != &pci_bus))
777d7857e40STom Rini return;
778d7857e40STom Rini
779d7857e40STom Rini prop = get_property(node, "reg");
780d7857e40STom Rini if (!prop) {
781d7857e40STom Rini FAIL(c, dti, "Node %s missing PCI reg property", node->fullpath);
782d7857e40STom Rini return;
783d7857e40STom Rini }
784d7857e40STom Rini
785d7857e40STom Rini cells = (cell_t *)prop->val.val;
786d7857e40STom Rini if (cells[1] || cells[2])
787d7857e40STom Rini FAIL(c, dti, "Node %s PCI reg config space address cells 2 and 3 must be 0",
788d7857e40STom Rini node->fullpath);
789d7857e40STom Rini
790d7857e40STom Rini reg = fdt32_to_cpu(cells[0]);
791d7857e40STom Rini dev = (reg & 0xf800) >> 11;
792d7857e40STom Rini func = (reg & 0x700) >> 8;
793d7857e40STom Rini
794d7857e40STom Rini if (reg & 0xff000000)
795d7857e40STom Rini FAIL(c, dti, "Node %s PCI reg address is not configuration space",
796d7857e40STom Rini node->fullpath);
797d7857e40STom Rini if (reg & 0x000000ff)
798d7857e40STom Rini FAIL(c, dti, "Node %s PCI reg config space address register number must be 0",
799d7857e40STom Rini node->fullpath);
800d7857e40STom Rini
801d7857e40STom Rini if (func == 0) {
802d7857e40STom Rini snprintf(unit_addr, sizeof(unit_addr), "%x", dev);
803d7857e40STom Rini if (streq(unitname, unit_addr))
804d7857e40STom Rini return;
805d7857e40STom Rini }
806d7857e40STom Rini
807d7857e40STom Rini snprintf(unit_addr, sizeof(unit_addr), "%x,%x", dev, func);
808d7857e40STom Rini if (streq(unitname, unit_addr))
809d7857e40STom Rini return;
810d7857e40STom Rini
811d7857e40STom Rini FAIL(c, dti, "Node %s PCI unit address format error, expected \"%s\"",
812d7857e40STom Rini node->fullpath, unit_addr);
813d7857e40STom Rini }
814d7857e40STom Rini WARNING(pci_device_reg, check_pci_device_reg, NULL, ®_format, &pci_bridge);
815d7857e40STom Rini
816d7857e40STom Rini static const struct bus_type simple_bus = {
817d7857e40STom Rini .name = "simple-bus",
818d7857e40STom Rini };
819d7857e40STom Rini
node_is_compatible(struct node * node,const char * compat)820d7857e40STom Rini static bool node_is_compatible(struct node *node, const char *compat)
821d7857e40STom Rini {
822d7857e40STom Rini struct property *prop;
823d7857e40STom Rini const char *str, *end;
824d7857e40STom Rini
825d7857e40STom Rini prop = get_property(node, "compatible");
826d7857e40STom Rini if (!prop)
827d7857e40STom Rini return false;
828d7857e40STom Rini
829d7857e40STom Rini for (str = prop->val.val, end = str + prop->val.len; str < end;
830d7857e40STom Rini str += strnlen(str, end - str) + 1) {
831d7857e40STom Rini if (strneq(str, compat, end - str))
832d7857e40STom Rini return true;
833d7857e40STom Rini }
834d7857e40STom Rini return false;
835d7857e40STom Rini }
836d7857e40STom Rini
check_simple_bus_bridge(struct check * c,struct dt_info * dti,struct node * node)837d7857e40STom Rini static void check_simple_bus_bridge(struct check *c, struct dt_info *dti, struct node *node)
838d7857e40STom Rini {
839d7857e40STom Rini if (node_is_compatible(node, "simple-bus"))
840d7857e40STom Rini node->bus = &simple_bus;
841d7857e40STom Rini }
842d7857e40STom Rini WARNING(simple_bus_bridge, check_simple_bus_bridge, NULL, &addr_size_cells);
843d7857e40STom Rini
check_simple_bus_reg(struct check * c,struct dt_info * dti,struct node * node)844d7857e40STom Rini static void check_simple_bus_reg(struct check *c, struct dt_info *dti, struct node *node)
845d7857e40STom Rini {
846d7857e40STom Rini struct property *prop;
847d7857e40STom Rini const char *unitname = get_unitname(node);
848d7857e40STom Rini char unit_addr[17];
849d7857e40STom Rini unsigned int size;
850d7857e40STom Rini uint64_t reg = 0;
851d7857e40STom Rini cell_t *cells = NULL;
852d7857e40STom Rini
853d7857e40STom Rini if (!node->parent || (node->parent->bus != &simple_bus))
854d7857e40STom Rini return;
855d7857e40STom Rini
856d7857e40STom Rini prop = get_property(node, "reg");
857d7857e40STom Rini if (prop)
858d7857e40STom Rini cells = (cell_t *)prop->val.val;
859d7857e40STom Rini else {
860d7857e40STom Rini prop = get_property(node, "ranges");
861d7857e40STom Rini if (prop && prop->val.len)
862d7857e40STom Rini /* skip of child address */
863d7857e40STom Rini cells = ((cell_t *)prop->val.val) + node_addr_cells(node);
864d7857e40STom Rini }
865d7857e40STom Rini
866d7857e40STom Rini if (!cells) {
867d7857e40STom Rini if (node->parent->parent && !(node->bus == &simple_bus))
868d7857e40STom Rini FAIL(c, dti, "Node %s missing or empty reg/ranges property", node->fullpath);
869d7857e40STom Rini return;
870d7857e40STom Rini }
871d7857e40STom Rini
872d7857e40STom Rini size = node_addr_cells(node->parent);
873d7857e40STom Rini while (size--)
874d7857e40STom Rini reg = (reg << 32) | fdt32_to_cpu(*(cells++));
875d7857e40STom Rini
876d7857e40STom Rini snprintf(unit_addr, sizeof(unit_addr), "%"PRIx64, reg);
877d7857e40STom Rini if (!streq(unitname, unit_addr))
878d7857e40STom Rini FAIL(c, dti, "Node %s simple-bus unit address format error, expected \"%s\"",
879d7857e40STom Rini node->fullpath, unit_addr);
880d7857e40STom Rini }
881d7857e40STom Rini WARNING(simple_bus_reg, check_simple_bus_reg, NULL, ®_format, &simple_bus_bridge);
882d7857e40STom Rini
check_unit_address_format(struct check * c,struct dt_info * dti,struct node * node)883d7857e40STom Rini static void check_unit_address_format(struct check *c, struct dt_info *dti,
884d7857e40STom Rini struct node *node)
885d7857e40STom Rini {
886d7857e40STom Rini const char *unitname = get_unitname(node);
887d7857e40STom Rini
888d7857e40STom Rini if (node->parent && node->parent->bus)
889d7857e40STom Rini return;
890d7857e40STom Rini
891d7857e40STom Rini if (!unitname[0])
892d7857e40STom Rini return;
893d7857e40STom Rini
894d7857e40STom Rini if (!strncmp(unitname, "0x", 2)) {
895d7857e40STom Rini FAIL(c, dti, "Node %s unit name should not have leading \"0x\"",
896d7857e40STom Rini node->fullpath);
897d7857e40STom Rini /* skip over 0x for next test */
898d7857e40STom Rini unitname += 2;
899d7857e40STom Rini }
900d7857e40STom Rini if (unitname[0] == '0' && isxdigit(unitname[1]))
901d7857e40STom Rini FAIL(c, dti, "Node %s unit name should not have leading 0s",
902d7857e40STom Rini node->fullpath);
903d7857e40STom Rini }
904d7857e40STom Rini WARNING(unit_address_format, check_unit_address_format, NULL,
905d7857e40STom Rini &node_name_format, &pci_bridge, &simple_bus_bridge);
906d7857e40STom Rini
907d18719a4STom Rini /*
908d18719a4STom Rini * Style checks
909d18719a4STom Rini */
check_avoid_default_addr_size(struct check * c,struct dt_info * dti,struct node * node)910d18719a4STom Rini static void check_avoid_default_addr_size(struct check *c, struct dt_info *dti,
911d18719a4STom Rini struct node *node)
912d18719a4STom Rini {
913d18719a4STom Rini struct property *reg, *ranges;
914d18719a4STom Rini
915d18719a4STom Rini if (!node->parent)
916d18719a4STom Rini return; /* Ignore root node */
917d18719a4STom Rini
918d18719a4STom Rini reg = get_property(node, "reg");
919d18719a4STom Rini ranges = get_property(node, "ranges");
920d18719a4STom Rini
921d18719a4STom Rini if (!reg && !ranges)
922d18719a4STom Rini return;
923d18719a4STom Rini
924d18719a4STom Rini if (node->parent->addr_cells == -1)
925d18719a4STom Rini FAIL(c, dti, "Relying on default #address-cells value for %s",
926d18719a4STom Rini node->fullpath);
927d18719a4STom Rini
928d18719a4STom Rini if (node->parent->size_cells == -1)
929d18719a4STom Rini FAIL(c, dti, "Relying on default #size-cells value for %s",
930d18719a4STom Rini node->fullpath);
931d18719a4STom Rini }
932d18719a4STom Rini WARNING(avoid_default_addr_size, check_avoid_default_addr_size, NULL,
933d18719a4STom Rini &addr_size_cells);
934d18719a4STom Rini
check_obsolete_chosen_interrupt_controller(struct check * c,struct dt_info * dti,struct node * node)935d18719a4STom Rini static void check_obsolete_chosen_interrupt_controller(struct check *c,
936d18719a4STom Rini struct dt_info *dti,
937d18719a4STom Rini struct node *node)
938d18719a4STom Rini {
939d18719a4STom Rini struct node *dt = dti->dt;
940d18719a4STom Rini struct node *chosen;
941d18719a4STom Rini struct property *prop;
942d18719a4STom Rini
943d18719a4STom Rini if (node != dt)
944d18719a4STom Rini return;
945d18719a4STom Rini
946d18719a4STom Rini
947d18719a4STom Rini chosen = get_node_by_path(dt, "/chosen");
948d18719a4STom Rini if (!chosen)
949d18719a4STom Rini return;
950d18719a4STom Rini
951d18719a4STom Rini prop = get_property(chosen, "interrupt-controller");
952d18719a4STom Rini if (prop)
953d18719a4STom Rini FAIL(c, dti, "/chosen has obsolete \"interrupt-controller\" "
954d18719a4STom Rini "property");
955d18719a4STom Rini }
956d18719a4STom Rini WARNING(obsolete_chosen_interrupt_controller,
957d18719a4STom Rini check_obsolete_chosen_interrupt_controller, NULL);
958d18719a4STom Rini
959*14df9b24SMasahiro Yamada struct provider {
960*14df9b24SMasahiro Yamada const char *prop_name;
961*14df9b24SMasahiro Yamada const char *cell_name;
962*14df9b24SMasahiro Yamada bool optional;
963*14df9b24SMasahiro Yamada };
964*14df9b24SMasahiro Yamada
check_property_phandle_args(struct check * c,struct dt_info * dti,struct node * node,struct property * prop,const struct provider * provider)965*14df9b24SMasahiro Yamada static void check_property_phandle_args(struct check *c,
966*14df9b24SMasahiro Yamada struct dt_info *dti,
967*14df9b24SMasahiro Yamada struct node *node,
968*14df9b24SMasahiro Yamada struct property *prop,
969*14df9b24SMasahiro Yamada const struct provider *provider)
970*14df9b24SMasahiro Yamada {
971*14df9b24SMasahiro Yamada struct node *root = dti->dt;
972*14df9b24SMasahiro Yamada int cell, cellsize = 0;
973*14df9b24SMasahiro Yamada
974*14df9b24SMasahiro Yamada if (prop->val.len % sizeof(cell_t)) {
975*14df9b24SMasahiro Yamada FAIL(c, dti, "property '%s' size (%d) is invalid, expected multiple of %zu in node %s",
976*14df9b24SMasahiro Yamada prop->name, prop->val.len, sizeof(cell_t), node->fullpath);
977*14df9b24SMasahiro Yamada return;
978*14df9b24SMasahiro Yamada }
979*14df9b24SMasahiro Yamada
980*14df9b24SMasahiro Yamada for (cell = 0; cell < prop->val.len / sizeof(cell_t); cell += cellsize + 1) {
981*14df9b24SMasahiro Yamada struct node *provider_node;
982*14df9b24SMasahiro Yamada struct property *cellprop;
983*14df9b24SMasahiro Yamada int phandle;
984*14df9b24SMasahiro Yamada
985*14df9b24SMasahiro Yamada phandle = propval_cell_n(prop, cell);
986*14df9b24SMasahiro Yamada /*
987*14df9b24SMasahiro Yamada * Some bindings use a cell value 0 or -1 to skip over optional
988*14df9b24SMasahiro Yamada * entries when each index position has a specific definition.
989*14df9b24SMasahiro Yamada */
990*14df9b24SMasahiro Yamada if (phandle == 0 || phandle == -1) {
991*14df9b24SMasahiro Yamada cellsize = 0;
992*14df9b24SMasahiro Yamada continue;
993*14df9b24SMasahiro Yamada }
994*14df9b24SMasahiro Yamada
995*14df9b24SMasahiro Yamada /* If we have markers, verify the current cell is a phandle */
996*14df9b24SMasahiro Yamada if (prop->val.markers) {
997*14df9b24SMasahiro Yamada struct marker *m = prop->val.markers;
998*14df9b24SMasahiro Yamada for_each_marker_of_type(m, REF_PHANDLE) {
999*14df9b24SMasahiro Yamada if (m->offset == (cell * sizeof(cell_t)))
1000*14df9b24SMasahiro Yamada break;
1001*14df9b24SMasahiro Yamada }
1002*14df9b24SMasahiro Yamada if (!m)
1003*14df9b24SMasahiro Yamada FAIL(c, dti, "Property '%s', cell %d is not a phandle reference in %s",
1004*14df9b24SMasahiro Yamada prop->name, cell, node->fullpath);
1005*14df9b24SMasahiro Yamada }
1006*14df9b24SMasahiro Yamada
1007*14df9b24SMasahiro Yamada provider_node = get_node_by_phandle(root, phandle);
1008*14df9b24SMasahiro Yamada if (!provider_node) {
1009*14df9b24SMasahiro Yamada FAIL(c, dti, "Could not get phandle node for %s:%s(cell %d)",
1010*14df9b24SMasahiro Yamada node->fullpath, prop->name, cell);
1011*14df9b24SMasahiro Yamada break;
1012*14df9b24SMasahiro Yamada }
1013*14df9b24SMasahiro Yamada
1014*14df9b24SMasahiro Yamada cellprop = get_property(provider_node, provider->cell_name);
1015*14df9b24SMasahiro Yamada if (cellprop) {
1016*14df9b24SMasahiro Yamada cellsize = propval_cell(cellprop);
1017*14df9b24SMasahiro Yamada } else if (provider->optional) {
1018*14df9b24SMasahiro Yamada cellsize = 0;
1019*14df9b24SMasahiro Yamada } else {
1020*14df9b24SMasahiro Yamada FAIL(c, dti, "Missing property '%s' in node %s or bad phandle (referred from %s:%s[%d])",
1021*14df9b24SMasahiro Yamada provider->cell_name,
1022*14df9b24SMasahiro Yamada provider_node->fullpath,
1023*14df9b24SMasahiro Yamada node->fullpath, prop->name, cell);
1024*14df9b24SMasahiro Yamada break;
1025*14df9b24SMasahiro Yamada }
1026*14df9b24SMasahiro Yamada
1027*14df9b24SMasahiro Yamada if (prop->val.len < ((cell + cellsize + 1) * sizeof(cell_t))) {
1028*14df9b24SMasahiro Yamada FAIL(c, dti, "%s property size (%d) too small for cell size %d in %s",
1029*14df9b24SMasahiro Yamada prop->name, prop->val.len, cellsize, node->fullpath);
1030*14df9b24SMasahiro Yamada }
1031*14df9b24SMasahiro Yamada }
1032*14df9b24SMasahiro Yamada }
1033*14df9b24SMasahiro Yamada
check_provider_cells_property(struct check * c,struct dt_info * dti,struct node * node)1034*14df9b24SMasahiro Yamada static void check_provider_cells_property(struct check *c,
1035*14df9b24SMasahiro Yamada struct dt_info *dti,
1036*14df9b24SMasahiro Yamada struct node *node)
1037*14df9b24SMasahiro Yamada {
1038*14df9b24SMasahiro Yamada struct provider *provider = c->data;
1039*14df9b24SMasahiro Yamada struct property *prop;
1040*14df9b24SMasahiro Yamada
1041*14df9b24SMasahiro Yamada prop = get_property(node, provider->prop_name);
1042*14df9b24SMasahiro Yamada if (!prop)
1043*14df9b24SMasahiro Yamada return;
1044*14df9b24SMasahiro Yamada
1045*14df9b24SMasahiro Yamada check_property_phandle_args(c, dti, node, prop, provider);
1046*14df9b24SMasahiro Yamada }
1047*14df9b24SMasahiro Yamada #define WARNING_PROPERTY_PHANDLE_CELLS(nm, propname, cells_name, ...) \
1048*14df9b24SMasahiro Yamada static struct provider nm##_provider = { (propname), (cells_name), __VA_ARGS__ }; \
1049*14df9b24SMasahiro Yamada WARNING(nm##_property, check_provider_cells_property, &nm##_provider, &phandle_references);
1050*14df9b24SMasahiro Yamada
1051*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(clocks, "clocks", "#clock-cells");
1052*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(cooling_device, "cooling-device", "#cooling-cells");
1053*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(dmas, "dmas", "#dma-cells");
1054*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(hwlocks, "hwlocks", "#hwlock-cells");
1055*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(interrupts_extended, "interrupts-extended", "#interrupt-cells");
1056*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(io_channels, "io-channels", "#io-channel-cells");
1057*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(iommus, "iommus", "#iommu-cells");
1058*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(mboxes, "mboxes", "#mbox-cells");
1059*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(msi_parent, "msi-parent", "#msi-cells", true);
1060*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(mux_controls, "mux-controls", "#mux-control-cells");
1061*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(phys, "phys", "#phy-cells");
1062*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(power_domains, "power-domains", "#power-domain-cells");
1063*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(pwms, "pwms", "#pwm-cells");
1064*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(resets, "resets", "#reset-cells");
1065*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(sound_dais, "sound-dais", "#sound-dai-cells");
1066*14df9b24SMasahiro Yamada WARNING_PROPERTY_PHANDLE_CELLS(thermal_sensors, "thermal-sensors", "#thermal-sensor-cells");
1067*14df9b24SMasahiro Yamada
prop_is_gpio(struct property * prop)1068*14df9b24SMasahiro Yamada static bool prop_is_gpio(struct property *prop)
1069*14df9b24SMasahiro Yamada {
1070*14df9b24SMasahiro Yamada char *str;
1071*14df9b24SMasahiro Yamada
1072*14df9b24SMasahiro Yamada /*
1073*14df9b24SMasahiro Yamada * *-gpios and *-gpio can appear in property names,
1074*14df9b24SMasahiro Yamada * so skip over any false matches (only one known ATM)
1075*14df9b24SMasahiro Yamada */
1076*14df9b24SMasahiro Yamada if (strstr(prop->name, "nr-gpio"))
1077*14df9b24SMasahiro Yamada return false;
1078*14df9b24SMasahiro Yamada
1079*14df9b24SMasahiro Yamada str = strrchr(prop->name, '-');
1080*14df9b24SMasahiro Yamada if (str)
1081*14df9b24SMasahiro Yamada str++;
1082*14df9b24SMasahiro Yamada else
1083*14df9b24SMasahiro Yamada str = prop->name;
1084*14df9b24SMasahiro Yamada if (!(streq(str, "gpios") || streq(str, "gpio")))
1085*14df9b24SMasahiro Yamada return false;
1086*14df9b24SMasahiro Yamada
1087*14df9b24SMasahiro Yamada return true;
1088*14df9b24SMasahiro Yamada }
1089*14df9b24SMasahiro Yamada
check_gpios_property(struct check * c,struct dt_info * dti,struct node * node)1090*14df9b24SMasahiro Yamada static void check_gpios_property(struct check *c,
1091*14df9b24SMasahiro Yamada struct dt_info *dti,
1092*14df9b24SMasahiro Yamada struct node *node)
1093*14df9b24SMasahiro Yamada {
1094*14df9b24SMasahiro Yamada struct property *prop;
1095*14df9b24SMasahiro Yamada
1096*14df9b24SMasahiro Yamada /* Skip GPIO hog nodes which have 'gpios' property */
1097*14df9b24SMasahiro Yamada if (get_property(node, "gpio-hog"))
1098*14df9b24SMasahiro Yamada return;
1099*14df9b24SMasahiro Yamada
1100*14df9b24SMasahiro Yamada for_each_property(node, prop) {
1101*14df9b24SMasahiro Yamada struct provider provider;
1102*14df9b24SMasahiro Yamada
1103*14df9b24SMasahiro Yamada if (!prop_is_gpio(prop))
1104*14df9b24SMasahiro Yamada continue;
1105*14df9b24SMasahiro Yamada
1106*14df9b24SMasahiro Yamada provider.prop_name = prop->name;
1107*14df9b24SMasahiro Yamada provider.cell_name = "#gpio-cells";
1108*14df9b24SMasahiro Yamada provider.optional = false;
1109*14df9b24SMasahiro Yamada check_property_phandle_args(c, dti, node, prop, &provider);
1110*14df9b24SMasahiro Yamada }
1111*14df9b24SMasahiro Yamada
1112*14df9b24SMasahiro Yamada }
1113*14df9b24SMasahiro Yamada WARNING(gpios_property, check_gpios_property, NULL, &phandle_references);
1114*14df9b24SMasahiro Yamada
check_deprecated_gpio_property(struct check * c,struct dt_info * dti,struct node * node)1115*14df9b24SMasahiro Yamada static void check_deprecated_gpio_property(struct check *c,
1116*14df9b24SMasahiro Yamada struct dt_info *dti,
1117*14df9b24SMasahiro Yamada struct node *node)
1118*14df9b24SMasahiro Yamada {
1119*14df9b24SMasahiro Yamada struct property *prop;
1120*14df9b24SMasahiro Yamada
1121*14df9b24SMasahiro Yamada for_each_property(node, prop) {
1122*14df9b24SMasahiro Yamada char *str;
1123*14df9b24SMasahiro Yamada
1124*14df9b24SMasahiro Yamada if (!prop_is_gpio(prop))
1125*14df9b24SMasahiro Yamada continue;
1126*14df9b24SMasahiro Yamada
1127*14df9b24SMasahiro Yamada str = strstr(prop->name, "gpio");
1128*14df9b24SMasahiro Yamada if (!streq(str, "gpio"))
1129*14df9b24SMasahiro Yamada continue;
1130*14df9b24SMasahiro Yamada
1131*14df9b24SMasahiro Yamada FAIL(c, dti, "'[*-]gpio' is deprecated, use '[*-]gpios' instead for %s:%s",
1132*14df9b24SMasahiro Yamada node->fullpath, prop->name);
1133*14df9b24SMasahiro Yamada }
1134*14df9b24SMasahiro Yamada
1135*14df9b24SMasahiro Yamada }
1136*14df9b24SMasahiro Yamada CHECK(deprecated_gpio_property, check_deprecated_gpio_property, NULL);
1137*14df9b24SMasahiro Yamada
node_is_interrupt_provider(struct node * node)1138*14df9b24SMasahiro Yamada static bool node_is_interrupt_provider(struct node *node)
1139*14df9b24SMasahiro Yamada {
1140*14df9b24SMasahiro Yamada struct property *prop;
1141*14df9b24SMasahiro Yamada
1142*14df9b24SMasahiro Yamada prop = get_property(node, "interrupt-controller");
1143*14df9b24SMasahiro Yamada if (prop)
1144*14df9b24SMasahiro Yamada return true;
1145*14df9b24SMasahiro Yamada
1146*14df9b24SMasahiro Yamada prop = get_property(node, "interrupt-map");
1147*14df9b24SMasahiro Yamada if (prop)
1148*14df9b24SMasahiro Yamada return true;
1149*14df9b24SMasahiro Yamada
1150*14df9b24SMasahiro Yamada return false;
1151*14df9b24SMasahiro Yamada }
check_interrupts_property(struct check * c,struct dt_info * dti,struct node * node)1152*14df9b24SMasahiro Yamada static void check_interrupts_property(struct check *c,
1153*14df9b24SMasahiro Yamada struct dt_info *dti,
1154*14df9b24SMasahiro Yamada struct node *node)
1155*14df9b24SMasahiro Yamada {
1156*14df9b24SMasahiro Yamada struct node *root = dti->dt;
1157*14df9b24SMasahiro Yamada struct node *irq_node = NULL, *parent = node;
1158*14df9b24SMasahiro Yamada struct property *irq_prop, *prop = NULL;
1159*14df9b24SMasahiro Yamada int irq_cells, phandle;
1160*14df9b24SMasahiro Yamada
1161*14df9b24SMasahiro Yamada irq_prop = get_property(node, "interrupts");
1162*14df9b24SMasahiro Yamada if (!irq_prop)
1163*14df9b24SMasahiro Yamada return;
1164*14df9b24SMasahiro Yamada
1165*14df9b24SMasahiro Yamada if (irq_prop->val.len % sizeof(cell_t))
1166*14df9b24SMasahiro Yamada FAIL(c, dti, "property '%s' size (%d) is invalid, expected multiple of %zu in node %s",
1167*14df9b24SMasahiro Yamada irq_prop->name, irq_prop->val.len, sizeof(cell_t),
1168*14df9b24SMasahiro Yamada node->fullpath);
1169*14df9b24SMasahiro Yamada
1170*14df9b24SMasahiro Yamada while (parent && !prop) {
1171*14df9b24SMasahiro Yamada if (parent != node && node_is_interrupt_provider(parent)) {
1172*14df9b24SMasahiro Yamada irq_node = parent;
1173*14df9b24SMasahiro Yamada break;
1174*14df9b24SMasahiro Yamada }
1175*14df9b24SMasahiro Yamada
1176*14df9b24SMasahiro Yamada prop = get_property(parent, "interrupt-parent");
1177*14df9b24SMasahiro Yamada if (prop) {
1178*14df9b24SMasahiro Yamada phandle = propval_cell(prop);
1179*14df9b24SMasahiro Yamada irq_node = get_node_by_phandle(root, phandle);
1180*14df9b24SMasahiro Yamada if (!irq_node) {
1181*14df9b24SMasahiro Yamada FAIL(c, dti, "Bad interrupt-parent phandle for %s",
1182*14df9b24SMasahiro Yamada node->fullpath);
1183*14df9b24SMasahiro Yamada return;
1184*14df9b24SMasahiro Yamada }
1185*14df9b24SMasahiro Yamada if (!node_is_interrupt_provider(irq_node))
1186*14df9b24SMasahiro Yamada FAIL(c, dti,
1187*14df9b24SMasahiro Yamada "Missing interrupt-controller or interrupt-map property in %s",
1188*14df9b24SMasahiro Yamada irq_node->fullpath);
1189*14df9b24SMasahiro Yamada
1190*14df9b24SMasahiro Yamada break;
1191*14df9b24SMasahiro Yamada }
1192*14df9b24SMasahiro Yamada
1193*14df9b24SMasahiro Yamada parent = parent->parent;
1194*14df9b24SMasahiro Yamada }
1195*14df9b24SMasahiro Yamada
1196*14df9b24SMasahiro Yamada if (!irq_node) {
1197*14df9b24SMasahiro Yamada FAIL(c, dti, "Missing interrupt-parent for %s", node->fullpath);
1198*14df9b24SMasahiro Yamada return;
1199*14df9b24SMasahiro Yamada }
1200*14df9b24SMasahiro Yamada
1201*14df9b24SMasahiro Yamada prop = get_property(irq_node, "#interrupt-cells");
1202*14df9b24SMasahiro Yamada if (!prop) {
1203*14df9b24SMasahiro Yamada FAIL(c, dti, "Missing #interrupt-cells in interrupt-parent %s",
1204*14df9b24SMasahiro Yamada irq_node->fullpath);
1205*14df9b24SMasahiro Yamada return;
1206*14df9b24SMasahiro Yamada }
1207*14df9b24SMasahiro Yamada
1208*14df9b24SMasahiro Yamada irq_cells = propval_cell(prop);
1209*14df9b24SMasahiro Yamada if (irq_prop->val.len % (irq_cells * sizeof(cell_t))) {
1210*14df9b24SMasahiro Yamada FAIL(c, dti,
1211*14df9b24SMasahiro Yamada "interrupts size is (%d), expected multiple of %d in %s",
1212*14df9b24SMasahiro Yamada irq_prop->val.len, (int)(irq_cells * sizeof(cell_t)),
1213*14df9b24SMasahiro Yamada node->fullpath);
1214*14df9b24SMasahiro Yamada }
1215*14df9b24SMasahiro Yamada }
1216*14df9b24SMasahiro Yamada WARNING(interrupts_property, check_interrupts_property, &phandle_references);
1217*14df9b24SMasahiro Yamada
1218d18719a4STom Rini static struct check *check_table[] = {
1219d18719a4STom Rini &duplicate_node_names, &duplicate_property_names,
1220d18719a4STom Rini &node_name_chars, &node_name_format, &property_name_chars,
1221d18719a4STom Rini &name_is_string, &name_properties,
1222d18719a4STom Rini
1223d18719a4STom Rini &duplicate_label,
1224d18719a4STom Rini
1225d18719a4STom Rini &explicit_phandles,
1226d18719a4STom Rini &phandle_references, &path_references,
1227d18719a4STom Rini
1228d18719a4STom Rini &address_cells_is_cell, &size_cells_is_cell, &interrupt_cells_is_cell,
1229d18719a4STom Rini &device_type_is_string, &model_is_string, &status_is_string,
1230d18719a4STom Rini
1231d18719a4STom Rini &property_name_chars_strict,
1232d18719a4STom Rini &node_name_chars_strict,
1233d18719a4STom Rini
1234d18719a4STom Rini &addr_size_cells, ®_format, &ranges_format,
1235d18719a4STom Rini
1236d18719a4STom Rini &unit_address_vs_reg,
1237d7857e40STom Rini &unit_address_format,
1238d7857e40STom Rini
1239d7857e40STom Rini &pci_bridge,
1240d7857e40STom Rini &pci_device_reg,
1241d7857e40STom Rini &pci_device_bus_num,
1242d7857e40STom Rini
1243d7857e40STom Rini &simple_bus_bridge,
1244d7857e40STom Rini &simple_bus_reg,
1245d18719a4STom Rini
1246d18719a4STom Rini &avoid_default_addr_size,
1247d18719a4STom Rini &obsolete_chosen_interrupt_controller,
1248d18719a4STom Rini
1249*14df9b24SMasahiro Yamada &clocks_property,
1250*14df9b24SMasahiro Yamada &cooling_device_property,
1251*14df9b24SMasahiro Yamada &dmas_property,
1252*14df9b24SMasahiro Yamada &hwlocks_property,
1253*14df9b24SMasahiro Yamada &interrupts_extended_property,
1254*14df9b24SMasahiro Yamada &io_channels_property,
1255*14df9b24SMasahiro Yamada &iommus_property,
1256*14df9b24SMasahiro Yamada &mboxes_property,
1257*14df9b24SMasahiro Yamada &msi_parent_property,
1258*14df9b24SMasahiro Yamada &mux_controls_property,
1259*14df9b24SMasahiro Yamada &phys_property,
1260*14df9b24SMasahiro Yamada &power_domains_property,
1261*14df9b24SMasahiro Yamada &pwms_property,
1262*14df9b24SMasahiro Yamada &resets_property,
1263*14df9b24SMasahiro Yamada &sound_dais_property,
1264*14df9b24SMasahiro Yamada &thermal_sensors_property,
1265*14df9b24SMasahiro Yamada
1266*14df9b24SMasahiro Yamada &deprecated_gpio_property,
1267*14df9b24SMasahiro Yamada &gpios_property,
1268*14df9b24SMasahiro Yamada &interrupts_property,
1269*14df9b24SMasahiro Yamada
1270d18719a4STom Rini &always_fail,
1271d18719a4STom Rini };
1272d18719a4STom Rini
enable_warning_error(struct check * c,bool warn,bool error)1273d18719a4STom Rini static void enable_warning_error(struct check *c, bool warn, bool error)
1274d18719a4STom Rini {
1275d18719a4STom Rini int i;
1276d18719a4STom Rini
1277d18719a4STom Rini /* Raising level, also raise it for prereqs */
1278d18719a4STom Rini if ((warn && !c->warn) || (error && !c->error))
1279d18719a4STom Rini for (i = 0; i < c->num_prereqs; i++)
1280d18719a4STom Rini enable_warning_error(c->prereq[i], warn, error);
1281d18719a4STom Rini
1282d18719a4STom Rini c->warn = c->warn || warn;
1283d18719a4STom Rini c->error = c->error || error;
1284d18719a4STom Rini }
1285d18719a4STom Rini
disable_warning_error(struct check * c,bool warn,bool error)1286d18719a4STom Rini static void disable_warning_error(struct check *c, bool warn, bool error)
1287d18719a4STom Rini {
1288d18719a4STom Rini int i;
1289d18719a4STom Rini
1290d18719a4STom Rini /* Lowering level, also lower it for things this is the prereq
1291d18719a4STom Rini * for */
1292d18719a4STom Rini if ((warn && c->warn) || (error && c->error)) {
1293d18719a4STom Rini for (i = 0; i < ARRAY_SIZE(check_table); i++) {
1294d18719a4STom Rini struct check *cc = check_table[i];
1295d18719a4STom Rini int j;
1296d18719a4STom Rini
1297d18719a4STom Rini for (j = 0; j < cc->num_prereqs; j++)
1298d18719a4STom Rini if (cc->prereq[j] == c)
1299d18719a4STom Rini disable_warning_error(cc, warn, error);
1300d18719a4STom Rini }
1301d18719a4STom Rini }
1302d18719a4STom Rini
1303d18719a4STom Rini c->warn = c->warn && !warn;
1304d18719a4STom Rini c->error = c->error && !error;
1305d18719a4STom Rini }
1306d18719a4STom Rini
parse_checks_option(bool warn,bool error,const char * arg)1307d18719a4STom Rini void parse_checks_option(bool warn, bool error, const char *arg)
1308d18719a4STom Rini {
1309d18719a4STom Rini int i;
1310d18719a4STom Rini const char *name = arg;
1311d18719a4STom Rini bool enable = true;
1312d18719a4STom Rini
1313d18719a4STom Rini if ((strncmp(arg, "no-", 3) == 0)
1314d18719a4STom Rini || (strncmp(arg, "no_", 3) == 0)) {
1315d18719a4STom Rini name = arg + 3;
1316d18719a4STom Rini enable = false;
1317d18719a4STom Rini }
1318d18719a4STom Rini
1319d18719a4STom Rini for (i = 0; i < ARRAY_SIZE(check_table); i++) {
1320d18719a4STom Rini struct check *c = check_table[i];
1321d18719a4STom Rini
1322d18719a4STom Rini if (streq(c->name, name)) {
1323d18719a4STom Rini if (enable)
1324d18719a4STom Rini enable_warning_error(c, warn, error);
1325d18719a4STom Rini else
1326d18719a4STom Rini disable_warning_error(c, warn, error);
1327d18719a4STom Rini return;
1328d18719a4STom Rini }
1329d18719a4STom Rini }
1330d18719a4STom Rini
1331d18719a4STom Rini die("Unrecognized check name \"%s\"\n", name);
1332d18719a4STom Rini }
1333d18719a4STom Rini
process_checks(bool force,struct dt_info * dti)1334d18719a4STom Rini void process_checks(bool force, struct dt_info *dti)
1335d18719a4STom Rini {
1336d18719a4STom Rini int i;
1337d18719a4STom Rini int error = 0;
1338d18719a4STom Rini
1339d18719a4STom Rini for (i = 0; i < ARRAY_SIZE(check_table); i++) {
1340d18719a4STom Rini struct check *c = check_table[i];
1341d18719a4STom Rini
1342d18719a4STom Rini if (c->warn || c->error)
1343d18719a4STom Rini error = error || run_check(c, dti);
1344d18719a4STom Rini }
1345d18719a4STom Rini
1346d18719a4STom Rini if (error) {
1347d18719a4STom Rini if (!force) {
1348d18719a4STom Rini fprintf(stderr, "ERROR: Input tree has errors, aborting "
1349d18719a4STom Rini "(use -f to force output)\n");
1350d18719a4STom Rini exit(2);
1351d18719a4STom Rini } else if (quiet < 3) {
1352d18719a4STom Rini fprintf(stderr, "Warning: Input tree has errors, "
1353d18719a4STom Rini "output forced\n");
1354d18719a4STom Rini }
1355d18719a4STom Rini }
1356d18719a4STom Rini }
1357