Annotation of src/usr.bin/ssh/atomicio.c, Revision 1.27
1.27 ! deraadt 1: /* $OpenBSD: atomicio.c,v 1.26 2010/09/22 22:58:51 djm Exp $ */
1.1 deraadt 2: /*
1.18 djm 3: * Copyright (c) 2006 Damien Miller. All rights reserved.
1.13 avsm 4: * Copyright (c) 2005 Anil Madhavapeddy. All rights reserved.
1.9 deraadt 5: * Copyright (c) 1995,1999 Theo de Raadt. All rights reserved.
1.1 deraadt 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:
1.23 deraadt 29: #include <sys/uio.h>
1.20 stevesk 30:
31: #include <errno.h>
1.25 dtucker 32: #include <poll.h>
1.21 stevesk 33: #include <string.h>
1.24 djm 34: #include <unistd.h>
1.27 ! deraadt 35: #include <limits.h>
1.1 deraadt 36:
1.8 markus 37: #include "atomicio.h"
1.1 deraadt 38:
39: /*
1.12 avsm 40: * ensure all of data on socket comes through. f==read || f==vwrite
1.1 deraadt 41: */
1.13 avsm 42: size_t
1.26 djm 43: atomicio6(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n,
44: int (*cb)(void *, size_t), void *cb_arg)
1.1 deraadt 45: {
1.3 markus 46: char *s = _s;
1.13 avsm 47: size_t pos = 0;
48: ssize_t res;
1.24 djm 49: struct pollfd pfd;
1.1 deraadt 50:
1.24 djm 51: pfd.fd = fd;
52: pfd.events = f == read ? POLLIN : POLLOUT;
1.1 deraadt 53: while (n > pos) {
54: res = (f) (fd, s + pos, n - pos);
55: switch (res) {
56: case -1:
1.24 djm 57: if (errno == EINTR)
1.1 deraadt 58: continue;
1.24 djm 59: if (errno == EAGAIN) {
60: (void)poll(&pfd, 1, -1);
61: continue;
62: }
1.13 avsm 63: return 0;
1.1 deraadt 64: case 0:
1.13 avsm 65: errno = EPIPE;
66: return pos;
1.1 deraadt 67: default:
1.14 otto 68: pos += (size_t)res;
1.26 djm 69: if (cb != NULL && cb(cb_arg, (size_t)res) == -1) {
70: errno = EINTR;
71: return pos;
72: }
1.1 deraadt 73: }
74: }
1.26 djm 75: return pos;
76: }
77:
78: size_t
79: atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
80: {
81: return atomicio6(f, fd, _s, n, NULL, NULL);
1.18 djm 82: }
83:
84: /*
85: * ensure all of data on socket comes through. f==readv || f==writev
86: */
87: size_t
1.26 djm 88: atomiciov6(ssize_t (*f) (int, const struct iovec *, int), int fd,
89: const struct iovec *_iov, int iovcnt,
90: int (*cb)(void *, size_t), void *cb_arg)
1.18 djm 91: {
92: size_t pos = 0, rem;
93: ssize_t res;
94: struct iovec iov_array[IOV_MAX], *iov = iov_array;
1.24 djm 95: struct pollfd pfd;
1.18 djm 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:
1.24 djm 104: pfd.fd = fd;
105: pfd.events = f == readv ? POLLIN : POLLOUT;
1.18 djm 106: for (; iovcnt > 0 && iov[0].iov_len > 0;) {
107: res = (f) (fd, iov, iovcnt);
108: switch (res) {
109: case -1:
1.24 djm 110: if (errno == EINTR)
111: continue;
112: if (errno == EAGAIN) {
113: (void)poll(&pfd, 1, -1);
1.18 djm 114: continue;
1.24 djm 115: }
1.18 djm 116: return 0;
117: case 0:
118: errno = EPIPE;
119: return pos;
120: default:
121: rem = (size_t)res;
122: pos += rem;
123: /* skip completed iov entries */
124: while (iovcnt > 0 && rem >= iov[0].iov_len) {
125: rem -= iov[0].iov_len;
126: iov++;
127: iovcnt--;
128: }
129: /* This shouldn't happen... */
1.19 djm 130: if (rem > 0 && (iovcnt <= 0 || rem > iov[0].iov_len)) {
1.18 djm 131: errno = EFAULT;
132: return 0;
133: }
134: if (iovcnt == 0)
135: break;
136: /* update pointer in partially complete iov */
137: iov[0].iov_base = ((char *)iov[0].iov_base) + rem;
138: iov[0].iov_len -= rem;
139: }
1.26 djm 140: if (cb != NULL && cb(cb_arg, (size_t)res) == -1) {
141: errno = EINTR;
142: return pos;
143: }
1.18 djm 144: }
145: return pos;
1.26 djm 146: }
147:
148: size_t
149: atomiciov(ssize_t (*f) (int, const struct iovec *, int), int fd,
150: const struct iovec *_iov, int iovcnt)
151: {
152: return atomiciov6(f, fd, _iov, iovcnt, NULL, NULL);
1.1 deraadt 153: }