]>
Commit | Line | Data |
---|---|---|
89c4ed63 A |
1 | /* |
2 | * util/tube.c - pipe service | |
3 | * | |
4 | * Copyright (c) 2008, NLnet Labs. All rights reserved. | |
5 | * | |
6 | * This software is open source. | |
7 | * | |
8 | * Redistribution and use in source and binary forms, with or without | |
9 | * modification, are permitted provided that the following conditions | |
10 | * are met: | |
11 | * | |
12 | * Redistributions of source code must retain the above copyright notice, | |
13 | * this list of conditions and the following disclaimer. | |
14 | * | |
15 | * Redistributions in binary form must reproduce the above copyright notice, | |
16 | * this list of conditions and the following disclaimer in the documentation | |
17 | * and/or other materials provided with the distribution. | |
18 | * | |
19 | * Neither the name of the NLNET LABS nor the names of its contributors may | |
20 | * be used to endorse or promote products derived from this software without | |
21 | * specific prior written permission. | |
22 | * | |
23 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
24 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
25 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
26 | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
27 | * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
28 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED | |
29 | * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | |
30 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF | |
31 | * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING | |
32 | * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | |
33 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
34 | */ | |
35 | ||
36 | /** | |
37 | * \file | |
38 | * | |
39 | * This file contains pipe service functions. | |
40 | */ | |
e0b07f2d | 41 | #include <sys/time.h> |
89c4ed63 A |
42 | #include "config.h" |
43 | #include "util/tube.h" | |
44 | #include "util/log.h" | |
45 | #include "util/net_help.h" | |
46 | #include "util/netevent.h" | |
47 | #include "util/fptr_wlist.h" | |
48 | ||
49 | #ifndef USE_WINSOCK | |
50 | /* on unix */ | |
51 | ||
52 | #ifndef HAVE_SOCKETPAIR | |
53 | /** no socketpair() available, like on Minix 3.1.7, use pipe */ | |
54 | #define socketpair(f, t, p, sv) pipe(sv) | |
55 | #endif /* HAVE_SOCKETPAIR */ | |
56 | ||
57 | struct tube* tube_create(void) | |
58 | { | |
59 | struct tube* tube = (struct tube*)calloc(1, sizeof(*tube)); | |
60 | int sv[2]; | |
61 | if(!tube) { | |
62 | int err = errno; | |
63 | log_err("tube_create: out of memory"); | |
64 | errno = err; | |
65 | return NULL; | |
66 | } | |
67 | tube->sr = -1; | |
68 | tube->sw = -1; | |
69 | if(socketpair(AF_UNIX, SOCK_STREAM, 0, sv) == -1) { | |
70 | int err = errno; | |
71 | log_err("socketpair: %s", strerror(errno)); | |
72 | free(tube); | |
73 | errno = err; | |
74 | return NULL; | |
75 | } | |
76 | tube->sr = sv[0]; | |
77 | tube->sw = sv[1]; | |
78 | if(!fd_set_nonblock(tube->sr) || !fd_set_nonblock(tube->sw)) { | |
79 | int err = errno; | |
80 | log_err("tube: cannot set nonblocking"); | |
81 | tube_delete(tube); | |
82 | errno = err; | |
83 | return NULL; | |
84 | } | |
85 | return tube; | |
86 | } | |
87 | ||
88 | void tube_delete(struct tube* tube) | |
89 | { | |
90 | if(!tube) return; | |
91 | tube_remove_bg_listen(tube); | |
92 | tube_remove_bg_write(tube); | |
93 | /* close fds after deleting commpoints, to be sure. | |
94 | * Also epoll does not like closing fd before event_del */ | |
95 | tube_close_read(tube); | |
96 | tube_close_write(tube); | |
97 | free(tube); | |
98 | } | |
99 | ||
100 | void tube_close_read(struct tube* tube) | |
101 | { | |
102 | if(tube->sr != -1) { | |
103 | close(tube->sr); | |
104 | tube->sr = -1; | |
105 | } | |
106 | } | |
107 | ||
108 | void tube_close_write(struct tube* tube) | |
109 | { | |
110 | if(tube->sw != -1) { | |
111 | close(tube->sw); | |
112 | tube->sw = -1; | |
113 | } | |
114 | } | |
115 | ||
116 | void tube_remove_bg_listen(struct tube* tube) | |
117 | { | |
118 | if(tube->listen_com) { | |
119 | comm_point_delete(tube->listen_com); | |
120 | tube->listen_com = NULL; | |
121 | } | |
122 | if(tube->cmd_msg) { | |
123 | free(tube->cmd_msg); | |
124 | tube->cmd_msg = NULL; | |
125 | } | |
126 | } | |
127 | ||
128 | void tube_remove_bg_write(struct tube* tube) | |
129 | { | |
130 | if(tube->res_com) { | |
131 | comm_point_delete(tube->res_com); | |
132 | tube->res_com = NULL; | |
133 | } | |
134 | if(tube->res_list) { | |
135 | struct tube_res_list* np, *p = tube->res_list; | |
136 | tube->res_list = NULL; | |
137 | tube->res_last = NULL; | |
138 | while(p) { | |
139 | np = p->next; | |
140 | free(p->buf); | |
141 | free(p); | |
142 | p = np; | |
143 | } | |
144 | } | |
145 | } | |
146 | ||
147 | int | |
148 | tube_handle_listen(struct comm_point* c, void* arg, int error, | |
149 | struct comm_reply* ATTR_UNUSED(reply_info)) | |
150 | { | |
151 | struct tube* tube = (struct tube*)arg; | |
152 | ssize_t r; | |
153 | if(error != NETEVENT_NOERROR) { | |
154 | fptr_ok(fptr_whitelist_tube_listen(tube->listen_cb)); | |
155 | (*tube->listen_cb)(tube, NULL, 0, error, tube->listen_arg); | |
156 | return 0; | |
157 | } | |
158 | ||
159 | if(tube->cmd_read < sizeof(tube->cmd_len)) { | |
160 | /* complete reading the length of control msg */ | |
161 | r = read(c->fd, ((uint8_t*)&tube->cmd_len) + tube->cmd_read, | |
162 | sizeof(tube->cmd_len) - tube->cmd_read); | |
163 | if(r==0) { | |
164 | /* error has happened or */ | |
165 | /* parent closed pipe, must have exited somehow */ | |
166 | fptr_ok(fptr_whitelist_tube_listen(tube->listen_cb)); | |
167 | (*tube->listen_cb)(tube, NULL, 0, NETEVENT_CLOSED, | |
168 | tube->listen_arg); | |
169 | return 0; | |
170 | } | |
171 | if(r==-1) { | |
172 | if(errno != EAGAIN && errno != EINTR) { | |
173 | log_err("rpipe error: %s", strerror(errno)); | |
174 | } | |
175 | /* nothing to read now, try later */ | |
176 | return 0; | |
177 | } | |
178 | tube->cmd_read += r; | |
179 | if(tube->cmd_read < sizeof(tube->cmd_len)) { | |
180 | /* not complete, try later */ | |
181 | return 0; | |
182 | } | |
183 | tube->cmd_msg = (uint8_t*)calloc(1, tube->cmd_len); | |
184 | if(!tube->cmd_msg) { | |
185 | log_err("malloc failure"); | |
186 | tube->cmd_read = 0; | |
187 | return 0; | |
188 | } | |
189 | } | |
190 | /* cmd_len has been read, read remainder */ | |
191 | r = read(c->fd, tube->cmd_msg+tube->cmd_read-sizeof(tube->cmd_len), | |
192 | tube->cmd_len - (tube->cmd_read - sizeof(tube->cmd_len))); | |
193 | if(r==0) { | |
194 | /* error has happened or */ | |
195 | /* parent closed pipe, must have exited somehow */ | |
196 | fptr_ok(fptr_whitelist_tube_listen(tube->listen_cb)); | |
197 | (*tube->listen_cb)(tube, NULL, 0, NETEVENT_CLOSED, | |
198 | tube->listen_arg); | |
199 | return 0; | |
200 | } | |
201 | if(r==-1) { | |
202 | /* nothing to read now, try later */ | |
203 | if(errno != EAGAIN && errno != EINTR) { | |
204 | log_err("rpipe error: %s", strerror(errno)); | |
205 | } | |
206 | return 0; | |
207 | } | |
208 | tube->cmd_read += r; | |
209 | if(tube->cmd_read < sizeof(tube->cmd_len) + tube->cmd_len) { | |
210 | /* not complete, try later */ | |
211 | return 0; | |
212 | } | |
213 | tube->cmd_read = 0; | |
214 | ||
215 | fptr_ok(fptr_whitelist_tube_listen(tube->listen_cb)); | |
216 | (*tube->listen_cb)(tube, tube->cmd_msg, tube->cmd_len, | |
217 | NETEVENT_NOERROR, tube->listen_arg); | |
218 | /* also frees the buf */ | |
219 | tube->cmd_msg = NULL; | |
220 | return 0; | |
221 | } | |
222 | ||
223 | int | |
224 | tube_handle_write(struct comm_point* c, void* arg, int error, | |
225 | struct comm_reply* ATTR_UNUSED(reply_info)) | |
226 | { | |
227 | struct tube* tube = (struct tube*)arg; | |
228 | struct tube_res_list* item = tube->res_list; | |
229 | ssize_t r; | |
230 | if(error != NETEVENT_NOERROR) { | |
231 | log_err("tube_handle_write net error %d", error); | |
232 | return 0; | |
233 | } | |
234 | ||
235 | if(!item) { | |
236 | comm_point_stop_listening(c); | |
237 | return 0; | |
238 | } | |
239 | ||
240 | if(tube->res_write < sizeof(item->len)) { | |
241 | r = write(c->fd, ((uint8_t*)&item->len) + tube->res_write, | |
242 | sizeof(item->len) - tube->res_write); | |
243 | if(r == -1) { | |
244 | if(errno != EAGAIN && errno != EINTR) { | |
245 | log_err("wpipe error: %s", strerror(errno)); | |
246 | } | |
247 | return 0; /* try again later */ | |
248 | } | |
249 | if(r == 0) { | |
250 | /* error on pipe, must have exited somehow */ | |
251 | /* cannot signal this to pipe user */ | |
252 | return 0; | |
253 | } | |
254 | tube->res_write += r; | |
255 | if(tube->res_write < sizeof(item->len)) | |
256 | return 0; | |
257 | } | |
258 | r = write(c->fd, item->buf + tube->res_write - sizeof(item->len), | |
259 | item->len - (tube->res_write - sizeof(item->len))); | |
260 | if(r == -1) { | |
261 | if(errno != EAGAIN && errno != EINTR) { | |
262 | log_err("wpipe error: %s", strerror(errno)); | |
263 | } | |
264 | return 0; /* try again later */ | |
265 | } | |
266 | if(r == 0) { | |
267 | /* error on pipe, must have exited somehow */ | |
268 | /* cannot signal this to pipe user */ | |
269 | return 0; | |
270 | } | |
271 | tube->res_write += r; | |
272 | if(tube->res_write < sizeof(item->len) + item->len) | |
273 | return 0; | |
274 | /* done this result, remove it */ | |
275 | free(item->buf); | |
276 | item->buf = NULL; | |
277 | tube->res_list = tube->res_list->next; | |
278 | free(item); | |
279 | if(!tube->res_list) { | |
280 | tube->res_last = NULL; | |
281 | comm_point_stop_listening(c); | |
282 | } | |
283 | tube->res_write = 0; | |
284 | return 0; | |
285 | } | |
286 | ||
287 | int tube_write_msg(struct tube* tube, uint8_t* buf, uint32_t len, | |
288 | int nonblock) | |
289 | { | |
290 | ssize_t r, d; | |
291 | int fd = tube->sw; | |
292 | ||
293 | /* test */ | |
294 | if(nonblock) { | |
295 | r = write(fd, &len, sizeof(len)); | |
296 | if(r == -1) { | |
297 | if(errno==EINTR || errno==EAGAIN) | |
298 | return -1; | |
299 | log_err("tube msg write failed: %s", strerror(errno)); | |
300 | return -1; /* can still continue, perhaps */ | |
301 | } | |
302 | } else r = 0; | |
303 | if(!fd_set_block(fd)) | |
304 | return 0; | |
305 | /* write remainder */ | |
306 | d = r; | |
307 | while(d != (ssize_t)sizeof(len)) { | |
308 | if((r=write(fd, ((char*)&len)+d, sizeof(len)-d)) == -1) { | |
309 | log_err("tube msg write failed: %s", strerror(errno)); | |
310 | (void)fd_set_nonblock(fd); | |
311 | return 0; | |
312 | } | |
313 | d += r; | |
314 | } | |
315 | d = 0; | |
316 | while(d != (ssize_t)len) { | |
317 | if((r=write(fd, buf+d, len-d)) == -1) { | |
318 | log_err("tube msg write failed: %s", strerror(errno)); | |
319 | (void)fd_set_nonblock(fd); | |
320 | return 0; | |
321 | } | |
322 | d += r; | |
323 | } | |
324 | if(!fd_set_nonblock(fd)) | |
325 | return 0; | |
326 | return 1; | |
327 | } | |
328 | ||
329 | int tube_read_msg(struct tube* tube, uint8_t** buf, uint32_t* len, | |
330 | int nonblock) | |
331 | { | |
332 | ssize_t r, d; | |
333 | int fd = tube->sr; | |
334 | ||
335 | /* test */ | |
336 | *len = 0; | |
337 | if(nonblock) { | |
338 | r = read(fd, len, sizeof(*len)); | |
339 | if(r == -1) { | |
340 | if(errno==EINTR || errno==EAGAIN) | |
341 | return -1; | |
342 | log_err("tube msg read failed: %s", strerror(errno)); | |
343 | return -1; /* we can still continue, perhaps */ | |
344 | } | |
345 | if(r == 0) /* EOF */ | |
346 | return 0; | |
347 | } else r = 0; | |
348 | if(!fd_set_block(fd)) | |
349 | return 0; | |
350 | /* read remainder */ | |
351 | d = r; | |
352 | while(d != (ssize_t)sizeof(*len)) { | |
353 | if((r=read(fd, ((char*)len)+d, sizeof(*len)-d)) == -1) { | |
354 | log_err("tube msg read failed: %s", strerror(errno)); | |
355 | (void)fd_set_nonblock(fd); | |
356 | return 0; | |
357 | } | |
358 | if(r == 0) /* EOF */ { | |
359 | (void)fd_set_nonblock(fd); | |
360 | return 0; | |
361 | } | |
362 | d += r; | |
363 | } | |
364 | log_assert(*len < 65536*2); | |
365 | *buf = (uint8_t*)malloc(*len); | |
366 | if(!*buf) { | |
367 | log_err("tube read out of memory"); | |
368 | (void)fd_set_nonblock(fd); | |
369 | return 0; | |
370 | } | |
371 | d = 0; | |
372 | while(d < (ssize_t)*len) { | |
373 | if((r=read(fd, (*buf)+d, (size_t)((ssize_t)*len)-d)) == -1) { | |
374 | log_err("tube msg read failed: %s", strerror(errno)); | |
375 | (void)fd_set_nonblock(fd); | |
376 | free(*buf); | |
377 | return 0; | |
378 | } | |
379 | if(r == 0) { /* EOF */ | |
380 | (void)fd_set_nonblock(fd); | |
381 | free(*buf); | |
382 | return 0; | |
383 | } | |
384 | d += r; | |
385 | } | |
386 | if(!fd_set_nonblock(fd)) { | |
387 | free(*buf); | |
388 | return 0; | |
389 | } | |
390 | return 1; | |
391 | } | |
392 | ||
393 | /** perform a select() on the fd */ | |
394 | static int | |
395 | pollit(int fd, struct timeval* t) | |
396 | { | |
397 | fd_set r; | |
398 | #ifndef S_SPLINT_S | |
399 | FD_ZERO(&r); | |
400 | FD_SET(FD_SET_T fd, &r); | |
401 | #endif | |
402 | if(select(fd+1, &r, NULL, NULL, t) == -1) { | |
403 | return 0; | |
404 | } | |
405 | errno = 0; | |
406 | return (int)(FD_ISSET(fd, &r)); | |
407 | } | |
408 | ||
409 | int tube_poll(struct tube* tube) | |
410 | { | |
411 | struct timeval t; | |
412 | memset(&t, 0, sizeof(t)); | |
413 | return pollit(tube->sr, &t); | |
414 | } | |
415 | ||
416 | int tube_wait(struct tube* tube) | |
417 | { | |
418 | return pollit(tube->sr, NULL); | |
419 | } | |
420 | ||
421 | int tube_read_fd(struct tube* tube) | |
422 | { | |
423 | return tube->sr; | |
424 | } | |
425 | ||
426 | int tube_setup_bg_listen(struct tube* tube, struct comm_base* base, | |
427 | tube_callback_t* cb, void* arg) | |
428 | { | |
429 | tube->listen_cb = cb; | |
430 | tube->listen_arg = arg; | |
431 | if(!(tube->listen_com = comm_point_create_raw(base, tube->sr, | |
432 | 0, tube_handle_listen, tube))) { | |
433 | int err = errno; | |
434 | log_err("tube_setup_bg_l: commpoint creation failed"); | |
435 | errno = err; | |
436 | return 0; | |
437 | } | |
438 | return 1; | |
439 | } | |
440 | ||
441 | int tube_setup_bg_write(struct tube* tube, struct comm_base* base) | |
442 | { | |
443 | if(!(tube->res_com = comm_point_create_raw(base, tube->sw, | |
444 | 1, tube_handle_write, tube))) { | |
445 | int err = errno; | |
446 | log_err("tube_setup_bg_w: commpoint creation failed"); | |
447 | errno = err; | |
448 | return 0; | |
449 | } | |
450 | return 1; | |
451 | } | |
452 | ||
453 | int tube_queue_item(struct tube* tube, uint8_t* msg, size_t len) | |
454 | { | |
455 | struct tube_res_list* item = | |
456 | (struct tube_res_list*)malloc(sizeof(*item)); | |
457 | if(!item) { | |
458 | free(msg); | |
459 | log_err("out of memory for async answer"); | |
460 | return 0; | |
461 | } | |
462 | item->buf = msg; | |
463 | item->len = len; | |
464 | item->next = NULL; | |
465 | /* add at back of list, since the first one may be partially written */ | |
466 | if(tube->res_last) | |
467 | tube->res_last->next = item; | |
468 | else tube->res_list = item; | |
469 | tube->res_last = item; | |
470 | if(tube->res_list == tube->res_last) { | |
471 | /* first added item, start the write process */ | |
472 | comm_point_start_listening(tube->res_com, -1, -1); | |
473 | } | |
474 | return 1; | |
475 | } | |
476 | ||
477 | void tube_handle_signal(int ATTR_UNUSED(fd), short ATTR_UNUSED(events), | |
478 | void* ATTR_UNUSED(arg)) | |
479 | { | |
480 | log_assert(0); | |
481 | } | |
482 | ||
483 | #else /* USE_WINSOCK */ | |
484 | /* on windows */ | |
485 | ||
486 | ||
487 | struct tube* tube_create(void) | |
488 | { | |
489 | /* windows does not have forks like unix, so we only support | |
490 | * threads on windows. And thus the pipe need only connect | |
491 | * threads. We use a mutex and a list of datagrams. */ | |
492 | struct tube* tube = (struct tube*)calloc(1, sizeof(*tube)); | |
493 | if(!tube) { | |
494 | int err = errno; | |
495 | log_err("tube_create: out of memory"); | |
496 | errno = err; | |
497 | return NULL; | |
498 | } | |
499 | tube->event = WSACreateEvent(); | |
500 | if(tube->event == WSA_INVALID_EVENT) { | |
501 | free(tube); | |
502 | log_err("WSACreateEvent: %s", wsa_strerror(WSAGetLastError())); | |
503 | } | |
504 | if(!WSAResetEvent(tube->event)) { | |
505 | log_err("WSAResetEvent: %s", wsa_strerror(WSAGetLastError())); | |
506 | } | |
507 | lock_basic_init(&tube->res_lock); | |
508 | verbose(VERB_ALGO, "tube created"); | |
509 | return tube; | |
510 | } | |
511 | ||
512 | void tube_delete(struct tube* tube) | |
513 | { | |
514 | if(!tube) return; | |
515 | tube_remove_bg_listen(tube); | |
516 | tube_remove_bg_write(tube); | |
517 | tube_close_read(tube); | |
518 | tube_close_write(tube); | |
519 | if(!WSACloseEvent(tube->event)) | |
520 | log_err("WSACloseEvent: %s", wsa_strerror(WSAGetLastError())); | |
521 | lock_basic_destroy(&tube->res_lock); | |
522 | verbose(VERB_ALGO, "tube deleted"); | |
523 | free(tube); | |
524 | } | |
525 | ||
526 | void tube_close_read(struct tube* ATTR_UNUSED(tube)) | |
527 | { | |
528 | verbose(VERB_ALGO, "tube close_read"); | |
529 | } | |
530 | ||
531 | void tube_close_write(struct tube* ATTR_UNUSED(tube)) | |
532 | { | |
533 | verbose(VERB_ALGO, "tube close_write"); | |
534 | /* wake up waiting reader with an empty queue */ | |
535 | if(!WSASetEvent(tube->event)) { | |
536 | log_err("WSASetEvent: %s", wsa_strerror(WSAGetLastError())); | |
537 | } | |
538 | } | |
539 | ||
540 | void tube_remove_bg_listen(struct tube* tube) | |
541 | { | |
542 | verbose(VERB_ALGO, "tube remove_bg_listen"); | |
543 | winsock_unregister_wsaevent(&tube->ev_listen); | |
544 | } | |
545 | ||
546 | void tube_remove_bg_write(struct tube* tube) | |
547 | { | |
548 | verbose(VERB_ALGO, "tube remove_bg_write"); | |
549 | if(tube->res_list) { | |
550 | struct tube_res_list* np, *p = tube->res_list; | |
551 | tube->res_list = NULL; | |
552 | tube->res_last = NULL; | |
553 | while(p) { | |
554 | np = p->next; | |
555 | free(p->buf); | |
556 | free(p); | |
557 | p = np; | |
558 | } | |
559 | } | |
560 | } | |
561 | ||
562 | int tube_write_msg(struct tube* tube, uint8_t* buf, uint32_t len, | |
563 | int ATTR_UNUSED(nonblock)) | |
564 | { | |
565 | uint8_t* a; | |
566 | verbose(VERB_ALGO, "tube write_msg len %d", (int)len); | |
567 | a = (uint8_t*)memdup(buf, len); | |
568 | if(!a) { | |
569 | log_err("out of memory in tube_write_msg"); | |
570 | return 0; | |
571 | } | |
572 | /* always nonblocking, this pipe cannot get full */ | |
573 | return tube_queue_item(tube, a, len); | |
574 | } | |
575 | ||
576 | int tube_read_msg(struct tube* tube, uint8_t** buf, uint32_t* len, | |
577 | int nonblock) | |
578 | { | |
579 | struct tube_res_list* item = NULL; | |
580 | verbose(VERB_ALGO, "tube read_msg %s", nonblock?"nonblock":"blocking"); | |
581 | *buf = NULL; | |
582 | if(!tube_poll(tube)) { | |
583 | verbose(VERB_ALGO, "tube read_msg nodata"); | |
584 | /* nothing ready right now, wait if we want to */ | |
585 | if(nonblock) | |
586 | return -1; /* would block waiting for items */ | |
587 | if(!tube_wait(tube)) | |
588 | return 0; | |
589 | } | |
590 | lock_basic_lock(&tube->res_lock); | |
591 | if(tube->res_list) { | |
592 | item = tube->res_list; | |
593 | tube->res_list = item->next; | |
594 | if(tube->res_last == item) { | |
595 | /* the list is now empty */ | |
596 | tube->res_last = NULL; | |
597 | verbose(VERB_ALGO, "tube read_msg lastdata"); | |
598 | if(!WSAResetEvent(tube->event)) { | |
599 | log_err("WSAResetEvent: %s", | |
600 | wsa_strerror(WSAGetLastError())); | |
601 | } | |
602 | } | |
603 | } | |
604 | lock_basic_unlock(&tube->res_lock); | |
605 | if(!item) | |
606 | return 0; /* would block waiting for items */ | |
607 | *buf = item->buf; | |
608 | *len = item->len; | |
609 | free(item); | |
610 | verbose(VERB_ALGO, "tube read_msg len %d", (int)*len); | |
611 | return 1; | |
612 | } | |
613 | ||
614 | int tube_poll(struct tube* tube) | |
615 | { | |
616 | struct tube_res_list* item = NULL; | |
617 | lock_basic_lock(&tube->res_lock); | |
618 | item = tube->res_list; | |
619 | lock_basic_unlock(&tube->res_lock); | |
620 | if(item) | |
621 | return 1; | |
622 | return 0; | |
623 | } | |
624 | ||
625 | int tube_wait(struct tube* tube) | |
626 | { | |
627 | /* block on eventhandle */ | |
628 | DWORD res = WSAWaitForMultipleEvents( | |
629 | 1 /* one event in array */, | |
630 | &tube->event /* the event to wait for, our pipe signal */, | |
631 | 0 /* wait for all events is false */, | |
632 | WSA_INFINITE /* wait, no timeout */, | |
633 | 0 /* we are not alertable for IO completion routines */ | |
634 | ); | |
635 | if(res == WSA_WAIT_TIMEOUT) { | |
636 | return 0; | |
637 | } | |
638 | if(res == WSA_WAIT_IO_COMPLETION) { | |
639 | /* a bit unexpected, since we were not alertable */ | |
640 | return 0; | |
641 | } | |
642 | return 1; | |
643 | } | |
644 | ||
645 | int tube_read_fd(struct tube* ATTR_UNUSED(tube)) | |
646 | { | |
647 | /* nothing sensible on Windows */ | |
648 | return -1; | |
649 | } | |
650 | ||
651 | int | |
652 | tube_handle_listen(struct comm_point* ATTR_UNUSED(c), void* ATTR_UNUSED(arg), | |
653 | int ATTR_UNUSED(error), struct comm_reply* ATTR_UNUSED(reply_info)) | |
654 | { | |
655 | log_assert(0); | |
656 | return 0; | |
657 | } | |
658 | ||
659 | int | |
660 | tube_handle_write(struct comm_point* ATTR_UNUSED(c), void* ATTR_UNUSED(arg), | |
661 | int ATTR_UNUSED(error), struct comm_reply* ATTR_UNUSED(reply_info)) | |
662 | { | |
663 | log_assert(0); | |
664 | return 0; | |
665 | } | |
666 | ||
667 | int tube_setup_bg_listen(struct tube* tube, struct comm_base* base, | |
668 | tube_callback_t* cb, void* arg) | |
669 | { | |
670 | tube->listen_cb = cb; | |
671 | tube->listen_arg = arg; | |
672 | if(!comm_base_internal(base)) | |
673 | return 1; /* ignore when no comm base - testing */ | |
674 | return winsock_register_wsaevent(comm_base_internal(base), | |
675 | &tube->ev_listen, tube->event, &tube_handle_signal, tube); | |
676 | } | |
677 | ||
678 | int tube_setup_bg_write(struct tube* ATTR_UNUSED(tube), | |
679 | struct comm_base* ATTR_UNUSED(base)) | |
680 | { | |
681 | /* the queue item routine performs the signaling */ | |
682 | return 1; | |
683 | } | |
684 | ||
685 | int tube_queue_item(struct tube* tube, uint8_t* msg, size_t len) | |
686 | { | |
687 | struct tube_res_list* item = | |
688 | (struct tube_res_list*)malloc(sizeof(*item)); | |
689 | verbose(VERB_ALGO, "tube queue_item len %d", (int)len); | |
690 | if(!item) { | |
691 | free(msg); | |
692 | log_err("out of memory for async answer"); | |
693 | return 0; | |
694 | } | |
695 | item->buf = msg; | |
696 | item->len = len; | |
697 | item->next = NULL; | |
698 | lock_basic_lock(&tube->res_lock); | |
699 | /* add at back of list, since the first one may be partially written */ | |
700 | if(tube->res_last) | |
701 | tube->res_last->next = item; | |
702 | else tube->res_list = item; | |
703 | tube->res_last = item; | |
704 | /* signal the eventhandle */ | |
705 | if(!WSASetEvent(tube->event)) { | |
706 | log_err("WSASetEvent: %s", wsa_strerror(WSAGetLastError())); | |
707 | } | |
708 | lock_basic_unlock(&tube->res_lock); | |
709 | return 1; | |
710 | } | |
711 | ||
712 | void tube_handle_signal(int ATTR_UNUSED(fd), short ATTR_UNUSED(events), | |
713 | void* arg) | |
714 | { | |
715 | struct tube* tube = (struct tube*)arg; | |
716 | uint8_t* buf; | |
717 | uint32_t len = 0; | |
718 | verbose(VERB_ALGO, "tube handle_signal"); | |
719 | while(tube_poll(tube)) { | |
720 | if(tube_read_msg(tube, &buf, &len, 1)) { | |
721 | fptr_ok(fptr_whitelist_tube_listen(tube->listen_cb)); | |
722 | (*tube->listen_cb)(tube, buf, len, NETEVENT_NOERROR, | |
723 | tube->listen_arg); | |
724 | } | |
725 | } | |
726 | } | |
727 | ||
728 | #endif /* USE_WINSOCK */ |