mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
synced 2026-05-06 00:47:56 -04:00
staging: wlags49_h2: wl_enc: corrects spacing around parentheses
This commit corrects various instances where the use of spaces around parentheses was incorrect. Signed-off-by: Johan Meiring <johanmeiring@gmail.com> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
This commit is contained in:
committed by
Greg Kroah-Hartman
parent
9413127a92
commit
2d33309ef9
@@ -105,7 +105,7 @@ extern dbg_info_t *DbgInfo;
|
||||
* OK
|
||||
*
|
||||
******************************************************************************/
|
||||
int wl_wep_code( char *szCrypt, char *szDest, void *Data, int nLen )
|
||||
int wl_wep_code(char *szCrypt, char *szDest, void *Data, int nLen)
|
||||
{
|
||||
int i;
|
||||
int t;
|
||||
@@ -115,16 +115,16 @@ int wl_wep_code( char *szCrypt, char *szDest, void *Data, int nLen )
|
||||
/*------------------------------------------------------------------------*/
|
||||
|
||||
|
||||
for( i = bits = 0 ; i < MACADDRESS_STR_LEN; i++ ) {
|
||||
for (i = bits = 0; i < MACADDRESS_STR_LEN; i++) {
|
||||
bits ^= szCrypt[i];
|
||||
bits += szCrypt[i];
|
||||
}
|
||||
|
||||
for( i = t = *szDest = 0; i < nLen; i++, t++ ) {
|
||||
k = szData[i] ^ ( bits + i );
|
||||
for (i = t = *szDest = 0; i < nLen; i++, t++) {
|
||||
k = szData[i] ^ (bits + i);
|
||||
|
||||
|
||||
switch( i % 3 ) {
|
||||
switch (i % 3) {
|
||||
|
||||
case 0 :
|
||||
|
||||
@@ -137,8 +137,8 @@ int wl_wep_code( char *szCrypt, char *szDest, void *Data, int nLen )
|
||||
|
||||
case 1 :
|
||||
|
||||
szDest[t] += (( k & 0xF0 ) >> 4 );
|
||||
szDest[t+1] = (( k & 0x0F ) << 2 ) + CH_START ;
|
||||
szDest[t] += ((k & 0xF0) >> 4);
|
||||
szDest[t+1] = ((k & 0x0F) << 2) + CH_START ;
|
||||
szDest[t+2] = '\0';
|
||||
|
||||
break;
|
||||
@@ -146,8 +146,8 @@ int wl_wep_code( char *szCrypt, char *szDest, void *Data, int nLen )
|
||||
|
||||
case 2 :
|
||||
|
||||
szDest[t] += (( k & 0xC0 ) >> 6 );
|
||||
szDest[t+1] = ( k & 0x3F ) + CH_START ;
|
||||
szDest[t] += ((k & 0xC0) >> 6);
|
||||
szDest[t+1] = (k & 0x3F) + CH_START ;
|
||||
szDest[t+2] = '\0';
|
||||
t++;
|
||||
|
||||
@@ -155,7 +155,7 @@ int wl_wep_code( char *szCrypt, char *szDest, void *Data, int nLen )
|
||||
}
|
||||
}
|
||||
|
||||
return( strlen( szDest )) ;
|
||||
return(strlen(szDest)) ;
|
||||
|
||||
}
|
||||
/*============================================================================*/
|
||||
@@ -182,7 +182,7 @@ int wl_wep_code( char *szCrypt, char *szDest, void *Data, int nLen )
|
||||
* OK
|
||||
*
|
||||
******************************************************************************/
|
||||
int wl_wep_decode( char *szCrypt, void *Dest, char *szData )
|
||||
int wl_wep_decode(char *szCrypt, void *Dest, char *szData)
|
||||
{
|
||||
int i;
|
||||
int t;
|
||||
@@ -192,40 +192,40 @@ int wl_wep_decode( char *szCrypt, void *Dest, char *szData )
|
||||
/*------------------------------------------------------------------------*/
|
||||
|
||||
|
||||
for( i = bits = 0 ; i < 12; i++ ) {
|
||||
for (i = bits = 0; i < 12; i++) {
|
||||
bits ^= szCrypt[i] ;
|
||||
bits += szCrypt[i] ;
|
||||
}
|
||||
|
||||
nLen = ( strlen( szData ) * 3) / 4 ;
|
||||
nLen = (strlen(szData) * 3) / 4 ;
|
||||
|
||||
for( i = t = 0; i < nLen; i++, t++ ) {
|
||||
switch( i % 3 ) {
|
||||
for (i = t = 0; i < nLen; i++, t++) {
|
||||
switch (i % 3) {
|
||||
case 0 :
|
||||
|
||||
szDest[i] = ((( szData[t]-CH_START ) & 0x3f ) << 2 ) +
|
||||
((( szData[t+1]-CH_START ) & 0x30 ) >> 4 );
|
||||
szDest[i] = (((szData[t] - CH_START) & 0x3f) << 2) +
|
||||
(((szData[t+1] - CH_START) & 0x30) >> 4);
|
||||
break;
|
||||
|
||||
|
||||
case 1 :
|
||||
szDest[i] = ((( szData[t]-CH_START ) & 0x0f ) << 4 ) +
|
||||
((( szData[t+1]-CH_START ) & 0x3c ) >> 2 );
|
||||
szDest[i] = (((szData[t] - CH_START) & 0x0f) << 4) +
|
||||
(((szData[t+1] - CH_START) & 0x3c) >> 2);
|
||||
break;
|
||||
|
||||
|
||||
case 2 :
|
||||
szDest[i] = ((( szData[t]-CH_START ) & 0x03 ) << 6 ) +
|
||||
(( szData[t+1]-CH_START ) & 0x3f );
|
||||
szDest[i] = (((szData[t] - CH_START) & 0x03) << 6) +
|
||||
((szData[t+1] - CH_START) & 0x3f);
|
||||
t++;
|
||||
break;
|
||||
}
|
||||
|
||||
szDest[i] ^= ( bits + i ) ;
|
||||
szDest[i] ^= (bits + i);
|
||||
|
||||
}
|
||||
|
||||
return( i ) ;
|
||||
return(i) ;
|
||||
|
||||
}
|
||||
/*============================================================================*/
|
||||
|
||||
Reference in New Issue
Block a user