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 dm_warn("Cannot find uclass for id %d: please add the UCLASS_DRIVER() declaration for this UCLASS_... id\n",
64 dm_warn("No ops for uclass id %d\n", id);
67 uc = calloc(1, sizeof(*uc));
70 if (uc_drv->priv_auto_alloc_size) {
71 uc->priv = calloc(1, uc_drv->priv_auto_alloc_size);
78 INIT_LIST_HEAD(&uc->sibling_node);
79 INIT_LIST_HEAD(&uc->dev_head);
80 list_add(&uc->sibling_node, &DM_UCLASS_ROOT_NON_CONST);
83 ret = uc_drv->init(uc);
92 if (uc_drv->priv_auto_alloc_size) {
96 list_del(&uc->sibling_node);
103 int uclass_destroy(struct uclass *uc)
105 struct uclass_driver *uc_drv;
106 struct udevice *dev, *tmp;
109 list_for_each_entry_safe(dev, tmp, &uc->dev_head, uclass_node) {
110 ret = device_remove(dev);
113 ret = device_unbind(dev);
121 list_del(&uc->sibling_node);
122 if (uc_drv->priv_auto_alloc_size)
129 int uclass_get(enum uclass_id id, struct uclass **ucp)
134 uc = uclass_find(id);
136 return uclass_add(id, ucp);
142 int uclass_find_device(enum uclass_id id, int index, struct udevice **devp)
149 ret = uclass_get(id, &uc);
153 list_for_each_entry(dev, &uc->dev_head, uclass_node) {
163 int uclass_find_device_by_seq(enum uclass_id id, int seq_or_req_seq,
164 bool find_req_seq, struct udevice **devp)
171 debug("%s: %d %d\n", __func__, find_req_seq, seq_or_req_seq);
172 if (seq_or_req_seq == -1)
174 ret = uclass_get(id, &uc);
178 list_for_each_entry(dev, &uc->dev_head, uclass_node) {
179 debug(" - %d %d\n", dev->req_seq, dev->seq);
180 if ((find_req_seq ? dev->req_seq : dev->seq) ==
187 debug(" - not found\n");
192 static int uclass_find_device_by_of_offset(enum uclass_id id, int node,
193 struct udevice **devp)
202 ret = uclass_get(id, &uc);
206 list_for_each_entry(dev, &uc->dev_head, uclass_node) {
207 if (dev->of_offset == node) {
217 * uclass_get_device_tail() - handle the end of a get_device call
219 * This handles returning an error or probing a device as needed.
221 * @dev: Device that needs to be probed
222 * @ret: Error to return. If non-zero then the device is not probed
223 * @devp: Returns the value of 'dev' if there is no error
224 * @return ret, if non-zero, else the result of the device_probe() call
226 static int uclass_get_device_tail(struct udevice *dev, int ret,
227 struct udevice **devp)
232 ret = device_probe(dev);
241 int uclass_get_device(enum uclass_id id, int index, struct udevice **devp)
247 ret = uclass_find_device(id, index, &dev);
248 return uclass_get_device_tail(dev, ret, devp);
251 int uclass_get_device_by_seq(enum uclass_id id, int seq, struct udevice **devp)
257 ret = uclass_find_device_by_seq(id, seq, false, &dev);
258 if (ret == -ENODEV) {
260 * We didn't find it in probed devices. See if there is one
261 * that will request this seq if probed.
263 ret = uclass_find_device_by_seq(id, seq, true, &dev);
265 return uclass_get_device_tail(dev, ret, devp);
268 int uclass_get_device_by_of_offset(enum uclass_id id, int node,
269 struct udevice **devp)
275 ret = uclass_find_device_by_of_offset(id, node, &dev);
276 return uclass_get_device_tail(dev, ret, devp);
279 int uclass_first_device(enum uclass_id id, struct udevice **devp)
286 ret = uclass_get(id, &uc);
289 if (list_empty(&uc->dev_head))
292 dev = list_first_entry(&uc->dev_head, struct udevice, uclass_node);
293 ret = device_probe(dev);
301 int uclass_next_device(struct udevice **devp)
303 struct udevice *dev = *devp;
307 if (list_is_last(&dev->uclass_node, &dev->uclass->dev_head))
310 dev = list_entry(dev->uclass_node.next, struct udevice,
312 ret = device_probe(dev);
320 int uclass_bind_device(struct udevice *dev)
327 list_add_tail(&dev->uclass_node, &uc->dev_head);
329 if (uc->uc_drv->post_bind) {
330 ret = uc->uc_drv->post_bind(dev);
332 list_del(&dev->uclass_node);
340 int uclass_unbind_device(struct udevice *dev)
346 if (uc->uc_drv->pre_unbind) {
347 ret = uc->uc_drv->pre_unbind(dev);
352 list_del(&dev->uclass_node);
356 int uclass_resolve_seq(struct udevice *dev)
362 assert(dev->seq == -1);
363 ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, dev->req_seq,
366 dm_warn("Device '%s': seq %d is in use by '%s'\n",
367 dev->name, dev->req_seq, dup->name);
368 } else if (ret == -ENODEV) {
369 /* Our requested sequence number is available */
370 if (dev->req_seq != -1)
376 for (seq = 0; seq < DM_MAX_SEQ; seq++) {
377 ret = uclass_find_device_by_seq(dev->uclass->uc_drv->id, seq,
387 int uclass_post_probe_device(struct udevice *dev)
389 struct uclass_driver *uc_drv = dev->uclass->uc_drv;
391 if (uc_drv->post_probe)
392 return uc_drv->post_probe(dev);
397 int uclass_pre_remove_device(struct udevice *dev)
399 struct uclass_driver *uc_drv;
405 if (uc->uc_drv->pre_remove) {
406 ret = uc->uc_drv->pre_remove(dev);
410 if (uc_drv->per_device_auto_alloc_size) {
411 free(dev->uclass_priv);
412 dev->uclass_priv = NULL;