cn_queue.c 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160
  1. /*
  2. * cn_queue.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. */
  22. #include <linux/kernel.h>
  23. #include <linux/module.h>
  24. #include <linux/list.h>
  25. #include <linux/workqueue.h>
  26. #include <linux/spinlock.h>
  27. #include <linux/slab.h>
  28. #include <linux/skbuff.h>
  29. #include <linux/suspend.h>
  30. #include <linux/connector.h>
  31. #include <linux/delay.h>
  32. static struct cn_callback_entry *
  33. cn_queue_alloc_callback_entry(struct cn_queue_dev *dev, const char *name,
  34. struct cb_id *id,
  35. void (*callback)(struct cn_msg *, struct netlink_skb_parms *))
  36. {
  37. struct cn_callback_entry *cbq;
  38. cbq = kzalloc(sizeof(*cbq), GFP_KERNEL);
  39. if (!cbq) {
  40. printk(KERN_ERR "Failed to create new callback queue.\n");
  41. return NULL;
  42. }
  43. atomic_set(&cbq->refcnt, 1);
  44. atomic_inc(&dev->refcnt);
  45. cbq->pdev = dev;
  46. snprintf(cbq->id.name, sizeof(cbq->id.name), "%s", name);
  47. memcpy(&cbq->id.id, id, sizeof(struct cb_id));
  48. cbq->callback = callback;
  49. return cbq;
  50. }
  51. void cn_queue_release_callback(struct cn_callback_entry *cbq)
  52. {
  53. if (!atomic_dec_and_test(&cbq->refcnt))
  54. return;
  55. atomic_dec(&cbq->pdev->refcnt);
  56. kfree(cbq);
  57. }
  58. int cn_cb_equal(struct cb_id *i1, struct cb_id *i2)
  59. {
  60. return ((i1->idx == i2->idx) && (i1->val == i2->val));
  61. }
  62. int cn_queue_add_callback(struct cn_queue_dev *dev, const char *name,
  63. struct cb_id *id,
  64. void (*callback)(struct cn_msg *, struct netlink_skb_parms *))
  65. {
  66. struct cn_callback_entry *cbq, *__cbq;
  67. int found = 0;
  68. cbq = cn_queue_alloc_callback_entry(dev, name, id, callback);
  69. if (!cbq)
  70. return -ENOMEM;
  71. spin_lock_bh(&dev->queue_lock);
  72. list_for_each_entry(__cbq, &dev->queue_list, callback_entry) {
  73. if (cn_cb_equal(&__cbq->id.id, id)) {
  74. found = 1;
  75. break;
  76. }
  77. }
  78. if (!found)
  79. list_add_tail(&cbq->callback_entry, &dev->queue_list);
  80. spin_unlock_bh(&dev->queue_lock);
  81. if (found) {
  82. cn_queue_release_callback(cbq);
  83. return -EINVAL;
  84. }
  85. cbq->seq = 0;
  86. cbq->group = cbq->id.id.idx;
  87. return 0;
  88. }
  89. void cn_queue_del_callback(struct cn_queue_dev *dev, struct cb_id *id)
  90. {
  91. struct cn_callback_entry *cbq, *n;
  92. int found = 0;
  93. spin_lock_bh(&dev->queue_lock);
  94. list_for_each_entry_safe(cbq, n, &dev->queue_list, callback_entry) {
  95. if (cn_cb_equal(&cbq->id.id, id)) {
  96. list_del(&cbq->callback_entry);
  97. found = 1;
  98. break;
  99. }
  100. }
  101. spin_unlock_bh(&dev->queue_lock);
  102. if (found)
  103. cn_queue_release_callback(cbq);
  104. }
  105. struct cn_queue_dev *cn_queue_alloc_dev(const char *name, struct sock *nls)
  106. {
  107. struct cn_queue_dev *dev;
  108. dev = kzalloc(sizeof(*dev), GFP_KERNEL);
  109. if (!dev)
  110. return NULL;
  111. snprintf(dev->name, sizeof(dev->name), "%s", name);
  112. atomic_set(&dev->refcnt, 0);
  113. INIT_LIST_HEAD(&dev->queue_list);
  114. spin_lock_init(&dev->queue_lock);
  115. dev->nls = nls;
  116. return dev;
  117. }
  118. void cn_queue_free_dev(struct cn_queue_dev *dev)
  119. {
  120. struct cn_callback_entry *cbq, *n;
  121. spin_lock_bh(&dev->queue_lock);
  122. list_for_each_entry_safe(cbq, n, &dev->queue_list, callback_entry)
  123. list_del(&cbq->callback_entry);
  124. spin_unlock_bh(&dev->queue_lock);
  125. while (atomic_read(&dev->refcnt)) {
  126. printk(KERN_INFO "Waiting for %s to become free: refcnt=%d.\n",
  127. dev->name, atomic_read(&dev->refcnt));
  128. msleep(1000);
  129. }
  130. kfree(dev);
  131. dev = NULL;
  132. }