summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/evp/encode.c
diff options
context:
space:
mode:
authorryker <>1998-10-05 20:13:14 +0000
committerryker <>1998-10-05 20:13:14 +0000
commitaeeae06a79815dc190061534d47236cec09f9e32 (patch)
tree851692b9c2f9c04f077666855641900f19fdb217 /src/lib/libcrypto/evp/encode.c
parenta4f79641824cbf9f60ca9d1168d1fcc46717a82a (diff)
downloadopenbsd-aeeae06a79815dc190061534d47236cec09f9e32.tar.gz
openbsd-aeeae06a79815dc190061534d47236cec09f9e32.tar.bz2
openbsd-aeeae06a79815dc190061534d47236cec09f9e32.zip
Import of SSLeay-0.9.0b with RSA and IDEA stubbed + OpenBSD build
functionality for shared libs. Note that routines such as sslv2_init and friends that use RSA will not work due to lack of RSA in this library. Needs documentation and help from ports for easy upgrade to full functionality where legally possible.
Diffstat (limited to 'src/lib/libcrypto/evp/encode.c')
-rw-r--r--src/lib/libcrypto/evp/encode.c438
1 files changed, 438 insertions, 0 deletions
diff --git a/src/lib/libcrypto/evp/encode.c b/src/lib/libcrypto/evp/encode.c
new file mode 100644
index 0000000000..14d47c1eed
--- /dev/null
+++ b/src/lib/libcrypto/evp/encode.c
@@ -0,0 +1,438 @@
1/* crypto/evp/encode.c */
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 "cryptlib.h"
61#include "evp.h"
62
63#define conv_bin2ascii(a) (data_bin2ascii[(a)&0x3f])
64#define conv_ascii2bin(a) (data_ascii2bin[(a)&0x7f])
65
66/* 64 char lines
67 * pad input with 0
68 * left over chars are set to =
69 * 1 byte => xx==
70 * 2 bytes => xxx=
71 * 3 bytes => xxxx
72 */
73#define BIN_PER_LINE (64/4*3)
74#define CHUNKS_PER_LINE (64/4)
75#define CHAR_PER_LINE (64+1)
76
77static unsigned char data_bin2ascii[65]="ABCDEFGHIJKLMNOPQRSTUVWXYZ\
78abcdefghijklmnopqrstuvwxyz0123456789+/";
79
80/* 0xF0 is a EOLN
81 * 0xF1 is ignore but next needs to be 0xF0 (for \r\n processing).
82 * 0xF2 is EOF
83 * 0xE0 is ignore at start of line.
84 * 0xFF is error
85 */
86
87#define B64_EOLN 0xF0
88#define B64_CR 0xF1
89#define B64_EOF 0xF2
90#define B64_WS 0xE0
91#define B64_ERROR 0xFF
92#define B64_NOT_BASE64(a) (((a)|0x13) == 0xF3)
93
94static unsigned char data_ascii2bin[128]={
95 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
96 0xFF,0xE0,0xF0,0xFF,0xFF,0xF1,0xFF,0xFF,
97 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
98 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
99 0xE0,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
100 0xFF,0xFF,0xFF,0x3E,0xFF,0xF2,0xFF,0x3F,
101 0x34,0x35,0x36,0x37,0x38,0x39,0x3A,0x3B,
102 0x3C,0x3D,0xFF,0xFF,0xFF,0x00,0xFF,0xFF,
103 0xFF,0x00,0x01,0x02,0x03,0x04,0x05,0x06,
104 0x07,0x08,0x09,0x0A,0x0B,0x0C,0x0D,0x0E,
105 0x0F,0x10,0x11,0x12,0x13,0x14,0x15,0x16,
106 0x17,0x18,0x19,0xFF,0xFF,0xFF,0xFF,0xFF,
107 0xFF,0x1A,0x1B,0x1C,0x1D,0x1E,0x1F,0x20,
108 0x21,0x22,0x23,0x24,0x25,0x26,0x27,0x28,
109 0x29,0x2A,0x2B,0x2C,0x2D,0x2E,0x2F,0x30,
110 0x31,0x32,0x33,0xFF,0xFF,0xFF,0xFF,0xFF,
111 };
112
113void EVP_EncodeInit(ctx)
114EVP_ENCODE_CTX *ctx;
115 {
116 ctx->length=48;
117 ctx->num=0;
118 ctx->line_num=0;
119 }
120
121void EVP_EncodeUpdate(ctx,out,outl,in,inl)
122EVP_ENCODE_CTX *ctx;
123unsigned char *out;
124int *outl;
125unsigned char *in;
126int inl;
127 {
128 int i,j;
129 unsigned int total=0;
130
131 *outl=0;
132 if (inl == 0) return;
133 if ((ctx->num+inl) < ctx->length)
134 {
135 memcpy(&(ctx->enc_data[ctx->num]),in,inl);
136 ctx->num+=inl;
137 return;
138 }
139 if (ctx->num != 0)
140 {
141 i=ctx->length-ctx->num;
142 memcpy(&(ctx->enc_data[ctx->num]),in,i);
143 in+=i;
144 inl-=i;
145 j=EVP_EncodeBlock(out,ctx->enc_data,ctx->length);
146 ctx->num=0;
147 out+=j;
148 *(out++)='\n';
149 *out='\0';
150 total=j+1;
151 }
152 while (inl >= ctx->length)
153 {
154 j=EVP_EncodeBlock(out,in,ctx->length);
155 in+=ctx->length;
156 inl-=ctx->length;
157 out+=j;
158 *(out++)='\n';
159 *out='\0';
160 total+=j+1;
161 }
162 if (inl != 0)
163 memcpy(&(ctx->enc_data[0]),in,inl);
164 ctx->num=inl;
165 *outl=total;
166 }
167
168void EVP_EncodeFinal(ctx,out,outl)
169EVP_ENCODE_CTX *ctx;
170unsigned char *out;
171int *outl;
172 {
173 unsigned int ret=0;
174
175 if (ctx->num != 0)
176 {
177 ret=EVP_EncodeBlock(out,ctx->enc_data,ctx->num);
178 out[ret++]='\n';
179 out[ret]='\0';
180 ctx->num=0;
181 }
182 *outl=ret;
183 }
184
185int EVP_EncodeBlock(t,f,dlen)
186unsigned char *t,*f;
187int dlen;
188 {
189 int i,ret=0;
190 unsigned long l;
191
192 for (i=dlen; i > 0; i-=3)
193 {
194 if (i >= 3)
195 {
196 l= (((unsigned long)f[0])<<16L)|
197 (((unsigned long)f[1])<< 8L)|f[2];
198 *(t++)=conv_bin2ascii(l>>18L);
199 *(t++)=conv_bin2ascii(l>>12L);
200 *(t++)=conv_bin2ascii(l>> 6L);
201 *(t++)=conv_bin2ascii(l );
202 }
203 else
204 {
205 l=((unsigned long)f[0])<<16L;
206 if (i == 2) l|=((unsigned long)f[1]<<8L);
207
208 *(t++)=conv_bin2ascii(l>>18L);
209 *(t++)=conv_bin2ascii(l>>12L);
210 *(t++)=(i == 1)?'=':conv_bin2ascii(l>> 6L);
211 *(t++)='=';
212 }
213 ret+=4;
214 f+=3;
215 }
216
217 *t='\0';
218 return(ret);
219 }
220
221void EVP_DecodeInit(ctx)
222EVP_ENCODE_CTX *ctx;
223 {
224 ctx->length=30;
225 ctx->num=0;
226 ctx->line_num=0;
227 ctx->expect_nl=0;
228 }
229
230/* -1 for error
231 * 0 for last line
232 * 1 for full line
233 */
234int EVP_DecodeUpdate(ctx,out,outl,in,inl)
235EVP_ENCODE_CTX *ctx;
236unsigned char *out;
237int *outl;
238unsigned char *in;
239int inl;
240 {
241 int seof= -1,eof=0,rv= -1,ret=0,i,v,tmp,n,ln,tmp2,exp_nl;
242 unsigned char *d;
243
244 n=ctx->num;
245 d=ctx->enc_data;
246 ln=ctx->line_num;
247 exp_nl=ctx->expect_nl;
248
249 /* last line of input. */
250 if ((inl == 0) || ((n == 0) && (conv_ascii2bin(in[0]) == B64_EOF)))
251 { rv=0; goto end; }
252
253 /* We parse the input data */
254 for (i=0; i<inl; i++)
255 {
256 /* If the current line is > 80 characters, scream alot */
257 if (ln >= 80) { rv= -1; goto end; }
258
259 /* Get char and put it into the buffer */
260 tmp= *(in++);
261 v=conv_ascii2bin(tmp);
262 /* only save the good data :-) */
263 if (!B64_NOT_BASE64(v))
264 {
265 d[n++]=tmp;
266 ln++;
267 }
268 else if (v == B64_ERROR)
269 {
270 rv= -1;
271 goto end;
272 }
273
274 /* have we seen a '=' which is 'definitly' the last
275 * input line. seof will point to the character that
276 * holds it. and eof will hold how many characters to
277 * chop off. */
278 if (tmp == '=')
279 {
280 if (seof == -1) seof=n;
281 eof++;
282 }
283
284 /* eoln */
285 if (v == B64_EOLN)
286 {
287 ln=0;
288 if (exp_nl)
289 {
290 exp_nl=0;
291 continue;
292 }
293 }
294 exp_nl=0;
295
296 /* If we are at the end of input and it looks like a
297 * line, process it. */
298 if (((i+1) == inl) && (((n&3) == 0) || eof))
299 v=B64_EOF;
300
301 if ((v == B64_EOF) || (n >= 64))
302 {
303 /* This is needed to work correctly on 64 byte input
304 * lines. We process the line and then need to
305 * accept the '\n' */
306 if ((v != B64_EOF) && (n >= 64)) exp_nl=1;
307 tmp2=v;
308 if (n > 0)
309 {
310 v=EVP_DecodeBlock(out,d,n);
311 if (v < 0) { rv=0; goto end; }
312 n=0;
313 ret+=(v-eof);
314 }
315 else
316 {
317 eof=1;
318 v=0;
319 }
320
321 /* This is the case where we have had a short
322 * but valid input line */
323 if ((v < ctx->length) && eof)
324 {
325 rv=0;
326 goto end;
327 }
328 else
329 ctx->length=v;
330
331 if (seof >= 0) { rv=0; goto end; }
332 out+=v;
333 }
334 }
335 rv=1;
336end:
337 *outl=ret;
338 ctx->num=n;
339 ctx->line_num=ln;
340 ctx->expect_nl=exp_nl;
341 return(rv);
342 }
343
344int EVP_DecodeBlock(t,f,n)
345unsigned char *t,*f;
346int n;
347 {
348 int i,ret=0,a,b,c,d;
349 unsigned long l;
350
351 /* trim white space from the start of the line. */
352 while ((conv_ascii2bin(*f) == B64_WS) && (n > 0))
353 {
354 f++;
355 n--;
356 }
357
358 /* strip off stuff at the end of the line
359 * ascii2bin values B64_WS, B64_EOLN, B64_EOLN and B64_EOF */
360 while ((n > 3) && (B64_NOT_BASE64(conv_ascii2bin(f[n-1]))))
361 n--;
362
363 if (n%4 != 0) return(-1);
364
365 for (i=0; i<n; i+=4)
366 {
367 a=conv_ascii2bin(*(f++));
368 b=conv_ascii2bin(*(f++));
369 c=conv_ascii2bin(*(f++));
370 d=conv_ascii2bin(*(f++));
371 if ( (a & 0x80) || (b & 0x80) ||
372 (c & 0x80) || (d & 0x80))
373 return(-1);
374 l=( (((unsigned long)a)<<18L)|
375 (((unsigned long)b)<<12L)|
376 (((unsigned long)c)<< 6L)|
377 (((unsigned long)d) ));
378 *(t++)=(unsigned char)(l>>16L)&0xff;
379 *(t++)=(unsigned char)(l>> 8L)&0xff;
380 *(t++)=(unsigned char)(l )&0xff;
381 ret+=3;
382 }
383 return(ret);
384 }
385
386int EVP_DecodeFinal(ctx,out,outl)
387EVP_ENCODE_CTX *ctx;
388unsigned char *out;
389int *outl;
390 {
391 int i;
392
393 *outl=0;
394 if (ctx->num != 0)
395 {
396 i=EVP_DecodeBlock(out,ctx->enc_data,ctx->num);
397 if (i < 0) return(-1);
398 ctx->num=0;
399 *outl=i;
400 return(1);
401 }
402 else
403 return(1);
404 }
405
406#ifdef undef
407int EVP_DecodeValid(buf,len)
408unsigned char *buf;
409int len;
410 {
411 int i,num=0,bad=0;
412
413 if (len == 0) return(-1);
414 while (conv_ascii2bin(*buf) == B64_WS)
415 {
416 buf++;
417 len--;
418 if (len == 0) return(-1);
419 }
420
421 for (i=len; i >= 4; i-=4)
422 {
423 if ( (conv_ascii2bin(buf[0]) >= 0x40) ||
424 (conv_ascii2bin(buf[1]) >= 0x40) ||
425 (conv_ascii2bin(buf[2]) >= 0x40) ||
426 (conv_ascii2bin(buf[3]) >= 0x40))
427 return(-1);
428 buf+=4;
429 num+=1+(buf[2] != '=')+(buf[3] != '=');
430 }
431 if ((i == 1) && (conv_ascii2bin(buf[0]) == B64_EOLN))
432 return(num);
433 if ((i == 2) && (conv_ascii2bin(buf[0]) == B64_EOLN) &&
434 (conv_ascii2bin(buf[0]) == B64_EOLN))
435 return(num);
436 return(1);
437 }
438#endif