Coverage Report

Created: 2026-11-12 07:30

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/assimp/code/Common/Base64.cpp
Line
Count
Source
1
/*
2
---------------------------------------------------------------------------
3
Open Asset Import Library (assimp)
4
---------------------------------------------------------------------------
5
6
Copyright (c) 2006-2026, assimp team
7
8
All rights reserved.
9
10
Redistribution and use of this software in source and binary forms,
11
with or without modification, are permitted provided that the following
12
conditions are met:
13
14
* Redistributions of source code must retain the above
15
  copyright notice, this list of conditions and the
16
  following disclaimer.
17
18
* Redistributions in binary form must reproduce the above
19
  copyright notice, this list of conditions and the
20
  following disclaimer in the documentation and/or other
21
  materials provided with the distribution.
22
23
* Neither the name of the assimp team, nor the names of its
24
  contributors may be used to endorse or promote products
25
  derived from this software without specific prior
26
  written permission of the assimp team.
27
28
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
29
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
30
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
31
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
32
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
33
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
34
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
35
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
36
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
37
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
38
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39
---------------------------------------------------------------------------
40
*/
41
42
#include <assimp/Base64.hpp>
43
#include <assimp/Exceptional.h>
44
45
namespace Assimp {
46
47
namespace Base64 {
48
49
static constexpr uint8_t tableDecodeBase64[128] = {
50
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
51
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
52
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 62, 0, 0, 0, 63,
53
    52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 0, 0, 0, 64, 0, 0,
54
    0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
55
    15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 0, 0, 0, 0, 0,
56
    0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
57
    41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 0, 0, 0, 0, 0
58
};
59
60
static constexpr char tableEncodeBase64[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
61
62
2.14M
static inline char EncodeChar(uint8_t b) {
63
2.14M
    return tableEncodeBase64[size_t(b)];
64
2.14M
}
65
66
1.43M
inline uint8_t DecodeChar(char c) {
67
1.43M
    if (c & 0x80) {
68
42
        throw DeadlyImportError("Invalid base64 char value: ", size_t(c));
69
42
    }
70
1.43M
    return tableDecodeBase64[size_t(c & 0x7F)]; // TODO faster with lookup table or ifs?
71
1.43M
}
72
73
433
void Encode(const uint8_t *in, size_t inLength, std::string &out) {
74
433
    if (in == nullptr || inLength==0) {
75
0
        out.clear();
76
0
        return;
77
0
    }
78
79
433
    size_t outLength = ((inLength + 2) / 3) * 4;
80
81
433
    size_t j = out.size();
82
433
    out.resize(j + outLength);
83
84
538k
    for (size_t i = 0; i < inLength; i += 3) {
85
537k
        uint8_t b = (in[i] & 0xFC) >> 2;
86
537k
        out[j++] = EncodeChar(b);
87
88
537k
        b = (in[i] & 0x03) << 4;
89
537k
        if (i + 1 < inLength) {
90
537k
            b |= (in[i + 1] & 0xF0) >> 4;
91
537k
            out[j++] = EncodeChar(b);
92
93
537k
            b = (in[i + 1] & 0x0F) << 2;
94
537k
            if (i + 2 < inLength) {
95
537k
                b |= (in[i + 2] & 0xC0) >> 6;
96
537k
                out[j++] = EncodeChar(b);
97
98
537k
                b = in[i + 2] & 0x3F;
99
537k
                out[j++] = EncodeChar(b);
100
537k
            } else {
101
15
                out[j++] = EncodeChar(b);
102
15
                out[j++] = '=';
103
15
            }
104
537k
        } else {
105
334
            out[j++] = EncodeChar(b);
106
334
            out[j++] = '=';
107
334
            out[j++] = '=';
108
334
        }
109
537k
    }
110
433
}
111
112
0
void Encode(const std::vector<uint8_t> &in, std::string &out) {
113
0
    Encode(in.data(), in.size(), out);
114
0
}
115
116
0
std::string Encode(const std::vector<uint8_t> &in) {
117
0
    std::string encoded;
118
0
    Encode(in, encoded);
119
0
    return encoded;
120
0
}
121
122
1.14k
size_t Decode(const char *in, size_t inLength, uint8_t *&out) {
123
1.14k
    if (in == nullptr) {
124
0
        out = nullptr;
125
0
        return 0;
126
0
    }
127
128
1.14k
    if (inLength % 4 != 0) {
129
46
        throw DeadlyImportError("Invalid base64 encoded data: \"", std::string(in, std::min(size_t(32), inLength)),
130
46
            "\", length:", inLength);
131
46
    }
132
133
1.10k
    if (inLength < 4) {
134
0
        out = nullptr;
135
0
        return 0;
136
0
    }
137
138
1.10k
    int nEquals = int(in[inLength - 1] == '=') +
139
1.10k
                  int(in[inLength - 2] == '=');
140
141
1.10k
    size_t outLength = (inLength * 3) / 4 - nEquals;
142
1.10k
    out = new uint8_t[outLength];
143
1.10k
    memset(out, 0, outLength);
144
145
1.10k
    size_t i, j = 0;
146
147
358k
    for (i = 0; i + 4 < inLength; i += 4) {
148
357k
        uint8_t b0 = DecodeChar(in[i]);
149
357k
        uint8_t b1 = DecodeChar(in[i + 1]);
150
357k
        uint8_t b2 = DecodeChar(in[i + 2]);
151
357k
        uint8_t b3 = DecodeChar(in[i + 3]);
152
153
357k
        out[j++] = (uint8_t)((b0 << 2) | (b1 >> 4));
154
357k
        out[j++] = (uint8_t)((b1 << 4) | (b2 >> 2));
155
357k
        out[j++] = (uint8_t)((b2 << 6) | b3);
156
357k
    }
157
158
1.10k
    {
159
1.10k
        uint8_t b0 = DecodeChar(in[i]);
160
1.10k
        uint8_t b1 = DecodeChar(in[i + 1]);
161
1.10k
        uint8_t b2 = DecodeChar(in[i + 2]);
162
1.10k
        uint8_t b3 = DecodeChar(in[i + 3]);
163
164
1.10k
        out[j++] = (uint8_t)((b0 << 2) | (b1 >> 4));
165
1.10k
        if (b2 < 64) out[j++] = (uint8_t)((b1 << 4) | (b2 >> 2));
166
1.10k
        if (b3 < 64) out[j++] = (uint8_t)((b2 << 6) | b3);
167
1.10k
    }
168
169
1.10k
    return outLength;
170
1.10k
}
171
172
0
size_t Decode(const std::string &in, std::vector<uint8_t> &out) {
173
0
    uint8_t *outPtr = nullptr;
174
0
    size_t decodedSize = Decode(in.data(), in.size(), outPtr);
175
0
    if (outPtr == nullptr) {
176
0
        return 0;
177
0
    }
178
0
    out.assign(outPtr, outPtr + decodedSize);
179
0
    delete[] outPtr;
180
0
    return decodedSize;
181
0
}
182
183
0
std::vector<uint8_t> Decode(const std::string &in) {
184
0
    std::vector<uint8_t> result;
185
0
    Decode(in, result);
186
0
    return result;
187
0
}
188
189
} // namespace Base64
190
} // namespace Assimp