1 1.31 christos /* $NetBSD: fvwrite.c,v 1.31 2024/03/29 22:39:41 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.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.31 christos __RCSID("$NetBSD: fvwrite.c,v 1.31 2024/03/29 22:39:41 christos 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.23 christos #include <stddef.h> 46 1.6 kleink #include <errno.h> 47 1.1 cgd #include <stdio.h> 48 1.9 perry #include <stdlib.h> 49 1.1 cgd #include <string.h> 50 1.14 thorpej #include "reentrant.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.24 christos __sfvwrite(FILE *fp, struct __suio *uio) 62 1.1 cgd { 63 1.23 christos size_t len; 64 1.8 perry char *p; 65 1.8 perry struct __siov *iov; 66 1.25 christos int s; 67 1.25 christos ssize_t w; 68 1.1 cgd char *nl; 69 1.23 christos size_t 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.25 christos if ((ssize_t)uio->uio_resid < 0) { 75 1.18 lukem errno = EINVAL; 76 1.24 christos return EOF; 77 1.18 lukem } 78 1.22 dholland if (uio->uio_resid == 0) 79 1.24 christos return 0; 80 1.1 cgd /* make sure we can write */ 81 1.6 kleink if (cantwrite(fp)) { 82 1.6 kleink errno = EBADF; 83 1.24 christos return EOF; 84 1.6 kleink } 85 1.1 cgd 86 1.1 cgd #define MIN(a, b) ((a) < (b) ? (a) : (b)) 87 1.21 christos #define COPY(n) (void)memcpy(fp->_p, p, (size_t)(n)) 88 1.1 cgd 89 1.1 cgd iov = uio->uio_iov; 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 #define GETIOV(extra_work) \ 94 1.1 cgd while (len == 0) { \ 95 1.1 cgd extra_work; \ 96 1.1 cgd p = iov->iov_base; \ 97 1.1 cgd len = iov->iov_len; \ 98 1.1 cgd iov++; \ 99 1.1 cgd } 100 1.1 cgd if (fp->_flags & __SNBF) { 101 1.1 cgd /* 102 1.31 christos * Unbuffered: write up to INT_MAX bytes at a time, to not 103 1.31 christos * truncate the value of len if it is greater than 2^31 bytes. 104 1.1 cgd */ 105 1.1 cgd do { 106 1.1 cgd GETIOV(;); 107 1.31 christos w = (*fp->_write)(fp->_cookie, p, MIN(len, INT_MAX)); 108 1.30 christos if (w <= 0) 109 1.30 christos goto err; 110 1.1 cgd p += w; 111 1.1 cgd len -= w; 112 1.1 cgd } while ((uio->uio_resid -= w) != 0); 113 1.1 cgd } else if ((fp->_flags & __SLBF) == 0) { 114 1.1 cgd /* 115 1.1 cgd * Fully buffered: fill partially full buffer, if any, 116 1.1 cgd * and then flush. If there is no partial buffer, write 117 1.31 christos * entire payload directly (without copying) up to a multiple 118 1.31 christos * of the buffer size. 119 1.1 cgd * 120 1.1 cgd * String output is a special case: write as many bytes 121 1.1 cgd * as fit, but pretend we wrote everything. This makes 122 1.1 cgd * snprintf() return the number of bytes needed, rather 123 1.1 cgd * than the number used, and avoids its write function 124 1.1 cgd * (so that the write function can be invalid). 125 1.1 cgd */ 126 1.1 cgd do { 127 1.1 cgd GETIOV(;); 128 1.9 perry if ((fp->_flags & (__SALC | __SSTR)) == 129 1.23 christos (__SALC | __SSTR) && (size_t)fp->_w < len) { 130 1.23 christos ptrdiff_t blen = fp->_p - fp->_bf._base; 131 1.9 perry unsigned char *_base; 132 1.10 mycroft int _size; 133 1.9 perry 134 1.10 mycroft /* Allocate space exponentially. */ 135 1.10 mycroft _size = fp->_bf._size; 136 1.10 mycroft do { 137 1.10 mycroft _size = (_size << 1) + 1; 138 1.23 christos } while ((size_t)_size < blen + len); 139 1.21 christos _base = realloc(fp->_bf._base, 140 1.21 christos (size_t)(_size + 1)); 141 1.9 perry if (_base == NULL) 142 1.9 perry goto err; 143 1.10 mycroft fp->_w += _size - fp->_bf._size; 144 1.9 perry fp->_bf._base = _base; 145 1.10 mycroft fp->_bf._size = _size; 146 1.10 mycroft fp->_p = _base + blen; 147 1.9 perry } 148 1.1 cgd w = fp->_w; 149 1.1 cgd if (fp->_flags & __SSTR) { 150 1.23 christos if (len < (size_t)w) 151 1.25 christos w = len; 152 1.1 cgd COPY(w); /* copy MIN(fp->_w,len), */ 153 1.25 christos fp->_w -= (int)w; 154 1.1 cgd fp->_p += w; 155 1.25 christos w = len; /* but pretend copied all */ 156 1.23 christos } else if (fp->_p > fp->_bf._base && len > (size_t)w) { 157 1.1 cgd /* fill and flush */ 158 1.1 cgd COPY(w); 159 1.1 cgd /* fp->_w -= w; */ /* unneeded */ 160 1.1 cgd fp->_p += w; 161 1.30 christos if (fflush(fp)) 162 1.30 christos goto err; 163 1.23 christos } else if (len >= (size_t)(w = fp->_bf._size)) { 164 1.31 christos /* 165 1.31 christos * write directly up to INT_MAX or greatest 166 1.31 christos * multiple of buffer size (whatever is 167 1.31 christos * smaller), keeping in the memory buffer the 168 1.31 christos * remaining part of payload that is smaller 169 1.31 christos * than buffer size. 170 1.31 christos */ 171 1.31 christos if (w != 0) 172 1.31 christos w = MIN(w * (len / w), INT_MAX); 173 1.30 christos w = (*fp->_write)(fp->_cookie, p, (size_t)w); 174 1.30 christos if (w <= 0) 175 1.30 christos goto err; 176 1.1 cgd } else { 177 1.1 cgd /* fill and done */ 178 1.25 christos w = len; 179 1.1 cgd COPY(w); 180 1.25 christos fp->_w -= (int)w; 181 1.1 cgd fp->_p += w; 182 1.1 cgd } 183 1.1 cgd p += w; 184 1.1 cgd len -= w; 185 1.1 cgd } while ((uio->uio_resid -= w) != 0); 186 1.1 cgd } else { 187 1.1 cgd /* 188 1.1 cgd * Line buffered: like fully buffered, but we 189 1.1 cgd * must check for newlines. Compute the distance 190 1.1 cgd * to the first newline (including the newline), 191 1.1 cgd * or `infinity' if there is none, then pretend 192 1.1 cgd * that the amount to write is MIN(len,nldist). 193 1.1 cgd */ 194 1.1 cgd nlknown = 0; 195 1.1 cgd nldist = 0; /* XXX just to keep gcc happy */ 196 1.1 cgd do { 197 1.1 cgd GETIOV(nlknown = 0); 198 1.1 cgd if (!nlknown) { 199 1.23 christos nl = memchr(p, '\n', len); 200 1.23 christos nldist = nl ? (size_t)(nl + 1 - p) : len + 1; 201 1.1 cgd nlknown = 1; 202 1.1 cgd } 203 1.23 christos s = (int)MIN(len, nldist); 204 1.1 cgd w = fp->_w + fp->_bf._size; 205 1.1 cgd if (fp->_p > fp->_bf._base && s > w) { 206 1.1 cgd COPY(w); 207 1.1 cgd /* fp->_w -= w; */ 208 1.1 cgd fp->_p += w; 209 1.30 christos if (fflush(fp)) 210 1.30 christos goto err; 211 1.1 cgd } else if (s >= (w = fp->_bf._size)) { 212 1.30 christos w = (*fp->_write)(fp->_cookie, p, (size_t)w); 213 1.30 christos if (w <= 0) 214 1.30 christos goto err; 215 1.1 cgd } else { 216 1.1 cgd w = s; 217 1.1 cgd COPY(w); 218 1.25 christos fp->_w -= (int)w; 219 1.1 cgd fp->_p += w; 220 1.1 cgd } 221 1.1 cgd if ((nldist -= w) == 0) { 222 1.1 cgd /* copied the newline: flush and forget */ 223 1.30 christos if (fflush(fp)) 224 1.30 christos goto err; 225 1.1 cgd nlknown = 0; 226 1.1 cgd } 227 1.1 cgd p += w; 228 1.1 cgd len -= w; 229 1.1 cgd } while ((uio->uio_resid -= w) != 0); 230 1.1 cgd } 231 1.24 christos return 0; 232 1.1 cgd 233 1.1 cgd err: 234 1.1 cgd fp->_flags |= __SERR; 235 1.24 christos return EOF; 236 1.1 cgd } 237