Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit 0d5de177 authored by Dave Hansen's avatar Dave Hansen Committed by Greg Kroah-Hartman
Browse files

staging: rtl8192u: remove unused files 



I was doing some code audits looking at scattergather uses, and noticed
that update() in drivers/staging/rtl8192u/ieee80211/digest.c uses
sg.page which doesn't exist any longer, so this can't possibly compile.

Turns out that digest.c is actually unused.  It doesn't get referenced
in a Makefile or get compiled and doesn't get used as far as I can see.
I then widened the search to all the files in the directory.  There are
a *bunch* that look unused.  I removed all of them, then added them
back one at a time until the driver compiled again.

Signed-off-by: default avatarDave Hansen <dave.hansen@intel.com>
Cc: jerry-chuang@realtek.com
Signed-off-by: default avatarGreg Kroah-Hartman <gregkh@linuxfoundation.org>
parent 55567349

drivers/staging/rtl8192u/ieee80211/EndianFree.h

deleted100644 → 0
+0 −194
Original line number Diff line number Diff line 
#ifndef __INC_ENDIANFREE_H

#define __INC_ENDIANFREE_H



/*

 *	Call endian free function when

 *		1. Read/write packet content.

 *		2. Before write integer to IO.

 *		3. After read integer from IO.

 */



#define __MACHINE_LITTLE_ENDIAN 1234    /* LSB first: i386, vax */

#define __MACHINE_BIG_ENDIAN    4321    /* MSB first: 68000, ibm, net, ppc */



#define BYTE_ORDER __MACHINE_LITTLE_ENDIAN



#if BYTE_ORDER == __MACHINE_LITTLE_ENDIAN

// Convert data

#define EF1Byte(_val)				((u8)(_val))

#define EF2Byte(_val)				((u16)(_val))

#define EF4Byte(_val)				((u32)(_val))



#else

// Convert data

#define EF1Byte(_val)				((u8)(_val))

#define EF2Byte(_val)				(((((u16)(_val))&0x00ff)<<8)|((((u16)(_val))&0xff00)>>8))

#define EF4Byte(_val)				(((((u32)(_val))&0x000000ff)<<24)|\

						((((u32)(_val))&0x0000ff00)<<8)|\

						((((u32)(_val))&0x00ff0000)>>8)|\

						((((u32)(_val))&0xff000000)>>24))

#endif



// Read data from memory

#define ReadEF1Byte(_ptr)		EF1Byte(*((u8 *)(_ptr)))

#define ReadEF2Byte(_ptr)		EF2Byte(*((u16 *)(_ptr)))

#define ReadEF4Byte(_ptr)		EF4Byte(*((u32 *)(_ptr)))



// Write data to memory

#define WriteEF1Byte(_ptr, _val)	(*((u8 *)(_ptr)))=EF1Byte(_val)

#define WriteEF2Byte(_ptr, _val)	(*((u16 *)(_ptr)))=EF2Byte(_val)

#define WriteEF4Byte(_ptr, _val)	(*((u32 *)(_ptr)))=EF4Byte(_val)

// Convert Host system specific byte ording (litten or big endia) to Network byte ording (big endian).

// 2006.05.07, by rcnjko.

#if BYTE_ORDER == __MACHINE_LITTLE_ENDIAN

#define H2N1BYTE(_val)	((u8)(_val))

#define H2N2BYTE(_val)	(((((u16)(_val))&0x00ff)<<8)|\

			((((u16)(_val))&0xff00)>>8))

#define H2N4BYTE(_val)	(((((u32)(_val))&0x000000ff)<<24)|\

			((((u32)(_val))&0x0000ff00)<<8)	|\

			((((u32)(_val))&0x00ff0000)>>8)	|\

			((((u32)(_val))&0xff000000)>>24))

#else

#define H2N1BYTE(_val)			((u8)(_val))

#define H2N2BYTE(_val)			((u16)(_val))

#define H2N4BYTE(_val)			((u32)(_val))

#endif



// Convert from Network byte ording (big endian) to Host system specific byte ording (litten or big endia).

// 2006.05.07, by rcnjko.

