]>
Commit | Line | Data |
---|---|---|
fa7499cc | 1 | /* $OpenBSD: atomicio.c,v 1.25 2007/06/25 12:02:27 dtucker Exp $ */ |
3c0ef626 | 2 | /* |
fa7499cc | 3 | * Copyright (c) 2006 Damien Miller. All rights reserved. |
4 | * Copyright (c) 2005 Anil Madhavapeddy. All rights reserved. | |
3c0ef626 | 5 | * Copyright (c) 1995,1999 Theo de Raadt. All rights reserved. |
6 | * All rights reserved. | |
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 | * 1. Redistributions of source code must retain the above copyright | |
12 | * notice, this list of conditions and the following disclaimer. | |
13 | * 2. Redistributions in binary form must reproduce the above copyright | |
14 | * notice, this list of conditions and the following disclaimer in the | |
15 | * documentation and/or other materials provided with the distribution. | |
16 | * | |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR | |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES | |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. | |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, | |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
27 | */ | |
28 | ||
29 | #include "includes.h" | |
fa7499cc | 30 | |
31 | #include <sys/param.h> | |
32 | #include <sys/uio.h> | |
33 | ||
34 | #include <errno.h> | |
35 | #ifdef HAVE_POLL_H | |
36 | #include <poll.h> | |
e74dc197 | 37 | #else |
38 | # ifdef HAVE_SYS_POLL_H | |
39 | # include <sys/poll.h> | |
40 | # endif | |
fa7499cc | 41 | #endif |
42 | #include <string.h> | |
43 | #include <unistd.h> | |
3c0ef626 | 44 | |
45 | #include "atomicio.h" | |
46 | ||
47 | /* | |
fa7499cc | 48 | * ensure all of data on socket comes through. f==read || f==vwrite |
3c0ef626 | 49 | */ |
fa7499cc | 50 | size_t |
51 | atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n) | |
3c0ef626 | 52 | { |
53 | char *s = _s; | |
fa7499cc | 54 | size_t pos = 0; |
55 | ssize_t res; | |
56 | struct pollfd pfd; | |
3c0ef626 | 57 | |
fa7499cc | 58 | pfd.fd = fd; |
59 | pfd.events = f == read ? POLLIN : POLLOUT; | |
3c0ef626 | 60 | while (n > pos) { |
61 | res = (f) (fd, s + pos, n - pos); | |
62 | switch (res) { | |
63 | case -1: | |
fa7499cc | 64 | if (errno == EINTR) |
65 | continue; | |
3c0ef626 | 66 | #ifdef EWOULDBLOCK |
fa7499cc | 67 | if (errno == EAGAIN || errno == EWOULDBLOCK) { |
3c0ef626 | 68 | #else |
fa7499cc | 69 | if (errno == EAGAIN) { |
3c0ef626 | 70 | #endif |
fa7499cc | 71 | (void)poll(&pfd, 1, -1); |
3c0ef626 | 72 | continue; |
fa7499cc | 73 | } |
74 | return 0; | |
3c0ef626 | 75 | case 0: |
fa7499cc | 76 | errno = EPIPE; |
77 | return pos; | |
3c0ef626 | 78 | default: |
fa7499cc | 79 | pos += (size_t)res; |
3c0ef626 | 80 | } |
81 | } | |
82 | return (pos); | |
83 | } | |
fa7499cc | 84 | |
85 | /* | |
86 | * ensure all of data on socket comes through. f==readv || f==writev | |
87 | */ | |
88 | size_t | |
89 | atomiciov(ssize_t (*f) (int, const struct iovec *, int), int fd, | |
90 | const struct iovec *_iov, int iovcnt) | |
91 | { | |
92 | size_t pos = 0, rem; | |
93 | ssize_t res; | |
94 | struct iovec iov_array[IOV_MAX], *iov = iov_array; | |
95 | struct pollfd pfd; | |
96 | ||
97 | if (iovcnt > IOV_MAX) { | |
98 | errno = EINVAL; | |
99 | return 0; | |
100 | } | |
101 | /* Make a copy of the iov array because we may modify it below */ | |
102 | memcpy(iov, _iov, iovcnt * sizeof(*_iov)); | |
103 | ||
104 | pfd.fd = fd; | |
105 | pfd.events = f == readv ? POLLIN : POLLOUT; | |
106 | for (; iovcnt > 0 && iov[0].iov_len > 0;) { | |
107 | res = (f) (fd, iov, iovcnt); | |
108 | switch (res) { | |
109 | case -1: | |
110 | if (errno == EINTR) | |
111 | continue; | |
112 | #ifdef EWOULDBLOCK | |
113 | if (errno == EAGAIN || errno == EWOULDBLOCK) { | |
114 | #else | |
115 | if (errno == EAGAIN) { | |
116 | #endif | |
117 | (void)poll(&pfd, 1, -1); | |
118 | continue; | |
119 | } | |
120 | return 0; | |
121 | case 0: | |
122 | errno = EPIPE; | |
123 | return pos; | |
124 | default: | |
125 | rem = (size_t)res; | |
126 | pos += rem; | |
127 | /* skip completed iov entries */ | |
128 | while (iovcnt > 0 && rem >= iov[0].iov_len) { | |
129 | rem -= iov[0].iov_len; | |
130 | iov++; | |
131 | iovcnt--; | |
132 | } | |
133 | /* This shouldn't happen... */ | |
134 | if (rem > 0 && (iovcnt <= 0 || rem > iov[0].iov_len)) { | |
135 | errno = EFAULT; | |
136 | return 0; | |
137 | } | |
138 | if (iovcnt == 0) | |
139 | break; | |
140 | /* update pointer in partially complete iov */ | |
141 | iov[0].iov_base = ((char *)iov[0].iov_base) + rem; | |
142 | iov[0].iov_len -= rem; | |
143 | } | |
144 | } | |
145 | return pos; | |
146 | } |