tx.c 30 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159
  1. /*
  2. * This file is part of wl1271
  3. *
  4. * Copyright (C) 2009 Nokia Corporation
  5. *
  6. * Contact: Luciano Coelho <luciano.coelho@nokia.com>
  7. *
  8. * This program is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU General Public License
  10. * version 2 as published by the Free Software Foundation.
  11. *
  12. * This program is distributed in the hope that it will be useful, but
  13. * WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * 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., 51 Franklin St, Fifth Floor, Boston, MA
  20. * 02110-1301 USA
  21. *
  22. */
  23. #include <linux/kernel.h>
  24. #include <linux/module.h>
  25. #include <linux/etherdevice.h>
  26. #include "wlcore.h"
  27. #include "debug.h"
  28. #include "io.h"
  29. #include "ps.h"
  30. #include "tx.h"
  31. #include "event.h"
  32. #include "hw_ops.h"
  33. /*
  34. * TODO: this is here just for now, it must be removed when the data
  35. * operations are in place.
  36. */
  37. #include "../wl12xx/reg.h"
  38. static int wl1271_set_default_wep_key(struct wl1271 *wl,
  39. struct wl12xx_vif *wlvif, u8 id)
  40. {
  41. int ret;
  42. bool is_ap = (wlvif->bss_type == BSS_TYPE_AP_BSS);
  43. if (is_ap)
  44. ret = wl12xx_cmd_set_default_wep_key(wl, id,
  45. wlvif->ap.bcast_hlid);
  46. else
  47. ret = wl12xx_cmd_set_default_wep_key(wl, id, wlvif->sta.hlid);
  48. if (ret < 0)
  49. return ret;
  50. wl1271_debug(DEBUG_CRYPT, "default wep key idx: %d", (int)id);
  51. return 0;
  52. }
  53. static int wl1271_alloc_tx_id(struct wl1271 *wl, struct sk_buff *skb)
  54. {
  55. int id;
  56. id = find_first_zero_bit(wl->tx_frames_map, wl->num_tx_desc);
  57. if (id >= wl->num_tx_desc)
  58. return -EBUSY;
  59. __set_bit(id, wl->tx_frames_map);
  60. wl->tx_frames[id] = skb;
  61. wl->tx_frames_cnt++;
  62. return id;
  63. }
  64. void wl1271_free_tx_id(struct wl1271 *wl, int id)
  65. {
  66. if (__test_and_clear_bit(id, wl->tx_frames_map)) {
  67. if (unlikely(wl->tx_frames_cnt == wl->num_tx_desc))
  68. clear_bit(WL1271_FLAG_FW_TX_BUSY, &wl->flags);
  69. wl->tx_frames[id] = NULL;
  70. wl->tx_frames_cnt--;
  71. }
  72. }
  73. EXPORT_SYMBOL(wl1271_free_tx_id);
  74. static void wl1271_tx_ap_update_inconnection_sta(struct wl1271 *wl,
  75. struct sk_buff *skb)
  76. {
  77. struct ieee80211_hdr *hdr;
  78. /*
  79. * add the station to the known list before transmitting the
  80. * authentication response. this way it won't get de-authed by FW
  81. * when transmitting too soon.
  82. */
  83. hdr = (struct ieee80211_hdr *)(skb->data +
  84. sizeof(struct wl1271_tx_hw_descr));
  85. if (ieee80211_is_auth(hdr->frame_control))
  86. wl1271_acx_set_inconnection_sta(wl, hdr->addr1);
  87. }
  88. static void wl1271_tx_regulate_link(struct wl1271 *wl,
  89. struct wl12xx_vif *wlvif,
  90. u8 hlid)
  91. {
  92. bool fw_ps, single_sta;
  93. u8 tx_pkts;
  94. if (WARN_ON(!test_bit(hlid, wlvif->links_map)))
  95. return;
  96. fw_ps = test_bit(hlid, (unsigned long *)&wl->ap_fw_ps_map);
  97. tx_pkts = wl->links[hlid].allocated_pkts;
  98. single_sta = (wl->active_sta_count == 1);
  99. /*
  100. * if in FW PS and there is enough data in FW we can put the link
  101. * into high-level PS and clean out its TX queues.
  102. * Make an exception if this is the only connected station. In this
  103. * case FW-memory congestion is not a problem.
  104. */
  105. if (!single_sta && fw_ps && tx_pkts >= WL1271_PS_STA_MAX_PACKETS)
  106. wl12xx_ps_link_start(wl, wlvif, hlid, true);
  107. }
  108. bool wl12xx_is_dummy_packet(struct wl1271 *wl, struct sk_buff *skb)
  109. {
  110. return wl->dummy_packet == skb;
  111. }
  112. EXPORT_SYMBOL(wl12xx_is_dummy_packet);
  113. u8 wl12xx_tx_get_hlid_ap(struct wl1271 *wl, struct wl12xx_vif *wlvif,
  114. struct sk_buff *skb)
  115. {
  116. struct ieee80211_tx_info *control = IEEE80211_SKB_CB(skb);
  117. if (control->control.sta) {
  118. struct wl1271_station *wl_sta;
  119. wl_sta = (struct wl1271_station *)
  120. control->control.sta->drv_priv;
  121. return wl_sta->hlid;
  122. } else {
  123. struct ieee80211_hdr *hdr;
  124. if (!test_bit(WLVIF_FLAG_AP_STARTED, &wlvif->flags))
  125. return wl->system_hlid;
  126. hdr = (struct ieee80211_hdr *)skb->data;
  127. if (is_multicast_ether_addr(ieee80211_get_DA(hdr)))
  128. return wlvif->ap.bcast_hlid;
  129. else
  130. return wlvif->ap.global_hlid;
  131. }
  132. }
  133. u8 wl12xx_tx_get_hlid(struct wl1271 *wl, struct wl12xx_vif *wlvif,
  134. struct sk_buff *skb)
  135. {
  136. struct ieee80211_hdr *hdr = (struct ieee80211_hdr *)skb->data;
  137. if (!wlvif || wl12xx_is_dummy_packet(wl, skb))
  138. return wl->system_hlid;
  139. if (wlvif->bss_type == BSS_TYPE_AP_BSS)
  140. return wl12xx_tx_get_hlid_ap(wl, wlvif, skb);
  141. if ((test_bit(WLVIF_FLAG_STA_ASSOCIATED, &wlvif->flags) ||
  142. test_bit(WLVIF_FLAG_IBSS_JOINED, &wlvif->flags)) &&
  143. !ieee80211_is_auth(hdr->frame_control) &&
  144. !ieee80211_is_assoc_req(hdr->frame_control))
  145. return wlvif->sta.hlid;
  146. else
  147. return wlvif->dev_hlid;
  148. }
  149. unsigned int wlcore_calc_packet_alignment(struct wl1271 *wl,
  150. unsigned int packet_length)
  151. {
  152. if (wl->quirks & WLCORE_QUIRK_TX_BLOCKSIZE_ALIGN)
  153. return ALIGN(packet_length, WL12XX_BUS_BLOCK_SIZE);
  154. else
  155. return ALIGN(packet_length, WL1271_TX_ALIGN_TO);
  156. }
  157. EXPORT_SYMBOL(wlcore_calc_packet_alignment);
  158. static int wl1271_tx_allocate(struct wl1271 *wl, struct wl12xx_vif *wlvif,
  159. struct sk_buff *skb, u32 extra, u32 buf_offset,
  160. u8 hlid, bool is_gem)
  161. {
  162. struct wl1271_tx_hw_descr *desc;
  163. u32 total_len = skb->len + sizeof(struct wl1271_tx_hw_descr) + extra;
  164. u32 total_blocks;
  165. int id, ret = -EBUSY, ac;
  166. u32 spare_blocks;
  167. if (buf_offset + total_len > WL1271_AGGR_BUFFER_SIZE)
  168. return -EAGAIN;
  169. spare_blocks = wlcore_hw_get_spare_blocks(wl, is_gem);
  170. /* allocate free identifier for the packet */
  171. id = wl1271_alloc_tx_id(wl, skb);
  172. if (id < 0)
  173. return id;
  174. total_blocks = wlcore_hw_calc_tx_blocks(wl, total_len, spare_blocks);
  175. if (total_blocks <= wl->tx_blocks_available) {
  176. desc = (struct wl1271_tx_hw_descr *)skb_push(
  177. skb, total_len - skb->len);
  178. wlcore_hw_set_tx_desc_blocks(wl, desc, total_blocks,
  179. spare_blocks);
  180. desc->id = id;
  181. wl->tx_blocks_available -= total_blocks;
  182. wl->tx_allocated_blocks += total_blocks;
  183. /* If the FW was empty before, arm the Tx watchdog */
  184. if (wl->tx_allocated_blocks == total_blocks)
  185. wl12xx_rearm_tx_watchdog_locked(wl);
  186. ac = wl1271_tx_get_queue(skb_get_queue_mapping(skb));
  187. wl->tx_allocated_pkts[ac]++;
  188. if (!wl12xx_is_dummy_packet(wl, skb) && wlvif &&
  189. wlvif->bss_type == BSS_TYPE_AP_BSS &&
  190. test_bit(hlid, wlvif->ap.sta_hlid_map))
  191. wl->links[hlid].allocated_pkts++;
  192. ret = 0;
  193. wl1271_debug(DEBUG_TX,
  194. "tx_allocate: size: %d, blocks: %d, id: %d",
  195. total_len, total_blocks, id);
  196. } else {
  197. wl1271_free_tx_id(wl, id);
  198. }
  199. return ret;
  200. }
  201. static void wl1271_tx_fill_hdr(struct wl1271 *wl, struct wl12xx_vif *wlvif,
  202. struct sk_buff *skb, u32 extra,
  203. struct ieee80211_tx_info *control, u8 hlid)
  204. {
  205. struct timespec ts;
  206. struct wl1271_tx_hw_descr *desc;
  207. int ac, rate_idx;
  208. s64 hosttime;
  209. u16 tx_attr = 0;
  210. __le16 frame_control;
  211. struct ieee80211_hdr *hdr;
  212. u8 *frame_start;
  213. bool is_dummy;
  214. desc = (struct wl1271_tx_hw_descr *) skb->data;
  215. frame_start = (u8 *)(desc + 1);
  216. hdr = (struct ieee80211_hdr *)(frame_start + extra);
  217. frame_control = hdr->frame_control;
  218. /* relocate space for security header */
  219. if (extra) {
  220. int hdrlen = ieee80211_hdrlen(frame_control);
  221. memmove(frame_start, hdr, hdrlen);
  222. skb_set_network_header(skb, skb_network_offset(skb) + extra);
  223. }
  224. /* configure packet life time */
  225. getnstimeofday(&ts);
  226. hosttime = (timespec_to_ns(&ts) >> 10);
  227. desc->start_time = cpu_to_le32(hosttime - wl->time_offset);
  228. is_dummy = wl12xx_is_dummy_packet(wl, skb);
  229. if (is_dummy || !wlvif || wlvif->bss_type != BSS_TYPE_AP_BSS)
  230. desc->life_time = cpu_to_le16(TX_HW_MGMT_PKT_LIFETIME_TU);
  231. else
  232. desc->life_time = cpu_to_le16(TX_HW_AP_MODE_PKT_LIFETIME_TU);
  233. /* queue */
  234. ac = wl1271_tx_get_queue(skb_get_queue_mapping(skb));
  235. desc->tid = skb->priority;
  236. if (is_dummy) {
  237. /*
  238. * FW expects the dummy packet to have an invalid session id -
  239. * any session id that is different than the one set in the join
  240. */
  241. tx_attr = (SESSION_COUNTER_INVALID <<
  242. TX_HW_ATTR_OFST_SESSION_COUNTER) &
  243. TX_HW_ATTR_SESSION_COUNTER;
  244. tx_attr |= TX_HW_ATTR_TX_DUMMY_REQ;
  245. } else if (wlvif) {
  246. /* configure the tx attributes */
  247. tx_attr = wlvif->session_counter <<
  248. TX_HW_ATTR_OFST_SESSION_COUNTER;
  249. }
  250. desc->hlid = hlid;
  251. if (is_dummy || !wlvif)
  252. rate_idx = 0;
  253. else if (wlvif->bss_type != BSS_TYPE_AP_BSS) {
  254. /* if the packets are destined for AP (have a STA entry)
  255. send them with AP rate policies, otherwise use default
  256. basic rates */
  257. if (control->flags & IEEE80211_TX_CTL_NO_CCK_RATE)
  258. rate_idx = wlvif->sta.p2p_rate_idx;
  259. else if (control->control.sta)
  260. rate_idx = wlvif->sta.ap_rate_idx;
  261. else
  262. rate_idx = wlvif->sta.basic_rate_idx;
  263. } else {
  264. if (hlid == wlvif->ap.global_hlid)
  265. rate_idx = wlvif->ap.mgmt_rate_idx;
  266. else if (hlid == wlvif->ap.bcast_hlid)
  267. rate_idx = wlvif->ap.bcast_rate_idx;
  268. else
  269. rate_idx = wlvif->ap.ucast_rate_idx[ac];
  270. }
  271. tx_attr |= rate_idx << TX_HW_ATTR_OFST_RATE_POLICY;
  272. /* for WEP shared auth - no fw encryption is needed */
  273. if (ieee80211_is_auth(frame_control) &&
  274. ieee80211_has_protected(frame_control))
  275. tx_attr |= TX_HW_ATTR_HOST_ENCRYPT;
  276. desc->tx_attr = cpu_to_le16(tx_attr);
  277. wlcore_hw_set_tx_desc_csum(wl, desc, skb);
  278. wlcore_hw_set_tx_desc_data_len(wl, desc, skb);
  279. }
  280. /* caller must hold wl->mutex */
  281. static int wl1271_prepare_tx_frame(struct wl1271 *wl, struct wl12xx_vif *wlvif,
  282. struct sk_buff *skb, u32 buf_offset)
  283. {
  284. struct ieee80211_tx_info *info;
  285. u32 extra = 0;
  286. int ret = 0;
  287. u32 total_len;
  288. u8 hlid;
  289. bool is_dummy;
  290. bool is_gem = false;
  291. if (!skb)
  292. return -EINVAL;
  293. info = IEEE80211_SKB_CB(skb);
  294. /* TODO: handle dummy packets on multi-vifs */
  295. is_dummy = wl12xx_is_dummy_packet(wl, skb);
  296. if ((wl->quirks & WLCORE_QUIRK_TKIP_HEADER_SPACE) &&
  297. info->control.hw_key &&
  298. info->control.hw_key->cipher == WLAN_CIPHER_SUITE_TKIP)
  299. extra = WL1271_EXTRA_SPACE_TKIP;
  300. if (info->control.hw_key) {
  301. bool is_wep;
  302. u8 idx = info->control.hw_key->hw_key_idx;
  303. u32 cipher = info->control.hw_key->cipher;
  304. is_wep = (cipher == WLAN_CIPHER_SUITE_WEP40) ||
  305. (cipher == WLAN_CIPHER_SUITE_WEP104);
  306. if (unlikely(is_wep && wlvif->default_key != idx)) {
  307. ret = wl1271_set_default_wep_key(wl, wlvif, idx);
  308. if (ret < 0)
  309. return ret;
  310. wlvif->default_key = idx;
  311. }
  312. is_gem = (cipher == WL1271_CIPHER_SUITE_GEM);
  313. }
  314. hlid = wl12xx_tx_get_hlid(wl, wlvif, skb);
  315. if (hlid == WL12XX_INVALID_LINK_ID) {
  316. wl1271_error("invalid hlid. dropping skb 0x%p", skb);
  317. return -EINVAL;
  318. }
  319. ret = wl1271_tx_allocate(wl, wlvif, skb, extra, buf_offset, hlid,
  320. is_gem);
  321. if (ret < 0)
  322. return ret;
  323. wl1271_tx_fill_hdr(wl, wlvif, skb, extra, info, hlid);
  324. if (!is_dummy && wlvif && wlvif->bss_type == BSS_TYPE_AP_BSS) {
  325. wl1271_tx_ap_update_inconnection_sta(wl, skb);
  326. wl1271_tx_regulate_link(wl, wlvif, hlid);
  327. }
  328. /*
  329. * The length of each packet is stored in terms of
  330. * words. Thus, we must pad the skb data to make sure its
  331. * length is aligned. The number of padding bytes is computed
  332. * and set in wl1271_tx_fill_hdr.
  333. * In special cases, we want to align to a specific block size
  334. * (eg. for wl128x with SDIO we align to 256).
  335. */
  336. total_len = wlcore_calc_packet_alignment(wl, skb->len);
  337. memcpy(wl->aggr_buf + buf_offset, skb->data, skb->len);
  338. memset(wl->aggr_buf + buf_offset + skb->len, 0, total_len - skb->len);
  339. /* Revert side effects in the dummy packet skb, so it can be reused */
  340. if (is_dummy)
  341. skb_pull(skb, sizeof(struct wl1271_tx_hw_descr));
  342. return total_len;
  343. }
  344. u32 wl1271_tx_enabled_rates_get(struct wl1271 *wl, u32 rate_set,
  345. enum ieee80211_band rate_band)
  346. {
  347. struct ieee80211_supported_band *band;
  348. u32 enabled_rates = 0;
  349. int bit;
  350. band = wl->hw->wiphy->bands[rate_band];
  351. for (bit = 0; bit < band->n_bitrates; bit++) {
  352. if (rate_set & 0x1)
  353. enabled_rates |= band->bitrates[bit].hw_value;
  354. rate_set >>= 1;
  355. }
  356. /* MCS rates indication are on bits 16 - 31 */
  357. rate_set >>= HW_HT_RATES_OFFSET - band->n_bitrates;
  358. for (bit = 0; bit < 16; bit++) {
  359. if (rate_set & 0x1)
  360. enabled_rates |= (CONF_HW_BIT_RATE_MCS_0 << bit);
  361. rate_set >>= 1;
  362. }
  363. return enabled_rates;
  364. }
  365. void wl1271_handle_tx_low_watermark(struct wl1271 *wl)
  366. {
  367. int i;
  368. for (i = 0; i < NUM_TX_QUEUES; i++) {
  369. if (wlcore_is_queue_stopped_by_reason(wl, i,
  370. WLCORE_QUEUE_STOP_REASON_WATERMARK) &&
  371. wl->tx_queue_count[i] <= WL1271_TX_QUEUE_LOW_WATERMARK) {
  372. /* firmware buffer has space, restart queues */
  373. wlcore_wake_queue(wl, i,
  374. WLCORE_QUEUE_STOP_REASON_WATERMARK);
  375. }
  376. }
  377. }
  378. static struct sk_buff_head *wl1271_select_queue(struct wl1271 *wl,
  379. struct sk_buff_head *queues)
  380. {
  381. int i, q = -1, ac;
  382. u32 min_pkts = 0xffffffff;
  383. /*
  384. * Find a non-empty ac where:
  385. * 1. There are packets to transmit
  386. * 2. The FW has the least allocated blocks
  387. *
  388. * We prioritize the ACs according to VO>VI>BE>BK
  389. */
  390. for (i = 0; i < NUM_TX_QUEUES; i++) {
  391. ac = wl1271_tx_get_queue(i);
  392. if (!skb_queue_empty(&queues[ac]) &&
  393. (wl->tx_allocated_pkts[ac] < min_pkts)) {
  394. q = ac;
  395. min_pkts = wl->tx_allocated_pkts[q];
  396. }
  397. }
  398. if (q == -1)
  399. return NULL;
  400. return &queues[q];
  401. }
  402. static struct sk_buff *wl12xx_lnk_skb_dequeue(struct wl1271 *wl,
  403. struct wl1271_link *lnk)
  404. {
  405. struct sk_buff *skb;
  406. unsigned long flags;
  407. struct sk_buff_head *queue;
  408. queue = wl1271_select_queue(wl, lnk->tx_queue);
  409. if (!queue)
  410. return NULL;
  411. skb = skb_dequeue(queue);
  412. if (skb) {
  413. int q = wl1271_tx_get_queue(skb_get_queue_mapping(skb));
  414. spin_lock_irqsave(&wl->wl_lock, flags);
  415. WARN_ON_ONCE(wl->tx_queue_count[q] <= 0);
  416. wl->tx_queue_count[q]--;
  417. spin_unlock_irqrestore(&wl->wl_lock, flags);
  418. }
  419. return skb;
  420. }
  421. static struct sk_buff *wl12xx_vif_skb_dequeue(struct wl1271 *wl,
  422. struct wl12xx_vif *wlvif)
  423. {
  424. struct sk_buff *skb = NULL;
  425. int i, h, start_hlid;
  426. /* start from the link after the last one */
  427. start_hlid = (wlvif->last_tx_hlid + 1) % WL12XX_MAX_LINKS;
  428. /* dequeue according to AC, round robin on each link */
  429. for (i = 0; i < WL12XX_MAX_LINKS; i++) {
  430. h = (start_hlid + i) % WL12XX_MAX_LINKS;
  431. /* only consider connected stations */
  432. if (!test_bit(h, wlvif->links_map))
  433. continue;
  434. skb = wl12xx_lnk_skb_dequeue(wl, &wl->links[h]);
  435. if (!skb)
  436. continue;
  437. wlvif->last_tx_hlid = h;
  438. break;
  439. }
  440. if (!skb)
  441. wlvif->last_tx_hlid = 0;
  442. return skb;
  443. }
  444. static struct sk_buff *wl1271_skb_dequeue(struct wl1271 *wl)
  445. {
  446. unsigned long flags;
  447. struct wl12xx_vif *wlvif = wl->last_wlvif;
  448. struct sk_buff *skb = NULL;
  449. /* continue from last wlvif (round robin) */
  450. if (wlvif) {
  451. wl12xx_for_each_wlvif_continue(wl, wlvif) {
  452. skb = wl12xx_vif_skb_dequeue(wl, wlvif);
  453. if (skb) {
  454. wl->last_wlvif = wlvif;
  455. break;
  456. }
  457. }
  458. }
  459. /* dequeue from the system HLID before the restarting wlvif list */
  460. if (!skb)
  461. skb = wl12xx_lnk_skb_dequeue(wl, &wl->links[wl->system_hlid]);
  462. /* do a new pass over the wlvif list */
  463. if (!skb) {
  464. wl12xx_for_each_wlvif(wl, wlvif) {
  465. skb = wl12xx_vif_skb_dequeue(wl, wlvif);
  466. if (skb) {
  467. wl->last_wlvif = wlvif;
  468. break;
  469. }
  470. /*
  471. * No need to continue after last_wlvif. The previous
  472. * pass should have found it.
  473. */
  474. if (wlvif == wl->last_wlvif)
  475. break;
  476. }
  477. }
  478. if (!skb &&
  479. test_and_clear_bit(WL1271_FLAG_DUMMY_PACKET_PENDING, &wl->flags)) {
  480. int q;
  481. skb = wl->dummy_packet;
  482. q = wl1271_tx_get_queue(skb_get_queue_mapping(skb));
  483. spin_lock_irqsave(&wl->wl_lock, flags);
  484. WARN_ON_ONCE(wl->tx_queue_count[q] <= 0);
  485. wl->tx_queue_count[q]--;
  486. spin_unlock_irqrestore(&wl->wl_lock, flags);
  487. }
  488. return skb;
  489. }
  490. static void wl1271_skb_queue_head(struct wl1271 *wl, struct wl12xx_vif *wlvif,
  491. struct sk_buff *skb)
  492. {
  493. unsigned long flags;
  494. int q = wl1271_tx_get_queue(skb_get_queue_mapping(skb));
  495. if (wl12xx_is_dummy_packet(wl, skb)) {
  496. set_bit(WL1271_FLAG_DUMMY_PACKET_PENDING, &wl->flags);
  497. } else {
  498. u8 hlid = wl12xx_tx_get_hlid(wl, wlvif, skb);
  499. skb_queue_head(&wl->links[hlid].tx_queue[q], skb);
  500. /* make sure we dequeue the same packet next time */
  501. wlvif->last_tx_hlid = (hlid + WL12XX_MAX_LINKS - 1) %
  502. WL12XX_MAX_LINKS;
  503. }
  504. spin_lock_irqsave(&wl->wl_lock, flags);
  505. wl->tx_queue_count[q]++;
  506. spin_unlock_irqrestore(&wl->wl_lock, flags);
  507. }
  508. static bool wl1271_tx_is_data_present(struct sk_buff *skb)
  509. {
  510. struct ieee80211_hdr *hdr = (struct ieee80211_hdr *)(skb->data);
  511. return ieee80211_is_data_present(hdr->frame_control);
  512. }
  513. void wl12xx_rearm_rx_streaming(struct wl1271 *wl, unsigned long *active_hlids)
  514. {
  515. struct wl12xx_vif *wlvif;
  516. u32 timeout;
  517. u8 hlid;
  518. if (!wl->conf.rx_streaming.interval)
  519. return;
  520. if (!wl->conf.rx_streaming.always &&
  521. !test_bit(WL1271_FLAG_SOFT_GEMINI, &wl->flags))
  522. return;
  523. timeout = wl->conf.rx_streaming.duration;
  524. wl12xx_for_each_wlvif_sta(wl, wlvif) {
  525. bool found = false;
  526. for_each_set_bit(hlid, active_hlids, WL12XX_MAX_LINKS) {
  527. if (test_bit(hlid, wlvif->links_map)) {
  528. found = true;
  529. break;
  530. }
  531. }
  532. if (!found)
  533. continue;
  534. /* enable rx streaming */
  535. if (!test_bit(WLVIF_FLAG_RX_STREAMING_STARTED, &wlvif->flags))
  536. ieee80211_queue_work(wl->hw,
  537. &wlvif->rx_streaming_enable_work);
  538. mod_timer(&wlvif->rx_streaming_timer,
  539. jiffies + msecs_to_jiffies(timeout));
  540. }
  541. }
  542. void wl1271_tx_work_locked(struct wl1271 *wl)
  543. {
  544. struct wl12xx_vif *wlvif;
  545. struct sk_buff *skb;
  546. struct wl1271_tx_hw_descr *desc;
  547. u32 buf_offset = 0;
  548. bool sent_packets = false;
  549. unsigned long active_hlids[BITS_TO_LONGS(WL12XX_MAX_LINKS)] = {0};
  550. int ret;
  551. if (unlikely(wl->state == WL1271_STATE_OFF))
  552. return;
  553. while ((skb = wl1271_skb_dequeue(wl))) {
  554. struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
  555. bool has_data = false;
  556. wlvif = NULL;
  557. if (!wl12xx_is_dummy_packet(wl, skb) && info->control.vif)
  558. wlvif = wl12xx_vif_to_data(info->control.vif);
  559. has_data = wlvif && wl1271_tx_is_data_present(skb);
  560. ret = wl1271_prepare_tx_frame(wl, wlvif, skb, buf_offset);
  561. if (ret == -EAGAIN) {
  562. /*
  563. * Aggregation buffer is full.
  564. * Flush buffer and try again.
  565. */
  566. wl1271_skb_queue_head(wl, wlvif, skb);
  567. wlcore_write_data(wl, REG_SLV_MEM_DATA, wl->aggr_buf,
  568. buf_offset, true);
  569. sent_packets = true;
  570. buf_offset = 0;
  571. continue;
  572. } else if (ret == -EBUSY) {
  573. /*
  574. * Firmware buffer is full.
  575. * Queue back last skb, and stop aggregating.
  576. */
  577. wl1271_skb_queue_head(wl, wlvif, skb);
  578. /* No work left, avoid scheduling redundant tx work */
  579. set_bit(WL1271_FLAG_FW_TX_BUSY, &wl->flags);
  580. goto out_ack;
  581. } else if (ret < 0) {
  582. if (wl12xx_is_dummy_packet(wl, skb))
  583. /*
  584. * fw still expects dummy packet,
  585. * so re-enqueue it
  586. */
  587. wl1271_skb_queue_head(wl, wlvif, skb);
  588. else
  589. ieee80211_free_txskb(wl->hw, skb);
  590. goto out_ack;
  591. }
  592. buf_offset += ret;
  593. wl->tx_packets_count++;
  594. if (has_data) {
  595. desc = (struct wl1271_tx_hw_descr *) skb->data;
  596. __set_bit(desc->hlid, active_hlids);
  597. }
  598. }
  599. out_ack:
  600. if (buf_offset) {
  601. wlcore_write_data(wl, REG_SLV_MEM_DATA, wl->aggr_buf,
  602. buf_offset, true);
  603. sent_packets = true;
  604. }
  605. if (sent_packets) {
  606. /*
  607. * Interrupt the firmware with the new packets. This is only
  608. * required for older hardware revisions
  609. */
  610. if (wl->quirks & WLCORE_QUIRK_END_OF_TRANSACTION)
  611. wl1271_write32(wl, WL12XX_HOST_WR_ACCESS,
  612. wl->tx_packets_count);
  613. wl1271_handle_tx_low_watermark(wl);
  614. }
  615. wl12xx_rearm_rx_streaming(wl, active_hlids);
  616. }
  617. void wl1271_tx_work(struct work_struct *work)
  618. {
  619. struct wl1271 *wl = container_of(work, struct wl1271, tx_work);
  620. int ret;
  621. mutex_lock(&wl->mutex);
  622. ret = wl1271_ps_elp_wakeup(wl);
  623. if (ret < 0)
  624. goto out;
  625. wl1271_tx_work_locked(wl);
  626. wl1271_ps_elp_sleep(wl);
  627. out:
  628. mutex_unlock(&wl->mutex);
  629. }
  630. static u8 wl1271_tx_get_rate_flags(u8 rate_class_index)
  631. {
  632. u8 flags = 0;
  633. /*
  634. * TODO: use wl12xx constants when this code is moved to wl12xx, as
  635. * only it uses Tx-completion.
  636. */
  637. if (rate_class_index <= 8)
  638. flags |= IEEE80211_TX_RC_MCS;
  639. /*
  640. * TODO: use wl12xx constants when this code is moved to wl12xx, as
  641. * only it uses Tx-completion.
  642. */
  643. if (rate_class_index == 0)
  644. flags |= IEEE80211_TX_RC_SHORT_GI;
  645. return flags;
  646. }
  647. static void wl1271_tx_complete_packet(struct wl1271 *wl,
  648. struct wl1271_tx_hw_res_descr *result)
  649. {
  650. struct ieee80211_tx_info *info;
  651. struct ieee80211_vif *vif;
  652. struct wl12xx_vif *wlvif;
  653. struct sk_buff *skb;
  654. int id = result->id;
  655. int rate = -1;
  656. u8 rate_flags = 0;
  657. u8 retries = 0;
  658. /* check for id legality */
  659. if (unlikely(id >= wl->num_tx_desc || wl->tx_frames[id] == NULL)) {
  660. wl1271_warning("TX result illegal id: %d", id);
  661. return;
  662. }
  663. skb = wl->tx_frames[id];
  664. info = IEEE80211_SKB_CB(skb);
  665. if (wl12xx_is_dummy_packet(wl, skb)) {
  666. wl1271_free_tx_id(wl, id);
  667. return;
  668. }
  669. /* info->control is valid as long as we don't update info->status */
  670. vif = info->control.vif;
  671. wlvif = wl12xx_vif_to_data(vif);
  672. /* update the TX status info */
  673. if (result->status == TX_SUCCESS) {
  674. if (!(info->flags & IEEE80211_TX_CTL_NO_ACK))
  675. info->flags |= IEEE80211_TX_STAT_ACK;
  676. rate = wlcore_rate_to_idx(wl, result->rate_class_index,
  677. wlvif->band);
  678. rate_flags = wl1271_tx_get_rate_flags(result->rate_class_index);
  679. retries = result->ack_failures;
  680. } else if (result->status == TX_RETRY_EXCEEDED) {
  681. wl->stats.excessive_retries++;
  682. retries = result->ack_failures;
  683. }
  684. info->status.rates[0].idx = rate;
  685. info->status.rates[0].count = retries;
  686. info->status.rates[0].flags = rate_flags;
  687. info->status.ack_signal = -1;
  688. wl->stats.retry_count += result->ack_failures;
  689. /*
  690. * update sequence number only when relevant, i.e. only in
  691. * sessions of TKIP, AES and GEM (not in open or WEP sessions)
  692. */
  693. if (info->control.hw_key &&
  694. (info->control.hw_key->cipher == WLAN_CIPHER_SUITE_TKIP ||
  695. info->control.hw_key->cipher == WLAN_CIPHER_SUITE_CCMP ||
  696. info->control.hw_key->cipher == WL1271_CIPHER_SUITE_GEM)) {
  697. u8 fw_lsb = result->tx_security_sequence_number_lsb;
  698. u8 cur_lsb = wlvif->tx_security_last_seq_lsb;
  699. /*
  700. * update security sequence number, taking care of potential
  701. * wrap-around
  702. */
  703. wlvif->tx_security_seq += (fw_lsb - cur_lsb) & 0xff;
  704. wlvif->tx_security_last_seq_lsb = fw_lsb;
  705. }
  706. /* remove private header from packet */
  707. skb_pull(skb, sizeof(struct wl1271_tx_hw_descr));
  708. /* remove TKIP header space if present */
  709. if ((wl->quirks & WLCORE_QUIRK_TKIP_HEADER_SPACE) &&
  710. info->control.hw_key &&
  711. info->control.hw_key->cipher == WLAN_CIPHER_SUITE_TKIP) {
  712. int hdrlen = ieee80211_get_hdrlen_from_skb(skb);
  713. memmove(skb->data + WL1271_EXTRA_SPACE_TKIP, skb->data,
  714. hdrlen);
  715. skb_pull(skb, WL1271_EXTRA_SPACE_TKIP);
  716. }
  717. wl1271_debug(DEBUG_TX, "tx status id %u skb 0x%p failures %u rate 0x%x"
  718. " status 0x%x",
  719. result->id, skb, result->ack_failures,
  720. result->rate_class_index, result->status);
  721. /* return the packet to the stack */
  722. skb_queue_tail(&wl->deferred_tx_queue, skb);
  723. queue_work(wl->freezable_wq, &wl->netstack_work);
  724. wl1271_free_tx_id(wl, result->id);
  725. }
  726. /* Called upon reception of a TX complete interrupt */
  727. void wl1271_tx_complete(struct wl1271 *wl)
  728. {
  729. struct wl1271_acx_mem_map *memmap =
  730. (struct wl1271_acx_mem_map *)wl->target_mem_map;
  731. u32 count, fw_counter;
  732. u32 i;
  733. /* read the tx results from the chipset */
  734. wl1271_read(wl, le32_to_cpu(memmap->tx_result),
  735. wl->tx_res_if, sizeof(*wl->tx_res_if), false);
  736. fw_counter = le32_to_cpu(wl->tx_res_if->tx_result_fw_counter);
  737. /* write host counter to chipset (to ack) */
  738. wl1271_write32(wl, le32_to_cpu(memmap->tx_result) +
  739. offsetof(struct wl1271_tx_hw_res_if,
  740. tx_result_host_counter), fw_counter);
  741. count = fw_counter - wl->tx_results_count;
  742. wl1271_debug(DEBUG_TX, "tx_complete received, packets: %d", count);
  743. /* verify that the result buffer is not getting overrun */
  744. if (unlikely(count > TX_HW_RESULT_QUEUE_LEN))
  745. wl1271_warning("TX result overflow from chipset: %d", count);
  746. /* process the results */
  747. for (i = 0; i < count; i++) {
  748. struct wl1271_tx_hw_res_descr *result;
  749. u8 offset = wl->tx_results_count & TX_HW_RESULT_QUEUE_LEN_MASK;
  750. /* process the packet */
  751. result = &(wl->tx_res_if->tx_results_queue[offset]);
  752. wl1271_tx_complete_packet(wl, result);
  753. wl->tx_results_count++;
  754. }
  755. }
  756. EXPORT_SYMBOL(wl1271_tx_complete);
  757. void wl1271_tx_reset_link_queues(struct wl1271 *wl, u8 hlid)
  758. {
  759. struct sk_buff *skb;
  760. int i;
  761. unsigned long flags;
  762. struct ieee80211_tx_info *info;
  763. int total[NUM_TX_QUEUES];
  764. for (i = 0; i < NUM_TX_QUEUES; i++) {
  765. total[i] = 0;
  766. while ((skb = skb_dequeue(&wl->links[hlid].tx_queue[i]))) {
  767. wl1271_debug(DEBUG_TX, "link freeing skb 0x%p", skb);
  768. if (!wl12xx_is_dummy_packet(wl, skb)) {
  769. info = IEEE80211_SKB_CB(skb);
  770. info->status.rates[0].idx = -1;
  771. info->status.rates[0].count = 0;
  772. ieee80211_tx_status_ni(wl->hw, skb);
  773. }
  774. total[i]++;
  775. }
  776. }
  777. spin_lock_irqsave(&wl->wl_lock, flags);
  778. for (i = 0; i < NUM_TX_QUEUES; i++)
  779. wl->tx_queue_count[i] -= total[i];
  780. spin_unlock_irqrestore(&wl->wl_lock, flags);
  781. wl1271_handle_tx_low_watermark(wl);
  782. }
  783. /* caller must hold wl->mutex and TX must be stopped */
  784. void wl12xx_tx_reset_wlvif(struct wl1271 *wl, struct wl12xx_vif *wlvif)
  785. {
  786. int i;
  787. /* TX failure */
  788. for_each_set_bit(i, wlvif->links_map, WL12XX_MAX_LINKS) {
  789. if (wlvif->bss_type == BSS_TYPE_AP_BSS)
  790. wl1271_free_sta(wl, wlvif, i);
  791. else
  792. wlvif->sta.ba_rx_bitmap = 0;
  793. wl->links[i].allocated_pkts = 0;
  794. wl->links[i].prev_freed_pkts = 0;
  795. }
  796. wlvif->last_tx_hlid = 0;
  797. }
  798. /* caller must hold wl->mutex and TX must be stopped */
  799. void wl12xx_tx_reset(struct wl1271 *wl)
  800. {
  801. int i;
  802. struct sk_buff *skb;
  803. struct ieee80211_tx_info *info;
  804. /* only reset the queues if something bad happened */
  805. if (WARN_ON_ONCE(wl1271_tx_total_queue_count(wl) != 0)) {
  806. for (i = 0; i < WL12XX_MAX_LINKS; i++)
  807. wl1271_tx_reset_link_queues(wl, i);
  808. for (i = 0; i < NUM_TX_QUEUES; i++)
  809. wl->tx_queue_count[i] = 0;
  810. }
  811. /*
  812. * Make sure the driver is at a consistent state, in case this
  813. * function is called from a context other than interface removal.
  814. * This call will always wake the TX queues.
  815. */
  816. wl1271_handle_tx_low_watermark(wl);
  817. for (i = 0; i < wl->num_tx_desc; i++) {
  818. if (wl->tx_frames[i] == NULL)
  819. continue;
  820. skb = wl->tx_frames[i];
  821. wl1271_free_tx_id(wl, i);
  822. wl1271_debug(DEBUG_TX, "freeing skb 0x%p", skb);
  823. if (!wl12xx_is_dummy_packet(wl, skb)) {
  824. /*
  825. * Remove private headers before passing the skb to
  826. * mac80211
  827. */
  828. info = IEEE80211_SKB_CB(skb);
  829. skb_pull(skb, sizeof(struct wl1271_tx_hw_descr));
  830. if ((wl->quirks & WLCORE_QUIRK_TKIP_HEADER_SPACE) &&
  831. info->control.hw_key &&
  832. info->control.hw_key->cipher ==
  833. WLAN_CIPHER_SUITE_TKIP) {
  834. int hdrlen = ieee80211_get_hdrlen_from_skb(skb);
  835. memmove(skb->data + WL1271_EXTRA_SPACE_TKIP,
  836. skb->data, hdrlen);
  837. skb_pull(skb, WL1271_EXTRA_SPACE_TKIP);
  838. }
  839. info->status.rates[0].idx = -1;
  840. info->status.rates[0].count = 0;
  841. ieee80211_tx_status_ni(wl->hw, skb);
  842. }
  843. }
  844. }
  845. #define WL1271_TX_FLUSH_TIMEOUT 500000
  846. /* caller must *NOT* hold wl->mutex */
  847. void wl1271_tx_flush(struct wl1271 *wl)
  848. {
  849. unsigned long timeout;
  850. int i;
  851. timeout = jiffies + usecs_to_jiffies(WL1271_TX_FLUSH_TIMEOUT);
  852. /* only one flush should be in progress, for consistent queue state */
  853. mutex_lock(&wl->flush_mutex);
  854. wlcore_stop_queues(wl, WLCORE_QUEUE_STOP_REASON_FLUSH);
  855. while (!time_after(jiffies, timeout)) {
  856. mutex_lock(&wl->mutex);
  857. wl1271_debug(DEBUG_TX, "flushing tx buffer: %d %d",
  858. wl->tx_frames_cnt,
  859. wl1271_tx_total_queue_count(wl));
  860. if ((wl->tx_frames_cnt == 0) &&
  861. (wl1271_tx_total_queue_count(wl) == 0)) {
  862. mutex_unlock(&wl->mutex);
  863. goto out;
  864. }
  865. mutex_unlock(&wl->mutex);
  866. msleep(1);
  867. }
  868. wl1271_warning("Unable to flush all TX buffers, timed out.");
  869. /* forcibly flush all Tx buffers on our queues */
  870. mutex_lock(&wl->mutex);
  871. for (i = 0; i < WL12XX_MAX_LINKS; i++)
  872. wl1271_tx_reset_link_queues(wl, i);
  873. mutex_unlock(&wl->mutex);
  874. out:
  875. wlcore_wake_queues(wl, WLCORE_QUEUE_STOP_REASON_FLUSH);
  876. mutex_unlock(&wl->flush_mutex);
  877. }
  878. EXPORT_SYMBOL_GPL(wl1271_tx_flush);
  879. u32 wl1271_tx_min_rate_get(struct wl1271 *wl, u32 rate_set)
  880. {
  881. if (WARN_ON(!rate_set))
  882. return 0;
  883. return BIT(__ffs(rate_set));
  884. }
  885. void wlcore_stop_queue_locked(struct wl1271 *wl, u8 queue,
  886. enum wlcore_queue_stop_reason reason)
  887. {
  888. bool stopped = !!wl->queue_stop_reasons[queue];
  889. /* queue should not be stopped for this reason */
  890. WARN_ON(test_and_set_bit(reason, &wl->queue_stop_reasons[queue]));
  891. if (stopped)
  892. return;
  893. ieee80211_stop_queue(wl->hw, wl1271_tx_get_mac80211_queue(queue));
  894. }
  895. void wlcore_stop_queue(struct wl1271 *wl, u8 queue,
  896. enum wlcore_queue_stop_reason reason)
  897. {
  898. unsigned long flags;
  899. spin_lock_irqsave(&wl->wl_lock, flags);
  900. wlcore_stop_queue_locked(wl, queue, reason);
  901. spin_unlock_irqrestore(&wl->wl_lock, flags);
  902. }
  903. void wlcore_wake_queue(struct wl1271 *wl, u8 queue,
  904. enum wlcore_queue_stop_reason reason)
  905. {
  906. unsigned long flags;
  907. spin_lock_irqsave(&wl->wl_lock, flags);
  908. /* queue should not be clear for this reason */
  909. WARN_ON(!test_and_clear_bit(reason, &wl->queue_stop_reasons[queue]));
  910. if (wl->queue_stop_reasons[queue])
  911. goto out;
  912. ieee80211_wake_queue(wl->hw, wl1271_tx_get_mac80211_queue(queue));
  913. out:
  914. spin_unlock_irqrestore(&wl->wl_lock, flags);
  915. }
  916. void wlcore_stop_queues(struct wl1271 *wl,
  917. enum wlcore_queue_stop_reason reason)
  918. {
  919. int i;
  920. for (i = 0; i < NUM_TX_QUEUES; i++)
  921. wlcore_stop_queue(wl, i, reason);
  922. }
  923. EXPORT_SYMBOL_GPL(wlcore_stop_queues);
  924. void wlcore_wake_queues(struct wl1271 *wl,
  925. enum wlcore_queue_stop_reason reason)
  926. {
  927. int i;
  928. for (i = 0; i < NUM_TX_QUEUES; i++)
  929. wlcore_wake_queue(wl, i, reason);
  930. }
  931. EXPORT_SYMBOL_GPL(wlcore_wake_queues);
  932. void wlcore_reset_stopped_queues(struct wl1271 *wl)
  933. {
  934. int i;
  935. unsigned long flags;
  936. spin_lock_irqsave(&wl->wl_lock, flags);
  937. for (i = 0; i < NUM_TX_QUEUES; i++) {
  938. if (!wl->queue_stop_reasons[i])
  939. continue;
  940. wl->queue_stop_reasons[i] = 0;
  941. ieee80211_wake_queue(wl->hw,
  942. wl1271_tx_get_mac80211_queue(i));
  943. }
  944. spin_unlock_irqrestore(&wl->wl_lock, flags);
  945. }
  946. bool wlcore_is_queue_stopped_by_reason(struct wl1271 *wl, u8 queue,
  947. enum wlcore_queue_stop_reason reason)
  948. {
  949. return test_bit(reason, &wl->queue_stop_reasons[queue]);
  950. }
  951. bool wlcore_is_queue_stopped(struct wl1271 *wl, u8 queue)
  952. {
  953. return !!wl->queue_stop_reasons[queue];
  954. }