#if BYTE_ORDER == __MACHINE_LITTLE_ENDIAN

#define N2H1BYTE(_val)	((u8)(_val))

#define N2H2BYTE(_val)	(((((u16)(_val))&0x00ff)<<8)|\

			((((u16)(_val))&0xff00)>>8))

#define N2H4BYTE(_val)	(((((u32)(_val))&0x000000ff)<<24)|\

			((((u32)(_val))&0x0000ff00)<<8)	|\

			((((u32)(_val))&0x00ff0000)>>8)	|\

			((((u32)(_val))&0xff000000)>>24))

#else

#define N2H1BYTE(_val)			((u8)(_val))

#define N2H2BYTE(_val)			((u16)(_val))

#define N2H4BYTE(_val)			((u32)(_val))

#endif



//

//	Example:

//		BIT_LEN_MASK_32(0) => 0x00000000

//		BIT_LEN_MASK_32(1) => 0x00000001

//		BIT_LEN_MASK_32(2) => 0x00000003

//		BIT_LEN_MASK_32(32) => 0xFFFFFFFF

//

#define BIT_LEN_MASK_32(__BitLen) (0xFFFFFFFF >> (32 - (__BitLen)))

//

//	Example:

//		BIT_OFFSET_LEN_MASK_32(0, 2) => 0x00000003

//		BIT_OFFSET_LEN_MASK_32(16, 2) => 0x00030000

//

#define BIT_OFFSET_LEN_MASK_32(__BitOffset, __BitLen) (BIT_LEN_MASK_32(__BitLen) << (__BitOffset))



//

//	Description:

//		Return 4-byte value in host byte ordering from

//		4-byte pointer in litten-endian system.

//

#define LE_P4BYTE_TO_HOST_4BYTE(__pStart) (EF4Byte(*((u32 *)(__pStart))))



//

//	Description:

//		Translate subfield (continuous bits in little-endian) of 4-byte value in litten byte to

//		4-byte value in host byte ordering.

//

#define LE_BITS_TO_4BYTE(__pStart, __BitOffset, __BitLen) \

	( \

	  ( LE_P4BYTE_TO_HOST_4BYTE(__pStart) >> (__BitOffset) ) \

	  & \

	  BIT_LEN_MASK_32(__BitLen) \

	)



//

//	Description:

//		Mask subfield (continuous bits in little-endian) of 4-byte value in litten byte oredering

//		and return the result in 4-byte value in host byte ordering.

//

#define LE_BITS_CLEARED_TO_4BYTE(__pStart, __BitOffset, __BitLen) \

	( \

	  LE_P4BYTE_TO_HOST_4BYTE(__pStart) \

	  & \

	  ( ~BIT_OFFSET_LEN_MASK_32(__BitOffset, __BitLen) ) \

	)



//

//	Description:

//		Set subfield of little-endian 4-byte value to specified value.

//

#define SET_BITS_TO_LE_4BYTE(__pStart, __BitOffset, __BitLen, __Value) \

	*((u32 *)(__pStart)) = \

	EF4Byte( \

	LE_BITS_CLEARED_TO_4BYTE(__pStart, __BitOffset, __BitLen) \

	| \

	( (((u32)__Value) & BIT_LEN_MASK_32(__BitLen)) << (__BitOffset) ) \

       );





#define BIT_LEN_MASK_16(__BitLen) \

	(0xFFFF >> (16 - (__BitLen)))



#define BIT_OFFSET_LEN_MASK_16(__BitOffset, __BitLen) \

	(BIT_LEN_MASK_16(__BitLen) << (__BitOffset))



#define LE_P2BYTE_TO_HOST_2BYTE(__pStart) \

	(EF2Byte(*((u16 *)(__pStart))))



#define LE_BITS_TO_2BYTE(__pStart, __BitOffset, __BitLen) \

	( \

	  ( LE_P2BYTE_TO_HOST_2BYTE(__pStart) >> (__BitOffset) ) \

	  & \

	  BIT_LEN_MASK_16(__BitLen) \

	)



