connector.c 7.2 KB

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