rt2x00queue.c 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304
  1. /*
  2. Copyright (C) 2004 - 2008 rt2x00 SourceForge Project
  3. <http://rt2x00.serialmonkey.com>
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 2 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the
  14. Free Software Foundation, Inc.,
  15. 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  16. */
  17. /*
  18. Module: rt2x00lib
  19. Abstract: rt2x00 queue specific routines.
  20. */
  21. #include <linux/kernel.h>
  22. #include <linux/module.h>
  23. #include "rt2x00.h"
  24. #include "rt2x00lib.h"
  25. struct data_queue *rt2x00queue_get_queue(struct rt2x00_dev *rt2x00dev,
  26. const unsigned int queue)
  27. {
  28. int atim = test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags);
  29. if (queue < rt2x00dev->hw->queues && rt2x00dev->tx)
  30. return &rt2x00dev->tx[queue];
  31. if (!rt2x00dev->bcn)
  32. return NULL;
  33. if (queue == RT2X00_BCN_QUEUE_BEACON)
  34. return &rt2x00dev->bcn[0];
  35. else if (queue == RT2X00_BCN_QUEUE_ATIM && atim)
  36. return &rt2x00dev->bcn[1];
  37. return NULL;
  38. }
  39. EXPORT_SYMBOL_GPL(rt2x00queue_get_queue);
  40. struct queue_entry *rt2x00queue_get_entry(struct data_queue *queue,
  41. enum queue_index index)
  42. {
  43. struct queue_entry *entry;
  44. unsigned long irqflags;
  45. if (unlikely(index >= Q_INDEX_MAX)) {
  46. ERROR(queue->rt2x00dev,
  47. "Entry requested from invalid index type (%d)\n", index);
  48. return NULL;
  49. }
  50. spin_lock_irqsave(&queue->lock, irqflags);
  51. entry = &queue->entries[queue->index[index]];
  52. spin_unlock_irqrestore(&queue->lock, irqflags);
  53. return entry;
  54. }
  55. EXPORT_SYMBOL_GPL(rt2x00queue_get_entry);
  56. void rt2x00queue_index_inc(struct data_queue *queue, enum queue_index index)
  57. {
  58. unsigned long irqflags;
  59. if (unlikely(index >= Q_INDEX_MAX)) {
  60. ERROR(queue->rt2x00dev,
  61. "Index change on invalid index type (%d)\n", index);
  62. return;
  63. }
  64. spin_lock_irqsave(&queue->lock, irqflags);
  65. queue->index[index]++;
  66. if (queue->index[index] >= queue->limit)
  67. queue->index[index] = 0;
  68. if (index == Q_INDEX) {
  69. queue->length++;
  70. } else if (index == Q_INDEX_DONE) {
  71. queue->length--;
  72. queue->count ++;
  73. }
  74. spin_unlock_irqrestore(&queue->lock, irqflags);
  75. }
  76. EXPORT_SYMBOL_GPL(rt2x00queue_index_inc);
  77. static void rt2x00queue_reset(struct data_queue *queue)
  78. {
  79. unsigned long irqflags;
  80. spin_lock_irqsave(&queue->lock, irqflags);
  81. queue->count = 0;
  82. queue->length = 0;
  83. memset(queue->index, 0, sizeof(queue->index));
  84. spin_unlock_irqrestore(&queue->lock, irqflags);
  85. }
  86. void rt2x00queue_init_rx(struct rt2x00_dev *rt2x00dev)
  87. {
  88. struct data_queue *queue = rt2x00dev->rx;
  89. unsigned int i;
  90. rt2x00queue_reset(queue);
  91. if (!rt2x00dev->ops->lib->init_rxentry)
  92. return;
  93. for (i = 0; i < queue->limit; i++)
  94. rt2x00dev->ops->lib->init_rxentry(rt2x00dev,
  95. &queue->entries[i]);
  96. }
  97. void rt2x00queue_init_tx(struct rt2x00_dev *rt2x00dev)
  98. {
  99. struct data_queue *queue;
  100. unsigned int i;
  101. txall_queue_for_each(rt2x00dev, queue) {
  102. rt2x00queue_reset(queue);
  103. if (!rt2x00dev->ops->lib->init_txentry)
  104. continue;
  105. for (i = 0; i < queue->limit; i++)
  106. rt2x00dev->ops->lib->init_txentry(rt2x00dev,
  107. &queue->entries[i]);
  108. }
  109. }
  110. static int rt2x00queue_alloc_entries(struct data_queue *queue,
  111. const struct data_queue_desc *qdesc)
  112. {
  113. struct queue_entry *entries;
  114. unsigned int entry_size;
  115. unsigned int i;
  116. rt2x00queue_reset(queue);
  117. queue->limit = qdesc->entry_num;
  118. queue->data_size = qdesc->data_size;
  119. queue->desc_size = qdesc->desc_size;
  120. /*
  121. * Allocate all queue entries.
  122. */
  123. entry_size = sizeof(*entries) + qdesc->priv_size;
  124. entries = kzalloc(queue->limit * entry_size, GFP_KERNEL);
  125. if (!entries)
  126. return -ENOMEM;
  127. #define QUEUE_ENTRY_PRIV_OFFSET(__base, __index, __limit, __esize, __psize) \
  128. ( ((char *)(__base)) + ((__limit) * (__esize)) + \
  129. ((__index) * (__psize)) )
  130. for (i = 0; i < queue->limit; i++) {
  131. entries[i].flags = 0;
  132. entries[i].queue = queue;
  133. entries[i].skb = NULL;
  134. entries[i].entry_idx = i;
  135. entries[i].priv_data =
  136. QUEUE_ENTRY_PRIV_OFFSET(entries, i, queue->limit,
  137. sizeof(*entries), qdesc->priv_size);
  138. }
  139. #undef QUEUE_ENTRY_PRIV_OFFSET
  140. queue->entries = entries;
  141. return 0;
  142. }
  143. int rt2x00queue_initialize(struct rt2x00_dev *rt2x00dev)
  144. {
  145. struct data_queue *queue;
  146. int status;
  147. status = rt2x00queue_alloc_entries(rt2x00dev->rx, rt2x00dev->ops->rx);
  148. if (status)
  149. goto exit;
  150. tx_queue_for_each(rt2x00dev, queue) {
  151. status = rt2x00queue_alloc_entries(queue, rt2x00dev->ops->tx);
  152. if (status)
  153. goto exit;
  154. }
  155. status = rt2x00queue_alloc_entries(rt2x00dev->bcn, rt2x00dev->ops->bcn);
  156. if (status)
  157. goto exit;
  158. if (!test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags))
  159. return 0;
  160. status = rt2x00queue_alloc_entries(&rt2x00dev->bcn[1],
  161. rt2x00dev->ops->atim);
  162. if (status)
  163. goto exit;
  164. return 0;
  165. exit:
  166. ERROR(rt2x00dev, "Queue entries allocation failed.\n");
  167. rt2x00queue_uninitialize(rt2x00dev);
  168. return status;
  169. }
  170. void rt2x00queue_uninitialize(struct rt2x00_dev *rt2x00dev)
  171. {
  172. struct data_queue *queue;
  173. queue_for_each(rt2x00dev, queue) {
  174. kfree(queue->entries);
  175. queue->entries = NULL;
  176. }
  177. }
  178. static void rt2x00queue_init(struct rt2x00_dev *rt2x00dev,
  179. struct data_queue *queue, enum data_queue_qid qid)
  180. {
  181. spin_lock_init(&queue->lock);
  182. queue->rt2x00dev = rt2x00dev;
  183. queue->qid = qid;
  184. queue->aifs = 2;
  185. queue->cw_min = 5;
  186. queue->cw_max = 10;
  187. }
  188. int rt2x00queue_allocate(struct rt2x00_dev *rt2x00dev)
  189. {
  190. struct data_queue *queue;
  191. enum data_queue_qid qid;
  192. unsigned int req_atim =
  193. !!test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags);
  194. /*
  195. * We need the following queues:
  196. * RX: 1
  197. * TX: hw->queues
  198. * Beacon: 1
  199. * Atim: 1 (if required)
  200. */
  201. rt2x00dev->data_queues = 2 + rt2x00dev->hw->queues + req_atim;
  202. queue = kzalloc(rt2x00dev->data_queues * sizeof(*queue), GFP_KERNEL);
  203. if (!queue) {
  204. ERROR(rt2x00dev, "Queue allocation failed.\n");
  205. return -ENOMEM;
  206. }
  207. /*
  208. * Initialize pointers
  209. */
  210. rt2x00dev->rx = queue;
  211. rt2x00dev->tx = &queue[1];
  212. rt2x00dev->bcn = &queue[1 + rt2x00dev->hw->queues];
  213. /*
  214. * Initialize queue parameters.
  215. * RX: qid = QID_RX
  216. * TX: qid = QID_AC_BE + index
  217. * TX: cw_min: 2^5 = 32.
  218. * TX: cw_max: 2^10 = 1024.
  219. * BCN & Atim: qid = QID_MGMT
  220. */
  221. rt2x00queue_init(rt2x00dev, rt2x00dev->rx, QID_RX);
  222. qid = QID_AC_BE;
  223. tx_queue_for_each(rt2x00dev, queue)
  224. rt2x00queue_init(rt2x00dev, queue, qid++);
  225. rt2x00queue_init(rt2x00dev, &rt2x00dev->bcn[0], QID_MGMT);
  226. if (req_atim)
  227. rt2x00queue_init(rt2x00dev, &rt2x00dev->bcn[1], QID_MGMT);
  228. return 0;
  229. }
  230. void rt2x00queue_free(struct rt2x00_dev *rt2x00dev)
  231. {
  232. kfree(rt2x00dev->rx);
  233. rt2x00dev->rx = NULL;
  234. rt2x00dev->tx = NULL;
  235. rt2x00dev->bcn = NULL;
  236. }