uclass.c 12 KB

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