connector.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493
  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;
  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(!test_bit(0, &__cbq->work.pending) &&
  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 work_struct *w;
  126. struct cn_callback_data *d;
  127. w = kzalloc(sizeof(*w) + sizeof(*d), GFP_ATOMIC);
  128. if (w) {
  129. d = (struct cn_callback_data *)(w+1);
  130. d->callback_priv = msg;
  131. d->callback = __cbq->data.callback;
  132. d->ddata = data;
  133. d->destruct_data = destruct_data;
  134. d->free = w;
  135. INIT_LIST_HEAD(&w->entry);
  136. w->pending = 0;
  137. w->func = &cn_queue_wrapper;
  138. w->data = d;
  139. init_timer(&w->timer);
  140. if (queue_work(dev->cbdev->cn_queue, w))
  141. err = 0;
  142. else {
  143. kfree(w);
  144. err = -EINVAL;
  145. }
  146. } else
  147. err = -ENOMEM;
  148. }
  149. break;
  150. }
  151. }
  152. spin_unlock_bh(&dev->cbdev->queue_lock);
  153. return err;
  154. }
  155. /*
  156. * Skb receive helper - checks skb and msg size and calls callback
  157. * helper.
  158. */
  159. static int __cn_rx_skb(struct sk_buff *skb, struct nlmsghdr *nlh)
  160. {
  161. u32 pid, uid, seq, group;
  162. struct cn_msg *msg;
  163. pid = NETLINK_CREDS(skb)->pid;
  164. uid = NETLINK_CREDS(skb)->uid;
  165. seq = nlh->nlmsg_seq;
  166. group = NETLINK_CB((skb)).dst_group;
  167. msg = NLMSG_DATA(nlh);
  168. return cn_call_callback(msg, (void (*)(void *))kfree_skb, skb);
  169. }
  170. /*
  171. * Main netlink receiving function.
  172. *
  173. * It checks skb and netlink header sizes and calls the skb receive
  174. * helper with a shared skb.
  175. */
  176. static void cn_rx_skb(struct sk_buff *__skb)
  177. {
  178. struct nlmsghdr *nlh;
  179. u32 len;
  180. int err;
  181. struct sk_buff *skb;
  182. skb = skb_get(__skb);
  183. if (skb->len >= NLMSG_SPACE(0)) {
  184. nlh = (struct nlmsghdr *)skb->data;
  185. if (nlh->nlmsg_len < sizeof(struct cn_msg) ||
  186. skb->len < nlh->nlmsg_len ||
  187. nlh->nlmsg_len > CONNECTOR_MAX_MSG_SIZE) {
  188. kfree_skb(skb);
  189. goto out;
  190. }
  191. len = NLMSG_ALIGN(nlh->nlmsg_len);
  192. if (len > skb->len)
  193. len = skb->len;
  194. err = __cn_rx_skb(skb, nlh);
  195. if (err < 0)
  196. kfree_skb(skb);
  197. }
  198. out:
  199. kfree_skb(__skb);
  200. }
  201. /*
  202. * Netlink socket input callback - dequeues the skbs and calls the
  203. * main netlink receiving function.
  204. */
  205. static void cn_input(struct sock *sk, int len)
  206. {
  207. struct sk_buff *skb;
  208. while ((skb = skb_dequeue(&sk->sk_receive_queue)) != NULL)
  209. cn_rx_skb(skb);
  210. }
  211. /*
  212. * Notification routing.
  213. *
  214. * Gets id and checks if there are notification request for it's idx
  215. * and val. If there are such requests notify the listeners with the
  216. * given notify event.
  217. *
  218. */
  219. static void cn_notify(struct cb_id *id, u32 notify_event)
  220. {
  221. struct cn_ctl_entry *ent;
  222. mutex_lock(&notify_lock);
  223. list_for_each_entry(ent, &notify_list, notify_entry) {
  224. int i;
  225. struct cn_notify_req *req;
  226. struct cn_ctl_msg *ctl = ent->msg;
  227. int idx_found, val_found;
  228. idx_found = val_found = 0;
  229. req = (struct cn_notify_req *)ctl->data;
  230. for (i = 0; i < ctl->idx_notify_num; ++i, ++req) {
  231. if (id->idx >= req->first &&
  232. id->idx < req->first + req->range) {
  233. idx_found = 1;
  234. break;
  235. }
  236. }
  237. for (i = 0; i < ctl->val_notify_num; ++i, ++req) {
  238. if (id->val >= req->first &&
  239. id->val < req->first + req->range) {
  240. val_found = 1;
  241. break;
  242. }
  243. }
  244. if (idx_found && val_found) {
  245. struct cn_msg m = { .ack = notify_event, };
  246. memcpy(&m.id, id, sizeof(m.id));
  247. cn_netlink_send(&m, ctl->group, GFP_KERNEL);
  248. }
  249. }
  250. mutex_unlock(&notify_lock);
  251. }
  252. /*
  253. * Callback add routing - adds callback with given ID and name.
  254. * If there is registered callback with the same ID it will not be added.
  255. *
  256. * May sleep.
  257. */
  258. int cn_add_callback(struct cb_id *id, char *name, void (*callback)(void *))
  259. {
  260. int err;
  261. struct cn_dev *dev = &cdev;
  262. if (!cn_already_initialized)
  263. return -EAGAIN;
  264. err = cn_queue_add_callback(dev->cbdev, name, id, callback);
  265. if (err)
  266. return err;
  267. cn_notify(id, 0);
  268. return 0;
  269. }
  270. EXPORT_SYMBOL_GPL(cn_add_callback);
  271. /*
  272. * Callback remove routing - removes callback
  273. * with given ID.
  274. * If there is no registered callback with given
  275. * ID nothing happens.
  276. *
  277. * May sleep while waiting for reference counter to become zero.
  278. */
  279. void cn_del_callback(struct cb_id *id)
  280. {
  281. struct cn_dev *dev = &cdev;
  282. cn_queue_del_callback(dev->cbdev, id);
  283. cn_notify(id, 1);
  284. }
  285. EXPORT_SYMBOL_GPL(cn_del_callback);
  286. /*
  287. * Checks two connector's control messages to be the same.
  288. * Returns 1 if they are the same or if the first one is corrupted.
  289. */
  290. static int cn_ctl_msg_equals(struct cn_ctl_msg *m1, struct cn_ctl_msg *m2)
  291. {
  292. int i;
  293. struct cn_notify_req *req1, *req2;
  294. if (m1->idx_notify_num != m2->idx_notify_num)
  295. return 0;
  296. if (m1->val_notify_num != m2->val_notify_num)
  297. return 0;
  298. if (m1->len != m2->len)
  299. return 0;
  300. if ((m1->idx_notify_num + m1->val_notify_num) * sizeof(*req1) !=
  301. m1->len)
  302. return 1;
  303. req1 = (struct cn_notify_req *)m1->data;
  304. req2 = (struct cn_notify_req *)m2->data;
  305. for (i = 0; i < m1->idx_notify_num; ++i) {
  306. if (req1->first != req2->first || req1->range != req2->range)
  307. return 0;
  308. req1++;
  309. req2++;
  310. }
  311. for (i = 0; i < m1->val_notify_num; ++i) {
  312. if (req1->first != req2->first || req1->range != req2->range)
  313. return 0;
  314. req1++;
  315. req2++;
  316. }
  317. return 1;
  318. }
  319. /*
  320. * Main connector device's callback.
  321. *
  322. * Used for notification of a request's processing.
  323. */
  324. static void cn_callback(void *data)
  325. {
  326. struct cn_msg *msg = data;
  327. struct cn_ctl_msg *ctl;
  328. struct cn_ctl_entry *ent;
  329. u32 size;
  330. if (msg->len < sizeof(*ctl))
  331. return;
  332. ctl = (struct cn_ctl_msg *)msg->data;
  333. size = (sizeof(*ctl) + ((ctl->idx_notify_num +
  334. ctl->val_notify_num) *
  335. sizeof(struct cn_notify_req)));
  336. if (msg->len != size)
  337. return;
  338. if (ctl->len + sizeof(*ctl) != msg->len)
  339. return;
  340. /*
  341. * Remove notification.
  342. */
  343. if (ctl->group == 0) {
  344. struct cn_ctl_entry *n;
  345. mutex_lock(&notify_lock);
  346. list_for_each_entry_safe(ent, n, &notify_list, notify_entry) {
  347. if (cn_ctl_msg_equals(ent->msg, ctl)) {
  348. list_del(&ent->notify_entry);
  349. kfree(ent);
  350. }
  351. }
  352. mutex_unlock(&notify_lock);
  353. return;
  354. }
  355. size += sizeof(*ent);
  356. ent = kzalloc(size, GFP_KERNEL);
  357. if (!ent)
  358. return;
  359. ent->msg = (struct cn_ctl_msg *)(ent + 1);
  360. memcpy(ent->msg, ctl, size - sizeof(*ent));
  361. mutex_lock(&notify_lock);
  362. list_add(&ent->notify_entry, &notify_list);
  363. mutex_unlock(&notify_lock);
  364. }
  365. static int __devinit cn_init(void)
  366. {
  367. struct cn_dev *dev = &cdev;
  368. int err;
  369. dev->input = cn_input;
  370. dev->id.idx = cn_idx;
  371. dev->id.val = cn_val;
  372. dev->nls = netlink_kernel_create(NETLINK_CONNECTOR,
  373. CN_NETLINK_USERS + 0xf,
  374. dev->input, THIS_MODULE);
  375. if (!dev->nls)
  376. return -EIO;
  377. dev->cbdev = cn_queue_alloc_dev("cqueue", dev->nls);
  378. if (!dev->cbdev) {
  379. if (dev->nls->sk_socket)
  380. sock_release(dev->nls->sk_socket);
  381. return -EINVAL;
  382. }
  383. cn_already_initialized = 1;
  384. err = cn_add_callback(&dev->id, "connector", &cn_callback);
  385. if (err) {
  386. cn_already_initialized = 0;
  387. cn_queue_free_dev(dev->cbdev);
  388. if (dev->nls->sk_socket)
  389. sock_release(dev->nls->sk_socket);
  390. return -EINVAL;
  391. }
  392. return 0;
  393. }
  394. static void __devexit cn_fini(void)
  395. {
  396. struct cn_dev *dev = &cdev;
  397. cn_already_initialized = 0;
  398. cn_del_callback(&dev->id);
  399. cn_queue_free_dev(dev->cbdev);
  400. if (dev->nls->sk_socket)
  401. sock_release(dev->nls->sk_socket);
  402. }
  403. subsys_initcall(cn_init);
  404. module_exit(cn_fini);