123 lines
4.5 KiB
C++
Executable File
123 lines
4.5 KiB
C++
Executable File
/**********
|
|
This library is free software; you can redistribute it and/or modify it under
|
|
the terms of the GNU Lesser General Public License as published by the
|
|
Free Software Foundation; either version 2.1 of the License, or (at your
|
|
option) any later version. (See <http://www.gnu.org/copyleft/lesser.html>.)
|
|
|
|
This library is distributed in the hope that it will be useful, but WITHOUT
|
|
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for
|
|
more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with this library; if not, write to the Free Software Foundation, Inc.,
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
**********/
|
|
// "liveMedia"
|
|
// Copyright (c) 1996-2016 Live Networks, Inc. All rights reserved.
|
|
// Base64 encoding and decoding
|
|
// implementation
|
|
|
|
#include "Base64.hh"
|
|
#include <strDup.hh>
|
|
#include <string.h>
|
|
|
|
static char base64DecodeTable[256];
|
|
|
|
static void initBase64DecodeTable() {
|
|
int i;
|
|
for (i = 0; i < 256; ++i) base64DecodeTable[i] = (char)0x80;
|
|
// default value: invalid
|
|
|
|
for (i = 'A'; i <= 'Z'; ++i) base64DecodeTable[i] = 0 + (i - 'A');
|
|
for (i = 'a'; i <= 'z'; ++i) base64DecodeTable[i] = 26 + (i - 'a');
|
|
for (i = '0'; i <= '9'; ++i) base64DecodeTable[i] = 52 + (i - '0');
|
|
base64DecodeTable[(unsigned char)'+'] = 62;
|
|
base64DecodeTable[(unsigned char)'/'] = 63;
|
|
base64DecodeTable[(unsigned char)'='] = 0;
|
|
}
|
|
|
|
unsigned char* base64Decode(char const* in, unsigned& resultSize,
|
|
Boolean trimTrailingZeros) {
|
|
if (in == NULL) return NULL; // sanity check
|
|
return base64Decode(in, strlen(in), resultSize, trimTrailingZeros);
|
|
}
|
|
|
|
unsigned char* base64Decode(char const* in, unsigned inSize,
|
|
unsigned& resultSize,
|
|
Boolean trimTrailingZeros) {
|
|
static Boolean haveInitializedBase64DecodeTable = False;
|
|
if (!haveInitializedBase64DecodeTable) {
|
|
initBase64DecodeTable();
|
|
haveInitializedBase64DecodeTable = True;
|
|
}
|
|
|
|
unsigned char* out = (unsigned char*)strDupSize(in); // ensures we have enough space
|
|
int k = 0;
|
|
int paddingCount = 0;
|
|
int const jMax = inSize - 3;
|
|
// in case "inSize" is not a multiple of 4 (although it should be)
|
|
for (int j = 0; j < jMax; j += 4) {
|
|
char inTmp[4], outTmp[4];
|
|
for (int i = 0; i < 4; ++i) {
|
|
inTmp[i] = in[i+j];
|
|
if (inTmp[i] == '=') ++paddingCount;
|
|
outTmp[i] = base64DecodeTable[(unsigned char)inTmp[i]];
|
|
if ((outTmp[i]&0x80) != 0) outTmp[i] = 0; // this happens only if there was an invalid character; pretend that it was 'A'
|
|
}
|
|
|
|
out[k++] = (outTmp[0]<<2) | (outTmp[1]>>4);
|
|
out[k++] = (outTmp[1]<<4) | (outTmp[2]>>2);
|
|
out[k++] = (outTmp[2]<<6) | outTmp[3];
|
|
}
|
|
|
|
if (trimTrailingZeros) {
|
|
while (paddingCount > 0 && k > 0 && out[k-1] == '\0') { --k; --paddingCount; }
|
|
}
|
|
resultSize = k;
|
|
unsigned char* result = new unsigned char[resultSize];
|
|
memmove(result, out, resultSize);
|
|
delete[] out;
|
|
|
|
return result;
|
|
}
|
|
|
|
static const char base64Char[] =
|
|
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
|
|
|
char* base64Encode(char const* origSigned, unsigned origLength) {
|
|
unsigned char const* orig = (unsigned char const*)origSigned; // in case any input bytes have the MSB set
|
|
if (orig == NULL) return NULL;
|
|
|
|
unsigned const numOrig24BitValues = origLength/3;
|
|
Boolean havePadding = origLength > numOrig24BitValues*3;
|
|
Boolean havePadding2 = origLength == numOrig24BitValues*3 + 2;
|
|
unsigned const numResultBytes = 4*(numOrig24BitValues + havePadding);
|
|
char* result = new char[numResultBytes+1]; // allow for trailing '\0'
|
|
|
|
// Map each full group of 3 input bytes into 4 output base-64 characters:
|
|
unsigned i;
|
|
for (i = 0; i < numOrig24BitValues; ++i) {
|
|
result[4*i+0] = base64Char[(orig[3*i]>>2)&0x3F];
|
|
result[4*i+1] = base64Char[(((orig[3*i]&0x3)<<4) | (orig[3*i+1]>>4))&0x3F];
|
|
result[4*i+2] = base64Char[((orig[3*i+1]<<2) | (orig[3*i+2]>>6))&0x3F];
|
|
result[4*i+3] = base64Char[orig[3*i+2]&0x3F];
|
|
}
|
|
|
|
// Now, take padding into account. (Note: i == numOrig24BitValues)
|
|
if (havePadding) {
|
|
result[4*i+0] = base64Char[(orig[3*i]>>2)&0x3F];
|
|
if (havePadding2) {
|
|
result[4*i+1] = base64Char[(((orig[3*i]&0x3)<<4) | (orig[3*i+1]>>4))&0x3F];
|
|
result[4*i+2] = base64Char[(orig[3*i+1]<<2)&0x3F];
|
|
} else {
|
|
result[4*i+1] = base64Char[((orig[3*i]&0x3)<<4)&0x3F];
|
|
result[4*i+2] = '=';
|
|
}
|
|
result[4*i+3] = '=';
|
|
}
|
|
|
|
result[numResultBytes] = '\0';
|
|
return result;
|
|
}
|