[thirdparty/openssl.git] / crypto / bio / bf_buff.c

/* crypto/bio/bf_buff.c */
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * The implementation was written so as to conform with Netscapes SSL.
 * 
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 * 
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young (eay@cryptsoft.com)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from 
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 * 
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 * 
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */

#include <stdio.h>
#include <errno.h>
#include "cryptlib.h"
#include "bio.h"
#include "evp.h"

#ifndef NOPROTO
static int buffer_write(BIO *h,char *buf,int num);
static int buffer_read(BIO *h,char *buf,int size);
static int buffer_puts(BIO *h,char *str);
static int buffer_gets(BIO *h,char *str,int size);
static long buffer_ctrl(BIO *h,int cmd,long arg1,char *arg2);
static int buffer_new(BIO *h);
static int buffer_free(BIO *data);
#else
static int buffer_write();
static int buffer_read();
static int buffer_puts();
static int buffer_gets();
static long buffer_ctrl();
static int buffer_new();
static int buffer_free();
#endif

#define DEFAULT_BUFFER_SIZE	1024

static BIO_METHOD methods_buffer=
	{
	BIO_TYPE_BUFFER,
	"buffer",
	buffer_write,
	buffer_read,
	buffer_puts,
	buffer_gets,
	buffer_ctrl,
	buffer_new,
	buffer_free,
	};

BIO_METHOD *BIO_f_buffer()
	{
	return(&methods_buffer);
	}

static int buffer_new(bi)
BIO *bi;
	{
	BIO_F_BUFFER_CTX *ctx;

	ctx=(BIO_F_BUFFER_CTX *)Malloc(sizeof(BIO_F_BUFFER_CTX));
	if (ctx == NULL) return(0);
	ctx->ibuf=(char *)Malloc(DEFAULT_BUFFER_SIZE);
	if (ctx->ibuf == NULL) { Free(ctx); return(0); }
	ctx->obuf=(char *)Malloc(DEFAULT_BUFFER_SIZE);
	if (ctx->obuf == NULL) { Free(ctx->ibuf); Free(ctx); return(0); }
	ctx->ibuf_size=DEFAULT_BUFFER_SIZE;
	ctx->obuf_size=DEFAULT_BUFFER_SIZE;
	ctx->ibuf_len=0;
	ctx->ibuf_off=0;
	ctx->obuf_len=0;
	ctx->obuf_off=0;

	bi->init=1;
	bi->ptr=(char *)ctx;
	bi->flags=0;
	return(1);
	}

static int buffer_free(a)
BIO *a;
	{
	BIO_F_BUFFER_CTX *b;

	if (a == NULL) return(0);
	b=(BIO_F_BUFFER_CTX *)a->ptr;
	if (b->ibuf != NULL) Free(b->ibuf);
	if (b->obuf != NULL) Free(b->obuf);
	Free(a->ptr);
	a->ptr=NULL;
	a->init=0;
	a->flags=0;
	return(1);
	}
	
static int buffer_read(b,out,outl)
BIO *b;
char *out;
int outl;
	{
	int i,num=0;
	BIO_F_BUFFER_CTX *ctx;

	if (out == NULL) return(0);
	ctx=(BIO_F_BUFFER_CTX *)b->ptr;

	if ((ctx == NULL) || (b->next_bio == NULL)) return(0);
	num=0;
	BIO_clear_retry_flags(b);

start:
	i=ctx->ibuf_len;
	/* If there is stuff left over, grab it */
	if (i != 0)
		{
		if (i > outl) i=outl;
		memcpy(out,&(ctx->ibuf[ctx->ibuf_off]),i);
		ctx->ibuf_off+=i;
		ctx->ibuf_len-=i;
		num+=i;
		if (outl == i)  return(num);
		outl-=i;
		out+=i;
		}

	/* We may have done a partial read. try to do more.
	 * We have nothing in the buffer.
	 * If we get an error and have read some data, just return it
	 * and let them retry to get the error again.
	 * copy direct to parent address space */
	if (outl > ctx->ibuf_size)
		{
		for (;;)
			{
			i=BIO_read(b->next_bio,out,outl);
			if (i <= 0)
				{
				BIO_copy_next_retry(b);
				if (i < 0) return((num > 0)?num:i);
				if (i == 0) return(num);
				}
			num+=i;
			if (outl == i) return(num);
			out+=i;
			outl-=i;
			}
		}
	/* else */

	/* we are going to be doing some buffering */
	i=BIO_read(b->next_bio,ctx->ibuf,ctx->ibuf_size);
	if (i <= 0)
		{
		BIO_copy_next_retry(b);
		if (i < 0) return((num > 0)?num:i);
		if (i == 0) return(num);
		}
	ctx->ibuf_off=0;
	ctx->ibuf_len=i;

	/* Lets re-read using ourselves :-) */
	goto start;
	}

