uclass.c 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489
  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_name(enum uclass_id id, const char *name,
  159. struct udevice **devp)
  160. {
  161. struct uclass *uc;
  162. struct udevice *dev;
  163. int ret;
  164. *devp = NULL;
  165. if (!name)
  166. return -EINVAL;
  167. ret = uclass_get(id, &uc);
  168. if (ret)
  169. return ret;
  170. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  171. if (!strncmp(dev->name, name, strlen(name))) {
  172. *devp = dev;
  173. return 0;
  174. }
  175. }
  176. return -ENODEV;
  177. }
  178. int uclass_find_device_by_seq(enum uclass_id id, int seq_or_req_seq,
  179. bool find_req_seq, struct udevice **devp)
  180. {
  181. struct uclass *uc;
  182. struct udevice *dev;
  183. int ret;
  184. *devp = NULL;
  185. debug("%s: %d %d\n", __func__, find_req_seq, seq_or_req_seq);
  186. if (seq_or_req_seq == -1)
  187. return -ENODEV;
  188. ret = uclass_get(id, &uc);
  189. if (ret)
  190. return ret;
  191. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  192. debug(" - %d %d\n", dev->req_seq, dev->seq);
  193. if ((find_req_seq ? dev->req_seq : dev->seq) ==
  194. seq_or_req_seq) {
  195. *devp = dev;
  196. debug(" - found\n");
  197. return 0;
  198. }
  199. }
  200. debug(" - not found\n");
  201. return -ENODEV;
  202. }
  203. static int uclass_find_device_by_of_offset(enum uclass_id id, int node,
  204. struct udevice **devp)
  205. {
  206. struct uclass *uc;
  207. struct udevice *dev;
  208. int ret;
  209. *devp = NULL;
  210. if (node < 0)
  211. return -ENODEV;
  212. ret = uclass_get(id, &uc);
  213. if (ret)
  214. return ret;
  215. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  216. if (dev->of_offset == node) {
  217. *devp = dev;
  218. return 0;
  219. }
  220. }
  221. return -ENODEV;
  222. }
  223. /**
  224. * uclass_get_device_tail() - handle the end of a get_device call
  225. *
  226. * This handles returning an error or probing a device as needed.
  227. *
  228. * @dev: Device that needs to be probed
  229. * @ret: Error to return. If non-zero then the device is not probed
  230. * @devp: Returns the value of 'dev' if there is no error
  231. * @return ret, if non-zero, else the result of the device_probe() call
  232. */
  233. static int uclass_get_device_tail(struct udevice *dev, int ret,
  234. struct udevice **devp)
  235. {
  236. if (ret)
  237. return ret;
  238. ret = device_probe(dev);
  239. if (ret)
  240. return ret;
  241. *devp = dev;
  242. return 0;
  243. }
  244. int uclass_get_device(enum uclass_id id, int index, struct udevice **devp)
  245. {
  246. struct udevice *dev;
  247. int ret;
  248. *devp = NULL;
  249. ret = uclass_find_device(id, index, &dev);
  250. return uclass_get_device_tail(dev, ret, devp);
  251. }
  252. int uclass_get_device_by_name(enum uclass_id id, const char *name,
  253. struct udevice **devp)
  254. {
  255. struct udevice *dev;
  256. int ret;
  257. *devp = NULL;
  258. ret = uclass_find_device_by_name(id, name, &dev);
  259. return uclass_get_device_tail(dev, ret, devp);
  260. }
  261. int uclass_get_device_by_seq(enum uclass_id id, int seq, struct udevice **devp)
  262. {
  263. struct udevice *dev;
  264. int ret;
  265. *devp = NULL;
  266. ret = uclass_find_device_by_seq(id, seq, false, &dev);
  267. if (ret == -ENODEV) {
  268. /*
  269. * We didn't find it in probed devices. See if there is one
  270. * that will request this seq if probed.
  271. */
  272. ret = uclass_find_device_by_seq(id, seq, true, &dev);
  273. }
  274. return uclass_get_device_tail(dev, ret, devp);
  275. }
  276. int uclass_get_device_by_of_offset(enum uclass_id id, int node,
  277. struct udevice **devp)
  278. {
  279. struct udevice *dev;
  280. int ret;
  281. *devp = NULL;
  282. ret = uclass_find_device_by_of_offset(id, node, &dev);
  283. return uclass_get_device_tail(dev, ret, devp);
  284. }
  285. int uclass_first_device(enum uclass_id id, struct udevice **devp)
  286. {
  287. struct udevice *dev;
  288. int ret;
  289. *devp = NULL;
  290. ret = uclass_find_first_device(id, &dev);
  291. return uclass_get_device_tail(dev, ret, devp);
  292. }
  293. int uclass_next_device(struct udevice **devp)
  294. {
  295. struct udevice *dev = *devp;
  296. int ret;
  297. *devp = NULL;
  298. ret = uclass_find_next_device(&dev);
  299. return uclass_get_device_tail(dev, ret, devp);
  300. }
  301. int uclass_bind_device(struct udevice *dev)
  302. {
  303. struct uclass *uc;
  304. int ret;
  305. uc = dev->uclass;
  306. list_add_tail(&dev->uclass_node, &uc->dev_head);
  307. if (dev->parent) {
  308. struct uclass_driver *uc_drv = dev->parent->uclass->uc_drv;
  309. if (uc_drv->child_post_bind) {
  310. ret = uc_drv->child_post_bind(dev);
  311. if (ret)
  312. goto err;
  313. }
  314. }
  315. if (uc->uc_drv->post_bind) {
  316. ret = uc->uc_drv->post_bind(dev);
  317. if (ret)
  318. goto err;
  319. }
  320. return 0;
  321. err:
  322. /* There is no need to undo the parent's post_bind call */
  323. list_del(&dev->uclass_node);
  324. return ret;
  325. }
  326. int uclass_unbind_device(struct udevice *dev)
  327. {
  328. struct uclass *uc;
  329. int ret;
  330. uc = dev->uclass;
  331. if (uc->uc_drv->pre_unbind) {
  332. ret = uc->uc_drv->pre_unbind(dev);
  333. if (ret)
  334. return ret;
  335. }
  336. list_del(&dev->uclass_node);
  337. return 0;
  338. }
  339. int uclass_resolve_seq(struct udevice *dev)
  340. {
  341. struct udevice *dup;
  342. int seq;
  343. int ret;
  344. assert(dev->seq == -1);
  345. ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, dev->req_seq,
  346. false, &dup);
  347. if (!ret) {
  348. dm_warn("Device '%s': seq %d is in use by '%s'\n",
  349. dev->name, dev->req_seq, dup->name);
  350. } else if (ret == -ENODEV) {
  351. /* Our requested sequence number is available */
  352. if (dev->req_seq != -1)
  353. return dev->req_seq;
  354. } else {
  355. return ret;
  356. }
  357. for (seq = 0; seq < DM_MAX_SEQ; seq++) {
  358. ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, seq,
  359. false, &dup);
  360. if (ret == -ENODEV)
  361. break;
  362. if (ret)
  363. return ret;
  364. }
  365. return seq;
  366. }
  367. int uclass_pre_probe_device(struct udevice *dev)
  368. {
  369. struct uclass_driver *uc_drv;
  370. int ret;
  371. uc_drv = dev->uclass->uc_drv;
  372. if (uc_drv->pre_probe) {
  373. ret = uc_drv->pre_probe(dev);
  374. if (ret)
  375. return ret;
  376. }
  377. if (!dev->parent)
  378. return 0;
  379. uc_drv = dev->parent->uclass->uc_drv;
  380. if (uc_drv->child_pre_probe)
  381. return uc_drv->child_pre_probe(dev);
  382. return 0;
  383. }
  384. int uclass_post_probe_device(struct udevice *dev)
  385. {
  386. struct uclass_driver *uc_drv = dev->uclass->uc_drv;
  387. if (uc_drv->post_probe)
  388. return uc_drv->post_probe(dev);
  389. return 0;
  390. }
  391. int uclass_pre_remove_device(struct udevice *dev)
  392. {
  393. struct uclass_driver *uc_drv;
  394. struct uclass *uc;
  395. int ret;
  396. uc = dev->uclass;
  397. uc_drv = uc->uc_drv;
  398. if (uc->uc_drv->pre_remove) {
  399. ret = uc->uc_drv->pre_remove(dev);
  400. if (ret)
  401. return ret;
  402. }
  403. if (uc_drv->per_device_auto_alloc_size) {
  404. free(dev->uclass_priv);
  405. dev->uclass_priv = NULL;
  406. }
  407. dev->seq = -1;
  408. return 0;
  409. }