tree 4469dfebe8b2ed700175ecba692a03ab581cf548
parent 2e23731954d3641a418455e8e0c37c9b8aa7f567
author Andreas Fenkart <[andreas.fenkart@streamunlimited.com]> 1366328052 -0700
committer John W. Linville <linville@tuxdriver.com> 1366744720 -0400

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>