#define LE_BITS_CLEARED_TO_2BYTE(__pStart, __BitOffset, __BitLen) \

	( \

	  LE_P2BYTE_TO_HOST_2BYTE(__pStart) \

	  & \

	  ( ~BIT_OFFSET_LEN_MASK_16(__BitOffset, __BitLen) ) \

	)



#define SET_BITS_TO_LE_2BYTE(__pStart, __BitOffset, __BitLen, __Value) \

	*((u16 *)(__pStart)) = \

	EF2Byte( \

		LE_BITS_CLEARED_TO_2BYTE(__pStart, __BitOffset, __BitLen) \

		| \

		( (((u16)__Value) & BIT_LEN_MASK_16(__BitLen)) << (__BitOffset) ) \

       );



#define BIT_LEN_MASK_8(__BitLen) \

	(0xFF >> (8 - (__BitLen)))



#define BIT_OFFSET_LEN_MASK_8(__BitOffset, __BitLen) \

	(BIT_LEN_MASK_8(__BitLen) << (__BitOffset))



#define LE_P1BYTE_TO_HOST_1BYTE(__pStart) \

	(EF1Byte(*((u8 *)(__pStart))))



#define LE_BITS_TO_1BYTE(__pStart, __BitOffset, __BitLen) \

	( \

	  ( LE_P1BYTE_TO_HOST_1BYTE(__pStart) >> (__BitOffset) ) \

	  & \

	  BIT_LEN_MASK_8(__BitLen) \

	)



#define LE_BITS_CLEARED_TO_1BYTE(__pStart, __BitOffset, __BitLen) \

	( \

	  LE_P1BYTE_TO_HOST_1BYTE(__pStart) \

	  & \

	  ( ~BIT_OFFSET_LEN_MASK_8(__BitOffset, __BitLen) ) \

	)



#define SET_BITS_TO_LE_1BYTE(__pStart, __BitOffset, __BitLen, __Value) \

	*((u8 *)(__pStart)) = \

	EF1Byte( \

		LE_BITS_CLEARED_TO_1BYTE(__pStart, __BitOffset, __BitLen) \

		| \

		( (((u8)__Value) & BIT_LEN_MASK_8(__BitLen)) << (__BitOffset) ) \

       );



#endif // #ifndef __INC_ENDIANFREE_H

drivers/staging/rtl8192u/ieee80211/aes.c

deleted100644 → 0
+0 −468
Original line number Diff line number Diff line 
/*

 * Cryptographic API.

 *

 * AES Cipher Algorithm.

 *

 * Based on Brian Gladman's code.

 *

 * Linux developers:

 *  Alexander Kjeldaas <astor@fast.no>

 *  Herbert Valerio Riedel <hvr@hvrlab.org>

 *  Kyle McMartin <kyle@debian.org>

 *  Adam J. Richter <adam@yggdrasil.com> (conversion to 2.5 API).

 *

 * This program is free software; you can redistribute it and/or modify

 * it under the terms of the GNU General Public License as published by

 * the Free Software Foundation; either version 2 of the License, or

 * (at your option) any later version.

 *

 * ---------------------------------------------------------------------------

 * Copyright (c) 2002, Dr Brian Gladman <brg@gladman.me.uk>, Worcester, UK.

 * All rights reserved.

 *

 * LICENSE TERMS

 *

 * The free distribution and use of this software in both source and binary

 * form is allowed (with or without changes) provided that:

 *

 *   1. distributions of this source code include the above copyright

 *      notice, this list of conditions and the following disclaimer;

 *

 *   2. distributions in binary form include the above copyright

 *      notice, this list of conditions and the following disclaimer

 *      in the documentation and/or other associated materials;

 *

 *   3. the copyright holder's name is not used to endorse products

 *      built using this software without specific written permission.

 *

 * ALTERNATIVELY, provided that this notice is retained in full, this product

 * may be distributed under the terms of the GNU General Public License (GPL),

 * in which case the provisions of the GPL apply INSTEAD OF those given above.

 *

 * DISCLAIMER

 *

 * This software is provided 'as is' with no explicit or implied warranties

 * in respect of its properties, including, but not limited to, correctness

 * and/or fitness for purpose.

 * ---------------------------------------------------------------------------

 */



