2 * Copyright (c) 2013 Google, Inc
5 * Pavel Herrmann <morpheus.ibis@gmail.com>
7 * SPDX-License-Identifier: GPL-2.0+
13 #include <dm/device.h>
14 #include <dm/device-internal.h>
16 #include <dm/uclass.h>
17 #include <dm/uclass-internal.h>
20 DECLARE_GLOBAL_DATA_PTR
;
22 struct uclass
*uclass_find(enum uclass_id key
)
29 * TODO(sjg@chromium.org): Optimise this, perhaps moving the found
30 * node to the start of the list, or creating a linear array mapping
33 list_for_each_entry(uc
, &gd
->uclass_root
, sibling_node
) {
34 if (uc
->uc_drv
->id
== key
)
42 * uclass_add() - Create new uclass in list
43 * @id: Id number to create
44 * @ucp: Returns pointer to uclass, or NULL on error
45 * @return 0 on success, -ve on error
47 * The new uclass is added to the list. There must be only one uclass for
50 static int uclass_add(enum uclass_id id
, struct uclass
**ucp
)
52 struct uclass_driver
*uc_drv
;
57 uc_drv
= lists_uclass_lookup(id
);
59 debug("Cannot find uclass for id %d: please add the UCLASS_DRIVER() declaration for this UCLASS_... id\n",
63 uc
= calloc(1, sizeof(*uc
));
66 if (uc_drv
->priv_auto_alloc_size
) {
67 uc
->priv
= calloc(1, uc_drv
->priv_auto_alloc_size
);
74 INIT_LIST_HEAD(&uc
->sibling_node
);
75 INIT_LIST_HEAD(&uc
->dev_head
);
76 list_add(&uc
->sibling_node
, &DM_UCLASS_ROOT_NON_CONST
);
79 ret
= uc_drv
->init(uc
);
88 if (uc_drv
->priv_auto_alloc_size
) {
92 list_del(&uc
->sibling_node
);
99 int uclass_destroy(struct uclass
*uc
)
101 struct uclass_driver
*uc_drv
;
106 * We cannot use list_for_each_entry_safe() here. If a device in this
107 * uclass has a child device also in this uclass, it will be also be
108 * unbound (by the recursion in the call to device_unbind() below).
109 * We can loop until the list is empty.
111 while (!list_empty(&uc
->dev_head
)) {
112 dev
= list_first_entry(&uc
->dev_head
, struct udevice
,
114 ret
= device_remove(dev
);
117 ret
= device_unbind(dev
);
125 list_del(&uc
->sibling_node
);
126 if (uc_drv
->priv_auto_alloc_size
)
133 int uclass_get(enum uclass_id id
, struct uclass
**ucp
)
138 uc
= uclass_find(id
);
140 return uclass_add(id
, ucp
);
146 int uclass_find_device(enum uclass_id id
, int index
, struct udevice
**devp
)
153 ret
= uclass_get(id
, &uc
);
156 if (list_empty(&uc
->dev_head
))
159 list_for_each_entry(dev
, &uc
->dev_head
, uclass_node
) {
169 int uclass_find_first_device(enum uclass_id id
, struct udevice
**devp
)
175 ret
= uclass_get(id
, &uc
);
178 if (list_empty(&uc
->dev_head
))
181 *devp
= list_first_entry(&uc
->dev_head
, struct udevice
, uclass_node
);
186 int uclass_find_next_device(struct udevice
**devp
)
188 struct udevice
*dev
= *devp
;
191 if (list_is_last(&dev
->uclass_node
, &dev
->uclass
->dev_head
))
194 *devp
= list_entry(dev
->uclass_node
.next
, struct udevice
, uclass_node
);
199 int uclass_find_device_by_name(enum uclass_id id
, const char *name
,
200 struct udevice
**devp
)
209 ret
= uclass_get(id
, &uc
);
213 list_for_each_entry(dev
, &uc
->dev_head
, uclass_node
) {
214 if (!strncmp(dev
->name
, name
, strlen(name
))) {
223 int uclass_find_device_by_seq(enum uclass_id id
, int seq_or_req_seq
,
224 bool find_req_seq
, struct udevice
**devp
)
231 debug("%s: %d %d\n", __func__
, find_req_seq
, seq_or_req_seq
);
232 if (seq_or_req_seq
== -1)
234 ret
= uclass_get(id
, &uc
);
238 list_for_each_entry(dev
, &uc
->dev_head
, uclass_node
) {
239 debug(" - %d %d\n", dev
->req_seq
, dev
->seq
);
240 if ((find_req_seq
? dev
->req_seq
: dev
->seq
) ==
247 debug(" - not found\n");
252 static int uclass_find_device_by_of_offset(enum uclass_id id
, int node
,
253 struct udevice
**devp
)
262 ret
= uclass_get(id
, &uc
);
266 list_for_each_entry(dev
, &uc
->dev_head
, uclass_node
) {
267 if (dev
->of_offset
== node
) {
276 static int uclass_find_device_by_phandle(enum uclass_id id
,
277 struct udevice
*parent
,
279 struct udevice
**devp
)
287 find_phandle
= fdtdec_get_int(gd
->fdt_blob
, parent
->of_offset
, name
,
289 if (find_phandle
<= 0)
291 ret
= uclass_get(id
, &uc
);
295 list_for_each_entry(dev
, &uc
->dev_head
, uclass_node
) {
296 uint phandle
= fdt_get_phandle(gd
->fdt_blob
, dev
->of_offset
);
298 if (phandle
== find_phandle
) {
307 int uclass_get_device_tail(struct udevice
*dev
, int ret
,
308 struct udevice
**devp
)
314 ret
= device_probe(dev
);
323 int uclass_get_device(enum uclass_id id
, int index
, struct udevice
**devp
)
329 ret
= uclass_find_device(id
, index
, &dev
);
330 return uclass_get_device_tail(dev
, ret
, devp
);
333 int uclass_get_device_by_name(enum uclass_id id
, const char *name
,
334 struct udevice
**devp
)
340 ret
= uclass_find_device_by_name(id
, name
, &dev
);
341 return uclass_get_device_tail(dev
, ret
, devp
);
344 int uclass_get_device_by_seq(enum uclass_id id
, int seq
, struct udevice
**devp
)
350 ret
= uclass_find_device_by_seq(id
, seq
, false, &dev
);
351 if (ret
== -ENODEV
) {
353 * We didn't find it in probed devices. See if there is one
354 * that will request this seq if probed.
356 ret
= uclass_find_device_by_seq(id
, seq
, true, &dev
);
358 return uclass_get_device_tail(dev
, ret
, devp
);
361 int uclass_get_device_by_of_offset(enum uclass_id id
, int node
,
362 struct udevice
**devp
)
368 ret
= uclass_find_device_by_of_offset(id
, node
, &dev
);
369 return uclass_get_device_tail(dev
, ret
, devp
);
372 int uclass_get_device_by_phandle(enum uclass_id id
, struct udevice
*parent
,
373 const char *name
, struct udevice
**devp
)
379 ret
= uclass_find_device_by_phandle(id
, parent
, name
, &dev
);
380 return uclass_get_device_tail(dev
, ret
, devp
);
383 int uclass_first_device(enum uclass_id id
, struct udevice
**devp
)
389 ret
= uclass_find_first_device(id
, &dev
);
392 return uclass_get_device_tail(dev
, ret
, devp
);
395 int uclass_next_device(struct udevice
**devp
)
397 struct udevice
*dev
= *devp
;
401 ret
= uclass_find_next_device(&dev
);
404 return uclass_get_device_tail(dev
, ret
, devp
);
407 int uclass_bind_device(struct udevice
*dev
)
413 list_add_tail(&dev
->uclass_node
, &uc
->dev_head
);
416 struct uclass_driver
*uc_drv
= dev
->parent
->uclass
->uc_drv
;
418 if (uc_drv
->child_post_bind
) {
419 ret
= uc_drv
->child_post_bind(dev
);
424 if (uc
->uc_drv
->post_bind
) {
425 ret
= uc
->uc_drv
->post_bind(dev
);
432 /* There is no need to undo the parent's post_bind call */
433 list_del(&dev
->uclass_node
);
438 #ifdef CONFIG_DM_DEVICE_REMOVE
439 int uclass_unbind_device(struct udevice
*dev
)
445 if (uc
->uc_drv
->pre_unbind
) {
446 ret
= uc
->uc_drv
->pre_unbind(dev
);
451 list_del(&dev
->uclass_node
);
456 int uclass_resolve_seq(struct udevice
*dev
)
462 assert(dev
->seq
== -1);
463 ret
= uclass_find_device_by_seq(dev
->uclass
->uc_drv
->id
, dev
->req_seq
,
466 dm_warn("Device '%s': seq %d is in use by '%s'\n",
467 dev
->name
, dev
->req_seq
, dup
->name
);
468 } else if (ret
== -ENODEV
) {
469 /* Our requested sequence number is available */
470 if (dev
->req_seq
!= -1)
476 for (seq
= 0; seq
< DM_MAX_SEQ
; seq
++) {
477 ret
= uclass_find_device_by_seq(dev
->uclass
->uc_drv
->id
, seq
,
487 int uclass_pre_probe_device(struct udevice
*dev
)
489 struct uclass_driver
*uc_drv
;
492 uc_drv
= dev
->uclass
->uc_drv
;
493 if (uc_drv
->pre_probe
) {
494 ret
= uc_drv
->pre_probe(dev
);
501 uc_drv
= dev
->parent
->uclass
->uc_drv
;
502 if (uc_drv
->child_pre_probe
)
503 return uc_drv
->child_pre_probe(dev
);
508 int uclass_post_probe_device(struct udevice
*dev
)
510 struct uclass_driver
*uc_drv
= dev
->uclass
->uc_drv
;
512 if (uc_drv
->post_probe
)
513 return uc_drv
->post_probe(dev
);
518 #ifdef CONFIG_DM_DEVICE_REMOVE
519 int uclass_pre_remove_device(struct udevice
*dev
)
521 struct uclass_driver
*uc_drv
;
527 if (uc
->uc_drv
->pre_remove
) {
528 ret
= uc
->uc_drv
->pre_remove(dev
);
532 if (uc_drv
->per_device_auto_alloc_size
) {
533 free(dev
->uclass_priv
);
534 dev
->uclass_priv
= NULL
;