]> git.proxmox.com Git - qemu.git/blame - iov.c
qemu_find_file: check name as a straight path even if it has no '/'
[qemu.git] / iov.c
CommitLineData
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 <aliguori@us.ibm.com>
9 * Amit Shah <amit.shah@redhat.com>
2278a69e 10 * Michael Tokarev <mjt@tls.msk.ru>
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
29size_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
48size_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 67size_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 86size_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() */
99static ssize_t
100do_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() */
117 unsigned i;
118 size_t count = 0;
119 for (i = 0; i < iov_cnt; ++i) {
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) {
133 return -1;
134 }
135 break;
136 }
137 }
138 return count;
139#endif
140}
141
142ssize_t iov_send_recv(int sockfd, struct iovec *iov, unsigned iov_cnt,
143 size_t offset, size_t bytes,
144 bool do_send)
145{
146 ssize_t ret;
147 unsigned si, ei; /* start and end indexes */
148
149 /* Find the start position, skipping `offset' bytes:
150 * first, skip all full-sized vector elements, */
151 for (si = 0; si < iov_cnt && offset >= iov[si].iov_len; ++si) {
152 offset -= iov[si].iov_len;
153 }
154 if (offset) {
155 assert(si < iov_cnt);
156 /* second, skip `offset' bytes from the (now) first element,
157 * undo it on exit */
158 iov[si].iov_base += offset;
159 iov[si].iov_len -= offset;
160 }
161 /* Find the end position skipping `bytes' bytes: */
162 /* first, skip all full-sized elements */
163 for (ei = si; ei < iov_cnt && iov[ei].iov_len <= bytes; ++ei) {
164 bytes -= iov[ei].iov_len;
165 }
166 if (bytes) {
167 /* second, fixup the last element, and remember
168 * the length we've cut from the end of it in `bytes' */
169 size_t tail;
170 assert(ei < iov_cnt);
171 assert(iov[ei].iov_len > bytes);
172 tail = iov[ei].iov_len - bytes;
173 iov[ei].iov_len = bytes;
174 bytes = tail; /* bytes is now equal to the tail size */
175 ++ei;
176 }
177
178 ret = do_send_recv(sockfd, iov + si, ei - si, do_send);
179
180 /* Undo the changes above */
181 if (offset) {
182 iov[si].iov_base -= offset;
183 iov[si].iov_len += offset;
184 }
185 if (bytes) {
186 iov[ei-1].iov_len += bytes;
187 }
188
189 return ret;
190}
191
192
3a1dca94
GH
193void iov_hexdump(const struct iovec *iov, const unsigned int iov_cnt,
194 FILE *fp, const char *prefix, size_t limit)
195{
196 unsigned int i, v, b;
197 uint8_t *c;
198
199 c = iov[0].iov_base;
200 for (i = 0, v = 0, b = 0; b < limit; i++, b++) {
201 if (i == iov[v].iov_len) {
202 i = 0; v++;
203 if (v == iov_cnt) {
204 break;
205 }
206 c = iov[v].iov_base;
207 }
208 if ((b % 16) == 0) {
209 fprintf(fp, "%s: %04x:", prefix, b);
210 }
211 if ((b % 4) == 0) {
212 fprintf(fp, " ");
213 }
214 fprintf(fp, " %02x", c[i]);
215 if ((b % 16) == 15) {
216 fprintf(fp, "\n");
217 }
218 }
219 if ((b % 16) != 0) {
220 fprintf(fp, "\n");
221 }
222}