tx.c 30 KB

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