base64编码解码函数

base64位编解码函数

void encode(byte* input ,byte*& output)
{
	char arr[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
	int len = strlen((char*)input);
	int remain = len % 3;
	if (remain == 0)
	{
		output = new byte[len / 3 * 4 + 1]; memset(output, 0, len / 3 * 4 + 1);
		for (int i = 0, j = 0; i<len; i += 3, j += 4)
		{
			byte a1 = (input[i] >> 2) & 0x3f;
			byte a2 = (((input[i] << 6) | (input[i + 1] >> 4 << 2)) >> 2) & 0x3f;
			byte a3 = (((input[i + 1] << 4) | (input[i + 2] >> 6 << 2)) >> 2) & 0x3f;
			byte a4 = (input[i + 2] << 2 >> 2) & 0x3f;
			output[j] = arr[a1];
			output[j + 1] = arr[a2];
			output[j + 2] = arr[a3];
			output[j + 3] = arr[a4];
		}
	}
	else if (remain == 1)
	{
		output = new byte[len / 3 * 4 + 4 + 1]; memset(output, 0, len / 3 * 4 + 4 + 1);
		int i = 0, j = 0;
		for (; i<len - 3; i += 3, j += 4)
		{
			byte a1 = (input[i] >> 2) & 0x3f;
			byte a2 = (((input[i] << 6) | (input[i + 1] >> 4 << 2)) >> 2) & 0x3f;
			byte a3 = (((input[i + 1] << 4) | (input[i + 2] >> 6 << 2)) >> 2) & 0x3f;
			byte a4 = (input[i + 2] << 2 >> 2) & 0x3f;
			output[j] = arr[a1];
			output[j + 1] = arr[a2];
			output[j + 2] = arr[a3];
			output[j + 3] = arr[a4];
		}
		byte a1 = (input[i] >> 2) & 0x3f;
		byte a2 = (((input[i] << 6) | 0x00) >> 2) & 0x3f;
		output[j] = arr[a1];
		output[j + 1] = arr[a2];
		output[j + 2] = '=';
		output[j + 3] = '=';
	}
	else if (remain == 2)
	{
		output = new byte[len / 3 * 4 + 4 + 1]; memset(output, 0, len / 3 * 4 + 4 + 1);
		int i = 0, j = 0;
		for (; i<len - 3; i += 3, j += 4)
		{
			byte a1 = (input[i] >> 2) & 0x3f;
			byte a2 = (((input[i] << 6) | (input[i + 1] >> 4 << 2)) >> 2) & 0x3f;
			byte a3 = (((input[i + 1] << 4) | (input[i + 2] >> 6 << 2)) >> 2) & 0x3f;
			byte a4 = (input[i + 2] << 2 >> 2) & 0x3f;
			output[j] = arr[a1];
			output[j + 1] = arr[a2];
			output[j + 2] = arr[a3];
			output[j + 3] = arr[a4];
		}
		byte a1 = (input[i] >> 2) & 0x3f;
		byte a2 = (((input[i] << 6) | input[i + 1] >> 4 << 2) >> 2) & 0x3f;
		byte a3 = (((input[i + 1] << 4) | 0x00) >> 2) & 0x3f;
		output[j] = arr[a1];
		output[j + 1] = arr[a2];
		output[j + 2] = arr[a3];
		output[j + 3] = '=';
	}
}
byte find(byte c)
{
	char arr[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
	for (byte i = 0; i<64; i++)
	{
		if (arr[i] == c)
		{
			return i;
		}
	}
}
void decode(byte* input, byte*& output)
{
	int len = strlen((char*)input);
	if (input[len - 1] != '=')
	{
		output = new byte[len / 4 * 3 + 1];
		memset(output, 0, len / 4 * 3 + 1);
		for (int i = 0, j = 0; i<len; i += 4, j += 3)
		{
			byte a1 = (find(input[i]) << 2) | (find(input[i + 1]) >> 4);
			byte a2 = (find(input[i + 1]) << 4) | (find(input[i + 2]) >> 2);
			byte a3 = (find(input[i + 2]) << 6) | find(input[i + 3]);
			output[j] = a1;
			output[j + 1] = a2;
			output[j + 2] = a3;
		}
	}
	else if (input[len - 1] == '='&&input[len - 2] == '=')
	{
		output = new byte[len / 4 * 3 - 2 + 1];
		memset(output, 0, len / 4 * 3 - 2 + 1);
		int i = 0, j = 0;
		for (; i<len - 4; i += 4, j += 3)
		{
			byte a1 = (find(input[i]) << 2) | (find(input[i + 1]) >> 4);
			byte a2 = (find(input[i + 1]) << 4) | (find(input[i + 2]) >> 2);
			byte a3 = (find(input[i + 2]) << 6) | find(input[i + 3]);
			output[j] = a1;
			output[j + 1] = a2;
			output[j + 2] = a3;
		}
		byte a1 = (find(input[i]) << 2) | (find(input[i + 1]) >> 4);
		output[j] = a1;
	}
	else if (input[len - 1] == '='&&input[len - 2] != '=')
	{
		output = new byte[len / 4 * 3 - 1 + 1];
		memset(output, 0, len / 4 * 3 - 1 + 1);
		int i = 0, j = 0;
		for (; i<len - 4; i += 4, j += 3)
		{
			byte a1 = (find(input[i]) << 2) | (find(input[i + 1]) >> 4);
			byte a2 = (find(input[i + 1]) << 4) | (find(input[i + 2]) >> 2);
			byte a3 = (find(input[i + 2]) << 6) | find(input[i + 3]);
			output[j] = a1;
			output[j + 1] = a2;
			output[j + 2] = a3;
		}
		byte a1 = (find(input[i]) << 2) | (find(input[i + 1]) >> 4);
		byte a2 = (find(input[i + 1]) << 4) | (find(input[i + 2]) >> 2);
		output[j] = a1;
		output[j + 1] = a2;
	}
}