/* Some changes from the Gladman version:

    s/RIJNDAEL(e_key)/E_KEY/g

    s/RIJNDAEL(d_key)/D_KEY/g

*/



#include <linux/module.h>

#include <linux/init.h>

#include <linux/types.h>

#include <linux/errno.h>

//#include <linux/crypto.h>

#include "rtl_crypto.h"

#include <asm/byteorder.h>



#define AES_MIN_KEY_SIZE	16

#define AES_MAX_KEY_SIZE	32



#define AES_BLOCK_SIZE		16



static inline

u32 generic_rotr32 (const u32 x, const unsigned bits)

{

	const unsigned n = bits % 32;

	return (x >> n) | (x << (32 - n));

}



static inline

u32 generic_rotl32 (const u32 x, const unsigned bits)

{

	const unsigned n = bits % 32;

	return (x << n) | (x >> (32 - n));

}



#define rotl generic_rotl32

#define rotr generic_rotr32



/*

 * #define byte(x, nr) ((unsigned char)((x) >> (nr*8)))

 */

inline static u8

byte(const u32 x, const unsigned n)

{

	return x >> (n << 3);

}



#define u32_in(x) le32_to_cpu(*(const u32 *)(x))

#define u32_out(to, from) (*(u32 *)(to) = cpu_to_le32(from))



struct aes_ctx {

	int key_length;

	u32 E[60];

	u32 D[60];

};



#define E_KEY ctx->E

#define D_KEY ctx->D



static u8 pow_tab[256] __initdata;

static u8 log_tab[256] __initdata;

static u8 sbx_tab[256] __initdata;

static u8 isb_tab[256] __initdata;

static u32 rco_tab[10];

static u32 ft_tab[4][256];

static u32 it_tab[4][256];



static u32 fl_tab[4][256];

static u32 il_tab[4][256];



static inline u8 __init

f_mult (u8 a, u8 b)

{

	u8 aa = log_tab[a], cc = aa + log_tab[b];



	return pow_tab[cc + (cc < aa ? 1 : 0)];

}



#define ff_mult(a,b)    (a && b ? f_mult(a, b) : 0)



#define f_rn(bo, bi, n, k)					\

    bo[n] =  ft_tab[0][byte(bi[n],0)] ^				\

	     ft_tab[1][byte(bi[(n + 1) & 3],1)] ^		\

	     ft_tab[2][byte(bi[(n + 2) & 3],2)] ^		\

	     ft_tab[3][byte(bi[(n + 3) & 3],3)] ^ *(k + n)



#define i_rn(bo, bi, n, k)					\

    bo[n] =  it_tab[0][byte(bi[n],0)] ^				\

	     it_tab[1][byte(bi[(n + 3) & 3],1)] ^		\

	     it_tab[2][byte(bi[(n + 2) & 3],2)] ^		\

	     it_tab[3][byte(bi[(n + 1) & 3],3)] ^ *(k + n)



#define ls_box(x)				\

    ( fl_tab[0][byte(x, 0)] ^			\

      fl_tab[1][byte(x, 1)] ^			\

      fl_tab[2][byte(x, 2)] ^			\

      fl_tab[3][byte(x, 3)] )



#define f_rl(bo, bi, n, k)					\

    bo[n] =  fl_tab[0][byte(bi[n],0)] ^				\

	     fl_tab[1][byte(bi[(n + 1) & 3],1)] ^		\

	     fl_tab[2][byte(bi[(n + 2) & 3],2)] ^		\

	     fl_tab[3][byte(bi[(n + 3) & 3],3)] ^ *(k + n)



#define i_rl(bo, bi, n, k)					\

    bo[n] =  il_tab[0][byte(bi[n],0)] ^				\

	     il_tab[1][byte(bi[(n + 3) & 3],1)] ^		\

	     il_tab[2][byte(bi[(n + 2) & 3],2)] ^		\

	     il_tab[3][byte(bi[(n + 1) & 3],3)] ^ *(k + n)



static void __init

gen_tabs (void)

