andersk Git - openssh.git/blame_incremental

... / ...

Commit	Line	Data
	1	/* $OpenBSD: atomicio.c,v 1.22 2006/07/26 02:35:17 stevesk Exp $ */
	2	/*
	3	* Copyright (c) 2006 Damien Miller. All rights reserved.
	4	* Copyright (c) 2005 Anil Madhavapeddy. All rights reserved.
	5	* Copyright (c) 1995,1999 Theo de Raadt. All rights reserved.
	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
	29	#include "includes.h"
	30
	31	#include <sys/param.h>
	32
	33	#include <errno.h>
	34	#include <string.h>
	35
	36	#include "atomicio.h"
	37
	38	/*
	39	* ensure all of data on socket comes through. f==read \|\| f==vwrite
	40	*/
	41	size_t
	42	atomicio(ssize_t (f) (int, void , size_t), int fd, void *_s, size_t n)
	43	{
	44	char *s = _s;
	45	size_t pos = 0;
	46	ssize_t res;
	47
	48	while (n > pos) {
	49	res = (f) (fd, s + pos, n - pos);
	50	switch (res) {
	51	case -1:
	52	#ifdef EWOULDBLOCK
	53	if (errno == EINTR \|\| errno == EAGAIN \|\| errno == EWOULDBLOCK)
	54	#else
	55	if (errno == EINTR \|\| errno == EAGAIN)
	56	#endif
	57	continue;
	58	return 0;
	59	case 0:
	60	errno = EPIPE;
	61	return pos;
	62	default:
	63	pos += (size_t)res;
	64	}
	65	}
	66	return (pos);
	67	}
	68
	69	/*
	70	* ensure all of data on socket comes through. f==readv \|\| f==writev
	71	*/
	72	size_t
	73	atomiciov(ssize_t (f) (int, const struct iovec , int), int fd,
	74	const struct iovec *_iov, int iovcnt)
	75	{
	76	size_t pos = 0, rem;
	77	ssize_t res;
	78	struct iovec iov_array[IOV_MAX], *iov = iov_array;
	79
	80	if (iovcnt > IOV_MAX) {
	81	errno = EINVAL;
	82	return 0;
	83	}
	84	/* Make a copy of the iov array because we may modify it below */
	85	memcpy(iov, _iov, iovcnt * sizeof(*_iov));
	86
	87	for (; iovcnt > 0 && iov[0].iov_len > 0;) {
	88	res = (f) (fd, iov, iovcnt);
	89	switch (res) {
	90	case -1:
	91	if (errno == EINTR \|\| errno == EAGAIN)
	92	continue;
	93	return 0;
	94	case 0:
	95	errno = EPIPE;
	96	return pos;
	97	default:
	98	rem = (size_t)res;
	99	pos += rem;
	100	/* skip completed iov entries */
	101	while (iovcnt > 0 && rem >= iov[0].iov_len) {
	102	rem -= iov[0].iov_len;
	103	iov++;
	104	iovcnt--;
	105	}
	106	/* This shouldn't happen... */
	107	if (rem > 0 && (iovcnt <= 0 \|\| rem > iov[0].iov_len)) {
	108	errno = EFAULT;
	109	return 0;
	110	}
	111	if (iovcnt == 0)
	112	break;
	113	/* update pointer in partially complete iov */
	114	iov[0].iov_base = ((char *)iov[0].iov_base) + rem;
	115	iov[0].iov_len -= rem;
	116	}
	117	}
	118	return pos;
	119	}