static int buffer_write(b,in,inl)
BIO *b;
char *in;
int inl;
	{
	int i,num=0;
	BIO_F_BUFFER_CTX *ctx;

	if ((in == NULL) || (inl <= 0)) return(0);
	ctx=(BIO_F_BUFFER_CTX *)b->ptr;
	if ((ctx == NULL) || (b->next_bio == NULL)) return(0);

	BIO_clear_retry_flags(b);
start:
	i=ctx->obuf_size-(ctx->obuf_len+ctx->obuf_off);
	/* add to buffer and return */
	if (i >= inl)
		{
		memcpy(&(ctx->obuf[ctx->obuf_len]),in,inl);
		ctx->obuf_len+=inl;
		return(num+inl);
		}
	/* else */
	/* stuff already in buffer, so add to it first, then flush */
	if (ctx->obuf_len != 0)
		{
		if (i > 0) /* lets fill it up if we can */
			{
			memcpy(&(ctx->obuf[ctx->obuf_len]),in,i);
			in+=i;
			inl-=i;
			num+=i;
			ctx->obuf_len+=i;
			}
		/* we now have a full buffer needing flushing */
		for (;;)
			{
			i=BIO_write(b->next_bio,&(ctx->obuf[ctx->obuf_off]),
				ctx->obuf_len);
			if (i <= 0)
				{
				BIO_copy_next_retry(b);

				if (i < 0) return((num > 0)?num:i);
				if (i == 0) return(num);
				}
			ctx->obuf_off+=i;
			ctx->obuf_len-=i;
			if (ctx->obuf_len == 0) break;
			}
		}
	/* we only get here if the buffer has been flushed and we
	 * still have stuff to write */
	ctx->obuf_off=0;

	/* we now have inl bytes to write */
	while (inl >= ctx->obuf_size)
		{
		i=BIO_write(b->next_bio,in,inl);
		if (i <= 0)
			{
			BIO_copy_next_retry(b);
			if (i < 0) return((num > 0)?num:i);
			if (i == 0) return(num);
			}
		num+=i;
		in+=i;
		inl-=i;
		if (inl == 0) return(num);
		}

	/* copy the rest into the buffer since we have only a small 
	 * amount left */
	goto start;
	}