{

	u32 i, t;

	u8 p, q;



	/* log and power tables for GF(2**8) finite field with

	   0x011b as modular polynomial - the simplest primitive

	   root is 0x03, used here to generate the tables */



	for (i = 0, p = 1; i < 256; ++i) {

		pow_tab[i] = (u8) p;

		log_tab[p] = (u8) i;



		p ^= (p << 1) ^ (p & 0x80 ? 0x01b : 0);

	}



	log_tab[1] = 0;



	for (i = 0, p = 1; i < 10; ++i) {

		rco_tab[i] = p;



		p = (p << 1) ^ (p & 0x80 ? 0x01b : 0);

	}



	for (i = 0; i < 256; ++i) {

		p = (i ? pow_tab[255 - log_tab[i]] : 0);

		q = ((p >> 7) | (p << 1)) ^ ((p >> 6) | (p << 2));

		p ^= 0x63 ^ q ^ ((q >> 6) | (q << 2));

		sbx_tab[i] = p;

		isb_tab[p] = (u8) i;

	}



	for (i = 0; i < 256; ++i) {

		p = sbx_tab[i];



		t = p;

		fl_tab[0][i] = t;

		fl_tab[1][i] = rotl (t, 8);

		fl_tab[2][i] = rotl (t, 16);

		fl_tab[3][i] = rotl (t, 24);



		t = ((u32) ff_mult (2, p)) |

		    ((u32) p << 8) |

		    ((u32) p << 16) | ((u32) ff_mult (3, p) << 24);



		ft_tab[0][i] = t;

		ft_tab[1][i] = rotl (t, 8);

		ft_tab[2][i] = rotl (t, 16);

		ft_tab[3][i] = rotl (t, 24);



		p = isb_tab[i];



		t = p;

		il_tab[0][i] = t;

		il_tab[1][i] = rotl (t, 8);

		il_tab[2][i] = rotl (t, 16);

		il_tab[3][i] = rotl (t, 24);



		t = ((u32) ff_mult (14, p)) |

		    ((u32) ff_mult (9, p) << 8) |

		    ((u32) ff_mult (13, p) << 16) |

		    ((u32) ff_mult (11, p) << 24);



		it_tab[0][i] = t;

		it_tab[1][i] = rotl (t, 8);

		it_tab[2][i] = rotl (t, 16);

		it_tab[3][i] = rotl (t, 24);

	}

}



#define star_x(x) (((x) & 0x7f7f7f7f) << 1) ^ ((((x) & 0x80808080) >> 7) * 0x1b)



#define imix_col(y,x)       \

    u   = star_x(x);        \

    v   = star_x(u);        \

    w   = star_x(v);        \

    t   = w ^ (x);          \

   (y)  = u ^ v ^ w;        \

   (y) ^= rotr(u ^ t,  8) ^ \

	  rotr(v ^ t, 16) ^ \

	  rotr(t,24)



/* initialise the key schedule from the user supplied key */



#define loop4(i)                                    \

{   t = rotr(t,  8); t = ls_box(t) ^ rco_tab[i];    \

    t ^= E_KEY[4 * i];     E_KEY[4 * i + 4] = t;    \

    t ^= E_KEY[4 * i + 1]; E_KEY[4 * i + 5] = t;    \

    t ^= E_KEY[4 * i + 2]; E_KEY[4 * i + 6] = t;    \

    t ^= E_KEY[4 * i + 3]; E_KEY[4 * i + 7] = t;    \

}



#define loop6(i)                                    \

{   t = rotr(t,  8); t = ls_box(t) ^ rco_tab[i];    \

    t ^= E_KEY[6 * i];     E_KEY[6 * i + 6] = t;    \

    t ^= E_KEY[6 * i + 1]; E_KEY[6 * i + 7] = t;    \

    t ^= E_KEY[6 * i + 2]; E_KEY[6 * i + 8] = t;    \

    t ^= E_KEY[6 * i + 3]; E_KEY[6 * i + 9] = t;    \

    t ^= E_KEY[6 * i + 4]; E_KEY[6 * i + 10] = t;   \

    t ^= E_KEY[6 * i + 5]; E_KEY[6 * i + 11] = t;   \

}



