Bing Zhao | 5e6e3a9 | 2011-03-21 18:00:50 -0700 | [diff] [blame^] | 1 | /* |
| 2 | * Marvell Wireless LAN device driver: WMM |
| 3 | * |
| 4 | * Copyright (C) 2011, Marvell International Ltd. |
| 5 | * |
| 6 | * This software file (the "File") is distributed by Marvell International |
| 7 | * Ltd. under the terms of the GNU General Public License Version 2, June 1991 |
| 8 | * (the "License"). You may use, redistribute and/or modify this File in |
| 9 | * accordance with the terms and conditions of the License, a copy of which |
| 10 | * is available by writing to the Free Software Foundation, Inc., |
| 11 | * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA or on the |
| 12 | * worldwide web at http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt. |
| 13 | * |
| 14 | * THE FILE IS DISTRIBUTED AS-IS, WITHOUT WARRANTY OF ANY KIND, AND THE |
| 15 | * IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE |
| 16 | * ARE EXPRESSLY DISCLAIMED. The License provides additional details about |
| 17 | * this warranty disclaimer. |
| 18 | */ |
| 19 | |
| 20 | #include "decl.h" |
| 21 | #include "ioctl.h" |
| 22 | #include "util.h" |
| 23 | #include "fw.h" |
| 24 | #include "main.h" |
| 25 | #include "wmm.h" |
| 26 | #include "11n.h" |
| 27 | |
| 28 | |
| 29 | /* Maximum value FW can accept for driver delay in packet transmission */ |
| 30 | #define DRV_PKT_DELAY_TO_FW_MAX 512 |
| 31 | |
| 32 | |
| 33 | #define WMM_QUEUED_PACKET_LOWER_LIMIT 180 |
| 34 | |
| 35 | #define WMM_QUEUED_PACKET_UPPER_LIMIT 200 |
| 36 | |
| 37 | /* Offset for TOS field in the IP header */ |
| 38 | #define IPTOS_OFFSET 5 |
| 39 | |
| 40 | /* WMM information IE */ |
| 41 | static const u8 wmm_info_ie[] = { WLAN_EID_VENDOR_SPECIFIC, 0x07, |
| 42 | 0x00, 0x50, 0xf2, 0x02, |
| 43 | 0x00, 0x01, 0x00 |
| 44 | }; |
| 45 | |
| 46 | static const u8 wmm_aci_to_qidx_map[] = { WMM_AC_BE, |
| 47 | WMM_AC_BK, |
| 48 | WMM_AC_VI, |
| 49 | WMM_AC_VO |
| 50 | }; |
| 51 | |
| 52 | static u8 tos_to_tid[] = { |
| 53 | /* TID DSCP_P2 DSCP_P1 DSCP_P0 WMM_AC */ |
| 54 | 0x01, /* 0 1 0 AC_BK */ |
| 55 | 0x02, /* 0 0 0 AC_BK */ |
| 56 | 0x00, /* 0 0 1 AC_BE */ |
| 57 | 0x03, /* 0 1 1 AC_BE */ |
| 58 | 0x04, /* 1 0 0 AC_VI */ |
| 59 | 0x05, /* 1 0 1 AC_VI */ |
| 60 | 0x06, /* 1 1 0 AC_VO */ |
| 61 | 0x07 /* 1 1 1 AC_VO */ |
| 62 | }; |
| 63 | |
| 64 | /* |
| 65 | * This table inverses the tos_to_tid operation to get a priority |
| 66 | * which is in sequential order, and can be compared. |
| 67 | * Use this to compare the priority of two different TIDs. |
| 68 | */ |
| 69 | static u8 tos_to_tid_inv[] = { |
| 70 | 0x02, /* from tos_to_tid[2] = 0 */ |
| 71 | 0x00, /* from tos_to_tid[0] = 1 */ |
| 72 | 0x01, /* from tos_to_tid[1] = 2 */ |
| 73 | 0x03, |
| 74 | 0x04, |
| 75 | 0x05, |
| 76 | 0x06, |
| 77 | 0x07}; |
| 78 | |
| 79 | static u8 ac_to_tid[4][2] = { {1, 2}, {0, 3}, {4, 5}, {6, 7} }; |
| 80 | |
| 81 | /* |
| 82 | * This function debug prints the priority parameters for a WMM AC. |
| 83 | */ |
| 84 | static void |
| 85 | mwifiex_wmm_ac_debug_print(const struct ieee_types_wmm_ac_parameters *ac_param) |
| 86 | { |
| 87 | const char *ac_str[] = { "BK", "BE", "VI", "VO" }; |
| 88 | |
| 89 | pr_debug("info: WMM AC_%s: ACI=%d, ACM=%d, Aifsn=%d, " |
| 90 | "EcwMin=%d, EcwMax=%d, TxopLimit=%d\n", |
| 91 | ac_str[wmm_aci_to_qidx_map[(ac_param->aci_aifsn_bitmap |
| 92 | & MWIFIEX_ACI) >> 5]], |
| 93 | (ac_param->aci_aifsn_bitmap & MWIFIEX_ACI) >> 5, |
| 94 | (ac_param->aci_aifsn_bitmap & MWIFIEX_ACM) >> 4, |
| 95 | ac_param->aci_aifsn_bitmap & MWIFIEX_AIFSN, |
| 96 | ac_param->ecw_bitmap & MWIFIEX_ECW_MIN, |
| 97 | (ac_param->ecw_bitmap & MWIFIEX_ECW_MAX) >> 4, |
| 98 | le16_to_cpu(ac_param->tx_op_limit)); |
| 99 | } |
| 100 | |
| 101 | /* |
| 102 | * This function allocates a route address list. |
| 103 | * |
| 104 | * The function also initializes the list with the provided RA. |
| 105 | */ |
| 106 | static struct mwifiex_ra_list_tbl * |
| 107 | mwifiex_wmm_allocate_ralist_node(struct mwifiex_adapter *adapter, u8 *ra) |
| 108 | { |
| 109 | struct mwifiex_ra_list_tbl *ra_list; |
| 110 | |
| 111 | ra_list = kzalloc(sizeof(struct mwifiex_ra_list_tbl), GFP_ATOMIC); |
| 112 | |
| 113 | if (!ra_list) { |
| 114 | dev_err(adapter->dev, "%s: failed to alloc ra_list\n", |
| 115 | __func__); |
| 116 | return NULL; |
| 117 | } |
| 118 | INIT_LIST_HEAD(&ra_list->list); |
| 119 | skb_queue_head_init(&ra_list->skb_head); |
| 120 | |
| 121 | memcpy(ra_list->ra, ra, ETH_ALEN); |
| 122 | |
| 123 | ra_list->total_pkts_size = 0; |
| 124 | |
| 125 | dev_dbg(adapter->dev, "info: allocated ra_list %p\n", ra_list); |
| 126 | |
| 127 | return ra_list; |
| 128 | } |
| 129 | |
| 130 | /* |
| 131 | * This function allocates and adds a RA list for all TIDs |
| 132 | * with the given RA. |
| 133 | */ |
| 134 | void |
| 135 | mwifiex_ralist_add(struct mwifiex_private *priv, u8 *ra) |
| 136 | { |
| 137 | int i; |
| 138 | struct mwifiex_ra_list_tbl *ra_list; |
| 139 | struct mwifiex_adapter *adapter = priv->adapter; |
| 140 | |
| 141 | for (i = 0; i < MAX_NUM_TID; ++i) { |
| 142 | ra_list = mwifiex_wmm_allocate_ralist_node(adapter, ra); |
| 143 | dev_dbg(adapter->dev, "info: created ra_list %p\n", ra_list); |
| 144 | |
| 145 | if (!ra_list) |
| 146 | break; |
| 147 | |
| 148 | if (!mwifiex_queuing_ra_based(priv)) |
| 149 | ra_list->is_11n_enabled = IS_11N_ENABLED(priv); |
| 150 | else |
| 151 | ra_list->is_11n_enabled = false; |
| 152 | |
| 153 | dev_dbg(adapter->dev, "data: ralist %p: is_11n_enabled=%d\n", |
| 154 | ra_list, ra_list->is_11n_enabled); |
| 155 | |
| 156 | list_add_tail(&ra_list->list, |
| 157 | &priv->wmm.tid_tbl_ptr[i].ra_list); |
| 158 | |
| 159 | if (!priv->wmm.tid_tbl_ptr[i].ra_list_curr) |
| 160 | priv->wmm.tid_tbl_ptr[i].ra_list_curr = ra_list; |
| 161 | } |
| 162 | } |
| 163 | |
| 164 | /* |
| 165 | * This function sets the WMM queue priorities to their default values. |
| 166 | */ |
| 167 | static void mwifiex_wmm_default_queue_priorities(struct mwifiex_private *priv) |
| 168 | { |
| 169 | /* Default queue priorities: VO->VI->BE->BK */ |
| 170 | priv->wmm.queue_priority[0] = WMM_AC_VO; |
| 171 | priv->wmm.queue_priority[1] = WMM_AC_VI; |
| 172 | priv->wmm.queue_priority[2] = WMM_AC_BE; |
| 173 | priv->wmm.queue_priority[3] = WMM_AC_BK; |
| 174 | } |
| 175 | |
| 176 | /* |
| 177 | * This function map ACs to TIDs. |
| 178 | */ |
| 179 | static void |
| 180 | mwifiex_wmm_queue_priorities_tid(struct mwifiex_private *priv, |
| 181 | u8 queue_priority[]) |
| 182 | { |
| 183 | int i; |
| 184 | |
| 185 | for (i = 0; i < 4; ++i) { |
| 186 | tos_to_tid[7 - (i * 2)] = ac_to_tid[queue_priority[i]][1]; |
| 187 | tos_to_tid[6 - (i * 2)] = ac_to_tid[queue_priority[i]][0]; |
| 188 | } |
| 189 | } |
| 190 | |
| 191 | /* |
| 192 | * This function initializes WMM priority queues. |
| 193 | */ |
| 194 | void |
| 195 | mwifiex_wmm_setup_queue_priorities(struct mwifiex_private *priv, |
| 196 | struct ieee_types_wmm_parameter *wmm_ie) |
| 197 | { |
| 198 | u16 cw_min, avg_back_off, tmp[4]; |
| 199 | u32 i, j, num_ac; |
| 200 | u8 ac_idx; |
| 201 | |
| 202 | if (!wmm_ie || !priv->wmm_enabled) { |
| 203 | /* WMM is not enabled, just set the defaults and return */ |
| 204 | mwifiex_wmm_default_queue_priorities(priv); |
| 205 | return; |
| 206 | } |
| 207 | |
| 208 | dev_dbg(priv->adapter->dev, "info: WMM Parameter IE: version=%d, " |
| 209 | "qos_info Parameter Set Count=%d, Reserved=%#x\n", |
| 210 | wmm_ie->vend_hdr.version, wmm_ie->qos_info_bitmap & |
| 211 | IEEE80211_WMM_IE_AP_QOSINFO_PARAM_SET_CNT_MASK, |
| 212 | wmm_ie->reserved); |
| 213 | |
| 214 | for (num_ac = 0; num_ac < ARRAY_SIZE(wmm_ie->ac_params); num_ac++) { |
| 215 | cw_min = (1 << (wmm_ie->ac_params[num_ac].ecw_bitmap & |
| 216 | MWIFIEX_ECW_MIN)) - 1; |
| 217 | avg_back_off = (cw_min >> 1) + |
| 218 | (wmm_ie->ac_params[num_ac].aci_aifsn_bitmap & |
| 219 | MWIFIEX_AIFSN); |
| 220 | |
| 221 | ac_idx = wmm_aci_to_qidx_map[(wmm_ie->ac_params[num_ac]. |
| 222 | aci_aifsn_bitmap & |
| 223 | MWIFIEX_ACI) >> 5]; |
| 224 | priv->wmm.queue_priority[ac_idx] = ac_idx; |
| 225 | tmp[ac_idx] = avg_back_off; |
| 226 | |
| 227 | dev_dbg(priv->adapter->dev, "info: WMM: CWmax=%d CWmin=%d Avg Back-off=%d\n", |
| 228 | (1 << ((wmm_ie->ac_params[num_ac].ecw_bitmap & |
| 229 | MWIFIEX_ECW_MAX) >> 4)) - 1, |
| 230 | cw_min, avg_back_off); |
| 231 | mwifiex_wmm_ac_debug_print(&wmm_ie->ac_params[num_ac]); |
| 232 | } |
| 233 | |
| 234 | /* Bubble sort */ |
| 235 | for (i = 0; i < num_ac; i++) { |
| 236 | for (j = 1; j < num_ac - i; j++) { |
| 237 | if (tmp[j - 1] > tmp[j]) { |
| 238 | swap(tmp[j - 1], tmp[j]); |
| 239 | swap(priv->wmm.queue_priority[j - 1], |
| 240 | priv->wmm.queue_priority[j]); |
| 241 | } else if (tmp[j - 1] == tmp[j]) { |
| 242 | if (priv->wmm.queue_priority[j - 1] |
| 243 | < priv->wmm.queue_priority[j]) |
| 244 | swap(priv->wmm.queue_priority[j - 1], |
| 245 | priv->wmm.queue_priority[j]); |
| 246 | } |
| 247 | } |
| 248 | } |
| 249 | |
| 250 | mwifiex_wmm_queue_priorities_tid(priv, priv->wmm.queue_priority); |
| 251 | } |
| 252 | |
| 253 | /* |
| 254 | * This function evaluates whether or not an AC is to be downgraded. |
| 255 | * |
| 256 | * In case the AC is not enabled, the highest AC is returned that is |
| 257 | * enabled and does not require admission control. |
| 258 | */ |
| 259 | static enum mwifiex_wmm_ac_e |
| 260 | mwifiex_wmm_eval_downgrade_ac(struct mwifiex_private *priv, |
| 261 | enum mwifiex_wmm_ac_e eval_ac) |
| 262 | { |
| 263 | int down_ac; |
| 264 | enum mwifiex_wmm_ac_e ret_ac; |
| 265 | struct mwifiex_wmm_ac_status *ac_status; |
| 266 | |
| 267 | ac_status = &priv->wmm.ac_status[eval_ac]; |
| 268 | |
| 269 | if (!ac_status->disabled) |
| 270 | /* Okay to use this AC, its enabled */ |
| 271 | return eval_ac; |
| 272 | |
| 273 | /* Setup a default return value of the lowest priority */ |
| 274 | ret_ac = WMM_AC_BK; |
| 275 | |
| 276 | /* |
| 277 | * Find the highest AC that is enabled and does not require |
| 278 | * admission control. The spec disallows downgrading to an AC, |
| 279 | * which is enabled due to a completed admission control. |
| 280 | * Unadmitted traffic is not to be sent on an AC with admitted |
| 281 | * traffic. |
| 282 | */ |
| 283 | for (down_ac = WMM_AC_BK; down_ac < eval_ac; down_ac++) { |
| 284 | ac_status = &priv->wmm.ac_status[down_ac]; |
| 285 | |
| 286 | if (!ac_status->disabled && !ac_status->flow_required) |
| 287 | /* AC is enabled and does not require admission |
| 288 | control */ |
| 289 | ret_ac = (enum mwifiex_wmm_ac_e) down_ac; |
| 290 | } |
| 291 | |
| 292 | return ret_ac; |
| 293 | } |
| 294 | |
| 295 | /* |
| 296 | * This function downgrades WMM priority queue. |
| 297 | */ |
| 298 | void |
| 299 | mwifiex_wmm_setup_ac_downgrade(struct mwifiex_private *priv) |
| 300 | { |
| 301 | int ac_val; |
| 302 | |
| 303 | dev_dbg(priv->adapter->dev, "info: WMM: AC Priorities:" |
| 304 | "BK(0), BE(1), VI(2), VO(3)\n"); |
| 305 | |
| 306 | if (!priv->wmm_enabled) { |
| 307 | /* WMM is not enabled, default priorities */ |
| 308 | for (ac_val = WMM_AC_BK; ac_val <= WMM_AC_VO; ac_val++) |
| 309 | priv->wmm.ac_down_graded_vals[ac_val] = |
| 310 | (enum mwifiex_wmm_ac_e) ac_val; |
| 311 | } else { |
| 312 | for (ac_val = WMM_AC_BK; ac_val <= WMM_AC_VO; ac_val++) { |
| 313 | priv->wmm.ac_down_graded_vals[ac_val] |
| 314 | = mwifiex_wmm_eval_downgrade_ac(priv, |
| 315 | (enum mwifiex_wmm_ac_e) ac_val); |
| 316 | dev_dbg(priv->adapter->dev, "info: WMM: AC PRIO %d maps to %d\n", |
| 317 | ac_val, priv->wmm.ac_down_graded_vals[ac_val]); |
| 318 | } |
| 319 | } |
| 320 | } |
| 321 | |
| 322 | /* |
| 323 | * This function converts the IP TOS field to an WMM AC |
| 324 | * Queue assignment. |
| 325 | */ |
| 326 | static enum mwifiex_wmm_ac_e |
| 327 | mwifiex_wmm_convert_tos_to_ac(struct mwifiex_adapter *adapter, u32 tos) |
| 328 | { |
| 329 | /* Map of TOS UP values to WMM AC */ |
| 330 | const enum mwifiex_wmm_ac_e tos_to_ac[] = { WMM_AC_BE, |
| 331 | WMM_AC_BK, |
| 332 | WMM_AC_BK, |
| 333 | WMM_AC_BE, |
| 334 | WMM_AC_VI, |
| 335 | WMM_AC_VI, |
| 336 | WMM_AC_VO, |
| 337 | WMM_AC_VO |
| 338 | }; |
| 339 | |
| 340 | if (tos >= ARRAY_SIZE(tos_to_ac)) |
| 341 | return WMM_AC_BE; |
| 342 | |
| 343 | return tos_to_ac[tos]; |
| 344 | } |
| 345 | |
| 346 | /* |
| 347 | * This function evaluates a given TID and downgrades it to a lower |
| 348 | * TID if the WMM Parameter IE received from the AP indicates that the |
| 349 | * AP is disabled (due to call admission control (ACM bit). Mapping |
| 350 | * of TID to AC is taken care of internally. |
| 351 | */ |
| 352 | static u8 |
| 353 | mwifiex_wmm_downgrade_tid(struct mwifiex_private *priv, u32 tid) |
| 354 | { |
| 355 | enum mwifiex_wmm_ac_e ac, ac_down; |
| 356 | u8 new_tid; |
| 357 | |
| 358 | ac = mwifiex_wmm_convert_tos_to_ac(priv->adapter, tid); |
| 359 | ac_down = priv->wmm.ac_down_graded_vals[ac]; |
| 360 | |
| 361 | /* Send the index to tid array, picking from the array will be |
| 362 | * taken care by dequeuing function |
| 363 | */ |
| 364 | new_tid = ac_to_tid[ac_down][tid % 2]; |
| 365 | |
| 366 | return new_tid; |
| 367 | } |
| 368 | |
| 369 | /* |
| 370 | * This function initializes the WMM state information and the |
| 371 | * WMM data path queues. |
| 372 | */ |
| 373 | void |
| 374 | mwifiex_wmm_init(struct mwifiex_adapter *adapter) |
| 375 | { |
| 376 | int i, j; |
| 377 | struct mwifiex_private *priv; |
| 378 | |
| 379 | for (j = 0; j < adapter->priv_num; ++j) { |
| 380 | priv = adapter->priv[j]; |
| 381 | if (!priv) |
| 382 | continue; |
| 383 | |
| 384 | for (i = 0; i < MAX_NUM_TID; ++i) { |
| 385 | priv->aggr_prio_tbl[i].amsdu = tos_to_tid_inv[i]; |
| 386 | priv->aggr_prio_tbl[i].ampdu_ap = tos_to_tid_inv[i]; |
| 387 | priv->aggr_prio_tbl[i].ampdu_user = tos_to_tid_inv[i]; |
| 388 | priv->wmm.tid_tbl_ptr[i].ra_list_curr = NULL; |
| 389 | } |
| 390 | |
| 391 | priv->aggr_prio_tbl[6].amsdu |
| 392 | = priv->aggr_prio_tbl[6].ampdu_ap |
| 393 | = priv->aggr_prio_tbl[6].ampdu_user |
| 394 | = BA_STREAM_NOT_ALLOWED; |
| 395 | |
| 396 | priv->aggr_prio_tbl[7].amsdu = priv->aggr_prio_tbl[7].ampdu_ap |
| 397 | = priv->aggr_prio_tbl[7].ampdu_user |
| 398 | = BA_STREAM_NOT_ALLOWED; |
| 399 | |
| 400 | priv->add_ba_param.timeout = MWIFIEX_DEFAULT_BLOCK_ACK_TIMEOUT; |
| 401 | priv->add_ba_param.tx_win_size = MWIFIEX_AMPDU_DEF_TXWINSIZE; |
| 402 | priv->add_ba_param.rx_win_size = MWIFIEX_AMPDU_DEF_RXWINSIZE; |
| 403 | } |
| 404 | } |
| 405 | |
| 406 | /* |
| 407 | * This function checks if WMM Tx queue is empty. |
| 408 | */ |
| 409 | int |
| 410 | mwifiex_wmm_lists_empty(struct mwifiex_adapter *adapter) |
| 411 | { |
| 412 | int i, j; |
| 413 | struct mwifiex_private *priv; |
| 414 | |
| 415 | for (j = 0; j < adapter->priv_num; ++j) { |
| 416 | priv = adapter->priv[j]; |
| 417 | if (priv) { |
| 418 | for (i = 0; i < MAX_NUM_TID; i++) |
| 419 | if (!mwifiex_wmm_is_ra_list_empty(adapter, |
| 420 | &priv->wmm.tid_tbl_ptr[i].ra_list)) |
| 421 | return false; |
| 422 | } |
| 423 | } |
| 424 | |
| 425 | return true; |
| 426 | } |
| 427 | |
| 428 | /* |
| 429 | * This function deletes all packets in an RA list node. |
| 430 | * |
| 431 | * The packet sent completion callback handler are called with |
| 432 | * status failure, after they are dequeued to ensure proper |
| 433 | * cleanup. The RA list node itself is freed at the end. |
| 434 | */ |
| 435 | static void |
| 436 | mwifiex_wmm_del_pkts_in_ralist_node(struct mwifiex_private *priv, |
| 437 | struct mwifiex_ra_list_tbl *ra_list) |
| 438 | { |
| 439 | struct mwifiex_adapter *adapter = priv->adapter; |
| 440 | struct sk_buff *skb, *tmp; |
| 441 | |
| 442 | skb_queue_walk_safe(&ra_list->skb_head, skb, tmp) |
| 443 | mwifiex_write_data_complete(adapter, skb, -1); |
| 444 | } |
| 445 | |
| 446 | /* |
| 447 | * This function deletes all packets in an RA list. |
| 448 | * |
| 449 | * Each nodes in the RA list are freed individually first, and then |
| 450 | * the RA list itself is freed. |
| 451 | */ |
| 452 | static void |
| 453 | mwifiex_wmm_del_pkts_in_ralist(struct mwifiex_private *priv, |
| 454 | struct list_head *ra_list_head) |
| 455 | { |
| 456 | struct mwifiex_ra_list_tbl *ra_list; |
| 457 | |
| 458 | list_for_each_entry(ra_list, ra_list_head, list) |
| 459 | mwifiex_wmm_del_pkts_in_ralist_node(priv, ra_list); |
| 460 | } |
| 461 | |
| 462 | /* |
| 463 | * This function deletes all packets in all RA lists. |
| 464 | */ |
| 465 | static void mwifiex_wmm_cleanup_queues(struct mwifiex_private *priv) |
| 466 | { |
| 467 | int i; |
| 468 | |
| 469 | for (i = 0; i < MAX_NUM_TID; i++) |
| 470 | mwifiex_wmm_del_pkts_in_ralist(priv, &priv->wmm.tid_tbl_ptr[i]. |
| 471 | ra_list); |
| 472 | } |
| 473 | |
| 474 | /* |
| 475 | * This function deletes all route addresses from all RA lists. |
| 476 | */ |
| 477 | static void mwifiex_wmm_delete_all_ralist(struct mwifiex_private *priv) |
| 478 | { |
| 479 | struct mwifiex_ra_list_tbl *ra_list, *tmp_node; |
| 480 | int i; |
| 481 | |
| 482 | for (i = 0; i < MAX_NUM_TID; ++i) { |
| 483 | dev_dbg(priv->adapter->dev, |
| 484 | "info: ra_list: freeing buf for tid %d\n", i); |
| 485 | list_for_each_entry_safe(ra_list, tmp_node, |
| 486 | &priv->wmm.tid_tbl_ptr[i].ra_list, list) { |
| 487 | list_del(&ra_list->list); |
| 488 | kfree(ra_list); |
| 489 | } |
| 490 | |
| 491 | INIT_LIST_HEAD(&priv->wmm.tid_tbl_ptr[i].ra_list); |
| 492 | |
| 493 | priv->wmm.tid_tbl_ptr[i].ra_list_curr = NULL; |
| 494 | } |
| 495 | } |
| 496 | |
| 497 | /* |
| 498 | * This function cleans up the Tx and Rx queues. |
| 499 | * |
| 500 | * Cleanup includes - |
| 501 | * - All packets in RA lists |
| 502 | * - All entries in Rx reorder table |
| 503 | * - All entries in Tx BA stream table |
| 504 | * - MPA buffer (if required) |
| 505 | * - All RA lists |
| 506 | */ |
| 507 | void |
| 508 | mwifiex_clean_txrx(struct mwifiex_private *priv) |
| 509 | { |
| 510 | unsigned long flags; |
| 511 | |
| 512 | mwifiex_11n_cleanup_reorder_tbl(priv); |
| 513 | spin_lock_irqsave(&priv->wmm.ra_list_spinlock, flags); |
| 514 | |
| 515 | mwifiex_wmm_cleanup_queues(priv); |
| 516 | mwifiex_11n_delete_all_tx_ba_stream_tbl(priv); |
| 517 | |
| 518 | if (priv->adapter->if_ops.cleanup_mpa_buf) |
| 519 | priv->adapter->if_ops.cleanup_mpa_buf(priv->adapter); |
| 520 | |
| 521 | mwifiex_wmm_delete_all_ralist(priv); |
| 522 | memcpy(tos_to_tid, ac_to_tid, sizeof(tos_to_tid)); |
| 523 | |
| 524 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, flags); |
| 525 | } |
| 526 | |
| 527 | /* |
| 528 | * This function retrieves a particular RA list node, matching with the |
| 529 | * given TID and RA address. |
| 530 | */ |
| 531 | static struct mwifiex_ra_list_tbl * |
| 532 | mwifiex_wmm_get_ralist_node(struct mwifiex_private *priv, u8 tid, |
| 533 | u8 *ra_addr) |
| 534 | { |
| 535 | struct mwifiex_ra_list_tbl *ra_list; |
| 536 | |
| 537 | list_for_each_entry(ra_list, &priv->wmm.tid_tbl_ptr[tid].ra_list, |
| 538 | list) { |
| 539 | if (!memcmp(ra_list->ra, ra_addr, ETH_ALEN)) |
| 540 | return ra_list; |
| 541 | } |
| 542 | |
| 543 | return NULL; |
| 544 | } |
| 545 | |
| 546 | /* |
| 547 | * This function retrieves an RA list node for a given TID and |
| 548 | * RA address pair. |
| 549 | * |
| 550 | * If no such node is found, a new node is added first and then |
| 551 | * retrieved. |
| 552 | */ |
| 553 | static struct mwifiex_ra_list_tbl * |
| 554 | mwifiex_wmm_get_queue_raptr(struct mwifiex_private *priv, u8 tid, u8 *ra_addr) |
| 555 | { |
| 556 | struct mwifiex_ra_list_tbl *ra_list; |
| 557 | |
| 558 | ra_list = mwifiex_wmm_get_ralist_node(priv, tid, ra_addr); |
| 559 | if (ra_list) |
| 560 | return ra_list; |
| 561 | mwifiex_ralist_add(priv, ra_addr); |
| 562 | |
| 563 | return mwifiex_wmm_get_ralist_node(priv, tid, ra_addr); |
| 564 | } |
| 565 | |
| 566 | /* |
| 567 | * This function checks if a particular RA list node exists in a given TID |
| 568 | * table index. |
| 569 | */ |
| 570 | int |
| 571 | mwifiex_is_ralist_valid(struct mwifiex_private *priv, |
| 572 | struct mwifiex_ra_list_tbl *ra_list, int ptr_index) |
| 573 | { |
| 574 | struct mwifiex_ra_list_tbl *rlist; |
| 575 | |
| 576 | list_for_each_entry(rlist, &priv->wmm.tid_tbl_ptr[ptr_index].ra_list, |
| 577 | list) { |
| 578 | if (rlist == ra_list) |
| 579 | return true; |
| 580 | } |
| 581 | |
| 582 | return false; |
| 583 | } |
| 584 | |
| 585 | /* |
| 586 | * This function adds a packet to WMM queue. |
| 587 | * |
| 588 | * In disconnected state the packet is immediately dropped and the |
| 589 | * packet send completion callback is called with status failure. |
| 590 | * |
| 591 | * Otherwise, the correct RA list node is located and the packet |
| 592 | * is queued at the list tail. |
| 593 | */ |
| 594 | void |
| 595 | mwifiex_wmm_add_buf_txqueue(struct mwifiex_adapter *adapter, |
| 596 | struct sk_buff *skb) |
| 597 | { |
| 598 | struct mwifiex_txinfo *tx_info = MWIFIEX_SKB_TXCB(skb); |
| 599 | struct mwifiex_private *priv = adapter->priv[tx_info->bss_index]; |
| 600 | u32 tid; |
| 601 | struct mwifiex_ra_list_tbl *ra_list; |
| 602 | u8 ra[ETH_ALEN], tid_down; |
| 603 | unsigned long flags; |
| 604 | |
| 605 | if (!priv->media_connected) { |
| 606 | dev_dbg(adapter->dev, "data: drop packet in disconnect\n"); |
| 607 | mwifiex_write_data_complete(adapter, skb, -1); |
| 608 | return; |
| 609 | } |
| 610 | |
| 611 | tid = skb->priority; |
| 612 | |
| 613 | spin_lock_irqsave(&priv->wmm.ra_list_spinlock, flags); |
| 614 | |
| 615 | tid_down = mwifiex_wmm_downgrade_tid(priv, tid); |
| 616 | |
| 617 | /* In case of infra as we have already created the list during |
| 618 | association we just don't have to call get_queue_raptr, we will |
| 619 | have only 1 raptr for a tid in case of infra */ |
| 620 | if (!mwifiex_queuing_ra_based(priv)) { |
| 621 | if (!list_empty(&priv->wmm.tid_tbl_ptr[tid_down].ra_list)) |
| 622 | ra_list = list_first_entry( |
| 623 | &priv->wmm.tid_tbl_ptr[tid_down].ra_list, |
| 624 | struct mwifiex_ra_list_tbl, list); |
| 625 | else |
| 626 | ra_list = NULL; |
| 627 | } else { |
| 628 | memcpy(ra, skb->data, ETH_ALEN); |
| 629 | ra_list = mwifiex_wmm_get_queue_raptr(priv, tid_down, ra); |
| 630 | } |
| 631 | |
| 632 | if (!ra_list) { |
| 633 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, flags); |
| 634 | mwifiex_write_data_complete(adapter, skb, -1); |
| 635 | return; |
| 636 | } |
| 637 | |
| 638 | skb_queue_tail(&ra_list->skb_head, skb); |
| 639 | |
| 640 | ra_list->total_pkts_size += skb->len; |
| 641 | |
| 642 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, flags); |
| 643 | } |
| 644 | |
| 645 | /* |
| 646 | * This function processes the get WMM status command response from firmware. |
| 647 | * |
| 648 | * The response may contain multiple TLVs - |
| 649 | * - AC Queue status TLVs |
| 650 | * - Current WMM Parameter IE TLV |
| 651 | * - Admission Control action frame TLVs |
| 652 | * |
| 653 | * This function parses the TLVs and then calls further specific functions |
| 654 | * to process any changes in the queue prioritize or state. |
| 655 | */ |
| 656 | int mwifiex_ret_wmm_get_status(struct mwifiex_private *priv, |
| 657 | const struct host_cmd_ds_command *resp) |
| 658 | { |
| 659 | u8 *curr = (u8 *) &resp->params.get_wmm_status; |
| 660 | uint16_t resp_len = le16_to_cpu(resp->size), tlv_len; |
| 661 | int valid = true; |
| 662 | |
| 663 | struct mwifiex_ie_types_data *tlv_hdr; |
| 664 | struct mwifiex_ie_types_wmm_queue_status *tlv_wmm_qstatus; |
| 665 | struct ieee_types_wmm_parameter *wmm_param_ie = NULL; |
| 666 | struct mwifiex_wmm_ac_status *ac_status; |
| 667 | |
| 668 | dev_dbg(priv->adapter->dev, "info: WMM: WMM_GET_STATUS cmdresp received: %d\n", |
| 669 | resp_len); |
| 670 | |
| 671 | while ((resp_len >= sizeof(tlv_hdr->header)) && valid) { |
| 672 | tlv_hdr = (struct mwifiex_ie_types_data *) curr; |
| 673 | tlv_len = le16_to_cpu(tlv_hdr->header.len); |
| 674 | |
| 675 | switch (le16_to_cpu(tlv_hdr->header.type)) { |
| 676 | case TLV_TYPE_WMMQSTATUS: |
| 677 | tlv_wmm_qstatus = |
| 678 | (struct mwifiex_ie_types_wmm_queue_status *) |
| 679 | tlv_hdr; |
| 680 | dev_dbg(priv->adapter->dev, |
| 681 | "info: CMD_RESP: WMM_GET_STATUS:" |
| 682 | " QSTATUS TLV: %d, %d, %d\n", |
| 683 | tlv_wmm_qstatus->queue_index, |
| 684 | tlv_wmm_qstatus->flow_required, |
| 685 | tlv_wmm_qstatus->disabled); |
| 686 | |
| 687 | ac_status = &priv->wmm.ac_status[tlv_wmm_qstatus-> |
| 688 | queue_index]; |
| 689 | ac_status->disabled = tlv_wmm_qstatus->disabled; |
| 690 | ac_status->flow_required = |
| 691 | tlv_wmm_qstatus->flow_required; |
| 692 | ac_status->flow_created = tlv_wmm_qstatus->flow_created; |
| 693 | break; |
| 694 | |
| 695 | case WLAN_EID_VENDOR_SPECIFIC: |
| 696 | /* |
| 697 | * Point the regular IEEE IE 2 bytes into the Marvell IE |
| 698 | * and setup the IEEE IE type and length byte fields |
| 699 | */ |
| 700 | |
| 701 | wmm_param_ie = |
| 702 | (struct ieee_types_wmm_parameter *) (curr + |
| 703 | 2); |
| 704 | wmm_param_ie->vend_hdr.len = (u8) tlv_len; |
| 705 | wmm_param_ie->vend_hdr.element_id = |
| 706 | WLAN_EID_VENDOR_SPECIFIC; |
| 707 | |
| 708 | dev_dbg(priv->adapter->dev, |
| 709 | "info: CMD_RESP: WMM_GET_STATUS:" |
| 710 | " WMM Parameter Set Count: %d\n", |
| 711 | wmm_param_ie->qos_info_bitmap & |
| 712 | IEEE80211_WMM_IE_AP_QOSINFO_PARAM_SET_CNT_MASK); |
| 713 | |
| 714 | memcpy((u8 *) &priv->curr_bss_params.bss_descriptor. |
| 715 | wmm_ie, wmm_param_ie, |
| 716 | wmm_param_ie->vend_hdr.len + 2); |
| 717 | |
| 718 | break; |
| 719 | |
| 720 | default: |
| 721 | valid = false; |
| 722 | break; |
| 723 | } |
| 724 | |
| 725 | curr += (tlv_len + sizeof(tlv_hdr->header)); |
| 726 | resp_len -= (tlv_len + sizeof(tlv_hdr->header)); |
| 727 | } |
| 728 | |
| 729 | mwifiex_wmm_setup_queue_priorities(priv, wmm_param_ie); |
| 730 | mwifiex_wmm_setup_ac_downgrade(priv); |
| 731 | |
| 732 | return 0; |
| 733 | } |
| 734 | |
| 735 | /* |
| 736 | * Callback handler from the command module to allow insertion of a WMM TLV. |
| 737 | * |
| 738 | * If the BSS we are associating to supports WMM, this function adds the |
| 739 | * required WMM Information IE to the association request command buffer in |
| 740 | * the form of a Marvell extended IEEE IE. |
| 741 | */ |
| 742 | u32 |
| 743 | mwifiex_wmm_process_association_req(struct mwifiex_private *priv, |
| 744 | u8 **assoc_buf, |
| 745 | struct ieee_types_wmm_parameter *wmm_ie, |
| 746 | struct ieee80211_ht_cap *ht_cap) |
| 747 | { |
| 748 | struct mwifiex_ie_types_wmm_param_set *wmm_tlv; |
| 749 | u32 ret_len = 0; |
| 750 | |
| 751 | /* Null checks */ |
| 752 | if (!assoc_buf) |
| 753 | return 0; |
| 754 | if (!(*assoc_buf)) |
| 755 | return 0; |
| 756 | |
| 757 | if (!wmm_ie) |
| 758 | return 0; |
| 759 | |
| 760 | dev_dbg(priv->adapter->dev, "info: WMM: process assoc req:" |
| 761 | "bss->wmmIe=0x%x\n", |
| 762 | wmm_ie->vend_hdr.element_id); |
| 763 | |
| 764 | if ((priv->wmm_required |
| 765 | || (ht_cap && (priv->adapter->config_bands & BAND_GN |
| 766 | || priv->adapter->config_bands & BAND_AN)) |
| 767 | ) |
| 768 | && wmm_ie->vend_hdr.element_id == WLAN_EID_VENDOR_SPECIFIC) { |
| 769 | wmm_tlv = (struct mwifiex_ie_types_wmm_param_set *) *assoc_buf; |
| 770 | wmm_tlv->header.type = cpu_to_le16((u16) wmm_info_ie[0]); |
| 771 | wmm_tlv->header.len = cpu_to_le16((u16) wmm_info_ie[1]); |
| 772 | memcpy(wmm_tlv->wmm_ie, &wmm_info_ie[2], |
| 773 | le16_to_cpu(wmm_tlv->header.len)); |
| 774 | if (wmm_ie->qos_info_bitmap & IEEE80211_WMM_IE_AP_QOSINFO_UAPSD) |
| 775 | memcpy((u8 *) (wmm_tlv->wmm_ie |
| 776 | + le16_to_cpu(wmm_tlv->header.len) |
| 777 | - sizeof(priv->wmm_qosinfo)), |
| 778 | &priv->wmm_qosinfo, |
| 779 | sizeof(priv->wmm_qosinfo)); |
| 780 | |
| 781 | ret_len = sizeof(wmm_tlv->header) |
| 782 | + le16_to_cpu(wmm_tlv->header.len); |
| 783 | |
| 784 | *assoc_buf += ret_len; |
| 785 | } |
| 786 | |
| 787 | return ret_len; |
| 788 | } |
| 789 | |
| 790 | /* |
| 791 | * This function computes the time delay in the driver queues for a |
| 792 | * given packet. |
| 793 | * |
| 794 | * When the packet is received at the OS/Driver interface, the current |
| 795 | * time is set in the packet structure. The difference between the present |
| 796 | * time and that received time is computed in this function and limited |
| 797 | * based on pre-compiled limits in the driver. |
| 798 | */ |
| 799 | u8 |
| 800 | mwifiex_wmm_compute_drv_pkt_delay(struct mwifiex_private *priv, |
| 801 | const struct sk_buff *skb) |
| 802 | { |
| 803 | u8 ret_val = 0; |
| 804 | struct timeval out_tstamp, in_tstamp; |
| 805 | u32 queue_delay; |
| 806 | |
| 807 | do_gettimeofday(&out_tstamp); |
| 808 | in_tstamp = ktime_to_timeval(skb->tstamp); |
| 809 | |
| 810 | queue_delay = (out_tstamp.tv_sec - in_tstamp.tv_sec) * 1000; |
| 811 | queue_delay += (out_tstamp.tv_usec - in_tstamp.tv_usec) / 1000; |
| 812 | |
| 813 | /* |
| 814 | * Queue delay is passed as a uint8 in units of 2ms (ms shifted |
| 815 | * by 1). Min value (other than 0) is therefore 2ms, max is 510ms. |
| 816 | * |
| 817 | * Pass max value if queue_delay is beyond the uint8 range |
| 818 | */ |
| 819 | ret_val = (u8) (min(queue_delay, priv->wmm.drv_pkt_delay_max) >> 1); |
| 820 | |
| 821 | dev_dbg(priv->adapter->dev, "data: WMM: Pkt Delay: %d ms," |
| 822 | " %d ms sent to FW\n", queue_delay, ret_val); |
| 823 | |
| 824 | return ret_val; |
| 825 | } |
| 826 | |
| 827 | /* |
| 828 | * This function retrieves the highest priority RA list table pointer. |
| 829 | */ |
| 830 | static struct mwifiex_ra_list_tbl * |
| 831 | mwifiex_wmm_get_highest_priolist_ptr(struct mwifiex_adapter *adapter, |
| 832 | struct mwifiex_private **priv, int *tid) |
| 833 | { |
| 834 | struct mwifiex_private *priv_tmp; |
| 835 | struct mwifiex_ra_list_tbl *ptr, *head; |
| 836 | struct mwifiex_bss_prio_node *bssprio_node, *bssprio_head; |
| 837 | struct mwifiex_tid_tbl *tid_ptr; |
| 838 | int is_list_empty; |
| 839 | unsigned long flags; |
| 840 | int i, j; |
| 841 | |
| 842 | for (j = adapter->priv_num - 1; j >= 0; --j) { |
| 843 | spin_lock_irqsave(&adapter->bss_prio_tbl[j].bss_prio_lock, |
| 844 | flags); |
| 845 | is_list_empty = list_empty(&adapter->bss_prio_tbl[j] |
| 846 | .bss_prio_head); |
| 847 | spin_unlock_irqrestore(&adapter->bss_prio_tbl[j].bss_prio_lock, |
| 848 | flags); |
| 849 | if (is_list_empty) |
| 850 | continue; |
| 851 | |
| 852 | if (adapter->bss_prio_tbl[j].bss_prio_cur == |
| 853 | (struct mwifiex_bss_prio_node *) |
| 854 | &adapter->bss_prio_tbl[j].bss_prio_head) { |
| 855 | bssprio_node = |
| 856 | list_first_entry(&adapter->bss_prio_tbl[j] |
| 857 | .bss_prio_head, |
| 858 | struct mwifiex_bss_prio_node, |
| 859 | list); |
| 860 | bssprio_head = bssprio_node; |
| 861 | } else { |
| 862 | bssprio_node = adapter->bss_prio_tbl[j].bss_prio_cur; |
| 863 | bssprio_head = bssprio_node; |
| 864 | } |
| 865 | |
| 866 | do { |
| 867 | priv_tmp = bssprio_node->priv; |
| 868 | |
| 869 | for (i = HIGH_PRIO_TID; i >= LOW_PRIO_TID; --i) { |
| 870 | |
| 871 | tid_ptr = &(priv_tmp)->wmm. |
| 872 | tid_tbl_ptr[tos_to_tid[i]]; |
| 873 | |
| 874 | spin_lock_irqsave(&tid_ptr->tid_tbl_lock, |
| 875 | flags); |
| 876 | is_list_empty = |
| 877 | list_empty(&adapter->bss_prio_tbl[j] |
| 878 | .bss_prio_head); |
| 879 | spin_unlock_irqrestore(&tid_ptr->tid_tbl_lock, |
| 880 | flags); |
| 881 | if (is_list_empty) |
| 882 | continue; |
| 883 | |
| 884 | /* |
| 885 | * Always choose the next ra we transmitted |
| 886 | * last time, this way we pick the ra's in |
| 887 | * round robin fashion. |
| 888 | */ |
| 889 | ptr = list_first_entry( |
| 890 | &tid_ptr->ra_list_curr->list, |
| 891 | struct mwifiex_ra_list_tbl, |
| 892 | list); |
| 893 | |
| 894 | head = ptr; |
| 895 | if (ptr == (struct mwifiex_ra_list_tbl *) |
| 896 | &tid_ptr->ra_list) { |
| 897 | /* Get next ra */ |
| 898 | ptr = list_first_entry(&ptr->list, |
| 899 | struct mwifiex_ra_list_tbl, list); |
| 900 | head = ptr; |
| 901 | } |
| 902 | |
| 903 | do { |
| 904 | is_list_empty = |
| 905 | skb_queue_empty(&ptr->skb_head); |
| 906 | if (!is_list_empty) { |
| 907 | *priv = priv_tmp; |
| 908 | *tid = tos_to_tid[i]; |
| 909 | return ptr; |
| 910 | } |
| 911 | /* Get next ra */ |
| 912 | ptr = list_first_entry(&ptr->list, |
| 913 | struct mwifiex_ra_list_tbl, |
| 914 | list); |
| 915 | if (ptr == |
| 916 | (struct mwifiex_ra_list_tbl *) |
| 917 | &tid_ptr->ra_list) |
| 918 | ptr = list_first_entry( |
| 919 | &ptr->list, |
| 920 | struct mwifiex_ra_list_tbl, |
| 921 | list); |
| 922 | } while (ptr != head); |
| 923 | } |
| 924 | |
| 925 | /* Get next bss priority node */ |
| 926 | bssprio_node = list_first_entry(&bssprio_node->list, |
| 927 | struct mwifiex_bss_prio_node, |
| 928 | list); |
| 929 | |
| 930 | if (bssprio_node == |
| 931 | (struct mwifiex_bss_prio_node *) |
| 932 | &adapter->bss_prio_tbl[j].bss_prio_head) |
| 933 | /* Get next bss priority node */ |
| 934 | bssprio_node = list_first_entry( |
| 935 | &bssprio_node->list, |
| 936 | struct mwifiex_bss_prio_node, |
| 937 | list); |
| 938 | } while (bssprio_node != bssprio_head); |
| 939 | } |
| 940 | return NULL; |
| 941 | } |
| 942 | |
| 943 | /* |
| 944 | * This function gets the number of packets in the Tx queue of a |
| 945 | * particular RA list. |
| 946 | */ |
| 947 | static int |
| 948 | mwifiex_num_pkts_in_txq(struct mwifiex_private *priv, |
| 949 | struct mwifiex_ra_list_tbl *ptr, int max_buf_size) |
| 950 | { |
| 951 | int count = 0, total_size = 0; |
| 952 | struct sk_buff *skb, *tmp; |
| 953 | |
| 954 | skb_queue_walk_safe(&ptr->skb_head, skb, tmp) { |
| 955 | total_size += skb->len; |
| 956 | if (total_size < max_buf_size) |
| 957 | ++count; |
| 958 | else |
| 959 | break; |
| 960 | } |
| 961 | |
| 962 | return count; |
| 963 | } |
| 964 | |
| 965 | /* |
| 966 | * This function sends a single packet to firmware for transmission. |
| 967 | */ |
| 968 | static void |
| 969 | mwifiex_send_single_packet(struct mwifiex_private *priv, |
| 970 | struct mwifiex_ra_list_tbl *ptr, int ptr_index, |
| 971 | unsigned long ra_list_flags) |
| 972 | __releases(&priv->wmm.ra_list_spinlock) |
| 973 | { |
| 974 | struct sk_buff *skb, *skb_next; |
| 975 | struct mwifiex_tx_param tx_param; |
| 976 | struct mwifiex_adapter *adapter = priv->adapter; |
| 977 | int status = 0; |
| 978 | struct mwifiex_txinfo *tx_info; |
| 979 | |
| 980 | if (skb_queue_empty(&ptr->skb_head)) { |
| 981 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, |
| 982 | ra_list_flags); |
| 983 | dev_dbg(adapter->dev, "data: nothing to send\n"); |
| 984 | return; |
| 985 | } |
| 986 | |
| 987 | skb = skb_dequeue(&ptr->skb_head); |
| 988 | |
| 989 | tx_info = MWIFIEX_SKB_TXCB(skb); |
| 990 | dev_dbg(adapter->dev, "data: dequeuing the packet %p %p\n", ptr, skb); |
| 991 | |
| 992 | ptr->total_pkts_size -= skb->len; |
| 993 | |
| 994 | if (!skb_queue_empty(&ptr->skb_head)) |
| 995 | skb_next = skb_peek(&ptr->skb_head); |
| 996 | else |
| 997 | skb_next = NULL; |
| 998 | |
| 999 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, ra_list_flags); |
| 1000 | |
| 1001 | tx_param.next_pkt_len = ((skb_next) ? skb_next->len + |
| 1002 | sizeof(struct txpd) : 0); |
| 1003 | |
| 1004 | status = mwifiex_process_tx(priv, skb, &tx_param); |
| 1005 | |
| 1006 | if (status == -EBUSY) { |
| 1007 | /* Queue the packet back at the head */ |
| 1008 | spin_lock_irqsave(&priv->wmm.ra_list_spinlock, ra_list_flags); |
| 1009 | |
| 1010 | if (!mwifiex_is_ralist_valid(priv, ptr, ptr_index)) { |
| 1011 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, |
| 1012 | ra_list_flags); |
| 1013 | mwifiex_write_data_complete(adapter, skb, -1); |
| 1014 | return; |
| 1015 | } |
| 1016 | |
| 1017 | skb_queue_tail(&ptr->skb_head, skb); |
| 1018 | |
| 1019 | ptr->total_pkts_size += skb->len; |
| 1020 | tx_info->flags |= MWIFIEX_BUF_FLAG_REQUEUED_PKT; |
| 1021 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, |
| 1022 | ra_list_flags); |
| 1023 | } else { |
| 1024 | spin_lock_irqsave(&priv->wmm.ra_list_spinlock, ra_list_flags); |
| 1025 | if (mwifiex_is_ralist_valid(priv, ptr, ptr_index)) { |
| 1026 | priv->wmm.packets_out[ptr_index]++; |
| 1027 | priv->wmm.tid_tbl_ptr[ptr_index].ra_list_curr = ptr; |
| 1028 | } |
| 1029 | adapter->bss_prio_tbl[priv->bss_priority].bss_prio_cur = |
| 1030 | list_first_entry( |
| 1031 | &adapter->bss_prio_tbl[priv->bss_priority] |
| 1032 | .bss_prio_cur->list, |
| 1033 | struct mwifiex_bss_prio_node, |
| 1034 | list); |
| 1035 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, |
| 1036 | ra_list_flags); |
| 1037 | } |
| 1038 | } |
| 1039 | |
| 1040 | /* |
| 1041 | * This function checks if the first packet in the given RA list |
| 1042 | * is already processed or not. |
| 1043 | */ |
| 1044 | static int |
| 1045 | mwifiex_is_ptr_processed(struct mwifiex_private *priv, |
| 1046 | struct mwifiex_ra_list_tbl *ptr) |
| 1047 | { |
| 1048 | struct sk_buff *skb; |
| 1049 | struct mwifiex_txinfo *tx_info; |
| 1050 | |
| 1051 | if (skb_queue_empty(&ptr->skb_head)) |
| 1052 | return false; |
| 1053 | |
| 1054 | skb = skb_peek(&ptr->skb_head); |
| 1055 | |
| 1056 | tx_info = MWIFIEX_SKB_TXCB(skb); |
| 1057 | if (tx_info->flags & MWIFIEX_BUF_FLAG_REQUEUED_PKT) |
| 1058 | return true; |
| 1059 | |
| 1060 | return false; |
| 1061 | } |
| 1062 | |
| 1063 | /* |
| 1064 | * This function sends a single processed packet to firmware for |
| 1065 | * transmission. |
| 1066 | */ |
| 1067 | static void |
| 1068 | mwifiex_send_processed_packet(struct mwifiex_private *priv, |
| 1069 | struct mwifiex_ra_list_tbl *ptr, int ptr_index, |
| 1070 | unsigned long ra_list_flags) |
| 1071 | __releases(&priv->wmm.ra_list_spinlock) |
| 1072 | { |
| 1073 | struct mwifiex_tx_param tx_param; |
| 1074 | struct mwifiex_adapter *adapter = priv->adapter; |
| 1075 | int ret = -1; |
| 1076 | struct sk_buff *skb, *skb_next; |
| 1077 | struct mwifiex_txinfo *tx_info; |
| 1078 | |
| 1079 | if (skb_queue_empty(&ptr->skb_head)) { |
| 1080 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, |
| 1081 | ra_list_flags); |
| 1082 | return; |
| 1083 | } |
| 1084 | |
| 1085 | skb = skb_dequeue(&ptr->skb_head); |
| 1086 | |
| 1087 | if (!skb_queue_empty(&ptr->skb_head)) |
| 1088 | skb_next = skb_peek(&ptr->skb_head); |
| 1089 | else |
| 1090 | skb_next = NULL; |
| 1091 | |
| 1092 | tx_info = MWIFIEX_SKB_TXCB(skb); |
| 1093 | |
| 1094 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, ra_list_flags); |
| 1095 | tx_param.next_pkt_len = |
| 1096 | ((skb_next) ? skb_next->len + |
| 1097 | sizeof(struct txpd) : 0); |
| 1098 | ret = adapter->if_ops.host_to_card(adapter, MWIFIEX_TYPE_DATA, |
| 1099 | skb->data, skb->len, &tx_param); |
| 1100 | switch (ret) { |
| 1101 | case -EBUSY: |
| 1102 | dev_dbg(adapter->dev, "data: -EBUSY is returned\n"); |
| 1103 | spin_lock_irqsave(&priv->wmm.ra_list_spinlock, ra_list_flags); |
| 1104 | |
| 1105 | if (!mwifiex_is_ralist_valid(priv, ptr, ptr_index)) { |
| 1106 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, |
| 1107 | ra_list_flags); |
| 1108 | mwifiex_write_data_complete(adapter, skb, -1); |
| 1109 | return; |
| 1110 | } |
| 1111 | |
| 1112 | skb_queue_tail(&ptr->skb_head, skb); |
| 1113 | |
| 1114 | tx_info->flags |= MWIFIEX_BUF_FLAG_REQUEUED_PKT; |
| 1115 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, |
| 1116 | ra_list_flags); |
| 1117 | break; |
| 1118 | case -1: |
| 1119 | adapter->data_sent = false; |
| 1120 | dev_err(adapter->dev, "host_to_card failed: %#x\n", ret); |
| 1121 | adapter->dbg.num_tx_host_to_card_failure++; |
| 1122 | mwifiex_write_data_complete(adapter, skb, ret); |
| 1123 | break; |
| 1124 | case -EINPROGRESS: |
| 1125 | adapter->data_sent = false; |
| 1126 | default: |
| 1127 | break; |
| 1128 | } |
| 1129 | if (ret != -EBUSY) { |
| 1130 | spin_lock_irqsave(&priv->wmm.ra_list_spinlock, ra_list_flags); |
| 1131 | if (mwifiex_is_ralist_valid(priv, ptr, ptr_index)) { |
| 1132 | priv->wmm.packets_out[ptr_index]++; |
| 1133 | priv->wmm.tid_tbl_ptr[ptr_index].ra_list_curr = ptr; |
| 1134 | } |
| 1135 | adapter->bss_prio_tbl[priv->bss_priority].bss_prio_cur = |
| 1136 | list_first_entry( |
| 1137 | &adapter->bss_prio_tbl[priv->bss_priority] |
| 1138 | .bss_prio_cur->list, |
| 1139 | struct mwifiex_bss_prio_node, |
| 1140 | list); |
| 1141 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, |
| 1142 | ra_list_flags); |
| 1143 | } |
| 1144 | } |
| 1145 | |
| 1146 | /* |
| 1147 | * This function dequeues a packet from the highest priority list |
| 1148 | * and transmits it. |
| 1149 | */ |
| 1150 | static int |
| 1151 | mwifiex_dequeue_tx_packet(struct mwifiex_adapter *adapter) |
| 1152 | { |
| 1153 | struct mwifiex_ra_list_tbl *ptr; |
| 1154 | struct mwifiex_private *priv = NULL; |
| 1155 | int ptr_index = 0; |
| 1156 | u8 ra[ETH_ALEN]; |
| 1157 | int tid_del = 0, tid = 0; |
| 1158 | unsigned long flags; |
| 1159 | |
| 1160 | ptr = mwifiex_wmm_get_highest_priolist_ptr(adapter, &priv, &ptr_index); |
| 1161 | if (!ptr) |
| 1162 | return -1; |
| 1163 | |
| 1164 | tid = mwifiex_get_tid(priv->adapter, ptr); |
| 1165 | |
| 1166 | dev_dbg(adapter->dev, "data: tid=%d\n", tid); |
| 1167 | |
| 1168 | spin_lock_irqsave(&priv->wmm.ra_list_spinlock, flags); |
| 1169 | if (!mwifiex_is_ralist_valid(priv, ptr, ptr_index)) { |
| 1170 | spin_unlock_irqrestore(&priv->wmm.ra_list_spinlock, flags); |
| 1171 | return -1; |
| 1172 | } |
| 1173 | |
| 1174 | if (mwifiex_is_ptr_processed(priv, ptr)) { |
| 1175 | mwifiex_send_processed_packet(priv, ptr, ptr_index, flags); |
| 1176 | /* ra_list_spinlock has been freed in |
| 1177 | mwifiex_send_processed_packet() */ |
| 1178 | return 0; |
| 1179 | } |
| 1180 | |
| 1181 | if (!ptr->is_11n_enabled || mwifiex_is_ba_stream_setup(priv, ptr, tid) |
| 1182 | || ((priv->sec_info.wpa_enabled |
| 1183 | || priv->sec_info.wpa2_enabled) && !priv->wpa_is_gtk_set) |
| 1184 | ) { |
| 1185 | mwifiex_send_single_packet(priv, ptr, ptr_index, flags); |
| 1186 | /* ra_list_spinlock has been freed in |
| 1187 | mwifiex_send_single_packet() */ |
| 1188 | } else { |
| 1189 | if (mwifiex_is_ampdu_allowed(priv, ptr, tid)) { |
| 1190 | if (mwifiex_is_ba_stream_avail(priv)) { |
| 1191 | mwifiex_11n_create_tx_ba_stream_tbl(priv, |
| 1192 | ptr->ra, tid, |
| 1193 | BA_STREAM_SETUP_INPROGRESS); |
| 1194 | mwifiex_send_addba(priv, tid, ptr->ra); |
| 1195 | } else if (mwifiex_find_stream_to_delete |
| 1196 | (priv, ptr, tid, &tid_del, ra)) { |
| 1197 | mwifiex_11n_create_tx_ba_stream_tbl(priv, |
| 1198 | ptr->ra, tid, |
| 1199 | BA_STREAM_SETUP_INPROGRESS); |
| 1200 | mwifiex_send_delba(priv, tid_del, ra, 1); |
| 1201 | } |
| 1202 | } |
| 1203 | /* Minimum number of AMSDU */ |
| 1204 | #define MIN_NUM_AMSDU 2 |
| 1205 | if (mwifiex_is_amsdu_allowed(priv, ptr, tid) && |
| 1206 | (mwifiex_num_pkts_in_txq(priv, ptr, adapter->tx_buf_size) >= |
| 1207 | MIN_NUM_AMSDU)) |
| 1208 | mwifiex_11n_aggregate_pkt(priv, ptr, INTF_HEADER_LEN, |
| 1209 | ptr_index, flags); |
| 1210 | /* ra_list_spinlock has been freed in |
| 1211 | mwifiex_11n_aggregate_pkt() */ |
| 1212 | else |
| 1213 | mwifiex_send_single_packet(priv, ptr, ptr_index, flags); |
| 1214 | /* ra_list_spinlock has been freed in |
| 1215 | mwifiex_send_single_packet() */ |
| 1216 | } |
| 1217 | return 0; |
| 1218 | } |
| 1219 | |
| 1220 | /* |
| 1221 | * This function transmits the highest priority packet awaiting in the |
| 1222 | * WMM Queues. |
| 1223 | */ |
| 1224 | void |
| 1225 | mwifiex_wmm_process_tx(struct mwifiex_adapter *adapter) |
| 1226 | { |
| 1227 | do { |
| 1228 | /* Check if busy */ |
| 1229 | if (adapter->data_sent || adapter->tx_lock_flag) |
| 1230 | break; |
| 1231 | |
| 1232 | if (mwifiex_dequeue_tx_packet(adapter)) |
| 1233 | break; |
| 1234 | } while (true); |
| 1235 | |
| 1236 | return; |
| 1237 | } |