xref: /onnv-gate/usr/src/common/openssl/crypto/bio/bss_mem.c (revision 0:68f95e015346)
1*0Sstevel@tonic-gate /* crypto/bio/bss_mem.c */
2*0Sstevel@tonic-gate /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3*0Sstevel@tonic-gate  * All rights reserved.
4*0Sstevel@tonic-gate  *
5*0Sstevel@tonic-gate  * This package is an SSL implementation written
6*0Sstevel@tonic-gate  * by Eric Young (eay@cryptsoft.com).
7*0Sstevel@tonic-gate  * The implementation was written so as to conform with Netscapes SSL.
8*0Sstevel@tonic-gate  *
9*0Sstevel@tonic-gate  * This library is free for commercial and non-commercial use as long as
10*0Sstevel@tonic-gate  * the following conditions are aheared to.  The following conditions
11*0Sstevel@tonic-gate  * apply to all code found in this distribution, be it the RC4, RSA,
12*0Sstevel@tonic-gate  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
13*0Sstevel@tonic-gate  * included with this distribution is covered by the same copyright terms
14*0Sstevel@tonic-gate  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15*0Sstevel@tonic-gate  *
16*0Sstevel@tonic-gate  * Copyright remains Eric Young's, and as such any Copyright notices in
17*0Sstevel@tonic-gate  * the code are not to be removed.
18*0Sstevel@tonic-gate  * If this package is used in a product, Eric Young should be given attribution
19*0Sstevel@tonic-gate  * as the author of the parts of the library used.
20*0Sstevel@tonic-gate  * This can be in the form of a textual message at program startup or
21*0Sstevel@tonic-gate  * in documentation (online or textual) provided with the package.
22*0Sstevel@tonic-gate  *
23*0Sstevel@tonic-gate  * Redistribution and use in source and binary forms, with or without
24*0Sstevel@tonic-gate  * modification, are permitted provided that the following conditions
25*0Sstevel@tonic-gate  * are met:
26*0Sstevel@tonic-gate  * 1. Redistributions of source code must retain the copyright
27*0Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer.
28*0Sstevel@tonic-gate  * 2. Redistributions in binary form must reproduce the above copyright
29*0Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer in the
30*0Sstevel@tonic-gate  *    documentation and/or other materials provided with the distribution.
31*0Sstevel@tonic-gate  * 3. All advertising materials mentioning features or use of this software
32*0Sstevel@tonic-gate  *    must display the following acknowledgement:
33*0Sstevel@tonic-gate  *    "This product includes cryptographic software written by
34*0Sstevel@tonic-gate  *     Eric Young (eay@cryptsoft.com)"
35*0Sstevel@tonic-gate  *    The word 'cryptographic' can be left out if the rouines from the library
36*0Sstevel@tonic-gate  *    being used are not cryptographic related :-).
37*0Sstevel@tonic-gate  * 4. If you include any Windows specific code (or a derivative thereof) from
38*0Sstevel@tonic-gate  *    the apps directory (application code) you must include an acknowledgement:
39*0Sstevel@tonic-gate  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40*0Sstevel@tonic-gate  *
41*0Sstevel@tonic-gate  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42*0Sstevel@tonic-gate  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43*0Sstevel@tonic-gate  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44*0Sstevel@tonic-gate  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45*0Sstevel@tonic-gate  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46*0Sstevel@tonic-gate  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47*0Sstevel@tonic-gate  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48*0Sstevel@tonic-gate  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49*0Sstevel@tonic-gate  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50*0Sstevel@tonic-gate  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51*0Sstevel@tonic-gate  * SUCH DAMAGE.
52*0Sstevel@tonic-gate  *
53*0Sstevel@tonic-gate  * The licence and distribution terms for any publically available version or
54*0Sstevel@tonic-gate  * derivative of this code cannot be changed.  i.e. this code cannot simply be
55*0Sstevel@tonic-gate  * copied and put under another distribution licence
56*0Sstevel@tonic-gate  * [including the GNU Public Licence.]
57*0Sstevel@tonic-gate  */
58*0Sstevel@tonic-gate 
59*0Sstevel@tonic-gate #include <stdio.h>
60*0Sstevel@tonic-gate #include <errno.h>
61*0Sstevel@tonic-gate #include "cryptlib.h"
62*0Sstevel@tonic-gate #include <openssl/bio.h>
63*0Sstevel@tonic-gate 
64*0Sstevel@tonic-gate static int mem_write(BIO *h, const char *buf, int num);
65*0Sstevel@tonic-gate static int mem_read(BIO *h, char *buf, int size);
66*0Sstevel@tonic-gate static int mem_puts(BIO *h, const char *str);
67*0Sstevel@tonic-gate static int mem_gets(BIO *h, char *str, int size);
68*0Sstevel@tonic-gate static long mem_ctrl(BIO *h, int cmd, long arg1, void *arg2);
69*0Sstevel@tonic-gate static int mem_new(BIO *h);
70*0Sstevel@tonic-gate static int mem_free(BIO *data);
71*0Sstevel@tonic-gate static BIO_METHOD mem_method=
72*0Sstevel@tonic-gate 	{
73*0Sstevel@tonic-gate 	BIO_TYPE_MEM,
74*0Sstevel@tonic-gate 	"memory buffer",
75*0Sstevel@tonic-gate 	mem_write,
76*0Sstevel@tonic-gate 	mem_read,
77*0Sstevel@tonic-gate 	mem_puts,
78*0Sstevel@tonic-gate 	mem_gets,
79*0Sstevel@tonic-gate 	mem_ctrl,
80*0Sstevel@tonic-gate 	mem_new,
81*0Sstevel@tonic-gate 	mem_free,
82*0Sstevel@tonic-gate 	NULL,
83*0Sstevel@tonic-gate 	};
84*0Sstevel@tonic-gate 
85*0Sstevel@tonic-gate /* bio->num is used to hold the value to return on 'empty', if it is
86*0Sstevel@tonic-gate  * 0, should_retry is not set */
87*0Sstevel@tonic-gate 
BIO_s_mem(void)88*0Sstevel@tonic-gate BIO_METHOD *BIO_s_mem(void)
89*0Sstevel@tonic-gate 	{
90*0Sstevel@tonic-gate 	return(&mem_method);
91*0Sstevel@tonic-gate 	}
92*0Sstevel@tonic-gate 
BIO_new_mem_buf(void * buf,int len)93*0Sstevel@tonic-gate BIO *BIO_new_mem_buf(void *buf, int len)
94*0Sstevel@tonic-gate {
95*0Sstevel@tonic-gate 	BIO *ret;
96*0Sstevel@tonic-gate 	BUF_MEM *b;
97*0Sstevel@tonic-gate 	if (!buf) {
98*0Sstevel@tonic-gate 		BIOerr(BIO_F_BIO_NEW_MEM_BUF,BIO_R_NULL_PARAMETER);
99*0Sstevel@tonic-gate 		return NULL;
100*0Sstevel@tonic-gate 	}
101*0Sstevel@tonic-gate 	if(len == -1) len = strlen(buf);
102*0Sstevel@tonic-gate 	if(!(ret = BIO_new(BIO_s_mem())) ) return NULL;
103*0Sstevel@tonic-gate 	b = (BUF_MEM *)ret->ptr;
104*0Sstevel@tonic-gate 	b->data = buf;
105*0Sstevel@tonic-gate 	b->length = len;
106*0Sstevel@tonic-gate 	b->max = len;
107*0Sstevel@tonic-gate 	ret->flags |= BIO_FLAGS_MEM_RDONLY;
108*0Sstevel@tonic-gate 	/* Since this is static data retrying wont help */
109*0Sstevel@tonic-gate 	ret->num = 0;
110*0Sstevel@tonic-gate 	return ret;
111*0Sstevel@tonic-gate }
112*0Sstevel@tonic-gate 
mem_new(BIO * bi)113*0Sstevel@tonic-gate static int mem_new(BIO *bi)
114*0Sstevel@tonic-gate 	{
115*0Sstevel@tonic-gate 	BUF_MEM *b;
116*0Sstevel@tonic-gate 
117*0Sstevel@tonic-gate 	if ((b=BUF_MEM_new()) == NULL)
118*0Sstevel@tonic-gate 		return(0);
119*0Sstevel@tonic-gate 	bi->shutdown=1;
120*0Sstevel@tonic-gate 	bi->init=1;
121*0Sstevel@tonic-gate 	bi->num= -1;
122*0Sstevel@tonic-gate 	bi->ptr=(char *)b;
123*0Sstevel@tonic-gate 	return(1);
124*0Sstevel@tonic-gate 	}
125*0Sstevel@tonic-gate 
mem_free(BIO * a)126*0Sstevel@tonic-gate static int mem_free(BIO *a)
127*0Sstevel@tonic-gate 	{
128*0Sstevel@tonic-gate 	if (a == NULL) return(0);
129*0Sstevel@tonic-gate 	if (a->shutdown)
130*0Sstevel@tonic-gate 		{
131*0Sstevel@tonic-gate 		if ((a->init) && (a->ptr != NULL))
132*0Sstevel@tonic-gate 			{
133*0Sstevel@tonic-gate 			BUF_MEM *b;
134*0Sstevel@tonic-gate 			b = (BUF_MEM *)a->ptr;
135*0Sstevel@tonic-gate 			if(a->flags & BIO_FLAGS_MEM_RDONLY) b->data = NULL;
136*0Sstevel@tonic-gate 			BUF_MEM_free(b);
137*0Sstevel@tonic-gate 			a->ptr=NULL;
138*0Sstevel@tonic-gate 			}
139*0Sstevel@tonic-gate 		}
140*0Sstevel@tonic-gate 	return(1);
141*0Sstevel@tonic-gate 	}
142*0Sstevel@tonic-gate 
mem_read(BIO * b,char * out,int outl)143*0Sstevel@tonic-gate static int mem_read(BIO *b, char *out, int outl)
144*0Sstevel@tonic-gate 	{
145*0Sstevel@tonic-gate 	int ret= -1;
146*0Sstevel@tonic-gate 	BUF_MEM *bm;
147*0Sstevel@tonic-gate 	int i;
148*0Sstevel@tonic-gate 	char *from,*to;
149*0Sstevel@tonic-gate 
150*0Sstevel@tonic-gate 	bm=(BUF_MEM *)b->ptr;
151*0Sstevel@tonic-gate 	BIO_clear_retry_flags(b);
152*0Sstevel@tonic-gate 	ret=(outl > bm->length)?bm->length:outl;
153*0Sstevel@tonic-gate 	if ((out != NULL) && (ret > 0)) {
154*0Sstevel@tonic-gate 		memcpy(out,bm->data,ret);
155*0Sstevel@tonic-gate 		bm->length-=ret;
156*0Sstevel@tonic-gate 		/* memmove(&(bm->data[0]),&(bm->data[ret]), bm->length); */
157*0Sstevel@tonic-gate 		if(b->flags & BIO_FLAGS_MEM_RDONLY) bm->data += ret;
158*0Sstevel@tonic-gate 		else {
159*0Sstevel@tonic-gate 			from=(char *)&(bm->data[ret]);
160*0Sstevel@tonic-gate 			to=(char *)&(bm->data[0]);
161*0Sstevel@tonic-gate 			for (i=0; i<bm->length; i++)
162*0Sstevel@tonic-gate 				to[i]=from[i];
163*0Sstevel@tonic-gate 		}
164*0Sstevel@tonic-gate 	} else if (bm->length == 0)
165*0Sstevel@tonic-gate 		{
166*0Sstevel@tonic-gate 		ret = b->num;
167*0Sstevel@tonic-gate 		if (ret != 0)
168*0Sstevel@tonic-gate 			BIO_set_retry_read(b);
169*0Sstevel@tonic-gate 		}
170*0Sstevel@tonic-gate 	return(ret);
171*0Sstevel@tonic-gate 	}
172*0Sstevel@tonic-gate 
mem_write(BIO * b,const char * in,int inl)173*0Sstevel@tonic-gate static int mem_write(BIO *b, const char *in, int inl)
174*0Sstevel@tonic-gate 	{
175*0Sstevel@tonic-gate 	int ret= -1;
176*0Sstevel@tonic-gate 	int blen;
177*0Sstevel@tonic-gate 	BUF_MEM *bm;
178*0Sstevel@tonic-gate 
179*0Sstevel@tonic-gate 	bm=(BUF_MEM *)b->ptr;
180*0Sstevel@tonic-gate 	if (in == NULL)
181*0Sstevel@tonic-gate 		{
182*0Sstevel@tonic-gate 		BIOerr(BIO_F_MEM_WRITE,BIO_R_NULL_PARAMETER);
183*0Sstevel@tonic-gate 		goto end;
184*0Sstevel@tonic-gate 		}
185*0Sstevel@tonic-gate 
186*0Sstevel@tonic-gate 	if(b->flags & BIO_FLAGS_MEM_RDONLY) {
187*0Sstevel@tonic-gate 		BIOerr(BIO_F_MEM_WRITE,BIO_R_WRITE_TO_READ_ONLY_BIO);
188*0Sstevel@tonic-gate 		goto end;
189*0Sstevel@tonic-gate 	}
190*0Sstevel@tonic-gate 
191*0Sstevel@tonic-gate 	BIO_clear_retry_flags(b);
192*0Sstevel@tonic-gate 	blen=bm->length;
193*0Sstevel@tonic-gate 	if (BUF_MEM_grow_clean(bm,blen+inl) != (blen+inl))
194*0Sstevel@tonic-gate 		goto end;
195*0Sstevel@tonic-gate 	memcpy(&(bm->data[blen]),in,inl);
196*0Sstevel@tonic-gate 	ret=inl;
197*0Sstevel@tonic-gate end:
198*0Sstevel@tonic-gate 	return(ret);
199*0Sstevel@tonic-gate 	}
200*0Sstevel@tonic-gate 
mem_ctrl(BIO * b,int cmd,long num,void * ptr)201*0Sstevel@tonic-gate static long mem_ctrl(BIO *b, int cmd, long num, void *ptr)
202*0Sstevel@tonic-gate 	{
203*0Sstevel@tonic-gate 	long ret=1;
204*0Sstevel@tonic-gate 	char **pptr;
205*0Sstevel@tonic-gate 
206*0Sstevel@tonic-gate 	BUF_MEM *bm=(BUF_MEM *)b->ptr;
207*0Sstevel@tonic-gate 
208*0Sstevel@tonic-gate 	switch (cmd)
209*0Sstevel@tonic-gate 		{
210*0Sstevel@tonic-gate 	case BIO_CTRL_RESET:
211*0Sstevel@tonic-gate 		if (bm->data != NULL)
212*0Sstevel@tonic-gate 			{
213*0Sstevel@tonic-gate 			/* For read only case reset to the start again */
214*0Sstevel@tonic-gate 			if(b->flags & BIO_FLAGS_MEM_RDONLY)
215*0Sstevel@tonic-gate 				{
216*0Sstevel@tonic-gate 				bm->data -= bm->max - bm->length;
217*0Sstevel@tonic-gate 				bm->length = bm->max;
218*0Sstevel@tonic-gate 				}
219*0Sstevel@tonic-gate 			else
220*0Sstevel@tonic-gate 				{
221*0Sstevel@tonic-gate 				memset(bm->data,0,bm->max);
222*0Sstevel@tonic-gate 				bm->length=0;
223*0Sstevel@tonic-gate 				}
224*0Sstevel@tonic-gate 			}
225*0Sstevel@tonic-gate 		break;
226*0Sstevel@tonic-gate 	case BIO_CTRL_EOF:
227*0Sstevel@tonic-gate 		ret=(long)(bm->length == 0);
228*0Sstevel@tonic-gate 		break;
229*0Sstevel@tonic-gate 	case BIO_C_SET_BUF_MEM_EOF_RETURN:
230*0Sstevel@tonic-gate 		b->num=(int)num;
231*0Sstevel@tonic-gate 		break;
232*0Sstevel@tonic-gate 	case BIO_CTRL_INFO:
233*0Sstevel@tonic-gate 		ret=(long)bm->length;
234*0Sstevel@tonic-gate 		if (ptr != NULL)
235*0Sstevel@tonic-gate 			{
236*0Sstevel@tonic-gate 			pptr=(char **)ptr;
237*0Sstevel@tonic-gate 			*pptr=(char *)&(bm->data[0]);
238*0Sstevel@tonic-gate 			}
239*0Sstevel@tonic-gate 		break;
240*0Sstevel@tonic-gate 	case BIO_C_SET_BUF_MEM:
241*0Sstevel@tonic-gate 		mem_free(b);
242*0Sstevel@tonic-gate 		b->shutdown=(int)num;
243*0Sstevel@tonic-gate 		b->ptr=ptr;
244*0Sstevel@tonic-gate 		break;
245*0Sstevel@tonic-gate 	case BIO_C_GET_BUF_MEM_PTR:
246*0Sstevel@tonic-gate 		if (ptr != NULL)
247*0Sstevel@tonic-gate 			{
248*0Sstevel@tonic-gate 			pptr=(char **)ptr;
249*0Sstevel@tonic-gate 			*pptr=(char *)bm;
250*0Sstevel@tonic-gate 			}
251*0Sstevel@tonic-gate 		break;
252*0Sstevel@tonic-gate 	case BIO_CTRL_GET_CLOSE:
253*0Sstevel@tonic-gate 		ret=(long)b->shutdown;
254*0Sstevel@tonic-gate 		break;
255*0Sstevel@tonic-gate 	case BIO_CTRL_SET_CLOSE:
256*0Sstevel@tonic-gate 		b->shutdown=(int)num;
257*0Sstevel@tonic-gate 		break;
258*0Sstevel@tonic-gate 
259*0Sstevel@tonic-gate 	case BIO_CTRL_WPENDING:
260*0Sstevel@tonic-gate 		ret=0L;
261*0Sstevel@tonic-gate 		break;
262*0Sstevel@tonic-gate 	case BIO_CTRL_PENDING:
263*0Sstevel@tonic-gate 		ret=(long)bm->length;
264*0Sstevel@tonic-gate 		break;
265*0Sstevel@tonic-gate 	case BIO_CTRL_DUP:
266*0Sstevel@tonic-gate 	case BIO_CTRL_FLUSH:
267*0Sstevel@tonic-gate 		ret=1;
268*0Sstevel@tonic-gate 		break;
269*0Sstevel@tonic-gate 	case BIO_CTRL_PUSH:
270*0Sstevel@tonic-gate 	case BIO_CTRL_POP:
271*0Sstevel@tonic-gate 	default:
272*0Sstevel@tonic-gate 		ret=0;
273*0Sstevel@tonic-gate 		break;
274*0Sstevel@tonic-gate 		}
275*0Sstevel@tonic-gate 	return(ret);
276*0Sstevel@tonic-gate 	}
277*0Sstevel@tonic-gate 
mem_gets(BIO * bp,char * buf,int size)278*0Sstevel@tonic-gate static int mem_gets(BIO *bp, char *buf, int size)
279*0Sstevel@tonic-gate 	{
280*0Sstevel@tonic-gate 	int i,j;
281*0Sstevel@tonic-gate 	int ret= -1;
282*0Sstevel@tonic-gate 	char *p;
283*0Sstevel@tonic-gate 	BUF_MEM *bm=(BUF_MEM *)bp->ptr;
284*0Sstevel@tonic-gate 
285*0Sstevel@tonic-gate 	BIO_clear_retry_flags(bp);
286*0Sstevel@tonic-gate 	j=bm->length;
287*0Sstevel@tonic-gate 	if (j <= 0)
288*0Sstevel@tonic-gate 		{
289*0Sstevel@tonic-gate 		*buf='\0';
290*0Sstevel@tonic-gate 		return 0;
291*0Sstevel@tonic-gate 		}
292*0Sstevel@tonic-gate 	p=bm->data;
293*0Sstevel@tonic-gate 	for (i=0; i<j; i++)
294*0Sstevel@tonic-gate 		{
295*0Sstevel@tonic-gate 		if (p[i] == '\n') break;
296*0Sstevel@tonic-gate 		}
297*0Sstevel@tonic-gate 	if (i == j)
298*0Sstevel@tonic-gate 		{
299*0Sstevel@tonic-gate 		BIO_set_retry_read(bp);
300*0Sstevel@tonic-gate 		/* return(-1);  change the semantics 0.6.6a */
301*0Sstevel@tonic-gate 		}
302*0Sstevel@tonic-gate 	else
303*0Sstevel@tonic-gate 		i++;
304*0Sstevel@tonic-gate 	/* i is the max to copy */
305*0Sstevel@tonic-gate 	if ((size-1) < i) i=size-1;
306*0Sstevel@tonic-gate 	i=mem_read(bp,buf,i);
307*0Sstevel@tonic-gate 	if (i > 0) buf[i]='\0';
308*0Sstevel@tonic-gate 	ret=i;
309*0Sstevel@tonic-gate 	return(ret);
310*0Sstevel@tonic-gate 	}
311*0Sstevel@tonic-gate 
mem_puts(BIO * bp,const char * str)312*0Sstevel@tonic-gate static int mem_puts(BIO *bp, const char *str)
313*0Sstevel@tonic-gate 	{
314*0Sstevel@tonic-gate 	int n,ret;
315*0Sstevel@tonic-gate 
316*0Sstevel@tonic-gate 	n=strlen(str);
317*0Sstevel@tonic-gate 	ret=mem_write(bp,str,n);
318*0Sstevel@tonic-gate 	/* memory semantics is that it will always work */
319*0Sstevel@tonic-gate 	return(ret);
320*0Sstevel@tonic-gate 	}
321*0Sstevel@tonic-gate 
322