1 1.19 jdolecek /* $NetBSD: fwrite.c,v 1.19 2021/02/01 17:50:53 jdolecek Exp $ */ 2 1.5 jtc 3 1.1 cgd /*- 4 1.5 jtc * Copyright (c) 1990, 1993 5 1.5 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.6 christos #include <sys/cdefs.h> 36 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint) 37 1.5 jtc #if 0 38 1.5 jtc static char sccsid[] = "@(#)fwrite.c 8.1 (Berkeley) 6/4/93"; 39 1.6 christos #else 40 1.19 jdolecek __RCSID("$NetBSD: fwrite.c,v 1.19 2021/02/01 17:50:53 jdolecek Exp $"); 41 1.5 jtc #endif 42 1.1 cgd #endif /* LIBC_SCCS and not lint */ 43 1.1 cgd 44 1.9 lukem #include <assert.h> 45 1.9 lukem #include <errno.h> 46 1.1 cgd #include <stdio.h> 47 1.14 thorpej #include "reentrant.h" 48 1.1 cgd #include "local.h" 49 1.1 cgd #include "fvwrite.h" 50 1.1 cgd 51 1.19 jdolecek #define MUL_NO_OVERFLOW (1UL << (sizeof(size_t) * 4)) 52 1.19 jdolecek 53 1.1 cgd /* 54 1.1 cgd * Write `count' objects (each size `size') from memory to the given file. 55 1.1 cgd * Return the number of whole objects written. 56 1.1 cgd */ 57 1.4 jtc size_t 58 1.17 christos fwrite(const void *buf, size_t size, size_t count, FILE *fp) 59 1.1 cgd { 60 1.1 cgd size_t n; 61 1.1 cgd struct __suio uio; 62 1.1 cgd struct __siov iov; 63 1.9 lukem 64 1.13 lukem /* 65 1.19 jdolecek * Extension: Catch integer overflow 66 1.19 jdolecek */ 67 1.19 jdolecek if ((size >= MUL_NO_OVERFLOW || count >= MUL_NO_OVERFLOW) && 68 1.19 jdolecek size > 0 && count > SIZE_MAX / size) { 69 1.19 jdolecek errno = EOVERFLOW; 70 1.19 jdolecek fp->_flags |= __SERR; 71 1.19 jdolecek return (0); 72 1.19 jdolecek } 73 1.19 jdolecek 74 1.19 jdolecek /* 75 1.13 lukem * SUSv2 requires a return value of 0 for a count or a size of 0. 76 1.13 lukem */ 77 1.13 lukem if ((n = count * size) == 0) 78 1.17 christos return 0; 79 1.1 cgd 80 1.16 christos iov.iov_base = __UNCONST(buf); 81 1.13 lukem uio.uio_resid = iov.iov_len = n; 82 1.1 cgd uio.uio_iov = &iov; 83 1.1 cgd uio.uio_iovcnt = 1; 84 1.1 cgd 85 1.1 cgd /* 86 1.1 cgd * The usual case is success (__sfvwrite returns 0); 87 1.1 cgd * skip the divide if this happens, since divides are 88 1.1 cgd * generally slow and since this occurs whenever size==0. 89 1.1 cgd */ 90 1.7 jtc FLOCKFILE(fp); 91 1.7 jtc if (__sfvwrite(fp, &uio) != 0) 92 1.7 jtc count = ((n - uio.uio_resid) / size); 93 1.7 jtc FUNLOCKFILE(fp); 94 1.17 christos return count; 95 1.1 cgd } 96