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>
30 #include <linux/proc_fs.h>
31 #include <linux/spinlock.h>
35 MODULE_LICENSE("GPL");
36 MODULE_AUTHOR("Evgeniy Polyakov <johnpol@2ka.mipt.ru>");
37 MODULE_DESCRIPTION("Generic userspace <-> kernelspace connector.");
39 static u32 cn_idx
= CN_IDX_CONNECTOR
;
40 static u32 cn_val
= CN_VAL_CONNECTOR
;
42 module_param(cn_idx
, uint
, 0);
43 module_param(cn_val
, uint
, 0);
44 MODULE_PARM_DESC(cn_idx
, "Connector's main device idx.");
45 MODULE_PARM_DESC(cn_val
, "Connector's main device val.");
47 static DEFINE_MUTEX(notify_lock
);
48 static LIST_HEAD(notify_list
);
50 static struct cn_dev cdev
;
52 static int cn_already_initialized
;
55 * msg->seq and msg->ack are used to determine message genealogy.
56 * When someone sends message it puts there locally unique sequence
57 * and random acknowledge numbers. Sequence number may be copied into
58 * nlmsghdr->nlmsg_seq too.
60 * Sequence number is incremented with each message to be sent.
62 * If we expect reply to our message then the sequence number in
63 * received message MUST be the same as in original message, and
64 * acknowledge number MUST be the same + 1.
66 * If we receive a message and its sequence number is not equal to the
67 * one we are expecting then it is a new message.
69 * If we receive a message and its sequence number is the same as one
70 * we are expecting but it's acknowledgement number is not equal to
71 * the acknowledgement number in the original message + 1, then it is
75 int cn_netlink_send(struct cn_msg
*msg
, u32 __group
, gfp_t gfp_mask
)
77 struct cn_callback_entry
*__cbq
;
82 struct cn_dev
*dev
= &cdev
;
87 spin_lock_bh(&dev
->cbdev
->queue_lock
);
88 list_for_each_entry(__cbq
, &dev
->cbdev
->queue_list
,
90 if (cn_cb_equal(&__cbq
->id
.id
, &msg
->id
)) {
96 spin_unlock_bh(&dev
->cbdev
->queue_lock
);
104 if (!netlink_has_listeners(dev
->nls
, group
))
107 size
= NLMSG_SPACE(sizeof(*msg
) + msg
->len
);
109 skb
= alloc_skb(size
, gfp_mask
);
113 nlh
= NLMSG_PUT(skb
, 0, msg
->seq
, NLMSG_DONE
, size
- sizeof(*nlh
));
115 data
= NLMSG_DATA(nlh
);
117 memcpy(data
, msg
, sizeof(*data
) + msg
->len
);
119 NETLINK_CB(skb
).dst_group
= group
;
121 return netlink_broadcast(dev
->nls
, skb
, 0, group
, gfp_mask
);
127 EXPORT_SYMBOL_GPL(cn_netlink_send
);
130 * Callback helper - queues work and setup destructor for given data.
132 static int cn_call_callback(struct cn_msg
*msg
, void (*destruct_data
)(void *), void *data
)
134 struct cn_callback_entry
*__cbq
, *__new_cbq
;
135 struct cn_dev
*dev
= &cdev
;
138 spin_lock_bh(&dev
->cbdev
->queue_lock
);
139 list_for_each_entry(__cbq
, &dev
->cbdev
->queue_list
, callback_entry
) {
140 if (cn_cb_equal(&__cbq
->id
.id
, &msg
->id
)) {
141 if (likely(!work_pending(&__cbq
->work
) &&
142 __cbq
->data
.ddata
== NULL
)) {
143 __cbq
->data
.callback_priv
= msg
;
145 __cbq
->data
.ddata
= data
;
146 __cbq
->data
.destruct_data
= destruct_data
;
148 if (queue_work(dev
->cbdev
->cn_queue
,
154 struct cn_callback_data
*d
;
157 __new_cbq
= kzalloc(sizeof(struct cn_callback_entry
), GFP_ATOMIC
);
159 d
= &__new_cbq
->data
;
160 d
->callback_priv
= msg
;
161 d
->callback
= __cbq
->data
.callback
;
163 d
->destruct_data
= destruct_data
;
166 INIT_WORK(&__new_cbq
->work
,
169 if (queue_work(dev
->cbdev
->cn_queue
,
181 spin_unlock_bh(&dev
->cbdev
->queue_lock
);
187 * Main netlink receiving function.
189 * It checks skb, netlink header and msg sizes, and calls callback helper.
191 static void cn_rx_skb(struct sk_buff
*__skb
)
194 struct nlmsghdr
*nlh
;
198 skb
= skb_get(__skb
);
200 if (skb
->len
>= NLMSG_SPACE(0)) {
201 nlh
= nlmsg_hdr(skb
);
203 if (nlh
->nlmsg_len
< sizeof(struct cn_msg
) ||
204 skb
->len
< nlh
->nlmsg_len
||
205 nlh
->nlmsg_len
> CONNECTOR_MAX_MSG_SIZE
) {
210 msg
= NLMSG_DATA(nlh
);
211 err
= cn_call_callback(msg
, (void (*)(void *))kfree_skb
, skb
);
218 * Notification routing.
220 * Gets id and checks if there are notification request for it's idx
221 * and val. If there are such requests notify the listeners with the
222 * given notify event.
225 static void cn_notify(struct cb_id
*id
, u32 notify_event
)
227 struct cn_ctl_entry
*ent
;
229 mutex_lock(¬ify_lock
);
230 list_for_each_entry(ent
, ¬ify_list
, notify_entry
) {
232 struct cn_notify_req
*req
;
233 struct cn_ctl_msg
*ctl
= ent
->msg
;
234 int idx_found
, val_found
;
236 idx_found
= val_found
= 0;
238 req
= (struct cn_notify_req
*)ctl
->data
;
239 for (i
= 0; i
< ctl
->idx_notify_num
; ++i
, ++req
) {
240 if (id
->idx
>= req
->first
&&
241 id
->idx
< req
->first
+ req
->range
) {
247 for (i
= 0; i
< ctl
->val_notify_num
; ++i
, ++req
) {
248 if (id
->val
>= req
->first
&&
249 id
->val
< req
->first
+ req
->range
) {
255 if (idx_found
&& val_found
) {
256 struct cn_msg m
= { .ack
= notify_event
, };
258 memcpy(&m
.id
, id
, sizeof(m
.id
));
259 cn_netlink_send(&m
, ctl
->group
, GFP_KERNEL
);
262 mutex_unlock(¬ify_lock
);
266 * Callback add routing - adds callback with given ID and name.
267 * If there is registered callback with the same ID it will not be added.
271 int cn_add_callback(struct cb_id
*id
, char *name
, void (*callback
)(void *))
274 struct cn_dev
*dev
= &cdev
;
276 if (!cn_already_initialized
)
279 err
= cn_queue_add_callback(dev
->cbdev
, name
, id
, callback
);
287 EXPORT_SYMBOL_GPL(cn_add_callback
);
290 * Callback remove routing - removes callback
292 * If there is no registered callback with given
293 * ID nothing happens.
295 * May sleep while waiting for reference counter to become zero.
297 void cn_del_callback(struct cb_id
*id
)
299 struct cn_dev
*dev
= &cdev
;
301 cn_queue_del_callback(dev
->cbdev
, id
);
304 EXPORT_SYMBOL_GPL(cn_del_callback
);
307 * Checks two connector's control messages to be the same.
308 * Returns 1 if they are the same or if the first one is corrupted.
310 static int cn_ctl_msg_equals(struct cn_ctl_msg
*m1
, struct cn_ctl_msg
*m2
)
313 struct cn_notify_req
*req1
, *req2
;
315 if (m1
->idx_notify_num
!= m2
->idx_notify_num
)
318 if (m1
->val_notify_num
!= m2
->val_notify_num
)
321 if (m1
->len
!= m2
->len
)
324 if ((m1
->idx_notify_num
+ m1
->val_notify_num
) * sizeof(*req1
) !=
328 req1
= (struct cn_notify_req
*)m1
->data
;
329 req2
= (struct cn_notify_req
*)m2
->data
;
331 for (i
= 0; i
< m1
->idx_notify_num
; ++i
) {
332 if (req1
->first
!= req2
->first
|| req1
->range
!= req2
->range
)
338 for (i
= 0; i
< m1
->val_notify_num
; ++i
) {
339 if (req1
->first
!= req2
->first
|| req1
->range
!= req2
->range
)
349 * Main connector device's callback.
351 * Used for notification of a request's processing.
353 static void cn_callback(void *data
)
355 struct cn_msg
*msg
= data
;
356 struct cn_ctl_msg
*ctl
;
357 struct cn_ctl_entry
*ent
;
360 if (msg
->len
< sizeof(*ctl
))
363 ctl
= (struct cn_ctl_msg
*)msg
->data
;
365 size
= (sizeof(*ctl
) + ((ctl
->idx_notify_num
+
366 ctl
->val_notify_num
) *
367 sizeof(struct cn_notify_req
)));
369 if (msg
->len
!= size
)
372 if (ctl
->len
+ sizeof(*ctl
) != msg
->len
)
376 * Remove notification.
378 if (ctl
->group
== 0) {
379 struct cn_ctl_entry
*n
;
381 mutex_lock(¬ify_lock
);
382 list_for_each_entry_safe(ent
, n
, ¬ify_list
, notify_entry
) {
383 if (cn_ctl_msg_equals(ent
->msg
, ctl
)) {
384 list_del(&ent
->notify_entry
);
388 mutex_unlock(¬ify_lock
);
393 size
+= sizeof(*ent
);
395 ent
= kzalloc(size
, GFP_KERNEL
);
399 ent
->msg
= (struct cn_ctl_msg
*)(ent
+ 1);
401 memcpy(ent
->msg
, ctl
, size
- sizeof(*ent
));
403 mutex_lock(¬ify_lock
);
404 list_add(&ent
->notify_entry
, ¬ify_list
);
405 mutex_unlock(¬ify_lock
);
408 static int cn_proc_show(struct seq_file
*m
, void *v
)
410 struct cn_queue_dev
*dev
= cdev
.cbdev
;
411 struct cn_callback_entry
*cbq
;
413 seq_printf(m
, "Name ID\n");
415 spin_lock_bh(&dev
->queue_lock
);
417 list_for_each_entry(cbq
, &dev
->queue_list
, callback_entry
) {
418 seq_printf(m
, "%-15s %u:%u\n",
424 spin_unlock_bh(&dev
->queue_lock
);
429 static int cn_proc_open(struct inode
*inode
, struct file
*file
)
431 return single_open(file
, cn_proc_show
, NULL
);
434 static const struct file_operations cn_file_ops
= {
435 .owner
= THIS_MODULE
,
436 .open
= cn_proc_open
,
439 .release
= single_release
442 static int __devinit
cn_init(void)
444 struct cn_dev
*dev
= &cdev
;
447 dev
->input
= cn_rx_skb
;
448 dev
->id
.idx
= cn_idx
;
449 dev
->id
.val
= cn_val
;
451 dev
->nls
= netlink_kernel_create(&init_net
, NETLINK_CONNECTOR
,
452 CN_NETLINK_USERS
+ 0xf,
453 dev
->input
, NULL
, THIS_MODULE
);
457 dev
->cbdev
= cn_queue_alloc_dev("cqueue", dev
->nls
);
459 netlink_kernel_release(dev
->nls
);
463 cn_already_initialized
= 1;
465 err
= cn_add_callback(&dev
->id
, "connector", &cn_callback
);
467 cn_already_initialized
= 0;
468 cn_queue_free_dev(dev
->cbdev
);
469 netlink_kernel_release(dev
->nls
);
473 proc_net_fops_create(&init_net
, "connector", S_IRUGO
, &cn_file_ops
);
478 static void __devexit
cn_fini(void)
480 struct cn_dev
*dev
= &cdev
;
482 cn_already_initialized
= 0;
484 proc_net_remove(&init_net
, "connector");
486 cn_del_callback(&dev
->id
);
487 cn_queue_free_dev(dev
->cbdev
);
488 netlink_kernel_release(dev
->nls
);
491 subsys_initcall(cn_init
);
492 module_exit(cn_fini
);