| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /* | ||
| 2 | * Copyright (c) 2006 Ryan Martell. (rdm4@martellventures.com) | ||
| 3 | * | ||
| 4 | * This file is part of FFmpeg. | ||
| 5 | * | ||
| 6 | * FFmpeg is free software; you can redistribute it and/or | ||
| 7 | * modify it under the terms of the GNU Lesser General Public | ||
| 8 | * License as published by the Free Software Foundation; either | ||
| 9 | * version 2.1 of the License, or (at your option) any later version. | ||
| 10 | * | ||
| 11 | * FFmpeg is distributed in the hope that it will be useful, | ||
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
| 14 | * Lesser General Public License for more details. | ||
| 15 | * | ||
| 16 | * You should have received a copy of the GNU Lesser General Public | ||
| 17 | * License along with FFmpeg; if not, write to the Free Software | ||
| 18 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | ||
| 19 | */ | ||
| 20 | |||
| 21 | /** | ||
| 22 | * @file | ||
| 23 | * @brief Base64 encode/decode | ||
| 24 | * @author Ryan Martell <rdm4@martellventures.com> (with lots of Michael) | ||
| 25 | */ | ||
| 26 | |||
| 27 | #include <limits.h> | ||
| 28 | #include <stddef.h> | ||
| 29 | |||
| 30 | #include "base64.h" | ||
| 31 | #include "error.h" | ||
| 32 | #include "intreadwrite.h" | ||
| 33 | |||
| 34 | /* ---------------- private code */ | ||
| 35 | static const uint8_t map2[256] = | ||
| 36 | { | ||
| 37 | 0xfe, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 38 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 39 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 40 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 41 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 42 | 0xff, 0xff, 0xff, | ||
| 43 | |||
| 44 | 0x3e, 0xff, 0xff, 0xff, 0x3f, 0x34, 0x35, 0x36, | ||
| 45 | 0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0xff, | ||
| 46 | 0xff, 0xff, 0xfe, 0xff, 0xff, 0xff, 0x00, 0x01, | ||
| 47 | 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, | ||
| 48 | 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10, 0x11, | ||
| 49 | 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, | ||
| 50 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x1a, 0x1b, | ||
| 51 | 0x1c, 0x1d, 0x1e, 0x1f, 0x20, 0x21, 0x22, 0x23, | ||
| 52 | 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2a, 0x2b, | ||
| 53 | 0x2c, 0x2d, 0x2e, 0x2f, 0x30, 0x31, 0x32, 0x33, | ||
| 54 | |||
| 55 | 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 56 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 57 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 58 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 59 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 60 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 61 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 62 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 63 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 64 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 65 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 66 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 67 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 68 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 69 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 70 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 71 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, | ||
| 72 | }; | ||
| 73 | |||
| 74 | #define BASE64_DEC_STEP(i) do { \ | ||
| 75 | bits = map2[in[i]]; \ | ||
| 76 | if (bits & 0x80) \ | ||
| 77 | goto out ## i; \ | ||
| 78 | v = i ? (v << 6) + bits : bits; \ | ||
| 79 | } while(0) | ||
| 80 | |||
| 81 | 63 | int av_base64_decode(uint8_t *out, const char *in_str, int out_size) | |
| 82 | { | ||
| 83 | 63 | uint8_t *dst = out; | |
| 84 | uint8_t *end; | ||
| 85 | // no sign extension | ||
| 86 | 63 | const uint8_t *in = in_str; | |
| 87 | 63 | unsigned bits = 0xff; | |
| 88 | unsigned v; | ||
| 89 | |||
| 90 |
2/2✓ Branch 0 taken 15 times.
✓ Branch 1 taken 48 times.
|
63 | if (!out) |
| 91 | 15 | goto validity_check; | |
| 92 | |||
| 93 | 48 | end = out + out_size; | |
| 94 |
2/2✓ Branch 0 taken 46472 times.
✓ Branch 1 taken 40 times.
|
46512 | while (end - dst > 3) { |
| 95 |
2/2✓ Branch 0 taken 3 times.
✓ Branch 1 taken 46469 times.
|
46472 | BASE64_DEC_STEP(0); |
| 96 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 46469 times.
|
46469 | BASE64_DEC_STEP(1); |
| 97 |
2/2✓ Branch 0 taken 3 times.
✓ Branch 1 taken 46466 times.
|
46469 | BASE64_DEC_STEP(2); |
| 98 |
2/2✓ Branch 0 taken 2 times.
✓ Branch 1 taken 46464 times.
|
46466 | BASE64_DEC_STEP(3); |
| 99 | // Using AV_WB32 directly confuses compiler | ||
| 100 | 46464 | v = av_be2ne32(v << 8); | |
| 101 | 46464 | AV_WN32(dst, v); | |
| 102 | 46464 | dst += 3; | |
| 103 | 46464 | in += 4; | |
| 104 | } | ||
| 105 |
2/2✓ Branch 0 taken 3 times.
✓ Branch 1 taken 37 times.
|
40 | if (end - dst) { |
| 106 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 37 times.
|
37 | BASE64_DEC_STEP(0); |
| 107 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 37 times.
|
37 | BASE64_DEC_STEP(1); |
| 108 |
2/2✓ Branch 0 taken 5 times.
✓ Branch 1 taken 32 times.
|
37 | BASE64_DEC_STEP(2); |
| 109 |
2/2✓ Branch 0 taken 6 times.
✓ Branch 1 taken 26 times.
|
32 | BASE64_DEC_STEP(3); |
| 110 | 26 | *dst++ = v >> 16; | |
| 111 |
2/2✓ Branch 0 taken 24 times.
✓ Branch 1 taken 2 times.
|
26 | if (end - dst) |
| 112 | 24 | *dst++ = v >> 8; | |
| 113 |
2/2✓ Branch 0 taken 20 times.
✓ Branch 1 taken 6 times.
|
26 | if (end - dst) |
| 114 | 20 | *dst++ = v; | |
| 115 | 26 | in += 4; | |
| 116 | } | ||
| 117 | 44 | validity_check: | |
| 118 | while (1) { | ||
| 119 |
2/2✓ Branch 0 taken 25 times.
✓ Branch 1 taken 31 times.
|
56 | BASE64_DEC_STEP(0); |
| 120 | 31 | in++; | |
| 121 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 31 times.
|
31 | BASE64_DEC_STEP(0); |
| 122 | 31 | in++; | |
| 123 |
2/2✓ Branch 0 taken 11 times.
✓ Branch 1 taken 20 times.
|
31 | BASE64_DEC_STEP(0); |
| 124 | 20 | in++; | |
| 125 |
2/2✓ Branch 0 taken 8 times.
✓ Branch 1 taken 12 times.
|
20 | BASE64_DEC_STEP(0); |
| 126 | 12 | in++; | |
| 127 | } | ||
| 128 | |||
| 129 | 8 | out3: | |
| 130 |
1/2✓ Branch 0 taken 8 times.
✗ Branch 1 not taken.
|
8 | if (end - dst) |
| 131 | 8 | *dst++ = v >> 10; | |
| 132 | 8 | v <<= 2; | |
| 133 | 16 | out2: | |
| 134 |
2/2✓ Branch 0 taken 2 times.
✓ Branch 1 taken 14 times.
|
16 | if (end - dst) |
| 135 | 14 | *dst++ = v >> 4; | |
| 136 | 16 | out1: | |
| 137 | 63 | out0: | |
| 138 |
4/4✓ Branch 0 taken 56 times.
✓ Branch 1 taken 7 times.
✓ Branch 2 taken 48 times.
✓ Branch 3 taken 8 times.
|
63 | return bits & 1 ? AVERROR_INVALIDDATA : out ? dst - out : 0; |
| 139 | } | ||
| 140 | |||
| 141 | /***************************************************************************** | ||
| 142 | * b64_encode: Stolen from VLC's http.c. | ||
| 143 | * Simplified by Michael. | ||
| 144 | * Fixed edge cases and made it work from data (vs. strings) by Ryan. | ||
| 145 | *****************************************************************************/ | ||
| 146 | |||
| 147 | 23 | char *av_base64_encode(char *out, int out_size, const uint8_t *in, int in_size) | |
| 148 | { | ||
| 149 | static const char b64[] = | ||
| 150 | "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; | ||
| 151 | char *ret, *dst; | ||
| 152 | 23 | unsigned i_bits = 0; | |
| 153 | 23 | int i_shift = 0; | |
| 154 | 23 | int bytes_remaining = in_size; | |
| 155 | |||
| 156 |
1/2✓ Branch 0 taken 23 times.
✗ Branch 1 not taken.
|
23 | if (in_size >= UINT_MAX / 4 || |
| 157 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 23 times.
|
23 | out_size < AV_BASE64_SIZE(in_size)) |
| 158 | ✗ | return NULL; | |
| 159 | 23 | ret = dst = out; | |
| 160 |
2/2✓ Branch 0 taken 131 times.
✓ Branch 1 taken 23 times.
|
154 | while (bytes_remaining > 3) { |
| 161 | 131 | i_bits = AV_RB32(in); | |
| 162 | 131 | in += 3; bytes_remaining -= 3; | |
| 163 | 131 | *dst++ = b64[ i_bits>>26 ]; | |
| 164 | 131 | *dst++ = b64[(i_bits>>20) & 0x3F]; | |
| 165 | 131 | *dst++ = b64[(i_bits>>14) & 0x3F]; | |
| 166 | 131 | *dst++ = b64[(i_bits>>8 ) & 0x3F]; | |
| 167 | } | ||
| 168 | 23 | i_bits = 0; | |
| 169 |
2/2✓ Branch 0 taken 35 times.
✓ Branch 1 taken 23 times.
|
58 | while (bytes_remaining) { |
| 170 | 35 | i_bits = (i_bits << 8) + *in++; | |
| 171 | 35 | bytes_remaining--; | |
| 172 | 35 | i_shift += 8; | |
| 173 | } | ||
| 174 |
2/2✓ Branch 0 taken 57 times.
✓ Branch 1 taken 23 times.
|
80 | while (i_shift > 0) { |
| 175 | 57 | *dst++ = b64[(i_bits << 6 >> i_shift) & 0x3f]; | |
| 176 | 57 | i_shift -= 6; | |
| 177 | } | ||
| 178 |
2/2✓ Branch 0 taken 31 times.
✓ Branch 1 taken 23 times.
|
54 | while ((dst - ret) & 3) |
| 179 | 31 | *dst++ = '='; | |
| 180 | 23 | *dst = '\0'; | |
| 181 | |||
| 182 | 23 | return ret; | |
| 183 | } | ||
| 184 |