staging: wlags49_h2: wl_enc: converts indentation spaces to tabs
This commit converts space-based indentation to tabs. Signed-off-by: Johan Meiring <johanmeiring@gmail.com> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
This commit is contained in:
parent
4f55b5d494
commit
9413127a92
|
@ -107,55 +107,55 @@ extern dbg_info_t *DbgInfo;
|
|||
******************************************************************************/
|
||||
int wl_wep_code( char *szCrypt, char *szDest, void *Data, int nLen )
|
||||
{
|
||||
int i;
|
||||
int t;
|
||||
int k ;
|
||||
char bits;
|
||||
char *szData = (char *) Data;
|
||||
/*------------------------------------------------------------------------*/
|
||||
int i;
|
||||
int t;
|
||||
int k ;
|
||||
char bits;
|
||||
char *szData = (char *) Data;
|
||||
/*------------------------------------------------------------------------*/
|
||||
|
||||
|
||||
for( i = bits = 0 ; i < MACADDRESS_STR_LEN; i++ ) {
|
||||
bits ^= szCrypt[i];
|
||||
bits += szCrypt[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 :
|
||||
case 0 :
|
||||
|
||||
szDest[t] = ((k & 0xFC) >> 2) + CH_START ;
|
||||
szDest[t+1] = ((k & 0x03) << 4) + CH_START ;
|
||||
szDest[t+2] = '\0';
|
||||
szDest[t] = ((k & 0xFC) >> 2) + CH_START ;
|
||||
szDest[t+1] = ((k & 0x03) << 4) + CH_START ;
|
||||
szDest[t+2] = '\0';
|
||||
|
||||
break;
|
||||
break;
|
||||
|
||||
|
||||
case 1 :
|
||||
case 1 :
|
||||
|
||||
szDest[t] += (( k & 0xF0 ) >> 4 );
|
||||
szDest[t+1] = (( k & 0x0F ) << 2 ) + CH_START ;
|
||||
szDest[t+2] = '\0';
|
||||
szDest[t] += (( k & 0xF0 ) >> 4 );
|
||||
szDest[t+1] = (( k & 0x0F ) << 2 ) + CH_START ;
|
||||
szDest[t+2] = '\0';
|
||||
|
||||
break;
|
||||
break;
|
||||
|
||||
|
||||
case 2 :
|
||||
case 2 :
|
||||
|
||||
szDest[t] += (( k & 0xC0 ) >> 6 );
|
||||
szDest[t+1] = ( k & 0x3F ) + CH_START ;
|
||||
szDest[t+2] = '\0';
|
||||
t++;
|
||||
szDest[t] += (( k & 0xC0 ) >> 6 );
|
||||
szDest[t+1] = ( k & 0x3F ) + CH_START ;
|
||||
szDest[t+2] = '\0';
|
||||
t++;
|
||||
|
||||
break;
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
return( strlen( szDest )) ;
|
||||
return( strlen( szDest )) ;
|
||||
|
||||
}
|
||||
/*============================================================================*/
|
||||
|
@ -184,48 +184,48 @@ int wl_wep_code( char *szCrypt, char *szDest, void *Data, int nLen )
|
|||
******************************************************************************/
|
||||
int wl_wep_decode( char *szCrypt, void *Dest, char *szData )
|
||||
{
|
||||
int i;
|
||||
int t;
|
||||
int nLen;
|
||||
char bits;
|
||||
char *szDest = Dest;
|
||||
/*------------------------------------------------------------------------*/
|
||||
int i;
|
||||
int t;
|
||||
int nLen;
|
||||
char bits;
|
||||
char *szDest = Dest;
|
||||
/*------------------------------------------------------------------------*/
|
||||
|
||||
|
||||
for( i = bits = 0 ; i < 12; i++ ) {
|
||||
bits ^= szCrypt[i] ;
|
||||
bits += szCrypt[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 ) {
|
||||
case 0 :
|
||||
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 );
|
||||
break;
|
||||
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 );
|
||||
break;
|
||||
case 1 :
|
||||
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 );
|
||||
t++;
|
||||
break;
|
||||
}
|
||||
case 2 :
|
||||
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 ) ;
|
||||
|
||||
}
|
||||
/*============================================================================*/
|
||||
|
|
Loading…
Reference in a new issue