2014-05-05 21:30:43 +04:00
|
|
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
|
2012-05-21 15:12:37 +04:00
|
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
2011-06-08 22:08:31 +04:00
|
|
|
|
|
|
|
#include "Base64.h"
|
|
|
|
|
|
|
|
#include "nsIInputStream.h"
|
2013-09-23 21:25:00 +04:00
|
|
|
#include "nsString.h"
|
2011-12-28 12:13:38 +04:00
|
|
|
|
|
|
|
#include "plbase64.h"
|
2011-06-08 22:08:31 +04:00
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
|
|
|
// BEGIN base64 encode code copied and modified from NSPR
|
2014-05-15 00:15:46 +04:00
|
|
|
const unsigned char* base =
|
|
|
|
(unsigned char*)"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
|
|
|
|
"abcdefghijklmnopqrstuvwxyz"
|
|
|
|
"0123456789+/";
|
2011-06-08 22:08:31 +04:00
|
|
|
|
2014-08-25 23:17:15 +04:00
|
|
|
template<typename T>
|
2011-06-08 22:08:31 +04:00
|
|
|
static void
|
2014-05-15 00:15:46 +04:00
|
|
|
Encode3to4(const unsigned char* aSrc, T* aDest)
|
2011-06-08 22:08:31 +04:00
|
|
|
{
|
2014-05-05 21:30:43 +04:00
|
|
|
uint32_t b32 = (uint32_t)0;
|
|
|
|
int i, j = 18;
|
2011-06-08 22:08:31 +04:00
|
|
|
|
2014-05-15 00:15:46 +04:00
|
|
|
for (i = 0; i < 3; ++i) {
|
2014-05-05 21:30:43 +04:00
|
|
|
b32 <<= 8;
|
2014-05-15 00:15:46 +04:00
|
|
|
b32 |= (uint32_t)aSrc[i];
|
2014-05-05 21:30:43 +04:00
|
|
|
}
|
2011-06-08 22:08:31 +04:00
|
|
|
|
2014-05-15 00:15:46 +04:00
|
|
|
for (i = 0; i < 4; ++i) {
|
|
|
|
aDest[i] = base[(uint32_t)((b32 >> j) & 0x3F)];
|
2014-05-05 21:30:43 +04:00
|
|
|
j -= 6;
|
|
|
|
}
|
2011-06-08 22:08:31 +04:00
|
|
|
}
|
|
|
|
|
2014-08-25 23:17:15 +04:00
|
|
|
template<typename T>
|
2011-06-08 22:08:31 +04:00
|
|
|
static void
|
2014-05-15 00:15:46 +04:00
|
|
|
Encode2to4(const unsigned char* aSrc, T* aDest)
|
2011-06-08 22:08:31 +04:00
|
|
|
{
|
2014-05-15 00:15:46 +04:00
|
|
|
aDest[0] = base[(uint32_t)((aSrc[0] >> 2) & 0x3F)];
|
|
|
|
aDest[1] = base[(uint32_t)(((aSrc[0] & 0x03) << 4) | ((aSrc[1] >> 4) & 0x0F))];
|
|
|
|
aDest[2] = base[(uint32_t)((aSrc[1] & 0x0F) << 2)];
|
|
|
|
aDest[3] = (unsigned char)'=';
|
2011-06-08 22:08:31 +04:00
|
|
|
}
|
|
|
|
|
2014-08-25 23:17:15 +04:00
|
|
|
template<typename T>
|
2011-06-08 22:08:31 +04:00
|
|
|
static void
|
2014-05-15 00:15:46 +04:00
|
|
|
Encode1to4(const unsigned char* aSrc, T* aDest)
|
2011-06-08 22:08:31 +04:00
|
|
|
{
|
2014-05-15 00:15:46 +04:00
|
|
|
aDest[0] = base[(uint32_t)((aSrc[0] >> 2) & 0x3F)];
|
|
|
|
aDest[1] = base[(uint32_t)((aSrc[0] & 0x03) << 4)];
|
|
|
|
aDest[2] = (unsigned char)'=';
|
|
|
|
aDest[3] = (unsigned char)'=';
|
2011-06-08 22:08:31 +04:00
|
|
|
}
|
|
|
|
|
2014-08-25 23:17:15 +04:00
|
|
|
template<typename T>
|
2011-06-08 22:08:31 +04:00
|
|
|
static void
|
2014-05-15 00:15:46 +04:00
|
|
|
Encode(const unsigned char* aSrc, uint32_t aSrcLen, T* aDest)
|
2011-06-08 22:08:31 +04:00
|
|
|
{
|
2014-05-15 00:15:46 +04:00
|
|
|
while (aSrcLen >= 3) {
|
|
|
|
Encode3to4(aSrc, aDest);
|
|
|
|
aSrc += 3;
|
|
|
|
aDest += 4;
|
|
|
|
aSrcLen -= 3;
|
2014-05-05 21:30:43 +04:00
|
|
|
}
|
2011-06-08 22:08:31 +04:00
|
|
|
|
2014-05-15 00:15:46 +04:00
|
|
|
switch (aSrcLen) {
|
2014-05-05 21:30:43 +04:00
|
|
|
case 2:
|
2014-05-15 00:15:46 +04:00
|
|
|
Encode2to4(aSrc, aDest);
|
2014-05-05 21:30:43 +04:00
|
|
|
break;
|
|
|
|
case 1:
|
2014-05-15 00:15:46 +04:00
|
|
|
Encode1to4(aSrc, aDest);
|
2014-05-05 21:30:43 +04:00
|
|
|
break;
|
|
|
|
case 0:
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
NS_NOTREACHED("coding error");
|
|
|
|
}
|
2011-06-08 22:08:31 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
// END base64 encode code copied and modified from NSPR.
|
|
|
|
|
2014-08-25 23:17:15 +04:00
|
|
|
template<typename T>
|
2014-05-15 00:15:46 +04:00
|
|
|
struct EncodeInputStream_State
|
|
|
|
{
|
2011-06-08 22:08:31 +04:00
|
|
|
unsigned char c[3];
|
2012-08-22 19:56:38 +04:00
|
|
|
uint8_t charsOnStack;
|
2011-06-08 22:08:31 +04:00
|
|
|
typename T::char_type* buffer;
|
|
|
|
};
|
|
|
|
|
2014-08-25 23:17:15 +04:00
|
|
|
template<typename T>
|
2011-06-08 22:08:31 +04:00
|
|
|
NS_METHOD
|
2014-05-15 00:15:46 +04:00
|
|
|
EncodeInputStream_Encoder(nsIInputStream* aStream,
|
|
|
|
void* aClosure,
|
|
|
|
const char* aFromSegment,
|
2012-08-22 19:56:38 +04:00
|
|
|
uint32_t aToOffset,
|
|
|
|
uint32_t aCount,
|
2014-05-15 00:15:46 +04:00
|
|
|
uint32_t* aWriteCount)
|
2011-06-08 22:08:31 +04:00
|
|
|
{
|
|
|
|
NS_ASSERTION(aCount > 0, "Er, what?");
|
|
|
|
|
|
|
|
EncodeInputStream_State<T>* state =
|
|
|
|
static_cast<EncodeInputStream_State<T>*>(aClosure);
|
|
|
|
|
|
|
|
// If we have any data left from last time, encode it now.
|
2012-08-22 19:56:38 +04:00
|
|
|
uint32_t countRemaining = aCount;
|
2014-05-15 00:15:46 +04:00
|
|
|
const unsigned char* src = (const unsigned char*)aFromSegment;
|
2011-06-08 22:08:31 +04:00
|
|
|
if (state->charsOnStack) {
|
|
|
|
unsigned char firstSet[4];
|
|
|
|
if (state->charsOnStack == 1) {
|
|
|
|
firstSet[0] = state->c[0];
|
|
|
|
firstSet[1] = src[0];
|
|
|
|
firstSet[2] = (countRemaining > 1) ? src[1] : '\0';
|
|
|
|
firstSet[3] = '\0';
|
|
|
|
} else /* state->charsOnStack == 2 */ {
|
|
|
|
firstSet[0] = state->c[0];
|
|
|
|
firstSet[1] = state->c[1];
|
|
|
|
firstSet[2] = src[0];
|
|
|
|
firstSet[3] = '\0';
|
|
|
|
}
|
|
|
|
Encode(firstSet, 3, state->buffer);
|
|
|
|
state->buffer += 4;
|
|
|
|
countRemaining -= (3 - state->charsOnStack);
|
|
|
|
src += (3 - state->charsOnStack);
|
|
|
|
state->charsOnStack = 0;
|
|
|
|
}
|
|
|
|
|
2014-05-05 21:30:43 +04:00
|
|
|
// Encode the bulk of the
|
2012-08-22 19:56:38 +04:00
|
|
|
uint32_t encodeLength = countRemaining - countRemaining % 3;
|
2015-02-10 01:34:50 +03:00
|
|
|
MOZ_ASSERT(encodeLength % 3 == 0,
|
|
|
|
"Should have an exact number of triplets!");
|
2011-06-08 22:08:31 +04:00
|
|
|
Encode(src, encodeLength, state->buffer);
|
|
|
|
state->buffer += (encodeLength / 3) * 4;
|
|
|
|
src += encodeLength;
|
|
|
|
countRemaining -= encodeLength;
|
|
|
|
|
|
|
|
// We must consume all data, so if there's some data left stash it
|
|
|
|
*aWriteCount = aCount;
|
|
|
|
|
|
|
|
if (countRemaining) {
|
|
|
|
// We should never have a full triplet left at this point.
|
2015-02-10 01:34:50 +03:00
|
|
|
MOZ_ASSERT(countRemaining < 3, "We should have encoded more!");
|
2011-06-08 22:08:31 +04:00
|
|
|
state->c[0] = src[0];
|
|
|
|
state->c[1] = (countRemaining == 2) ? src[1] : '\0';
|
|
|
|
state->charsOnStack = countRemaining;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2014-08-25 23:17:15 +04:00
|
|
|
template<typename T>
|
2011-06-08 22:08:31 +04:00
|
|
|
nsresult
|
2014-05-15 00:15:46 +04:00
|
|
|
EncodeInputStream(nsIInputStream* aInputStream,
|
|
|
|
T& aDest,
|
2012-08-22 19:56:38 +04:00
|
|
|
uint32_t aCount,
|
|
|
|
uint32_t aOffset)
|
2011-06-08 22:08:31 +04:00
|
|
|
{
|
|
|
|
nsresult rv;
|
2012-08-22 19:56:38 +04:00
|
|
|
uint64_t count64 = aCount;
|
2011-06-08 22:08:31 +04:00
|
|
|
|
|
|
|
if (!aCount) {
|
2012-08-11 06:44:11 +04:00
|
|
|
rv = aInputStream->Available(&count64);
|
2014-05-15 00:15:46 +04:00
|
|
|
if (NS_WARN_IF(NS_FAILED(rv))) {
|
2013-11-20 01:27:37 +04:00
|
|
|
return rv;
|
2014-05-15 00:15:46 +04:00
|
|
|
}
|
2012-08-11 06:44:11 +04:00
|
|
|
// if count64 is over 4GB, it will be failed at the below condition,
|
|
|
|
// then will return NS_ERROR_OUT_OF_MEMORY
|
2012-08-22 19:56:38 +04:00
|
|
|
aCount = (uint32_t)count64;
|
2011-06-08 22:08:31 +04:00
|
|
|
}
|
|
|
|
|
2012-08-22 19:56:38 +04:00
|
|
|
uint64_t countlong =
|
2012-08-11 06:44:11 +04:00
|
|
|
(count64 + 2) / 3 * 4; // +2 due to integer math.
|
2014-05-15 00:15:46 +04:00
|
|
|
if (countlong + aOffset > UINT32_MAX) {
|
2011-12-30 21:54:12 +04:00
|
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
2014-05-15 00:15:46 +04:00
|
|
|
}
|
2011-12-30 21:54:12 +04:00
|
|
|
|
2012-08-22 19:56:38 +04:00
|
|
|
uint32_t count = uint32_t(countlong);
|
2011-12-30 21:54:12 +04:00
|
|
|
|
2015-02-26 21:13:59 +03:00
|
|
|
if (!aDest.SetLength(count + aOffset, mozilla::fallible)) {
|
2011-06-08 22:08:31 +04:00
|
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
2014-05-15 00:15:46 +04:00
|
|
|
}
|
2011-06-08 22:08:31 +04:00
|
|
|
|
|
|
|
EncodeInputStream_State<T> state;
|
|
|
|
state.charsOnStack = 0;
|
|
|
|
state.c[2] = '\0';
|
|
|
|
state.buffer = aOffset + aDest.BeginWriting();
|
|
|
|
|
|
|
|
while (1) {
|
2012-08-22 19:56:38 +04:00
|
|
|
uint32_t read = 0;
|
2011-06-08 22:08:31 +04:00
|
|
|
|
|
|
|
rv = aInputStream->ReadSegments(&EncodeInputStream_Encoder<T>,
|
|
|
|
(void*)&state,
|
|
|
|
aCount,
|
|
|
|
&read);
|
|
|
|
if (NS_FAILED(rv)) {
|
2014-05-15 00:15:46 +04:00
|
|
|
if (rv == NS_BASE_STREAM_WOULD_BLOCK) {
|
2011-06-08 22:08:31 +04:00
|
|
|
NS_RUNTIMEABORT("Not implemented for async streams!");
|
2014-05-15 00:15:46 +04:00
|
|
|
}
|
|
|
|
if (rv == NS_ERROR_NOT_IMPLEMENTED) {
|
2011-06-08 22:08:31 +04:00
|
|
|
NS_RUNTIMEABORT("Requires a stream that implements ReadSegments!");
|
2014-05-15 00:15:46 +04:00
|
|
|
}
|
2011-06-08 22:08:31 +04:00
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
2014-05-15 00:15:46 +04:00
|
|
|
if (!read) {
|
2011-06-08 22:08:31 +04:00
|
|
|
break;
|
2014-05-15 00:15:46 +04:00
|
|
|
}
|
2011-06-08 22:08:31 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
// Finish encoding if anything is left
|
2014-05-15 00:15:46 +04:00
|
|
|
if (state.charsOnStack) {
|
2011-06-08 22:08:31 +04:00
|
|
|
Encode(state.c, state.charsOnStack, state.buffer);
|
2014-05-15 00:15:46 +04:00
|
|
|
}
|
2011-06-08 22:08:31 +04:00
|
|
|
|
2014-05-15 00:15:46 +04:00
|
|
|
if (aDest.Length()) {
|
2014-02-03 16:27:56 +04:00
|
|
|
// May belong to an nsCString with an unallocated buffer, so only null
|
|
|
|
// terminate if there is a need to.
|
|
|
|
*aDest.EndWriting() = '\0';
|
2014-05-15 00:15:46 +04:00
|
|
|
}
|
2011-06-08 22:08:31 +04:00
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2015-12-15 03:28:19 +03:00
|
|
|
static const char kBase64URLAlphabet[] =
|
|
|
|
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_";
|
|
|
|
|
2015-07-13 18:25:42 +03:00
|
|
|
} // namespace
|
2011-06-08 22:08:31 +04:00
|
|
|
|
|
|
|
namespace mozilla {
|
|
|
|
|
|
|
|
nsresult
|
2014-05-15 00:15:46 +04:00
|
|
|
Base64EncodeInputStream(nsIInputStream* aInputStream,
|
|
|
|
nsACString& aDest,
|
2012-08-22 19:56:38 +04:00
|
|
|
uint32_t aCount,
|
|
|
|
uint32_t aOffset)
|
2011-06-08 22:08:31 +04:00
|
|
|
{
|
|
|
|
return EncodeInputStream<nsACString>(aInputStream, aDest, aCount, aOffset);
|
|
|
|
}
|
|
|
|
|
|
|
|
nsresult
|
2014-05-15 00:15:46 +04:00
|
|
|
Base64EncodeInputStream(nsIInputStream* aInputStream,
|
|
|
|
nsAString& aDest,
|
2012-08-22 19:56:38 +04:00
|
|
|
uint32_t aCount,
|
|
|
|
uint32_t aOffset)
|
2011-06-08 22:08:31 +04:00
|
|
|
{
|
|
|
|
return EncodeInputStream<nsAString>(aInputStream, aDest, aCount, aOffset);
|
|
|
|
}
|
|
|
|
|
2011-12-28 12:13:38 +04:00
|
|
|
nsresult
|
2014-05-15 00:15:46 +04:00
|
|
|
Base64Encode(const nsACString& aBinaryData, nsACString& aString)
|
2011-12-28 12:13:38 +04:00
|
|
|
{
|
|
|
|
// Check for overflow.
|
2012-09-28 10:57:33 +04:00
|
|
|
if (aBinaryData.Length() > (UINT32_MAX / 4) * 3) {
|
2011-12-28 12:13:38 +04:00
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
}
|
|
|
|
|
2012-12-07 07:34:49 +04:00
|
|
|
// Don't ask PR_Base64Encode to encode empty strings
|
|
|
|
if (aBinaryData.IsEmpty()) {
|
|
|
|
aString.Truncate();
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2012-08-22 19:56:38 +04:00
|
|
|
uint32_t stringLen = ((aBinaryData.Length() + 2) / 3) * 4;
|
2011-12-28 12:13:38 +04:00
|
|
|
|
2014-05-15 00:15:46 +04:00
|
|
|
char* buffer;
|
2011-12-28 12:13:38 +04:00
|
|
|
|
|
|
|
// Add one byte for null termination.
|
2015-01-28 12:00:40 +03:00
|
|
|
if (aString.SetCapacity(stringLen + 1, fallible) &&
|
2014-05-05 21:30:43 +04:00
|
|
|
(buffer = aString.BeginWriting()) &&
|
|
|
|
PL_Base64Encode(aBinaryData.BeginReading(), aBinaryData.Length(), buffer)) {
|
2011-12-28 12:13:38 +04:00
|
|
|
// PL_Base64Encode doesn't null terminate the buffer for us when we pass
|
|
|
|
// the buffer in. Do that manually.
|
|
|
|
buffer[stringLen] = '\0';
|
|
|
|
|
|
|
|
aString.SetLength(stringLen);
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
aString.Truncate();
|
|
|
|
return NS_ERROR_INVALID_ARG;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsresult
|
2014-05-15 00:15:46 +04:00
|
|
|
Base64Encode(const nsAString& aString, nsAString& aBinaryData)
|
2011-12-28 12:13:38 +04:00
|
|
|
{
|
|
|
|
NS_LossyConvertUTF16toASCII string(aString);
|
2012-09-02 06:35:17 +04:00
|
|
|
nsAutoCString binaryData;
|
2011-12-28 12:13:38 +04:00
|
|
|
|
|
|
|
nsresult rv = Base64Encode(string, binaryData);
|
|
|
|
if (NS_SUCCEEDED(rv)) {
|
|
|
|
CopyASCIItoUTF16(binaryData, aBinaryData);
|
|
|
|
} else {
|
|
|
|
aBinaryData.Truncate();
|
|
|
|
}
|
|
|
|
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsresult
|
2014-05-15 00:15:46 +04:00
|
|
|
Base64Decode(const nsACString& aString, nsACString& aBinaryData)
|
2011-12-28 12:13:38 +04:00
|
|
|
{
|
|
|
|
// Check for overflow.
|
2012-09-28 10:57:33 +04:00
|
|
|
if (aString.Length() > UINT32_MAX / 3) {
|
2011-12-28 12:13:38 +04:00
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
}
|
|
|
|
|
2012-12-07 07:34:49 +04:00
|
|
|
// Don't ask PR_Base64Decode to decode the empty string
|
|
|
|
if (aString.IsEmpty()) {
|
|
|
|
aBinaryData.Truncate();
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2012-08-22 19:56:38 +04:00
|
|
|
uint32_t binaryDataLen = ((aString.Length() * 3) / 4);
|
2011-12-28 12:13:38 +04:00
|
|
|
|
2014-05-15 00:15:46 +04:00
|
|
|
char* buffer;
|
2011-12-28 12:13:38 +04:00
|
|
|
|
|
|
|
// Add one byte for null termination.
|
2015-01-28 12:00:40 +03:00
|
|
|
if (aBinaryData.SetCapacity(binaryDataLen + 1, fallible) &&
|
2014-05-05 21:30:43 +04:00
|
|
|
(buffer = aBinaryData.BeginWriting()) &&
|
|
|
|
PL_Base64Decode(aString.BeginReading(), aString.Length(), buffer)) {
|
2011-12-28 12:13:38 +04:00
|
|
|
// PL_Base64Decode doesn't null terminate the buffer for us when we pass
|
|
|
|
// the buffer in. Do that manually, taking into account the number of '='
|
|
|
|
// characters we were passed.
|
|
|
|
if (!aString.IsEmpty() && aString[aString.Length() - 1] == '=') {
|
|
|
|
if (aString.Length() > 1 && aString[aString.Length() - 2] == '=') {
|
|
|
|
binaryDataLen -= 2;
|
|
|
|
} else {
|
|
|
|
binaryDataLen -= 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
buffer[binaryDataLen] = '\0';
|
|
|
|
|
|
|
|
aBinaryData.SetLength(binaryDataLen);
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
aBinaryData.Truncate();
|
|
|
|
return NS_ERROR_INVALID_ARG;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsresult
|
2014-05-15 00:15:46 +04:00
|
|
|
Base64Decode(const nsAString& aBinaryData, nsAString& aString)
|
2011-12-28 12:13:38 +04:00
|
|
|
{
|
|
|
|
NS_LossyConvertUTF16toASCII binaryData(aBinaryData);
|
2012-09-02 06:35:17 +04:00
|
|
|
nsAutoCString string;
|
2011-12-28 12:13:38 +04:00
|
|
|
|
|
|
|
nsresult rv = Base64Decode(binaryData, string);
|
|
|
|
if (NS_SUCCEEDED(rv)) {
|
|
|
|
CopyASCIItoUTF16(string, aString);
|
|
|
|
} else {
|
|
|
|
aString.Truncate();
|
|
|
|
}
|
|
|
|
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
2015-12-15 03:28:19 +03:00
|
|
|
nsresult
|
|
|
|
Base64URLEncode(uint32_t aLength, const uint8_t* aData, nsACString& aString)
|
|
|
|
{
|
|
|
|
// Don't encode empty strings.
|
|
|
|
if (aLength == 0) {
|
|
|
|
aString.Truncate();
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check for overflow.
|
|
|
|
if ((static_cast<uint64_t>(aLength) * 6 + 7) / 8 > UINT32_MAX) {
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!aString.SetLength((aLength * 8 + 5) / 6, fallible)) {
|
|
|
|
aString.Truncate();
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
}
|
|
|
|
|
|
|
|
char* rawBuffer = aString.BeginWriting();
|
|
|
|
|
|
|
|
uint32_t index = 0;
|
|
|
|
for (; index + 3 <= aLength; index += 3) {
|
|
|
|
*rawBuffer++ = kBase64URLAlphabet[aData[index] >> 2];
|
|
|
|
*rawBuffer++ = kBase64URLAlphabet[((aData[index] & 0x3) << 4) |
|
|
|
|
(aData[index + 1] >> 4)];
|
|
|
|
*rawBuffer++ = kBase64URLAlphabet[((aData[index + 1] & 0xf) << 2) |
|
|
|
|
(aData[index + 2] >> 6)];
|
|
|
|
*rawBuffer++ = kBase64URLAlphabet[aData[index + 2] & 0x3f];
|
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t remaining = aLength - index;
|
|
|
|
if (remaining == 1) {
|
|
|
|
*rawBuffer++ = kBase64URLAlphabet[aData[index] >> 2];
|
|
|
|
*rawBuffer++ = kBase64URLAlphabet[((aData[index] & 0x3) << 4)];
|
|
|
|
} else if (remaining == 2) {
|
|
|
|
*rawBuffer++ = kBase64URLAlphabet[aData[index] >> 2];
|
|
|
|
*rawBuffer++ = kBase64URLAlphabet[((aData[index] & 0x3) << 4) |
|
|
|
|
(aData[index + 1] >> 4)];
|
|
|
|
*rawBuffer++ = kBase64URLAlphabet[((aData[index + 1] & 0xf) << 2)];
|
|
|
|
}
|
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2011-06-08 22:08:31 +04:00
|
|
|
} // namespace mozilla
|