blob: b4cfac93f7233eaa9433458b1533b007bd72bbd7 [file] [log] [blame]
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -07001/*
2 * cn_queue.c
Frederic Weisbecker1a5645b2009-02-02 23:22:04 -08003 *
Evgeniy Polyakovacb9c1b2009-07-21 12:43:51 -07004 * 2004+ Copyright (c) Evgeniy Polyakov <zbr@ioremap.net>
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -07005 * All rights reserved.
Frederic Weisbecker1a5645b2009-02-02 23:22:04 -08006 *
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -07007 * 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
Frederic Weisbecker1a5645b2009-02-02 23:22:04 -080034
35/*
36 * This job is sent to the kevent workqueue.
37 * While no event is once sent to any callback, the connector workqueue
38 * is not created to avoid a useless waiting kernel task.
39 * Once the first event is received, we create this dedicated workqueue which
40 * is necessary because the flow of data can be high and we don't want
41 * to encumber keventd with that.
42 */
43static void cn_queue_create(struct work_struct *work)
44{
45 struct cn_queue_dev *dev;
46
47 dev = container_of(work, struct cn_queue_dev, wq_creation);
48
49 dev->cn_queue = create_singlethread_workqueue(dev->name);
50 /* If we fail, we will use keventd for all following connector jobs */
51 WARN_ON(!dev->cn_queue);
52}
53
54/*
55 * Queue a data sent to a callback.
56 * If the connector workqueue is already created, we queue the job on it.
57 * Otherwise, we queue the job to kevent and queue the connector workqueue
58 * creation too.
59 */
60int queue_cn_work(struct cn_callback_entry *cbq, struct work_struct *work)
61{
62 struct cn_queue_dev *pdev = cbq->pdev;
63
64 if (likely(pdev->cn_queue))
65 return queue_work(pdev->cn_queue, work);
66
67 /* Don't create the connector workqueue twice */
68 if (atomic_inc_return(&pdev->wq_requested) == 1)
69 schedule_work(&pdev->wq_creation);
70 else
71 atomic_dec(&pdev->wq_requested);
72
73 return schedule_work(work);
74}
75
David Howellsc4028952006-11-22 14:57:56 +000076void cn_queue_wrapper(struct work_struct *work)
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -070077{
David Howellsc4028952006-11-22 14:57:56 +000078 struct cn_callback_entry *cbq =
Evgeniy Polyakova240d9f2006-12-18 01:53:58 -080079 container_of(work, struct cn_callback_entry, work);
David Howellsc4028952006-11-22 14:57:56 +000080 struct cn_callback_data *d = &cbq->data;
Philipp Reisner293500a2009-10-02 02:40:04 +000081 struct cn_msg *msg = NLMSG_DATA(nlmsg_hdr(d->skb));
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -070082
Philipp Reisner293500a2009-10-02 02:40:04 +000083 d->callback(msg);
Evgeniy Polyakovacd042b2005-09-26 15:06:50 -070084
85 d->destruct_data(d->ddata);
86 d->ddata = NULL;
87
88 kfree(d->free);
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -070089}
90
Mike Frysinger07412412009-07-17 10:13:21 -070091static struct cn_callback_entry *
92cn_queue_alloc_callback_entry(char *name, struct cb_id *id,
93 void (*callback)(struct cn_msg *))
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -070094{
95 struct cn_callback_entry *cbq;
96
97 cbq = kzalloc(sizeof(*cbq), GFP_KERNEL);
98 if (!cbq) {
99 printk(KERN_ERR "Failed to create new callback queue.\n");
100 return NULL;
101 }
102
Evgeniy Polyakovacd042b2005-09-26 15:06:50 -0700103 snprintf(cbq->id.name, sizeof(cbq->id.name), "%s", name);
104 memcpy(&cbq->id.id, id, sizeof(struct cb_id));
105 cbq->data.callback = callback;
Frederic Weisbecker1a5645b2009-02-02 23:22:04 -0800106
Evgeniy Polyakova240d9f2006-12-18 01:53:58 -0800107 INIT_WORK(&cbq->work, &cn_queue_wrapper);
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700108 return cbq;
109}
110
111static void cn_queue_free_callback(struct cn_callback_entry *cbq)
112{
Frederic Weisbecker1a5645b2009-02-02 23:22:04 -0800113 /* The first jobs have been sent to kevent, flush them too */
114 flush_scheduled_work();
115 if (cbq->pdev->cn_queue)
116 flush_workqueue(cbq->pdev->cn_queue);
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700117
118 kfree(cbq);
119}
120
121int cn_cb_equal(struct cb_id *i1, struct cb_id *i2)
122{
123 return ((i1->idx == i2->idx) && (i1->val == i2->val));
124}
125
Mike Frysinger07412412009-07-17 10:13:21 -0700126int cn_queue_add_callback(struct cn_queue_dev *dev, char *name, struct cb_id *id,
127 void (*callback)(struct cn_msg *))
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700128{
129 struct cn_callback_entry *cbq, *__cbq;
130 int found = 0;
131
Evgeniy Polyakovacd042b2005-09-26 15:06:50 -0700132 cbq = cn_queue_alloc_callback_entry(name, id, callback);
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700133 if (!cbq)
134 return -ENOMEM;
135
136 atomic_inc(&dev->refcnt);
137 cbq->pdev = dev;
138
139 spin_lock_bh(&dev->queue_lock);
140 list_for_each_entry(__cbq, &dev->queue_list, callback_entry) {
Evgeniy Polyakovacd042b2005-09-26 15:06:50 -0700141 if (cn_cb_equal(&__cbq->id.id, id)) {
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700142 found = 1;
143 break;
144 }
145 }
146 if (!found)
147 list_add_tail(&cbq->callback_entry, &dev->queue_list);
148 spin_unlock_bh(&dev->queue_lock);
149
150 if (found) {
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700151 cn_queue_free_callback(cbq);
Li Zefancf585ae2008-01-08 23:44:44 -0800152 atomic_dec(&dev->refcnt);
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700153 return -EINVAL;
154 }
155
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700156 cbq->seq = 0;
Evgeniy Polyakovacd042b2005-09-26 15:06:50 -0700157 cbq->group = cbq->id.id.idx;
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700158
159 return 0;
160}
161
162void cn_queue_del_callback(struct cn_queue_dev *dev, struct cb_id *id)
163{
164 struct cn_callback_entry *cbq, *n;
165 int found = 0;
166
167 spin_lock_bh(&dev->queue_lock);
168 list_for_each_entry_safe(cbq, n, &dev->queue_list, callback_entry) {
Evgeniy Polyakovacd042b2005-09-26 15:06:50 -0700169 if (cn_cb_equal(&cbq->id.id, id)) {
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700170 list_del(&cbq->callback_entry);
171 found = 1;
172 break;
173 }
174 }
175 spin_unlock_bh(&dev->queue_lock);
176
177 if (found) {
178 cn_queue_free_callback(cbq);
Andreas Schwabcec6f7f2006-06-05 21:21:57 -0700179 atomic_dec(&dev->refcnt);
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700180 }
181}
182
183struct cn_queue_dev *cn_queue_alloc_dev(char *name, struct sock *nls)
184{
185 struct cn_queue_dev *dev;
186
187 dev = kzalloc(sizeof(*dev), GFP_KERNEL);
188 if (!dev)
189 return NULL;
190
191 snprintf(dev->name, sizeof(dev->name), "%s", name);
192 atomic_set(&dev->refcnt, 0);
193 INIT_LIST_HEAD(&dev->queue_list);
194 spin_lock_init(&dev->queue_lock);
Frederic Weisbecker1a5645b2009-02-02 23:22:04 -0800195 init_waitqueue_head(&dev->wq_created);
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700196
197 dev->nls = nls;
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700198
Frederic Weisbecker1a5645b2009-02-02 23:22:04 -0800199 INIT_WORK(&dev->wq_creation, cn_queue_create);
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700200
201 return dev;
202}
203
204void cn_queue_free_dev(struct cn_queue_dev *dev)
205{
206 struct cn_callback_entry *cbq, *n;
Frederic Weisbecker1a5645b2009-02-02 23:22:04 -0800207 long timeout;
208 DEFINE_WAIT(wait);
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700209
Frederic Weisbecker1a5645b2009-02-02 23:22:04 -0800210 /* Flush the first pending jobs queued on kevent */
211 flush_scheduled_work();
212
213 /* If the connector workqueue creation is still pending, wait for it */
214 prepare_to_wait(&dev->wq_created, &wait, TASK_UNINTERRUPTIBLE);
215 if (atomic_read(&dev->wq_requested) && !dev->cn_queue) {
216 timeout = schedule_timeout(HZ * 2);
217 if (!timeout && !dev->cn_queue)
218 WARN_ON(1);
219 }
220 finish_wait(&dev->wq_created, &wait);
221
222 if (dev->cn_queue) {
223 flush_workqueue(dev->cn_queue);
224 destroy_workqueue(dev->cn_queue);
225 }
Evgeniy Polyakov7672d0b2005-09-11 19:15:07 -0700226
227 spin_lock_bh(&dev->queue_lock);
228 list_for_each_entry_safe(cbq, n, &dev->queue_list, callback_entry)
229 list_del(&cbq->callback_entry);
230 spin_unlock_bh(&dev->queue_lock);
231
232 while (atomic_read(&dev->refcnt)) {
233 printk(KERN_INFO "Waiting for %s to become free: refcnt=%d.\n",
234 dev->name, atomic_read(&dev->refcnt));
235 msleep(1000);
236 }
237
238 kfree(dev);
239 dev = NULL;
240}