1*67ecd4f3SMax Laier /*
2*67ecd4f3SMax Laier * Copyright (c) 2002, 2003 Niels Provos <provos@citi.umich.edu>
3*67ecd4f3SMax Laier * All rights reserved.
4*67ecd4f3SMax Laier *
5*67ecd4f3SMax Laier * Redistribution and use in source and binary forms, with or without
6*67ecd4f3SMax Laier * modification, are permitted provided that the following conditions
7*67ecd4f3SMax Laier * are met:
8*67ecd4f3SMax Laier * 1. Redistributions of source code must retain the above copyright
9*67ecd4f3SMax Laier * notice, this list of conditions and the following disclaimer.
10*67ecd4f3SMax Laier * 2. Redistributions in binary form must reproduce the above copyright
11*67ecd4f3SMax Laier * notice, this list of conditions and the following disclaimer in the
12*67ecd4f3SMax Laier * documentation and/or other materials provided with the distribution.
13*67ecd4f3SMax Laier * 3. The name of the author may not be used to endorse or promote products
14*67ecd4f3SMax Laier * derived from this software without specific prior written permission.
15*67ecd4f3SMax Laier *
16*67ecd4f3SMax Laier * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
17*67ecd4f3SMax Laier * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
18*67ecd4f3SMax Laier * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
19*67ecd4f3SMax Laier * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
20*67ecd4f3SMax Laier * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21*67ecd4f3SMax Laier * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
22*67ecd4f3SMax Laier * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
23*67ecd4f3SMax Laier * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24*67ecd4f3SMax Laier * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
25*67ecd4f3SMax Laier * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26*67ecd4f3SMax Laier */
27*67ecd4f3SMax Laier
28*67ecd4f3SMax Laier #ifdef HAVE_CONFIG_H
29*67ecd4f3SMax Laier #include "config.h"
30*67ecd4f3SMax Laier #endif
31*67ecd4f3SMax Laier
32*67ecd4f3SMax Laier #ifdef HAVE_VASPRINTF
33*67ecd4f3SMax Laier /* If we have vasprintf, we need to define this before we include stdio.h. */
34*67ecd4f3SMax Laier #define _GNU_SOURCE
35*67ecd4f3SMax Laier #endif
36*67ecd4f3SMax Laier
37*67ecd4f3SMax Laier #include <sys/types.h>
38*67ecd4f3SMax Laier
39*67ecd4f3SMax Laier #ifdef HAVE_SYS_TIME_H
40*67ecd4f3SMax Laier #include <sys/time.h>
41*67ecd4f3SMax Laier #endif
42*67ecd4f3SMax Laier
43*67ecd4f3SMax Laier #ifdef HAVE_SYS_IOCTL_H
44*67ecd4f3SMax Laier #include <sys/ioctl.h>
45*67ecd4f3SMax Laier #endif
46*67ecd4f3SMax Laier
47*67ecd4f3SMax Laier #include <errno.h>
48*67ecd4f3SMax Laier #include <stdio.h>
49*67ecd4f3SMax Laier #include <stdlib.h>
50*67ecd4f3SMax Laier #include <string.h>
51*67ecd4f3SMax Laier #ifdef HAVE_STDARG_H
52*67ecd4f3SMax Laier #include <stdarg.h>
53*67ecd4f3SMax Laier #endif
54*67ecd4f3SMax Laier #ifdef HAVE_UNISTD_H
55*67ecd4f3SMax Laier #include <unistd.h>
56*67ecd4f3SMax Laier #endif
57*67ecd4f3SMax Laier
58*67ecd4f3SMax Laier #include "event.h"
59*67ecd4f3SMax Laier
60*67ecd4f3SMax Laier struct evbuffer *
evbuffer_new(void)61*67ecd4f3SMax Laier evbuffer_new(void)
62*67ecd4f3SMax Laier {
63*67ecd4f3SMax Laier struct evbuffer *buffer;
64*67ecd4f3SMax Laier
65*67ecd4f3SMax Laier buffer = calloc(1, sizeof(struct evbuffer));
66*67ecd4f3SMax Laier
67*67ecd4f3SMax Laier return (buffer);
68*67ecd4f3SMax Laier }
69*67ecd4f3SMax Laier
70*67ecd4f3SMax Laier void
evbuffer_free(struct evbuffer * buffer)71*67ecd4f3SMax Laier evbuffer_free(struct evbuffer *buffer)
72*67ecd4f3SMax Laier {
73*67ecd4f3SMax Laier if (buffer->orig_buffer != NULL)
74*67ecd4f3SMax Laier free(buffer->orig_buffer);
75*67ecd4f3SMax Laier free(buffer);
76*67ecd4f3SMax Laier }
77*67ecd4f3SMax Laier
78*67ecd4f3SMax Laier /*
79*67ecd4f3SMax Laier * This is a destructive add. The data from one buffer moves into
80*67ecd4f3SMax Laier * the other buffer.
81*67ecd4f3SMax Laier */
82*67ecd4f3SMax Laier
83*67ecd4f3SMax Laier #define SWAP(x,y) do { \
84*67ecd4f3SMax Laier (x)->buffer = (y)->buffer; \
85*67ecd4f3SMax Laier (x)->orig_buffer = (y)->orig_buffer; \
86*67ecd4f3SMax Laier (x)->misalign = (y)->misalign; \
87*67ecd4f3SMax Laier (x)->totallen = (y)->totallen; \
88*67ecd4f3SMax Laier (x)->off = (y)->off; \
89*67ecd4f3SMax Laier } while (0)
90*67ecd4f3SMax Laier
91*67ecd4f3SMax Laier int
evbuffer_add_buffer(struct evbuffer * outbuf,struct evbuffer * inbuf)92*67ecd4f3SMax Laier evbuffer_add_buffer(struct evbuffer *outbuf, struct evbuffer *inbuf)
93*67ecd4f3SMax Laier {
94*67ecd4f3SMax Laier int res;
95*67ecd4f3SMax Laier
96*67ecd4f3SMax Laier /* Short cut for better performance */
97*67ecd4f3SMax Laier if (outbuf->off == 0) {
98*67ecd4f3SMax Laier struct evbuffer tmp;
99*67ecd4f3SMax Laier size_t oldoff = inbuf->off;
100*67ecd4f3SMax Laier
101*67ecd4f3SMax Laier /* Swap them directly */
102*67ecd4f3SMax Laier SWAP(&tmp, outbuf);
103*67ecd4f3SMax Laier SWAP(outbuf, inbuf);
104*67ecd4f3SMax Laier SWAP(inbuf, &tmp);
105*67ecd4f3SMax Laier
106*67ecd4f3SMax Laier /*
107*67ecd4f3SMax Laier * Optimization comes with a price; we need to notify the
108*67ecd4f3SMax Laier * buffer if necessary of the changes. oldoff is the amount
109*67ecd4f3SMax Laier * of data that we tranfered from inbuf to outbuf
110*67ecd4f3SMax Laier */
111*67ecd4f3SMax Laier if (inbuf->off != oldoff && inbuf->cb != NULL)
112*67ecd4f3SMax Laier (*inbuf->cb)(inbuf, oldoff, inbuf->off, inbuf->cbarg);
113*67ecd4f3SMax Laier if (oldoff && outbuf->cb != NULL)
114*67ecd4f3SMax Laier (*outbuf->cb)(outbuf, 0, oldoff, outbuf->cbarg);
115*67ecd4f3SMax Laier
116*67ecd4f3SMax Laier return (0);
117*67ecd4f3SMax Laier }
118*67ecd4f3SMax Laier
119*67ecd4f3SMax Laier res = evbuffer_add(outbuf, inbuf->buffer, inbuf->off);
120*67ecd4f3SMax Laier if (res == 0) {
121*67ecd4f3SMax Laier /* We drain the input buffer on success */
122*67ecd4f3SMax Laier evbuffer_drain(inbuf, inbuf->off);
123*67ecd4f3SMax Laier }
124*67ecd4f3SMax Laier
125*67ecd4f3SMax Laier return (res);
126*67ecd4f3SMax Laier }
127*67ecd4f3SMax Laier
128*67ecd4f3SMax Laier int
evbuffer_add_vprintf(struct evbuffer * buf,const char * fmt,va_list ap)129*67ecd4f3SMax Laier evbuffer_add_vprintf(struct evbuffer *buf, const char *fmt, va_list ap)
130*67ecd4f3SMax Laier {
131*67ecd4f3SMax Laier char *buffer;
132*67ecd4f3SMax Laier size_t space;
133*67ecd4f3SMax Laier size_t oldoff = buf->off;
134*67ecd4f3SMax Laier int sz;
135*67ecd4f3SMax Laier va_list aq;
136*67ecd4f3SMax Laier
137*67ecd4f3SMax Laier for (;;) {
138*67ecd4f3SMax Laier buffer = (char *)buf->buffer + buf->off;
139*67ecd4f3SMax Laier space = buf->totallen - buf->misalign - buf->off;
140*67ecd4f3SMax Laier
141*67ecd4f3SMax Laier #ifndef va_copy
142*67ecd4f3SMax Laier #define va_copy(dst, src) memcpy(&(dst), &(src), sizeof(va_list))
143*67ecd4f3SMax Laier #endif
144*67ecd4f3SMax Laier va_copy(aq, ap);
145*67ecd4f3SMax Laier
146*67ecd4f3SMax Laier #ifdef WIN32
147*67ecd4f3SMax Laier sz = vsnprintf(buffer, space - 1, fmt, aq);
148*67ecd4f3SMax Laier buffer[space - 1] = '\0';
149*67ecd4f3SMax Laier #else
150*67ecd4f3SMax Laier sz = vsnprintf(buffer, space, fmt, aq);
151*67ecd4f3SMax Laier #endif
152*67ecd4f3SMax Laier
153*67ecd4f3SMax Laier va_end(aq);
154*67ecd4f3SMax Laier
155*67ecd4f3SMax Laier if (sz == -1)
156*67ecd4f3SMax Laier return (-1);
157*67ecd4f3SMax Laier if (sz < space) {
158*67ecd4f3SMax Laier buf->off += sz;
159*67ecd4f3SMax Laier if (buf->cb != NULL)
160*67ecd4f3SMax Laier (*buf->cb)(buf, oldoff, buf->off, buf->cbarg);
161*67ecd4f3SMax Laier return (sz);
162*67ecd4f3SMax Laier }
163*67ecd4f3SMax Laier if (evbuffer_expand(buf, sz + 1) == -1)
164*67ecd4f3SMax Laier return (-1);
165*67ecd4f3SMax Laier
166*67ecd4f3SMax Laier }
167*67ecd4f3SMax Laier /* NOTREACHED */
168*67ecd4f3SMax Laier }
169*67ecd4f3SMax Laier
170*67ecd4f3SMax Laier int
evbuffer_add_printf(struct evbuffer * buf,const char * fmt,...)171*67ecd4f3SMax Laier evbuffer_add_printf(struct evbuffer *buf, const char *fmt, ...)
172*67ecd4f3SMax Laier {
173*67ecd4f3SMax Laier int res = -1;
174*67ecd4f3SMax Laier va_list ap;
175*67ecd4f3SMax Laier
176*67ecd4f3SMax Laier va_start(ap, fmt);
177*67ecd4f3SMax Laier res = evbuffer_add_vprintf(buf, fmt, ap);
178*67ecd4f3SMax Laier va_end(ap);
179*67ecd4f3SMax Laier
180*67ecd4f3SMax Laier return (res);
181*67ecd4f3SMax Laier }
182*67ecd4f3SMax Laier
183*67ecd4f3SMax Laier /* Reads data from an event buffer and drains the bytes read */
184*67ecd4f3SMax Laier
185*67ecd4f3SMax Laier int
evbuffer_remove(struct evbuffer * buf,void * data,size_t datlen)186*67ecd4f3SMax Laier evbuffer_remove(struct evbuffer *buf, void *data, size_t datlen)
187*67ecd4f3SMax Laier {
188*67ecd4f3SMax Laier size_t nread = datlen;
189*67ecd4f3SMax Laier if (nread >= buf->off)
190*67ecd4f3SMax Laier nread = buf->off;
191*67ecd4f3SMax Laier
192*67ecd4f3SMax Laier memcpy(data, buf->buffer, nread);
193*67ecd4f3SMax Laier evbuffer_drain(buf, nread);
194*67ecd4f3SMax Laier
195*67ecd4f3SMax Laier return (nread);
196*67ecd4f3SMax Laier }
197*67ecd4f3SMax Laier
198*67ecd4f3SMax Laier /*
199*67ecd4f3SMax Laier * Reads a line terminated by either '\r\n', '\n\r' or '\r' or '\n'.
200*67ecd4f3SMax Laier * The returned buffer needs to be freed by the called.
201*67ecd4f3SMax Laier */
202*67ecd4f3SMax Laier
203*67ecd4f3SMax Laier char *
evbuffer_readline(struct evbuffer * buffer)204*67ecd4f3SMax Laier evbuffer_readline(struct evbuffer *buffer)
205*67ecd4f3SMax Laier {
206*67ecd4f3SMax Laier u_char *data = EVBUFFER_DATA(buffer);
207*67ecd4f3SMax Laier size_t len = EVBUFFER_LENGTH(buffer);
208*67ecd4f3SMax Laier char *line;
209*67ecd4f3SMax Laier unsigned int i;
210*67ecd4f3SMax Laier
211*67ecd4f3SMax Laier for (i = 0; i < len; i++) {
212*67ecd4f3SMax Laier if (data[i] == '\r' || data[i] == '\n')
213*67ecd4f3SMax Laier break;
214*67ecd4f3SMax Laier }
215*67ecd4f3SMax Laier
216*67ecd4f3SMax Laier if (i == len)
217*67ecd4f3SMax Laier return (NULL);
218*67ecd4f3SMax Laier
219*67ecd4f3SMax Laier if ((line = malloc(i + 1)) == NULL) {
220*67ecd4f3SMax Laier fprintf(stderr, "%s: out of memory\n", __func__);
221*67ecd4f3SMax Laier evbuffer_drain(buffer, i);
222*67ecd4f3SMax Laier return (NULL);
223*67ecd4f3SMax Laier }
224*67ecd4f3SMax Laier
225*67ecd4f3SMax Laier memcpy(line, data, i);
226*67ecd4f3SMax Laier line[i] = '\0';
227*67ecd4f3SMax Laier
228*67ecd4f3SMax Laier /*
229*67ecd4f3SMax Laier * Some protocols terminate a line with '\r\n', so check for
230*67ecd4f3SMax Laier * that, too.
231*67ecd4f3SMax Laier */
232*67ecd4f3SMax Laier if ( i < len - 1 ) {
233*67ecd4f3SMax Laier char fch = data[i], sch = data[i+1];
234*67ecd4f3SMax Laier
235*67ecd4f3SMax Laier /* Drain one more character if needed */
236*67ecd4f3SMax Laier if ( (sch == '\r' || sch == '\n') && sch != fch )
237*67ecd4f3SMax Laier i += 1;
238*67ecd4f3SMax Laier }
239*67ecd4f3SMax Laier
240*67ecd4f3SMax Laier evbuffer_drain(buffer, i + 1);
241*67ecd4f3SMax Laier
242*67ecd4f3SMax Laier return (line);
243*67ecd4f3SMax Laier }
244*67ecd4f3SMax Laier
245*67ecd4f3SMax Laier /* Adds data to an event buffer */
246*67ecd4f3SMax Laier
247*67ecd4f3SMax Laier static inline void
evbuffer_align(struct evbuffer * buf)248*67ecd4f3SMax Laier evbuffer_align(struct evbuffer *buf)
249*67ecd4f3SMax Laier {
250*67ecd4f3SMax Laier memmove(buf->orig_buffer, buf->buffer, buf->off);
251*67ecd4f3SMax Laier buf->buffer = buf->orig_buffer;
252*67ecd4f3SMax Laier buf->misalign = 0;
253*67ecd4f3SMax Laier }
254*67ecd4f3SMax Laier
255*67ecd4f3SMax Laier /* Expands the available space in the event buffer to at least datlen */
256*67ecd4f3SMax Laier
257*67ecd4f3SMax Laier int
evbuffer_expand(struct evbuffer * buf,size_t datlen)258*67ecd4f3SMax Laier evbuffer_expand(struct evbuffer *buf, size_t datlen)
259*67ecd4f3SMax Laier {
260*67ecd4f3SMax Laier size_t need = buf->misalign + buf->off + datlen;
261*67ecd4f3SMax Laier
262*67ecd4f3SMax Laier /* If we can fit all the data, then we don't have to do anything */
263*67ecd4f3SMax Laier if (buf->totallen >= need)
264*67ecd4f3SMax Laier return (0);
265*67ecd4f3SMax Laier
266*67ecd4f3SMax Laier /*
267*67ecd4f3SMax Laier * If the misalignment fulfills our data needs, we just force an
268*67ecd4f3SMax Laier * alignment to happen. Afterwards, we have enough space.
269*67ecd4f3SMax Laier */
270*67ecd4f3SMax Laier if (buf->misalign >= datlen) {
271*67ecd4f3SMax Laier evbuffer_align(buf);
272*67ecd4f3SMax Laier } else {
273*67ecd4f3SMax Laier void *newbuf;
274*67ecd4f3SMax Laier size_t length = buf->totallen;
275*67ecd4f3SMax Laier
276*67ecd4f3SMax Laier if (length < 256)
277*67ecd4f3SMax Laier length = 256;
278*67ecd4f3SMax Laier while (length < need)
279*67ecd4f3SMax Laier length <<= 1;
280*67ecd4f3SMax Laier
281*67ecd4f3SMax Laier if (buf->orig_buffer != buf->buffer)
282*67ecd4f3SMax Laier evbuffer_align(buf);
283*67ecd4f3SMax Laier if ((newbuf = realloc(buf->buffer, length)) == NULL)
284*67ecd4f3SMax Laier return (-1);
285*67ecd4f3SMax Laier
286*67ecd4f3SMax Laier buf->orig_buffer = buf->buffer = newbuf;
287*67ecd4f3SMax Laier buf->totallen = length;
288*67ecd4f3SMax Laier }
289*67ecd4f3SMax Laier
290*67ecd4f3SMax Laier return (0);
291*67ecd4f3SMax Laier }
292*67ecd4f3SMax Laier
293*67ecd4f3SMax Laier int
evbuffer_add(struct evbuffer * buf,const void * data,size_t datlen)294*67ecd4f3SMax Laier evbuffer_add(struct evbuffer *buf, const void *data, size_t datlen)
295*67ecd4f3SMax Laier {
296*67ecd4f3SMax Laier size_t need = buf->misalign + buf->off + datlen;
297*67ecd4f3SMax Laier size_t oldoff = buf->off;
298*67ecd4f3SMax Laier
299*67ecd4f3SMax Laier if (buf->totallen < need) {
300*67ecd4f3SMax Laier if (evbuffer_expand(buf, datlen) == -1)
301*67ecd4f3SMax Laier return (-1);
302*67ecd4f3SMax Laier }
303*67ecd4f3SMax Laier
304*67ecd4f3SMax Laier memcpy(buf->buffer + buf->off, data, datlen);
305*67ecd4f3SMax Laier buf->off += datlen;
306*67ecd4f3SMax Laier
307*67ecd4f3SMax Laier if (datlen && buf->cb != NULL)
308*67ecd4f3SMax Laier (*buf->cb)(buf, oldoff, buf->off, buf->cbarg);
309*67ecd4f3SMax Laier
310*67ecd4f3SMax Laier return (0);
311*67ecd4f3SMax Laier }
312*67ecd4f3SMax Laier
313*67ecd4f3SMax Laier void
evbuffer_drain(struct evbuffer * buf,size_t len)314*67ecd4f3SMax Laier evbuffer_drain(struct evbuffer *buf, size_t len)
315*67ecd4f3SMax Laier {
316*67ecd4f3SMax Laier size_t oldoff = buf->off;
317*67ecd4f3SMax Laier
318*67ecd4f3SMax Laier if (len >= buf->off) {
319*67ecd4f3SMax Laier buf->off = 0;
320*67ecd4f3SMax Laier buf->buffer = buf->orig_buffer;
321*67ecd4f3SMax Laier buf->misalign = 0;
322*67ecd4f3SMax Laier goto done;
323*67ecd4f3SMax Laier }
324*67ecd4f3SMax Laier
325*67ecd4f3SMax Laier buf->buffer += len;
326*67ecd4f3SMax Laier buf->misalign += len;
327*67ecd4f3SMax Laier
328*67ecd4f3SMax Laier buf->off -= len;
329*67ecd4f3SMax Laier
330*67ecd4f3SMax Laier done:
331*67ecd4f3SMax Laier /* Tell someone about changes in this buffer */
332*67ecd4f3SMax Laier if (buf->off != oldoff && buf->cb != NULL)
333*67ecd4f3SMax Laier (*buf->cb)(buf, oldoff, buf->off, buf->cbarg);
334*67ecd4f3SMax Laier
335*67ecd4f3SMax Laier }
336*67ecd4f3SMax Laier
337*67ecd4f3SMax Laier /*
338*67ecd4f3SMax Laier * Reads data from a file descriptor into a buffer.
339*67ecd4f3SMax Laier */
340*67ecd4f3SMax Laier
341*67ecd4f3SMax Laier #define EVBUFFER_MAX_READ 4096
342*67ecd4f3SMax Laier
343*67ecd4f3SMax Laier int
evbuffer_read(struct evbuffer * buf,int fd,int howmuch)344*67ecd4f3SMax Laier evbuffer_read(struct evbuffer *buf, int fd, int howmuch)
345*67ecd4f3SMax Laier {
346*67ecd4f3SMax Laier u_char *p;
347*67ecd4f3SMax Laier size_t oldoff = buf->off;
348*67ecd4f3SMax Laier int n = EVBUFFER_MAX_READ;
349*67ecd4f3SMax Laier #ifdef WIN32
350*67ecd4f3SMax Laier DWORD dwBytesRead;
351*67ecd4f3SMax Laier #endif
352*67ecd4f3SMax Laier
353*67ecd4f3SMax Laier #ifdef FIONREAD
354*67ecd4f3SMax Laier if (ioctl(fd, FIONREAD, &n) == -1 || n == 0) {
355*67ecd4f3SMax Laier n = EVBUFFER_MAX_READ;
356*67ecd4f3SMax Laier } else if (n > EVBUFFER_MAX_READ && n > howmuch) {
357*67ecd4f3SMax Laier /*
358*67ecd4f3SMax Laier * It's possible that a lot of data is available for
359*67ecd4f3SMax Laier * reading. We do not want to exhaust resources
360*67ecd4f3SMax Laier * before the reader has a chance to do something
361*67ecd4f3SMax Laier * about it. If the reader does not tell us how much
362*67ecd4f3SMax Laier * data we should read, we artifically limit it.
363*67ecd4f3SMax Laier */
364*67ecd4f3SMax Laier if (n > buf->totallen << 2)
365*67ecd4f3SMax Laier n = buf->totallen << 2;
366*67ecd4f3SMax Laier if (n < EVBUFFER_MAX_READ)
367*67ecd4f3SMax Laier n = EVBUFFER_MAX_READ;
368*67ecd4f3SMax Laier }
369*67ecd4f3SMax Laier #endif
370*67ecd4f3SMax Laier if (howmuch < 0 || howmuch > n)
371*67ecd4f3SMax Laier howmuch = n;
372*67ecd4f3SMax Laier
373*67ecd4f3SMax Laier /* If we don't have FIONREAD, we might waste some space here */
374*67ecd4f3SMax Laier if (evbuffer_expand(buf, howmuch) == -1)
375*67ecd4f3SMax Laier return (-1);
376*67ecd4f3SMax Laier
377*67ecd4f3SMax Laier /* We can append new data at this point */
378*67ecd4f3SMax Laier p = buf->buffer + buf->off;
379*67ecd4f3SMax Laier
380*67ecd4f3SMax Laier #ifndef WIN32
381*67ecd4f3SMax Laier n = read(fd, p, howmuch);
382*67ecd4f3SMax Laier if (n == -1)
383*67ecd4f3SMax Laier return (-1);
384*67ecd4f3SMax Laier if (n == 0)
385*67ecd4f3SMax Laier return (0);
386*67ecd4f3SMax Laier #else
387*67ecd4f3SMax Laier n = ReadFile((HANDLE)fd, p, howmuch, &dwBytesRead, NULL);
388*67ecd4f3SMax Laier if (n == 0)
389*67ecd4f3SMax Laier return (-1);
390*67ecd4f3SMax Laier if (dwBytesRead == 0)
391*67ecd4f3SMax Laier return (0);
392*67ecd4f3SMax Laier n = dwBytesRead;
393*67ecd4f3SMax Laier #endif
394*67ecd4f3SMax Laier
395*67ecd4f3SMax Laier buf->off += n;
396*67ecd4f3SMax Laier
397*67ecd4f3SMax Laier /* Tell someone about changes in this buffer */
398*67ecd4f3SMax Laier if (buf->off != oldoff && buf->cb != NULL)
399*67ecd4f3SMax Laier (*buf->cb)(buf, oldoff, buf->off, buf->cbarg);
400*67ecd4f3SMax Laier
401*67ecd4f3SMax Laier return (n);
402*67ecd4f3SMax Laier }
403*67ecd4f3SMax Laier
404*67ecd4f3SMax Laier int
evbuffer_write(struct evbuffer * buffer,int fd)405*67ecd4f3SMax Laier evbuffer_write(struct evbuffer *buffer, int fd)
406*67ecd4f3SMax Laier {
407*67ecd4f3SMax Laier int n;
408*67ecd4f3SMax Laier #ifdef WIN32
409*67ecd4f3SMax Laier DWORD dwBytesWritten;
410*67ecd4f3SMax Laier #endif
411*67ecd4f3SMax Laier
412*67ecd4f3SMax Laier #ifndef WIN32
413*67ecd4f3SMax Laier n = write(fd, buffer->buffer, buffer->off);
414*67ecd4f3SMax Laier if (n == -1)
415*67ecd4f3SMax Laier return (-1);
416*67ecd4f3SMax Laier if (n == 0)
417*67ecd4f3SMax Laier return (0);
418*67ecd4f3SMax Laier #else
419*67ecd4f3SMax Laier n = WriteFile((HANDLE)fd, buffer->buffer, buffer->off, &dwBytesWritten, NULL);
420*67ecd4f3SMax Laier if (n == 0)
421*67ecd4f3SMax Laier return (-1);
422*67ecd4f3SMax Laier if (dwBytesWritten == 0)
423*67ecd4f3SMax Laier return (0);
424*67ecd4f3SMax Laier n = dwBytesWritten;
425*67ecd4f3SMax Laier #endif
426*67ecd4f3SMax Laier evbuffer_drain(buffer, n);
427*67ecd4f3SMax Laier
428*67ecd4f3SMax Laier return (n);
429*67ecd4f3SMax Laier }
430*67ecd4f3SMax Laier
431*67ecd4f3SMax Laier u_char *
evbuffer_find(struct evbuffer * buffer,const u_char * what,size_t len)432*67ecd4f3SMax Laier evbuffer_find(struct evbuffer *buffer, const u_char *what, size_t len)
433*67ecd4f3SMax Laier {
434*67ecd4f3SMax Laier size_t remain = buffer->off;
435*67ecd4f3SMax Laier u_char *search = buffer->buffer;
436*67ecd4f3SMax Laier u_char *p;
437*67ecd4f3SMax Laier
438*67ecd4f3SMax Laier while ((p = memchr(search, *what, remain)) != NULL) {
439*67ecd4f3SMax Laier remain = buffer->off - (size_t)(search - buffer->buffer);
440*67ecd4f3SMax Laier if (remain < len)
441*67ecd4f3SMax Laier break;
442*67ecd4f3SMax Laier if (memcmp(p, what, len) == 0)
443*67ecd4f3SMax Laier return (p);
444*67ecd4f3SMax Laier search = p + 1;
445*67ecd4f3SMax Laier }
446*67ecd4f3SMax Laier
447*67ecd4f3SMax Laier return (NULL);
448*67ecd4f3SMax Laier }
449*67ecd4f3SMax Laier
evbuffer_setcb(struct evbuffer * buffer,void (* cb)(struct evbuffer *,size_t,size_t,void *),void * cbarg)450*67ecd4f3SMax Laier void evbuffer_setcb(struct evbuffer *buffer,
451*67ecd4f3SMax Laier void (*cb)(struct evbuffer *, size_t, size_t, void *),
452*67ecd4f3SMax Laier void *cbarg)
453*67ecd4f3SMax Laier {
454*67ecd4f3SMax Laier buffer->cb = cb;
455*67ecd4f3SMax Laier buffer->cbarg = cbarg;
456*67ecd4f3SMax Laier }
457