connector.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489
  1. /*
  2. * connector.c
  3. *
  4. * 2004-2005 Copyright (c) Evgeniy Polyakov <johnpol@2ka.mipt.ru>
  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 <net/sock.h>
  29. MODULE_LICENSE("GPL");
  30. MODULE_AUTHOR("Evgeniy Polyakov <johnpol@2ka.mipt.ru>");
  31. MODULE_DESCRIPTION("Generic userspace <-> kernelspace connector.");
  32. static u32 cn_idx = CN_IDX_CONNECTOR;
  33. static u32 cn_val = CN_VAL_CONNECTOR;
  34. module_param(cn_idx, uint, 0);
  35. module_param(cn_val, uint, 0);
  36. MODULE_PARM_DESC(cn_idx, "Connector's main device idx.");
  37. MODULE_PARM_DESC(cn_val, "Connector's main device val.");
  38. static DECLARE_MUTEX(notify_lock);
  39. static LIST_HEAD(notify_list);
  40. static struct cn_dev cdev;
  41. int cn_already_initialized = 0;
  42. /*
  43. * msg->seq and msg->ack are used to determine message genealogy.
  44. * When someone sends message it puts there locally unique sequence
  45. * and random acknowledge numbers. Sequence number may be copied into
  46. * nlmsghdr->nlmsg_seq too.
  47. *
  48. * Sequence number is incremented with each message to be sent.
  49. *
  50. * If we expect reply to our message then the sequence number in
  51. * received message MUST be the same as in original message, and
  52. * acknowledge number MUST be the same + 1.
  53. *
  54. * If we receive a message and its sequence number is not equal to the
  55. * one we are expecting then it is a new message.
  56. *
  57. * If we receive a message and its sequence number is the same as one
  58. * we are expecting but it's acknowledgement number is not equal to
  59. * the acknowledgement number in the original message + 1, then it is
  60. * a new message.
  61. *
  62. */
  63. int cn_netlink_send(struct cn_msg *msg, u32 __group,
  64. unsigned int __nocast gfp_mask)
  65. {
  66. struct cn_callback_entry *__cbq;
  67. unsigned int size;
  68. struct sk_buff *skb;
  69. struct nlmsghdr *nlh;
  70. struct cn_msg *data;
  71. struct cn_dev *dev = &cdev;
  72. u32 group = 0;
  73. int found = 0;
  74. if (!__group) {
  75. spin_lock_bh(&dev->cbdev->queue_lock);
  76. list_for_each_entry(__cbq, &dev->cbdev->queue_list,
  77. callback_entry) {
  78. if (cn_cb_equal(&__cbq->id.id, &msg->id)) {
  79. found = 1;
  80. group = __cbq->group;
  81. }
  82. }
  83. spin_unlock_bh(&dev->cbdev->queue_lock);
  84. if (!found)
  85. return -ENODEV;
  86. } else {
  87. group = __group;
  88. }
  89. size = NLMSG_SPACE(sizeof(*msg) + msg->len);
  90. skb = alloc_skb(size, gfp_mask);
  91. if (!skb)
  92. return -ENOMEM;
  93. nlh = NLMSG_PUT(skb, 0, msg->seq, NLMSG_DONE, size - sizeof(*nlh));
  94. data = NLMSG_DATA(nlh);
  95. memcpy(data, msg, sizeof(*data) + msg->len);
  96. NETLINK_CB(skb).dst_group = group;
  97. netlink_broadcast(dev->nls, skb, 0, group, gfp_mask);
  98. return 0;
  99. nlmsg_failure:
  100. kfree_skb(skb);
  101. return -EINVAL;
  102. }
  103. /*
  104. * Callback helper - queues work and setup destructor for given data.
  105. */
  106. static int cn_call_callback(struct cn_msg *msg, void (*destruct_data)(void *), void *data)
  107. {
  108. struct cn_callback_entry *__cbq;
  109. struct cn_dev *dev = &cdev;
  110. int err = -ENODEV;
  111. spin_lock_bh(&dev->cbdev->queue_lock);
  112. list_for_each_entry(__cbq, &dev->cbdev->queue_list, callback_entry) {
  113. if (cn_cb_equal(&__cbq->id.id, &msg->id)) {
  114. if (likely(!test_bit(0, &__cbq->work.pending) &&
  115. __cbq->data.ddata == NULL)) {
  116. __cbq->data.callback_priv = msg;
  117. __cbq->data.ddata = data;
  118. __cbq->data.destruct_data = destruct_data;
  119. if (queue_work(dev->cbdev->cn_queue,
  120. &__cbq->work))
  121. err = 0;
  122. } else {
  123. struct work_struct *w;
  124. struct cn_callback_data *d;
  125. w = kzalloc(sizeof(*w) + sizeof(*d), GFP_ATOMIC);
  126. if (w) {
  127. d = (struct cn_callback_data *)(w+1);
  128. d->callback_priv = msg;
  129. d->callback = __cbq->data.callback;
  130. d->ddata = data;
  131. d->destruct_data = destruct_data;
  132. d->free = w;
  133. INIT_LIST_HEAD(&w->entry);
  134. w->pending = 0;
  135. w->func = &cn_queue_wrapper;
  136. w->data = d;
  137. init_timer(&w->timer);
  138. if (queue_work(dev->cbdev->cn_queue, w))
  139. err = 0;
  140. else {
  141. kfree(w);
  142. err = -EINVAL;
  143. }
  144. } else
  145. err = -ENOMEM;
  146. }
  147. break;
  148. }
  149. }
  150. spin_unlock_bh(&dev->cbdev->queue_lock);
  151. return err;
  152. }
  153. /*
  154. * Skb receive helper - checks skb and msg size and calls callback
  155. * helper.
  156. */
  157. static int __cn_rx_skb(struct sk_buff *skb, struct nlmsghdr *nlh)
  158. {
  159. u32 pid, uid, seq, group;
  160. struct cn_msg *msg;
  161. pid = NETLINK_CREDS(skb)->pid;
  162. uid = NETLINK_CREDS(skb)->uid;
  163. seq = nlh->nlmsg_seq;
  164. group = NETLINK_CB((skb)).dst_group;
  165. msg = NLMSG_DATA(nlh);
  166. return cn_call_callback(msg, (void (*)(void *))kfree_skb, skb);
  167. }
  168. /*
  169. * Main netlink receiving function.
  170. *
  171. * It checks skb and netlink header sizes and calls the skb receive
  172. * helper with a shared skb.
  173. */
  174. static void cn_rx_skb(struct sk_buff *__skb)
  175. {
  176. struct nlmsghdr *nlh;
  177. u32 len;
  178. int err;
  179. struct sk_buff *skb;
  180. skb = skb_get(__skb);
  181. if (skb->len >= NLMSG_SPACE(0)) {
  182. nlh = (struct nlmsghdr *)skb->data;
  183. if (nlh->nlmsg_len < sizeof(struct cn_msg) ||
  184. skb->len < nlh->nlmsg_len ||
  185. nlh->nlmsg_len > CONNECTOR_MAX_MSG_SIZE) {
  186. kfree_skb(skb);
  187. goto out;
  188. }
  189. len = NLMSG_ALIGN(nlh->nlmsg_len);
  190. if (len > skb->len)
  191. len = skb->len;
  192. err = __cn_rx_skb(skb, nlh);
  193. if (err < 0)
  194. kfree_skb(skb);
  195. }
  196. out:
  197. kfree_skb(__skb);
  198. }
  199. /*
  200. * Netlink socket input callback - dequeues the skbs and calls the
  201. * main netlink receiving function.
  202. */
  203. static void cn_input(struct sock *sk, int len)
  204. {
  205. struct sk_buff *skb;
  206. while ((skb = skb_dequeue(&sk->sk_receive_queue)) != NULL)
  207. cn_rx_skb(skb);
  208. }
  209. /*
  210. * Notification routing.
  211. *
  212. * Gets id and checks if there are notification request for it's idx
  213. * and val. If there are such requests notify the listeners with the
  214. * given notify event.
  215. *
  216. */
  217. static void cn_notify(struct cb_id *id, u32 notify_event)
  218. {
  219. struct cn_ctl_entry *ent;
  220. down(&notify_lock);
  221. list_for_each_entry(ent, &notify_list, notify_entry) {
  222. int i;
  223. struct cn_notify_req *req;
  224. struct cn_ctl_msg *ctl = ent->msg;
  225. int idx_found, val_found;
  226. idx_found = val_found = 0;
  227. req = (struct cn_notify_req *)ctl->data;
  228. for (i = 0; i < ctl->idx_notify_num; ++i, ++req) {
  229. if (id->idx >= req->first &&
  230. id->idx < req->first + req->range) {
  231. idx_found = 1;
  232. break;
  233. }
  234. }
  235. for (i = 0; i < ctl->val_notify_num; ++i, ++req) {
  236. if (id->val >= req->first &&
  237. id->val < req->first + req->range) {
  238. val_found = 1;
  239. break;
  240. }
  241. }
  242. if (idx_found && val_found) {
  243. struct cn_msg m = { .ack = notify_event, };
  244. memcpy(&m.id, id, sizeof(m.id));
  245. cn_netlink_send(&m, ctl->group, GFP_KERNEL);
  246. }
  247. }
  248. up(&notify_lock);
  249. }
  250. /*
  251. * Callback add routing - adds callback with given ID and name.
  252. * If there is registered callback with the same ID it will not be added.
  253. *
  254. * May sleep.
  255. */
  256. int cn_add_callback(struct cb_id *id, char *name, void (*callback)(void *))
  257. {
  258. int err;
  259. struct cn_dev *dev = &cdev;
  260. err = cn_queue_add_callback(dev->cbdev, name, id, callback);
  261. if (err)
  262. return err;
  263. cn_notify(id, 0);
  264. return 0;
  265. }
  266. /*
  267. * Callback remove routing - removes callback
  268. * with given ID.
  269. * If there is no registered callback with given
  270. * ID nothing happens.
  271. *
  272. * May sleep while waiting for reference counter to become zero.
  273. */
  274. void cn_del_callback(struct cb_id *id)
  275. {
  276. struct cn_dev *dev = &cdev;
  277. cn_queue_del_callback(dev->cbdev, id);
  278. cn_notify(id, 1);
  279. }
  280. /*
  281. * Checks two connector's control messages to be the same.
  282. * Returns 1 if they are the same or if the first one is corrupted.
  283. */
  284. static int cn_ctl_msg_equals(struct cn_ctl_msg *m1, struct cn_ctl_msg *m2)
  285. {
  286. int i;
  287. struct cn_notify_req *req1, *req2;
  288. if (m1->idx_notify_num != m2->idx_notify_num)
  289. return 0;
  290. if (m1->val_notify_num != m2->val_notify_num)
  291. return 0;
  292. if (m1->len != m2->len)
  293. return 0;
  294. if ((m1->idx_notify_num + m1->val_notify_num) * sizeof(*req1) !=
  295. m1->len)
  296. return 1;
  297. req1 = (struct cn_notify_req *)m1->data;
  298. req2 = (struct cn_notify_req *)m2->data;
  299. for (i = 0; i < m1->idx_notify_num; ++i) {
  300. if (req1->first != req2->first || req1->range != req2->range)
  301. return 0;
  302. req1++;
  303. req2++;
  304. }
  305. for (i = 0; i < m1->val_notify_num; ++i) {
  306. if (req1->first != req2->first || req1->range != req2->range)
  307. return 0;
  308. req1++;
  309. req2++;
  310. }
  311. return 1;
  312. }
  313. /*
  314. * Main connector device's callback.
  315. *
  316. * Used for notification of a request's processing.
  317. */
  318. static void cn_callback(void *data)
  319. {
  320. struct cn_msg *msg = data;
  321. struct cn_ctl_msg *ctl;
  322. struct cn_ctl_entry *ent;
  323. u32 size;
  324. if (msg->len < sizeof(*ctl))
  325. return;
  326. ctl = (struct cn_ctl_msg *)msg->data;
  327. size = (sizeof(*ctl) + ((ctl->idx_notify_num +
  328. ctl->val_notify_num) *
  329. sizeof(struct cn_notify_req)));
  330. if (msg->len != size)
  331. return;
  332. if (ctl->len + sizeof(*ctl) != msg->len)
  333. return;
  334. /*
  335. * Remove notification.
  336. */
  337. if (ctl->group == 0) {
  338. struct cn_ctl_entry *n;
  339. down(&notify_lock);
  340. list_for_each_entry_safe(ent, n, &notify_list, notify_entry) {
  341. if (cn_ctl_msg_equals(ent->msg, ctl)) {
  342. list_del(&ent->notify_entry);
  343. kfree(ent);
  344. }
  345. }
  346. up(&notify_lock);
  347. return;
  348. }
  349. size += sizeof(*ent);
  350. ent = kzalloc(size, GFP_KERNEL);
  351. if (!ent)
  352. return;
  353. ent->msg = (struct cn_ctl_msg *)(ent + 1);
  354. memcpy(ent->msg, ctl, size - sizeof(*ent));
  355. down(&notify_lock);
  356. list_add(&ent->notify_entry, &notify_list);
  357. up(&notify_lock);
  358. }
  359. static int __init cn_init(void)
  360. {
  361. struct cn_dev *dev = &cdev;
  362. int err;
  363. dev->input = cn_input;
  364. dev->id.idx = cn_idx;
  365. dev->id.val = cn_val;
  366. dev->nls = netlink_kernel_create(NETLINK_CONNECTOR,
  367. CN_NETLINK_USERS + 0xf,
  368. dev->input, THIS_MODULE);
  369. if (!dev->nls)
  370. return -EIO;
  371. dev->cbdev = cn_queue_alloc_dev("cqueue", dev->nls);
  372. if (!dev->cbdev) {
  373. if (dev->nls->sk_socket)
  374. sock_release(dev->nls->sk_socket);
  375. return -EINVAL;
  376. }
  377. err = cn_add_callback(&dev->id, "connector", &cn_callback);
  378. if (err) {
  379. cn_queue_free_dev(dev->cbdev);
  380. if (dev->nls->sk_socket)
  381. sock_release(dev->nls->sk_socket);
  382. return -EINVAL;
  383. }
  384. cn_already_initialized = 1;
  385. return 0;
  386. }
  387. static void __exit cn_fini(void)
  388. {
  389. struct cn_dev *dev = &cdev;
  390. cn_already_initialized = 0;
  391. cn_del_callback(&dev->id);
  392. cn_queue_free_dev(dev->cbdev);
  393. if (dev->nls->sk_socket)
  394. sock_release(dev->nls->sk_socket);
  395. }
  396. module_init(cn_init);
  397. module_exit(cn_fini);
  398. EXPORT_SYMBOL_GPL(cn_add_callback);
  399. EXPORT_SYMBOL_GPL(cn_del_callback);
  400. EXPORT_SYMBOL_GPL(cn_netlink_send);