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)
27 * TODO(sjg@chromium.org): Optimise this, perhaps moving the found
28 * node to the start of the list, or creating a linear array mapping
31 list_for_each_entry(uc, &gd->uclass_root, sibling_node) {
32 if (uc->uc_drv->id == key)
40 * uclass_add() - Create new uclass in list
41 * @id: Id number to create
42 * @ucp: Returns pointer to uclass, or NULL on error
43 * @return 0 on success, -ve on error
45 * The new uclass is added to the list. There must be only one uclass for
48 static int uclass_add(enum uclass_id id, struct uclass **ucp)
50 struct uclass_driver *uc_drv;
55 uc_drv = lists_uclass_lookup(id);
57 dm_warn("Cannot find uclass for id %d: please add the UCLASS_DRIVER() declaration for this UCLASS_... id\n",
62 dm_warn("No ops for uclass id %d\n", id);
65 uc = calloc(1, sizeof(*uc));
68 if (uc_drv->priv_auto_alloc_size) {
69 uc->priv = calloc(1, uc_drv->priv_auto_alloc_size);
76 INIT_LIST_HEAD(&uc->sibling_node);
77 INIT_LIST_HEAD(&uc->dev_head);
78 list_add(&uc->sibling_node, &DM_UCLASS_ROOT_NON_CONST);
81 ret = uc_drv->init(uc);
90 if (uc_drv->priv_auto_alloc_size) {
94 list_del(&uc->sibling_node);
101 int uclass_destroy(struct uclass *uc)
103 struct uclass_driver *uc_drv;
104 struct udevice *dev, *tmp;
107 list_for_each_entry_safe(dev, tmp, &uc->dev_head, uclass_node) {
108 ret = device_remove(dev);
111 ret = device_unbind(dev);
119 list_del(&uc->sibling_node);
120 if (uc_drv->priv_auto_alloc_size)
127 int uclass_get(enum uclass_id id, struct uclass **ucp)
132 uc = uclass_find(id);
134 return uclass_add(id, ucp);
140 int uclass_find_device(enum uclass_id id, int index, struct udevice **devp)
147 ret = uclass_get(id, &uc);
151 list_for_each_entry(dev, &uc->dev_head, uclass_node) {
161 int uclass_find_device_by_seq(enum uclass_id id, int seq_or_req_seq,
162 bool find_req_seq, struct udevice **devp)
169 debug("%s: %d %d\n", __func__, find_req_seq, seq_or_req_seq);
170 if (seq_or_req_seq == -1)
172 ret = uclass_get(id, &uc);
176 list_for_each_entry(dev, &uc->dev_head, uclass_node) {
177 debug(" - %d %d\n", dev->req_seq, dev->seq);
178 if ((find_req_seq ? dev->req_seq : dev->seq) ==
185 debug(" - not found\n");
191 * uclass_get_device_tail() - handle the end of a get_device call
193 * This handles returning an error or probing a device as needed.
195 * @dev: Device that needs to be probed
196 * @ret: Error to return. If non-zero then the device is not probed
197 * @devp: Returns the value of 'dev' if there is no error
198 * @return ret, if non-zero, else the result of the device_probe() call
200 static int uclass_get_device_tail(struct udevice *dev, int ret,
201 struct udevice **devp)
206 ret = device_probe(dev);
215 int uclass_get_device(enum uclass_id id, int index, struct udevice **devp)
221 ret = uclass_find_device(id, index, &dev);
222 return uclass_get_device_tail(dev, ret, devp);
225 int uclass_get_device_by_seq(enum uclass_id id, int seq, struct udevice **devp)
231 ret = uclass_find_device_by_seq(id, seq, false, &dev);
232 if (ret == -ENODEV) {
234 * We didn't find it in probed devices. See if there is one
235 * that will request this seq if probed.
237 ret = uclass_find_device_by_seq(id, seq, true, &dev);
239 return uclass_get_device_tail(dev, ret, devp);
242 int uclass_first_device(enum uclass_id id, struct udevice **devp)
249 ret = uclass_get(id, &uc);
252 if (list_empty(&uc->dev_head))
255 dev = list_first_entry(&uc->dev_head, struct udevice, uclass_node);
256 ret = device_probe(dev);
264 int uclass_next_device(struct udevice **devp)
266 struct udevice *dev = *devp;
270 if (list_is_last(&dev->uclass_node, &dev->uclass->dev_head))
273 dev = list_entry(dev->uclass_node.next, struct udevice,
275 ret = device_probe(dev);
283 int uclass_bind_device(struct udevice *dev)
290 list_add_tail(&dev->uclass_node, &uc->dev_head);
292 if (uc->uc_drv->post_bind) {
293 ret = uc->uc_drv->post_bind(dev);
295 list_del(&dev->uclass_node);
303 int uclass_unbind_device(struct udevice *dev)
309 if (uc->uc_drv->pre_unbind) {
310 ret = uc->uc_drv->pre_unbind(dev);
315 list_del(&dev->uclass_node);
319 int uclass_resolve_seq(struct udevice *dev)
325 assert(dev->seq == -1);
326 ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, dev->req_seq,
329 dm_warn("Device '%s': seq %d is in use by '%s'\n",
330 dev->name, dev->req_seq, dup->name);
331 } else if (ret == -ENODEV) {
332 /* Our requested sequence number is available */
333 if (dev->req_seq != -1)
339 for (seq = 0; seq < DM_MAX_SEQ; seq++) {
340 ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, seq,
350 int uclass_post_probe_device(struct udevice *dev)
352 struct uclass_driver *uc_drv = dev->uclass->uc_drv;
354 if (uc_drv->post_probe)
355 return uc_drv->post_probe(dev);
360 int uclass_pre_remove_device(struct udevice *dev)
362 struct uclass_driver *uc_drv;
368 if (uc->uc_drv->pre_remove) {
369 ret = uc->uc_drv->pre_remove(dev);
373 if (uc_drv->per_device_auto_alloc_size) {
374 free(dev->uclass_priv);
375 dev->uclass_priv = NULL;