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