1 /* crypto/bio/bf_buff.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
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
);
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();
83 #define DEFAULT_BUFFER_SIZE 1024
85 static BIO_METHOD methods_buffer
=
98 BIO_METHOD
*BIO_f_buffer(void)
100 return(&methods_buffer
);
103 static int buffer_new(BIO
*bi
)
105 BIO_F_BUFFER_CTX
*ctx
;
107 ctx
=(BIO_F_BUFFER_CTX
*)Malloc(sizeof(BIO_F_BUFFER_CTX
));
108 if (ctx
== NULL
) return(0);
109 ctx
->ibuf
=(char *)Malloc(DEFAULT_BUFFER_SIZE
);
110 if (ctx
->ibuf
== NULL
) { Free(ctx
); return(0); }
111 ctx
->obuf
=(char *)Malloc(DEFAULT_BUFFER_SIZE
);
112 if (ctx
->obuf
== NULL
) { Free(ctx
->ibuf
); Free(ctx
); return(0); }
113 ctx
->ibuf_size
=DEFAULT_BUFFER_SIZE
;
114 ctx
->obuf_size
=DEFAULT_BUFFER_SIZE
;
126 static int buffer_free(BIO
*a
)
130 if (a
== NULL
) return(0);
131 b
=(BIO_F_BUFFER_CTX
*)a
->ptr
;
132 if (b
->ibuf
!= NULL
) Free(b
->ibuf
);
133 if (b
->obuf
!= NULL
) Free(b
->obuf
);
141 static int buffer_read(BIO
*b
, char *out
, int outl
)
144 BIO_F_BUFFER_CTX
*ctx
;
146 if (out
== NULL
) return(0);
147 ctx
=(BIO_F_BUFFER_CTX
*)b
->ptr
;
149 if ((ctx
== NULL
) || (b
->next_bio
== NULL
)) return(0);
151 BIO_clear_retry_flags(b
);
155 /* If there is stuff left over, grab it */
158 if (i
> outl
) i
=outl
;
159 memcpy(out
,&(ctx
->ibuf
[ctx
->ibuf_off
]),i
);
163 if (outl
== i
) return(num
);
168 /* We may have done a partial read. try to do more.
169 * We have nothing in the buffer.
170 * If we get an error and have read some data, just return it
171 * and let them retry to get the error again.
172 * copy direct to parent address space */
173 if (outl
> ctx
->ibuf_size
)
177 i
=BIO_read(b
->next_bio
,out
,outl
);
180 BIO_copy_next_retry(b
);
181 if (i
< 0) return((num
> 0)?num
:i
);
182 if (i
== 0) return(num
);
185 if (outl
== i
) return(num
);
192 /* we are going to be doing some buffering */
193 i
=BIO_read(b
->next_bio
,ctx
->ibuf
,ctx
->ibuf_size
);
196 BIO_copy_next_retry(b
);
197 if (i
< 0) return((num
> 0)?num
:i
);
198 if (i
== 0) return(num
);
203 /* Lets re-read using ourselves :-) */
207 static int buffer_write(BIO
*b
, char *in
, int inl
)
210 BIO_F_BUFFER_CTX
*ctx
;
212 if ((in
== NULL
) || (inl
<= 0)) return(0);
213 ctx
=(BIO_F_BUFFER_CTX
*)b
->ptr
;
214 if ((ctx
== NULL
) || (b
->next_bio
== NULL
)) return(0);
216 BIO_clear_retry_flags(b
);
218 i
=ctx
->obuf_size
-(ctx
->obuf_len
+ctx
->obuf_off
);
219 /* add to buffer and return */
222 memcpy(&(ctx
->obuf
[ctx
->obuf_len
]),in
,inl
);
227 /* stuff already in buffer, so add to it first, then flush */
228 if (ctx
->obuf_len
!= 0)
230 if (i
> 0) /* lets fill it up if we can */
232 memcpy(&(ctx
->obuf
[ctx
->obuf_len
]),in
,i
);
238 /* we now have a full buffer needing flushing */
241 i
=BIO_write(b
->next_bio
,&(ctx
->obuf
[ctx
->obuf_off
]),
245 BIO_copy_next_retry(b
);
247 if (i
< 0) return((num
> 0)?num
:i
);
248 if (i
== 0) return(num
);
252 if (ctx
->obuf_len
== 0) break;
255 /* we only get here if the buffer has been flushed and we
256 * still have stuff to write */
259 /* we now have inl bytes to write */
260 while (inl
>= ctx
->obuf_size
)
262 i
=BIO_write(b
->next_bio
,in
,inl
);
265 BIO_copy_next_retry(b
);
266 if (i
< 0) return((num
> 0)?num
:i
);
267 if (i
== 0) return(num
);
272 if (inl
== 0) return(num
);
275 /* copy the rest into the buffer since we have only a small
280 static long buffer_ctrl(BIO
*b
, int cmd
, long num
, char *ptr
)
283 BIO_F_BUFFER_CTX
*ctx
;
289 ctx
=(BIO_F_BUFFER_CTX
*)b
->ptr
;
298 ret
=BIO_ctrl(b
->next_bio
,cmd
,num
,ptr
);
301 ret
=(long)ctx
->obuf_len
;
303 case BIO_C_GET_BUFF_NUM_LINES
:
306 for (i
=ctx
->ibuf_off
; i
<ctx
->ibuf_len
; i
++)
308 if (p1
[i
] == '\n') ret
++;
311 case BIO_CTRL_WPENDING
:
312 ret
=(long)ctx
->obuf_len
;
314 ret
=BIO_ctrl(b
->next_bio
,cmd
,num
,ptr
);
316 case BIO_CTRL_PENDING
:
317 ret
=(long)ctx
->ibuf_len
;
319 ret
=BIO_ctrl(b
->next_bio
,cmd
,num
,ptr
);
321 case BIO_C_SET_BUFF_READ_DATA
:
322 if (num
> ctx
->ibuf_size
)
325 if (p1
== NULL
) goto malloc_error
;
326 if (ctx
->ibuf
!= NULL
) Free(ctx
->ibuf
);
330 ctx
->ibuf_len
=(int)num
;
331 memcpy(ctx
->ibuf
,ptr
,(int)num
);
334 case BIO_C_SET_BUFF_SIZE
:
343 else /* if (*ip == 1) */
356 if ((ibs
> DEFAULT_BUFFER_SIZE
) && (ibs
!= ctx
->ibuf_size
))
358 p1
=(char *)Malloc((int)num
);
359 if (p1
== NULL
) goto malloc_error
;
361 if ((obs
> DEFAULT_BUFFER_SIZE
) && (obs
!= ctx
->obuf_size
))
363 p2
=(char *)Malloc((int)num
);
366 if (p1
!= ctx
->ibuf
) Free(p1
);
387 case BIO_C_DO_STATE_MACHINE
:
388 BIO_clear_retry_flags(b
);
389 ret
=BIO_ctrl(b
->next_bio
,cmd
,num
,ptr
);
390 BIO_copy_next_retry(b
);
394 if (ctx
->obuf_len
<= 0)
396 ret
=BIO_ctrl(b
->next_bio
,cmd
,num
,ptr
);
402 BIO_clear_retry_flags(b
);
403 if (ctx
->obuf_len
> ctx
->obuf_off
)
405 r
=BIO_write(b
->next_bio
,
406 &(ctx
->obuf
[ctx
->obuf_off
]),
407 ctx
->obuf_len
-ctx
->obuf_off
);
409 fprintf(stderr
,"FLUSH [%3d] %3d -> %3d\n",ctx
->obuf_off
,ctx
->obuf_len
-ctx
->obuf_off
,r
);
411 BIO_copy_next_retry(b
);
412 if (r
<= 0) return((long)r
);
423 ret
=BIO_ctrl(b
->next_bio
,cmd
,num
,ptr
);
427 if ( !BIO_set_read_buffer_size(dbio
,ctx
->ibuf_size
) ||
428 !BIO_set_write_buffer_size(dbio
,ctx
->obuf_size
))
432 ret
=BIO_ctrl(b
->next_bio
,cmd
,num
,ptr
);
437 BIOerr(BIO_F_BUFFER_CTRL
,ERR_R_MALLOC_FAILURE
);
441 static int buffer_gets(BIO
*b
, char *buf
, int size
)
443 BIO_F_BUFFER_CTX
*ctx
;
447 ctx
=(BIO_F_BUFFER_CTX
*)b
->ptr
;
448 size
--; /* reserve space for a '\0' */
449 BIO_clear_retry_flags(b
);
453 if (ctx
->ibuf_len
> 0)
455 p
= &(ctx
->ibuf
[ctx
->ibuf_off
]);
457 for (i
=0; (i
<ctx
->ibuf_len
) && (i
<size
); i
++)
471 if ((flag
) || (i
== size
))
477 else /* read another chunk */
479 i
=BIO_read(b
->next_bio
,ctx
->ibuf
,ctx
->ibuf_size
);
482 BIO_copy_next_retry(b
);
483 if (i
< 0) return((num
> 0)?num
:i
);
484 if (i
== 0) return(num
);
492 static int buffer_puts(BIO
*b
, char *str
)
494 return(BIO_write(b
,str
,strlen(str
)));