cn_queue.c 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173
  1. /*
  2. * cn_queue.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. */
  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 void cn_queue_wrapper(void *data)
  33. {
  34. struct cn_callback_entry *cbq = data;
  35. cbq->cb->callback(cbq->cb->priv);
  36. cbq->destruct_data(cbq->ddata);
  37. cbq->ddata = NULL;
  38. }
  39. static struct cn_callback_entry *cn_queue_alloc_callback_entry(struct cn_callback *cb)
  40. {
  41. struct cn_callback_entry *cbq;
  42. cbq = kzalloc(sizeof(*cbq), GFP_KERNEL);
  43. if (!cbq) {
  44. printk(KERN_ERR "Failed to create new callback queue.\n");
  45. return NULL;
  46. }
  47. cbq->cb = cb;
  48. INIT_WORK(&cbq->work, &cn_queue_wrapper, cbq);
  49. return cbq;
  50. }
  51. static void cn_queue_free_callback(struct cn_callback_entry *cbq)
  52. {
  53. cancel_delayed_work(&cbq->work);
  54. flush_workqueue(cbq->pdev->cn_queue);
  55. kfree(cbq);
  56. }
  57. int cn_cb_equal(struct cb_id *i1, struct cb_id *i2)
  58. {
  59. return ((i1->idx == i2->idx) && (i1->val == i2->val));
  60. }
  61. int cn_queue_add_callback(struct cn_queue_dev *dev, struct cn_callback *cb)
  62. {
  63. struct cn_callback_entry *cbq, *__cbq;
  64. int found = 0;
  65. cbq = cn_queue_alloc_callback_entry(cb);
  66. if (!cbq)
  67. return -ENOMEM;
  68. atomic_inc(&dev->refcnt);
  69. cbq->pdev = dev;
  70. spin_lock_bh(&dev->queue_lock);
  71. list_for_each_entry(__cbq, &dev->queue_list, callback_entry) {
  72. if (cn_cb_equal(&__cbq->cb->id, &cb->id)) {
  73. found = 1;
  74. break;
  75. }
  76. }
  77. if (!found)
  78. list_add_tail(&cbq->callback_entry, &dev->queue_list);
  79. spin_unlock_bh(&dev->queue_lock);
  80. if (found) {
  81. atomic_dec(&dev->refcnt);
  82. cn_queue_free_callback(cbq);
  83. return -EINVAL;
  84. }
  85. cbq->nls = dev->nls;
  86. cbq->seq = 0;
  87. cbq->group = cbq->cb->id.idx;
  88. return 0;
  89. }
  90. void cn_queue_del_callback(struct cn_queue_dev *dev, struct cb_id *id)
  91. {
  92. struct cn_callback_entry *cbq, *n;
  93. int found = 0;
  94. spin_lock_bh(&dev->queue_lock);
  95. list_for_each_entry_safe(cbq, n, &dev->queue_list, callback_entry) {
  96. if (cn_cb_equal(&cbq->cb->id, id)) {
  97. list_del(&cbq->callback_entry);
  98. found = 1;
  99. break;
  100. }
  101. }
  102. spin_unlock_bh(&dev->queue_lock);
  103. if (found) {
  104. cn_queue_free_callback(cbq);
  105. atomic_dec_and_test(&dev->refcnt);
  106. }
  107. }
  108. struct cn_queue_dev *cn_queue_alloc_dev(char *name, struct sock *nls)
  109. {
  110. struct cn_queue_dev *dev;
  111. dev = kzalloc(sizeof(*dev), GFP_KERNEL);
  112. if (!dev)
  113. return NULL;
  114. snprintf(dev->name, sizeof(dev->name), "%s", name);
  115. atomic_set(&dev->refcnt, 0);
  116. INIT_LIST_HEAD(&dev->queue_list);
  117. spin_lock_init(&dev->queue_lock);
  118. dev->nls = nls;
  119. dev->netlink_groups = 0;
  120. dev->cn_queue = create_workqueue(dev->name);
  121. if (!dev->cn_queue) {
  122. kfree(dev);
  123. return NULL;
  124. }
  125. return dev;
  126. }
  127. void cn_queue_free_dev(struct cn_queue_dev *dev)
  128. {
  129. struct cn_callback_entry *cbq, *n;
  130. flush_workqueue(dev->cn_queue);
  131. destroy_workqueue(dev->cn_queue);
  132. spin_lock_bh(&dev->queue_lock);
  133. list_for_each_entry_safe(cbq, n, &dev->queue_list, callback_entry)
  134. list_del(&cbq->callback_entry);
  135. spin_unlock_bh(&dev->queue_lock);
  136. while (atomic_read(&dev->refcnt)) {
  137. printk(KERN_INFO "Waiting for %s to become free: refcnt=%d.\n",
  138. dev->name, atomic_read(&dev->refcnt));
  139. msleep(1000);
  140. }
  141. kfree(dev);
  142. dev = NULL;
  143. }