4 * 2004+ Copyright (c) Evgeniy Polyakov <zbr@ioremap.net>
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.
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.
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
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>
34 static struct cn_callback_entry *
35 cn_queue_alloc_callback_entry(struct cn_queue_dev *dev, const char *name,
37 void (*callback)(struct cn_msg *, struct netlink_skb_parms *))
39 struct cn_callback_entry *cbq;
41 cbq = kzalloc(sizeof(*cbq), GFP_KERNEL);
43 printk(KERN_ERR "Failed to create new callback queue.\n");
47 atomic_set(&cbq->refcnt, 1);
49 atomic_inc(&dev->refcnt);
52 snprintf(cbq->id.name, sizeof(cbq->id.name), "%s", name);
53 memcpy(&cbq->id.id, id, sizeof(struct cb_id));
54 cbq->callback = callback;
58 void cn_queue_release_callback(struct cn_callback_entry *cbq)
60 if (!atomic_dec_and_test(&cbq->refcnt))
63 atomic_dec(&cbq->pdev->refcnt);
67 int cn_cb_equal(struct cb_id *i1, struct cb_id *i2)
69 return ((i1->idx == i2->idx) && (i1->val == i2->val));
72 int cn_queue_add_callback(struct cn_queue_dev *dev, const char *name,
74 void (*callback)(struct cn_msg *, struct netlink_skb_parms *))
76 struct cn_callback_entry *cbq, *__cbq;
79 cbq = cn_queue_alloc_callback_entry(dev, name, id, callback);
83 spin_lock_bh(&dev->queue_lock);
84 list_for_each_entry(__cbq, &dev->queue_list, callback_entry) {
85 if (cn_cb_equal(&__cbq->id.id, id)) {
91 list_add_tail(&cbq->callback_entry, &dev->queue_list);
92 spin_unlock_bh(&dev->queue_lock);
95 cn_queue_release_callback(cbq);
100 cbq->group = cbq->id.id.idx;
105 void cn_queue_del_callback(struct cn_queue_dev *dev, struct cb_id *id)
107 struct cn_callback_entry *cbq, *n;
110 spin_lock_bh(&dev->queue_lock);
111 list_for_each_entry_safe(cbq, n, &dev->queue_list, callback_entry) {
112 if (cn_cb_equal(&cbq->id.id, id)) {
113 list_del(&cbq->callback_entry);
118 spin_unlock_bh(&dev->queue_lock);
121 cn_queue_release_callback(cbq);
124 struct cn_queue_dev *cn_queue_alloc_dev(const char *name, struct sock *nls)
126 struct cn_queue_dev *dev;
128 dev = kzalloc(sizeof(*dev), GFP_KERNEL);
132 snprintf(dev->name, sizeof(dev->name), "%s", name);
133 atomic_set(&dev->refcnt, 0);
134 INIT_LIST_HEAD(&dev->queue_list);
135 spin_lock_init(&dev->queue_lock);
142 void cn_queue_free_dev(struct cn_queue_dev *dev)
144 struct cn_callback_entry *cbq, *n;
146 spin_lock_bh(&dev->queue_lock);
147 list_for_each_entry_safe(cbq, n, &dev->queue_list, callback_entry)
148 list_del(&cbq->callback_entry);
149 spin_unlock_bh(&dev->queue_lock);
151 while (atomic_read(&dev->refcnt)) {
152 printk(KERN_INFO "Waiting for %s to become free: refcnt=%d.\n",
153 dev->name, atomic_read(&dev->refcnt));