#define loop8(i)                                    \

{   t = rotr(t,  8); ; t = ls_box(t) ^ rco_tab[i];  \

    t ^= E_KEY[8 * i];     E_KEY[8 * i + 8] = t;    \

    t ^= E_KEY[8 * i + 1]; E_KEY[8 * i + 9] = t;    \

    t ^= E_KEY[8 * i + 2]; E_KEY[8 * i + 10] = t;   \

    t ^= E_KEY[8 * i + 3]; E_KEY[8 * i + 11] = t;   \

    t  = E_KEY[8 * i + 4] ^ ls_box(t);    \

    E_KEY[8 * i + 12] = t;                \

    t ^= E_KEY[8 * i + 5]; E_KEY[8 * i + 13] = t;   \

    t ^= E_KEY[8 * i + 6]; E_KEY[8 * i + 14] = t;   \

    t ^= E_KEY[8 * i + 7]; E_KEY[8 * i + 15] = t;   \

}



static int

aes_set_key(void *ctx_arg, const u8 *in_key, unsigned int key_len, u32 *flags)

{

	struct aes_ctx *ctx = ctx_arg;

	u32 i, t, u, v, w;



	if (key_len != 16 && key_len != 24 && key_len != 32) {

		*flags |= CRYPTO_TFM_RES_BAD_KEY_LEN;

		return -EINVAL;

	}



	ctx->key_length = key_len;



	E_KEY[0] = u32_in (in_key);

	E_KEY[1] = u32_in (in_key + 4);

	E_KEY[2] = u32_in (in_key + 8);

	E_KEY[3] = u32_in (in_key + 12);



	switch (key_len) {

	case 16:

		t = E_KEY[3];

		for (i = 0; i < 10; ++i)

			loop4 (i);

		break;



	case 24:

		E_KEY[4] = u32_in (in_key + 16);

		t = E_KEY[5] = u32_in (in_key + 20);

		for (i = 0; i < 8; ++i)

			loop6 (i);

		break;



	case 32:

		E_KEY[4] = u32_in (in_key + 16);

		E_KEY[5] = u32_in (in_key + 20);

		E_KEY[6] = u32_in (in_key + 24);

		t = E_KEY[7] = u32_in (in_key + 28);

		for (i = 0; i < 7; ++i)

			loop8 (i);

		break;

	}



	D_KEY[0] = E_KEY[0];

	D_KEY[1] = E_KEY[1];

	D_KEY[2] = E_KEY[2];

	D_KEY[3] = E_KEY[3];



	for (i = 4; i < key_len + 24; ++i) {

		imix_col (D_KEY[i], E_KEY[i]);

	}



	return 0;

}



/* encrypt a block of text */



#define f_nround(bo, bi, k) \

    f_rn(bo, bi, 0, k);     \

    f_rn(bo, bi, 1, k);     \

    f_rn(bo, bi, 2, k);     \

    f_rn(bo, bi, 3, k);     \

    k += 4



#define f_lround(bo, bi, k) \

    f_rl(bo, bi, 0, k);     \

    f_rl(bo, bi, 1, k);     \

    f_rl(bo, bi, 2, k);     \

    f_rl(bo, bi, 3, k)



static void aes_encrypt(void *ctx_arg, u8 *out, const u8 *in)

{

	const struct aes_ctx *ctx = ctx_arg;

	u32 b0[4], b1[4];

	const u32 *kp = E_KEY + 4;



	b0[0] = u32_in (in) ^ E_KEY[0];

	b0[1] = u32_in (in + 4) ^ E_KEY[1];

	b0[2] = u32_in (in + 8) ^ E_KEY[2];

	b0[3] = u32_in (in + 12) ^ E_KEY[3];



	if (ctx->key_length > 24) {

		f_nround (b1, b0, kp);

		f_nround (b0, b1, kp);

	}



	if (ctx->key_length > 16) {

		f_nround (b1, b0, kp);

		f_nround (b0, b1, kp);

	}



	f_nround (b1, b0, kp);

	f_nround (b0, b1, kp);

	f_nround (b1, b0, kp);

	f_nround (b0, b1, kp);

	f_nround (b1, b0, kp);

	f_nround (b0, b1, kp);

	f_nround (b1, b0, kp);

	f_nround (b0, b1, kp);

	f_nround (b1, b0, kp);

	f_lround (b0, b1, kp);



	u32_out (out, b0[0]);

	u32_out (out + 4, b0[1]);

	u32_out (out + 8, b0[2]);

	u32_out (out + 12, b0[3]);

}



