mirror of
https://github.com/edk2-porting/linux-next.git
synced 2025-01-09 22:24:04 +08:00
staging: rtl8723bs: simplify control flow
The function iterates an index from 0 to NUM_PMKID_CACHE and returns the first index for which the condition is true. If no such index is found, the function returns -1. Current code has a complex control flow that obfuscates this simple task. Replace it with a loop. Also, given the shortened function body, replace the long variable name psecuritypriv with a short variable name p. Reported by checkpatch: WARNING: else is not generally useful after a break or return Reviewed-by: Ira Weiny <ira.weiny@intel.com> Signed-off-by: Sevinj Aghayeva <sevinj.aghayeva@gmail.com> Link: https://lore.kernel.org/r/20220401114635.GA567659@euclid Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
This commit is contained in:
parent
47f46a873d
commit
875e957087
@ -2036,28 +2036,14 @@ int rtw_restruct_wmm_ie(struct adapter *adapter, u8 *in_ie, u8 *out_ie, uint in_
|
||||
|
||||
static int SecIsInPMKIDList(struct adapter *Adapter, u8 *bssid)
|
||||
{
|
||||
struct security_priv *psecuritypriv = &Adapter->securitypriv;
|
||||
int i = 0;
|
||||
|
||||
do {
|
||||
if ((psecuritypriv->PMKIDList[i].bUsed) &&
|
||||
(!memcmp(psecuritypriv->PMKIDList[i].Bssid, bssid, ETH_ALEN))) {
|
||||
break;
|
||||
} else {
|
||||
i++;
|
||||
/* continue; */
|
||||
}
|
||||
|
||||
} while (i < NUM_PMKID_CACHE);
|
||||
|
||||
if (i == NUM_PMKID_CACHE) {
|
||||
i = -1;/* Could not find. */
|
||||
} else {
|
||||
/* There is one Pre-Authentication Key for the specific BSSID. */
|
||||
}
|
||||
|
||||
return i;
|
||||
struct security_priv *p = &Adapter->securitypriv;
|
||||
int i;
|
||||
|
||||
for (i = 0; i < NUM_PMKID_CACHE; i++)
|
||||
if ((p->PMKIDList[i].bUsed) &&
|
||||
(!memcmp(p->PMKIDList[i].Bssid, bssid, ETH_ALEN)))
|
||||
return i;
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* */
|
||||
|
Loading…
Reference in New Issue
Block a user