2008-07-23 09:23:42 +00:00
|
|
|
/* $OpenBSD: atomicio.c,v 1.25 2007/06/25 12:02:27 dtucker Exp $ */
|
2000-02-24 14:29:47 +00:00
|
|
|
/*
|
2006-09-30 13:29:51 +00:00
|
|
|
* Copyright (c) 2006 Damien Miller. All rights reserved.
|
2005-09-03 06:59:33 +00:00
|
|
|
* Copyright (c) 2005 Anil Madhavapeddy. All rights reserved.
|
2001-05-04 03:57:05 +00:00
|
|
|
* Copyright (c) 1995,1999 Theo de Raadt. All rights reserved.
|
2000-02-24 14:29:47 +00:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "includes.h"
|
2006-09-30 13:29:51 +00:00
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/uio.h>
|
|
|
|
|
|
|
|
#include <errno.h>
|
2008-07-23 09:23:42 +00:00
|
|
|
#ifdef HAVE_POLL_H
|
|
|
|
#include <poll.h>
|
2008-07-23 09:28:49 +00:00
|
|
|
#else
|
|
|
|
# ifdef HAVE_SYS_POLL_H
|
|
|
|
# include <sys/poll.h>
|
|
|
|
# endif
|
2008-07-23 09:23:42 +00:00
|
|
|
#endif
|
2006-09-30 13:29:51 +00:00
|
|
|
#include <string.h>
|
2008-07-23 09:23:42 +00:00
|
|
|
#include <unistd.h>
|
2000-02-24 14:29:47 +00:00
|
|
|
|
2001-05-04 03:57:05 +00:00
|
|
|
#include "atomicio.h"
|
2000-02-24 14:29:47 +00:00
|
|
|
|
|
|
|
/*
|
2004-01-07 11:10:17 +00:00
|
|
|
* ensure all of data on socket comes through. f==read || f==vwrite
|
2000-02-24 14:29:47 +00:00
|
|
|
*/
|
2005-09-03 06:59:33 +00:00
|
|
|
size_t
|
2006-09-30 13:29:51 +00:00
|
|
|
atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
2000-03-26 07:07:24 +00:00
|
|
|
char *s = _s;
|
2005-09-03 06:59:33 +00:00
|
|
|
size_t pos = 0;
|
|
|
|
ssize_t res;
|
2008-07-23 09:23:42 +00:00
|
|
|
struct pollfd pfd;
|
2000-02-24 14:29:47 +00:00
|
|
|
|
2008-07-23 09:23:42 +00:00
|
|
|
pfd.fd = fd;
|
|
|
|
pfd.events = f == read ? POLLIN : POLLOUT;
|
2000-02-24 14:29:47 +00:00
|
|
|
while (n > pos) {
|
|
|
|
res = (f) (fd, s + pos, n - pos);
|
|
|
|
switch (res) {
|
|
|
|
case -1:
|
2008-07-23 09:23:42 +00:00
|
|
|
if (errno == EINTR)
|
2000-02-24 14:29:47 +00:00
|
|
|
continue;
|
2008-07-23 09:28:49 +00:00
|
|
|
#ifdef EWOULDBLOCK
|
|
|
|
if (errno == EAGAIN || errno == EWOULDBLOCK) {
|
|
|
|
#else
|
2008-07-23 09:23:42 +00:00
|
|
|
if (errno == EAGAIN) {
|
2008-07-23 09:28:49 +00:00
|
|
|
#endif
|
2008-07-23 09:23:42 +00:00
|
|
|
(void)poll(&pfd, 1, -1);
|
|
|
|
continue;
|
|
|
|
}
|
2005-09-03 06:59:33 +00:00
|
|
|
return 0;
|
2000-02-24 14:29:47 +00:00
|
|
|
case 0:
|
2005-09-03 06:59:33 +00:00
|
|
|
errno = EPIPE;
|
|
|
|
return pos;
|
2000-02-24 14:29:47 +00:00
|
|
|
default:
|
2006-09-30 13:29:51 +00:00
|
|
|
pos += (size_t)res;
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return (pos);
|
|
|
|
}
|
2006-09-30 13:29:51 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* ensure all of data on socket comes through. f==readv || f==writev
|
|
|
|
*/
|
|
|
|
size_t
|
|
|
|
atomiciov(ssize_t (*f) (int, const struct iovec *, int), int fd,
|
|
|
|
const struct iovec *_iov, int iovcnt)
|
|
|
|
{
|
|
|
|
size_t pos = 0, rem;
|
|
|
|
ssize_t res;
|
|
|
|
struct iovec iov_array[IOV_MAX], *iov = iov_array;
|
2008-07-23 09:23:42 +00:00
|
|
|
struct pollfd pfd;
|
2006-09-30 13:29:51 +00:00
|
|
|
|
|
|
|
if (iovcnt > IOV_MAX) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
/* Make a copy of the iov array because we may modify it below */
|
|
|
|
memcpy(iov, _iov, iovcnt * sizeof(*_iov));
|
|
|
|
|
2008-07-23 09:23:42 +00:00
|
|
|
pfd.fd = fd;
|
|
|
|
pfd.events = f == readv ? POLLIN : POLLOUT;
|
2006-09-30 13:29:51 +00:00
|
|
|
for (; iovcnt > 0 && iov[0].iov_len > 0;) {
|
|
|
|
res = (f) (fd, iov, iovcnt);
|
|
|
|
switch (res) {
|
|
|
|
case -1:
|
2008-07-23 09:23:42 +00:00
|
|
|
if (errno == EINTR)
|
2006-09-30 13:29:51 +00:00
|
|
|
continue;
|
2008-07-23 09:28:49 +00:00
|
|
|
#ifdef EWOULDBLOCK
|
|
|
|
if (errno == EAGAIN || errno == EWOULDBLOCK) {
|
|
|
|
#else
|
2008-07-23 09:23:42 +00:00
|
|
|
if (errno == EAGAIN) {
|
2008-07-23 09:28:49 +00:00
|
|
|
#endif
|
2008-07-23 09:23:42 +00:00
|
|
|
(void)poll(&pfd, 1, -1);
|
|
|
|
continue;
|
|
|
|
}
|
2006-09-30 13:29:51 +00:00
|
|
|
return 0;
|
|
|
|
case 0:
|
|
|
|
errno = EPIPE;
|
|
|
|
return pos;
|
|
|
|
default:
|
|
|
|
rem = (size_t)res;
|
|
|
|
pos += rem;
|
|
|
|
/* skip completed iov entries */
|
|
|
|
while (iovcnt > 0 && rem >= iov[0].iov_len) {
|
|
|
|
rem -= iov[0].iov_len;
|
|
|
|
iov++;
|
|
|
|
iovcnt--;
|
|
|
|
}
|
|
|
|
/* This shouldn't happen... */
|
|
|
|
if (rem > 0 && (iovcnt <= 0 || rem > iov[0].iov_len)) {
|
|
|
|
errno = EFAULT;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (iovcnt == 0)
|
|
|
|
break;
|
|
|
|
/* update pointer in partially complete iov */
|
|
|
|
iov[0].iov_base = ((char *)iov[0].iov_base) + rem;
|
|
|
|
iov[0].iov_len -= rem;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return pos;
|
|
|
|
}
|