drivers/connector/cn_queue.c

   1 /*
   2  *      cn_queue.c
   3  *
   4  * 2004-2005 Copyright (c) Evgeniy Polyakov <johnpol@2ka.mipt.ru>
   5  * All rights reserved.
   6  *
   7  * This program is free software; you can redistribute it and/or modify
   8  * it under the terms of the GNU General Public License as published by
   9  * the Free Software Foundation; either version 2 of the License, or
  10  * (at your option) any later version.
  11  *
  12  * This program is distributed in the hope that it will be useful,
  13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15  * GNU General Public License for more details.
  16  *
  17  * You should have received a copy of the GNU General Public License
  18  * along with this program; if not, write to the Free Software
  19  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  20  *
  21  */
  22
  23 #include <linux/kernel.h>
  24 #include <linux/module.h>
  25 #include <linux/list.h>
  26 #include <linux/workqueue.h>
  27 #include <linux/spinlock.h>
  28 #include <linux/slab.h>
  29 #include <linux/skbuff.h>
  30 #include <linux/suspend.h>
  31 #include <linux/connector.h>
  32 #include <linux/delay.h>
  33
  34 void cn_queue_wrapper(struct work_struct *work)
  35 {
  36         struct cn_callback_entry *cbq =
  37                 container_of(work, struct cn_callback_entry, work.work);
  38         struct cn_callback_data *d = &cbq->data;
  39
  40         d->callback(d->callback_priv);
  41
  42         d->destruct_data(d->ddata);
  43         d->ddata = NULL;
  44
  45         kfree(d->free);
  46 }
  47
  48 static struct cn_callback_entry *cn_queue_alloc_callback_entry(char *name, struct cb_id *id, void (*callback)(void *))
  49 {
  50         struct cn_callback_entry *cbq;
  51
  52         cbq = kzalloc(sizeof(*cbq), GFP_KERNEL);
  53         if (!cbq) {
  54                 printk(KERN_ERR "Failed to create new callback queue.\n");
  55                 return NULL;
  56         }
  57
  58         snprintf(cbq->id.name, sizeof(cbq->id.name), "%s", name);
  59         memcpy(&cbq->id.id, id, sizeof(struct cb_id));
  60         cbq->data.callback = callback;
  61
  62         INIT_DELAYED_WORK(&cbq->work, &cn_queue_wrapper);
  63         return cbq;
  64 }
  65
  66 static void cn_queue_free_callback(struct cn_callback_entry *cbq)
  67 {
  68         cancel_delayed_work(&cbq->work);
  69         flush_workqueue(cbq->pdev->cn_queue);
  70
  71         kfree(cbq);
  72 }
  73
  74 int cn_cb_equal(struct cb_id *i1, struct cb_id *i2)
  75 {
  76         return ((i1->idx == i2->idx) && (i1->val == i2->val));
  77 }
  78
  79 int cn_queue_add_callback(struct cn_queue_dev *dev, char *name, struct cb_id *id, void (*callback)(void *))
  80 {
  81         struct cn_callback_entry *cbq, *__cbq;
  82         int found = 0;
  83
  84         cbq = cn_queue_alloc_callback_entry(name, id, callback);
  85         if (!cbq)
  86                 return -ENOMEM;
  87
  88         atomic_inc(&dev->refcnt);
  89         cbq->pdev = dev;
  90
  91         spin_lock_bh(&dev->queue_lock);
  92         list_for_each_entry(__cbq, &dev->queue_list, callback_entry) {
  93                 if (cn_cb_equal(&__cbq->id.id, id)) {
  94                         found = 1;
  95                         break;
  96                 }
  97         }
  98         if (!found)
  99                 list_add_tail(&cbq->callback_entry, &dev->queue_list);
 100         spin_unlock_bh(&dev->queue_lock);
 101
 102         if (found) {
 103                 atomic_dec(&dev->refcnt);
 104                 cn_queue_free_callback(cbq);
 105                 return -EINVAL;
 106         }
 107
 108         cbq->nls = dev->nls;
 109         cbq->seq = 0;
 110         cbq->group = cbq->id.id.idx;
 111
 112         return 0;
 113 }
 114
 115 void cn_queue_del_callback(struct cn_queue_dev *dev, struct cb_id *id)
 116 {
 117         struct cn_callback_entry *cbq, *n;
 118         int found = 0;
 119
 120         spin_lock_bh(&dev->queue_lock);
 121         list_for_each_entry_safe(cbq, n, &dev->queue_list, callback_entry) {
 122                 if (cn_cb_equal(&cbq->id.id, id)) {
 123                         list_del(&cbq->callback_entry);
 124                         found = 1;
 125                         break;
 126                 }
 127         }
 128         spin_unlock_bh(&dev->queue_lock);
 129
 130         if (found) {
 131                 cn_queue_free_callback(cbq);
 132                 atomic_dec(&dev->refcnt);
 133         }
 134 }
 135
 136 struct cn_queue_dev *cn_queue_alloc_dev(char *name, struct sock *nls)
 137 {
 138         struct cn_queue_dev *dev;
 139
 140         dev = kzalloc(sizeof(*dev), GFP_KERNEL);
 141         if (!dev)
 142                 return NULL;
 143
 144         snprintf(dev->name, sizeof(dev->name), "%s", name);
 145         atomic_set(&dev->refcnt, 0);
 146         INIT_LIST_HEAD(&dev->queue_list);
 147         spin_lock_init(&dev->queue_lock);
 148
 149         dev->nls = nls;
 150         dev->netlink_groups = 0;
 151
 152         dev->cn_queue = create_workqueue(dev->name);
 153         if (!dev->cn_queue) {
 154                 kfree(dev);
 155                 return NULL;
 156         }
 157
 158         return dev;
 159 }
 160
 161 void cn_queue_free_dev(struct cn_queue_dev *dev)
 162 {
 163         struct cn_callback_entry *cbq, *n;
 164
 165         flush_workqueue(dev->cn_queue);
 166         destroy_workqueue(dev->cn_queue);
 167
 168         spin_lock_bh(&dev->queue_lock);
 169         list_for_each_entry_safe(cbq, n, &dev->queue_list, callback_entry)
 170                 list_del(&cbq->callback_entry);
 171         spin_unlock_bh(&dev->queue_lock);
 172
 173         while (atomic_read(&dev->refcnt)) {
 174                 printk(KERN_INFO "Waiting for %s to become free: refcnt=%d.\n",
 175                        dev->name, atomic_read(&dev->refcnt));
 176                 msleep(1000);
 177         }
 178
 179         kfree(dev);
 180         dev = NULL;
 181 }