Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	base64-inl.h	Lines:	84	85	98.8 %
Date:	2022-05-19 04:15:38	Branches:	75	113	66.4 %


#ifndef SRC_BASE64_INL_H_
#define SRC_BASE64_INL_H_

#if defined(NODE_WANT_INTERNALS) && NODE_WANT_INTERNALS

#include "base64.h"
#include "util.h"

namespace node {

extern const int8_t unbase64_table[256];


inline static int8_t unbase64(uint8_t x) {
  return unbase64_table[x];
}


inline uint32_t ReadUint32BE(const unsigned char* p) {
  return static_cast<uint32_t>(p[0] << 24U) |
         static_cast<uint32_t>(p[1] << 16U) |
         static_cast<uint32_t>(p[2] << 8U) |
         static_cast<uint32_t>(p[3]);
}

#ifdef _MSC_VER
#pragma warning(push)
// MSVC C4003: not enough actual parameters for macro 'identifier'
#pragma warning(disable : 4003)
#endif

template <typename TypeName>
bool base64_decode_group_slow(char* const dst, const size_t dstlen,
                              const TypeName* const src, const size_t srclen,
                              size_t* const i, size_t* const k) {
  uint8_t hi;
  uint8_t lo;
#define V(expr)                                                                \
  for (;;) {                                                                   \
    const uint8_t c = static_cast<uint8_t>(src[*i]);                           \
    lo = unbase64(c);                                                          \
    *i += 1;                                                                   \
    if (lo < 64) break;                         /* Legal character. */         \
    if (c == '=' || *i >= srclen) return false; /* Stop decoding. */           \
  }                                                                            \
  expr;                                                                        \
  if (*i >= srclen) return false;                                              \
  if (*k >= dstlen) return false;                                              \
  hi = lo;
  V(/* Nothing. */);
  V(dst[(*k)++] = ((hi & 0x3F) << 2) | ((lo & 0x30) >> 4));
  V(dst[(*k)++] = ((hi & 0x0F) << 4) | ((lo & 0x3C) >> 2));
  V(dst[(*k)++] = ((hi & 0x03) << 6) | ((lo & 0x3F) >> 0));
#undef V
  return true;  // Continue decoding.
}

#ifdef _MSC_VER
#pragma warning(pop)
#endif

template <typename TypeName>
size_t base64_decode_fast(char* const dst, const size_t dstlen,
                          const TypeName* const src, const size_t srclen,
                          const size_t decoded_size) {
  const size_t available = dstlen < decoded_size ? dstlen : decoded_size;
  const size_t max_k = available / 3 * 3;
  size_t max_i = srclen / 4 * 4;
  size_t i = 0;
  size_t k = 0;
  while (i < max_i && k < max_k) {
    const unsigned char txt[] = {
        static_cast<unsigned char>(unbase64(static_cast<uint8_t>(src[i + 0]))),
        static_cast<unsigned char>(unbase64(static_cast<uint8_t>(src[i + 1]))),
        static_cast<unsigned char>(unbase64(static_cast<uint8_t>(src[i + 2]))),
        static_cast<unsigned char>(unbase64(static_cast<uint8_t>(src[i + 3]))),
    };

    const uint32_t v = ReadUint32BE(txt);
    // If MSB is set, input contains whitespace or is not valid base64.
    if (v & 0x80808080) {
      if (!base64_decode_group_slow(dst, dstlen, src, srclen, &i, &k))
        return k;
      max_i = i + (srclen - i) / 4 * 4;  // Align max_i again.
    } else {
      dst[k + 0] = ((v >> 22) & 0xFC) | ((v >> 20) & 0x03);
      dst[k + 1] = ((v >> 12) & 0xF0) | ((v >> 10) & 0x0F);
      dst[k + 2] = ((v >>  2) & 0xC0) | ((v >>  0) & 0x3F);
      i += 4;
      k += 3;
    }
  }
  if (i < srclen && k < dstlen) {
    base64_decode_group_slow(dst, dstlen, src, srclen, &i, &k);
  }
  return k;
}


template <typename TypeName>
size_t base64_decoded_size(const TypeName* src, size_t size) {
  // 1-byte input cannot be decoded
  if (size < 2)
    return 0;

  if (src[size - 1] == '=') {
    size--;
    if (src[size - 1] == '=')
      size--;
  }
  return base64_decoded_size_fast(size);
}


template <typename TypeName>
size_t base64_decode(char* const dst, const size_t dstlen,
                     const TypeName* const src, const size_t srclen) {
  const size_t decoded_size = base64_decoded_size(src, srclen);
  return base64_decode_fast(dst, dstlen, src, srclen, decoded_size);
}


inline size_t base64_encode(const char* src,
                            size_t slen,
                            char* dst,
                            size_t dlen,
                            Base64Mode mode) {
  // We know how much we'll write, just make sure that there's space.
  CHECK(dlen >= base64_encoded_size(slen, mode) &&
        "not enough space provided for base64 encode");

  dlen = base64_encoded_size(slen, mode);

  unsigned a;
  unsigned b;
  unsigned c;
  unsigned i;
  unsigned k;
  unsigned n;

  const char* table = base64_select_table(mode);

  i = 0;
  k = 0;
  n = slen / 3 * 3;

  while (i < n) {
    a = src[i + 0] & 0xff;
    b = src[i + 1] & 0xff;
    c = src[i + 2] & 0xff;

    dst[k + 0] = table[a >> 2];
    dst[k + 1] = table[((a & 3) << 4) | (b >> 4)];
    dst[k + 2] = table[((b & 0x0f) << 2) | (c >> 6)];
    dst[k + 3] = table[c & 0x3f];

    i += 3;
    k += 4;
  }

  switch (slen - n) {
    case 1:
      a = src[i + 0] & 0xff;
      dst[k + 0] = table[a >> 2];
      dst[k + 1] = table[(a & 3) << 4];
      if (mode == Base64Mode::NORMAL) {
        dst[k + 2] = '=';
        dst[k + 3] = '=';
      }
      break;
    case 2:
      a = src[i + 0] & 0xff;
      b = src[i + 1] & 0xff;
      dst[k + 0] = table[a >> 2];
      dst[k + 1] = table[((a & 3) << 4) | (b >> 4)];
      dst[k + 2] = table[(b & 0x0f) << 2];
      if (mode == Base64Mode::NORMAL)
        dst[k + 3] = '=';
      break;
  }

  return dlen;
}

}  // namespace node

