summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/evp/encode.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/evp/encode.c')
-rw-r--r--src/lib/libcrypto/evp/encode.c417
1 files changed, 0 insertions, 417 deletions
diff --git a/src/lib/libcrypto/evp/encode.c b/src/lib/libcrypto/evp/encode.c
deleted file mode 100644
index 725667bfff..0000000000
--- a/src/lib/libcrypto/evp/encode.c
+++ /dev/null
@@ -1,417 +0,0 @@
1/* $OpenBSD: encode.c,v 1.20 2015/02/07 13:19:15 doug Exp $ */
2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3 * All rights reserved.
4 *
5 * This package is an SSL implementation written
6 * by Eric Young (eay@cryptsoft.com).
7 * The implementation was written so as to conform with Netscapes SSL.
8 *
9 * This library is free for commercial and non-commercial use as long as
10 * the following conditions are aheared to. The following conditions
11 * apply to all code found in this distribution, be it the RC4, RSA,
12 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
13 * included with this distribution is covered by the same copyright terms
14 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15 *
16 * Copyright remains Eric Young's, and as such any Copyright notices in
17 * the code are not to be removed.
18 * If this package is used in a product, Eric Young should be given attribution
19 * as the author of the parts of the library used.
20 * This can be in the form of a textual message at program startup or
21 * in documentation (online or textual) provided with the package.
22 *
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
25 * are met:
26 * 1. Redistributions of source code must retain the copyright
27 * notice, this list of conditions and the following disclaimer.
28 * 2. Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in the
30 * documentation and/or other materials provided with the distribution.
31 * 3. All advertising materials mentioning features or use of this software
32 * must display the following acknowledgement:
33 * "This product includes cryptographic software written by
34 * Eric Young (eay@cryptsoft.com)"
35 * The word 'cryptographic' can be left out if the rouines from the library
36 * being used are not cryptographic related :-).
37 * 4. If you include any Windows specific code (or a derivative thereof) from
38 * the apps directory (application code) you must include an acknowledgement:
39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40 *
41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51 * SUCH DAMAGE.
52 *
53 * The licence and distribution terms for any publically available version or
54 * derivative of this code cannot be changed. i.e. this code cannot simply be
55 * copied and put under another distribution licence
56 * [including the GNU Public Licence.]
57 */
58
59#include <stdio.h>
60#include <string.h>
61
62#include <openssl/evp.h>
63
64#define conv_bin2ascii(a) (data_bin2ascii[(a)&0x3f])
65#define conv_ascii2bin(a) (data_ascii2bin[(a)&0x7f])
66
67/* 64 char lines
68 * pad input with 0
69 * left over chars are set to =
70 * 1 byte => xx==
71 * 2 bytes => xxx=
72 * 3 bytes => xxxx
73 */
74#define BIN_PER_LINE (64/4*3)
75#define CHUNKS_PER_LINE (64/4)
76#define CHAR_PER_LINE (64+1)
77
78static const unsigned char data_bin2ascii[65] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ\
79abcdefghijklmnopqrstuvwxyz0123456789+/";
80
81/* 0xF0 is a EOLN
82 * 0xF1 is ignore but next needs to be 0xF0 (for \r\n processing).
83 * 0xF2 is EOF
84 * 0xE0 is ignore at start of line.
85 * 0xFF is error
86 */
87
88#define B64_EOLN 0xF0
89#define B64_CR 0xF1
90#define B64_EOF 0xF2
91#define B64_WS 0xE0
92#define B64_ERROR 0xFF
93#define B64_NOT_BASE64(a) (((a)|0x13) == 0xF3)
94
95static const unsigned char data_ascii2bin[128] = {
96 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
97 0xFF, 0xE0, 0xF0, 0xFF, 0xFF, 0xF1, 0xFF, 0xFF,
98 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
99 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
100 0xE0, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
101 0xFF, 0xFF, 0xFF, 0x3E, 0xFF, 0xF2, 0xFF, 0x3F,
102 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3A, 0x3B,
103 0x3C, 0x3D, 0xFF, 0xFF, 0xFF, 0x00, 0xFF, 0xFF,
104 0xFF, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06,
105 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E,
106 0x0F, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16,
107 0x17, 0x18, 0x19, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
108 0xFF, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x20,
109 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28,
110 0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E, 0x2F, 0x30,
111 0x31, 0x32, 0x33, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
112};
113
114void
115EVP_EncodeInit(EVP_ENCODE_CTX *ctx)
116{
117 ctx->length = 48;
118 ctx->num = 0;
119 ctx->line_num = 0;
120}
121
122void
123EVP_EncodeUpdate(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl,
124 const unsigned char *in, int inl)
125{
126 int i, j;
127 unsigned int total = 0;
128
129 *outl = 0;
130 if (inl == 0)
131 return;
132 OPENSSL_assert(ctx->length <= (int)sizeof(ctx->enc_data));
133 if ((ctx->num + inl) < ctx->length) {
134 memcpy(&(ctx->enc_data[ctx->num]), in, inl);
135 ctx->num += inl;
136 return;
137 }
138 if (ctx->num != 0) {
139 i = ctx->length - ctx->num;
140 memcpy(&(ctx->enc_data[ctx->num]), in, i);
141 in += i;
142 inl -= i;
143 j = EVP_EncodeBlock(out, ctx->enc_data, ctx->length);
144 ctx->num = 0;
145 out += j;
146 *(out++) = '\n';
147 *out = '\0';
148 total = j + 1;
149 }
150 while (inl >= ctx->length) {
151 j = EVP_EncodeBlock(out, in, ctx->length);
152 in += ctx->length;
153 inl -= ctx->length;
154 out += j;
155 *(out++) = '\n';
156 *out = '\0';
157 total += j + 1;
158 }
159 if (inl != 0)
160 memcpy(&(ctx->enc_data[0]), in, inl);
161 ctx->num = inl;
162 *outl = total;
163}
164
165void
166EVP_EncodeFinal(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl)
167{
168 unsigned int ret = 0;
169
170 if (ctx->num != 0) {
171 ret = EVP_EncodeBlock(out, ctx->enc_data, ctx->num);
172 out[ret++] = '\n';
173 out[ret] = '\0';
174 ctx->num = 0;
175 }
176 *outl = ret;
177}
178
179int
180EVP_EncodeBlock(unsigned char *t, const unsigned char *f, int dlen)
181{
182 int i, ret = 0;
183 unsigned long l;
184
185 for (i = dlen; i > 0; i -= 3) {
186 if (i >= 3) {
187 l = (((unsigned long)f[0]) << 16L) |
188 (((unsigned long)f[1]) << 8L) | f[2];
189 *(t++) = conv_bin2ascii(l >> 18L);
190 *(t++) = conv_bin2ascii(l >> 12L);
191 *(t++) = conv_bin2ascii(l >> 6L);
192 *(t++) = conv_bin2ascii(l );
193 } else {
194 l = ((unsigned long)f[0]) << 16L;
195 if (i == 2)
196 l |= ((unsigned long)f[1] << 8L);
197
198 *(t++) = conv_bin2ascii(l >> 18L);
199 *(t++) = conv_bin2ascii(l >> 12L);
200 *(t++) = (i == 1) ? '=' : conv_bin2ascii(l >> 6L);
201 *(t++) = '=';
202 }
203 ret += 4;
204 f += 3;
205 }
206
207 *t = '\0';
208 return (ret);
209}
210
211void
212EVP_DecodeInit(EVP_ENCODE_CTX *ctx)
213{
214 ctx->length = 30;
215 ctx->num = 0;
216 ctx->line_num = 0;
217 ctx->expect_nl = 0;
218}
219
220/* -1 for error
221 * 0 for last line
222 * 1 for full line
223 */
224int
225EVP_DecodeUpdate(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl,
226 const unsigned char *in, int inl)
227{
228 int seof = -1, eof = 0, rv = -1, ret = 0, i, v, tmp, n, ln, exp_nl;
229 unsigned char *d;
230
231 n = ctx->num;
232 d = ctx->enc_data;
233 ln = ctx->line_num;
234 exp_nl = ctx->expect_nl;
235
236 /* last line of input. */
237 if ((inl == 0) || ((n == 0) && (conv_ascii2bin(in[0]) == B64_EOF))) {
238 rv = 0;
239 goto end;
240 }
241
242 /* We parse the input data */
243 for (i = 0; i < inl; i++) {
244 /* If the current line is > 80 characters, scream alot */
245 if (ln >= 80) {
246 rv = -1;
247 goto end;
248 }
249
250 /* Get char and put it into the buffer */
251 tmp= *(in++);
252 v = conv_ascii2bin(tmp);
253 /* only save the good data :-) */
254 if (!B64_NOT_BASE64(v)) {
255 OPENSSL_assert(n < (int)sizeof(ctx->enc_data));
256 d[n++] = tmp;
257 ln++;
258 } else if (v == B64_ERROR) {
259 rv = -1;
260 goto end;
261 }
262
263 /* There should not be base64 data after padding. */
264 if (eof && tmp != '=' && tmp != '\r' && tmp != '\n' &&
265 v != B64_EOF) {
266 rv = -1;
267 goto end;
268 }
269
270 /* have we seen a '=' which is 'definitely' the last
271 * input line. seof will point to the character that
272 * holds it. and eof will hold how many characters to
273 * chop off. */
274 if (tmp == '=') {
275 if (seof == -1)
276 seof = n;
277 eof++;
278 }
279
280 /* There should be no more than two padding markers. */
281 if (eof > 2) {
282 rv = -1;
283 goto end;
284 }
285
286 if (v == B64_CR) {
287 ln = 0;
288 if (exp_nl)
289 continue;
290 }
291
292 /* eoln */
293 if (v == B64_EOLN) {
294 ln = 0;
295 if (exp_nl) {
296 exp_nl = 0;
297 continue;
298 }
299 }
300 exp_nl = 0;
301
302 /* If we are at the end of input and it looks like a
303 * line, process it. */
304 if (((i + 1) == inl) && (((n&3) == 0) || eof)) {
305 v = B64_EOF;
306 /* In case things were given us in really small
307 records (so two '=' were given in separate
308 updates), eof may contain the incorrect number
309 of ending bytes to skip, so let's redo the count */
310 eof = 0;
311 if (d[n-1] == '=')
312 eof++;
313 if (d[n-2] == '=')
314 eof++;
315 /* There will never be more than two '=' */
316 }
317
318 if ((v == B64_EOF && (n&3) == 0) || (n >= 64)) {
319 /* This is needed to work correctly on 64 byte input
320 * lines. We process the line and then need to
321 * accept the '\n' */
322 if ((v != B64_EOF) && (n >= 64))
323 exp_nl = 1;
324 if (n > 0) {
325 v = EVP_DecodeBlock(out, d, n);
326 n = 0;
327 if (v < 0) {
328 rv = 0;
329 goto end;
330 }
331 ret += (v - eof);
332 } else {
333 eof = 1;
334 v = 0;
335 }
336
337 /* This is the case where we have had a short
338 * but valid input line */
339 if ((v < ctx->length) && eof) {
340 rv = 0;
341 goto end;
342 } else
343 ctx->length = v;
344
345 if (seof >= 0) {
346 rv = 0;
347 goto end;
348 }
349 out += v;
350 }
351 }
352 rv = 1;
353
354end:
355 *outl = ret;
356 ctx->num = n;
357 ctx->line_num = ln;
358 ctx->expect_nl = exp_nl;
359 return (rv);
360}
361
362int
363EVP_DecodeBlock(unsigned char *t, const unsigned char *f, int n)
364{
365 int i, ret = 0, a, b, c, d;
366 unsigned long l;
367
368 /* trim white space from the start of the line. */
369 while ((conv_ascii2bin(*f) == B64_WS) && (n > 0)) {
370 f++;
371 n--;
372 }
373
374 /* strip off stuff at the end of the line
375 * ascii2bin values B64_WS, B64_EOLN, B64_EOLN and B64_EOF */
376 while ((n > 3) && (B64_NOT_BASE64(conv_ascii2bin(f[n - 1]))))
377 n--;
378
379 if (n % 4 != 0)
380 return (-1);
381
382 for (i = 0; i < n; i += 4) {
383 a = conv_ascii2bin(*(f++));
384 b = conv_ascii2bin(*(f++));
385 c = conv_ascii2bin(*(f++));
386 d = conv_ascii2bin(*(f++));
387 if ((a & 0x80) || (b & 0x80) ||
388 (c & 0x80) || (d & 0x80))
389 return (-1);
390 l = ((((unsigned long)a) << 18L) |
391 (((unsigned long)b) << 12L) |
392 (((unsigned long)c) << 6L) |
393 (((unsigned long)d)));
394 *(t++) = (unsigned char)(l >> 16L) & 0xff;
395 *(t++) = (unsigned char)(l >> 8L) & 0xff;
396 *(t++) = (unsigned char)(l) & 0xff;
397 ret += 3;
398 }
399 return (ret);
400}
401
402int
403EVP_DecodeFinal(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl)
404{
405 int i;
406
407 *outl = 0;
408 if (ctx->num != 0) {
409 i = EVP_DecodeBlock(out, ctx->enc_data, ctx->num);
410 if (i < 0)
411 return (-1);
412 ctx->num = 0;
413 *outl = i;
414 return (1);
415 } else
416 return (1);
417}
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-11-23 11:12:04 +0000