connector.c 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293
  1. /*
  2. * connector.c
  3. *
  4. * 2004+ Copyright (c) Evgeniy Polyakov <zbr@ioremap.net>
  5. * All rights reserved.
  6. *
  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.
  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. #include <linux/kernel.h>
  22. #include <linux/module.h>
  23. #include <linux/list.h>
  24. #include <linux/skbuff.h>
  25. #include <linux/netlink.h>
  26. #include <linux/moduleparam.h>
  27. #include <linux/connector.h>
  28. #include <linux/slab.h>
  29. #include <linux/mutex.h>
  30. #include <linux/proc_fs.h>
  31. #include <linux/spinlock.h>
  32. #include <net/sock.h>
  33. MODULE_LICENSE("GPL");
  34. MODULE_AUTHOR("Evgeniy Polyakov <zbr@ioremap.net>");
  35. MODULE_DESCRIPTION("Generic userspace <-> kernelspace connector.");
  36. MODULE_ALIAS_NET_PF_PROTO(PF_NETLINK, NETLINK_CONNECTOR);
  37. static struct cn_dev cdev;
  38. static int cn_already_initialized;
  39. /*
  40. * msg->seq and msg->ack are used to determine message genealogy.
  41. * When someone sends message it puts there locally unique sequence
  42. * and random acknowledge numbers. Sequence number may be copied into
  43. * nlmsghdr->nlmsg_seq too.
  44. *
  45. * Sequence number is incremented with each message to be sent.
  46. *
  47. * If we expect reply to our message then the sequence number in
  48. * received message MUST be the same as in original message, and
  49. * acknowledge number MUST be the same + 1.
  50. *
  51. * If we receive a message and its sequence number is not equal to the
  52. * one we are expecting then it is a new message.
  53. *
  54. * If we receive a message and its sequence number is the same as one
  55. * we are expecting but it's acknowledgement number is not equal to
  56. * the acknowledgement number in the original message + 1, then it is
  57. * a new message.
  58. *
  59. */
  60. int cn_netlink_send(struct cn_msg *msg, u32 __group, gfp_t gfp_mask)
  61. {
  62. struct cn_callback_entry *__cbq;
  63. unsigned int size;
  64. struct sk_buff *skb;
  65. struct nlmsghdr *nlh;
  66. struct cn_msg *data;
  67. struct cn_dev *dev = &cdev;
  68. u32 group = 0;
  69. int found = 0;
  70. if (!__group) {
  71. spin_lock_bh(&dev->cbdev->queue_lock);
  72. list_for_each_entry(__cbq, &dev->cbdev->queue_list,
  73. callback_entry) {
  74. if (cn_cb_equal(&__cbq->id.id, &msg->id)) {
  75. found = 1;
  76. group = __cbq->group;
  77. break;
  78. }
  79. }
  80. spin_unlock_bh(&dev->cbdev->queue_lock);
  81. if (!found)
  82. return -ENODEV;
  83. } else {
  84. group = __group;
  85. }
  86. if (!netlink_has_listeners(dev->nls, group))
  87. return -ESRCH;
  88. size = NLMSG_SPACE(sizeof(*msg) + msg->len);
  89. skb = alloc_skb(size, gfp_mask);
  90. if (!skb)
  91. return -ENOMEM;
  92. nlh = NLMSG_PUT(skb, 0, msg->seq, NLMSG_DONE, size - sizeof(*nlh));
  93. data = NLMSG_DATA(nlh);
  94. memcpy(data, msg, sizeof(*data) + msg->len);
  95. NETLINK_CB(skb).dst_group = group;
  96. return netlink_broadcast(dev->nls, skb, 0, group, gfp_mask);
  97. nlmsg_failure:
  98. kfree_skb(skb);
  99. return -EINVAL;
  100. }
  101. EXPORT_SYMBOL_GPL(cn_netlink_send);
  102. /*
  103. * Callback helper - queues work and setup destructor for given data.
  104. */
  105. static int cn_call_callback(struct sk_buff *skb)
  106. {
  107. struct cn_callback_entry *i, *cbq = NULL;
  108. struct cn_dev *dev = &cdev;
  109. struct cn_msg *msg = NLMSG_DATA(nlmsg_hdr(skb));
  110. struct netlink_skb_parms *nsp = &NETLINK_CB(skb);
  111. int err = -ENODEV;
  112. spin_lock_bh(&dev->cbdev->queue_lock);
  113. list_for_each_entry(i, &dev->cbdev->queue_list, callback_entry) {
  114. if (cn_cb_equal(&i->id.id, &msg->id)) {
  115. atomic_inc(&i->refcnt);
  116. cbq = i;
  117. break;
  118. }
  119. }
  120. spin_unlock_bh(&dev->cbdev->queue_lock);
  121. if (cbq != NULL) {
  122. err = 0;
  123. cbq->callback(msg, nsp);
  124. kfree_skb(skb);
  125. cn_queue_release_callback(cbq);
  126. err = 0;
  127. }
  128. return err;
  129. }
  130. /*
  131. * Main netlink receiving function.
  132. *
  133. * It checks skb, netlink header and msg sizes, and calls callback helper.
  134. */
  135. static void cn_rx_skb(struct sk_buff *__skb)
  136. {
  137. struct nlmsghdr *nlh;
  138. int err;
  139. struct sk_buff *skb;
  140. skb = skb_get(__skb);
  141. if (skb->len >= NLMSG_SPACE(0)) {
  142. nlh = nlmsg_hdr(skb);
  143. if (nlh->nlmsg_len < sizeof(struct cn_msg) ||
  144. skb->len < nlh->nlmsg_len ||
  145. nlh->nlmsg_len > CONNECTOR_MAX_MSG_SIZE) {
  146. kfree_skb(skb);
  147. return;
  148. }
  149. err = cn_call_callback(skb);
  150. if (err < 0)
  151. kfree_skb(skb);
  152. }
  153. }
  154. /*
  155. * Callback add routing - adds callback with given ID and name.
  156. * If there is registered callback with the same ID it will not be added.
  157. *
  158. * May sleep.
  159. */
  160. int cn_add_callback(struct cb_id *id, const char *name,
  161. void (*callback)(struct cn_msg *, struct netlink_skb_parms *))
  162. {
  163. int err;
  164. struct cn_dev *dev = &cdev;
  165. if (!cn_already_initialized)
  166. return -EAGAIN;
  167. err = cn_queue_add_callback(dev->cbdev, name, id, callback);
  168. if (err)
  169. return err;
  170. return 0;
  171. }
  172. EXPORT_SYMBOL_GPL(cn_add_callback);
  173. /*
  174. * Callback remove routing - removes callback
  175. * with given ID.
  176. * If there is no registered callback with given
  177. * ID nothing happens.
  178. *
  179. * May sleep while waiting for reference counter to become zero.
  180. */
  181. void cn_del_callback(struct cb_id *id)
  182. {
  183. struct cn_dev *dev = &cdev;
  184. cn_queue_del_callback(dev->cbdev, id);
  185. }
  186. EXPORT_SYMBOL_GPL(cn_del_callback);
  187. static int cn_proc_show(struct seq_file *m, void *v)
  188. {
  189. struct cn_queue_dev *dev = cdev.cbdev;
  190. struct cn_callback_entry *cbq;
  191. seq_printf(m, "Name ID\n");
  192. spin_lock_bh(&dev->queue_lock);
  193. list_for_each_entry(cbq, &dev->queue_list, callback_entry) {
  194. seq_printf(m, "%-15s %u:%u\n",
  195. cbq->id.name,
  196. cbq->id.id.idx,
  197. cbq->id.id.val);
  198. }
  199. spin_unlock_bh(&dev->queue_lock);
  200. return 0;
  201. }
  202. static int cn_proc_open(struct inode *inode, struct file *file)
  203. {
  204. return single_open(file, cn_proc_show, NULL);
  205. }
  206. static const struct file_operations cn_file_ops = {
  207. .owner = THIS_MODULE,
  208. .open = cn_proc_open,
  209. .read = seq_read,
  210. .llseek = seq_lseek,
  211. .release = single_release
  212. };
  213. static int __devinit cn_init(void)
  214. {
  215. struct cn_dev *dev = &cdev;
  216. dev->input = cn_rx_skb;
  217. dev->nls = netlink_kernel_create(&init_net, NETLINK_CONNECTOR,
  218. CN_NETLINK_USERS + 0xf,
  219. dev->input, NULL, THIS_MODULE);
  220. if (!dev->nls)
  221. return -EIO;
  222. dev->cbdev = cn_queue_alloc_dev("cqueue", dev->nls);
  223. if (!dev->cbdev) {
  224. netlink_kernel_release(dev->nls);
  225. return -EINVAL;
  226. }
  227. cn_already_initialized = 1;
  228. proc_net_fops_create(&init_net, "connector", S_IRUGO, &cn_file_ops);
  229. return 0;
  230. }
  231. static void __devexit cn_fini(void)
  232. {
  233. struct cn_dev *dev = &cdev;
  234. cn_already_initialized = 0;
  235. proc_net_remove(&init_net, "connector");
  236. cn_queue_free_dev(dev->cbdev);
  237. netlink_kernel_release(dev->nls);
  238. }
  239. subsys_initcall(cn_init);
  240. module_exit(cn_fini);