cn_queue.c 4.2 KB

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