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