fvwrite.c revision 1.7 1 1.7 christos /* $NetBSD: fvwrite.c,v 1.7 1997/07/13 20:15:08 christos Exp $ */
2 1.4 jtc
3 1.1 cgd /*-
4 1.4 jtc * Copyright (c) 1990, 1993
5 1.4 jtc * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Chris Torek.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd */
38 1.1 cgd
39 1.7 christos #include <sys/cdefs.h>
40 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
41 1.4 jtc #if 0
42 1.4 jtc static char sccsid[] = "@(#)fvwrite.c 8.1 (Berkeley) 6/4/93";
43 1.7 christos #else
44 1.7 christos __RCSID("$NetBSD: fvwrite.c,v 1.7 1997/07/13 20:15:08 christos Exp $");
45 1.4 jtc #endif
46 1.1 cgd #endif /* LIBC_SCCS and not lint */
47 1.1 cgd
48 1.6 kleink #include <errno.h>
49 1.1 cgd #include <stdio.h>
50 1.1 cgd #include <string.h>
51 1.1 cgd #include "local.h"
52 1.1 cgd #include "fvwrite.h"
53 1.1 cgd
54 1.1 cgd /*
55 1.1 cgd * Write some memory regions. Return zero on success, EOF on error.
56 1.1 cgd *
57 1.1 cgd * This routine is large and unsightly, but most of the ugliness due
58 1.1 cgd * to the three different kinds of output buffering is handled here.
59 1.1 cgd */
60 1.5 jtc int
61 1.1 cgd __sfvwrite(fp, uio)
62 1.1 cgd register FILE *fp;
63 1.1 cgd register struct __suio *uio;
64 1.1 cgd {
65 1.1 cgd register size_t len;
66 1.1 cgd register char *p;
67 1.1 cgd register struct __siov *iov;
68 1.1 cgd register int w, s;
69 1.1 cgd char *nl;
70 1.1 cgd int nlknown, nldist;
71 1.1 cgd
72 1.1 cgd if ((len = uio->uio_resid) == 0)
73 1.1 cgd return (0);
74 1.1 cgd /* make sure we can write */
75 1.6 kleink if (cantwrite(fp)) {
76 1.6 kleink errno = EBADF;
77 1.1 cgd return (EOF);
78 1.6 kleink }
79 1.1 cgd
80 1.1 cgd #define MIN(a, b) ((a) < (b) ? (a) : (b))
81 1.4 jtc #define COPY(n) (void)memcpy((void *)fp->_p, (void *)p, (size_t)(n))
82 1.1 cgd
83 1.1 cgd iov = uio->uio_iov;
84 1.1 cgd p = iov->iov_base;
85 1.1 cgd len = iov->iov_len;
86 1.1 cgd iov++;
87 1.1 cgd #define GETIOV(extra_work) \
88 1.1 cgd while (len == 0) { \
89 1.1 cgd extra_work; \
90 1.1 cgd p = iov->iov_base; \
91 1.1 cgd len = iov->iov_len; \
92 1.1 cgd iov++; \
93 1.1 cgd }
94 1.1 cgd if (fp->_flags & __SNBF) {
95 1.1 cgd /*
96 1.1 cgd * Unbuffered: write up to BUFSIZ bytes at a time.
97 1.1 cgd */
98 1.1 cgd do {
99 1.1 cgd GETIOV(;);
100 1.1 cgd w = (*fp->_write)(fp->_cookie, p, MIN(len, BUFSIZ));
101 1.1 cgd if (w <= 0)
102 1.1 cgd goto err;
103 1.1 cgd p += w;
104 1.1 cgd len -= w;
105 1.1 cgd } while ((uio->uio_resid -= w) != 0);
106 1.1 cgd } else if ((fp->_flags & __SLBF) == 0) {
107 1.1 cgd /*
108 1.1 cgd * Fully buffered: fill partially full buffer, if any,
109 1.1 cgd * and then flush. If there is no partial buffer, write
110 1.1 cgd * one _bf._size byte chunk directly (without copying).
111 1.1 cgd *
112 1.1 cgd * String output is a special case: write as many bytes
113 1.1 cgd * as fit, but pretend we wrote everything. This makes
114 1.1 cgd * snprintf() return the number of bytes needed, rather
115 1.1 cgd * than the number used, and avoids its write function
116 1.1 cgd * (so that the write function can be invalid).
117 1.1 cgd */
118 1.1 cgd do {
119 1.1 cgd GETIOV(;);
120 1.1 cgd w = fp->_w;
121 1.1 cgd if (fp->_flags & __SSTR) {
122 1.1 cgd if (len < w)
123 1.1 cgd w = len;
124 1.1 cgd COPY(w); /* copy MIN(fp->_w,len), */
125 1.1 cgd fp->_w -= w;
126 1.1 cgd fp->_p += w;
127 1.1 cgd w = len; /* but pretend copied all */
128 1.1 cgd } else if (fp->_p > fp->_bf._base && len > w) {
129 1.1 cgd /* fill and flush */
130 1.1 cgd COPY(w);
131 1.1 cgd /* fp->_w -= w; */ /* unneeded */
132 1.1 cgd fp->_p += w;
133 1.1 cgd if (fflush(fp))
134 1.1 cgd goto err;
135 1.1 cgd } else if (len >= (w = fp->_bf._size)) {
136 1.1 cgd /* write directly */
137 1.1 cgd w = (*fp->_write)(fp->_cookie, p, w);
138 1.1 cgd if (w <= 0)
139 1.1 cgd goto err;
140 1.1 cgd } else {
141 1.1 cgd /* fill and done */
142 1.1 cgd w = len;
143 1.1 cgd COPY(w);
144 1.1 cgd fp->_w -= w;
145 1.1 cgd fp->_p += w;
146 1.1 cgd }
147 1.1 cgd p += w;
148 1.1 cgd len -= w;
149 1.1 cgd } while ((uio->uio_resid -= w) != 0);
150 1.1 cgd } else {
151 1.1 cgd /*
152 1.1 cgd * Line buffered: like fully buffered, but we
153 1.1 cgd * must check for newlines. Compute the distance
154 1.1 cgd * to the first newline (including the newline),
155 1.1 cgd * or `infinity' if there is none, then pretend
156 1.1 cgd * that the amount to write is MIN(len,nldist).
157 1.1 cgd */
158 1.1 cgd nlknown = 0;
159 1.1 cgd nldist = 0; /* XXX just to keep gcc happy */
160 1.1 cgd do {
161 1.1 cgd GETIOV(nlknown = 0);
162 1.1 cgd if (!nlknown) {
163 1.1 cgd nl = memchr((void *)p, '\n', len);
164 1.1 cgd nldist = nl ? nl + 1 - p : len + 1;
165 1.1 cgd nlknown = 1;
166 1.1 cgd }
167 1.1 cgd s = MIN(len, nldist);
168 1.1 cgd w = fp->_w + fp->_bf._size;
169 1.1 cgd if (fp->_p > fp->_bf._base && s > w) {
170 1.1 cgd COPY(w);
171 1.1 cgd /* fp->_w -= w; */
172 1.1 cgd fp->_p += w;
173 1.1 cgd if (fflush(fp))
174 1.1 cgd goto err;
175 1.1 cgd } else if (s >= (w = fp->_bf._size)) {
176 1.1 cgd w = (*fp->_write)(fp->_cookie, p, w);
177 1.1 cgd if (w <= 0)
178 1.1 cgd goto err;
179 1.1 cgd } else {
180 1.1 cgd w = s;
181 1.1 cgd COPY(w);
182 1.1 cgd fp->_w -= w;
183 1.1 cgd fp->_p += w;
184 1.1 cgd }
185 1.1 cgd if ((nldist -= w) == 0) {
186 1.1 cgd /* copied the newline: flush and forget */
187 1.1 cgd if (fflush(fp))
188 1.1 cgd goto err;
189 1.1 cgd nlknown = 0;
190 1.1 cgd }
191 1.1 cgd p += w;
192 1.1 cgd len -= w;
193 1.1 cgd } while ((uio->uio_resid -= w) != 0);
194 1.1 cgd }
195 1.1 cgd return (0);
196 1.1 cgd
197 1.1 cgd err:
198 1.1 cgd fp->_flags |= __SERR;
199 1.1 cgd return (EOF);
200 1.1 cgd }
201