4 * 2004-2005 Copyright (c) Evgeniy Polyakov <johnpol@2ka.mipt.ru>
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
22 #include <linux/kernel.h>
23 #include <linux/module.h>
24 #include <linux/list.h>
25 #include <linux/skbuff.h>
26 #include <linux/netlink.h>
27 #include <linux/moduleparam.h>
28 #include <linux/connector.h>
29 #include <linux/mutex.h>
33 MODULE_LICENSE("GPL");
34 MODULE_AUTHOR("Evgeniy Polyakov <johnpol@2ka.mipt.ru>");
35 MODULE_DESCRIPTION("Generic userspace <-> kernelspace connector.");
37 static u32 cn_idx = CN_IDX_CONNECTOR;
38 static u32 cn_val = CN_VAL_CONNECTOR;
40 module_param(cn_idx, uint, 0);
41 module_param(cn_val, uint, 0);
42 MODULE_PARM_DESC(cn_idx, "Connector's main device idx.");
43 MODULE_PARM_DESC(cn_val, "Connector's main device val.");
45 static DEFINE_MUTEX(notify_lock);
46 static LIST_HEAD(notify_list);
48 static struct cn_dev cdev;
50 int cn_already_initialized = 0;
53 * msg->seq and msg->ack are used to determine message genealogy.
54 * When someone sends message it puts there locally unique sequence
55 * and random acknowledge numbers. Sequence number may be copied into
56 * nlmsghdr->nlmsg_seq too.
58 * Sequence number is incremented with each message to be sent.
60 * If we expect reply to our message then the sequence number in
61 * received message MUST be the same as in original message, and
62 * acknowledge number MUST be the same + 1.
64 * If we receive a message and its sequence number is not equal to the
65 * one we are expecting then it is a new message.
67 * If we receive a message and its sequence number is the same as one
68 * we are expecting but it's acknowledgement number is not equal to
69 * the acknowledgement number in the original message + 1, then it is
73 int cn_netlink_send(struct cn_msg *msg, u32 __group, gfp_t gfp_mask)
75 struct cn_callback_entry *__cbq;
80 struct cn_dev *dev = &cdev;
85 spin_lock_bh(&dev->cbdev->queue_lock);
86 list_for_each_entry(__cbq, &dev->cbdev->queue_list,
88 if (cn_cb_equal(&__cbq->id.id, &msg->id)) {
93 spin_unlock_bh(&dev->cbdev->queue_lock);
101 if (!netlink_has_listeners(dev->nls, group))
104 size = NLMSG_SPACE(sizeof(*msg) + msg->len);
106 skb = alloc_skb(size, gfp_mask);
110 nlh = NLMSG_PUT(skb, 0, msg->seq, NLMSG_DONE, size - sizeof(*nlh));
112 data = NLMSG_DATA(nlh);
114 memcpy(data, msg, sizeof(*data) + msg->len);
116 NETLINK_CB(skb).dst_group = group;
118 return netlink_broadcast(dev->nls, skb, 0, group, gfp_mask);
126 * Callback helper - queues work and setup destructor for given data.
128 static int cn_call_callback(struct cn_msg *msg, void (*destruct_data)(void *), void *data)
130 struct cn_callback_entry *__cbq;
131 struct cn_dev *dev = &cdev;
134 spin_lock_bh(&dev->cbdev->queue_lock);
135 list_for_each_entry(__cbq, &dev->cbdev->queue_list, callback_entry) {
136 if (cn_cb_equal(&__cbq->id.id, &msg->id)) {
137 if (likely(!test_bit(0, &__cbq->work.pending) &&
138 __cbq->data.ddata == NULL)) {
139 __cbq->data.callback_priv = msg;
141 __cbq->data.ddata = data;
142 __cbq->data.destruct_data = destruct_data;
144 if (queue_work(dev->cbdev->cn_queue,
148 struct work_struct *w;
149 struct cn_callback_data *d;
151 w = kzalloc(sizeof(*w) + sizeof(*d), GFP_ATOMIC);
153 d = (struct cn_callback_data *)(w+1);
155 d->callback_priv = msg;
156 d->callback = __cbq->data.callback;
158 d->destruct_data = destruct_data;
161 INIT_LIST_HEAD(&w->entry);
163 w->func = &cn_queue_wrapper;
165 init_timer(&w->timer);
167 if (queue_work(dev->cbdev->cn_queue, w))
179 spin_unlock_bh(&dev->cbdev->queue_lock);
185 * Skb receive helper - checks skb and msg size and calls callback
188 static int __cn_rx_skb(struct sk_buff *skb, struct nlmsghdr *nlh)
190 u32 pid, uid, seq, group;
193 pid = NETLINK_CREDS(skb)->pid;
194 uid = NETLINK_CREDS(skb)->uid;
195 seq = nlh->nlmsg_seq;
196 group = NETLINK_CB((skb)).dst_group;
197 msg = NLMSG_DATA(nlh);
199 return cn_call_callback(msg, (void (*)(void *))kfree_skb, skb);
203 * Main netlink receiving function.
205 * It checks skb and netlink header sizes and calls the skb receive
206 * helper with a shared skb.
208 static void cn_rx_skb(struct sk_buff *__skb)
210 struct nlmsghdr *nlh;
215 skb = skb_get(__skb);
217 if (skb->len >= NLMSG_SPACE(0)) {
218 nlh = (struct nlmsghdr *)skb->data;
220 if (nlh->nlmsg_len < sizeof(struct cn_msg) ||
221 skb->len < nlh->nlmsg_len ||
222 nlh->nlmsg_len > CONNECTOR_MAX_MSG_SIZE) {
227 len = NLMSG_ALIGN(nlh->nlmsg_len);
231 err = __cn_rx_skb(skb, nlh);
241 * Netlink socket input callback - dequeues the skbs and calls the
242 * main netlink receiving function.
244 static void cn_input(struct sock *sk, int len)
248 while ((skb = skb_dequeue(&sk->sk_receive_queue)) != NULL)
253 * Notification routing.
255 * Gets id and checks if there are notification request for it's idx
256 * and val. If there are such requests notify the listeners with the
257 * given notify event.
260 static void cn_notify(struct cb_id *id, u32 notify_event)
262 struct cn_ctl_entry *ent;
264 mutex_lock(¬ify_lock);
265 list_for_each_entry(ent, ¬ify_list, notify_entry) {
267 struct cn_notify_req *req;
268 struct cn_ctl_msg *ctl = ent->msg;
269 int idx_found, val_found;
271 idx_found = val_found = 0;
273 req = (struct cn_notify_req *)ctl->data;
274 for (i = 0; i < ctl->idx_notify_num; ++i, ++req) {
275 if (id->idx >= req->first &&
276 id->idx < req->first + req->range) {
282 for (i = 0; i < ctl->val_notify_num; ++i, ++req) {
283 if (id->val >= req->first &&
284 id->val < req->first + req->range) {
290 if (idx_found && val_found) {
291 struct cn_msg m = { .ack = notify_event, };
293 memcpy(&m.id, id, sizeof(m.id));
294 cn_netlink_send(&m, ctl->group, GFP_KERNEL);
297 mutex_unlock(¬ify_lock);
301 * Callback add routing - adds callback with given ID and name.
302 * If there is registered callback with the same ID it will not be added.
306 int cn_add_callback(struct cb_id *id, char *name, void (*callback)(void *))
309 struct cn_dev *dev = &cdev;
311 err = cn_queue_add_callback(dev->cbdev, name, id, callback);
321 * Callback remove routing - removes callback
323 * If there is no registered callback with given
324 * ID nothing happens.
326 * May sleep while waiting for reference counter to become zero.
328 void cn_del_callback(struct cb_id *id)
330 struct cn_dev *dev = &cdev;
332 cn_queue_del_callback(dev->cbdev, id);
337 * Checks two connector's control messages to be the same.
338 * Returns 1 if they are the same or if the first one is corrupted.
340 static int cn_ctl_msg_equals(struct cn_ctl_msg *m1, struct cn_ctl_msg *m2)
343 struct cn_notify_req *req1, *req2;
345 if (m1->idx_notify_num != m2->idx_notify_num)
348 if (m1->val_notify_num != m2->val_notify_num)
351 if (m1->len != m2->len)
354 if ((m1->idx_notify_num + m1->val_notify_num) * sizeof(*req1) !=
358 req1 = (struct cn_notify_req *)m1->data;
359 req2 = (struct cn_notify_req *)m2->data;
361 for (i = 0; i < m1->idx_notify_num; ++i) {
362 if (req1->first != req2->first || req1->range != req2->range)
368 for (i = 0; i < m1->val_notify_num; ++i) {
369 if (req1->first != req2->first || req1->range != req2->range)
379 * Main connector device's callback.
381 * Used for notification of a request's processing.
383 static void cn_callback(void *data)
385 struct cn_msg *msg = data;
386 struct cn_ctl_msg *ctl;
387 struct cn_ctl_entry *ent;
390 if (msg->len < sizeof(*ctl))
393 ctl = (struct cn_ctl_msg *)msg->data;
395 size = (sizeof(*ctl) + ((ctl->idx_notify_num +
396 ctl->val_notify_num) *
397 sizeof(struct cn_notify_req)));
399 if (msg->len != size)
402 if (ctl->len + sizeof(*ctl) != msg->len)
406 * Remove notification.
408 if (ctl->group == 0) {
409 struct cn_ctl_entry *n;
411 mutex_lock(¬ify_lock);
412 list_for_each_entry_safe(ent, n, ¬ify_list, notify_entry) {
413 if (cn_ctl_msg_equals(ent->msg, ctl)) {
414 list_del(&ent->notify_entry);
418 mutex_unlock(¬ify_lock);
423 size += sizeof(*ent);
425 ent = kzalloc(size, GFP_KERNEL);
429 ent->msg = (struct cn_ctl_msg *)(ent + 1);
431 memcpy(ent->msg, ctl, size - sizeof(*ent));
433 mutex_lock(¬ify_lock);
434 list_add(&ent->notify_entry, ¬ify_list);
435 mutex_unlock(¬ify_lock);
438 static int __init cn_init(void)
440 struct cn_dev *dev = &cdev;
443 dev->input = cn_input;
444 dev->id.idx = cn_idx;
445 dev->id.val = cn_val;
447 dev->nls = netlink_kernel_create(NETLINK_CONNECTOR,
448 CN_NETLINK_USERS + 0xf,
449 dev->input, THIS_MODULE);
453 dev->cbdev = cn_queue_alloc_dev("cqueue", dev->nls);
455 if (dev->nls->sk_socket)
456 sock_release(dev->nls->sk_socket);
460 err = cn_add_callback(&dev->id, "connector", &cn_callback);
462 cn_queue_free_dev(dev->cbdev);
463 if (dev->nls->sk_socket)
464 sock_release(dev->nls->sk_socket);
468 cn_already_initialized = 1;
473 static void __exit cn_fini(void)
475 struct cn_dev *dev = &cdev;
477 cn_already_initialized = 0;
479 cn_del_callback(&dev->id);
480 cn_queue_free_dev(dev->cbdev);
481 if (dev->nls->sk_socket)
482 sock_release(dev->nls->sk_socket);
485 module_init(cn_init);
486 module_exit(cn_fini);
488 EXPORT_SYMBOL_GPL(cn_add_callback);
489 EXPORT_SYMBOL_GPL(cn_del_callback);
490 EXPORT_SYMBOL_GPL(cn_netlink_send);