1 /* $NetBSD: fvwrite.c,v 1.18 2009/02/11 23:48:17 lukem Exp $ */
4 * Copyright (c) 1990, 1993
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 #include <sys/cdefs.h>
36 #if defined(LIBC_SCCS) && !defined(lint)
38 static char sccsid
[] = "@(#)fvwrite.c 8.1 (Berkeley) 6/4/93";
40 __RCSID("$NetBSD: fvwrite.c,v 1.18 2009/02/11 23:48:17 lukem Exp $");
42 #endif /* LIBC_SCCS and not lint */
49 #include "reentrant.h"
54 * Write some memory regions. Return zero on success, EOF on error.
56 * This routine is large and unsightly, but most of the ugliness due
57 * to the three different kinds of output buffering is handled here.
71 _DIAGASSERT(fp
!= NULL
);
72 _DIAGASSERT(uio
!= NULL
);
74 if ((int)uio
->uio_resid
< 0) {
78 if ((len
= uio
->uio_resid
) == 0)
80 /* make sure we can write */
86 #define MIN(a, b) ((a) < (b) ? (a) : (b))
87 #define COPY(n) (void)memcpy(fp->_p, p, (size_t)(n))
93 #define GETIOV(extra_work) \
100 if (fp
->_flags
& __SNBF
) {
102 * Unbuffered: write up to BUFSIZ bytes at a time.
106 w
= (*fp
->_write
)(fp
->_cookie
, p
,
107 (int)MIN(len
, BUFSIZ
));
112 } while ((uio
->uio_resid
-= w
) != 0);
113 } else if ((fp
->_flags
& __SLBF
) == 0) {
115 * Fully buffered: fill partially full buffer, if any,
116 * and then flush. If there is no partial buffer, write
117 * one _bf._size byte chunk directly (without copying).
119 * String output is a special case: write as many bytes
120 * as fit, but pretend we wrote everything. This makes
121 * snprintf() return the number of bytes needed, rather
122 * than the number used, and avoids its write function
123 * (so that the write function can be invalid).
127 if ((fp
->_flags
& (__SALC
| __SSTR
)) ==
128 (__SALC
| __SSTR
) && fp
->_w
< len
) {
129 int blen
= fp
->_p
- fp
->_bf
._base
;
130 unsigned char *_base
;
133 /* Allocate space exponentially. */
134 _size
= fp
->_bf
._size
;
136 _size
= (_size
<< 1) + 1;
137 } while (_size
< blen
+ len
);
138 _base
= realloc(fp
->_bf
._base
,
139 (size_t)(_size
+ 1));
142 fp
->_w
+= _size
- fp
->_bf
._size
;
143 fp
->_bf
._base
= _base
;
144 fp
->_bf
._size
= _size
;
145 fp
->_p
= _base
+ blen
;
148 if (fp
->_flags
& __SSTR
) {
151 COPY(w
); /* copy MIN(fp->_w,len), */
154 w
= len
; /* but pretend copied all */
155 } else if (fp
->_p
> fp
->_bf
._base
&& len
> w
) {
158 /* fp->_w -= w; */ /* unneeded */
162 } else if (len
>= (w
= fp
->_bf
._size
)) {
164 w
= (*fp
->_write
)(fp
->_cookie
, p
, w
);
176 } while ((uio
->uio_resid
-= w
) != 0);
179 * Line buffered: like fully buffered, but we
180 * must check for newlines. Compute the distance
181 * to the first newline (including the newline),
182 * or `infinity' if there is none, then pretend
183 * that the amount to write is MIN(len,nldist).
186 nldist
= 0; /* XXX just to keep gcc happy */
190 nl
= memchr(p
, '\n', (size_t)len
);
191 nldist
= nl
? nl
+ 1 - p
: len
+ 1;
194 s
= MIN(len
, nldist
);
195 w
= fp
->_w
+ fp
->_bf
._size
;
196 if (fp
->_p
> fp
->_bf
._base
&& s
> w
) {
202 } else if (s
>= (w
= fp
->_bf
._size
)) {
203 w
= (*fp
->_write
)(fp
->_cookie
, p
, w
);
212 if ((nldist
-= w
) == 0) {
213 /* copied the newline: flush and forget */
220 } while ((uio
->uio_resid
-= w
) != 0);
225 fp
->_flags
|= __SERR
;