uclass.c 13 KB

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