[apple/libc.git] / stdio / FreeBSD / fvwrite.c

/*-
 * Copyright (c) 1990, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Chris Torek.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 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
 * SUCH DAMAGE.
 */

#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)fvwrite.c	8.1 (Berkeley) 6/4/93";
#endif /* LIBC_SCCS and not lint */
#include <sys/cdefs.h>
__FBSDID("$FreeBSD: src/lib/libc/stdio/fvwrite.c,v 1.17 2004/06/08 05:45:48 das Exp $");

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "local.h"
#include "fvwrite.h"

/*
 * 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.
 */
int
__sfvwrite(fp, uio)
	FILE *fp;
	struct __suio *uio;
{
	size_t len;
	char *p;
	struct __siov *iov;
	int w, s;
	char *nl;
	int nlknown, nldist;

	if ((len = uio->uio_resid) == 0)
		return (0);
	/* make sure we can write */
	if (prepwrite(fp) != 0)
		return (EOF);

#define	MIN(a, b) ((a) < (b) ? (a) : (b))
#define	COPY(n)	  (void)memcpy((void *)fp->_p, (void *)p, (size_t)(n))

	iov = uio->uio_iov;
	p = iov->iov_base;
	len = iov->iov_len;
	iov++;
#define GETIOV(extra_work) \
	while (len == 0) { \
		extra_work; \
		p = iov->iov_base; \
		len = iov->iov_len; \
		iov++; \
	}
	if (fp->_flags & __SNBF) {
		/*
		 * Unbuffered: write up to BUFSIZ bytes at a time.
		 */
		do {
			GETIOV(;);
			w = _swrite(fp, p, MIN(len, BUFSIZ));
			if (w <= 0)
				goto err;
			p += w;
			len -= w;
		} 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).
		 */
		do {
			GETIOV(;);
			if ((fp->_flags & (__SALC | __SSTR)) ==
			    (__SALC | __SSTR) && fp->_w < len) {
				size_t blen = fp->_p - fp->_bf._base;

				/*
				 * Alloc an extra 128 bytes (+ 1 for NULL)
				 * so we don't call realloc(3) so often.
				 */
				fp->_w = len + 128;
				fp->_bf._size = blen + len + 128;
				fp->_bf._base =
				    reallocf(fp->_bf._base, fp->_bf._size + 1);
				if (fp->_bf._base == NULL)
					goto err;
				fp->_p = fp->_bf._base + blen;
			}
			w = fp->_w;
			if (fp->_flags & __SSTR) {
				if (len < w)
					w = len;
				if (w > 0) {
					COPY(w);        /* copy MIN(fp->_w,len), */
					fp->_w -= w;
					fp->_p += w;
				}
				w = len;	/* but pretend copied all */
			} else if (fp->_p > fp->_bf._base && len > w) {
				/* fill and flush */
				COPY(w);
				/* fp->_w -= w; */ /* unneeded */
				fp->_p += w;
				if (__fflush(fp))
					goto err;
			} else if (len >= (w = fp->_bf._size)) {
				/* write directly */
				w = _swrite(fp, p, w);
				if (w <= 0)
					goto err;
			} else {
				/* fill and done */
				w = len;
				COPY(w);
				fp->_w -= w;
				fp->_p += w;
			}
			p += w;
			len -= w;
		} while ((uio->uio_resid -= w) != 0);
	} else {
		/*
		 * 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).
		 */
		nlknown = 0;
		nldist = 0;	/* XXX just to keep gcc happy */
		do {
			GETIOV(nlknown = 0);
			if (!nlknown) {
				nl = memchr((void *)p, '\n', len);
				nldist = nl ? nl + 1 - p : len + 1;
				nlknown = 1;
			}
			s = MIN(len, nldist);
			w = fp->_w + fp->_bf._size;
			if (fp->_p > fp->_bf._base && s > w) {
				COPY(w);
				/* fp->_w -= w; */
				fp->_p += w;
				if (__fflush(fp))
					goto err;
			} else if (s >= (w = fp->_bf._size)) {
				w = _swrite(fp, p, w);
				if (w <= 0)
				 	goto err;
			} else {
				w = s;
				COPY(w);
				fp->_w -= w;
				fp->_p += w;
			}
			if ((nldist -= w) == 0) {
				/* copied the newline: flush and forget */
				if (__fflush(fp))
					goto err;
				nlknown = 0;
			}
			p += w;
			len -= w;
		} while ((uio->uio_resid -= w) != 0);
	}
	return (0);

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