blob: f651a292cbb6332f77be797087439a1e8f6f2b82 [file] [log] [blame]
Damien Millerd7834352006-08-05 12:39:39 +10001/* $OpenBSD: atomicio.c,v 1.23 2006/08/03 03:34:41 deraadt 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>
Damien Millere3476ed2006-07-24 14:13:33 +100035#include <string.h>
Darren Tucker39972492006-07-12 22:22:46 +100036
Ben Lindstrom226cfa02001-01-22 05:34:40 +000037#include "atomicio.h"
Damien Miller05ec5c61999-12-07 17:03:33 +110038
39/*
Darren Tucker85f04c62003-08-03 00:05:58 +100040 * ensure all of data on socket comes through. f==read || f==vwrite
Damien Miller05ec5c61999-12-07 17:03:33 +110041 */
Damien Millerb253cc42005-05-26 12:23:44 +100042size_t
Damien Miller3db78462006-04-23 12:05:16 +100043atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
Damien Miller05ec5c61999-12-07 17:03:33 +110044{
Damien Miller7684ee12000-03-17 23:40:15 +110045 char *s = _s;
Damien Millerb253cc42005-05-26 12:23:44 +100046 size_t pos = 0;
47 ssize_t res;
Damien Miller05ec5c61999-12-07 17:03:33 +110048
49 while (n > pos) {
Damien Miller5f056372000-04-16 12:31:48 +100050 res = (f) (fd, s + pos, n - pos);
Damien Miller05ec5c61999-12-07 17:03:33 +110051 switch (res) {
52 case -1:
Damien Millerf2fdbe52000-07-08 10:57:08 +100053#ifdef EWOULDBLOCK
54 if (errno == EINTR || errno == EAGAIN || errno == EWOULDBLOCK)
55#else
Damien Miller05ec5c61999-12-07 17:03:33 +110056 if (errno == EINTR || errno == EAGAIN)
Damien Millerf2fdbe52000-07-08 10:57:08 +100057#endif
Damien Miller05ec5c61999-12-07 17:03:33 +110058 continue;
Damien Millerb253cc42005-05-26 12:23:44 +100059 return 0;
Damien Miller05ec5c61999-12-07 17:03:33 +110060 case 0:
Damien Millerb253cc42005-05-26 12:23:44 +100061 errno = EPIPE;
62 return pos;
Damien Miller05ec5c61999-12-07 17:03:33 +110063 default:
Damien Miller3fd019e2006-03-15 11:29:51 +110064 pos += (size_t)res;
Damien Miller05ec5c61999-12-07 17:03:33 +110065 }
66 }
67 return (pos);
68}
Damien Miller6aa139c2006-04-23 12:06:20 +100069
70/*
71 * ensure all of data on socket comes through. f==readv || f==writev
72 */
73size_t
74atomiciov(ssize_t (*f) (int, const struct iovec *, int), int fd,
75 const struct iovec *_iov, int iovcnt)
76{
77 size_t pos = 0, rem;
78 ssize_t res;
79 struct iovec iov_array[IOV_MAX], *iov = iov_array;
80
81 if (iovcnt > IOV_MAX) {
82 errno = EINVAL;
83 return 0;
84 }
85 /* Make a copy of the iov array because we may modify it below */
86 memcpy(iov, _iov, iovcnt * sizeof(*_iov));
87
88 for (; iovcnt > 0 && iov[0].iov_len > 0;) {
89 res = (f) (fd, iov, iovcnt);
90 switch (res) {
91 case -1:
92 if (errno == EINTR || errno == EAGAIN)
93 continue;
94 return 0;
95 case 0:
96 errno = EPIPE;
97 return pos;
98 default:
99 rem = (size_t)res;
100 pos += rem;
101 /* skip completed iov entries */
102 while (iovcnt > 0 && rem >= iov[0].iov_len) {
103 rem -= iov[0].iov_len;
104 iov++;
105 iovcnt--;
106 }
107 /* This shouldn't happen... */
Damien Millerb5ea7e72006-04-23 12:06:49 +1000108 if (rem > 0 && (iovcnt <= 0 || rem > iov[0].iov_len)) {
Damien Miller6aa139c2006-04-23 12:06:20 +1000109 errno = EFAULT;
110 return 0;
111 }
112 if (iovcnt == 0)
113 break;
114 /* update pointer in partially complete iov */
115 iov[0].iov_base = ((char *)iov[0].iov_base) + rem;
116 iov[0].iov_len -= rem;
117 }
118 }
119 return pos;
120}