blob: 575bf8900ee39e9e3cb89061934b659bd87b52d6 [file] [log] [blame]
Darren Tuckerdc4a7792007-06-25 22:08:10 +10001/* $OpenBSD: atomicio.c,v 1.25 2007/06/25 12:02:27 dtucker Exp $ */
Damien Miller05ec5c61999-12-07 17:03:33 +11002/*
Damien Miller6aa139c2006-04-23 12:06:20 +10003 * Copyright (c) 2006 Damien Miller. All rights reserved.
Damien Millerb253cc42005-05-26 12:23:44 +10004 * Copyright (c) 2005 Anil Madhavapeddy. All rights reserved.
Ben Lindstrom92a2e382001-03-05 06:59:27 +00005 * Copyright (c) 1995,1999 Theo de Raadt. All rights reserved.
Damien Miller05ec5c61999-12-07 17:03:33 +11006 * 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"
Damien Miller05ec5c61999-12-07 17:03:33 +110030
Damien Miller8dbffe72006-08-05 11:02:17 +100031#include <sys/param.h>
Damien Millerd7834352006-08-05 12:39:39 +100032#include <sys/uio.h>
Damien Miller8dbffe72006-08-05 11:02:17 +100033
Darren Tucker39972492006-07-12 22:22:46 +100034#include <errno.h>
Darren Tuckerfebf0f52007-06-25 22:15:12 +100035#ifdef HAVE_POLL_H
Darren Tuckerdc4a7792007-06-25 22:08:10 +100036#include <poll.h>
Darren Tucker7c92a652007-09-27 07:00:09 +100037#else
38# ifdef HAVE_SYS_POLL_H
39# include <sys/poll.h>
40# endif
Darren Tuckerfebf0f52007-06-25 22:15:12 +100041#endif
Damien Millere3476ed2006-07-24 14:13:33 +100042#include <string.h>
Darren Tuckerab17f7d2007-06-25 19:04:12 +100043#include <unistd.h>
Darren Tucker39972492006-07-12 22:22:46 +100044
Ben Lindstrom226cfa02001-01-22 05:34:40 +000045#include "atomicio.h"
Damien Miller05ec5c61999-12-07 17:03:33 +110046
47/*
Darren Tucker85f04c62003-08-03 00:05:58 +100048 * ensure all of data on socket comes through. f==read || f==vwrite
Damien Miller05ec5c61999-12-07 17:03:33 +110049 */
Damien Millerb253cc42005-05-26 12:23:44 +100050size_t
Damien Miller3db78462006-04-23 12:05:16 +100051atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
Damien Miller05ec5c61999-12-07 17:03:33 +110052{
Damien Miller7684ee12000-03-17 23:40:15 +110053 char *s = _s;
Damien Millerb253cc42005-05-26 12:23:44 +100054 size_t pos = 0;
55 ssize_t res;
Darren Tuckerab17f7d2007-06-25 19:04:12 +100056 struct pollfd pfd;
Damien Miller05ec5c61999-12-07 17:03:33 +110057
Darren Tuckerab17f7d2007-06-25 19:04:12 +100058 pfd.fd = fd;
59 pfd.events = f == read ? POLLIN : POLLOUT;
Damien Miller05ec5c61999-12-07 17:03:33 +110060 while (n > pos) {
Damien Miller5f056372000-04-16 12:31:48 +100061 res = (f) (fd, s + pos, n - pos);
Damien Miller05ec5c61999-12-07 17:03:33 +110062 switch (res) {
63 case -1:
Darren Tuckerab17f7d2007-06-25 19:04:12 +100064 if (errno == EINTR)
Damien Miller05ec5c61999-12-07 17:03:33 +110065 continue;
Damien Millered626b42007-09-21 13:12:49 +100066#ifdef EWOULDBLOCK
67 if (errno == EAGAIN || errno == EWOULDBLOCK) {
68#else
Darren Tuckerab17f7d2007-06-25 19:04:12 +100069 if (errno == EAGAIN) {
Damien Millered626b42007-09-21 13:12:49 +100070#endif
Darren Tuckerab17f7d2007-06-25 19:04:12 +100071 (void)poll(&pfd, 1, -1);
72 continue;
73 }
Damien Millerb253cc42005-05-26 12:23:44 +100074 return 0;
Damien Miller05ec5c61999-12-07 17:03:33 +110075 case 0:
Damien Millerb253cc42005-05-26 12:23:44 +100076 errno = EPIPE;
77 return pos;
Damien Miller05ec5c61999-12-07 17:03:33 +110078 default:
Damien Miller3fd019e2006-03-15 11:29:51 +110079 pos += (size_t)res;
Damien Miller05ec5c61999-12-07 17:03:33 +110080 }
81 }
82 return (pos);
83}
Damien Miller6aa139c2006-04-23 12:06:20 +100084
85/*
86 * ensure all of data on socket comes through. f==readv || f==writev
87 */
88size_t
89atomiciov(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;
Darren Tuckerab17f7d2007-06-25 19:04:12 +100095 struct pollfd pfd;
Damien Miller6aa139c2006-04-23 12:06:20 +100096
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
Darren Tuckerab17f7d2007-06-25 19:04:12 +1000104 pfd.fd = fd;
105 pfd.events = f == readv ? POLLIN : POLLOUT;
Damien Miller6aa139c2006-04-23 12:06:20 +1000106 for (; iovcnt > 0 && iov[0].iov_len > 0;) {
107 res = (f) (fd, iov, iovcnt);
108 switch (res) {
109 case -1:
Darren Tuckerab17f7d2007-06-25 19:04:12 +1000110 if (errno == EINTR)
Damien Miller6aa139c2006-04-23 12:06:20 +1000111 continue;
Damien Millered626b42007-09-21 13:12:49 +1000112#ifdef EWOULDBLOCK
113 if (errno == EAGAIN || errno == EWOULDBLOCK) {
114#else
Darren Tuckerab17f7d2007-06-25 19:04:12 +1000115 if (errno == EAGAIN) {
Damien Millered626b42007-09-21 13:12:49 +1000116#endif
Darren Tuckerab17f7d2007-06-25 19:04:12 +1000117 (void)poll(&pfd, 1, -1);
118 continue;
119 }
Damien Miller6aa139c2006-04-23 12:06:20 +1000120 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... */
Damien Millerb5ea7e72006-04-23 12:06:49 +1000134 if (rem > 0 && (iovcnt <= 0 || rem > iov[0].iov_len)) {
Damien Miller6aa139c2006-04-23 12:06:20 +1000135 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}