/* decrypt a block of text */



#define i_nround(bo, bi, k) \

    i_rn(bo, bi, 0, k);     \

    i_rn(bo, bi, 1, k);     \

    i_rn(bo, bi, 2, k);     \

    i_rn(bo, bi, 3, k);     \

    k -= 4



#define i_lround(bo, bi, k) \

    i_rl(bo, bi, 0, k);     \

    i_rl(bo, bi, 1, k);     \

    i_rl(bo, bi, 2, k);     \

    i_rl(bo, bi, 3, k)



static void aes_decrypt(void *ctx_arg, u8 *out, const u8 *in)

{

	const struct aes_ctx *ctx = ctx_arg;

	u32 b0[4], b1[4];

	const int key_len = ctx->key_length;

	const u32 *kp = D_KEY + key_len + 20;



	b0[0] = u32_in (in) ^ E_KEY[key_len + 24];

	b0[1] = u32_in (in + 4) ^ E_KEY[key_len + 25];

	b0[2] = u32_in (in + 8) ^ E_KEY[key_len + 26];

	b0[3] = u32_in (in + 12) ^ E_KEY[key_len + 27];



	if (key_len > 24) {

		i_nround (b1, b0, kp);

		i_nround (b0, b1, kp);

	}



	if (key_len > 16) {

		i_nround (b1, b0, kp);

		i_nround (b0, b1, kp);

	}



	i_nround (b1, b0, kp);

	i_nround (b0, b1, kp);

	i_nround (b1, b0, kp);

	i_nround (b0, b1, kp);

	i_nround (b1, b0, kp);

	i_nround (b0, b1, kp);

	i_nround (b1, b0, kp);

	i_nround (b0, b1, kp);

	i_nround (b1, b0, kp);

	i_lround (b0, b1, kp);



	u32_out (out, b0[0]);

	u32_out (out + 4, b0[1]);

	u32_out (out + 8, b0[2]);

	u32_out (out + 12, b0[3]);

}





static struct crypto_alg aes_alg = {

	.cra_name		=	"aes",

	.cra_flags		=	CRYPTO_ALG_TYPE_CIPHER,

	.cra_blocksize		=	AES_BLOCK_SIZE,

	.cra_ctxsize		=	sizeof(struct aes_ctx),

	.cra_module		=	THIS_MODULE,

	.cra_list		=	LIST_HEAD_INIT(aes_alg.cra_list),

	.cra_u			=	{

		.cipher = {

			.cia_min_keysize	=	AES_MIN_KEY_SIZE,

			.cia_max_keysize	=	AES_MAX_KEY_SIZE,

			.cia_setkey		=	aes_set_key,

			.cia_encrypt		=	aes_encrypt,

			.cia_decrypt		=	aes_decrypt

		}

	}

};



static int __init aes_init(void)

{

	gen_tabs();

	return crypto_register_alg(&aes_alg);

}



static void __exit aes_fini(void)

{

	crypto_unregister_alg(&aes_alg);

}



module_init(aes_init);

module_exit(aes_fini);



MODULE_DESCRIPTION("Rijndael (AES) Cipher Algorithm");

MODULE_LICENSE("Dual BSD/GPL");

drivers/staging/rtl8192u/ieee80211/arc4.c

deleted100644 → 0
+0 −103
Original line number Diff line number Diff line 
/*

 * Cryptographic API

 *

 * ARC4 Cipher Algorithm

 *

 * Jon Oberheide <jon@oberheide.org>

 *

 * This program is free software; you can redistribute it and/or modify

 * it under the terms of the GNU General Public License as published by

 * the Free Software Foundation; either version 2 of the License, or

 * (at your option) any later version.

 *

 */

