* Copyright (c) 1990 The Regents of the University of California.
* This code is derived from software contributed to Berkeley by
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 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.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``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 REGENTS OR CONTRIBUTORS 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
#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid
[] = "@(#)fvwrite.c 5.3 (Berkeley) 5/4/91";
#endif /* LIBC_SCCS and not lint */
* Write some memory regions. Return zero on success, EOF on error.
* This routine is large and unsightly, but most of the ugliness due
* to the three different kinds of output buffering is handled here.
register struct __suio
*uio
;
register struct __siov
*iov
;
if ((len
= uio
->uio_resid
) == 0)
/* make sure we can write */
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define COPY(n) (void) bcopy((void *)p, (void *)fp->_p, (size_t)(n));
#define GETIOV(extra_work) \
if (fp
->_flags
& __SNBF
) {
* Unbuffered: write up to BUFSIZ bytes at a time.
w
= (*fp
->_write
)(fp
->_cookie
, p
, MIN(len
, BUFSIZ
));
} while ((uio
->uio_resid
-= w
) != 0);
} else if ((fp
->_flags
& __SLBF
) == 0) {
* Fully buffered: fill partially full buffer, if any,
* and then flush. If there is no partial buffer, write
* one _bf._size byte chunk directly (without copying).
* String output is a special case: write as many bytes
* as fit, but pretend we wrote everything. This makes
* snprintf() return the number of bytes needed, rather
* than the number used, and avoids its write function
* (so that the write function can be invalid).
if (fp
->_flags
& __SSTR
) {
COPY(w
); /* copy MIN(fp->_w,len), */
w
= len
; /* but pretend copied all */
} else if (fp
->_p
> fp
->_bf
._base
&& len
> w
) {
/* fp->_w -= w; */ /* unneeded */
} else if (len
>= (w
= fp
->_bf
._size
)) {
w
= (*fp
->_write
)(fp
->_cookie
, p
, w
);
} while ((uio
->uio_resid
-= w
) != 0);
* Line buffered: like fully buffered, but we
* must check for newlines. Compute the distance
* to the first newline (including the newline),
* or `infinity' if there is none, then pretend
* that the amount to write is MIN(len,nldist).
nldist
= 0; /* XXX just to keep gcc happy */
nl
= memchr((void *)p
, '\n', len
);
nldist
= nl
? nl
+ 1 - p
: len
+ 1;
w
= fp
->_w
+ fp
->_bf
._size
;
if (fp
->_p
> fp
->_bf
._base
&& s
> w
) {
} else if (s
>= (w
= fp
->_bf
._size
)) {
w
= (*fp
->_write
)(fp
->_cookie
, p
, w
);
if ((nldist
-= w
) == 0) {
/* copied the newline: flush and forget */
} while ((uio
->uio_resid
-= w
) != 0);