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
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/slab.h>
30 #include <linux/mutex.h>
31 #include <linux/proc_fs.h>
32 #include <linux/spinlock.h>
36 MODULE_LICENSE("GPL");
37 MODULE_AUTHOR("Evgeniy Polyakov <zbr@ioremap.net>");
38 MODULE_DESCRIPTION("Generic userspace <-> kernelspace connector.");
39 MODULE_ALIAS_NET_PF_PROTO(PF_NETLINK, NETLINK_CONNECTOR);
41 static struct cn_dev cdev;
43 static int cn_already_initialized;
46 * msg->seq and msg->ack are used to determine message genealogy.
47 * When someone sends message it puts there locally unique sequence
48 * and random acknowledge numbers. Sequence number may be copied into
49 * nlmsghdr->nlmsg_seq too.
51 * Sequence number is incremented with each message to be sent.
53 * If we expect reply to our message then the sequence number in
54 * received message MUST be the same as in original message, and
55 * acknowledge number MUST be the same + 1.
57 * If we receive a message and its sequence number is not equal to the
58 * one we are expecting then it is a new message.
60 * If we receive a message and its sequence number is the same as one
61 * we are expecting but it's acknowledgement number is not equal to
62 * the acknowledgement number in the original message + 1, then it is
66 int cn_netlink_send(struct cn_msg *msg, u32 __group, gfp_t gfp_mask)
68 struct cn_callback_entry *__cbq;
73 struct cn_dev *dev = &cdev;
78 spin_lock_bh(&dev->cbdev->queue_lock);
79 list_for_each_entry(__cbq, &dev->cbdev->queue_list,
81 if (cn_cb_equal(&__cbq->id.id, &msg->id)) {
87 spin_unlock_bh(&dev->cbdev->queue_lock);
95 if (!netlink_has_listeners(dev->nls, group))
98 size = NLMSG_SPACE(sizeof(*msg) + msg->len);
100 skb = alloc_skb(size, gfp_mask);
104 nlh = nlmsg_put(skb, 0, msg->seq, NLMSG_DONE, size - sizeof(*nlh), 0);
110 data = nlmsg_data(nlh);
112 memcpy(data, msg, sizeof(*data) + msg->len);
114 NETLINK_CB(skb).dst_group = group;
116 return netlink_broadcast(dev->nls, skb, 0, group, gfp_mask);
118 EXPORT_SYMBOL_GPL(cn_netlink_send);
121 * Callback helper - queues work and setup destructor for given data.
123 static int cn_call_callback(struct sk_buff *skb)
125 struct cn_callback_entry *i, *cbq = NULL;
126 struct cn_dev *dev = &cdev;
127 struct cn_msg *msg = NLMSG_DATA(nlmsg_hdr(skb));
128 struct netlink_skb_parms *nsp = &NETLINK_CB(skb);
131 spin_lock_bh(&dev->cbdev->queue_lock);
132 list_for_each_entry(i, &dev->cbdev->queue_list, callback_entry) {
133 if (cn_cb_equal(&i->id.id, &msg->id)) {
134 atomic_inc(&i->refcnt);
139 spin_unlock_bh(&dev->cbdev->queue_lock);
143 cbq->callback(msg, nsp);
145 cn_queue_release_callback(cbq);
153 * Main netlink receiving function.
155 * It checks skb, netlink header and msg sizes, and calls callback helper.
157 static void cn_rx_skb(struct sk_buff *__skb)
159 struct nlmsghdr *nlh;
163 skb = skb_get(__skb);
165 if (skb->len >= NLMSG_SPACE(0)) {
166 nlh = nlmsg_hdr(skb);
168 if (nlh->nlmsg_len < sizeof(struct cn_msg) ||
169 skb->len < nlh->nlmsg_len ||
170 nlh->nlmsg_len > CONNECTOR_MAX_MSG_SIZE) {
175 err = cn_call_callback(skb);
182 * Callback add routing - adds callback with given ID and name.
183 * If there is registered callback with the same ID it will not be added.
187 int cn_add_callback(struct cb_id *id, const char *name,
188 void (*callback)(struct cn_msg *,
189 struct netlink_skb_parms *))
192 struct cn_dev *dev = &cdev;
194 if (!cn_already_initialized)
197 err = cn_queue_add_callback(dev->cbdev, name, id, callback);
203 EXPORT_SYMBOL_GPL(cn_add_callback);
206 * Callback remove routing - removes callback
208 * If there is no registered callback with given
209 * ID nothing happens.
211 * May sleep while waiting for reference counter to become zero.
213 void cn_del_callback(struct cb_id *id)
215 struct cn_dev *dev = &cdev;
217 cn_queue_del_callback(dev->cbdev, id);
219 EXPORT_SYMBOL_GPL(cn_del_callback);
221 static int cn_proc_show(struct seq_file *m, void *v)
223 struct cn_queue_dev *dev = cdev.cbdev;
224 struct cn_callback_entry *cbq;
226 seq_printf(m, "Name ID\n");
228 spin_lock_bh(&dev->queue_lock);
230 list_for_each_entry(cbq, &dev->queue_list, callback_entry) {
231 seq_printf(m, "%-15s %u:%u\n",
237 spin_unlock_bh(&dev->queue_lock);
242 static int cn_proc_open(struct inode *inode, struct file *file)
244 return single_open(file, cn_proc_show, NULL);
247 static const struct file_operations cn_file_ops = {
248 .owner = THIS_MODULE,
249 .open = cn_proc_open,
252 .release = single_release
255 static struct cn_dev cdev = {
259 static int cn_init(void)
261 struct cn_dev *dev = &cdev;
262 struct netlink_kernel_cfg cfg = {
263 .groups = CN_NETLINK_USERS + 0xf,
267 dev->nls = netlink_kernel_create(&init_net, NETLINK_CONNECTOR, &cfg);
271 dev->cbdev = cn_queue_alloc_dev("cqueue", dev->nls);
273 netlink_kernel_release(dev->nls);
277 cn_already_initialized = 1;
279 proc_create("connector", S_IRUGO, init_net.proc_net, &cn_file_ops);
284 static void cn_fini(void)
286 struct cn_dev *dev = &cdev;
288 cn_already_initialized = 0;
290 remove_proc_entry("connector", init_net.proc_net);
292 cn_queue_free_dev(dev->cbdev);
293 netlink_kernel_release(dev->nls);
296 subsys_initcall(cn_init);
297 module_exit(cn_fini);