rt2x00queue.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468
  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: rt2x00
  19. Abstract: rt2x00 queue datastructures and routines
  20. */
  21. #ifndef RT2X00QUEUE_H
  22. #define RT2X00QUEUE_H
  23. #include <linux/prefetch.h>
  24. /**
  25. * DOC: Entrie frame size
  26. *
  27. * Ralink PCI devices demand the Frame size to be a multiple of 128 bytes,
  28. * for USB devices this restriction does not apply, but the value of
  29. * 2432 makes sense since it is big enough to contain the maximum fragment
  30. * size according to the ieee802.11 specs.
  31. */
  32. #define DATA_FRAME_SIZE 2432
  33. #define MGMT_FRAME_SIZE 256
  34. /**
  35. * DOC: Number of entries per queue
  36. *
  37. * After research it was concluded that 12 entries in a RX and TX
  38. * queue would be sufficient. Although this is almost one third of
  39. * the amount the legacy driver allocated, the queues aren't getting
  40. * filled to the maximum even when working with the maximum rate.
  41. */
  42. #define RX_ENTRIES 12
  43. #define TX_ENTRIES 12
  44. #define BEACON_ENTRIES 1
  45. #define ATIM_ENTRIES 1
  46. /**
  47. * enum data_queue_qid: Queue identification
  48. */
  49. enum data_queue_qid {
  50. QID_AC_BE = 0,
  51. QID_AC_BK = 1,
  52. QID_AC_VI = 2,
  53. QID_AC_VO = 3,
  54. QID_HCCA = 4,
  55. QID_MGMT = 13,
  56. QID_RX = 14,
  57. QID_OTHER = 15,
  58. };
  59. /**
  60. * enum rt2x00_bcn_queue: Beacon queue index
  61. *
  62. * Start counting with a high offset, this because this enumeration
  63. * supplements &enum ieee80211_tx_queue and we should prevent value
  64. * conflicts.
  65. *
  66. * @RT2X00_BCN_QUEUE_BEACON: Beacon queue
  67. * @RT2X00_BCN_QUEUE_ATIM: Atim queue (sends frame after beacon)
  68. */
  69. enum rt2x00_bcn_queue {
  70. RT2X00_BCN_QUEUE_BEACON = 100,
  71. RT2X00_BCN_QUEUE_ATIM = 101,
  72. };
  73. /**
  74. * enum skb_frame_desc_flags: Flags for &struct skb_frame_desc
  75. *
  76. * @FRAME_DESC_DRIVER_GENERATED: Frame was generated inside driver
  77. * and should not be reported back to mac80211 during txdone.
  78. */
  79. enum skb_frame_desc_flags {
  80. FRAME_DESC_DRIVER_GENERATED = 1 << 0,
  81. };
  82. /**
  83. * struct skb_frame_desc: Descriptor information for the skb buffer
  84. *
  85. * This structure is placed over the skb->cb array, this means that
  86. * this structure should not exceed the size of that array (48 bytes).
  87. *
  88. * @flags: Frame flags, see &enum skb_frame_desc_flags.
  89. * @frame_type: Frame type, see &enum rt2x00_dump_type.
  90. * @data: Pointer to data part of frame (Start of ieee80211 header).
  91. * @desc: Pointer to descriptor part of the frame.
  92. * Note that this pointer could point to something outside
  93. * of the scope of the skb->data pointer.
  94. * @data_len: Length of the frame data.
  95. * @desc_len: Length of the frame descriptor.
  96. * @entry: The entry to which this sk buffer belongs.
  97. */
  98. struct skb_frame_desc {
  99. unsigned int flags;
  100. unsigned int frame_type;
  101. void *data;
  102. void *desc;
  103. unsigned int data_len;
  104. unsigned int desc_len;
  105. struct queue_entry *entry;
  106. };
  107. static inline struct skb_frame_desc* get_skb_frame_desc(struct sk_buff *skb)
  108. {
  109. BUILD_BUG_ON(sizeof(struct skb_frame_desc) > sizeof(skb->cb));
  110. return (struct skb_frame_desc *)&skb->cb[0];
  111. }
  112. /**
  113. * enum rxdone_entry_desc_flags: Flags for &struct rxdone_entry_desc
  114. *
  115. * @RXDONE_SIGNAL_PLCP: Does the signal field contain the plcp value,
  116. * or does it contain the bitrate itself.
  117. * @RXDONE_MY_BSS: Does this frame originate from device's BSS.
  118. */
  119. enum rxdone_entry_desc_flags {
  120. RXDONE_SIGNAL_PLCP = 1 << 0,
  121. RXDONE_MY_BSS = 1 << 1,
  122. };
  123. /**
  124. * struct rxdone_entry_desc: RX Entry descriptor
  125. *
  126. * Summary of information that has been read from the RX frame descriptor.
  127. *
  128. * @signal: Signal of the received frame.
  129. * @rssi: RSSI of the received frame.
  130. * @size: Data size of the received frame.
  131. * @flags: MAC80211 receive flags (See &enum mac80211_rx_flags).
  132. * @dev_flags: Ralink receive flags (See &enum rxdone_entry_desc_flags).
  133. */
  134. struct rxdone_entry_desc {
  135. int signal;
  136. int rssi;
  137. int size;
  138. int flags;
  139. int dev_flags;
  140. };
  141. /**
  142. * struct txdone_entry_desc: TX done entry descriptor
  143. *
  144. * Summary of information that has been read from the TX frame descriptor
  145. * after the device is done with transmission.
  146. *
  147. * @control: Control structure which was used to transmit the frame.
  148. * @status: TX status (See &enum tx_status).
  149. * @retry: Retry count.
  150. */
  151. struct txdone_entry_desc {
  152. struct ieee80211_tx_control *control;
  153. int status;
  154. int retry;
  155. };
  156. /**
  157. * enum txentry_desc_flags: Status flags for TX entry descriptor
  158. *
  159. * @ENTRY_TXD_RTS_FRAME: This frame is a RTS frame.
  160. * @ENTRY_TXD_OFDM_RATE: This frame is send out with an OFDM rate.
  161. * @ENTRY_TXD_MORE_FRAG: This frame is followed by another fragment.
  162. * @ENTRY_TXD_REQ_TIMESTAMP: Require timestamp to be inserted.
  163. * @ENTRY_TXD_BURST: This frame belongs to the same burst event.
  164. * @ENTRY_TXD_ACK: An ACK is required for this frame.
  165. */
  166. enum txentry_desc_flags {
  167. ENTRY_TXD_RTS_FRAME,
  168. ENTRY_TXD_OFDM_RATE,
  169. ENTRY_TXD_MORE_FRAG,
  170. ENTRY_TXD_REQ_TIMESTAMP,
  171. ENTRY_TXD_BURST,
  172. ENTRY_TXD_ACK,
  173. };
  174. /**
  175. * struct txentry_desc: TX Entry descriptor
  176. *
  177. * Summary of information for the frame descriptor before sending a TX frame.
  178. *
  179. * @flags: Descriptor flags (See &enum queue_entry_flags).
  180. * @queue: Queue identification (See &enum data_queue_qid).
  181. * @length_high: PLCP length high word.
  182. * @length_low: PLCP length low word.
  183. * @signal: PLCP signal.
  184. * @service: PLCP service.
  185. * @aifs: AIFS value.
  186. * @ifs: IFS value.
  187. * @cw_min: cwmin value.
  188. * @cw_max: cwmax value.
  189. */
  190. struct txentry_desc {
  191. unsigned long flags;
  192. enum data_queue_qid queue;
  193. u16 length_high;
  194. u16 length_low;
  195. u16 signal;
  196. u16 service;
  197. int aifs;
  198. int ifs;
  199. int cw_min;
  200. int cw_max;
  201. };
  202. /**
  203. * enum queue_entry_flags: Status flags for queue entry
  204. *
  205. * @ENTRY_BCN_ASSIGNED: This entry has been assigned to an interface.
  206. * As long as this bit is set, this entry may only be touched
  207. * through the interface structure.
  208. * @ENTRY_OWNER_DEVICE_DATA: This entry is owned by the device for data
  209. * transfer (either TX or RX depending on the queue). The entry should
  210. * only be touched after the device has signaled it is done with it.
  211. * @ENTRY_OWNER_DEVICE_CRYPTO: This entry is owned by the device for data
  212. * encryption or decryption. The entry should only be touched after
  213. * the device has signaled it is done with it.
  214. */
  215. enum queue_entry_flags {
  216. ENTRY_BCN_ASSIGNED,
  217. ENTRY_OWNER_DEVICE_DATA,
  218. ENTRY_OWNER_DEVICE_CRYPTO,
  219. };
  220. /**
  221. * struct queue_entry: Entry inside the &struct data_queue
  222. *
  223. * @flags: Entry flags, see &enum queue_entry_flags.
  224. * @queue: The data queue (&struct data_queue) to which this entry belongs.
  225. * @skb: The buffer which is currently being transmitted (for TX queue),
  226. * or used to directly recieve data in (for RX queue).
  227. * @entry_idx: The entry index number.
  228. * @priv_data: Private data belonging to this queue entry. The pointer
  229. * points to data specific to a particular driver and queue type.
  230. */
  231. struct queue_entry {
  232. unsigned long flags;
  233. struct data_queue *queue;
  234. struct sk_buff *skb;
  235. unsigned int entry_idx;
  236. void *priv_data;
  237. };
  238. /**
  239. * enum queue_index: Queue index type
  240. *
  241. * @Q_INDEX: Index pointer to the current entry in the queue, if this entry is
  242. * owned by the hardware then the queue is considered to be full.
  243. * @Q_INDEX_DONE: Index pointer to the next entry which will be completed by
  244. * the hardware and for which we need to run the txdone handler. If this
  245. * entry is not owned by the hardware the queue is considered to be empty.
  246. * @Q_INDEX_CRYPTO: Index pointer to the next entry which encryption/decription
  247. * will be completed by the hardware next.
  248. * @Q_INDEX_MAX: Keep last, used in &struct data_queue to determine the size
  249. * of the index array.
  250. */
  251. enum queue_index {
  252. Q_INDEX,
  253. Q_INDEX_DONE,
  254. Q_INDEX_CRYPTO,
  255. Q_INDEX_MAX,
  256. };
  257. /**
  258. * struct data_queue: Data queue
  259. *
  260. * @rt2x00dev: Pointer to main &struct rt2x00dev where this queue belongs to.
  261. * @entries: Base address of the &struct queue_entry which are
  262. * part of this queue.
  263. * @qid: The queue identification, see &enum data_queue_qid.
  264. * @lock: Spinlock to protect index handling. Whenever @index, @index_done or
  265. * @index_crypt needs to be changed this lock should be grabbed to prevent
  266. * index corruption due to concurrency.
  267. * @count: Number of frames handled in the queue.
  268. * @limit: Maximum number of entries in the queue.
  269. * @length: Number of frames in queue.
  270. * @index: Index pointers to entry positions in the queue,
  271. * use &enum queue_index to get a specific index field.
  272. * @aifs: The aifs value for outgoing frames (field ignored in RX queue).
  273. * @cw_min: The cw min value for outgoing frames (field ignored in RX queue).
  274. * @cw_max: The cw max value for outgoing frames (field ignored in RX queue).
  275. * @data_size: Maximum data size for the frames in this queue.
  276. * @desc_size: Hardware descriptor size for the data in this queue.
  277. */
  278. struct data_queue {
  279. struct rt2x00_dev *rt2x00dev;
  280. struct queue_entry *entries;
  281. enum data_queue_qid qid;
  282. spinlock_t lock;
  283. unsigned int count;
  284. unsigned short limit;
  285. unsigned short length;
  286. unsigned short index[Q_INDEX_MAX];
  287. unsigned short aifs;
  288. unsigned short cw_min;
  289. unsigned short cw_max;
  290. unsigned short data_size;
  291. unsigned short desc_size;
  292. };
  293. /**
  294. * struct data_queue_desc: Data queue description
  295. *
  296. * The information in this structure is used by drivers
  297. * to inform rt2x00lib about the creation of the data queue.
  298. *
  299. * @entry_num: Maximum number of entries for a queue.
  300. * @data_size: Maximum data size for the frames in this queue.
  301. * @desc_size: Hardware descriptor size for the data in this queue.
  302. * @priv_size: Size of per-queue_entry private data.
  303. */
  304. struct data_queue_desc {
  305. unsigned short entry_num;
  306. unsigned short data_size;
  307. unsigned short desc_size;
  308. unsigned short priv_size;
  309. };
  310. /**
  311. * queue_end - Return pointer to the last queue (HELPER MACRO).
  312. * @__dev: Pointer to &struct rt2x00_dev
  313. *
  314. * Using the base rx pointer and the maximum number of available queues,
  315. * this macro will return the address of 1 position beyond the end of the
  316. * queues array.
  317. */
  318. #define queue_end(__dev) \
  319. &(__dev)->rx[(__dev)->data_queues]
  320. /**
  321. * tx_queue_end - Return pointer to the last TX queue (HELPER MACRO).
  322. * @__dev: Pointer to &struct rt2x00_dev
  323. *
  324. * Using the base tx pointer and the maximum number of available TX
  325. * queues, this macro will return the address of 1 position beyond
  326. * the end of the TX queue array.
  327. */
  328. #define tx_queue_end(__dev) \
  329. &(__dev)->tx[(__dev)->hw->queues]
  330. /**
  331. * queue_loop - Loop through the queues within a specific range (HELPER MACRO).
  332. * @__entry: Pointer where the current queue entry will be stored in.
  333. * @__start: Start queue pointer.
  334. * @__end: End queue pointer.
  335. *
  336. * This macro will loop through all queues between &__start and &__end.
  337. */
  338. #define queue_loop(__entry, __start, __end) \
  339. for ((__entry) = (__start); \
  340. prefetch(&(__entry)[1]), (__entry) != (__end); \
  341. (__entry) = &(__entry)[1])
  342. /**
  343. * queue_for_each - Loop through all queues
  344. * @__dev: Pointer to &struct rt2x00_dev
  345. * @__entry: Pointer where the current queue entry will be stored in.
  346. *
  347. * This macro will loop through all available queues.
  348. */
  349. #define queue_for_each(__dev, __entry) \
  350. queue_loop(__entry, (__dev)->rx, queue_end(__dev))
  351. /**
  352. * tx_queue_for_each - Loop through the TX queues
  353. * @__dev: Pointer to &struct rt2x00_dev
  354. * @__entry: Pointer where the current queue entry will be stored in.
  355. *
  356. * This macro will loop through all TX related queues excluding
  357. * the Beacon and Atim queues.
  358. */
  359. #define tx_queue_for_each(__dev, __entry) \
  360. queue_loop(__entry, (__dev)->tx, tx_queue_end(__dev))
  361. /**
  362. * txall_queue_for_each - Loop through all TX related queues
  363. * @__dev: Pointer to &struct rt2x00_dev
  364. * @__entry: Pointer where the current queue entry will be stored in.
  365. *
  366. * This macro will loop through all TX related queues including
  367. * the Beacon and Atim queues.
  368. */
  369. #define txall_queue_for_each(__dev, __entry) \
  370. queue_loop(__entry, (__dev)->tx, queue_end(__dev))
  371. /**
  372. * rt2x00queue_empty - Check if the queue is empty.
  373. * @queue: Queue to check if empty.
  374. */
  375. static inline int rt2x00queue_empty(struct data_queue *queue)
  376. {
  377. return queue->length == 0;
  378. }
  379. /**
  380. * rt2x00queue_full - Check if the queue is full.
  381. * @queue: Queue to check if full.
  382. */
  383. static inline int rt2x00queue_full(struct data_queue *queue)
  384. {
  385. return queue->length == queue->limit;
  386. }
  387. /**
  388. * rt2x00queue_free - Check the number of available entries in queue.
  389. * @queue: Queue to check.
  390. */
  391. static inline int rt2x00queue_available(struct data_queue *queue)
  392. {
  393. return queue->limit - queue->length;
  394. }
  395. /**
  396. * rt2x00_desc_read - Read a word from the hardware descriptor.
  397. * @desc: Base descriptor address
  398. * @word: Word index from where the descriptor should be read.
  399. * @value: Address where the descriptor value should be written into.
  400. */
  401. static inline void rt2x00_desc_read(__le32 *desc, const u8 word, u32 *value)
  402. {
  403. *value = le32_to_cpu(desc[word]);
  404. }
  405. /**
  406. * rt2x00_desc_write - wrote a word to the hardware descriptor.
  407. * @desc: Base descriptor address
  408. * @word: Word index from where the descriptor should be written.
  409. * @value: Value that should be written into the descriptor.
  410. */
  411. static inline void rt2x00_desc_write(__le32 *desc, const u8 word, u32 value)
  412. {
  413. desc[word] = cpu_to_le32(value);
  414. }
  415. #endif /* RT2X00QUEUE_H */