1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
|
/*
* Copyright (C) 2020 Linux Studio Plugins Project <https://lsp-plug.in/>
* (C) 2020 Vladimir Sadovnikov <sadko4u@gmail.com>
*
* This file is part of lsp-dsp-lib
* Created on: 31 мар. 2020 г.
*
* lsp-dsp-lib 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 3 of the License, or
* any later version.
*
* lsp-dsp-lib 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 lsp-dsp-lib. If not, see <https://www.gnu.org/licenses/>.
*/
#ifndef PRIVATE_DSP_ARCH_GENERIC_CODING_H_
#define PRIVATE_DSP_ARCH_GENERIC_CODING_H_
#ifndef PRIVATE_DSP_ARCH_GENERIC_IMPL
#error "This header should not be included directly"
#endif /* PRIVATE_DSP_ARCH_GENERIC_IMPL */
/*
#include <string.h>
#include <stdio.h>
static const char *base64_table = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
int main()
{
for (int i=0; i<0x100; ++i)
{
const char *p = (i != '=') ? ::strchr(base64_table, i) : base64_table;
if ((p == NULL) || (i == '\0'))
printf(" -1, ");
else
printf("0x%02x, ", int(p - base64_table));
if ((i & 0x0f) == 0x0f)
printf("\n");
}
return 0;
}
*/
namespace lsp
{
namespace generic
{
static const char *base64_table = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
static const int8_t base64_lookup[] = {
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0x3e, -1, -1, -1, 0x3f,
0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, -1, -1, -1, -1, -1, -1,
-1, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e,
0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, -1, -1, -1, -1, -1,
-1, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, 0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28,
0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f, 0x30, 0x31, 0x32, 0x33, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
};
size_t base64_enc(void *dst, size_t *dst_left, const void *src, size_t *src_left)
{
uint8_t *d = reinterpret_cast<uint8_t *>(dst);
const uint8_t *s = reinterpret_cast<const uint8_t *>(src);
size_t dl = *dst_left, sl = *src_left, n = 0;
// Main body
while (sl >= 3)
{
// Enough space?
if (dl < 4)
break;
// Perform encode
uint32_t x = (s[0] << 16) | (s[1] << 8) | s[2];
d[0] = base64_table[x >> 18];
d[1] = base64_table[(x >> 12) & 0x3f];
d[2] = base64_table[(x >> 6) & 0x3f];
d[3] = base64_table[x & 0x3f];
n += 3;
s += 3;
d += 4;
sl -= 3;
dl -= 4;
}
// Tail
if (sl > 0)
{
if ((sl == 1) && (dl >= 2))
{
uint32_t x = s[0];
d[0] = base64_table[x >> 2];
d[1] = base64_table[(x << 4) & 0x3f];
n += 1;
sl -= 1;
dl -= 2;
}
else if ((sl == 2) && (dl >= 3))
{
uint32_t x = (s[0] << 8) | s[1];
d[0] = base64_table[x >> 10];
d[1] = base64_table[(x >> 4) & 0x3f];
d[2] = base64_table[(x << 2) & 0x3f];
n += 2;
sl -= 2;
dl -= 3;
}
}
*dst_left = dl;
*src_left = sl;
return n;
}
ssize_t base64_dec(void *dst, size_t *dst_left, const void *src, size_t *src_left)
{
uint8_t *d = reinterpret_cast<uint8_t *>(dst);
const uint8_t *s = reinterpret_cast<const uint8_t *>(src);
size_t dl = *dst_left, sl = *src_left, n = 0;
int32_t x;
// Main body
while (sl >= 4)
{
// Enough space?
if (dl < 3)
break;
x = (base64_lookup[s[0]] << 18) |
(base64_lookup[s[1]] << 12) |
(base64_lookup[s[2]] << 6) |
base64_lookup[s[3]];
if (x < 0)
{
if (n > 0) break;
else return -1;
}
d[0] = uint8_t(x >> 16);
d[1] = uint8_t(x >> 8);
d[2] = uint8_t(x);
d += 3;
s += 4;
dl -= 3;
sl -= 4;
n += 3;
}
// Tail
if (sl > 0)
{
if ((sl == 3) && (dl >= 2))
{
x = (base64_lookup[s[0]] << 12) |
(base64_lookup[s[1]] << 6) |
base64_lookup[s[2]];
if (x >= 0)
{
d[0] = uint8_t(x >> 10);
d[1] = uint8_t(x >> 2);
dl -= 2;
sl -= 3;
n += 2;
}
else if (n <= 0)
return -1;
}
else if ((sl == 2) && (dl >= 1))
{
x = (base64_lookup[s[0]] << 6) |
base64_lookup[s[1]];
if (x >= 0)
{
d[0] = uint8_t(x >> 4);
dl -= 1;
sl -= 2;
n += 1;
}
else if (n <= 0)
return -1;
}
else if ((sl == 1) && (n <= 0))
return -1;
}
*dst_left = dl;
*src_left = sl;
return n;
}
}
}
#endif /* PRIVATE_DSP_ARCH_GENERIC_CODING_H_ */
|
