uclass.c 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454
  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. dm_warn("Cannot find uclass for id %d: please add the UCLASS_DRIVER() declaration for this UCLASS_... id\n",
  53. id);
  54. return -ENOENT;
  55. }
  56. uc = calloc(1, sizeof(*uc));
  57. if (!uc)
  58. return -ENOMEM;
  59. if (uc_drv->priv_auto_alloc_size) {
  60. uc->priv = calloc(1, uc_drv->priv_auto_alloc_size);
  61. if (!uc->priv) {
  62. ret = -ENOMEM;
  63. goto fail_mem;
  64. }
  65. }
  66. uc->uc_drv = uc_drv;
  67. INIT_LIST_HEAD(&uc->sibling_node);
  68. INIT_LIST_HEAD(&uc->dev_head);
  69. list_add(&uc->sibling_node, &DM_UCLASS_ROOT_NON_CONST);
  70. if (uc_drv->init) {
  71. ret = uc_drv->init(uc);
  72. if (ret)
  73. goto fail;
  74. }
  75. *ucp = uc;
  76. return 0;
  77. fail:
  78. if (uc_drv->priv_auto_alloc_size) {
  79. free(uc->priv);
  80. uc->priv = NULL;
  81. }
  82. list_del(&uc->sibling_node);
  83. fail_mem:
  84. free(uc);
  85. return ret;
  86. }
  87. int uclass_destroy(struct uclass *uc)
  88. {
  89. struct uclass_driver *uc_drv;
  90. struct udevice *dev, *tmp;
  91. int ret;
  92. list_for_each_entry_safe(dev, tmp, &uc->dev_head, uclass_node) {
  93. ret = device_remove(dev);
  94. if (ret)
  95. return ret;
  96. ret = device_unbind(dev);
  97. if (ret)
  98. return ret;
  99. }
  100. uc_drv = uc->uc_drv;
  101. if (uc_drv->destroy)
  102. uc_drv->destroy(uc);
  103. list_del(&uc->sibling_node);
  104. if (uc_drv->priv_auto_alloc_size)
  105. free(uc->priv);
  106. free(uc);
  107. return 0;
  108. }
  109. int uclass_get(enum uclass_id id, struct uclass **ucp)
  110. {
  111. struct uclass *uc;
  112. *ucp = NULL;
  113. uc = uclass_find(id);
  114. if (!uc)
  115. return uclass_add(id, ucp);
  116. *ucp = uc;
  117. return 0;
  118. }
  119. int uclass_find_device(enum uclass_id id, int index, struct udevice **devp)
  120. {
  121. struct uclass *uc;
  122. struct udevice *dev;
  123. int ret;
  124. *devp = NULL;
  125. ret = uclass_get(id, &uc);
  126. if (ret)
  127. return ret;
  128. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  129. if (!index--) {
  130. *devp = dev;
  131. return 0;
  132. }
  133. }
  134. return -ENODEV;
  135. }
  136. int uclass_find_first_device(enum uclass_id id, struct udevice **devp)
  137. {
  138. struct uclass *uc;
  139. int ret;
  140. *devp = NULL;
  141. ret = uclass_get(id, &uc);
  142. if (ret)
  143. return ret;
  144. if (list_empty(&uc->dev_head))
  145. return 0;
  146. *devp = list_first_entry(&uc->dev_head, struct udevice, uclass_node);
  147. return 0;
  148. }
  149. int uclass_find_next_device(struct udevice **devp)
  150. {
  151. struct udevice *dev = *devp;
  152. *devp = NULL;
  153. if (list_is_last(&dev->uclass_node, &dev->uclass->dev_head))
  154. return 0;
  155. *devp = list_entry(dev->uclass_node.next, struct udevice, uclass_node);
  156. return 0;
  157. }
  158. int uclass_find_device_by_seq(enum uclass_id id, int seq_or_req_seq,
  159. bool find_req_seq, struct udevice **devp)
  160. {
  161. struct uclass *uc;
  162. struct udevice *dev;
  163. int ret;
  164. *devp = NULL;
  165. debug("%s: %d %d\n", __func__, find_req_seq, seq_or_req_seq);
  166. if (seq_or_req_seq == -1)
  167. return -ENODEV;
  168. ret = uclass_get(id, &uc);
  169. if (ret)
  170. return ret;
  171. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  172. debug(" - %d %d\n", dev->req_seq, dev->seq);
  173. if ((find_req_seq ? dev->req_seq : dev->seq) ==
  174. seq_or_req_seq) {
  175. *devp = dev;
  176. debug(" - found\n");
  177. return 0;
  178. }
  179. }
  180. debug(" - not found\n");
  181. return -ENODEV;
  182. }
  183. static int uclass_find_device_by_of_offset(enum uclass_id id, int node,
  184. struct udevice **devp)
  185. {
  186. struct uclass *uc;
  187. struct udevice *dev;
  188. int ret;
  189. *devp = NULL;
  190. if (node < 0)
  191. return -ENODEV;
  192. ret = uclass_get(id, &uc);
  193. if (ret)
  194. return ret;
  195. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  196. if (dev->of_offset == node) {
  197. *devp = dev;
  198. return 0;
  199. }
  200. }
  201. return -ENODEV;
  202. }
  203. /**
  204. * uclass_get_device_tail() - handle the end of a get_device call
  205. *
  206. * This handles returning an error or probing a device as needed.
  207. *
  208. * @dev: Device that needs to be probed
  209. * @ret: Error to return. If non-zero then the device is not probed
  210. * @devp: Returns the value of 'dev' if there is no error
  211. * @return ret, if non-zero, else the result of the device_probe() call
  212. */
  213. static int uclass_get_device_tail(struct udevice *dev, int ret,
  214. struct udevice **devp)
  215. {
  216. if (ret)
  217. return ret;
  218. ret = device_probe(dev);
  219. if (ret)
  220. return ret;
  221. *devp = dev;
  222. return 0;
  223. }
  224. int uclass_get_device(enum uclass_id id, int index, struct udevice **devp)
  225. {
  226. struct udevice *dev;
  227. int ret;
  228. *devp = NULL;
  229. ret = uclass_find_device(id, index, &dev);
  230. return uclass_get_device_tail(dev, ret, devp);
  231. }
  232. int uclass_get_device_by_seq(enum uclass_id id, int seq, struct udevice **devp)
  233. {
  234. struct udevice *dev;
  235. int ret;
  236. *devp = NULL;
  237. ret = uclass_find_device_by_seq(id, seq, false, &dev);
  238. if (ret == -ENODEV) {
  239. /*
  240. * We didn't find it in probed devices. See if there is one
  241. * that will request this seq if probed.
  242. */
  243. ret = uclass_find_device_by_seq(id, seq, true, &dev);
  244. }
  245. return uclass_get_device_tail(dev, ret, devp);
  246. }
  247. int uclass_get_device_by_of_offset(enum uclass_id id, int node,
  248. struct udevice **devp)
  249. {
  250. struct udevice *dev;
  251. int ret;
  252. *devp = NULL;
  253. ret = uclass_find_device_by_of_offset(id, node, &dev);
  254. return uclass_get_device_tail(dev, ret, devp);
  255. }
  256. int uclass_first_device(enum uclass_id id, struct udevice **devp)
  257. {
  258. struct udevice *dev;
  259. int ret;
  260. *devp = NULL;
  261. ret = uclass_find_first_device(id, &dev);
  262. return uclass_get_device_tail(dev, ret, devp);
  263. }
  264. int uclass_next_device(struct udevice **devp)
  265. {
  266. struct udevice *dev = *devp;
  267. int ret;
  268. *devp = NULL;
  269. ret = uclass_find_next_device(&dev);
  270. return uclass_get_device_tail(dev, ret, devp);
  271. }
  272. int uclass_bind_device(struct udevice *dev)
  273. {
  274. struct uclass *uc;
  275. int ret;
  276. uc = dev->uclass;
  277. list_add_tail(&dev->uclass_node, &uc->dev_head);
  278. if (dev->parent) {
  279. struct uclass_driver *uc_drv = dev->parent->uclass->uc_drv;
  280. if (uc_drv->child_post_bind) {
  281. ret = uc_drv->child_post_bind(dev);
  282. if (ret)
  283. goto err;
  284. }
  285. }
  286. if (uc->uc_drv->post_bind) {
  287. ret = uc->uc_drv->post_bind(dev);
  288. if (ret)
  289. goto err;
  290. }
  291. return 0;
  292. err:
  293. /* There is no need to undo the parent's post_bind call */
  294. list_del(&dev->uclass_node);
  295. return ret;
  296. }
  297. int uclass_unbind_device(struct udevice *dev)
  298. {
  299. struct uclass *uc;
  300. int ret;
  301. uc = dev->uclass;
  302. if (uc->uc_drv->pre_unbind) {
  303. ret = uc->uc_drv->pre_unbind(dev);
  304. if (ret)
  305. return ret;
  306. }
  307. list_del(&dev->uclass_node);
  308. return 0;
  309. }
  310. int uclass_resolve_seq(struct udevice *dev)
  311. {
  312. struct udevice *dup;
  313. int seq;
  314. int ret;
  315. assert(dev->seq == -1);
  316. ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, dev->req_seq,
  317. false, &dup);
  318. if (!ret) {
  319. dm_warn("Device '%s': seq %d is in use by '%s'\n",
  320. dev->name, dev->req_seq, dup->name);
  321. } else if (ret == -ENODEV) {
  322. /* Our requested sequence number is available */
  323. if (dev->req_seq != -1)
  324. return dev->req_seq;
  325. } else {
  326. return ret;
  327. }
  328. for (seq = 0; seq < DM_MAX_SEQ; seq++) {
  329. ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, seq,
  330. false, &dup);
  331. if (ret == -ENODEV)
  332. break;
  333. if (ret)
  334. return ret;
  335. }
  336. return seq;
  337. }
  338. int uclass_pre_probe_device(struct udevice *dev)
  339. {
  340. struct uclass_driver *uc_drv;
  341. int ret;
  342. uc_drv = dev->uclass->uc_drv;
  343. if (uc_drv->pre_probe) {
  344. ret = uc_drv->pre_probe(dev);
  345. if (ret)
  346. return ret;
  347. }
  348. if (!dev->parent)
  349. return 0;
  350. uc_drv = dev->parent->uclass->uc_drv;
  351. if (uc_drv->child_pre_probe)
  352. return uc_drv->child_pre_probe(dev);
  353. return 0;
  354. }
  355. int uclass_post_probe_device(struct udevice *dev)
  356. {
  357. struct uclass_driver *uc_drv = dev->uclass->uc_drv;
  358. if (uc_drv->post_probe)
  359. return uc_drv->post_probe(dev);
  360. return 0;
  361. }
  362. int uclass_pre_remove_device(struct udevice *dev)
  363. {
  364. struct uclass_driver *uc_drv;
  365. struct uclass *uc;
  366. int ret;
  367. uc = dev->uclass;
  368. uc_drv = uc->uc_drv;
  369. if (uc->uc_drv->pre_remove) {
  370. ret = uc->uc_drv->pre_remove(dev);
  371. if (ret)
  372. return ret;
  373. }
  374. if (uc_drv->per_device_auto_alloc_size) {
  375. free(dev->uclass_priv);
  376. dev->uclass_priv = NULL;
  377. }
  378. dev->seq = -1;
  379. return 0;
  380. }