| 1 | /*-␊ |
| 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 | * 4. Neither the name of the University nor the names of its contributors␊ |
| 17 | * may be used to endorse or promote products derived from this software␊ |
| 18 | * without specific prior written permission.␊ |
| 19 | *␊ |
| 20 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND␊ |
| 21 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE␊ |
| 22 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE␊ |
| 23 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE␊ |
| 24 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL␊ |
| 25 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS␊ |
| 26 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)␊ |
| 27 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT␊ |
| 28 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY␊ |
| 29 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF␊ |
| 30 | * SUCH DAMAGE.␊ |
| 31 | */␊ |
| 32 | ␊ |
| 33 | #if defined(LIBC_SCCS) && !defined(lint)␊ |
| 34 | static char sccsid[] = "@(#)fwrite.c␉8.1 (Berkeley) 6/4/93";␊ |
| 35 | #endif /* LIBC_SCCS and not lint */␊ |
| 36 | #include <sys/cdefs.h>␊ |
| 37 | //__FBSDID("$FreeBSD: src/lib/libc/stdio/fwrite.c,v 1.13 2009/07/12 13:09:43 ed Exp $");␊ |
| 38 | ␊ |
| 39 | #include "stdio.h"␊ |
| 40 | #include "errno.h"␊ |
| 41 | #include "namespace.h"␊ |
| 42 | #include "un-namespace.h"␊ |
| 43 | #include "local.h"␊ |
| 44 | #include "fvwrite.h"␊ |
| 45 | ␊ |
| 46 | ␊ |
| 47 | /*␊ |
| 48 | * Write `count' objects (each size `size') from memory to the given file.␊ |
| 49 | * Return the number of whole objects written.␊ |
| 50 | */␊ |
| 51 | size_t␊ |
| 52 | fwrite(buf, size, count, fp)␊ |
| 53 | ␉const void * __restrict buf;␊ |
| 54 | ␉size_t size, count;␊ |
| 55 | ␉FILE * __restrict fp;␊ |
| 56 | {␊ |
| 57 | ␉size_t n;␊ |
| 58 | ␉struct __suio uio;␊ |
| 59 | ␉struct __siov iov;␊ |
| 60 | ␊ |
| 61 | ␉/*␊ |
| 62 | ␉ * ANSI and SUSv2 require a return value of 0 if size or count are 0.␊ |
| 63 | ␉ */␊ |
| 64 | ␉n = count * size;␊ |
| 65 | #if __DARWIN_UNIX03␊ |
| 66 | ␉if (n == 0)␊ |
| 67 | ␉␉return (0);␊ |
| 68 | #endif␊ |
| 69 | ␉iov.iov_base = (void *)buf;␊ |
| 70 | ␉uio.uio_resid = iov.iov_len = n;␊ |
| 71 | ␉uio.uio_iov = &iov;␊ |
| 72 | ␉uio.uio_iovcnt = 1;␊ |
| 73 | ␊ |
| 74 | ␉ORIENT(fp, -1);␊ |
| 75 | ␉/*␊ |
| 76 | ␉ * The usual case is success (__sfvwrite returns 0);␊ |
| 77 | ␉ * skip the divide if this happens, since divides are␊ |
| 78 | ␉ * generally slow and since this occurs whenever size==0.␊ |
| 79 | ␉ */␊ |
| 80 | ␉if (__sfvwrite(fp, &uio) != 0)␊ |
| 81 | ␉ count = (n - uio.uio_resid) / size;␊ |
| 82 | ␉return (count);␊ |
| 83 | }␊ |
| 84 | |
