connector.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486
  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, int gfp_mask)
  64. {
  65. struct cn_callback_entry *__cbq;
  66. unsigned int size;
  67. struct sk_buff *skb;
  68. struct nlmsghdr *nlh;
  69. struct cn_msg *data;
  70. struct cn_dev *dev = &cdev;
  71. u32 group = 0;
  72. int found = 0;
  73. if (!__group) {
  74. spin_lock_bh(&dev->cbdev->queue_lock);
  75. list_for_each_entry(__cbq, &dev->cbdev->queue_list,
  76. callback_entry) {
  77. if (cn_cb_equal(&__cbq->cb->id, &msg->id)) {
  78. found = 1;
  79. group = __cbq->group;
  80. }
  81. }
  82. spin_unlock_bh(&dev->cbdev->queue_lock);
  83. if (!found)
  84. return -ENODEV;
  85. } else {
  86. group = __group;
  87. }
  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. netlink_broadcast(dev->nls, skb, 0, group, gfp_mask);
  97. return 0;
  98. nlmsg_failure:
  99. kfree_skb(skb);
  100. return -EINVAL;
  101. }
  102. /*
  103. * Callback helper - queues work and setup destructor for given data.
  104. */
  105. static int cn_call_callback(struct cn_msg *msg, void (*destruct_data)(void *), void *data)
  106. {
  107. struct cn_callback_entry *__cbq;
  108. struct cn_dev *dev = &cdev;
  109. int found = 0;
  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->cb->id, &msg->id)) {
  113. /*
  114. * Let's scream if there is some magic and the
  115. * data will arrive asynchronously here.
  116. * [i.e. netlink messages will be queued].
  117. * After the first warning I will fix it
  118. * quickly, but now I think it is
  119. * impossible. --zbr (2004_04_27).
  120. */
  121. if (likely(!test_bit(0, &__cbq->work.pending) &&
  122. __cbq->ddata == NULL)) {
  123. __cbq->cb->priv = msg;
  124. __cbq->ddata = data;
  125. __cbq->destruct_data = destruct_data;
  126. if (queue_work(dev->cbdev->cn_queue,
  127. &__cbq->work))
  128. found = 1;
  129. } else {
  130. printk("%s: cbq->data=%p, "
  131. "work->pending=%08lx.\n",
  132. __func__, __cbq->ddata,
  133. __cbq->work.pending);
  134. WARN_ON(1);
  135. }
  136. break;
  137. }
  138. }
  139. spin_unlock_bh(&dev->cbdev->queue_lock);
  140. return found ? 0 : -ENODEV;
  141. }
  142. /*
  143. * Skb receive helper - checks skb and msg size and calls callback
  144. * helper.
  145. */
  146. static int __cn_rx_skb(struct sk_buff *skb, struct nlmsghdr *nlh)
  147. {
  148. u32 pid, uid, seq, group;
  149. struct cn_msg *msg;
  150. pid = NETLINK_CREDS(skb)->pid;
  151. uid = NETLINK_CREDS(skb)->uid;
  152. seq = nlh->nlmsg_seq;
  153. group = NETLINK_CB((skb)).dst_group;
  154. msg = NLMSG_DATA(nlh);
  155. return cn_call_callback(msg, (void (*)(void *))kfree_skb, skb);
  156. }
  157. /*
  158. * Main netlink receiving function.
  159. *
  160. * It checks skb and netlink header sizes and calls the skb receive
  161. * helper with a shared skb.
  162. */
  163. static void cn_rx_skb(struct sk_buff *__skb)
  164. {
  165. struct nlmsghdr *nlh;
  166. u32 len;
  167. int err;
  168. struct sk_buff *skb;
  169. skb = skb_get(__skb);
  170. if (skb->len >= NLMSG_SPACE(0)) {
  171. nlh = (struct nlmsghdr *)skb->data;
  172. if (nlh->nlmsg_len < sizeof(struct cn_msg) ||
  173. skb->len < nlh->nlmsg_len ||
  174. nlh->nlmsg_len > CONNECTOR_MAX_MSG_SIZE) {
  175. kfree_skb(skb);
  176. goto out;
  177. }
  178. len = NLMSG_ALIGN(nlh->nlmsg_len);
  179. if (len > skb->len)
  180. len = skb->len;
  181. err = __cn_rx_skb(skb, nlh);
  182. if (err < 0)
  183. kfree_skb(skb);
  184. }
  185. out:
  186. kfree_skb(__skb);
  187. }
  188. /*
  189. * Netlink socket input callback - dequeues the skbs and calls the
  190. * main netlink receiving function.
  191. */
  192. static void cn_input(struct sock *sk, int len)
  193. {
  194. struct sk_buff *skb;
  195. while ((skb = skb_dequeue(&sk->sk_receive_queue)) != NULL)
  196. cn_rx_skb(skb);
  197. }
  198. /*
  199. * Notification routing.
  200. *
  201. * Gets id and checks if there are notification request for it's idx
  202. * and val. If there are such requests notify the listeners with the
  203. * given notify event.
  204. *
  205. */
  206. static void cn_notify(struct cb_id *id, u32 notify_event)
  207. {
  208. struct cn_ctl_entry *ent;
  209. down(&notify_lock);
  210. list_for_each_entry(ent, &notify_list, notify_entry) {
  211. int i;
  212. struct cn_notify_req *req;
  213. struct cn_ctl_msg *ctl = ent->msg;
  214. int idx_found, val_found;
  215. idx_found = val_found = 0;
  216. req = (struct cn_notify_req *)ctl->data;
  217. for (i = 0; i < ctl->idx_notify_num; ++i, ++req) {
  218. if (id->idx >= req->first &&
  219. id->idx < req->first + req->range) {
  220. idx_found = 1;
  221. break;
  222. }
  223. }
  224. for (i = 0; i < ctl->val_notify_num; ++i, ++req) {
  225. if (id->val >= req->first &&
  226. id->val < req->first + req->range) {
  227. val_found = 1;
  228. break;
  229. }
  230. }
  231. if (idx_found && val_found) {
  232. struct cn_msg m = { .ack = notify_event, };
  233. memcpy(&m.id, id, sizeof(m.id));
  234. cn_netlink_send(&m, ctl->group, GFP_KERNEL);
  235. }
  236. }
  237. up(&notify_lock);
  238. }
  239. /*
  240. * Callback add routing - adds callback with given ID and name.
  241. * If there is registered callback with the same ID it will not be added.
  242. *
  243. * May sleep.
  244. */
  245. int cn_add_callback(struct cb_id *id, char *name, void (*callback)(void *))
  246. {
  247. int err;
  248. struct cn_dev *dev = &cdev;
  249. struct cn_callback *cb;
  250. cb = kzalloc(sizeof(*cb), GFP_KERNEL);
  251. if (!cb)
  252. return -ENOMEM;
  253. scnprintf(cb->name, sizeof(cb->name), "%s", name);
  254. memcpy(&cb->id, id, sizeof(cb->id));
  255. cb->callback = callback;
  256. err = cn_queue_add_callback(dev->cbdev, cb);
  257. if (err) {
  258. kfree(cb);
  259. return err;
  260. }
  261. cn_notify(id, 0);
  262. return 0;
  263. }
  264. /*
  265. * Callback remove routing - removes callback
  266. * with given ID.
  267. * If there is no registered callback with given
  268. * ID nothing happens.
  269. *
  270. * May sleep while waiting for reference counter to become zero.
  271. */
  272. void cn_del_callback(struct cb_id *id)
  273. {
  274. struct cn_dev *dev = &cdev;
  275. cn_queue_del_callback(dev->cbdev, id);
  276. cn_notify(id, 1);
  277. }
  278. /*
  279. * Checks two connector's control messages to be the same.
  280. * Returns 1 if they are the same or if the first one is corrupted.
  281. */
  282. static int cn_ctl_msg_equals(struct cn_ctl_msg *m1, struct cn_ctl_msg *m2)
  283. {
  284. int i;
  285. struct cn_notify_req *req1, *req2;
  286. if (m1->idx_notify_num != m2->idx_notify_num)
  287. return 0;
  288. if (m1->val_notify_num != m2->val_notify_num)
  289. return 0;
  290. if (m1->len != m2->len)
  291. return 0;
  292. if ((m1->idx_notify_num + m1->val_notify_num) * sizeof(*req1) !=
  293. m1->len)
  294. return 1;
  295. req1 = (struct cn_notify_req *)m1->data;
  296. req2 = (struct cn_notify_req *)m2->data;
  297. for (i = 0; i < m1->idx_notify_num; ++i) {
  298. if (req1->first != req2->first || req1->range != req2->range)
  299. return 0;
  300. req1++;
  301. req2++;
  302. }
  303. for (i = 0; i < m1->val_notify_num; ++i) {
  304. if (req1->first != req2->first || req1->range != req2->range)
  305. return 0;
  306. req1++;
  307. req2++;
  308. }
  309. return 1;
  310. }
  311. /*
  312. * Main connector device's callback.
  313. *
  314. * Used for notification of a request's processing.
  315. */
  316. static void cn_callback(void *data)
  317. {
  318. struct cn_msg *msg = data;
  319. struct cn_ctl_msg *ctl;
  320. struct cn_ctl_entry *ent;
  321. u32 size;
  322. if (msg->len < sizeof(*ctl))
  323. return;
  324. ctl = (struct cn_ctl_msg *)msg->data;
  325. size = (sizeof(*ctl) + ((ctl->idx_notify_num +
  326. ctl->val_notify_num) *
  327. sizeof(struct cn_notify_req)));
  328. if (msg->len != size)
  329. return;
  330. if (ctl->len + sizeof(*ctl) != msg->len)
  331. return;
  332. /*
  333. * Remove notification.
  334. */
  335. if (ctl->group == 0) {
  336. struct cn_ctl_entry *n;
  337. down(&notify_lock);
  338. list_for_each_entry_safe(ent, n, &notify_list, notify_entry) {
  339. if (cn_ctl_msg_equals(ent->msg, ctl)) {
  340. list_del(&ent->notify_entry);
  341. kfree(ent);
  342. }
  343. }
  344. up(&notify_lock);
  345. return;
  346. }
  347. size += sizeof(*ent);
  348. ent = kzalloc(size, GFP_KERNEL);
  349. if (!ent)
  350. return;
  351. ent->msg = (struct cn_ctl_msg *)(ent + 1);
  352. memcpy(ent->msg, ctl, size - sizeof(*ent));
  353. down(&notify_lock);
  354. list_add(&ent->notify_entry, &notify_list);
  355. up(&notify_lock);
  356. }
  357. static int __init cn_init(void)
  358. {
  359. struct cn_dev *dev = &cdev;
  360. int err;
  361. dev->input = cn_input;
  362. dev->id.idx = cn_idx;
  363. dev->id.val = cn_val;
  364. dev->nls = netlink_kernel_create(NETLINK_CONNECTOR,
  365. CN_NETLINK_USERS + 0xf,
  366. dev->input, THIS_MODULE);
  367. if (!dev->nls)
  368. return -EIO;
  369. dev->cbdev = cn_queue_alloc_dev("cqueue", dev->nls);
  370. if (!dev->cbdev) {
  371. if (dev->nls->sk_socket)
  372. sock_release(dev->nls->sk_socket);
  373. return -EINVAL;
  374. }
  375. err = cn_add_callback(&dev->id, "connector", &cn_callback);
  376. if (err) {
  377. cn_queue_free_dev(dev->cbdev);
  378. if (dev->nls->sk_socket)
  379. sock_release(dev->nls->sk_socket);
  380. return -EINVAL;
  381. }
  382. cn_already_initialized = 1;
  383. return 0;
  384. }
  385. static void __exit cn_fini(void)
  386. {
  387. struct cn_dev *dev = &cdev;
  388. cn_already_initialized = 0;
  389. cn_del_callback(&dev->id);
  390. cn_queue_free_dev(dev->cbdev);
  391. if (dev->nls->sk_socket)
  392. sock_release(dev->nls->sk_socket);
  393. }
  394. module_init(cn_init);
  395. module_exit(cn_fini);
  396. EXPORT_SYMBOL_GPL(cn_add_callback);
  397. EXPORT_SYMBOL_GPL(cn_del_callback);
  398. EXPORT_SYMBOL_GPL(cn_netlink_send);