connector.c 11 KB

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