]>
Commit | Line | Data |
---|---|---|
e4d5639d AS |
1 | /* |
2 | * Helpers for getting linearized buffers from iov / filling buffers into iovs | |
3 | * | |
4 | * Copyright IBM, Corp. 2007, 2008 | |
5 | * Copyright (C) 2010 Red Hat, Inc. | |
6 | * | |
7 | * Author(s): | |
8 | * Anthony Liguori <[email protected]> | |
9 | * Amit Shah <[email protected]> | |
2278a69e | 10 | * Michael Tokarev <[email protected]> |
e4d5639d AS |
11 | * |
12 | * This work is licensed under the terms of the GNU GPL, version 2. See | |
13 | * the COPYING file in the top-level directory. | |
6b620ca3 PB |
14 | * |
15 | * Contributions after 2012-01-13 are licensed under the terms of the | |
16 | * GNU GPL, version 2 or (at your option) any later version. | |
e4d5639d AS |
17 | */ |
18 | ||
19 | #include "iov.h" | |
20 | ||
25e5e4c7 MT |
21 | #ifdef _WIN32 |
22 | # include <windows.h> | |
23 | # include <winsock2.h> | |
24 | #else | |
25 | # include <sys/types.h> | |
26 | # include <sys/socket.h> | |
27 | #endif | |
28 | ||
2278a69e MT |
29 | size_t iov_from_buf(struct iovec *iov, unsigned int iov_cnt, |
30 | size_t offset, const void *buf, size_t bytes) | |
e4d5639d | 31 | { |
2278a69e | 32 | size_t done; |
e4d5639d | 33 | unsigned int i; |
2278a69e MT |
34 | for (i = 0, done = 0; (offset || done < bytes) && i < iov_cnt; i++) { |
35 | if (offset < iov[i].iov_len) { | |
36 | size_t len = MIN(iov[i].iov_len - offset, bytes - done); | |
37 | memcpy(iov[i].iov_base + offset, buf + done, len); | |
38 | done += len; | |
39 | offset = 0; | |
40 | } else { | |
41 | offset -= iov[i].iov_len; | |
348e7b8d | 42 | } |
e4d5639d | 43 | } |
2278a69e MT |
44 | assert(offset == 0); |
45 | return done; | |
e4d5639d | 46 | } |
fa6111f2 | 47 | |
2278a69e MT |
48 | size_t iov_to_buf(const struct iovec *iov, const unsigned int iov_cnt, |
49 | size_t offset, void *buf, size_t bytes) | |
fa6111f2 | 50 | { |
2278a69e | 51 | size_t done; |
fa6111f2 | 52 | unsigned int i; |
2278a69e MT |
53 | for (i = 0, done = 0; (offset || done < bytes) && i < iov_cnt; i++) { |
54 | if (offset < iov[i].iov_len) { | |
55 | size_t len = MIN(iov[i].iov_len - offset, bytes - done); | |
56 | memcpy(buf + done, iov[i].iov_base + offset, len); | |
57 | done += len; | |
58 | offset = 0; | |
59 | } else { | |
60 | offset -= iov[i].iov_len; | |
fa6111f2 | 61 | } |
8d15028e | 62 | } |
2278a69e MT |
63 | assert(offset == 0); |
64 | return done; | |
8d15028e GH |
65 | } |
66 | ||
dcf6f5e1 | 67 | size_t iov_memset(const struct iovec *iov, const unsigned int iov_cnt, |
2278a69e | 68 | size_t offset, int fillc, size_t bytes) |
8d15028e | 69 | { |
2278a69e | 70 | size_t done; |
8d15028e | 71 | unsigned int i; |
2278a69e MT |
72 | for (i = 0, done = 0; (offset || done < bytes) && i < iov_cnt; i++) { |
73 | if (offset < iov[i].iov_len) { | |
74 | size_t len = MIN(iov[i].iov_len - offset, bytes - done); | |
75 | memset(iov[i].iov_base + offset, fillc, len); | |
76 | done += len; | |
77 | offset = 0; | |
78 | } else { | |
79 | offset -= iov[i].iov_len; | |
8d15028e | 80 | } |
fa6111f2 | 81 | } |
2278a69e MT |
82 | assert(offset == 0); |
83 | return done; | |
fa6111f2 AS |
84 | } |
85 | ||
348e7b8d | 86 | size_t iov_size(const struct iovec *iov, const unsigned int iov_cnt) |
fa6111f2 AS |
87 | { |
88 | size_t len; | |
89 | unsigned int i; | |
90 | ||
91 | len = 0; | |
348e7b8d | 92 | for (i = 0; i < iov_cnt; i++) { |
fa6111f2 AS |
93 | len += iov[i].iov_len; |
94 | } | |
95 | return len; | |
96 | } | |
3a1dca94 | 97 | |
25e5e4c7 MT |
98 | /* helper function for iov_send_recv() */ |
99 | static ssize_t | |
100 | do_send_recv(int sockfd, struct iovec *iov, unsigned iov_cnt, bool do_send) | |
101 | { | |
102 | #if defined CONFIG_IOVEC && defined CONFIG_POSIX | |
103 | ssize_t ret; | |
104 | struct msghdr msg; | |
105 | memset(&msg, 0, sizeof(msg)); | |
106 | msg.msg_iov = iov; | |
107 | msg.msg_iovlen = iov_cnt; | |
108 | do { | |
109 | ret = do_send | |
110 | ? sendmsg(sockfd, &msg, 0) | |
111 | : recvmsg(sockfd, &msg, 0); | |
112 | } while (ret < 0 && errno == EINTR); | |
113 | return ret; | |
114 | #else | |
115 | /* else send piece-by-piece */ | |
116 | /*XXX Note: windows has WSASend() and WSARecv() */ | |
c0958559 SW |
117 | unsigned i = 0; |
118 | ssize_t ret = 0; | |
119 | while (i < iov_cnt) { | |
25e5e4c7 MT |
120 | ssize_t r = do_send |
121 | ? send(sockfd, iov[i].iov_base, iov[i].iov_len, 0) | |
122 | : recv(sockfd, iov[i].iov_base, iov[i].iov_len, 0); | |
123 | if (r > 0) { | |
124 | ret += r; | |
125 | } else if (!r) { | |
126 | break; | |
127 | } else if (errno == EINTR) { | |
128 | continue; | |
129 | } else { | |
130 | /* else it is some "other" error, | |
131 | * only return if there was no data processed. */ | |
132 | if (ret == 0) { | |
c0958559 | 133 | ret = -1; |
25e5e4c7 MT |
134 | } |
135 | break; | |
136 | } | |
c0958559 | 137 | i++; |
25e5e4c7 | 138 | } |
c0958559 | 139 | return ret; |
25e5e4c7 MT |
140 | #endif |
141 | } | |
142 | ||
143 | ssize_t iov_send_recv(int sockfd, struct iovec *iov, unsigned iov_cnt, | |
144 | size_t offset, size_t bytes, | |
145 | bool do_send) | |
146 | { | |
147 | ssize_t ret; | |
148 | unsigned si, ei; /* start and end indexes */ | |
bb955867 PM |
149 | if (bytes == 0) { |
150 | /* Catch the do-nothing case early, as otherwise we will pass an | |
151 | * empty iovec to sendmsg/recvmsg(), and not all implementations | |
152 | * accept this. | |
153 | */ | |
154 | return 0; | |
155 | } | |
25e5e4c7 MT |
156 | |
157 | /* Find the start position, skipping `offset' bytes: | |
158 | * first, skip all full-sized vector elements, */ | |
159 | for (si = 0; si < iov_cnt && offset >= iov[si].iov_len; ++si) { | |
160 | offset -= iov[si].iov_len; | |
161 | } | |
162 | if (offset) { | |
163 | assert(si < iov_cnt); | |
164 | /* second, skip `offset' bytes from the (now) first element, | |
165 | * undo it on exit */ | |
166 | iov[si].iov_base += offset; | |
167 | iov[si].iov_len -= offset; | |
168 | } | |
169 | /* Find the end position skipping `bytes' bytes: */ | |
170 | /* first, skip all full-sized elements */ | |
171 | for (ei = si; ei < iov_cnt && iov[ei].iov_len <= bytes; ++ei) { | |
172 | bytes -= iov[ei].iov_len; | |
173 | } | |
174 | if (bytes) { | |
175 | /* second, fixup the last element, and remember | |
176 | * the length we've cut from the end of it in `bytes' */ | |
177 | size_t tail; | |
178 | assert(ei < iov_cnt); | |
179 | assert(iov[ei].iov_len > bytes); | |
180 | tail = iov[ei].iov_len - bytes; | |
181 | iov[ei].iov_len = bytes; | |
182 | bytes = tail; /* bytes is now equal to the tail size */ | |
183 | ++ei; | |
184 | } | |
185 | ||
186 | ret = do_send_recv(sockfd, iov + si, ei - si, do_send); | |
187 | ||
188 | /* Undo the changes above */ | |
189 | if (offset) { | |
190 | iov[si].iov_base -= offset; | |
191 | iov[si].iov_len += offset; | |
192 | } | |
193 | if (bytes) { | |
194 | iov[ei-1].iov_len += bytes; | |
195 | } | |
196 | ||
197 | return ret; | |
198 | } | |
199 | ||
200 | ||
3a1dca94 GH |
201 | void iov_hexdump(const struct iovec *iov, const unsigned int iov_cnt, |
202 | FILE *fp, const char *prefix, size_t limit) | |
203 | { | |
204 | unsigned int i, v, b; | |
205 | uint8_t *c; | |
206 | ||
207 | c = iov[0].iov_base; | |
208 | for (i = 0, v = 0, b = 0; b < limit; i++, b++) { | |
209 | if (i == iov[v].iov_len) { | |
210 | i = 0; v++; | |
211 | if (v == iov_cnt) { | |
212 | break; | |
213 | } | |
214 | c = iov[v].iov_base; | |
215 | } | |
216 | if ((b % 16) == 0) { | |
217 | fprintf(fp, "%s: %04x:", prefix, b); | |
218 | } | |
219 | if ((b % 4) == 0) { | |
220 | fprintf(fp, " "); | |
221 | } | |
222 | fprintf(fp, " %02x", c[i]); | |
223 | if ((b % 16) == 15) { | |
224 | fprintf(fp, "\n"); | |
225 | } | |
226 | } | |
227 | if ((b % 16) != 0) { | |
228 | fprintf(fp, "\n"); | |
229 | } | |
230 | } |