uclass.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682
  1. // SPDX-License-Identifier: GPL-2.0+
  2. /*
  3. * Copyright (c) 2013 Google, Inc
  4. *
  5. * (C) Copyright 2012
  6. * Pavel Herrmann <morpheus.ibis@gmail.com>
  7. */
  8. #include <common.h>
  9. #include <dm.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, DM_REMOVE_NORMAL);
  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. const char *uclass_get_name(enum uclass_id id)
  133. {
  134. struct uclass *uc;
  135. if (uclass_get(id, &uc))
  136. return NULL;
  137. return uc->uc_drv->name;
  138. }
  139. enum uclass_id uclass_get_by_name(const char *name)
  140. {
  141. int i;
  142. for (i = 0; i < UCLASS_COUNT; i++) {
  143. struct uclass_driver *uc_drv = lists_uclass_lookup(i);
  144. if (uc_drv && !strcmp(uc_drv->name, name))
  145. return i;
  146. }
  147. return UCLASS_INVALID;
  148. }
  149. int uclass_find_device(enum uclass_id id, int index, struct udevice **devp)
  150. {
  151. struct uclass *uc;
  152. struct udevice *dev;
  153. int ret;
  154. *devp = NULL;
  155. ret = uclass_get(id, &uc);
  156. if (ret)
  157. return ret;
  158. if (list_empty(&uc->dev_head))
  159. return -ENODEV;
  160. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  161. if (!index--) {
  162. *devp = dev;
  163. return 0;
  164. }
  165. }
  166. return -ENODEV;
  167. }
  168. int uclass_find_first_device(enum uclass_id id, struct udevice **devp)
  169. {
  170. struct uclass *uc;
  171. int ret;
  172. *devp = NULL;
  173. ret = uclass_get(id, &uc);
  174. if (ret)
  175. return ret;
  176. if (list_empty(&uc->dev_head))
  177. return 0;
  178. *devp = list_first_entry(&uc->dev_head, struct udevice, uclass_node);
  179. return 0;
  180. }
  181. int uclass_find_next_device(struct udevice **devp)
  182. {
  183. struct udevice *dev = *devp;
  184. *devp = NULL;
  185. if (list_is_last(&dev->uclass_node, &dev->uclass->dev_head))
  186. return 0;
  187. *devp = list_entry(dev->uclass_node.next, struct udevice, uclass_node);
  188. return 0;
  189. }
  190. int uclass_find_device_by_name(enum uclass_id id, const char *name,
  191. struct udevice **devp)
  192. {
  193. struct uclass *uc;
  194. struct udevice *dev;
  195. int ret;
  196. *devp = NULL;
  197. if (!name)
  198. return -EINVAL;
  199. ret = uclass_get(id, &uc);
  200. if (ret)
  201. return ret;
  202. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  203. if (!strncmp(dev->name, name, strlen(name))) {
  204. *devp = dev;
  205. return 0;
  206. }
  207. }
  208. return -ENODEV;
  209. }
  210. int uclass_find_device_by_seq(enum uclass_id id, int seq_or_req_seq,
  211. bool find_req_seq, struct udevice **devp)
  212. {
  213. struct uclass *uc;
  214. struct udevice *dev;
  215. int ret;
  216. *devp = NULL;
  217. debug("%s: %d %d\n", __func__, find_req_seq, seq_or_req_seq);
  218. if (seq_or_req_seq == -1)
  219. return -ENODEV;
  220. ret = uclass_get(id, &uc);
  221. if (ret)
  222. return ret;
  223. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  224. debug(" - %d %d '%s'\n", dev->req_seq, dev->seq, dev->name);
  225. if ((find_req_seq ? dev->req_seq : dev->seq) ==
  226. seq_or_req_seq) {
  227. *devp = dev;
  228. debug(" - found\n");
  229. return 0;
  230. }
  231. }
  232. debug(" - not found\n");
  233. return -ENODEV;
  234. }
  235. int uclass_find_device_by_of_offset(enum uclass_id id, int node,
  236. struct udevice **devp)
  237. {
  238. struct uclass *uc;
  239. struct udevice *dev;
  240. int ret;
  241. *devp = NULL;
  242. if (node < 0)
  243. return -ENODEV;
  244. ret = uclass_get(id, &uc);
  245. if (ret)
  246. return ret;
  247. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  248. if (dev_of_offset(dev) == node) {
  249. *devp = dev;
  250. return 0;
  251. }
  252. }
  253. return -ENODEV;
  254. }
  255. int uclass_find_device_by_ofnode(enum uclass_id id, ofnode node,
  256. struct udevice **devp)
  257. {
  258. struct uclass *uc;
  259. struct udevice *dev;
  260. int ret;
  261. *devp = NULL;
  262. if (!ofnode_valid(node))
  263. return -ENODEV;
  264. ret = uclass_get(id, &uc);
  265. if (ret)
  266. return ret;
  267. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  268. if (ofnode_equal(dev_ofnode(dev), node)) {
  269. *devp = dev;
  270. return 0;
  271. }
  272. }
  273. return -ENODEV;
  274. }
  275. #if CONFIG_IS_ENABLED(OF_CONTROL)
  276. static int uclass_find_device_by_phandle(enum uclass_id id,
  277. struct udevice *parent,
  278. const char *name,
  279. struct udevice **devp)
  280. {
  281. struct udevice *dev;
  282. struct uclass *uc;
  283. int find_phandle;
  284. int ret;
  285. *devp = NULL;
  286. find_phandle = dev_read_u32_default(parent, name, -1);
  287. if (find_phandle <= 0)
  288. return -ENOENT;
  289. ret = uclass_get(id, &uc);
  290. if (ret)
  291. return ret;
  292. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  293. uint phandle;
  294. phandle = dev_read_phandle(dev);
  295. if (phandle == find_phandle) {
  296. *devp = dev;
  297. return 0;
  298. }
  299. }
  300. return -ENODEV;
  301. }
  302. #endif
  303. int uclass_get_device_by_driver(enum uclass_id id,
  304. const struct driver *find_drv,
  305. struct udevice **devp)
  306. {
  307. struct udevice *dev;
  308. struct uclass *uc;
  309. int ret;
  310. ret = uclass_get(id, &uc);
  311. if (ret)
  312. return ret;
  313. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  314. if (dev->driver == find_drv)
  315. return uclass_get_device_tail(dev, 0, devp);
  316. }
  317. return -ENODEV;
  318. }
  319. int uclass_get_device_tail(struct udevice *dev, int ret, struct udevice **devp)
  320. {
  321. if (ret)
  322. return ret;
  323. assert(dev);
  324. ret = device_probe(dev);
  325. if (ret)
  326. return ret;
  327. *devp = dev;
  328. return 0;
  329. }
  330. int uclass_get_device(enum uclass_id id, int index, struct udevice **devp)
  331. {
  332. struct udevice *dev;
  333. int ret;
  334. *devp = NULL;
  335. ret = uclass_find_device(id, index, &dev);
  336. return uclass_get_device_tail(dev, ret, devp);
  337. }
  338. int uclass_get_device_by_name(enum uclass_id id, const char *name,
  339. struct udevice **devp)
  340. {
  341. struct udevice *dev;
  342. int ret;
  343. *devp = NULL;
  344. ret = uclass_find_device_by_name(id, name, &dev);
  345. return uclass_get_device_tail(dev, ret, devp);
  346. }
  347. int uclass_get_device_by_seq(enum uclass_id id, int seq, struct udevice **devp)
  348. {
  349. struct udevice *dev;
  350. int ret;
  351. *devp = NULL;
  352. ret = uclass_find_device_by_seq(id, seq, false, &dev);
  353. if (ret == -ENODEV) {
  354. /*
  355. * We didn't find it in probed devices. See if there is one
  356. * that will request this seq if probed.
  357. */
  358. ret = uclass_find_device_by_seq(id, seq, true, &dev);
  359. }
  360. return uclass_get_device_tail(dev, ret, devp);
  361. }
  362. int uclass_get_device_by_of_offset(enum uclass_id id, int node,
  363. struct udevice **devp)
  364. {
  365. struct udevice *dev;
  366. int ret;
  367. *devp = NULL;
  368. ret = uclass_find_device_by_of_offset(id, node, &dev);
  369. return uclass_get_device_tail(dev, ret, devp);
  370. }
  371. int uclass_get_device_by_ofnode(enum uclass_id id, ofnode node,
  372. struct udevice **devp)
  373. {
  374. struct udevice *dev;
  375. int ret;
  376. *devp = NULL;
  377. ret = uclass_find_device_by_ofnode(id, node, &dev);
  378. return uclass_get_device_tail(dev, ret, devp);
  379. }
  380. #if CONFIG_IS_ENABLED(OF_CONTROL)
  381. int uclass_get_device_by_phandle_id(enum uclass_id id, uint phandle_id,
  382. struct udevice **devp)
  383. {
  384. struct udevice *dev;
  385. struct uclass *uc;
  386. int ret;
  387. *devp = NULL;
  388. ret = uclass_get(id, &uc);
  389. if (ret)
  390. return ret;
  391. list_for_each_entry(dev, &uc->dev_head, uclass_node) {
  392. uint phandle;
  393. phandle = dev_read_phandle(dev);
  394. if (phandle == phandle_id) {
  395. *devp = dev;
  396. return uclass_get_device_tail(dev, ret, devp);
  397. }
  398. }
  399. return -ENODEV;
  400. }
  401. int uclass_get_device_by_phandle(enum uclass_id id, struct udevice *parent,
  402. const char *name, struct udevice **devp)
  403. {
  404. struct udevice *dev;
  405. int ret;
  406. *devp = NULL;
  407. ret = uclass_find_device_by_phandle(id, parent, name, &dev);
  408. return uclass_get_device_tail(dev, ret, devp);
  409. }
  410. #endif
  411. int uclass_first_device(enum uclass_id id, struct udevice **devp)
  412. {
  413. struct udevice *dev;
  414. int ret;
  415. *devp = NULL;
  416. ret = uclass_find_first_device(id, &dev);
  417. if (!dev)
  418. return 0;
  419. return uclass_get_device_tail(dev, ret, devp);
  420. }
  421. int uclass_first_device_err(enum uclass_id id, struct udevice **devp)
  422. {
  423. int ret;
  424. ret = uclass_first_device(id, devp);
  425. if (ret)
  426. return ret;
  427. else if (!*devp)
  428. return -ENODEV;
  429. return 0;
  430. }
  431. int uclass_next_device(struct udevice **devp)
  432. {
  433. struct udevice *dev = *devp;
  434. int ret;
  435. *devp = NULL;
  436. ret = uclass_find_next_device(&dev);
  437. if (!dev)
  438. return 0;
  439. return uclass_get_device_tail(dev, ret, devp);
  440. }
  441. int uclass_first_device_check(enum uclass_id id, struct udevice **devp)
  442. {
  443. int ret;
  444. *devp = NULL;
  445. ret = uclass_find_first_device(id, devp);
  446. if (ret)
  447. return ret;
  448. if (!*devp)
  449. return 0;
  450. return device_probe(*devp);
  451. }
  452. int uclass_next_device_check(struct udevice **devp)
  453. {
  454. int ret;
  455. ret = uclass_find_next_device(devp);
  456. if (ret)
  457. return ret;
  458. if (!*devp)
  459. return 0;
  460. return device_probe(*devp);
  461. }
  462. int uclass_bind_device(struct udevice *dev)
  463. {
  464. struct uclass *uc;
  465. int ret;
  466. uc = dev->uclass;
  467. list_add_tail(&dev->uclass_node, &uc->dev_head);
  468. if (dev->parent) {
  469. struct uclass_driver *uc_drv = dev->parent->uclass->uc_drv;
  470. if (uc_drv->child_post_bind) {
  471. ret = uc_drv->child_post_bind(dev);
  472. if (ret)
  473. goto err;
  474. }
  475. }
  476. return 0;
  477. err:
  478. /* There is no need to undo the parent's post_bind call */
  479. list_del(&dev->uclass_node);
  480. return ret;
  481. }
  482. #if CONFIG_IS_ENABLED(DM_DEVICE_REMOVE)
  483. int uclass_unbind_device(struct udevice *dev)
  484. {
  485. struct uclass *uc;
  486. int ret;
  487. uc = dev->uclass;
  488. if (uc->uc_drv->pre_unbind) {
  489. ret = uc->uc_drv->pre_unbind(dev);
  490. if (ret)
  491. return ret;
  492. }
  493. list_del(&dev->uclass_node);
  494. return 0;
  495. }
  496. #endif
  497. int uclass_resolve_seq(struct udevice *dev)
  498. {
  499. struct udevice *dup;
  500. int seq;
  501. int ret;
  502. assert(dev->seq == -1);
  503. ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, dev->req_seq,
  504. false, &dup);
  505. if (!ret) {
  506. dm_warn("Device '%s': seq %d is in use by '%s'\n",
  507. dev->name, dev->req_seq, dup->name);
  508. } else if (ret == -ENODEV) {
  509. /* Our requested sequence number is available */
  510. if (dev->req_seq != -1)
  511. return dev->req_seq;
  512. } else {
  513. return ret;
  514. }
  515. for (seq = 0; seq < DM_MAX_SEQ; seq++) {
  516. ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, seq,
  517. false, &dup);
  518. if (ret == -ENODEV)
  519. break;
  520. if (ret)
  521. return ret;
  522. }
  523. return seq;
  524. }
  525. int uclass_pre_probe_device(struct udevice *dev)
  526. {
  527. struct uclass_driver *uc_drv;
  528. int ret;
  529. uc_drv = dev->uclass->uc_drv;
  530. if (uc_drv->pre_probe) {
  531. ret = uc_drv->pre_probe(dev);
  532. if (ret)
  533. return ret;
  534. }
  535. if (!dev->parent)
  536. return 0;
  537. uc_drv = dev->parent->uclass->uc_drv;
  538. if (uc_drv->child_pre_probe)
  539. return uc_drv->child_pre_probe(dev);
  540. return 0;
  541. }
  542. int uclass_post_probe_device(struct udevice *dev)
  543. {
  544. struct uclass_driver *uc_drv = dev->uclass->uc_drv;
  545. if (uc_drv->post_probe)
  546. return uc_drv->post_probe(dev);
  547. return 0;
  548. }
  549. #if CONFIG_IS_ENABLED(DM_DEVICE_REMOVE)
  550. int uclass_pre_remove_device(struct udevice *dev)
  551. {
  552. struct uclass *uc;
  553. int ret;
  554. uc = dev->uclass;
  555. if (uc->uc_drv->pre_remove) {
  556. ret = uc->uc_drv->pre_remove(dev);
  557. if (ret)
  558. return ret;
  559. }
  560. return 0;
  561. }
  562. #endif