|
| 1 | +#include "string.h" |
| 2 | +#include "base64.h" |
| 3 | + |
| 4 | +static const char table[] = |
| 5 | + "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; |
| 6 | + |
| 7 | +// supports regular and URL-safe base64 |
| 8 | +static const int8_t unbase64_table[256] = { |
| 9 | + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -2, -1, -1, -2, -1, -1, |
| 10 | + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 11 | + -2, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, 62, -1, 63, |
| 12 | + 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1, |
| 13 | + -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, |
| 14 | + 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, 63, |
| 15 | + -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, |
| 16 | + 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1, |
| 17 | + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 18 | + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 19 | + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 20 | + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 21 | + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 22 | + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 23 | + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 24 | + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 |
| 25 | +}; |
| 26 | + |
| 27 | +size_t base64_encode(const uint8_t* src, size_t len, char* dst) { |
| 28 | + size_t slen, dlen; |
| 29 | + unsigned i, k, n, a, b, c; |
| 30 | + if (src == NULL) { |
| 31 | + return 0; |
| 32 | + } |
| 33 | + |
| 34 | + if (len == -1) { |
| 35 | + slen = strlen((const char*)src); |
| 36 | + } else { |
| 37 | + slen = len; |
| 38 | + } |
| 39 | + |
| 40 | + dlen = ((slen + 2 - ((slen + 2) % 3)) / 3 * 4); |
| 41 | + |
| 42 | + if (dst == NULL) { |
| 43 | + return dlen; |
| 44 | + } |
| 45 | + |
| 46 | + i = 0; |
| 47 | + k = 0; |
| 48 | + n = slen / 3 * 3; |
| 49 | + |
| 50 | + while (i < n) { |
| 51 | + a = src[i + 0] & 0xff; |
| 52 | + b = src[i + 1] & 0xff; |
| 53 | + c = src[i + 2] & 0xff; |
| 54 | + |
| 55 | + dst[k + 0] = table[a >> 2]; |
| 56 | + dst[k + 1] = table[((a & 3) << 4) | (b >> 4)]; |
| 57 | + dst[k + 2] = table[((b & 0x0f) << 2) | (c >> 6)]; |
| 58 | + dst[k + 3] = table[c & 0x3f]; |
| 59 | + |
| 60 | + i += 3; |
| 61 | + k += 4; |
| 62 | + } |
| 63 | + |
| 64 | + if (n != slen) { |
| 65 | + switch (slen - n) { |
| 66 | + case 1: |
| 67 | + a = src[i + 0] & 0xff; |
| 68 | + dst[k + 0] = table[a >> 2]; |
| 69 | + dst[k + 1] = table[(a & 3) << 4]; |
| 70 | + dst[k + 2] = '='; |
| 71 | + dst[k + 3] = '='; |
| 72 | + break; |
| 73 | + |
| 74 | + case 2: |
| 75 | + a = src[i + 0] & 0xff; |
| 76 | + b = src[i + 1] & 0xff; |
| 77 | + dst[k + 0] = table[a >> 2]; |
| 78 | + dst[k + 1] = table[((a & 3) << 4) | (b >> 4)]; |
| 79 | + dst[k + 2] = table[(b & 0x0f) << 2]; |
| 80 | + dst[k + 3] = '='; |
| 81 | + break; |
| 82 | + } |
| 83 | + } |
| 84 | + |
| 85 | + return dlen; |
| 86 | +} |
| 87 | + |
| 88 | +static int base64_decode_group_slow(char* const dst, const size_t dstlen, |
| 89 | + const char* const src, const size_t srclen, |
| 90 | + size_t* const i, size_t* const k) { |
| 91 | + uint8_t hi; |
| 92 | + uint8_t lo; |
| 93 | + uint8_t c; |
| 94 | +#define V(expr) \ |
| 95 | + for (;;) { \ |
| 96 | + c = src[*i]; \ |
| 97 | + lo = unbase64_table[c]; \ |
| 98 | + *i += 1; \ |
| 99 | + if (lo < 64) \ |
| 100 | + break; /* Legal character. */ \ |
| 101 | + if (c == '=' || *i >= srclen) \ |
| 102 | + return 0; /* Stop decoding. */ \ |
| 103 | + } \ |
| 104 | + expr; \ |
| 105 | + if (*i >= srclen) \ |
| 106 | + return 0; \ |
| 107 | + if (*k >= dstlen) \ |
| 108 | + return 0; \ |
| 109 | + hi = lo; |
| 110 | + V((void)0); |
| 111 | + V(dst[(*k)++] = ((hi & 0x3F) << 2) | ((lo & 0x30) >> 4)); |
| 112 | + V(dst[(*k)++] = ((hi & 0x0F) << 4) | ((lo & 0x3C) >> 2)); |
| 113 | + V(dst[(*k)++] = ((hi & 0x03) << 6) | ((lo & 0x3F) >> 0)); |
| 114 | +#undef V |
| 115 | + return 1; // Continue decoding. |
| 116 | +} |
| 117 | + |
| 118 | +size_t base64_decode(const char* src, size_t len, uint8_t* dst) { |
| 119 | + size_t slen, dlen, remainder, size; |
| 120 | + size_t available, max_k, max_i, i, k, v; |
| 121 | + |
| 122 | + if (src == NULL) { |
| 123 | + return 0; |
| 124 | + } |
| 125 | + |
| 126 | + if (len == -1) { |
| 127 | + slen = strlen(src); |
| 128 | + } else { |
| 129 | + slen = len; |
| 130 | + } |
| 131 | + |
| 132 | + if (slen == 0) { |
| 133 | + dlen = 0; |
| 134 | + } else { |
| 135 | + if (src[slen - 1] == '=') slen--; |
| 136 | + if (slen > 0 && src[slen - 1] == '=') slen--; |
| 137 | + |
| 138 | + size = slen; |
| 139 | + remainder = size % 4; |
| 140 | + |
| 141 | + size = (size / 4) * 3; |
| 142 | + if (remainder) { |
| 143 | + if (size == 0 && remainder == 1) { |
| 144 | + size = 0; |
| 145 | + } else { |
| 146 | + size += 1 + (remainder == 3); |
| 147 | + } |
| 148 | + } |
| 149 | + |
| 150 | + dlen = size; |
| 151 | + } |
| 152 | + |
| 153 | + if (dst == NULL) { |
| 154 | + return dlen; |
| 155 | + } |
| 156 | + |
| 157 | + available = dlen; |
| 158 | + max_k = available / 3 * 3; |
| 159 | + max_i = slen / 4 * 4; |
| 160 | + i = 0; |
| 161 | + k = 0; |
| 162 | + while (i < max_i && k < max_k) { |
| 163 | + v = unbase64_table[src[i + 0]] << 24 | |
| 164 | + unbase64_table[src[i + 1]] << 16 | |
| 165 | + unbase64_table[src[i + 2]] << 8 | |
| 166 | + unbase64_table[src[i + 3]]; |
| 167 | + // If MSB is set, input contains whitespace or is not valid base64. |
| 168 | + if (v & 0x80808080) { |
| 169 | + if (!base64_decode_group_slow((char*)dst, dlen, src, slen, &i, &k)) |
| 170 | + return k; |
| 171 | + max_i = i + (slen - i) / 4 * 4; // Align max_i again. |
| 172 | + } else { |
| 173 | + dst[k + 0] = ((v >> 22) & 0xFC) | ((v >> 20) & 0x03); |
| 174 | + dst[k + 1] = ((v >> 12) & 0xF0) | ((v >> 10) & 0x0F); |
| 175 | + dst[k + 2] = ((v >> 2) & 0xC0) | ((v >> 0) & 0x3F); |
| 176 | + i += 4; |
| 177 | + k += 3; |
| 178 | + } |
| 179 | + } |
| 180 | + if (i < slen && k < dlen) { |
| 181 | + base64_decode_group_slow((char*)dst, dlen, src, slen, &i, &k); |
| 182 | + } |
| 183 | + return k; |
| 184 | +} |
0 commit comments