1 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
4 * This package is an SSL implementation written
5 * by Eric Young (eay@cryptsoft.com).
6 * The implementation was written so as to conform with Netscapes SSL.
8 * This library is free for commercial and non-commercial use as long as
9 * the following conditions are aheared to. The following conditions
10 * apply to all code found in this distribution, be it the RC4, RSA,
11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
12 * included with this distribution is covered by the same copyright terms
13 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15 * Copyright remains Eric Young's, and as such any Copyright notices in
16 * the code are not to be removed.
17 * If this package is used in a product, Eric Young should be given attribution
18 * as the author of the parts of the library used.
19 * This can be in the form of a textual message at program startup or
20 * in documentation (online or textual) provided with the package.
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
25 * 1. Redistributions of source code must retain the copyright
26 * notice, this list of conditions and the following disclaimer.
27 * 2. Redistributions in binary form must reproduce the above copyright
28 * notice, this list of conditions and the following disclaimer in the
29 * documentation and/or other materials provided with the distribution.
30 * 3. All advertising materials mentioning features or use of this software
31 * must display the following acknowledgement:
32 * "This product includes cryptographic software written by
33 * Eric Young (eay@cryptsoft.com)"
34 * The word 'cryptographic' can be left out if the rouines from the library
35 * being used are not cryptographic related :-).
36 * 4. If you include any Windows specific code (or a derivative thereof) from
37 * the apps directory (application code) you must include an acknowledgement:
38 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
52 * The licence and distribution terms for any publically available version or
53 * derivative of this code cannot be changed. i.e. this code cannot simply be
54 * copied and put under another distribution licence
55 * [including the GNU Public Licence.] */
57 #include <openssl/base64.h>
62 static const unsigned char data_bin2ascii[65] =
63 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
65 #define conv_bin2ascii(a) (data_bin2ascii[(a) & 0x3f])
66 /* TODO(davidben): This doesn't error on bytes above 127. */
67 #define conv_ascii2bin(a) (data_ascii2bin[(a) & 0x7f])
71 * left over chars are set to =
76 #define BIN_PER_LINE (64/4*3)
77 #define CHUNKS_PER_LINE (64/4)
78 #define CHAR_PER_LINE (64+1)
81 * 0xF1 is ignore but next needs to be 0xF0 (for \r\n processing).
83 * 0xE0 is ignore at start of line.
90 #define B64_ERROR 0xFF
91 #define B64_NOT_BASE64(a) (((a) | 0x13) == 0xF3)
93 static const unsigned char data_ascii2bin[128] = {
94 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xE0, 0xF0, 0xFF,
95 0xFF, 0xF1, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
96 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xE0, 0xFF, 0xFF, 0xFF,
97 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x3E, 0xFF, 0xF2, 0xFF, 0x3F,
98 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3A, 0x3B, 0x3C, 0x3D, 0xFF, 0xFF,
99 0xFF, 0x00, 0xFF, 0xFF, 0xFF, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06,
100 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0x10, 0x11, 0x12,
101 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
102 0xFF, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x20, 0x21, 0x22, 0x23, 0x24,
103 0x25, 0x26, 0x27, 0x28, 0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E, 0x2F, 0x30,
104 0x31, 0x32, 0x33, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
107 void EVP_EncodeInit(EVP_ENCODE_CTX *ctx) {
113 void EVP_EncodeUpdate(EVP_ENCODE_CTX *ctx, uint8_t *out, int *out_len,
114 const uint8_t *in, size_t in_len) {
123 assert(ctx->length <= sizeof(ctx->enc_data));
125 if (ctx->num + in_len < ctx->length) {
126 memcpy(&ctx->enc_data[ctx->num], in, in_len);
131 i = ctx->length - ctx->num;
132 memcpy(&ctx->enc_data[ctx->num], in, i);
135 j = EVP_EncodeBlock(out, ctx->enc_data, ctx->length);
142 while (in_len >= ctx->length) {
143 j = EVP_EncodeBlock(out, in, ctx->length);
145 in_len -= ctx->length;
152 memcpy(&ctx->enc_data[0], in, in_len);
158 void EVP_EncodeFinal(EVP_ENCODE_CTX *ctx, uint8_t *out, int *out_len) {
162 ret = EVP_EncodeBlock(out, ctx->enc_data, ctx->num);
170 size_t EVP_EncodeBlock(uint8_t *dst, const uint8_t *src, size_t src_len) {
172 size_t remaining = src_len, ret = 0;
175 if (remaining >= 3) {
176 l = (((uint32_t)src[0]) << 16L) | (((uint32_t)src[1]) << 8L) | src[2];
177 *(dst++) = conv_bin2ascii(l >> 18L);
178 *(dst++) = conv_bin2ascii(l >> 12L);
179 *(dst++) = conv_bin2ascii(l >> 6L);
180 *(dst++) = conv_bin2ascii(l);
183 l = ((uint32_t)src[0]) << 16L;
184 if (remaining == 2) {
185 l |= ((uint32_t)src[1] << 8L);
188 *(dst++) = conv_bin2ascii(l >> 18L);
189 *(dst++) = conv_bin2ascii(l >> 12L);
190 *(dst++) = (remaining == 1) ? '=' : conv_bin2ascii(l >> 6L);
202 void EVP_DecodeInit(EVP_ENCODE_CTX *ctx) {
209 int EVP_DecodeUpdate(EVP_ENCODE_CTX *ctx, uint8_t *out, int *out_len,
210 const uint8_t *in, size_t in_len) {
211 int seof = -1, eof = 0, rv = -1, v, tmp, exp_nl;
213 unsigned i, n, ln, ret = 0;
218 exp_nl = ctx->expect_nl;
220 /* last line of input. */
221 if (in_len == 0 || (n == 0 && conv_ascii2bin(in[0]) == B64_EOF)) {
226 /* We parse the input data */
227 for (i = 0; i < in_len; i++) {
228 /* If the current line is > 80 characters, scream alot */
234 /* Get char and put it into the buffer */
236 v = conv_ascii2bin(tmp);
237 /* only save the good data :-) */
238 if (!B64_NOT_BASE64(v)) {
239 assert(n < sizeof(ctx->enc_data));
242 } else if (v == B64_ERROR) {
247 /* have we seen a '=' which is 'definitly' the last
248 * input line. seof will point to the character that
249 * holds it. and eof will hold how many characters to
257 /* There are, at most, two equals signs at the end of base64 data. */
280 /* If we are at the end of input and it looks like a
281 * line, process it. */
282 if ((i + 1) == in_len && (((n & 3) == 0) || eof)) {
284 /* In case things were given us in really small
285 records (so two '=' were given in separate
286 updates), eof may contain the incorrect number
287 of ending bytes to skip, so let's redo the count */
289 if (d[n - 1] == '=') {
292 if (d[n - 2] == '=') {
295 /* There will never be more than two '=' */
298 if ((v == B64_EOF && (n & 3) == 0) || n >= 64) {
299 /* This is needed to work correctly on 64 byte input
300 * lines. We process the line and then need to
302 if (v != B64_EOF && n >= 64) {
306 v = EVP_DecodeBlock(out, d, n);
318 /* This is the case where we have had a short
319 * but valid input line */
320 if (v < (int)ctx->length && eof) {
340 ctx->expect_nl = exp_nl;
344 int EVP_DecodeFinal(EVP_ENCODE_CTX *ctx, uint8_t *out, int *outl) {
349 i = EVP_DecodeBlock(out, ctx->enc_data, ctx->num);
361 ssize_t EVP_DecodeBlock(uint8_t *dst, const uint8_t *src, size_t src_len) {
366 /* trim white space from the start of the line. */
367 while (conv_ascii2bin(*src) == B64_WS && src_len > 0) {
372 /* strip off stuff at the end of the line
373 * ascii2bin values B64_WS, B64_EOLN, B64_EOLN and B64_EOF */
374 while (src_len > 3 && B64_NOT_BASE64(conv_ascii2bin(src[src_len - 1]))) {
378 if (src_len % 4 != 0) {
382 for (i = 0; i < src_len; i += 4) {
383 a = conv_ascii2bin(*(src++));
384 b = conv_ascii2bin(*(src++));
385 c = conv_ascii2bin(*(src++));
386 d = conv_ascii2bin(*(src++));
387 if ((a & 0x80) || (b & 0x80) || (c & 0x80) || (d & 0x80)) {
390 l = ((((uint32_t)a) << 18L) | (((uint32_t)b) << 12L) |
391 (((uint32_t)c) << 6L) | (((uint32_t)d)));
392 *(dst++) = (uint8_t)(l >> 16L) & 0xff;
393 *(dst++) = (uint8_t)(l >> 8L) & 0xff;
394 *(dst++) = (uint8_t)(l) & 0xff;