Use tables symetry to reduce their size by half.
[ffmpeg-lucabe.git] / libavutil / base64.c
bloba6b44fb71c3b14848b1f905f160b033089f43870
1 /*
2 * Base64.c
3 * Copyright (c) 2006 Ryan Martell. (rdm4@martellventures.com)
5 * This file is part of FFmpeg.
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
22 /**
23 * @file base64.c
24 * @brief Base64 Encode/Decode
25 * @author Ryan Martell <rdm4@martellventures.com> (with lots of Michael)
28 #include "common.h"
29 #include "base64.h"
31 /* ---------------- private code */
32 static const uint8_t map2[] =
34 0x3e, 0xff, 0xff, 0xff, 0x3f, 0x34, 0x35, 0x36,
35 0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0xff,
36 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00, 0x01,
37 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09,
38 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10, 0x11,
39 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19,
40 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x1a, 0x1b,
41 0x1c, 0x1d, 0x1e, 0x1f, 0x20, 0x21, 0x22, 0x23,
42 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2a, 0x2b,
43 0x2c, 0x2d, 0x2e, 0x2f, 0x30, 0x31, 0x32, 0x33
46 int av_base64_decode(uint8_t * out, const char *in, int out_length)
48 int i, v;
49 uint8_t *dst = out;
51 v = 0;
52 for (i = 0; in[i] && in[i] != '='; i++) {
53 unsigned int index= in[i]-43;
54 if (index>=(sizeof(map2)/sizeof(map2[0])) || map2[index] == 0xff)
55 return -1;
56 v = (v << 6) + map2[index];
57 if (i & 3) {
58 if (dst - out < out_length) {
59 *dst++ = v >> (6 - 2 * (i & 3));
64 return dst - out;
67 /*****************************************************************************
68 * b64_encode: stolen from VLC's http.c
69 * simplified by michael
70 * fixed edge cases and made it work from data (vs. strings) by ryan.
71 *****************************************************************************/
73 char *av_base64_encode(char * buf, int buf_len, const uint8_t * src, int len)
75 static const char b64[] =
76 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
77 char *ret, *dst;
78 unsigned i_bits = 0;
79 int i_shift = 0;
80 int bytes_remaining = len;
82 if (len >= UINT_MAX / 4 ||
83 buf_len < len * 4 / 3 + 12)
84 return NULL;
85 ret = dst = buf;
86 while (bytes_remaining) {
87 i_bits = (i_bits << 8) + *src++;
88 bytes_remaining--;
89 i_shift += 8;
91 do {
92 *dst++ = b64[(i_bits << 6 >> i_shift) & 0x3f];
93 i_shift -= 6;
94 } while (i_shift > 6 || (bytes_remaining == 0 && i_shift > 0));
96 while ((dst - ret) & 3)
97 *dst++ = '=';
98 *dst = '\0';
100 return ret;
103 // #define TEST_BASE64
105 #ifdef TEST_BASE64
106 #include "avutil.h"
108 int b64test()
110 int numerr = 0;
111 int len;
112 int numtest = 1;
113 uint8_t decode[1000];
114 struct test {
115 void *data;
116 int len;
117 const char *result;
118 } *t, tests[] = {
120 "", 0, ""}, {
121 "1", 1, "MQ=="}, {
122 "22", 2, "MjI="}, {
123 "333", 3, "MzMz"}, {
124 "4444", 4, "NDQ0NA=="}, {
125 "55555", 5, "NTU1NTU="}, {
126 "abc:def", 7, "YWJjOmRlZg=="}, {
127 NULL}
129 for (t = tests; t->data; t++) {
130 char *str;
132 av_log(NULL, AV_LOG_ERROR, "Encoding %s...\n", (char *) t->data);
133 str = av_base64_encode(t->data, t->len);
134 if (str) {
135 av_log(NULL, AV_LOG_ERROR, "Encoded to %s...\n", str);
136 if (strcmp(str, t->result) != 0) {
137 av_log(NULL, AV_LOG_ERROR, "failed test %d: %s != %s\n",
138 numtest, str, t->result);
139 numerr++;
141 av_free(str);
144 av_log(NULL, AV_LOG_ERROR, "Done encoding, about to decode...\n");
145 len = av_base64_decode(decode, t->result, sizeof(decode));
146 if (len != t->len) {
147 av_log(NULL, AV_LOG_ERROR, "failed test %d: len %d != %d\n",
148 numtest, len, t->len);
149 numerr++;
150 } else if (memcmp(decode, t->data, t->len) != 0) {
151 av_log(NULL, AV_LOG_ERROR, "failed test %d: data\n", numtest);
152 numerr++;
153 } else {
154 av_log(NULL, AV_LOG_ERROR, "Decoded to %s\n",
155 (char *) t->data);
157 numtest++;
160 #undef srand
161 #undef rand
164 int test_count;
165 srand(123141); // time(NULL));
166 for (test_count = 0; test_count < 100; test_count++) {
167 int size = rand() % 1024;
168 int ii;
169 uint8_t *data;
170 char *encoded_result;
172 av_log(NULL, AV_LOG_ERROR, "Test %d: Size %d bytes...",
173 test_count, size);
174 data = (uint8_t *) av_malloc(size);
175 for (ii = 0; ii < size; ii++) {
176 data[ii] = rand() % 255;
179 encoded_result = av_base64_encode(data, size);
180 if (encoded_result) {
181 int decode_buffer_size = size + 10; // try without 10 as well
182 uint8_t *decode_buffer = av_malloc(decode_buffer_size);
183 if (decode_buffer) {
184 int decoded_size =
185 av_base64_decode(decode_buffer, encoded_result,
186 decode_buffer_size);
188 if (decoded_size != size) {
189 av_log(NULL, AV_LOG_ERROR,
190 "Decoded/Encoded size mismatch (%d != %d)\n",
191 decoded_size, size);
192 } else {
193 if (memcmp(decode_buffer, data, decoded_size) == 0) {
194 av_log(NULL, AV_LOG_ERROR, "Passed!\n");
195 } else {
196 av_log(NULL, AV_LOG_ERROR,
197 "Failed (Data differs)!\n");
200 av_free(decode_buffer);
203 av_free(encoded_result);
208 // these are invalid strings, that it currently decodes (which it probably shouldn't?)
210 uint8_t str[32];
211 if (av_base64_decode(str, "M=M=", sizeof(str)) != -1) {
212 av_log(NULL, AV_LOG_ERROR,
213 "failed test %d: successful decode of `M=M='\n",
214 numtest++);
215 numerr++;
217 if (av_base64_decode(str, "MQ===", sizeof(str)) != -1) {
218 av_log(NULL, AV_LOG_ERROR,
219 "failed test %d: successful decode of `MQ==='\n",
220 numtest++);
221 numerr++;
225 return numerr;
227 #endif