2014-02-26 22:59:18 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2013 Google, Inc
|
|
|
|
*
|
|
|
|
* (C) Copyright 2012
|
|
|
|
* Pavel Herrmann <morpheus.ibis@gmail.com>
|
|
|
|
*
|
|
|
|
* SPDX-License-Identifier: GPL-2.0+
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <common.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <malloc.h>
|
|
|
|
#include <dm/device.h>
|
|
|
|
#include <dm/device-internal.h>
|
|
|
|
#include <dm/lists.h>
|
|
|
|
#include <dm/uclass.h>
|
|
|
|
#include <dm/uclass-internal.h>
|
|
|
|
#include <dm/util.h>
|
|
|
|
|
|
|
|
DECLARE_GLOBAL_DATA_PTR;
|
|
|
|
|
|
|
|
struct uclass *uclass_find(enum uclass_id key)
|
|
|
|
{
|
|
|
|
struct uclass *uc;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* TODO(sjg@chromium.org): Optimise this, perhaps moving the found
|
|
|
|
* node to the start of the list, or creating a linear array mapping
|
|
|
|
* id to node.
|
|
|
|
*/
|
|
|
|
list_for_each_entry(uc, &gd->uclass_root, sibling_node) {
|
|
|
|
if (uc->uc_drv->id == key)
|
|
|
|
return uc;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* uclass_add() - Create new uclass in list
|
|
|
|
* @id: Id number to create
|
|
|
|
* @ucp: Returns pointer to uclass, or NULL on error
|
|
|
|
* @return 0 on success, -ve on error
|
|
|
|
*
|
|
|
|
* The new uclass is added to the list. There must be only one uclass for
|
|
|
|
* each id.
|
|
|
|
*/
|
|
|
|
static int uclass_add(enum uclass_id id, struct uclass **ucp)
|
|
|
|
{
|
|
|
|
struct uclass_driver *uc_drv;
|
|
|
|
struct uclass *uc;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
*ucp = NULL;
|
|
|
|
uc_drv = lists_uclass_lookup(id);
|
|
|
|
if (!uc_drv) {
|
|
|
|
dm_warn("Cannot find uclass for id %d: please add the UCLASS_DRIVER() declaration for this UCLASS_... id\n",
|
|
|
|
id);
|
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
if (uc_drv->ops) {
|
|
|
|
dm_warn("No ops for uclass id %d\n", id);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
uc = calloc(1, sizeof(*uc));
|
|
|
|
if (!uc)
|
|
|
|
return -ENOMEM;
|
|
|
|
if (uc_drv->priv_auto_alloc_size) {
|
|
|
|
uc->priv = calloc(1, uc_drv->priv_auto_alloc_size);
|
|
|
|
if (!uc->priv) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto fail_mem;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
uc->uc_drv = uc_drv;
|
|
|
|
INIT_LIST_HEAD(&uc->sibling_node);
|
|
|
|
INIT_LIST_HEAD(&uc->dev_head);
|
2014-06-12 05:29:49 +00:00
|
|
|
list_add(&uc->sibling_node, &DM_UCLASS_ROOT_NON_CONST);
|
2014-02-26 22:59:18 +00:00
|
|
|
|
|
|
|
if (uc_drv->init) {
|
|
|
|
ret = uc_drv->init(uc);
|
|
|
|
if (ret)
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
|
|
|
*ucp = uc;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
fail:
|
|
|
|
if (uc_drv->priv_auto_alloc_size) {
|
|
|
|
free(uc->priv);
|
|
|
|
uc->priv = NULL;
|
|
|
|
}
|
|
|
|
list_del(&uc->sibling_node);
|
|
|
|
fail_mem:
|
|
|
|
free(uc);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int uclass_destroy(struct uclass *uc)
|
|
|
|
{
|
|
|
|
struct uclass_driver *uc_drv;
|
2014-05-22 10:43:05 +00:00
|
|
|
struct udevice *dev, *tmp;
|
2014-02-26 22:59:18 +00:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
list_for_each_entry_safe(dev, tmp, &uc->dev_head, uclass_node) {
|
|
|
|
ret = device_remove(dev);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
ret = device_unbind(dev);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
uc_drv = uc->uc_drv;
|
|
|
|
if (uc_drv->destroy)
|
|
|
|
uc_drv->destroy(uc);
|
|
|
|
list_del(&uc->sibling_node);
|
|
|
|
if (uc_drv->priv_auto_alloc_size)
|
|
|
|
free(uc->priv);
|
|
|
|
free(uc);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int uclass_get(enum uclass_id id, struct uclass **ucp)
|
|
|
|
{
|
|
|
|
struct uclass *uc;
|
|
|
|
|
|
|
|
*ucp = NULL;
|
|
|
|
uc = uclass_find(id);
|
|
|
|
if (!uc)
|
|
|
|
return uclass_add(id, ucp);
|
|
|
|
*ucp = uc;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-05-22 10:43:05 +00:00
|
|
|
int uclass_find_device(enum uclass_id id, int index, struct udevice **devp)
|
2014-02-26 22:59:18 +00:00
|
|
|
{
|
|
|
|
struct uclass *uc;
|
2014-05-22 10:43:05 +00:00
|
|
|
struct udevice *dev;
|
2014-02-26 22:59:18 +00:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
*devp = NULL;
|
|
|
|
ret = uclass_get(id, &uc);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
list_for_each_entry(dev, &uc->dev_head, uclass_node) {
|
|
|
|
if (!index--) {
|
|
|
|
*devp = dev;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return -ENODEV;
|
|
|
|
}
|
|
|
|
|
2014-05-22 10:43:05 +00:00
|
|
|
int uclass_get_device(enum uclass_id id, int index, struct udevice **devp)
|
2014-02-26 22:59:18 +00:00
|
|
|
{
|
2014-05-22 10:43:05 +00:00
|
|
|
struct udevice *dev;
|
2014-02-26 22:59:18 +00:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
*devp = NULL;
|
|
|
|
ret = uclass_find_device(id, index, &dev);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
ret = device_probe(dev);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
*devp = dev;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-05-22 10:43:05 +00:00
|
|
|
int uclass_first_device(enum uclass_id id, struct udevice **devp)
|
2014-02-26 22:59:18 +00:00
|
|
|
{
|
|
|
|
struct uclass *uc;
|
2014-05-22 10:43:05 +00:00
|
|
|
struct udevice *dev;
|
2014-02-26 22:59:18 +00:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
*devp = NULL;
|
|
|
|
ret = uclass_get(id, &uc);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
if (list_empty(&uc->dev_head))
|
|
|
|
return 0;
|
|
|
|
|
2014-05-22 10:43:05 +00:00
|
|
|
dev = list_first_entry(&uc->dev_head, struct udevice, uclass_node);
|
2014-02-26 22:59:18 +00:00
|
|
|
ret = device_probe(dev);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
*devp = dev;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-05-22 10:43:05 +00:00
|
|
|
int uclass_next_device(struct udevice **devp)
|
2014-02-26 22:59:18 +00:00
|
|
|
{
|
2014-05-22 10:43:05 +00:00
|
|
|
struct udevice *dev = *devp;
|
2014-02-26 22:59:18 +00:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
*devp = NULL;
|
|
|
|
if (list_is_last(&dev->uclass_node, &dev->uclass->dev_head))
|
|
|
|
return 0;
|
|
|
|
|
2014-05-22 10:43:05 +00:00
|
|
|
dev = list_entry(dev->uclass_node.next, struct udevice,
|
|
|
|
uclass_node);
|
2014-02-26 22:59:18 +00:00
|
|
|
ret = device_probe(dev);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
*devp = dev;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-05-22 10:43:05 +00:00
|
|
|
int uclass_bind_device(struct udevice *dev)
|
2014-02-26 22:59:18 +00:00
|
|
|
{
|
|
|
|
struct uclass *uc;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
uc = dev->uclass;
|
|
|
|
|
|
|
|
list_add_tail(&dev->uclass_node, &uc->dev_head);
|
|
|
|
|
|
|
|
if (uc->uc_drv->post_bind) {
|
|
|
|
ret = uc->uc_drv->post_bind(dev);
|
|
|
|
if (ret) {
|
|
|
|
list_del(&dev->uclass_node);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-05-22 10:43:05 +00:00
|
|
|
int uclass_unbind_device(struct udevice *dev)
|
2014-02-26 22:59:18 +00:00
|
|
|
{
|
|
|
|
struct uclass *uc;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
uc = dev->uclass;
|
|
|
|
if (uc->uc_drv->pre_unbind) {
|
|
|
|
ret = uc->uc_drv->pre_unbind(dev);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
list_del(&dev->uclass_node);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-05-22 10:43:05 +00:00
|
|
|
int uclass_post_probe_device(struct udevice *dev)
|
2014-02-26 22:59:18 +00:00
|
|
|
{
|
|
|
|
struct uclass_driver *uc_drv = dev->uclass->uc_drv;
|
|
|
|
|
|
|
|
if (uc_drv->post_probe)
|
|
|
|
return uc_drv->post_probe(dev);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-05-22 10:43:05 +00:00
|
|
|
int uclass_pre_remove_device(struct udevice *dev)
|
2014-02-26 22:59:18 +00:00
|
|
|
{
|
|
|
|
struct uclass_driver *uc_drv;
|
|
|
|
struct uclass *uc;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
uc = dev->uclass;
|
|
|
|
uc_drv = uc->uc_drv;
|
|
|
|
if (uc->uc_drv->pre_remove) {
|
|
|
|
ret = uc->uc_drv->pre_remove(dev);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
if (uc_drv->per_device_auto_alloc_size) {
|
|
|
|
free(dev->uclass_priv);
|
|
|
|
dev->uclass_priv = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|