static long buffer_ctrl(b,cmd,num,ptr)
BIO *b;
int cmd;
long num;
char *ptr;
	{
	BIO *dbio;
	BIO_F_BUFFER_CTX *ctx;
	long ret=1;
	char *p1,*p2;
	int r,i,*ip;
	int ibs,obs;

	ctx=(BIO_F_BUFFER_CTX *)b->ptr;

	switch (cmd)
		{
	case BIO_CTRL_RESET:
		ctx->ibuf_off=0;
		ctx->ibuf_len=0;
		ctx->obuf_off=0;
		ctx->obuf_len=0;
		ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
		break;
	case BIO_CTRL_INFO:
		ret=(long)ctx->obuf_len;
		break;
	case BIO_C_GET_BUFF_NUM_LINES:
		ret=0;
		p1=ctx->ibuf;
		for (i=ctx->ibuf_off; i<ctx->ibuf_len; i++)
			{
			if (p1[i] == '\n') ret++;
			}
		break;
	case BIO_CTRL_WPENDING:
		ret=(long)ctx->obuf_len;
		if (ret == 0)
			ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
		break;
	case BIO_CTRL_PENDING:
		ret=(long)ctx->ibuf_len;
		if (ret == 0)
			ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
		break;
	case BIO_C_SET_BUFF_READ_DATA:
		if (num > ctx->ibuf_size)
			{
			p1=Malloc((int)num);
			if (p1 == NULL) goto malloc_error;
			if (ctx->ibuf != NULL) Free(ctx->ibuf);
			ctx->ibuf=p1;
			}
		ctx->ibuf_off=0;
		ctx->ibuf_len=(int)num;
		memcpy(ctx->ibuf,ptr,(int)num);
		ret=1;
		break;
	case BIO_C_SET_BUFF_SIZE:
		if (ptr != NULL)
			{
			ip=(int *)ptr;
			if (*ip == 0)
				{
				ibs=(int)num;
				obs=ctx->obuf_size;
				}
			else /* if (*ip == 1) */
				{
				ibs=ctx->ibuf_size;
				obs=(int)num;
				}
			}
		else
			{
			ibs=(int)num;
			obs=(int)num;
			}
		p1=ctx->ibuf;
		p2=ctx->obuf;
		if ((ibs > DEFAULT_BUFFER_SIZE) && (ibs != ctx->ibuf_size))
			{
			p1=(char *)Malloc((int)num);
			if (p1 == NULL) goto malloc_error;
			}
		if ((obs > DEFAULT_BUFFER_SIZE) && (obs != ctx->obuf_size))
			{
			p2=(char *)Malloc((int)num);
			if (p2 == NULL)
				{
				if (p1 != ctx->ibuf) Free(p1);
				goto malloc_error;
				}
			}
		if (ctx->ibuf != p1)
			{
			Free(ctx->ibuf);
			ctx->ibuf=p1;
			ctx->ibuf_off=0;
			ctx->ibuf_len=0;
			ctx->ibuf_size=ibs;
			}
		if (ctx->obuf != p2)
			{
			Free(ctx->obuf);
			ctx->obuf=p2;
			ctx->obuf_off=0;
			ctx->obuf_len=0;
			ctx->obuf_size=obs;
			}
		break;
	case BIO_C_DO_STATE_MACHINE:
		BIO_clear_retry_flags(b);
		ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
		BIO_copy_next_retry(b);
		break;

	case BIO_CTRL_FLUSH:
		if (ctx->obuf_len <= 0)
			{
			ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
			break;
			}

		for (;;)
			{
			BIO_clear_retry_flags(b);
			if (ctx->obuf_len > ctx->obuf_off)
				{
				r=BIO_write(b->next_bio,
					&(ctx->obuf[ctx->obuf_off]),
					ctx->obuf_len-ctx->obuf_off);
#if 0
fprintf(stderr,"FLUSH [%3d] %3d -> %3d\n",ctx->obuf_off,ctx->obuf_len-ctx->obuf_off,r);
#endif
				BIO_copy_next_retry(b);
				if (r <= 0) return((long)r);
				ctx->obuf_off+=r;
				}
			else
				{
				ctx->obuf_len=0;
				ctx->obuf_off=0;
				ret=1;
				break;
				}
			}
		break;
	case BIO_CTRL_DUP:
		dbio=(BIO *)ptr;
		if (	!BIO_set_read_buffer_size(dbio,ctx->ibuf_size) ||
			!BIO_set_write_buffer_size(dbio,ctx->obuf_size))
			ret=0;
		break;
	default:
		ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
		break;
		}
	return(ret);
malloc_error:
	BIOerr(BIO_F_BUFFER_CTRL,ERR_R_MALLOC_FAILURE);
	return(0);
	}