#include <linux/module.h>

#include <linux/init.h>

#include "rtl_crypto.h"



#define ARC4_MIN_KEY_SIZE	1

#define ARC4_MAX_KEY_SIZE	256

#define ARC4_BLOCK_SIZE		1



struct arc4_ctx {

	u8 S[256];

	u8 x, y;

};



static int arc4_set_key(void *ctx_arg, const u8 *in_key, unsigned int key_len, u32 *flags)

{

	struct arc4_ctx *ctx = ctx_arg;

	int i, j = 0, k = 0;



	ctx->x = 1;

	ctx->y = 0;



	for(i = 0; i < 256; i++)

		ctx->S[i] = i;



	for(i = 0; i < 256; i++)

	{

		u8 a = ctx->S[i];

		j = (j + in_key[k] + a) & 0xff;

		ctx->S[i] = ctx->S[j];

		ctx->S[j] = a;

		if((unsigned int)++k >= key_len)

			k = 0;

	}



	return 0;

}



static void arc4_crypt(void *ctx_arg, u8 *out, const u8 *in)

{

	struct arc4_ctx *ctx = ctx_arg;



	u8 *const S = ctx->S;

	u8 x = ctx->x;

	u8 y = ctx->y;

	u8 a, b;



	a = S[x];

	y = (y + a) & 0xff;

	b = S[y];

	S[x] = b;

	S[y] = a;

	x = (x + 1) & 0xff;

	*out++ = *in ^ S[(a + b) & 0xff];



	ctx->x = x;

	ctx->y = y;

}



static struct crypto_alg arc4_alg = {

	.cra_name		=	"arc4",

	.cra_flags		=	CRYPTO_ALG_TYPE_CIPHER,

	.cra_blocksize		=	ARC4_BLOCK_SIZE,

	.cra_ctxsize		=	sizeof(struct arc4_ctx),

	.cra_module		=	THIS_MODULE,

	.cra_list		=	LIST_HEAD_INIT(arc4_alg.cra_list),

	.cra_u			=	{ .cipher = {

	.cia_min_keysize	=	ARC4_MIN_KEY_SIZE,

	.cia_max_keysize	=	ARC4_MAX_KEY_SIZE,

	.cia_setkey		=	arc4_set_key,

	.cia_encrypt		=	arc4_crypt,

	.cia_decrypt		=	arc4_crypt } }

};



static int __init arc4_init(void)

{

	return crypto_register_alg(&arc4_alg);

}





static void __exit arc4_exit(void)

{

	crypto_unregister_alg(&arc4_alg);

}



module_init(arc4_init);

module_exit(arc4_exit);



MODULE_LICENSE("GPL");

MODULE_DESCRIPTION("ARC4 Cipher Algorithm");

MODULE_AUTHOR("Jon Oberheide <jon@oberheide.org>");

drivers/staging/rtl8192u/ieee80211/autoload.c

deleted100644 → 0
+0 −40
Original line number Diff line number Diff line 
/*

 * Cryptographic API.

 *

 * Algorithm autoloader.

 *

 * Copyright (c) 2002 James Morris <jmorris@intercode.com.au>

 *

 * This program is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License as published by the Free

 * Software Foundation; either version 2 of the License, or (at your option)

 * any later version.

 *

 */

#include "kmap_types.h"



#include <linux/kernel.h>

//#include <linux/crypto.h>

#include "rtl_crypto.h"

#include <linux/string.h>

#include <linux/kmod.h>

#include "internal.h"



/*

 * A far more intelligent version of this is planned.  For now, just

 * try an exact match on the name of the algorithm.

 */

void crypto_alg_autoload(const char *name)

{

	request_module(name);

}



struct crypto_alg *crypto_alg_mod_lookup(const char *name)

{

	struct crypto_alg *alg = crypto_alg_lookup(name);

	if (alg == NULL) {

		crypto_alg_autoload(name);

		alg = crypto_alg_lookup(name);

	}

	return alg;

}

drivers/staging/rtl8192u/ieee80211/cipher.c

deleted100644 → 0
+0 −298

File deleted.

Preview size limit exceeded, changes collapsed.