Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 1 | #include <base64.hpp> |
| 2 | #include <cassert> |
| 3 | |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 4 | namespace base64 { |
Ed Tanous | 9b65f1f | 2017-03-07 15:17:13 -0800 | [diff] [blame] | 5 | bool base64_encode(const std::string &input, std::string &output) { |
Ed Tanous | 1ff4878 | 2017-04-18 12:45:08 -0700 | [diff] [blame] | 6 | static const char encoding_data[] = |
| 7 | "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 8 | |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 9 | unsigned int input_length = input.size(); |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 10 | |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 11 | // allocate space for output string |
| 12 | output.clear(); |
| 13 | output.reserve(((input_length + 2) / 3) * 4); |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 14 | |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 15 | // for each 3-bytes sequence from the input, extract 4 6-bits sequences and |
| 16 | // encode using |
| 17 | // encoding_data lookup table. |
| 18 | // if input do not contains enough chars to complete 3-byte sequence,use pad |
| 19 | // char '=' |
| 20 | for (unsigned int i = 0; i < input_length; i++) { |
| 21 | int base64code0 = 0; |
| 22 | int base64code1 = 0; |
| 23 | int base64code2 = 0; |
| 24 | int base64code3 = 0; |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 25 | |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 26 | base64code0 = (input[i] >> 2) & 0x3f; // 1-byte 6 bits |
| 27 | output += encoding_data[base64code0]; |
| 28 | base64code1 = (input[i] << 4) & 0x3f; // 1-byte 2 bits + |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 29 | |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 30 | if (++i < input_length) { |
| 31 | base64code1 |= (input[i] >> 4) & 0x0f; // 2-byte 4 bits |
| 32 | output += encoding_data[base64code1]; |
| 33 | base64code2 = (input[i] << 2) & 0x3f; // 2-byte 4 bits + |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 34 | |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 35 | if (++i < input_length) { |
| 36 | base64code2 |= (input[i] >> 6) & 0x03; // 3-byte 2 bits |
| 37 | base64code3 = input[i] & 0x3f; // 3-byte 6 bits |
| 38 | output += encoding_data[base64code2]; |
| 39 | output += encoding_data[base64code3]; |
| 40 | } else { |
| 41 | output += encoding_data[base64code2]; |
| 42 | output += '='; |
| 43 | } |
| 44 | } else { |
| 45 | output += encoding_data[base64code1]; |
| 46 | output += '='; |
| 47 | output += '='; |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 48 | } |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 49 | } |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 50 | |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 51 | return true; |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 52 | } |
| 53 | |
Ed Tanous | 9b65f1f | 2017-03-07 15:17:13 -0800 | [diff] [blame] | 54 | bool base64_decode(const std::string &input, std::string &output) { |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 55 | static const char nop = -1; |
| 56 | static const char decoding_data[] = { |
Ed Tanous | 1ff4878 | 2017-04-18 12:45:08 -0700 | [diff] [blame] | 57 | nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, |
| 58 | nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, |
| 59 | nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, 62, nop, |
| 60 | nop, nop, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, nop, nop, |
| 61 | nop, nop, nop, nop, nop, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, |
| 62 | 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, |
| 63 | 25, nop, nop, nop, nop, nop, nop, 26, 27, 28, 29, 30, 31, 32, 33, |
| 64 | 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, |
| 65 | 49, 50, 51, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, |
| 66 | nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, |
| 67 | nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, |
| 68 | nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, |
| 69 | nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, |
| 70 | nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, |
| 71 | nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, |
| 72 | nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, |
| 73 | nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, nop, |
| 74 | nop}; |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 75 | |
| 76 | unsigned int input_length = input.size(); |
| 77 | |
| 78 | // allocate space for output string |
| 79 | output.clear(); |
| 80 | output.reserve(((input_length + 2) / 3) * 4); |
| 81 | |
| 82 | // for each 4-bytes sequence from the input, extract 4 6-bits sequences by |
| 83 | // droping first two bits |
| 84 | // and regenerate into 3 8-bits sequence |
| 85 | |
| 86 | for (unsigned int i = 0; i < input_length; i++) { |
| 87 | char base64code0; |
| 88 | char base64code1; |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 89 | char base64code2 = 0; // initialized to 0 to suppress warnings |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 90 | char base64code3; |
| 91 | |
| 92 | base64code0 = decoding_data[static_cast<int>(input[i])]; |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 93 | if (base64code0 == nop) // non base64 character |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 94 | return false; |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 95 | if (!(++i < input_length)) // we need at least two input bytes for first |
| 96 | // byte output |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 97 | return false; |
| 98 | base64code1 = decoding_data[static_cast<int>(input[i])]; |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 99 | if (base64code1 == nop) // non base64 character |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 100 | return false; |
| 101 | |
| 102 | output += ((base64code0 << 2) | ((base64code1 >> 4) & 0x3)); |
| 103 | |
| 104 | if (++i < input_length) { |
| 105 | char c = input[i]; |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 106 | if (c == '=') { // padding , end of input |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 107 | assert((base64code1 & 0x0f) == 0); |
| 108 | return true; |
| 109 | } |
| 110 | base64code2 = decoding_data[static_cast<int>(input[i])]; |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 111 | if (base64code2 == nop) // non base64 character |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 112 | return false; |
| 113 | |
| 114 | output += ((base64code1 << 4) & 0xf0) | ((base64code2 >> 2) & 0x0f); |
| 115 | } |
| 116 | |
| 117 | if (++i < input_length) { |
| 118 | char c = input[i]; |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 119 | if (c == '=') { // padding , end of input |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 120 | assert((base64code2 & 0x03) == 0); |
| 121 | return true; |
| 122 | } |
| 123 | base64code3 = decoding_data[static_cast<int>(input[i])]; |
Ed Tanous | 9992332 | 2017-03-03 14:21:24 -0800 | [diff] [blame] | 124 | if (base64code3 == nop) // non base64 character |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 125 | return false; |
| 126 | |
| 127 | output += (((base64code2 << 6) & 0xc0) | base64code3); |
| 128 | } |
| 129 | } |
| 130 | |
| 131 | return true; |
| 132 | } |
Ed Tanous | f927347 | 2017-02-28 16:05:13 -0800 | [diff] [blame] | 133 | } |