static int buffer_gets(b,buf,size)
BIO *b;
char *buf;
int size;
	{
	BIO_F_BUFFER_CTX *ctx;
	int num=0,i,flag;
	char *p;

	ctx=(BIO_F_BUFFER_CTX *)b->ptr;
	size--; /* reserve space for a '\0' */
	BIO_clear_retry_flags(b);

	for (;;)
		{
		if (ctx->ibuf_len > 0)
			{
			p= &(ctx->ibuf[ctx->ibuf_off]);
			flag=0;
			for (i=0; (i<ctx->ibuf_len) && (i<size); i++)
				{
				*(buf++)=p[i];
				if (p[i] == '\n')
					{
					flag=1;
					i++;
					break;
					}
				}
			num+=i;
			size-=i;
			ctx->ibuf_len-=i;
			ctx->ibuf_off+=i;
			if ((flag) || (i == size))
				{
				*buf='\0';
				return(num);
				}
			}
		else	/* read another chunk */
			{
			i=BIO_read(b->next_bio,ctx->ibuf,ctx->ibuf_size);
			if (i <= 0)
				{
				BIO_copy_next_retry(b);
				if (i < 0) return((num > 0)?num:i);
				if (i == 0) return(num);
				}
			ctx->ibuf_len=i;
			ctx->ibuf_off=0;
			}
		}
	}

static int buffer_puts(b,str)
BIO *b;
char *str;
	{
	return(BIO_write(b,str,strlen(str)));
	}
Commit	Line	Data
d02b48c6	1	/* crypto/bio/bf_buff.c */
58964a49	2	/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
d02b48c6 RE	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 <errno.h>
	61	#include "cryptlib.h"
	62	#include "bio.h"
	63	#include "evp.h"
	64
	65	#ifndef NOPROTO
	66	static int buffer_write(BIO h,char buf,int num);
