mwifiex: rework round robin scheduling of bss nodes.

Rotate bss prio list, so the bss next to the one served, will come first
in the list of bss' with equal priority. This way we pick bss nodes in a
round robin fashion. Using list rotation instead of a cur ptr simplifies
iteration to calling list_for_each_entry. List rotation is done via
list_move, where the head itself is temporarily removed and then
re-inserted after the bss just served.

Signed-off-by: Andreas Fenkart <andreas.fenkart@streamunlimited.com>
Acked-by: Bing Zhao <bzhao@marvell.com>
Signed-off-by: John W. Linville <linville@tuxdriver.com>

1 files changed, 0 insertions, 6 deletions

diff --git a/drivers/net/wireless/mwifiex/11n_aggr.c b/drivers/net/wireless/mwifiex/11n_aggr.c
index c6d74518aaab..a78e0651409c 100644
--- a/drivers/net/wireless/mwifiex/11n_aggr.c
+++ b/drivers/net/wireless/mwifiex/11n_aggr.c
@@ -297,12 +297,6 @@ mwifiex_11n_aggregate_pkt(struct mwifiex_private *priv,
         }
         if (ret != -EBUSY) {
                 mwifiex_rotate_priolists(priv, pra_list, ptrindex);
-                /* Now bss_prio_cur pointer points to next node */
-                adapter->bss_prio_tbl[priv->bss_priority].bss_prio_cur =
-                        list_first_entry(
-                                &adapter->bss_prio_tbl[priv->bss_priority]
-                                .bss_prio_cur->list,
-                                struct mwifiex_bss_prio_node, list);
         }
 
         return 0;