Game of Trees Repos

Blob

Date:: Mon Apr 15 14:52:33 2024 UTC
Message:: Unset errno and bio->wantev if error was not TLS_WANT_*. This is commonly called in a loop, if we don't clear them we might keep on looping. ok stsp@
Actions:: History | Blame | Raw File
1 /*
2  * bufio.c was written by Omar Polo <op@omarpolo.com>
3  *
4  * This is free and unencumbered software released into the public domain.
5  *
6  * Anyone is free to copy, modify, publish, use, compile, sell, or
7  * distribute this software, either in source code form or as a compiled
8  * binary, for any purpose, commercial or non-commercial, and by any
9  * means.
10  *
11  * In jurisdictions that recognize copyright laws, the author or authors
12  * of this software dedicate any and all copyright interest in the
13  * software to the public domain. We make this dedication for the benefit
14  * of the public at large and to the detriment of our heirs and
15  * successors. We intend this dedication to be an overt act of
16  * relinquishment in perpetuity of all present and future rights to this
17  * software under copyright law.
18  *
19  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
20  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
21  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
22  * IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
23  * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
24  * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
25  * OTHER DEALINGS IN THE SOFTWARE.
26  */
27 
28 #include <assert.h>
29 #include <errno.h>
30 #include <stdarg.h>
31 #include <stdint.h>
32 #include <stdio.h>
33 #include <stdlib.h>
34 #include <string.h>
35 #include <tls.h>
36 #include <unistd.h>
37 
38 #include "bufio.h"
39 
40 int
41 buf_init(struct buf *buf)
42 {
43 	const size_t	 cap = BIO_CHUNK;
44 
45 	memset(buf, 0, sizeof(*buf));
46 	if ((buf->buf = malloc(cap)) == NULL)
47 		return (-1);
48 	buf->cap = cap;
49 	return (0);
50 }
51 
52 static int
53 buf_grow(struct buf *buf)
54 {
55 	size_t		 newcap;
56 	void		*t;
57 
58 	newcap = buf->cap + BIO_CHUNK;
59 	t = realloc(buf->buf, newcap);
60 	if (t == NULL)
61 		return (-1);
62 	buf->buf = t;
63 	buf->cap = newcap;
64 	return (0);
65 }
66 
67 int
68 buf_has_line(struct buf *buf, const char *nl)
69 {
70 	return (memmem(buf->buf, buf->len, nl, strlen(nl)) != NULL);
71 }
72 
73 char *
74 buf_getdelim(struct buf *buf, const char *nl, size_t *len)
75 {
76 	uint8_t	*endl;
77 	size_t	 nlen;
78 
79 	*len = 0;
80 
81 	nlen = strlen(nl);
82 	if ((endl = memmem(buf->buf, buf->len, nl, nlen)) == NULL)
83 		return (NULL);
84 	*len = endl + nlen - buf->buf;
85 	*endl = '\0';
86 	return (buf->buf);
87 }
88 
89 void
90 buf_drain(struct buf *buf, size_t l)
91 {
92 	buf->cur = 0;
93 
94 	if (l >= buf->len) {
95 		buf->len = 0;
96 		return;
97 	}
98 
99 	memmove(buf->buf, buf->buf + l, buf->len - l);
100 	buf->len -= l;
101 }
102 
103 void
104 buf_drain_line(struct buf *buf, const char *nl)
105 {
106 	uint8_t		*endln;
107 	size_t		 nlen;
108 
109 	nlen = strlen(nl);
110 	if ((endln = memmem(buf->buf, buf->len, nl, nlen)) == NULL)
111 		return;
112 	buf_drain(buf, endln + nlen - buf->buf);
113 }
114 
115 void
116 buf_free(struct buf *buf)
117 {
118 	free(buf->buf);
119 	memset(buf, 0, sizeof(*buf));
120 }
121 
122 int
123 bufio_init(struct bufio *bio)
124 {
125 	memset(bio, 0, sizeof(*bio));
126 	bio->fd = -1;
127 
128 	if (buf_init(&bio->wbuf) == -1)
129 		return (-1);
130 	if (buf_init(&bio->rbuf) == -1) {
131 		buf_free(&bio->wbuf);
132 		return (-1);
133 	}
134 	return (0);
135 }
136 
137 void
138 bufio_free(struct bufio *bio)
139 {
140 	if (bio->ctx)
141 		tls_free(bio->ctx);
142 	bio->ctx = NULL;
143 
144 	if (bio->fd != -1)
145 		close(bio->fd);
146 	bio->fd = -1;
147 
148 	buf_free(&bio->rbuf);
149 	buf_free(&bio->wbuf);
150 }
151 
152 int
153 bufio_close(struct bufio *bio)
154 {
155 	if (bio->ctx == NULL)
156 		return (0);
157 
158 	switch (tls_close(bio->ctx)) {
159 	case 0:
160 		return 0;
161 	case TLS_WANT_POLLIN:
162 		errno = EAGAIN;
163 		bio->wantev = BUFIO_WANT_READ;
164 		return (-1);
165 	case TLS_WANT_POLLOUT:
166 		errno = EAGAIN;
167 		bio->wantev = BUFIO_WANT_WRITE;
168 		return (-1);
169 	default:
170 		return (-1);
171 	}
172 }
173 
174 int
175 bufio_reset(struct bufio *bio)
176 {
177 	bufio_free(bio);
178 	return (bufio_init(bio));
179 }
180 
181 void
182 bufio_set_fd(struct bufio *bio, int fd)
183 {
184 	bio->fd = fd;
185 }
186 
187 int
188 bufio_starttls(struct bufio *bio, const char *host, int insecure,
189     const uint8_t *cert, size_t certlen, const uint8_t *key, size_t keylen)
190 {
191 	struct tls_config	*conf;
192 
193 	if ((conf = tls_config_new()) == NULL)
194 		return (-1);
195 
196 	if (insecure) {
197 		tls_config_insecure_noverifycert(conf);
198 		tls_config_insecure_noverifyname(conf);
199 		tls_config_insecure_noverifytime(conf);
200 	}
201 
202 	if (cert && tls_config_set_keypair_mem(conf, cert, certlen,
203 	    key, keylen) == -1) {
204 		tls_config_free(conf);
205 		return (-1);
206 	}
207 
208 	if ((bio->ctx = tls_client()) == NULL) {
209 		tls_config_free(conf);
210 		return (-1);
211 	}
212 
213 	if (tls_configure(bio->ctx, conf) == -1) {
214 		tls_config_free(conf);
215 		return (-1);
216 	}
217 
218 	tls_config_free(conf);
219 
220 	if (tls_connect_socket(bio->ctx, bio->fd, host) == -1)
221 		return (-1);
222 
223 	return (0);
224 }
225 
226 int
227 bufio_ev(struct bufio *bio)
228 {
229 	short		 ev;
230 
231 	if (bio->wantev)
232 		return (bio->wantev);
233 
234 	ev = BUFIO_WANT_READ;
235 	if (bio->wbuf.len != 0)
236 		ev |= BUFIO_WANT_WRITE;
237 
238 	return (ev);
239 }
240 
241 int
242 bufio_handshake(struct bufio *bio)
243 {
244 	if (bio->ctx == NULL) {
245 		errno = EINVAL;
246 		return (-1);
247 	}
248 
249 	switch (tls_handshake(bio->ctx)) {
250 	case 0:
251 		return (0);
252 	case TLS_WANT_POLLIN:
253 		errno = EAGAIN;
254 		bio->wantev = BUFIO_WANT_READ;
255 		return (-1);
256 	case TLS_WANT_POLLOUT:
257 		errno = EAGAIN;
258 		bio->wantev = BUFIO_WANT_WRITE;
259 		return (-1);
260 	default:
261 		return (-1);
262 	}
263 }
264 
265 ssize_t
266 bufio_read(struct bufio *bio)
267 {
268 	struct buf	*rbuf = &bio->rbuf;
269 	ssize_t		 r;
270 
271 	assert(rbuf->cap >= rbuf->len);
272 	if (rbuf->cap - rbuf->len < BIO_CHUNK) {
273 		if (buf_grow(rbuf) == -1)
274 			return (-1);
275 	}
276 
277 	if (bio->ctx) {
278 		r = tls_read(bio->ctx, rbuf->buf + rbuf->len,
279 		    rbuf->cap - rbuf->len);
280 		switch (r) {
281 		case TLS_WANT_POLLIN:
282 			errno = EAGAIN;
283 			bio->wantev = BUFIO_WANT_READ;
284 			return (-1);
285 		case TLS_WANT_POLLOUT:
286 			errno = EAGAIN;
287 			bio->wantev = BUFIO_WANT_WRITE;
288 			return (-1);
289 		case -1:
290 			bio->wantev = 0;
291 			errno = 0;
292 			return (-1);
293 		default:
294 			bio->wantev = 0;
295 			rbuf->len += r;
296 			return (r);
297 		}
298 	}
299 
300 	r = read(bio->fd, rbuf->buf + rbuf->len, rbuf->cap - rbuf->len);
301 	if (r == -1)
302 		return (-1);
303 	rbuf->len += r;
304 	return (r);
305 }
306 
307 size_t
308 bufio_drain(struct bufio *bio, void *d, size_t len)
309 {
310 	struct buf	*rbuf = &bio->rbuf;
311 
312 	if (len > rbuf->len)
313 		len = rbuf->len;
314 	memcpy(d, rbuf->buf, len);
315 	buf_drain(rbuf, len);
316 	return (len);
317 }
318 
319 ssize_t
320 bufio_write(struct bufio *bio)
321 {
322 	struct buf	*wbuf = &bio->wbuf;
323 	ssize_t		 w;
324 
325 	if (bio->ctx) {
326 		switch (w = tls_write(bio->ctx, wbuf->buf, wbuf->len)) {
327 		case TLS_WANT_POLLIN:
328 			errno = EAGAIN;
329 			bio->wantev = BUFIO_WANT_READ;
330 			return (-1);
331 		case TLS_WANT_POLLOUT:
332 			errno = EAGAIN;
333 			bio->wantev = BUFIO_WANT_WRITE;
334 			return (-1);
335 		case -1:
336 			return (-1);
337 		default:
338 			bio->wantev = 0;
339 			buf_drain(wbuf, w);
340 			return (w);
341 		}
342 	}
343 
344 	w = write(bio->fd, wbuf->buf, wbuf->len);
345 	if (w == -1)
346 		return (-1);
347 	buf_drain(wbuf, w);
348 	return (w);
349 }
350 
351 const char *
352 bufio_io_err(struct bufio *bio)
353 {
354 	if (bio->ctx)
355 		return tls_error(bio->ctx);
356 
357 	return strerror(errno);
358 }
359 
360 int
361 bufio_compose(struct bufio *bio, const void *d, size_t len)
362 {
363 	struct buf	*wbuf = &bio->wbuf;
364 
365 	while (wbuf->cap - wbuf->len < len) {
366 		if (buf_grow(wbuf) == -1)
367 			return (-1);
368 	}
369 
370 	memcpy(wbuf->buf + wbuf->len, d, len);
371 	wbuf->len += len;
372 	return (0);
373 }
374 
375 int
376 bufio_compose_str(struct bufio *bio, const char *str)
377 {
378 	return (bufio_compose(bio, str, strlen(str)));
379 }
380 
381 int
382 bufio_compose_fmt(struct bufio *bio, const char *fmt, ...)
383 {
384 	va_list		 ap;
385 	char		*str;
386 	int		 r;
387 
388 	va_start(ap, fmt);
389 	r = vasprintf(&str, fmt, ap);
390 	va_end(ap);
391 
392 	if (r == -1)
393 		return (-1);
394 	r = bufio_compose(bio, str, r);
395 	free(str);
396 	return (r);
397 }
398 
399 void
400 bufio_rewind_cursor(struct bufio *bio)
401 {
402 	bio->rbuf.cur = 0;
403 }
404 
405 int
406 bufio_get_cb(void *d)
407 {
408 	struct bufio	*bio = d;
409 	struct buf	*rbuf = &bio->rbuf;
410 
411 	if (rbuf->cur >= rbuf->len)
412 		return (EOF);
413 	return (rbuf->buf[rbuf->cur++]);
414 }
415 
416 int
417 bufio_peek_cb(void *d)
418 {
419 	struct bufio	*bio = d;
420 	struct buf	*rbuf = &bio->rbuf;
421 
422 	if (rbuf->cur >= rbuf->len)
423 		return (EOF);
424 	return (rbuf->buf[rbuf->cur]);
425 }