67	static int buffer_read(BIO h,char buf,int size);
68	static int buffer_puts(BIO h,char str);
69	static int buffer_gets(BIO h,char str,int size);
70	static long buffer_ctrl(BIO h,int cmd,long arg1,char arg2);
71	static int buffer_new(BIO *h);
72	static int buffer_free(BIO *data);
73	#else
74	static int buffer_write();
75	static int buffer_read();
76	static int buffer_puts();
77	static int buffer_gets();
78	static long buffer_ctrl();
79	static int buffer_new();
80	static int buffer_free();
81	#endif
82
83	#define DEFAULT_BUFFER_SIZE 1024
84
85	static BIO_METHOD methods_buffer=
86	{
58964a49 RE	87	BIO_TYPE_BUFFER,
58964a49 RE	88	"buffer",
d02b48c6 RE	89	buffer_write,
	90	buffer_read,
	91	buffer_puts,
	92	buffer_gets,
	93	buffer_ctrl,
	94	buffer_new,
	95	buffer_free,
	96	};
	97
	98	BIO_METHOD *BIO_f_buffer()
	99	{
	100	return(&methods_buffer);
	101	}
	102
	103	static int buffer_new(bi)
	104	BIO *bi;
	105	{
	106	BIO_F_BUFFER_CTX *ctx;
	107
	108	ctx=(BIO_F_BUFFER_CTX *)Malloc(sizeof(BIO_F_BUFFER_CTX));
	109	if (ctx == NULL) return(0);
	110	ctx->ibuf=(char *)Malloc(DEFAULT_BUFFER_SIZE);
	111	if (ctx->ibuf == NULL) { Free(ctx); return(0); }
	112	ctx->obuf=(char *)Malloc(DEFAULT_BUFFER_SIZE);
	113	if (ctx->obuf == NULL) { Free(ctx->ibuf); Free(ctx); return(0); }
	114	ctx->ibuf_size=DEFAULT_BUFFER_SIZE;
	115	ctx->obuf_size=DEFAULT_BUFFER_SIZE;
	116	ctx->ibuf_len=0;
	117	ctx->ibuf_off=0;
	118	ctx->obuf_len=0;
	119	ctx->obuf_off=0;
	120
	121	bi->init=1;
	122	bi->ptr=(char *)ctx;
	123	bi->flags=0;
	124	return(1);
	125	}
	126
	127	static int buffer_free(a)
	128	BIO *a;
	129	{
	130	BIO_F_BUFFER_CTX *b;
	131
	132	if (a == NULL) return(0);
	133	b=(BIO_F_BUFFER_CTX *)a->ptr;
	134	if (b->ibuf != NULL) Free(b->ibuf);
	135	if (b->obuf != NULL) Free(b->obuf);
	136	Free(a->ptr);
	137	a->ptr=NULL;
	138	a->init=0;
	139	a->flags=0;
	140	return(1);
	141	}
	142
	143	static int buffer_read(b,out,outl)
	144	BIO *b;
	145	char *out;
	146	int outl;
	147	{
	148	int i,num=0;
	149	BIO_F_BUFFER_CTX *ctx;
	150
	151	if (out == NULL) return(0);
	152	ctx=(BIO_F_BUFFER_CTX *)b->ptr;
153
154	if ((ctx == NULL) \|\| (b->next_bio == NULL)) return(0);
155	num=0;
156	BIO_clear_retry_flags(b);
157
158	start:
159	i=ctx->ibuf_len;
160	/* If there is stuff left over, grab it */
161	if (i != 0)
162	{
163	if (i > outl) i=outl;
164	memcpy(out,&(ctx->ibuf[ctx->ibuf_off]),i);
165	ctx->ibuf_off+=i;
166	ctx->ibuf_len-=i;
167	num+=i;
168	if (outl == i) return(num);
169	outl-=i;
170	out+=i;
171	}
172
173	/* We may have done a partial read. try to do more.
174	* We have nothing in the buffer.
175	* If we get an error and have read some data, just return it
176	* and let them retry to get the error again.
177	* copy direct to parent address space */
178	if (outl > ctx->ibuf_size)
179	{
180	for (;;)
181	{
182	i=BIO_read(b->next_bio,out,outl);
183	if (i <= 0)
184	{
185	BIO_copy_next_retry(b);
186	if (i < 0) return((num > 0)?num:i);
187	if (i == 0) return(num);
188	}
189	num+=i;
190	if (outl == i) return(num);
191	out+=i;
192	outl-=i;
193	}
194	}
195	/* else */
196
197	/* we are going to be doing some buffering */
198	i=BIO_read(b->next_bio,ctx->ibuf,ctx->ibuf_size);
199	if (i <= 0)
200	{
201	BIO_copy_next_retry(b);
202	if (i < 0) return((num > 0)?num:i);
203	if (i == 0) return(num);
204	}
205	ctx->ibuf_off=0;
206	ctx->ibuf_len=i;
207
208	/* Lets re-read using ourselves :-) */
209	goto start;
210	}
211
212	static int buffer_write(b,in,inl)
213	BIO *b;
214	char *in;
215	int inl;
216	{
217	int i,num=0;
218	BIO_F_BUFFER_CTX *ctx;
219
220	if ((in == NULL) \|\| (inl <= 0)) return(0);
221	ctx=(BIO_F_BUFFER_CTX *)b->ptr;
222	if ((ctx == NULL) \|\| (b->next_bio == NULL)) return(0);
223
224	BIO_clear_retry_flags(b);
225	start:
226	i=ctx->obuf_size-(ctx->obuf_len+ctx->obuf_off);
227	/* add to buffer and return */
228	if (i >= inl)
229	{
230	memcpy(&(ctx->obuf[ctx->obuf_len]),in,inl);
231	ctx->obuf_len+=inl;
232	return(num+inl);
233	}
234	/* else */
235	/* stuff already in buffer, so add to it first, then flush */
236	if (ctx->obuf_len != 0)
237	{
238	if (i > 0) /* lets fill it up if we can */
239	{
240	memcpy(&(ctx->obuf[ctx->obuf_len]),in,i);
241	in+=i;
242	inl-=i;
243	num+=i;
244	ctx->obuf_len+=i;
245	}
246	/* we now have a full buffer needing flushing */
247	for (;;)
248	{
249	i=BIO_write(b->next_bio,&(ctx->obuf[ctx->obuf_off]),
250	ctx->obuf_len);
251	if (i <= 0)
252	{
253	BIO_copy_next_retry(b);
254
255	if (i < 0) return((num > 0)?num:i);
256	if (i == 0) return(num);
257	}
258	ctx->obuf_off+=i;
259	ctx->obuf_len-=i;
260	if (ctx->obuf_len == 0) break;
261	}
262	}
263	/* we only get here if the buffer has been flushed and we
264	* still have stuff to write */
265	ctx->obuf_off=0;
266
267	/* we now have inl bytes to write */
268	while (inl >= ctx->obuf_size)
269	{
270	i=BIO_write(b->next_bio,in,inl);
271	if (i <= 0)
272	{
273	BIO_copy_next_retry(b);
274	if (i < 0) return((num > 0)?num:i);
275	if (i == 0) return(num);
276	}
277	num+=i;
278	in+=i;
279	inl-=i;
280	if (inl == 0) return(num);
281	}
282
283	/* copy the rest into the buffer since we have only a small
284	* amount left */
285	goto start;
286	}
287
288	static long buffer_ctrl(b,cmd,num,ptr)
289	BIO *b;
290	int cmd;
291	long num;
292	char *ptr;
293	{
294	BIO *dbio;
295	BIO_F_BUFFER_CTX *ctx;
296	long ret=1;
297	char p1,p2;
298	int r,i,*ip;
299	int ibs,obs;
300
301	ctx=(BIO_F_BUFFER_CTX *)b->ptr;
302
303	switch (cmd)
304	{
305	case BIO_CTRL_RESET:
306	ctx->ibuf_off=0;
307	ctx->ibuf_len=0;
308	ctx->obuf_off=0;
309	ctx->obuf_len=0;
310	ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
311	break;
312	case BIO_CTRL_INFO:
313	ret=(long)ctx->obuf_len;
314	break;
315	case BIO_C_GET_BUFF_NUM_LINES:
316	ret=0;
317	p1=ctx->ibuf;
318	for (i=ctx->ibuf_off; i<ctx->ibuf_len; i++)
319	{
320	if (p1[i] == '\n') ret++;
321	}
322	break;
323	case BIO_CTRL_WPENDING:
324	ret=(long)ctx->obuf_len;
325	if (ret == 0)
326	ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
327	break;
328	case BIO_CTRL_PENDING:
329	ret=(long)ctx->ibuf_len;
330	if (ret == 0)
331	ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
332	break;
58964a49 RE	333	case BIO_C_SET_BUFF_READ_DATA:
	334	if (num > ctx->ibuf_size)
	335	{
	336	p1=Malloc((int)num);
	337	if (p1 == NULL) goto malloc_error;
	338	if (ctx->ibuf != NULL) Free(ctx->ibuf);
	339	ctx->ibuf=p1;
	340	}
	341	ctx->ibuf_off=0;
	342	ctx->ibuf_len=(int)num;
	343	memcpy(ctx->ibuf,ptr,(int)num);
	344	ret=1;
	345	break;
d02b48c6 RE	346	case BIO_C_SET_BUFF_SIZE:
	347	if (ptr != NULL)
	348	{
	349	ip=(int *)ptr;
	350	if (*ip == 0)
	351	{
	352	ibs=(int)num;
	353	obs=ctx->obuf_size;
	354	}
	355	else /* if (ip == 1) /
	356	{
	357	ibs=ctx->ibuf_size;
	358	obs=(int)num;
	359	}
	360	}
	361	else
	362	{
	363	ibs=(int)num;
	364	obs=(int)num;
	365	}
	366	p1=ctx->ibuf;
	367	p2=ctx->obuf;
	368	if ((ibs > DEFAULT_BUFFER_SIZE) && (ibs != ctx->ibuf_size))
	369	{
	370	p1=(char *)Malloc((int)num);
58964a49	371	if (p1 == NULL) goto malloc_error;
d02b48c6 RE	372	}
	373	if ((obs > DEFAULT_BUFFER_SIZE) && (obs != ctx->obuf_size))
	374	{
	375	p2=(char *)Malloc((int)num);
	376	if (p2 == NULL)
	377	{
d02b48c6	378	if (p1 != ctx->ibuf) Free(p1);
58964a49	379	goto malloc_error;
d02b48c6 RE	380	}
	381	}
	382	if (ctx->ibuf != p1)
	383	{
	384	Free(ctx->ibuf);
	385	ctx->ibuf=p1;
	386	ctx->ibuf_off=0;
	387	ctx->ibuf_len=0;
	388	ctx->ibuf_size=ibs;
	389	}
	390	if (ctx->obuf != p2)
	391	{
	392	Free(ctx->obuf);
	393	ctx->obuf=p2;
	394	ctx->obuf_off=0;
	395	ctx->obuf_len=0;
	396	ctx->obuf_size=obs;
	397	}
	398	break;
	399	case BIO_C_DO_STATE_MACHINE:
	400	BIO_clear_retry_flags(b);
	401	ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
	402	BIO_copy_next_retry(b);
	403	break;
	404
	405	case BIO_CTRL_FLUSH:
	406	if (ctx->obuf_len <= 0)
58964a49 RE	407	{
58964a49 RE	408	ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
d02b48c6	409	break;
58964a49	410	}
d02b48c6 RE	411
	412	for (;;)
	413	{
	414	BIO_clear_retry_flags(b);
	415	if (ctx->obuf_len > ctx->obuf_off)
	416	{
	417	r=BIO_write(b->next_bio,
	418	&(ctx->obuf[ctx->obuf_off]),
	419	ctx->obuf_len-ctx->obuf_off);
	420	#if 0
	421	fprintf(stderr,"FLUSH [%3d] %3d -> %3d\n",ctx->obuf_off,ctx->obuf_len-ctx->obuf_off,r);
	422	#endif
	423	BIO_copy_next_retry(b);
	424	if (r <= 0) return((long)r);
	425	ctx->obuf_off+=r;
	426	}
	427	else
	428	{
	429	ctx->obuf_len=0;
	430	ctx->obuf_off=0;
	431	ret=1;
	432	break;
	433	}
	434	}
	435	break;
	436	case BIO_CTRL_DUP:
	437	dbio=(BIO *)ptr;
	438	if ( !BIO_set_read_buffer_size(dbio,ctx->ibuf_size) \|\|
	439	!BIO_set_write_buffer_size(dbio,ctx->obuf_size))
	440	ret=0;
	441	break;
	442	default:
	443	ret=BIO_ctrl(b->next_bio,cmd,num,ptr);
	444	break;
	445	}
	446	return(ret);
58964a49 RE	447	malloc_error:
	448	BIOerr(BIO_F_BUFFER_CTRL,ERR_R_MALLOC_FAILURE);
	449	return(0);
d02b48c6 RE	450	}
	451
	452	static int buffer_gets(b,buf,size)
	453	BIO *b;
	454	char *buf;
	455	int size;
	456	{
	457	BIO_F_BUFFER_CTX *ctx;
58964a49	458	int num=0,i,flag;
d02b48c6 RE	459	char *p;
	460
	461	ctx=(BIO_F_BUFFER_CTX *)b->ptr;
58964a49	462	size--; /* reserve space for a '\0' */
d02b48c6 RE	463	BIO_clear_retry_flags(b);
	464
	465	for (;;)
	466	{
58964a49	467	if (ctx->ibuf_len > 0)
d02b48c6 RE	468	{
d02b48c6 RE	469	p= &(ctx->ibuf[ctx->ibuf_off]);
58964a49 RE	470	flag=0;
58964a49 RE	471	for (i=0; (i<ctx->ibuf_len) && (i<size); i++)
d02b48c6 RE	472	{
d02b48c6 RE	473	*(buf++)=p[i];
58964a49 RE	474	if (p[i] == '\n')
	475	{
	476	flag=1;
	477	i++;
	478	break;
	479	}
d02b48c6 RE	480	}
	481	num+=i;
	482	size-=i;
	483	ctx->ibuf_len-=i;
	484	ctx->ibuf_off+=i;
58964a49	485	if ((flag) \|\| (i == size))
d02b48c6	486	{
58964a49	487	*buf='\0';
d02b48c6 RE	488	return(num);
	489	}
	490	}
	491	else /* read another chunk */
	492	{
	493	i=BIO_read(b->next_bio,ctx->ibuf,ctx->ibuf_size);
	494	if (i <= 0)
	495	{
	496	BIO_copy_next_retry(b);
	497	if (i < 0) return((num > 0)?num:i);
	498	if (i == 0) return(num);
	499	}
	500	ctx->ibuf_len=i;
	501	ctx->ibuf_off=0;
	502	}
	503	}
	504	}
	505
	506	static int buffer_puts(b,str)
	507	BIO *b;
	508	char *str;
	509	{
	510	return(BIO_write(b,str,strlen(str)));
	511	}
	512