2017-05-26 04:48:44 +08:00
|
|
|
/*
|
|
|
|
cdecoder.c - c source to a base64 decoding algorithm implementation
|
|
|
|
|
|
|
|
This is part of the libb64 project, and has been placed in the public domain.
|
|
|
|
For details, see http://sourceforge.net/projects/libb64
|
|
|
|
*/
|
|
|
|
|
2022-07-26 08:08:32 +08:00
|
|
|
#include "libb64/cdecode.h"
|
2017-05-26 04:48:44 +08:00
|
|
|
|
2022-09-17 02:20:34 +08:00
|
|
|
int base64_decode_value(int value_in) {
|
|
|
|
static const int decoding[] = { 62, -1, -1, -1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -2, -1,
|
|
|
|
-1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
|
|
|
|
18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, -1, 26, 27, 28, 29, 30, 31,
|
|
|
|
32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51 };
|
2022-09-21 05:49:22 +08:00
|
|
|
static const int decoding_size = sizeof(decoding) / sizeof(decoding[0]);
|
2017-05-26 04:48:44 +08:00
|
|
|
value_in -= 43;
|
2022-09-21 05:49:22 +08:00
|
|
|
if (value_in < 0 || value_in >= decoding_size)
|
2017-05-26 04:48:44 +08:00
|
|
|
return -1;
|
2022-09-17 02:20:34 +08:00
|
|
|
return decoding[value_in];
|
2017-05-26 04:48:44 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void base64_init_decodestate(base64_decodestate* state_in) {
|
|
|
|
state_in->step = step_a;
|
|
|
|
state_in->plainchar = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int base64_decode_block(const char* code_in, const int length_in, char* plaintext_out, base64_decodestate* state_in) {
|
|
|
|
const char* codechar = code_in;
|
|
|
|
char* plainchar = plaintext_out;
|
2022-09-17 02:20:34 +08:00
|
|
|
int fragment = 0;
|
2017-05-26 04:48:44 +08:00
|
|
|
|
|
|
|
*plainchar = state_in->plainchar;
|
|
|
|
|
|
|
|
switch (state_in->step) {
|
|
|
|
while (1) {
|
|
|
|
case step_a:
|
|
|
|
do {
|
|
|
|
if (codechar == code_in + length_in) {
|
|
|
|
state_in->step = step_a;
|
|
|
|
state_in->plainchar = *plainchar;
|
|
|
|
return plainchar - plaintext_out;
|
|
|
|
}
|
2022-09-17 02:20:34 +08:00
|
|
|
fragment = base64_decode_value(*codechar++);
|
2017-05-26 04:48:44 +08:00
|
|
|
} while (fragment < 0);
|
2022-09-17 02:20:34 +08:00
|
|
|
*plainchar = (char)((fragment & 0x03f) << 2);
|
2017-05-26 04:48:44 +08:00
|
|
|
case step_b:
|
|
|
|
do {
|
|
|
|
if (codechar == code_in + length_in) {
|
|
|
|
state_in->step = step_b;
|
|
|
|
state_in->plainchar = *plainchar;
|
|
|
|
return plainchar - plaintext_out;
|
|
|
|
}
|
2022-09-17 02:20:34 +08:00
|
|
|
fragment = base64_decode_value(*codechar++);
|
2017-05-26 04:48:44 +08:00
|
|
|
} while (fragment < 0);
|
2022-09-17 02:20:34 +08:00
|
|
|
*plainchar++ |= (char)((fragment & 0x030) >> 4);
|
|
|
|
*plainchar = (char)((fragment & 0x00f) << 4);
|
2017-05-26 04:48:44 +08:00
|
|
|
case step_c:
|
|
|
|
do {
|
|
|
|
if (codechar == code_in + length_in) {
|
|
|
|
state_in->step = step_c;
|
|
|
|
state_in->plainchar = *plainchar;
|
|
|
|
return plainchar - plaintext_out;
|
|
|
|
}
|
2022-09-17 02:20:34 +08:00
|
|
|
fragment = base64_decode_value(*codechar++);
|
2017-05-26 04:48:44 +08:00
|
|
|
} while (fragment < 0);
|
2022-09-17 02:20:34 +08:00
|
|
|
*plainchar++ |= (char)((fragment & 0x03c) >> 2);
|
|
|
|
*plainchar = (char)((fragment & 0x003) << 6);
|
2017-05-26 04:48:44 +08:00
|
|
|
case step_d:
|
|
|
|
do {
|
|
|
|
if (codechar == code_in + length_in) {
|
|
|
|
state_in->step = step_d;
|
|
|
|
state_in->plainchar = *plainchar;
|
|
|
|
return plainchar - plaintext_out;
|
|
|
|
}
|
2022-09-17 02:20:34 +08:00
|
|
|
fragment = base64_decode_value(*codechar++);
|
2017-05-26 04:48:44 +08:00
|
|
|
} while (fragment < 0);
|
2022-09-17 02:20:34 +08:00
|
|
|
*plainchar++ |= (char)((fragment & 0x03f));
|
2017-05-26 04:48:44 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
/* control should not reach here */
|
|
|
|
return plainchar - plaintext_out;
|
|
|
|
}
|