To move the list iterator variable into the list_for_each_entry_*()
macro in the future it should be avoided to use the list iterator
variable after the loop body.

To *never* use the list iterator variable after the loop it was
concluded to use a separate iterator variable instead of a
found boolean [1].

This removes the need to use a found variable and simply checking if
the variable was set, can determine if the break/goto was hit.

Link: 
https://lore.kernel.org/all/CAHk-=wgRr_D8CB-D9Kg-c=ehreask5sqxpwr9y7k9sa6cwx...@mail.gmail.com/
 [1]
Signed-off-by: Jakob Koschel <jakobkosc...@gmail.com>
---
 .../net/ethernet/toshiba/ps3_gelic_wireless.c | 30 +++++++++----------
 1 file changed, 15 insertions(+), 15 deletions(-)

diff --git a/drivers/net/ethernet/toshiba/ps3_gelic_wireless.c 
b/drivers/net/ethernet/toshiba/ps3_gelic_wireless.c
index dc14a66583ff..c8a016c902cd 100644
--- a/drivers/net/ethernet/toshiba/ps3_gelic_wireless.c
+++ b/drivers/net/ethernet/toshiba/ps3_gelic_wireless.c
@@ -1495,14 +1495,14 @@ static int gelic_wl_start_scan(struct gelic_wl_info 
*wl, int always_scan,
  */
 static void gelic_wl_scan_complete_event(struct gelic_wl_info *wl)
 {
+       struct gelic_wl_scan_info *target = NULL, *iter, *tmp;
        struct gelic_eurus_cmd *cmd = NULL;
-       struct gelic_wl_scan_info *target, *tmp;
        struct gelic_wl_scan_info *oldest = NULL;
        struct gelic_eurus_scan_info *scan_info;
        unsigned int scan_info_size;
        union iwreq_data data;
        unsigned long this_time = jiffies;
-       unsigned int data_len, i, found, r;
+       unsigned int data_len, i, r;
        void *buf;
 
        pr_debug("%s:start\n", __func__);
@@ -1539,14 +1539,14 @@ static void gelic_wl_scan_complete_event(struct 
gelic_wl_info *wl)
        wl->scan_stat = GELIC_WL_SCAN_STAT_GOT_LIST;
 
        /* mark all entries are old */
-       list_for_each_entry_safe(target, tmp, &wl->network_list, list) {
-               target->valid = 0;
+       list_for_each_entry_safe(iter, tmp, &wl->network_list, list) {
+               iter->valid = 0;
                /* expire too old entries */
-               if (time_before(target->last_scanned + wl->scan_age,
+               if (time_before(iter->last_scanned + wl->scan_age,
                                this_time)) {
-                       kfree(target->hwinfo);
-                       target->hwinfo = NULL;
-                       list_move_tail(&target->list, &wl->network_free_list);
+                       kfree(iter->hwinfo);
+                       iter->hwinfo = NULL;
+                       list_move_tail(&iter->list, &wl->network_free_list);
                }
        }
 
@@ -1569,22 +1569,22 @@ static void gelic_wl_scan_complete_event(struct 
gelic_wl_info *wl)
                        continue;
                }
 
-               found = 0;
+               target = NULL;
                oldest = NULL;
-               list_for_each_entry(target, &wl->network_list, list) {
-                       if (ether_addr_equal(&target->hwinfo->bssid[2],
+               list_for_each_entry(iter, &wl->network_list, list) {
+                       if (ether_addr_equal(&iter->hwinfo->bssid[2],
                                             &scan_info->bssid[2])) {
-                               found = 1;
+                               target = iter;
                                pr_debug("%s: same BBS found scanned list\n",
                                         __func__);
                                break;
                        }
                        if (!oldest ||
-                           (target->last_scanned < oldest->last_scanned))
-                               oldest = target;
+                           (iter->last_scanned < oldest->last_scanned))
+                               oldest = iter;
                }
 
-               if (!found) {
+               if (!target) {
                        /* not found in the list */
                        if (list_empty(&wl->network_free_list)) {
                                /* expire oldest */
-- 
2.25.1

Reply via email to