uclass.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537
  1. /*
  2. * Copyright (c) 2013 Google, Inc
  3. *
  4. * (C) Copyright 2012
  5. * Pavel Herrmann <morpheus.ibis@gmail.com>
  6. *
  7. * SPDX-License-Identifier: GPL-2.0+
  8. */
  9. #include <common.h>
  10. #include <errno.h>
  11. #include <malloc.h>
  12. #include <dm/device.h>
  13. #include <dm/device-internal.h>
  14. #include <dm/lists.h>
  15. #include <dm/uclass.h>
  16. #include <dm/uclass-internal.h>
  17. #include <dm/util.h>
  18. DECLARE_GLOBAL_DATA_PTR;
  19. struct uclass *uclass_find(enum uclass_id key)
  20. {
  21. struct uclass *uc;
  22. if (!gd->dm_root)
  23. return NULL;
  24. /*
  25. * TODO(sjg@chromium.org): Optimise this, perhaps moving the found
  26. * node to the start of the list, or creating a linear array mapping
  27. * id to node.
  28. */
  29. list_for_each_entry(uc, &gd->uclass_root, sibling_node) {
  30. if (uc->uc_drv->id == key)
  31. return uc;
  32. }
  33. return NULL;
  34. }
  35. /**
  36. * uclass_add() - Create new uclass in list
  37. * @id: Id number to create
  38. * @ucp: Returns pointer to uclass, or NULL on error
  39. * @return 0 on success, -ve on error
  40. *
  41. * The new uclass is added to the list. There must be only one uclass for
  42. * each id.
  43. */
  44. static int uclass_add(enum uclass_id id, struct uclass **ucp)
  45. {
  46. struct uclass_driver *uc_drv;
  47. struct uclass *uc;
  48. int ret;
  49. *ucp = NULL;
  50. uc_drv = lists_uclass_lookup(id);
  51. if (!uc_drv) {
  52. debug("Cannot find uclass for id %d: please add the UCLASS_DRIVER() declaration for this UCLASS_... id\n",
  53. id);
  54. /*
  55. * Use a strange error to make this case easier to find. When
  56. * a uclass is not available it can prevent driver model from
  57. * starting up and this failure is otherwise hard to debug.
  58. */
  59. return -EPFNOSUPPORT;
  60. }
  61. uc = calloc(1, sizeof(*uc));
  62. if (!uc)
  63. return -ENOMEM;
  64. if (uc_drv->priv_auto_alloc_size) {
  65. uc->priv = calloc(1, uc_drv->priv_auto_alloc_size);
  66. if (!uc->priv) {
  67. ret = -ENOMEM;
  68. goto fail_mem;
  69. }
  70. }
  71. uc->uc_drv = uc_drv;
  72. INIT_LIST_HEAD(&uc->sibling_node);
  73. INIT_LIST_HEAD(&uc->dev_head);
  74. list_add(&uc->sibling_node, &DM_UCLASS_ROOT_NON_CONST);
  75. if (uc_drv->init) {
  76. ret = uc_drv->init(uc);
  77. if (ret)
  78. goto fail;
  79. }
  80. *ucp = uc;
  81. return 0;
  82. fail:
  83. if (uc_drv->priv_auto_alloc_size) {
  84. free(uc->priv);
  85. uc->priv = NULL;
  86. }
  87. list_del(&uc->sibling_node);
  88. fail_mem:
  89. free(uc);
  90. return ret;
  91. }
  92. int uclass_destroy(struct uclass *uc)
  93. {
  94. struct uclass_driver *uc_drv;
  95. struct udevice *dev;
  96. int ret;
  97. /*
  98. * We cannot use list_for_each_entry_safe() here. If a device in this
  99. * uclass has a child device also in this uclass, it will be also be
  100. * unbound (by the recursion in the call to device_unbind() below).
  101. * We can loop until the list is empty.
  102. */
  103. while (!list_empty(&uc->dev_head)) {
  104. dev = list_first_entry(&uc->dev_head, struct udevice,
  105. uclass_node);
  106. ret = device_remove(dev);
  107. if (ret)
  108. return ret;
  109. ret = device_unbind(dev);
  110. if (ret)
  111. return ret;
  112. }
  113. uc_drv = uc->uc_drv;
  114. if (uc_drv->destroy)
  115. uc_drv->destroy(uc);
  116. list_del(&uc->sibling_node);
  117. if (uc_drv->priv_auto_alloc_size)
  118. free(uc->priv);
  119. free(uc);
  120. return 0;
  121. }
  122. int uclass_get(enum uclass_id id, struct uclass **ucp)
  123. {
  124. struct uclass *uc;
  125. *ucp = NULL;
  126. uc = uclass_find(id);
  127. if (!uc)
  128. return uclass_add(id, ucp);
  129. *ucp = uc;
  130. return 0;
  131. }
  132. int uclass_find_device(enum uclass_id id, int index, struct udevice **devp)
  133. {
  134. struct uclass *uc;
  135. struct udevice *dev;
  136. int ret;
  137. *devp = NULL;
  138. ret = uclass_get(id, &uc);
  139. if (ret)
  140. return ret;
  141. if (list_empty(&uc->dev_head))
  142. return -ENODEV;
  143. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  144. if (!index--) {
  145. *devp = dev;
  146. return 0;
  147. }
  148. }
  149. return -ENODEV;
  150. }
  151. int uclass_find_first_device(enum uclass_id id, struct udevice **devp)
  152. {
  153. struct uclass *uc;
  154. int ret;
  155. *devp = NULL;
  156. ret = uclass_get(id, &uc);
  157. if (ret)
  158. return ret;
  159. if (list_empty(&uc->dev_head))
  160. return 0;
  161. *devp = list_first_entry(&uc->dev_head, struct udevice, uclass_node);
  162. return 0;
  163. }
  164. int uclass_find_next_device(struct udevice **devp)
  165. {
  166. struct udevice *dev = *devp;
  167. *devp = NULL;
  168. if (list_is_last(&dev->uclass_node, &dev->uclass->dev_head))
  169. return 0;
  170. *devp = list_entry(dev->uclass_node.next, struct udevice, uclass_node);
  171. return 0;
  172. }
  173. int uclass_find_device_by_name(enum uclass_id id, const char *name,
  174. struct udevice **devp)
  175. {
  176. struct uclass *uc;
  177. struct udevice *dev;
  178. int ret;
  179. *devp = NULL;
  180. if (!name)
  181. return -EINVAL;
  182. ret = uclass_get(id, &uc);
  183. if (ret)
  184. return ret;
  185. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  186. if (!strncmp(dev->name, name, strlen(name))) {
  187. *devp = dev;
  188. return 0;
  189. }
  190. }
  191. return -ENODEV;
  192. }
  193. int uclass_find_device_by_seq(enum uclass_id id, int seq_or_req_seq,
  194. bool find_req_seq, struct udevice **devp)
  195. {
  196. struct uclass *uc;
  197. struct udevice *dev;
  198. int ret;
  199. *devp = NULL;
  200. debug("%s: %d %d\n", __func__, find_req_seq, seq_or_req_seq);
  201. if (seq_or_req_seq == -1)
  202. return -ENODEV;
  203. ret = uclass_get(id, &uc);
  204. if (ret)
  205. return ret;
  206. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  207. debug(" - %d %d\n", dev->req_seq, dev->seq);
  208. if ((find_req_seq ? dev->req_seq : dev->seq) ==
  209. seq_or_req_seq) {
  210. *devp = dev;
  211. debug(" - found\n");
  212. return 0;
  213. }
  214. }
  215. debug(" - not found\n");
  216. return -ENODEV;
  217. }
  218. static int uclass_find_device_by_of_offset(enum uclass_id id, int node,
  219. struct udevice **devp)
  220. {
  221. struct uclass *uc;
  222. struct udevice *dev;
  223. int ret;
  224. *devp = NULL;
  225. if (node < 0)
  226. return -ENODEV;
  227. ret = uclass_get(id, &uc);
  228. if (ret)
  229. return ret;
  230. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  231. if (dev->of_offset == node) {
  232. *devp = dev;
  233. return 0;
  234. }
  235. }
  236. return -ENODEV;
  237. }
  238. #if CONFIG_IS_ENABLED(OF_CONTROL)
  239. static int uclass_find_device_by_phandle(enum uclass_id id,
  240. struct udevice *parent,
  241. const char *name,
  242. struct udevice **devp)
  243. {
  244. struct udevice *dev;
  245. struct uclass *uc;
  246. int find_phandle;
  247. int ret;
  248. *devp = NULL;
  249. find_phandle = fdtdec_get_int(gd->fdt_blob, parent->of_offset, name,
  250. -1);
  251. if (find_phandle <= 0)
  252. return -ENOENT;
  253. ret = uclass_get(id, &uc);
  254. if (ret)
  255. return ret;
  256. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  257. uint phandle = fdt_get_phandle(gd->fdt_blob, dev->of_offset);
  258. if (phandle == find_phandle) {
  259. *devp = dev;
  260. return 0;
  261. }
  262. }
  263. return -ENODEV;
  264. }
  265. #endif
  266. int uclass_get_device_tail(struct udevice *dev, int ret,
  267. struct udevice **devp)
  268. {
  269. if (ret)
  270. return ret;
  271. assert(dev);
  272. ret = device_probe(dev);
  273. if (ret)
  274. return ret;
  275. *devp = dev;
  276. return 0;
  277. }
  278. int uclass_get_device(enum uclass_id id, int index, struct udevice **devp)
  279. {
  280. struct udevice *dev;
  281. int ret;
  282. *devp = NULL;
  283. ret = uclass_find_device(id, index, &dev);
  284. return uclass_get_device_tail(dev, ret, devp);
  285. }
  286. int uclass_get_device_by_name(enum uclass_id id, const char *name,
  287. struct udevice **devp)
  288. {
  289. struct udevice *dev;
  290. int ret;
  291. *devp = NULL;
  292. ret = uclass_find_device_by_name(id, name, &dev);
  293. return uclass_get_device_tail(dev, ret, devp);
  294. }
  295. int uclass_get_device_by_seq(enum uclass_id id, int seq, struct udevice **devp)
  296. {
  297. struct udevice *dev;
  298. int ret;
  299. *devp = NULL;
  300. ret = uclass_find_device_by_seq(id, seq, false, &dev);
  301. if (ret == -ENODEV) {
  302. /*
  303. * We didn't find it in probed devices. See if there is one
  304. * that will request this seq if probed.
  305. */
  306. ret = uclass_find_device_by_seq(id, seq, true, &dev);
  307. }
  308. return uclass_get_device_tail(dev, ret, devp);
  309. }
  310. int uclass_get_device_by_of_offset(enum uclass_id id, int node,
  311. struct udevice **devp)
  312. {
  313. struct udevice *dev;
  314. int ret;
  315. *devp = NULL;
  316. ret = uclass_find_device_by_of_offset(id, node, &dev);
  317. return uclass_get_device_tail(dev, ret, devp);
  318. }
  319. #if CONFIG_IS_ENABLED(OF_CONTROL)
  320. int uclass_get_device_by_phandle(enum uclass_id id, struct udevice *parent,
  321. const char *name, struct udevice **devp)
  322. {
  323. struct udevice *dev;
  324. int ret;
  325. *devp = NULL;
  326. ret = uclass_find_device_by_phandle(id, parent, name, &dev);
  327. return uclass_get_device_tail(dev, ret, devp);
  328. }
  329. #endif
  330. int uclass_first_device(enum uclass_id id, struct udevice **devp)
  331. {
  332. struct udevice *dev;
  333. int ret;
  334. *devp = NULL;
  335. ret = uclass_find_first_device(id, &dev);
  336. if (!dev)
  337. return 0;
  338. return uclass_get_device_tail(dev, ret, devp);
  339. }
  340. int uclass_next_device(struct udevice **devp)
  341. {
  342. struct udevice *dev = *devp;
  343. int ret;
  344. *devp = NULL;
  345. ret = uclass_find_next_device(&dev);
  346. if (!dev)
  347. return 0;
  348. return uclass_get_device_tail(dev, ret, devp);
  349. }
  350. int uclass_bind_device(struct udevice *dev)
  351. {
  352. struct uclass *uc;
  353. int ret;
  354. uc = dev->uclass;
  355. list_add_tail(&dev->uclass_node, &uc->dev_head);
  356. if (dev->parent) {
  357. struct uclass_driver *uc_drv = dev->parent->uclass->uc_drv;
  358. if (uc_drv->child_post_bind) {
  359. ret = uc_drv->child_post_bind(dev);
  360. if (ret)
  361. goto err;
  362. }
  363. }
  364. return 0;
  365. err:
  366. /* There is no need to undo the parent's post_bind call */
  367. list_del(&dev->uclass_node);
  368. return ret;
  369. }
  370. #if CONFIG_IS_ENABLED(DM_DEVICE_REMOVE)
  371. int uclass_unbind_device(struct udevice *dev)
  372. {
  373. struct uclass *uc;
  374. int ret;
  375. uc = dev->uclass;
  376. if (uc->uc_drv->pre_unbind) {
  377. ret = uc->uc_drv->pre_unbind(dev);
  378. if (ret)
  379. return ret;
  380. }
  381. list_del(&dev->uclass_node);
  382. return 0;
  383. }
  384. #endif
  385. int uclass_resolve_seq(struct udevice *dev)
  386. {
  387. struct udevice *dup;
  388. int seq;
  389. int ret;
  390. assert(dev->seq == -1);
  391. ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, dev->req_seq,
  392. false, &dup);
  393. if (!ret) {
  394. dm_warn("Device '%s': seq %d is in use by '%s'\n",
  395. dev->name, dev->req_seq, dup->name);
  396. } else if (ret == -ENODEV) {
  397. /* Our requested sequence number is available */
  398. if (dev->req_seq != -1)
  399. return dev->req_seq;
  400. } else {
  401. return ret;
  402. }
  403. for (seq = 0; seq < DM_MAX_SEQ; seq++) {
  404. ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, seq,
  405. false, &dup);
  406. if (ret == -ENODEV)
  407. break;
  408. if (ret)
  409. return ret;
  410. }
  411. return seq;
  412. }
  413. int uclass_pre_probe_device(struct udevice *dev)
  414. {
  415. struct uclass_driver *uc_drv;
  416. int ret;
  417. uc_drv = dev->uclass->uc_drv;
  418. if (uc_drv->pre_probe) {
  419. ret = uc_drv->pre_probe(dev);
  420. if (ret)
  421. return ret;
  422. }
  423. if (!dev->parent)
  424. return 0;
  425. uc_drv = dev->parent->uclass->uc_drv;
  426. if (uc_drv->child_pre_probe)
  427. return uc_drv->child_pre_probe(dev);
  428. return 0;
  429. }
  430. int uclass_post_probe_device(struct udevice *dev)
  431. {
  432. struct uclass_driver *uc_drv = dev->uclass->uc_drv;
  433. if (uc_drv->post_probe)
  434. return uc_drv->post_probe(dev);
  435. return 0;
  436. }
  437. #if CONFIG_IS_ENABLED(DM_DEVICE_REMOVE)
  438. int uclass_pre_remove_device(struct udevice *dev)
  439. {
  440. struct uclass *uc;
  441. int ret;
  442. uc = dev->uclass;
  443. if (uc->uc_drv->pre_remove) {
  444. ret = uc->uc_drv->pre_remove(dev);
  445. if (ret)
  446. return ret;
  447. }
  448. return 0;
  449. }
  450. #endif