connector.c 7.2 KB

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