#endif  // defined(NODE_WANT_INTERNALS) && NODE_WANT_INTERNALS

#endif  // SRC_BASE64_INL_H_


Generated by: GCOVR (Version 4.2)

Line	Branch	Exec	Source
1			#ifndef SRC_BASE64_INL_H_
2			#define SRC_BASE64_INL_H_
3
4			#if defined(NODE_WANT_INTERNALS) && NODE_WANT_INTERNALS
5
6			#include "base64.h"
7			#include "util.h"
8
9			namespace node {
10
11			extern const int8_t unbase64_table[256];
12
13
14		17658138	inline static int8_t unbase64(uint8_t x) {
15		17658138	return unbase64_table[x];
16			}
17
18
19		4412583	inline uint32_t ReadUint32BE(const unsigned char* p) {
20		8825166	return static_cast<uint32_t>(p[0] << 24U) \|
21		8825166	static_cast<uint32_t>(p[1] << 16U) \|
22		4412583	static_cast<uint32_t>(p[2] << 8U) \|
23		4412583	static_cast<uint32_t>(p[3]);
24			}
25
26			#ifdef _MSC_VER
27			#pragma warning(push)
28			// MSVC C4003: not enough actual parameters for macro 'identifier'
29			#pragma warning(disable : 4003)
30			#endif
31
32			template <typename TypeName>
33		6427	bool base64_decode_group_slow(char* const dst, const size_t dstlen,
34			const TypeName* const src, const size_t srclen,
35			size_t* const i, size_t* const k) {
36			uint8_t hi;
37			uint8_t lo;
38			#define V(expr) \
39			for (;;) { \
40			const uint8_t c = static_cast<uint8_t>(src[*i]); \
41			lo = unbase64(c); \
42			*i += 1; \
43			if (lo < 64) break; /* Legal character. */ \
44			if (c == '=' \|\| i >= srclen) return false; / Stop decoding. */ \
45			} \
46			expr; \
47			if (*i >= srclen) return false; \
48			if (*k >= dstlen) return false; \
49			hi = lo;
50	✓✓✓✓ ✗✓✗✓ ✗✓✓✗ ✗✗✗✗ ✗✓✗✓	3245	V(/* Nothing. */);
51	✓✓✓✗ ✗✓✓✓ ✓✓✓✗ ✗✗✗✗ ✗✓✓✓	3164	V(dst[(*k)++] = ((hi & 0x3F) << 2) \| ((lo & 0x30) >> 4));
52	✓✓✓✓ ✓✓✓✓ ✓✓✓✓ ✗✓✗✗ ✗✓✓✗	1411	V(dst[(*k)++] = ((hi & 0x0F) << 4) \| ((lo & 0x3C) >> 2));
53	✓✓✓✓ ✗✓✓✓ ✗✓✗✗ ✗✗✗✗ ✗✗✗✗	90	V(dst[(*k)++] = ((hi & 0x03) << 6) \| ((lo & 0x3F) >> 0));
54			#undef V
55		70	return true; // Continue decoding.
56			}
57
58			#ifdef _MSC_VER
59			#pragma warning(pop)
60			#endif
61
62			template <typename TypeName>
63		7948	size_t base64_decode_fast(char* const dst, const size_t dstlen,
64			const TypeName* const src, const size_t srclen,
65			const size_t decoded_size) {
66	✓✓	7948	const size_t available = dstlen < decoded_size ? dstlen : decoded_size;
67		7948	const size_t max_k = available / 3 * 3;
68		7948	size_t max_i = srclen / 4 * 4;
69		7948	size_t i = 0;
70		7948	size_t k = 0;
71	✓✓✓✓	8832415	while (i < max_i && k < max_k) {
72		35298000	const unsigned char txt[] = {
73		8824500	static_cast<unsigned char>(unbase64(static_cast<uint8_t>(src[i + 0]))),
74		8824500	static_cast<unsigned char>(unbase64(static_cast<uint8_t>(src[i + 1]))),
75		8824500	static_cast<unsigned char>(unbase64(static_cast<uint8_t>(src[i + 2]))),
76		8824500	static_cast<unsigned char>(unbase64(static_cast<uint8_t>(src[i + 3]))),
77			};
78
79		8824500	const uint32_t v = ReadUint32BE(txt);
80			// If MSB is set, input contains whitespace or is not valid base64.
81	✓✓	8824500	if (v & 0x80808080) {
82	✓✓	151	if (!base64_decode_group_slow(dst, dstlen, src, srclen, &i, &k))
83		33	return k;
84		118	max_i = i + (srclen - i) / 4 * 4; // Align max_i again.
85			} else {
86		8824349	dst[k + 0] = ((v >> 22) & 0xFC) \| ((v >> 20) & 0x03);
87		8824349	dst[k + 1] = ((v >> 12) & 0xF0) \| ((v >> 10) & 0x0F);
88		8824349	dst[k + 2] = ((v >> 2) & 0xC0) \| ((v >> 0) & 0x3F);
89		8824349	i += 4;
90		8824349	k += 3;
91			}
92			}
93	✓✓✓✓	7915	if (i < srclen && k < dstlen) {
94		6110	base64_decode_group_slow(dst, dstlen, src, srclen, &i, &k);
95			}
96		7915	return k;
97			}
98
99
100			template <typename TypeName>
101		14330	size_t base64_decoded_size(const TypeName* src, size_t size) {
102			// 1-byte input cannot be decoded
103	✗✓	14330	if (size < 2)
104			return 0;
105
106	✓✓	14330	if (src[size - 1] == '=') {
107		1324	size--;
108	✓✓	1324	if (src[size - 1] == '=')
109		958	size--;
110			}
111		14330	return base64_decoded_size_fast(size);
112			}
113
114
115			template <typename TypeName>
116		7948	size_t base64_decode(char* const dst, const size_t dstlen,
117			const TypeName* const src, const size_t srclen) {
118		7948	const size_t decoded_size = base64_decoded_size(src, srclen);
119		7948	return base64_decode_fast(dst, dstlen, src, srclen, decoded_size);
120			}
121
122
123		6948	inline size_t base64_encode(const char* src,
124			size_t slen,
125			char* dst,
126			size_t dlen,
127			Base64Mode mode) {
128			// We know how much we'll write, just make sure that there's space.
129	✗✓✗✓	6948	CHECK(dlen >= base64_encoded_size(slen, mode) &&
130			"not enough space provided for base64 encode");
131
132		6948	dlen = base64_encoded_size(slen, mode);
133
134			unsigned a;
135			unsigned b;
136			unsigned c;
137			unsigned i;
138			unsigned k;
139			unsigned n;
140
141		6948	const char* table = base64_select_table(mode);
142
143		6948	i = 0;
144		6948	k = 0;
145		6948	n = slen / 3 * 3;
146
147	✓✓	183712944	while (i < n) {
148		183705996	a = src[i + 0] & 0xff;
149		183705996	b = src[i + 1] & 0xff;
150		183705996	c = src[i + 2] & 0xff;
151
152		183705996	dst[k + 0] = table[a >> 2];
153		183705996	dst[k + 1] = table[((a & 3) << 4) \| (b >> 4)];
154		183705996	dst[k + 2] = table[((b & 0x0f) << 2) \| (c >> 6)];
155		183705996	dst[k + 3] = table[c & 0x3f];
156
157		183705996	i += 3;
158		183705996	k += 4;
159			}
160
161	✓✓✓	6948	switch (slen - n) {
162		2302	case 1:
163		2302	a = src[i + 0] & 0xff;
164		2302	dst[k + 0] = table[a >> 2];
165		2302	dst[k + 1] = table[(a & 3) << 4];
166	✓✓	2302	if (mode == Base64Mode::NORMAL) {
167		913	dst[k + 2] = '=';
168		913	dst[k + 3] = '=';
169			}
170		2302	break;
171		1433	case 2:
172		1433	a = src[i + 0] & 0xff;
173		1433	b = src[i + 1] & 0xff;
174		1433	dst[k + 0] = table[a >> 2];
175		1433	dst[k + 1] = table[((a & 3) << 4) \| (b >> 4)];
176		1433	dst[k + 2] = table[(b & 0x0f) << 2];
177	✓✓	1433	if (mode == Base64Mode::NORMAL)
178		303	dst[k + 3] = '=';
179		1433	break;
180			}
181
182		6948	return dlen;
183			}
184
185			} // namespace node
186
187			#endif // defined(NODE_WANT_INTERNALS) && NODE_WANT_INTERNALS
188
189			#endif // SRC_BASE64_INL_H_