checks.c 54 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /*
  3. * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2007.
  4. */
  5. #include "dtc.h"
  6. #include "srcpos.h"
  7. #ifdef TRACE_CHECKS
  8. #define TRACE(c, ...) \
  9. do { \
  10. fprintf(stderr, "=== %s: ", (c)->name); \
  11. fprintf(stderr, __VA_ARGS__); \
  12. fprintf(stderr, "\n"); \
  13. } while (0)
  14. #else
  15. #define TRACE(c, fmt, ...) do { } while (0)
  16. #endif
  17. enum checkstatus {
  18. UNCHECKED = 0,
  19. PREREQ,
  20. PASSED,
  21. FAILED,
  22. };
  23. struct check;
  24. typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
  25. struct check {
  26. const char *name;
  27. check_fn fn;
  28. const void *data;
  29. bool warn, error;
  30. enum checkstatus status;
  31. bool inprogress;
  32. int num_prereqs;
  33. struct check **prereq;
  34. };
  35. #define CHECK_ENTRY(nm_, fn_, d_, w_, e_, ...) \
  36. static struct check *nm_##_prereqs[] = { __VA_ARGS__ }; \
  37. static struct check nm_ = { \
  38. .name = #nm_, \
  39. .fn = (fn_), \
  40. .data = (d_), \
  41. .warn = (w_), \
  42. .error = (e_), \
  43. .status = UNCHECKED, \
  44. .num_prereqs = ARRAY_SIZE(nm_##_prereqs), \
  45. .prereq = nm_##_prereqs, \
  46. };
  47. #define WARNING(nm_, fn_, d_, ...) \
  48. CHECK_ENTRY(nm_, fn_, d_, true, false, __VA_ARGS__)
  49. #define ERROR(nm_, fn_, d_, ...) \
  50. CHECK_ENTRY(nm_, fn_, d_, false, true, __VA_ARGS__)
  51. #define CHECK(nm_, fn_, d_, ...) \
  52. CHECK_ENTRY(nm_, fn_, d_, false, false, __VA_ARGS__)
  53. static inline void PRINTF(5, 6) check_msg(struct check *c, struct dt_info *dti,
  54. struct node *node,
  55. struct property *prop,
  56. const char *fmt, ...)
  57. {
  58. va_list ap;
  59. char *str = NULL;
  60. struct srcpos *pos = NULL;
  61. char *file_str;
  62. if (!(c->warn && (quiet < 1)) && !(c->error && (quiet < 2)))
  63. return;
  64. if (prop && prop->srcpos)
  65. pos = prop->srcpos;
  66. else if (node && node->srcpos)
  67. pos = node->srcpos;
  68. if (pos) {
  69. file_str = srcpos_string(pos);
  70. xasprintf(&str, "%s", file_str);
  71. free(file_str);
  72. } else if (streq(dti->outname, "-")) {
  73. xasprintf(&str, "<stdout>");
  74. } else {
  75. xasprintf(&str, "%s", dti->outname);
  76. }
  77. xasprintf_append(&str, ": %s (%s): ",
  78. (c->error) ? "ERROR" : "Warning", c->name);
  79. if (node) {
  80. if (prop)
  81. xasprintf_append(&str, "%s:%s: ", node->fullpath, prop->name);
  82. else
  83. xasprintf_append(&str, "%s: ", node->fullpath);
  84. }
  85. va_start(ap, fmt);
  86. xavsprintf_append(&str, fmt, ap);
  87. va_end(ap);
  88. xasprintf_append(&str, "\n");
  89. if (!prop && pos) {
  90. pos = node->srcpos;
  91. while (pos->next) {
  92. pos = pos->next;
  93. file_str = srcpos_string(pos);
  94. xasprintf_append(&str, " also defined at %s\n", file_str);
  95. free(file_str);
  96. }
  97. }
  98. fputs(str, stderr);
  99. free(str);
  100. }
  101. #define FAIL(c, dti, node, ...) \
  102. do { \
  103. TRACE((c), "\t\tFAILED at %s:%d", __FILE__, __LINE__); \
  104. (c)->status = FAILED; \
  105. check_msg((c), dti, node, NULL, __VA_ARGS__); \
  106. } while (0)
  107. #define FAIL_PROP(c, dti, node, prop, ...) \
  108. do { \
  109. TRACE((c), "\t\tFAILED at %s:%d", __FILE__, __LINE__); \
  110. (c)->status = FAILED; \
  111. check_msg((c), dti, node, prop, __VA_ARGS__); \
  112. } while (0)
  113. static void check_nodes_props(struct check *c, struct dt_info *dti, struct node *node)
  114. {
  115. struct node *child;
  116. TRACE(c, "%s", node->fullpath);
  117. if (c->fn)
  118. c->fn(c, dti, node);
  119. for_each_child(node, child)
  120. check_nodes_props(c, dti, child);
  121. }
  122. static bool is_multiple_of(int multiple, int divisor)
  123. {
  124. if (divisor == 0)
  125. return multiple == 0;
  126. else
  127. return (multiple % divisor) == 0;
  128. }
  129. static bool run_check(struct check *c, struct dt_info *dti)
  130. {
  131. struct node *dt = dti->dt;
  132. bool error = false;
  133. int i;
  134. assert(!c->inprogress);
  135. if (c->status != UNCHECKED)
  136. goto out;
  137. c->inprogress = true;
  138. for (i = 0; i < c->num_prereqs; i++) {
  139. struct check *prq = c->prereq[i];
  140. error = error || run_check(prq, dti);
  141. if (prq->status != PASSED) {
  142. c->status = PREREQ;
  143. check_msg(c, dti, NULL, NULL, "Failed prerequisite '%s'",
  144. c->prereq[i]->name);
  145. }
  146. }
  147. if (c->status != UNCHECKED)
  148. goto out;
  149. check_nodes_props(c, dti, dt);
  150. if (c->status == UNCHECKED)
  151. c->status = PASSED;
  152. TRACE(c, "\tCompleted, status %d", c->status);
  153. out:
  154. c->inprogress = false;
  155. if ((c->status != PASSED) && (c->error))
  156. error = true;
  157. return error;
  158. }
  159. /*
  160. * Utility check functions
  161. */
  162. /* A check which always fails, for testing purposes only */
  163. static inline void check_always_fail(struct check *c, struct dt_info *dti,
  164. struct node *node)
  165. {
  166. FAIL(c, dti, node, "always_fail check");
  167. }
  168. CHECK(always_fail, check_always_fail, NULL);
  169. static void check_is_string(struct check *c, struct dt_info *dti,
  170. struct node *node)
  171. {
  172. struct property *prop;
  173. const char *propname = c->data;
  174. prop = get_property(node, propname);
  175. if (!prop)
  176. return; /* Not present, assumed ok */
  177. if (!data_is_one_string(prop->val))
  178. FAIL_PROP(c, dti, node, prop, "property is not a string");
  179. }
  180. #define WARNING_IF_NOT_STRING(nm, propname) \
  181. WARNING(nm, check_is_string, (propname))
  182. #define ERROR_IF_NOT_STRING(nm, propname) \
  183. ERROR(nm, check_is_string, (propname))
  184. static void check_is_string_list(struct check *c, struct dt_info *dti,
  185. struct node *node)
  186. {
  187. int rem, l;
  188. struct property *prop;
  189. const char *propname = c->data;
  190. char *str;
  191. prop = get_property(node, propname);
  192. if (!prop)
  193. return; /* Not present, assumed ok */
  194. str = prop->val.val;
  195. rem = prop->val.len;
  196. while (rem > 0) {
  197. l = strnlen(str, rem);
  198. if (l == rem) {
  199. FAIL_PROP(c, dti, node, prop, "property is not a string list");
  200. break;
  201. }
  202. rem -= l + 1;
  203. str += l + 1;
  204. }
  205. }
  206. #define WARNING_IF_NOT_STRING_LIST(nm, propname) \
  207. WARNING(nm, check_is_string_list, (propname))
  208. #define ERROR_IF_NOT_STRING_LIST(nm, propname) \
  209. ERROR(nm, check_is_string_list, (propname))
  210. static void check_is_cell(struct check *c, struct dt_info *dti,
  211. struct node *node)
  212. {
  213. struct property *prop;
  214. const char *propname = c->data;
  215. prop = get_property(node, propname);
  216. if (!prop)
  217. return; /* Not present, assumed ok */
  218. if (prop->val.len != sizeof(cell_t))
  219. FAIL_PROP(c, dti, node, prop, "property is not a single cell");
  220. }
  221. #define WARNING_IF_NOT_CELL(nm, propname) \
  222. WARNING(nm, check_is_cell, (propname))
  223. #define ERROR_IF_NOT_CELL(nm, propname) \
  224. ERROR(nm, check_is_cell, (propname))
  225. /*
  226. * Structural check functions
  227. */
  228. static void check_duplicate_node_names(struct check *c, struct dt_info *dti,
  229. struct node *node)
  230. {
  231. struct node *child, *child2;
  232. for_each_child(node, child)
  233. for (child2 = child->next_sibling;
  234. child2;
  235. child2 = child2->next_sibling)
  236. if (streq(child->name, child2->name))
  237. FAIL(c, dti, child2, "Duplicate node name");
  238. }
  239. ERROR(duplicate_node_names, check_duplicate_node_names, NULL);
  240. static void check_duplicate_property_names(struct check *c, struct dt_info *dti,
  241. struct node *node)
  242. {
  243. struct property *prop, *prop2;
  244. for_each_property(node, prop) {
  245. for (prop2 = prop->next; prop2; prop2 = prop2->next) {
  246. if (prop2->deleted)
  247. continue;
  248. if (streq(prop->name, prop2->name))
  249. FAIL_PROP(c, dti, node, prop, "Duplicate property name");
  250. }
  251. }
  252. }
  253. ERROR(duplicate_property_names, check_duplicate_property_names, NULL);
  254. #define LOWERCASE "abcdefghijklmnopqrstuvwxyz"
  255. #define UPPERCASE "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
  256. #define DIGITS "0123456789"
  257. #define NODECHARS LOWERCASE UPPERCASE DIGITS ",._+-@"
  258. #define PROPCHARS LOWERCASE UPPERCASE DIGITS ",._+*#?-"
  259. #define PROPNODECHARSSTRICT LOWERCASE UPPERCASE DIGITS ",-"
  260. static void check_node_name_chars(struct check *c, struct dt_info *dti,
  261. struct node *node)
  262. {
  263. size_t n = strspn(node->name, c->data);
  264. if (n < strlen(node->name))
  265. FAIL(c, dti, node, "Bad character '%c' in node name",
  266. node->name[n]);
  267. }
  268. ERROR(node_name_chars, check_node_name_chars, NODECHARS);
  269. static void check_node_name_chars_strict(struct check *c, struct dt_info *dti,
  270. struct node *node)
  271. {
  272. int n = strspn(node->name, c->data);
  273. if (n < node->basenamelen)
  274. FAIL(c, dti, node, "Character '%c' not recommended in node name",
  275. node->name[n]);
  276. }
  277. CHECK(node_name_chars_strict, check_node_name_chars_strict, PROPNODECHARSSTRICT);
  278. static void check_node_name_format(struct check *c, struct dt_info *dti,
  279. struct node *node)
  280. {
  281. if (strchr(get_unitname(node), '@'))
  282. FAIL(c, dti, node, "multiple '@' characters in node name");
  283. }
  284. ERROR(node_name_format, check_node_name_format, NULL, &node_name_chars);
  285. static void check_node_name_vs_property_name(struct check *c,
  286. struct dt_info *dti,
  287. struct node *node)
  288. {
  289. if (!node->parent)
  290. return;
  291. if (get_property(node->parent, node->name)) {
  292. FAIL(c, dti, node, "node name and property name conflict");
  293. }
  294. }
  295. WARNING(node_name_vs_property_name, check_node_name_vs_property_name,
  296. NULL, &node_name_chars);
  297. static void check_unit_address_vs_reg(struct check *c, struct dt_info *dti,
  298. struct node *node)
  299. {
  300. const char *unitname = get_unitname(node);
  301. struct property *prop = get_property(node, "reg");
  302. if (get_subnode(node, "__overlay__")) {
  303. /* HACK: Overlay fragments are a special case */
  304. return;
  305. }
  306. if (!prop) {
  307. prop = get_property(node, "ranges");
  308. if (prop && !prop->val.len)
  309. prop = NULL;
  310. }
  311. if (prop) {
  312. if (!unitname[0])
  313. FAIL(c, dti, node, "node has a reg or ranges property, but no unit name");
  314. } else {
  315. if (unitname[0])
  316. FAIL(c, dti, node, "node has a unit name, but no reg or ranges property");
  317. }
  318. }
  319. WARNING(unit_address_vs_reg, check_unit_address_vs_reg, NULL);
  320. static void check_property_name_chars(struct check *c, struct dt_info *dti,
  321. struct node *node)
  322. {
  323. struct property *prop;
  324. for_each_property(node, prop) {
  325. size_t n = strspn(prop->name, c->data);
  326. if (n < strlen(prop->name))
  327. FAIL_PROP(c, dti, node, prop, "Bad character '%c' in property name",
  328. prop->name[n]);
  329. }
  330. }
  331. ERROR(property_name_chars, check_property_name_chars, PROPCHARS);
  332. static void check_property_name_chars_strict(struct check *c,
  333. struct dt_info *dti,
  334. struct node *node)
  335. {
  336. struct property *prop;
  337. for_each_property(node, prop) {
  338. const char *name = prop->name;
  339. size_t n = strspn(name, c->data);
  340. if (n == strlen(prop->name))
  341. continue;
  342. /* Certain names are whitelisted */
  343. if (streq(name, "device_type"))
  344. continue;
  345. /*
  346. * # is only allowed at the beginning of property names not counting
  347. * the vendor prefix.
  348. */
  349. if (name[n] == '#' && ((n == 0) || (name[n-1] == ','))) {
  350. name += n + 1;
  351. n = strspn(name, c->data);
  352. }
  353. if (n < strlen(name))
  354. FAIL_PROP(c, dti, node, prop, "Character '%c' not recommended in property name",
  355. name[n]);
  356. }
  357. }
  358. CHECK(property_name_chars_strict, check_property_name_chars_strict, PROPNODECHARSSTRICT);
  359. #define DESCLABEL_FMT "%s%s%s%s%s"
  360. #define DESCLABEL_ARGS(node,prop,mark) \
  361. ((mark) ? "value of " : ""), \
  362. ((prop) ? "'" : ""), \
  363. ((prop) ? (prop)->name : ""), \
  364. ((prop) ? "' in " : ""), (node)->fullpath
  365. static void check_duplicate_label(struct check *c, struct dt_info *dti,
  366. const char *label, struct node *node,
  367. struct property *prop, struct marker *mark)
  368. {
  369. struct node *dt = dti->dt;
  370. struct node *othernode = NULL;
  371. struct property *otherprop = NULL;
  372. struct marker *othermark = NULL;
  373. othernode = get_node_by_label(dt, label);
  374. if (!othernode)
  375. otherprop = get_property_by_label(dt, label, &othernode);
  376. if (!othernode)
  377. othermark = get_marker_label(dt, label, &othernode,
  378. &otherprop);
  379. if (!othernode)
  380. return;
  381. if ((othernode != node) || (otherprop != prop) || (othermark != mark))
  382. FAIL(c, dti, node, "Duplicate label '%s' on " DESCLABEL_FMT
  383. " and " DESCLABEL_FMT,
  384. label, DESCLABEL_ARGS(node, prop, mark),
  385. DESCLABEL_ARGS(othernode, otherprop, othermark));
  386. }
  387. static void check_duplicate_label_node(struct check *c, struct dt_info *dti,
  388. struct node *node)
  389. {
  390. struct label *l;
  391. struct property *prop;
  392. for_each_label(node->labels, l)
  393. check_duplicate_label(c, dti, l->label, node, NULL, NULL);
  394. for_each_property(node, prop) {
  395. struct marker *m = prop->val.markers;
  396. for_each_label(prop->labels, l)
  397. check_duplicate_label(c, dti, l->label, node, prop, NULL);
  398. for_each_marker_of_type(m, LABEL)
  399. check_duplicate_label(c, dti, m->ref, node, prop, m);
  400. }
  401. }
  402. ERROR(duplicate_label, check_duplicate_label_node, NULL);
  403. static cell_t check_phandle_prop(struct check *c, struct dt_info *dti,
  404. struct node *node, const char *propname)
  405. {
  406. struct node *root = dti->dt;
  407. struct property *prop;
  408. struct marker *m;
  409. cell_t phandle;
  410. prop = get_property(node, propname);
  411. if (!prop)
  412. return 0;
  413. if (prop->val.len != sizeof(cell_t)) {
  414. FAIL_PROP(c, dti, node, prop, "bad length (%d) %s property",
  415. prop->val.len, prop->name);
  416. return 0;
  417. }
  418. m = prop->val.markers;
  419. for_each_marker_of_type(m, REF_PHANDLE) {
  420. assert(m->offset == 0);
  421. if (node != get_node_by_ref(root, m->ref))
  422. /* "Set this node's phandle equal to some
  423. * other node's phandle". That's nonsensical
  424. * by construction. */ {
  425. FAIL(c, dti, node, "%s is a reference to another node",
  426. prop->name);
  427. }
  428. /* But setting this node's phandle equal to its own
  429. * phandle is allowed - that means allocate a unique
  430. * phandle for this node, even if it's not otherwise
  431. * referenced. The value will be filled in later, so
  432. * we treat it as having no phandle data for now. */
  433. return 0;
  434. }
  435. phandle = propval_cell(prop);
  436. if (!phandle_is_valid(phandle)) {
  437. FAIL_PROP(c, dti, node, prop, "bad value (0x%x) in %s property",
  438. phandle, prop->name);
  439. return 0;
  440. }
  441. return phandle;
  442. }
  443. static void check_explicit_phandles(struct check *c, struct dt_info *dti,
  444. struct node *node)
  445. {
  446. struct node *root = dti->dt;
  447. struct node *other;
  448. cell_t phandle, linux_phandle;
  449. /* Nothing should have assigned phandles yet */
  450. assert(!node->phandle);
  451. phandle = check_phandle_prop(c, dti, node, "phandle");
  452. linux_phandle = check_phandle_prop(c, dti, node, "linux,phandle");
  453. if (!phandle && !linux_phandle)
  454. /* No valid phandles; nothing further to check */
  455. return;
  456. if (linux_phandle && phandle && (phandle != linux_phandle))
  457. FAIL(c, dti, node, "mismatching 'phandle' and 'linux,phandle'"
  458. " properties");
  459. if (linux_phandle && !phandle)
  460. phandle = linux_phandle;
  461. other = get_node_by_phandle(root, phandle);
  462. if (other && (other != node)) {
  463. FAIL(c, dti, node, "duplicated phandle 0x%x (seen before at %s)",
  464. phandle, other->fullpath);
  465. return;
  466. }
  467. node->phandle = phandle;
  468. }
  469. ERROR(explicit_phandles, check_explicit_phandles, NULL);
  470. static void check_name_properties(struct check *c, struct dt_info *dti,
  471. struct node *node)
  472. {
  473. struct property **pp, *prop = NULL;
  474. for (pp = &node->proplist; *pp; pp = &((*pp)->next))
  475. if (streq((*pp)->name, "name")) {
  476. prop = *pp;
  477. break;
  478. }
  479. if (!prop)
  480. return; /* No name property, that's fine */
  481. if ((prop->val.len != node->basenamelen + 1U)
  482. || (memcmp(prop->val.val, node->name, node->basenamelen) != 0)) {
  483. FAIL(c, dti, node, "\"name\" property is incorrect (\"%s\" instead"
  484. " of base node name)", prop->val.val);
  485. } else {
  486. /* The name property is correct, and therefore redundant.
  487. * Delete it */
  488. *pp = prop->next;
  489. free(prop->name);
  490. data_free(prop->val);
  491. free(prop);
  492. }
  493. }
  494. ERROR_IF_NOT_STRING(name_is_string, "name");
  495. ERROR(name_properties, check_name_properties, NULL, &name_is_string);
  496. /*
  497. * Reference fixup functions
  498. */
  499. static void fixup_phandle_references(struct check *c, struct dt_info *dti,
  500. struct node *node)
  501. {
  502. struct node *dt = dti->dt;
  503. struct property *prop;
  504. for_each_property(node, prop) {
  505. struct marker *m = prop->val.markers;
  506. struct node *refnode;
  507. cell_t phandle;
  508. for_each_marker_of_type(m, REF_PHANDLE) {
  509. assert(m->offset + sizeof(cell_t) <= prop->val.len);
  510. refnode = get_node_by_ref(dt, m->ref);
  511. if (! refnode) {
  512. if (!(dti->dtsflags & DTSF_PLUGIN))
  513. FAIL(c, dti, node, "Reference to non-existent node or "
  514. "label \"%s\"\n", m->ref);
  515. else /* mark the entry as unresolved */
  516. *((fdt32_t *)(prop->val.val + m->offset)) =
  517. cpu_to_fdt32(0xffffffff);
  518. continue;
  519. }
  520. phandle = get_node_phandle(dt, refnode);
  521. *((fdt32_t *)(prop->val.val + m->offset)) = cpu_to_fdt32(phandle);
  522. reference_node(refnode);
  523. }
  524. }
  525. }
  526. ERROR(phandle_references, fixup_phandle_references, NULL,
  527. &duplicate_node_names, &explicit_phandles);
  528. static void fixup_path_references(struct check *c, struct dt_info *dti,
  529. struct node *node)
  530. {
  531. struct node *dt = dti->dt;
  532. struct property *prop;
  533. for_each_property(node, prop) {
  534. struct marker *m = prop->val.markers;
  535. struct node *refnode;
  536. char *path;
  537. for_each_marker_of_type(m, REF_PATH) {
  538. assert(m->offset <= prop->val.len);
  539. refnode = get_node_by_ref(dt, m->ref);
  540. if (!refnode) {
  541. FAIL(c, dti, node, "Reference to non-existent node or label \"%s\"\n",
  542. m->ref);
  543. continue;
  544. }
  545. path = refnode->fullpath;
  546. prop->val = data_insert_at_marker(prop->val, m, path,
  547. strlen(path) + 1);
  548. reference_node(refnode);
  549. }
  550. }
  551. }
  552. ERROR(path_references, fixup_path_references, NULL, &duplicate_node_names);
  553. static void fixup_omit_unused_nodes(struct check *c, struct dt_info *dti,
  554. struct node *node)
  555. {
  556. if (generate_symbols && node->labels)
  557. return;
  558. if (node->omit_if_unused && !node->is_referenced)
  559. delete_node(node);
  560. }
  561. ERROR(omit_unused_nodes, fixup_omit_unused_nodes, NULL, &phandle_references, &path_references);
  562. /*
  563. * Semantic checks
  564. */
  565. WARNING_IF_NOT_CELL(address_cells_is_cell, "#address-cells");
  566. WARNING_IF_NOT_CELL(size_cells_is_cell, "#size-cells");
  567. WARNING_IF_NOT_STRING(device_type_is_string, "device_type");
  568. WARNING_IF_NOT_STRING(model_is_string, "model");
  569. WARNING_IF_NOT_STRING(status_is_string, "status");
  570. WARNING_IF_NOT_STRING(label_is_string, "label");
  571. WARNING_IF_NOT_STRING_LIST(compatible_is_string_list, "compatible");
  572. static void check_names_is_string_list(struct check *c, struct dt_info *dti,
  573. struct node *node)
  574. {
  575. struct property *prop;
  576. for_each_property(node, prop) {
  577. if (!strends(prop->name, "-names"))
  578. continue;
  579. c->data = prop->name;
  580. check_is_string_list(c, dti, node);
  581. }
  582. }
  583. WARNING(names_is_string_list, check_names_is_string_list, NULL);
  584. static void check_alias_paths(struct check *c, struct dt_info *dti,
  585. struct node *node)
  586. {
  587. struct property *prop;
  588. if (!streq(node->name, "aliases"))
  589. return;
  590. for_each_property(node, prop) {
  591. if (streq(prop->name, "phandle")
  592. || streq(prop->name, "linux,phandle")) {
  593. continue;
  594. }
  595. if (!prop->val.val || !get_node_by_path(dti->dt, prop->val.val)) {
  596. FAIL_PROP(c, dti, node, prop, "aliases property is not a valid node (%s)",
  597. prop->val.val);
  598. continue;
  599. }
  600. if (strspn(prop->name, LOWERCASE DIGITS "-") != strlen(prop->name))
  601. FAIL(c, dti, node, "aliases property name must include only lowercase and '-'");
  602. }
  603. }
  604. WARNING(alias_paths, check_alias_paths, NULL);
  605. static void fixup_addr_size_cells(struct check *c, struct dt_info *dti,
  606. struct node *node)
  607. {
  608. struct property *prop;
  609. node->addr_cells = -1;
  610. node->size_cells = -1;
  611. prop = get_property(node, "#address-cells");
  612. if (prop)
  613. node->addr_cells = propval_cell(prop);
  614. prop = get_property(node, "#size-cells");
  615. if (prop)
  616. node->size_cells = propval_cell(prop);
  617. }
  618. WARNING(addr_size_cells, fixup_addr_size_cells, NULL,
  619. &address_cells_is_cell, &size_cells_is_cell);
  620. #define node_addr_cells(n) \
  621. (((n)->addr_cells == -1) ? 2 : (n)->addr_cells)
  622. #define node_size_cells(n) \
  623. (((n)->size_cells == -1) ? 1 : (n)->size_cells)
  624. static void check_reg_format(struct check *c, struct dt_info *dti,
  625. struct node *node)
  626. {
  627. struct property *prop;
  628. int addr_cells, size_cells, entrylen;
  629. prop = get_property(node, "reg");
  630. if (!prop)
  631. return; /* No "reg", that's fine */
  632. if (!node->parent) {
  633. FAIL(c, dti, node, "Root node has a \"reg\" property");
  634. return;
  635. }
  636. if (prop->val.len == 0)
  637. FAIL_PROP(c, dti, node, prop, "property is empty");
  638. addr_cells = node_addr_cells(node->parent);
  639. size_cells = node_size_cells(node->parent);
  640. entrylen = (addr_cells + size_cells) * sizeof(cell_t);
  641. if (!is_multiple_of(prop->val.len, entrylen))
  642. FAIL_PROP(c, dti, node, prop, "property has invalid length (%d bytes) "
  643. "(#address-cells == %d, #size-cells == %d)",
  644. prop->val.len, addr_cells, size_cells);
  645. }
  646. WARNING(reg_format, check_reg_format, NULL, &addr_size_cells);
  647. static void check_ranges_format(struct check *c, struct dt_info *dti,
  648. struct node *node)
  649. {
  650. struct property *prop;
  651. int c_addr_cells, p_addr_cells, c_size_cells, p_size_cells, entrylen;
  652. const char *ranges = c->data;
  653. prop = get_property(node, ranges);
  654. if (!prop)
  655. return;
  656. if (!node->parent) {
  657. FAIL_PROP(c, dti, node, prop, "Root node has a \"%s\" property",
  658. ranges);
  659. return;
  660. }
  661. p_addr_cells = node_addr_cells(node->parent);
  662. p_size_cells = node_size_cells(node->parent);
  663. c_addr_cells = node_addr_cells(node);
  664. c_size_cells = node_size_cells(node);
  665. entrylen = (p_addr_cells + c_addr_cells + c_size_cells) * sizeof(cell_t);
  666. if (prop->val.len == 0) {
  667. if (p_addr_cells != c_addr_cells)
  668. FAIL_PROP(c, dti, node, prop, "empty \"%s\" property but its "
  669. "#address-cells (%d) differs from %s (%d)",
  670. ranges, c_addr_cells, node->parent->fullpath,
  671. p_addr_cells);
  672. if (p_size_cells != c_size_cells)
  673. FAIL_PROP(c, dti, node, prop, "empty \"%s\" property but its "
  674. "#size-cells (%d) differs from %s (%d)",
  675. ranges, c_size_cells, node->parent->fullpath,
  676. p_size_cells);
  677. } else if (!is_multiple_of(prop->val.len, entrylen)) {
  678. FAIL_PROP(c, dti, node, prop, "\"%s\" property has invalid length (%d bytes) "
  679. "(parent #address-cells == %d, child #address-cells == %d, "
  680. "#size-cells == %d)", ranges, prop->val.len,
  681. p_addr_cells, c_addr_cells, c_size_cells);
  682. }
  683. }
  684. WARNING(ranges_format, check_ranges_format, "ranges", &addr_size_cells);
  685. WARNING(dma_ranges_format, check_ranges_format, "dma-ranges", &addr_size_cells);
  686. static const struct bus_type pci_bus = {
  687. .name = "PCI",
  688. };
  689. static void check_pci_bridge(struct check *c, struct dt_info *dti, struct node *node)
  690. {
  691. struct property *prop;
  692. cell_t *cells;
  693. prop = get_property(node, "device_type");
  694. if (!prop || !streq(prop->val.val, "pci"))
  695. return;
  696. node->bus = &pci_bus;
  697. if (!strprefixeq(node->name, node->basenamelen, "pci") &&
  698. !strprefixeq(node->name, node->basenamelen, "pcie"))
  699. FAIL(c, dti, node, "node name is not \"pci\" or \"pcie\"");
  700. prop = get_property(node, "ranges");
  701. if (!prop)
  702. FAIL(c, dti, node, "missing ranges for PCI bridge (or not a bridge)");
  703. if (node_addr_cells(node) != 3)
  704. FAIL(c, dti, node, "incorrect #address-cells for PCI bridge");
  705. if (node_size_cells(node) != 2)
  706. FAIL(c, dti, node, "incorrect #size-cells for PCI bridge");
  707. prop = get_property(node, "bus-range");
  708. if (!prop)
  709. return;
  710. if (prop->val.len != (sizeof(cell_t) * 2)) {
  711. FAIL_PROP(c, dti, node, prop, "value must be 2 cells");
  712. return;
  713. }
  714. cells = (cell_t *)prop->val.val;
  715. if (fdt32_to_cpu(cells[0]) > fdt32_to_cpu(cells[1]))
  716. FAIL_PROP(c, dti, node, prop, "1st cell must be less than or equal to 2nd cell");
  717. if (fdt32_to_cpu(cells[1]) > 0xff)
  718. FAIL_PROP(c, dti, node, prop, "maximum bus number must be less than 256");
  719. }
  720. WARNING(pci_bridge, check_pci_bridge, NULL,
  721. &device_type_is_string, &addr_size_cells);
  722. static void check_pci_device_bus_num(struct check *c, struct dt_info *dti, struct node *node)
  723. {
  724. struct property *prop;
  725. unsigned int bus_num, min_bus, max_bus;
  726. cell_t *cells;
  727. if (!node->parent || (node->parent->bus != &pci_bus))
  728. return;
  729. prop = get_property(node, "reg");
  730. if (!prop)
  731. return;
  732. cells = (cell_t *)prop->val.val;
  733. bus_num = (fdt32_to_cpu(cells[0]) & 0x00ff0000) >> 16;
  734. prop = get_property(node->parent, "bus-range");
  735. if (!prop) {
  736. min_bus = max_bus = 0;
  737. } else {
  738. cells = (cell_t *)prop->val.val;
  739. min_bus = fdt32_to_cpu(cells[0]);
  740. max_bus = fdt32_to_cpu(cells[1]);
  741. }
  742. if ((bus_num < min_bus) || (bus_num > max_bus))
  743. FAIL_PROP(c, dti, node, prop, "PCI bus number %d out of range, expected (%d - %d)",
  744. bus_num, min_bus, max_bus);
  745. }
  746. WARNING(pci_device_bus_num, check_pci_device_bus_num, NULL, &reg_format, &pci_bridge);
  747. static void check_pci_device_reg(struct check *c, struct dt_info *dti, struct node *node)
  748. {
  749. struct property *prop;
  750. const char *unitname = get_unitname(node);
  751. char unit_addr[5];
  752. unsigned int dev, func, reg;
  753. cell_t *cells;
  754. if (!node->parent || (node->parent->bus != &pci_bus))
  755. return;
  756. prop = get_property(node, "reg");
  757. if (!prop)
  758. return;
  759. cells = (cell_t *)prop->val.val;
  760. if (cells[1] || cells[2])
  761. FAIL_PROP(c, dti, node, prop, "PCI reg config space address cells 2 and 3 must be 0");
  762. reg = fdt32_to_cpu(cells[0]);
  763. dev = (reg & 0xf800) >> 11;
  764. func = (reg & 0x700) >> 8;
  765. if (reg & 0xff000000)
  766. FAIL_PROP(c, dti, node, prop, "PCI reg address is not configuration space");
  767. if (reg & 0x000000ff)
  768. FAIL_PROP(c, dti, node, prop, "PCI reg config space address register number must be 0");
  769. if (func == 0) {
  770. snprintf(unit_addr, sizeof(unit_addr), "%x", dev);
  771. if (streq(unitname, unit_addr))
  772. return;
  773. }
  774. snprintf(unit_addr, sizeof(unit_addr), "%x,%x", dev, func);
  775. if (streq(unitname, unit_addr))
  776. return;
  777. FAIL(c, dti, node, "PCI unit address format error, expected \"%s\"",
  778. unit_addr);
  779. }
  780. WARNING(pci_device_reg, check_pci_device_reg, NULL, &reg_format, &pci_bridge);
  781. static const struct bus_type simple_bus = {
  782. .name = "simple-bus",
  783. };
  784. static bool node_is_compatible(struct node *node, const char *compat)
  785. {
  786. struct property *prop;
  787. const char *str, *end;
  788. prop = get_property(node, "compatible");
  789. if (!prop)
  790. return false;
  791. for (str = prop->val.val, end = str + prop->val.len; str < end;
  792. str += strnlen(str, end - str) + 1) {
  793. if (streq(str, compat))
  794. return true;
  795. }
  796. return false;
  797. }
  798. static void check_simple_bus_bridge(struct check *c, struct dt_info *dti, struct node *node)
  799. {
  800. if (node_is_compatible(node, "simple-bus"))
  801. node->bus = &simple_bus;
  802. }
  803. WARNING(simple_bus_bridge, check_simple_bus_bridge, NULL,
  804. &addr_size_cells, &compatible_is_string_list);
  805. static void check_simple_bus_reg(struct check *c, struct dt_info *dti, struct node *node)
  806. {
  807. struct property *prop;
  808. const char *unitname = get_unitname(node);
  809. char unit_addr[17];
  810. unsigned int size;
  811. uint64_t reg = 0;
  812. cell_t *cells = NULL;
  813. if (!node->parent || (node->parent->bus != &simple_bus))
  814. return;
  815. prop = get_property(node, "reg");
  816. if (prop)
  817. cells = (cell_t *)prop->val.val;
  818. else {
  819. prop = get_property(node, "ranges");
  820. if (prop && prop->val.len)
  821. /* skip of child address */
  822. cells = ((cell_t *)prop->val.val) + node_addr_cells(node);
  823. }
  824. if (!cells) {
  825. if (node->parent->parent && !(node->bus == &simple_bus))
  826. FAIL(c, dti, node, "missing or empty reg/ranges property");
  827. return;
  828. }
  829. size = node_addr_cells(node->parent);
  830. while (size--)
  831. reg = (reg << 32) | fdt32_to_cpu(*(cells++));
  832. snprintf(unit_addr, sizeof(unit_addr), "%"PRIx64, reg);
  833. if (!streq(unitname, unit_addr))
  834. FAIL(c, dti, node, "simple-bus unit address format error, expected \"%s\"",
  835. unit_addr);
  836. }
  837. WARNING(simple_bus_reg, check_simple_bus_reg, NULL, &reg_format, &simple_bus_bridge);
  838. static const struct bus_type i2c_bus = {
  839. .name = "i2c-bus",
  840. };
  841. static void check_i2c_bus_bridge(struct check *c, struct dt_info *dti, struct node *node)
  842. {
  843. if (strprefixeq(node->name, node->basenamelen, "i2c-bus") ||
  844. strprefixeq(node->name, node->basenamelen, "i2c-arb")) {
  845. node->bus = &i2c_bus;
  846. } else if (strprefixeq(node->name, node->basenamelen, "i2c")) {
  847. struct node *child;
  848. for_each_child(node, child) {
  849. if (strprefixeq(child->name, node->basenamelen, "i2c-bus"))
  850. return;
  851. }
  852. node->bus = &i2c_bus;
  853. } else
  854. return;
  855. if (!node->children)
  856. return;
  857. if (node_addr_cells(node) != 1)
  858. FAIL(c, dti, node, "incorrect #address-cells for I2C bus");
  859. if (node_size_cells(node) != 0)
  860. FAIL(c, dti, node, "incorrect #size-cells for I2C bus");
  861. }
  862. WARNING(i2c_bus_bridge, check_i2c_bus_bridge, NULL, &addr_size_cells);
  863. #define I2C_OWN_SLAVE_ADDRESS (1U << 30)
  864. #define I2C_TEN_BIT_ADDRESS (1U << 31)
  865. static void check_i2c_bus_reg(struct check *c, struct dt_info *dti, struct node *node)
  866. {
  867. struct property *prop;
  868. const char *unitname = get_unitname(node);
  869. char unit_addr[17];
  870. uint32_t reg = 0;
  871. int len;
  872. cell_t *cells = NULL;
  873. if (!node->parent || (node->parent->bus != &i2c_bus))
  874. return;
  875. prop = get_property(node, "reg");
  876. if (prop)
  877. cells = (cell_t *)prop->val.val;
  878. if (!cells) {
  879. FAIL(c, dti, node, "missing or empty reg property");
  880. return;
  881. }
  882. reg = fdt32_to_cpu(*cells);
  883. /* Ignore I2C_OWN_SLAVE_ADDRESS */
  884. reg &= ~I2C_OWN_SLAVE_ADDRESS;
  885. snprintf(unit_addr, sizeof(unit_addr), "%x", reg);
  886. if (!streq(unitname, unit_addr))
  887. FAIL(c, dti, node, "I2C bus unit address format error, expected \"%s\"",
  888. unit_addr);
  889. for (len = prop->val.len; len > 0; len -= 4) {
  890. reg = fdt32_to_cpu(*(cells++));
  891. /* Ignore I2C_OWN_SLAVE_ADDRESS */
  892. reg &= ~I2C_OWN_SLAVE_ADDRESS;
  893. if (reg & I2C_TEN_BIT_ADDRESS) {
  894. if ((reg & ~I2C_TEN_BIT_ADDRESS) > 0x3ff)
  895. FAIL_PROP(c, dti, node, prop, "I2C address must be less than 10-bits, got \"0x%x\"",
  896. reg);
  897. } else if (reg > 0x7f)
  898. FAIL_PROP(c, dti, node, prop, "I2C address must be less than 7-bits, got \"0x%x\". Set I2C_TEN_BIT_ADDRESS for 10 bit addresses or fix the property",
  899. reg);
  900. }
  901. }
  902. WARNING(i2c_bus_reg, check_i2c_bus_reg, NULL, &reg_format, &i2c_bus_bridge);
  903. static const struct bus_type spi_bus = {
  904. .name = "spi-bus",
  905. };
  906. static void check_spi_bus_bridge(struct check *c, struct dt_info *dti, struct node *node)
  907. {
  908. int spi_addr_cells = 1;
  909. if (strprefixeq(node->name, node->basenamelen, "spi")) {
  910. node->bus = &spi_bus;
  911. } else {
  912. /* Try to detect SPI buses which don't have proper node name */
  913. struct node *child;
  914. if (node_addr_cells(node) != 1 || node_size_cells(node) != 0)
  915. return;
  916. for_each_child(node, child) {
  917. struct property *prop;
  918. for_each_property(child, prop) {
  919. if (strstarts(prop->name, "spi-")) {
  920. node->bus = &spi_bus;
  921. break;
  922. }
  923. }
  924. if (node->bus == &spi_bus)
  925. break;
  926. }
  927. if (node->bus == &spi_bus && get_property(node, "reg"))
  928. FAIL(c, dti, node, "node name for SPI buses should be 'spi'");
  929. }
  930. if (node->bus != &spi_bus || !node->children)
  931. return;
  932. if (get_property(node, "spi-slave"))
  933. spi_addr_cells = 0;
  934. if (node_addr_cells(node) != spi_addr_cells)
  935. FAIL(c, dti, node, "incorrect #address-cells for SPI bus");
  936. if (node_size_cells(node) != 0)
  937. FAIL(c, dti, node, "incorrect #size-cells for SPI bus");
  938. }
  939. WARNING(spi_bus_bridge, check_spi_bus_bridge, NULL, &addr_size_cells);
  940. static void check_spi_bus_reg(struct check *c, struct dt_info *dti, struct node *node)
  941. {
  942. struct property *prop;
  943. const char *unitname = get_unitname(node);
  944. char unit_addr[9];
  945. uint32_t reg = 0;
  946. cell_t *cells = NULL;
  947. if (!node->parent || (node->parent->bus != &spi_bus))
  948. return;
  949. if (get_property(node->parent, "spi-slave"))
  950. return;
  951. prop = get_property(node, "reg");
  952. if (prop)
  953. cells = (cell_t *)prop->val.val;
  954. if (!cells) {
  955. FAIL(c, dti, node, "missing or empty reg property");
  956. return;
  957. }
  958. reg = fdt32_to_cpu(*cells);
  959. snprintf(unit_addr, sizeof(unit_addr), "%x", reg);
  960. if (!streq(unitname, unit_addr))
  961. FAIL(c, dti, node, "SPI bus unit address format error, expected \"%s\"",
  962. unit_addr);
  963. }
  964. WARNING(spi_bus_reg, check_spi_bus_reg, NULL, &reg_format, &spi_bus_bridge);
  965. static void check_unit_address_format(struct check *c, struct dt_info *dti,
  966. struct node *node)
  967. {
  968. const char *unitname = get_unitname(node);
  969. if (node->parent && node->parent->bus)
  970. return;
  971. if (!unitname[0])
  972. return;
  973. if (!strncmp(unitname, "0x", 2)) {
  974. FAIL(c, dti, node, "unit name should not have leading \"0x\"");
  975. /* skip over 0x for next test */
  976. unitname += 2;
  977. }
  978. if (unitname[0] == '0' && isxdigit((unsigned char)unitname[1]))
  979. FAIL(c, dti, node, "unit name should not have leading 0s");
  980. }
  981. WARNING(unit_address_format, check_unit_address_format, NULL,
  982. &node_name_format, &pci_bridge, &simple_bus_bridge);
  983. /*
  984. * Style checks
  985. */
  986. static void check_avoid_default_addr_size(struct check *c, struct dt_info *dti,
  987. struct node *node)
  988. {
  989. struct property *reg, *ranges;
  990. if (!node->parent)
  991. return; /* Ignore root node */
  992. reg = get_property(node, "reg");
  993. ranges = get_property(node, "ranges");
  994. if (!reg && !ranges)
  995. return;
  996. if (node->parent->addr_cells == -1)
  997. FAIL(c, dti, node, "Relying on default #address-cells value");
  998. if (node->parent->size_cells == -1)
  999. FAIL(c, dti, node, "Relying on default #size-cells value");
  1000. }
  1001. WARNING(avoid_default_addr_size, check_avoid_default_addr_size, NULL,
  1002. &addr_size_cells);
  1003. static void check_avoid_unnecessary_addr_size(struct check *c, struct dt_info *dti,
  1004. struct node *node)
  1005. {
  1006. struct property *prop;
  1007. struct node *child;
  1008. bool has_reg = false;
  1009. if (!node->parent || node->addr_cells < 0 || node->size_cells < 0)
  1010. return;
  1011. if (get_property(node, "ranges") || get_property(node, "dma-ranges") || !node->children)
  1012. return;
  1013. for_each_child(node, child) {
  1014. prop = get_property(child, "reg");
  1015. if (prop)
  1016. has_reg = true;
  1017. }
  1018. if (!has_reg)
  1019. FAIL(c, dti, node, "unnecessary #address-cells/#size-cells without \"ranges\", \"dma-ranges\" or child \"reg\" property");
  1020. }
  1021. WARNING(avoid_unnecessary_addr_size, check_avoid_unnecessary_addr_size, NULL, &avoid_default_addr_size);
  1022. static bool node_is_disabled(struct node *node)
  1023. {
  1024. struct property *prop;
  1025. prop = get_property(node, "status");
  1026. if (prop) {
  1027. char *str = prop->val.val;
  1028. if (streq("disabled", str))
  1029. return true;
  1030. }
  1031. return false;
  1032. }
  1033. static void check_unique_unit_address_common(struct check *c,
  1034. struct dt_info *dti,
  1035. struct node *node,
  1036. bool disable_check)
  1037. {
  1038. struct node *childa;
  1039. if (node->addr_cells < 0 || node->size_cells < 0)
  1040. return;
  1041. if (!node->children)
  1042. return;
  1043. for_each_child(node, childa) {
  1044. struct node *childb;
  1045. const char *addr_a = get_unitname(childa);
  1046. if (!strlen(addr_a))
  1047. continue;
  1048. if (disable_check && node_is_disabled(childa))
  1049. continue;
  1050. for_each_child(node, childb) {
  1051. const char *addr_b = get_unitname(childb);
  1052. if (childa == childb)
  1053. break;
  1054. if (disable_check && node_is_disabled(childb))
  1055. continue;
  1056. if (streq(addr_a, addr_b))
  1057. FAIL(c, dti, childb, "duplicate unit-address (also used in node %s)", childa->fullpath);
  1058. }
  1059. }
  1060. }
  1061. static void check_unique_unit_address(struct check *c, struct dt_info *dti,
  1062. struct node *node)
  1063. {
  1064. check_unique_unit_address_common(c, dti, node, false);
  1065. }
  1066. WARNING(unique_unit_address, check_unique_unit_address, NULL, &avoid_default_addr_size);
  1067. static void check_unique_unit_address_if_enabled(struct check *c, struct dt_info *dti,
  1068. struct node *node)
  1069. {
  1070. check_unique_unit_address_common(c, dti, node, true);
  1071. }
  1072. CHECK_ENTRY(unique_unit_address_if_enabled, check_unique_unit_address_if_enabled,
  1073. NULL, false, false, &avoid_default_addr_size);
  1074. static void check_obsolete_chosen_interrupt_controller(struct check *c,
  1075. struct dt_info *dti,
  1076. struct node *node)
  1077. {
  1078. struct node *dt = dti->dt;
  1079. struct node *chosen;
  1080. struct property *prop;
  1081. if (node != dt)
  1082. return;
  1083. chosen = get_node_by_path(dt, "/chosen");
  1084. if (!chosen)
  1085. return;
  1086. prop = get_property(chosen, "interrupt-controller");
  1087. if (prop)
  1088. FAIL_PROP(c, dti, node, prop,
  1089. "/chosen has obsolete \"interrupt-controller\" property");
  1090. }
  1091. WARNING(obsolete_chosen_interrupt_controller,
  1092. check_obsolete_chosen_interrupt_controller, NULL);
  1093. static void check_chosen_node_is_root(struct check *c, struct dt_info *dti,
  1094. struct node *node)
  1095. {
  1096. if (!streq(node->name, "chosen"))
  1097. return;
  1098. if (node->parent != dti->dt)
  1099. FAIL(c, dti, node, "chosen node must be at root node");
  1100. }
  1101. WARNING(chosen_node_is_root, check_chosen_node_is_root, NULL);
  1102. static void check_chosen_node_bootargs(struct check *c, struct dt_info *dti,
  1103. struct node *node)
  1104. {
  1105. struct property *prop;
  1106. if (!streq(node->name, "chosen"))
  1107. return;
  1108. prop = get_property(node, "bootargs");
  1109. if (!prop)
  1110. return;
  1111. c->data = prop->name;
  1112. check_is_string(c, dti, node);
  1113. }
  1114. WARNING(chosen_node_bootargs, check_chosen_node_bootargs, NULL);
  1115. static void check_chosen_node_stdout_path(struct check *c, struct dt_info *dti,
  1116. struct node *node)
  1117. {
  1118. struct property *prop;
  1119. if (!streq(node->name, "chosen"))
  1120. return;
  1121. prop = get_property(node, "stdout-path");
  1122. if (!prop) {
  1123. prop = get_property(node, "linux,stdout-path");
  1124. if (!prop)
  1125. return;
  1126. FAIL_PROP(c, dti, node, prop, "Use 'stdout-path' instead");
  1127. }
  1128. c->data = prop->name;
  1129. check_is_string(c, dti, node);
  1130. }
  1131. WARNING(chosen_node_stdout_path, check_chosen_node_stdout_path, NULL);
  1132. struct provider {
  1133. const char *prop_name;
  1134. const char *cell_name;
  1135. bool optional;
  1136. };
  1137. static void check_property_phandle_args(struct check *c,
  1138. struct dt_info *dti,
  1139. struct node *node,
  1140. struct property *prop,
  1141. const struct provider *provider)
  1142. {
  1143. struct node *root = dti->dt;
  1144. unsigned int cell, cellsize = 0;
  1145. if (!is_multiple_of(prop->val.len, sizeof(cell_t))) {
  1146. FAIL_PROP(c, dti, node, prop,
  1147. "property size (%d) is invalid, expected multiple of %zu",
  1148. prop->val.len, sizeof(cell_t));
  1149. return;
  1150. }
  1151. for (cell = 0; cell < prop->val.len / sizeof(cell_t); cell += cellsize + 1) {
  1152. struct node *provider_node;
  1153. struct property *cellprop;
  1154. cell_t phandle;
  1155. unsigned int expected;
  1156. phandle = propval_cell_n(prop, cell);
  1157. /*
  1158. * Some bindings use a cell value 0 or -1 to skip over optional
  1159. * entries when each index position has a specific definition.
  1160. */
  1161. if (!phandle_is_valid(phandle)) {
  1162. /* Give up if this is an overlay with external references */
  1163. if (dti->dtsflags & DTSF_PLUGIN)
  1164. break;
  1165. cellsize = 0;
  1166. continue;
  1167. }
  1168. /* If we have markers, verify the current cell is a phandle */
  1169. if (prop->val.markers) {
  1170. struct marker *m = prop->val.markers;
  1171. for_each_marker_of_type(m, REF_PHANDLE) {
  1172. if (m->offset == (cell * sizeof(cell_t)))
  1173. break;
  1174. }
  1175. if (!m)
  1176. FAIL_PROP(c, dti, node, prop,
  1177. "cell %d is not a phandle reference",
  1178. cell);
  1179. }
  1180. provider_node = get_node_by_phandle(root, phandle);
  1181. if (!provider_node) {
  1182. FAIL_PROP(c, dti, node, prop,
  1183. "Could not get phandle node for (cell %d)",
  1184. cell);
  1185. break;
  1186. }
  1187. cellprop = get_property(provider_node, provider->cell_name);
  1188. if (cellprop) {
  1189. cellsize = propval_cell(cellprop);
  1190. } else if (provider->optional) {
  1191. cellsize = 0;
  1192. } else {
  1193. FAIL(c, dti, node, "Missing property '%s' in node %s or bad phandle (referred from %s[%d])",
  1194. provider->cell_name,
  1195. provider_node->fullpath,
  1196. prop->name, cell);
  1197. break;
  1198. }
  1199. expected = (cell + cellsize + 1) * sizeof(cell_t);
  1200. if ((expected <= cell) || prop->val.len < expected) {
  1201. FAIL_PROP(c, dti, node, prop,
  1202. "property size (%d) too small for cell size %u",
  1203. prop->val.len, cellsize);
  1204. break;
  1205. }
  1206. }
  1207. }
  1208. static void check_provider_cells_property(struct check *c,
  1209. struct dt_info *dti,
  1210. struct node *node)
  1211. {
  1212. const struct provider *provider = c->data;
  1213. struct property *prop;
  1214. prop = get_property(node, provider->prop_name);
  1215. if (!prop)
  1216. return;
  1217. check_property_phandle_args(c, dti, node, prop, provider);
  1218. }
  1219. #define WARNING_PROPERTY_PHANDLE_CELLS(nm, propname, cells_name, ...) \
  1220. static struct provider nm##_provider = { (propname), (cells_name), __VA_ARGS__ }; \
  1221. WARNING_IF_NOT_CELL(nm##_is_cell, cells_name); \
  1222. WARNING(nm##_property, check_provider_cells_property, &nm##_provider, &nm##_is_cell, &phandle_references);
  1223. WARNING_PROPERTY_PHANDLE_CELLS(clocks, "clocks", "#clock-cells");
  1224. WARNING_PROPERTY_PHANDLE_CELLS(cooling_device, "cooling-device", "#cooling-cells");
  1225. WARNING_PROPERTY_PHANDLE_CELLS(dmas, "dmas", "#dma-cells");
  1226. WARNING_PROPERTY_PHANDLE_CELLS(hwlocks, "hwlocks", "#hwlock-cells");
  1227. WARNING_PROPERTY_PHANDLE_CELLS(interrupts_extended, "interrupts-extended", "#interrupt-cells");
  1228. WARNING_PROPERTY_PHANDLE_CELLS(io_channels, "io-channels", "#io-channel-cells");
  1229. WARNING_PROPERTY_PHANDLE_CELLS(iommus, "iommus", "#iommu-cells");
  1230. WARNING_PROPERTY_PHANDLE_CELLS(mboxes, "mboxes", "#mbox-cells");
  1231. WARNING_PROPERTY_PHANDLE_CELLS(msi_parent, "msi-parent", "#msi-cells", true);
  1232. WARNING_PROPERTY_PHANDLE_CELLS(mux_controls, "mux-controls", "#mux-control-cells");
  1233. WARNING_PROPERTY_PHANDLE_CELLS(phys, "phys", "#phy-cells");
  1234. WARNING_PROPERTY_PHANDLE_CELLS(power_domains, "power-domains", "#power-domain-cells");
  1235. WARNING_PROPERTY_PHANDLE_CELLS(pwms, "pwms", "#pwm-cells");
  1236. WARNING_PROPERTY_PHANDLE_CELLS(resets, "resets", "#reset-cells");
  1237. WARNING_PROPERTY_PHANDLE_CELLS(sound_dai, "sound-dai", "#sound-dai-cells");
  1238. WARNING_PROPERTY_PHANDLE_CELLS(thermal_sensors, "thermal-sensors", "#thermal-sensor-cells");
  1239. static bool prop_is_gpio(struct property *prop)
  1240. {
  1241. /*
  1242. * *-gpios and *-gpio can appear in property names,
  1243. * so skip over any false matches (only one known ATM)
  1244. */
  1245. if (strends(prop->name, ",nr-gpios"))
  1246. return false;
  1247. return strends(prop->name, "-gpios") ||
  1248. streq(prop->name, "gpios") ||
  1249. strends(prop->name, "-gpio") ||
  1250. streq(prop->name, "gpio");
  1251. }
  1252. static void check_gpios_property(struct check *c,
  1253. struct dt_info *dti,
  1254. struct node *node)
  1255. {
  1256. struct property *prop;
  1257. /* Skip GPIO hog nodes which have 'gpios' property */
  1258. if (get_property(node, "gpio-hog"))
  1259. return;
  1260. for_each_property(node, prop) {
  1261. struct provider provider;
  1262. if (!prop_is_gpio(prop))
  1263. continue;
  1264. provider.prop_name = prop->name;
  1265. provider.cell_name = "#gpio-cells";
  1266. provider.optional = false;
  1267. check_property_phandle_args(c, dti, node, prop, &provider);
  1268. }
  1269. }
  1270. WARNING(gpios_property, check_gpios_property, NULL, &phandle_references);
  1271. static void check_deprecated_gpio_property(struct check *c,
  1272. struct dt_info *dti,
  1273. struct node *node)
  1274. {
  1275. struct property *prop;
  1276. for_each_property(node, prop) {
  1277. if (!prop_is_gpio(prop))
  1278. continue;
  1279. if (!strends(prop->name, "gpio"))
  1280. continue;
  1281. FAIL_PROP(c, dti, node, prop,
  1282. "'[*-]gpio' is deprecated, use '[*-]gpios' instead");
  1283. }
  1284. }
  1285. CHECK(deprecated_gpio_property, check_deprecated_gpio_property, NULL);
  1286. static bool node_is_interrupt_provider(struct node *node)
  1287. {
  1288. struct property *prop;
  1289. prop = get_property(node, "interrupt-controller");
  1290. if (prop)
  1291. return true;
  1292. prop = get_property(node, "interrupt-map");
  1293. if (prop)
  1294. return true;
  1295. return false;
  1296. }
  1297. static void check_interrupt_provider(struct check *c,
  1298. struct dt_info *dti,
  1299. struct node *node)
  1300. {
  1301. struct property *prop;
  1302. bool irq_provider = node_is_interrupt_provider(node);
  1303. prop = get_property(node, "#interrupt-cells");
  1304. if (irq_provider && !prop) {
  1305. FAIL(c, dti, node,
  1306. "Missing '#interrupt-cells' in interrupt provider");
  1307. return;
  1308. }
  1309. if (!irq_provider && prop) {
  1310. FAIL(c, dti, node,
  1311. "'#interrupt-cells' found, but node is not an interrupt provider");
  1312. return;
  1313. }
  1314. }
  1315. WARNING(interrupt_provider, check_interrupt_provider, NULL, &interrupts_extended_is_cell);
  1316. static void check_interrupt_map(struct check *c,
  1317. struct dt_info *dti,
  1318. struct node *node)
  1319. {
  1320. struct node *root = dti->dt;
  1321. struct property *prop, *irq_map_prop;
  1322. size_t cellsize, cell, map_cells;
  1323. irq_map_prop = get_property(node, "interrupt-map");
  1324. if (!irq_map_prop)
  1325. return;
  1326. if (node->addr_cells < 0) {
  1327. FAIL(c, dti, node,
  1328. "Missing '#address-cells' in interrupt-map provider");
  1329. return;
  1330. }
  1331. cellsize = node_addr_cells(node);
  1332. cellsize += propval_cell(get_property(node, "#interrupt-cells"));
  1333. prop = get_property(node, "interrupt-map-mask");
  1334. if (prop && (prop->val.len != (cellsize * sizeof(cell_t))))
  1335. FAIL_PROP(c, dti, node, prop,
  1336. "property size (%d) is invalid, expected %zu",
  1337. prop->val.len, cellsize * sizeof(cell_t));
  1338. if (!is_multiple_of(irq_map_prop->val.len, sizeof(cell_t))) {
  1339. FAIL_PROP(c, dti, node, irq_map_prop,
  1340. "property size (%d) is invalid, expected multiple of %zu",
  1341. irq_map_prop->val.len, sizeof(cell_t));
  1342. return;
  1343. }
  1344. map_cells = irq_map_prop->val.len / sizeof(cell_t);
  1345. for (cell = 0; cell < map_cells; ) {
  1346. struct node *provider_node;
  1347. struct property *cellprop;
  1348. int phandle;
  1349. size_t parent_cellsize;
  1350. if ((cell + cellsize) >= map_cells) {
  1351. FAIL_PROP(c, dti, node, irq_map_prop,
  1352. "property size (%d) too small, expected > %zu",
  1353. irq_map_prop->val.len, (cell + cellsize) * sizeof(cell_t));
  1354. break;
  1355. }
  1356. cell += cellsize;
  1357. phandle = propval_cell_n(irq_map_prop, cell);
  1358. if (!phandle_is_valid(phandle)) {
  1359. /* Give up if this is an overlay with external references */
  1360. if (!(dti->dtsflags & DTSF_PLUGIN))
  1361. FAIL_PROP(c, dti, node, irq_map_prop,
  1362. "Cell %zu is not a phandle(%d)",
  1363. cell, phandle);
  1364. break;
  1365. }
  1366. provider_node = get_node_by_phandle(root, phandle);
  1367. if (!provider_node) {
  1368. FAIL_PROP(c, dti, node, irq_map_prop,
  1369. "Could not get phandle(%d) node for (cell %zu)",
  1370. phandle, cell);
  1371. break;
  1372. }
  1373. cellprop = get_property(provider_node, "#interrupt-cells");
  1374. if (cellprop) {
  1375. parent_cellsize = propval_cell(cellprop);
  1376. } else {
  1377. FAIL(c, dti, node, "Missing property '#interrupt-cells' in node %s or bad phandle (referred from interrupt-map[%zu])",
  1378. provider_node->fullpath, cell);
  1379. break;
  1380. }
  1381. cellprop = get_property(provider_node, "#address-cells");
  1382. if (cellprop)
  1383. parent_cellsize += propval_cell(cellprop);
  1384. cell += 1 + parent_cellsize;
  1385. if (cell > map_cells)
  1386. FAIL_PROP(c, dti, node, irq_map_prop,
  1387. "property size (%d) mismatch, expected %zu",
  1388. irq_map_prop->val.len, cell * sizeof(cell_t));
  1389. }
  1390. }
  1391. WARNING(interrupt_map, check_interrupt_map, NULL, &phandle_references, &addr_size_cells, &interrupt_provider);
  1392. static void check_interrupts_property(struct check *c,
  1393. struct dt_info *dti,
  1394. struct node *node)
  1395. {
  1396. struct node *root = dti->dt;
  1397. struct node *irq_node = NULL, *parent = node;
  1398. struct property *irq_prop, *prop = NULL;
  1399. cell_t irq_cells, phandle;
  1400. irq_prop = get_property(node, "interrupts");
  1401. if (!irq_prop)
  1402. return;
  1403. if (!is_multiple_of(irq_prop->val.len, sizeof(cell_t)))
  1404. FAIL_PROP(c, dti, node, irq_prop, "size (%d) is invalid, expected multiple of %zu",
  1405. irq_prop->val.len, sizeof(cell_t));
  1406. while (parent && !prop) {
  1407. if (parent != node && node_is_interrupt_provider(parent)) {
  1408. irq_node = parent;
  1409. break;
  1410. }
  1411. prop = get_property(parent, "interrupt-parent");
  1412. if (prop) {
  1413. phandle = propval_cell(prop);
  1414. if (!phandle_is_valid(phandle)) {
  1415. /* Give up if this is an overlay with
  1416. * external references */
  1417. if (dti->dtsflags & DTSF_PLUGIN)
  1418. return;
  1419. FAIL_PROP(c, dti, parent, prop, "Invalid phandle");
  1420. continue;
  1421. }
  1422. irq_node = get_node_by_phandle(root, phandle);
  1423. if (!irq_node) {
  1424. FAIL_PROP(c, dti, parent, prop, "Bad phandle");
  1425. return;
  1426. }
  1427. if (!node_is_interrupt_provider(irq_node))
  1428. FAIL(c, dti, irq_node,
  1429. "Missing interrupt-controller or interrupt-map property");
  1430. break;
  1431. }
  1432. parent = parent->parent;
  1433. }
  1434. if (!irq_node) {
  1435. FAIL(c, dti, node, "Missing interrupt-parent");
  1436. return;
  1437. }
  1438. prop = get_property(irq_node, "#interrupt-cells");
  1439. if (!prop) {
  1440. /* We warn about that already in another test. */
  1441. return;
  1442. }
  1443. irq_cells = propval_cell(prop);
  1444. if (!is_multiple_of(irq_prop->val.len, irq_cells * sizeof(cell_t))) {
  1445. FAIL_PROP(c, dti, node, prop,
  1446. "size is (%d), expected multiple of %d",
  1447. irq_prop->val.len, (int)(irq_cells * sizeof(cell_t)));
  1448. }
  1449. }
  1450. WARNING(interrupts_property, check_interrupts_property, &phandle_references);
  1451. static const struct bus_type graph_port_bus = {
  1452. .name = "graph-port",
  1453. };
  1454. static const struct bus_type graph_ports_bus = {
  1455. .name = "graph-ports",
  1456. };
  1457. static void check_graph_nodes(struct check *c, struct dt_info *dti,
  1458. struct node *node)
  1459. {
  1460. struct node *child;
  1461. for_each_child(node, child) {
  1462. if (!(strprefixeq(child->name, child->basenamelen, "endpoint") ||
  1463. get_property(child, "remote-endpoint")))
  1464. continue;
  1465. /* The root node cannot be a port */
  1466. if (!node->parent) {
  1467. FAIL(c, dti, node, "root node contains endpoint node '%s', potentially misplaced remote-endpoint property", child->name);
  1468. continue;
  1469. }
  1470. node->bus = &graph_port_bus;
  1471. /* The parent of 'port' nodes can be either 'ports' or a device */
  1472. if (!node->parent->bus &&
  1473. (streq(node->parent->name, "ports") || get_property(node, "reg")))
  1474. node->parent->bus = &graph_ports_bus;
  1475. break;
  1476. }
  1477. }
  1478. WARNING(graph_nodes, check_graph_nodes, NULL);
  1479. static void check_graph_reg(struct check *c, struct dt_info *dti,
  1480. struct node *node)
  1481. {
  1482. char unit_addr[9];
  1483. const char *unitname = get_unitname(node);
  1484. struct property *prop;
  1485. prop = get_property(node, "reg");
  1486. if (!prop || !unitname)
  1487. return;
  1488. if (!(prop->val.val && prop->val.len == sizeof(cell_t))) {
  1489. FAIL(c, dti, node, "graph node malformed 'reg' property");
  1490. return;
  1491. }
  1492. snprintf(unit_addr, sizeof(unit_addr), "%x", propval_cell(prop));
  1493. if (!streq(unitname, unit_addr))
  1494. FAIL(c, dti, node, "graph node unit address error, expected \"%s\"",
  1495. unit_addr);
  1496. if (node->parent->addr_cells != 1)
  1497. FAIL_PROP(c, dti, node, get_property(node, "#address-cells"),
  1498. "graph node '#address-cells' is %d, must be 1",
  1499. node->parent->addr_cells);
  1500. if (node->parent->size_cells != 0)
  1501. FAIL_PROP(c, dti, node, get_property(node, "#size-cells"),
  1502. "graph node '#size-cells' is %d, must be 0",
  1503. node->parent->size_cells);
  1504. }
  1505. static void check_graph_port(struct check *c, struct dt_info *dti,
  1506. struct node *node)
  1507. {
  1508. if (node->bus != &graph_port_bus)
  1509. return;
  1510. check_graph_reg(c, dti, node);
  1511. /* skip checks below for overlays */
  1512. if (dti->dtsflags & DTSF_PLUGIN)
  1513. return;
  1514. if (!strprefixeq(node->name, node->basenamelen, "port"))
  1515. FAIL(c, dti, node, "graph port node name should be 'port'");
  1516. }
  1517. WARNING(graph_port, check_graph_port, NULL, &graph_nodes);
  1518. static struct node *get_remote_endpoint(struct check *c, struct dt_info *dti,
  1519. struct node *endpoint)
  1520. {
  1521. cell_t phandle;
  1522. struct node *node;
  1523. struct property *prop;
  1524. prop = get_property(endpoint, "remote-endpoint");
  1525. if (!prop)
  1526. return NULL;
  1527. phandle = propval_cell(prop);
  1528. /* Give up if this is an overlay with external references */
  1529. if (!phandle_is_valid(phandle))
  1530. return NULL;
  1531. node = get_node_by_phandle(dti->dt, phandle);
  1532. if (!node)
  1533. FAIL_PROP(c, dti, endpoint, prop, "graph phandle is not valid");
  1534. return node;
  1535. }
  1536. static void check_graph_endpoint(struct check *c, struct dt_info *dti,
  1537. struct node *node)
  1538. {
  1539. struct node *remote_node;
  1540. if (!node->parent || node->parent->bus != &graph_port_bus)
  1541. return;
  1542. check_graph_reg(c, dti, node);
  1543. /* skip checks below for overlays */
  1544. if (dti->dtsflags & DTSF_PLUGIN)
  1545. return;
  1546. if (!strprefixeq(node->name, node->basenamelen, "endpoint"))
  1547. FAIL(c, dti, node, "graph endpoint node name should be 'endpoint'");
  1548. remote_node = get_remote_endpoint(c, dti, node);
  1549. if (!remote_node)
  1550. return;
  1551. if (get_remote_endpoint(c, dti, remote_node) != node)
  1552. FAIL(c, dti, node, "graph connection to node '%s' is not bidirectional",
  1553. remote_node->fullpath);
  1554. }
  1555. WARNING(graph_endpoint, check_graph_endpoint, NULL, &graph_nodes);
  1556. static void check_graph_child_address(struct check *c, struct dt_info *dti,
  1557. struct node *node)
  1558. {
  1559. int cnt = 0;
  1560. struct node *child;
  1561. if (node->bus != &graph_ports_bus && node->bus != &graph_port_bus)
  1562. return;
  1563. for_each_child(node, child) {
  1564. struct property *prop = get_property(child, "reg");
  1565. /* No error if we have any non-zero unit address */
  1566. if (prop && propval_cell(prop) != 0 )
  1567. return;
  1568. cnt++;
  1569. }
  1570. if (cnt == 1 && node->addr_cells != -1)
  1571. FAIL(c, dti, node, "graph node has single child node '%s', #address-cells/#size-cells are not necessary",
  1572. node->children->name);
  1573. }
  1574. WARNING(graph_child_address, check_graph_child_address, NULL, &graph_nodes, &graph_port, &graph_endpoint);
  1575. static struct check *check_table[] = {
  1576. &duplicate_node_names, &duplicate_property_names,
  1577. &node_name_chars, &node_name_format, &property_name_chars,
  1578. &name_is_string, &name_properties, &node_name_vs_property_name,
  1579. &duplicate_label,
  1580. &explicit_phandles,
  1581. &phandle_references, &path_references,
  1582. &omit_unused_nodes,
  1583. &address_cells_is_cell, &size_cells_is_cell,
  1584. &device_type_is_string, &model_is_string, &status_is_string,
  1585. &label_is_string,
  1586. &compatible_is_string_list, &names_is_string_list,
  1587. &property_name_chars_strict,
  1588. &node_name_chars_strict,
  1589. &addr_size_cells, &reg_format, &ranges_format, &dma_ranges_format,
  1590. &unit_address_vs_reg,
  1591. &unit_address_format,
  1592. &pci_bridge,
  1593. &pci_device_reg,
  1594. &pci_device_bus_num,
  1595. &simple_bus_bridge,
  1596. &simple_bus_reg,
  1597. &i2c_bus_bridge,
  1598. &i2c_bus_reg,
  1599. &spi_bus_bridge,
  1600. &spi_bus_reg,
  1601. &avoid_default_addr_size,
  1602. &avoid_unnecessary_addr_size,
  1603. &unique_unit_address,
  1604. &unique_unit_address_if_enabled,
  1605. &obsolete_chosen_interrupt_controller,
  1606. &chosen_node_is_root, &chosen_node_bootargs, &chosen_node_stdout_path,
  1607. &clocks_property,
  1608. &clocks_is_cell,
  1609. &cooling_device_property,
  1610. &cooling_device_is_cell,
  1611. &dmas_property,
  1612. &dmas_is_cell,
  1613. &hwlocks_property,
  1614. &hwlocks_is_cell,
  1615. &interrupts_extended_property,
  1616. &interrupts_extended_is_cell,
  1617. &io_channels_property,
  1618. &io_channels_is_cell,
  1619. &iommus_property,
  1620. &iommus_is_cell,
  1621. &mboxes_property,
  1622. &mboxes_is_cell,
  1623. &msi_parent_property,
  1624. &msi_parent_is_cell,
  1625. &mux_controls_property,
  1626. &mux_controls_is_cell,
  1627. &phys_property,
  1628. &phys_is_cell,
  1629. &power_domains_property,
  1630. &power_domains_is_cell,
  1631. &pwms_property,
  1632. &pwms_is_cell,
  1633. &resets_property,
  1634. &resets_is_cell,
  1635. &sound_dai_property,
  1636. &sound_dai_is_cell,
  1637. &thermal_sensors_property,
  1638. &thermal_sensors_is_cell,
  1639. &deprecated_gpio_property,
  1640. &gpios_property,
  1641. &interrupts_property,
  1642. &interrupt_provider,
  1643. &interrupt_map,
  1644. &alias_paths,
  1645. &graph_nodes, &graph_child_address, &graph_port, &graph_endpoint,
  1646. &always_fail,
  1647. };
  1648. static void enable_warning_error(struct check *c, bool warn, bool error)
  1649. {
  1650. int i;
  1651. /* Raising level, also raise it for prereqs */
  1652. if ((warn && !c->warn) || (error && !c->error))
  1653. for (i = 0; i < c->num_prereqs; i++)
  1654. enable_warning_error(c->prereq[i], warn, error);
  1655. c->warn = c->warn || warn;
  1656. c->error = c->error || error;
  1657. }
  1658. static void disable_warning_error(struct check *c, bool warn, bool error)
  1659. {
  1660. unsigned int i;
  1661. /* Lowering level, also lower it for things this is the prereq
  1662. * for */
  1663. if ((warn && c->warn) || (error && c->error)) {
  1664. for (i = 0; i < ARRAY_SIZE(check_table); i++) {
  1665. struct check *cc = check_table[i];
  1666. int j;
  1667. for (j = 0; j < cc->num_prereqs; j++)
  1668. if (cc->prereq[j] == c)
  1669. disable_warning_error(cc, warn, error);
  1670. }
  1671. }
  1672. c->warn = c->warn && !warn;
  1673. c->error = c->error && !error;
  1674. }
  1675. void parse_checks_option(bool warn, bool error, const char *arg)
  1676. {
  1677. unsigned int i;
  1678. const char *name = arg;
  1679. bool enable = true;
  1680. if ((strncmp(arg, "no-", 3) == 0)
  1681. || (strncmp(arg, "no_", 3) == 0)) {
  1682. name = arg + 3;
  1683. enable = false;
  1684. }
  1685. for (i = 0; i < ARRAY_SIZE(check_table); i++) {
  1686. struct check *c = check_table[i];
  1687. if (streq(c->name, name)) {
  1688. if (enable)
  1689. enable_warning_error(c, warn, error);
  1690. else
  1691. disable_warning_error(c, warn, error);
  1692. return;
  1693. }
  1694. }
  1695. die("Unrecognized check name \"%s\"\n", name);
  1696. }
  1697. void process_checks(bool force, struct dt_info *dti)
  1698. {
  1699. unsigned int i;
  1700. int error = 0;
  1701. for (i = 0; i < ARRAY_SIZE(check_table); i++) {
  1702. struct check *c = check_table[i];
  1703. if (c->warn || c->error)
  1704. error = error || run_check(c, dti);
  1705. }
  1706. if (error) {
  1707. if (!force) {
  1708. fprintf(stderr, "ERROR: Input tree has errors, aborting "
  1709. "(use -f to force output)\n");
  1710. exit(2);
  1711. } else if (quiet < 3) {
  1712. fprintf(stderr, "Warning: Input tree has errors, "
  1713. "output forced\n");
  1714. }
  1715. }
  1716. }