87 lines
3.0 KiB
C
87 lines
3.0 KiB
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)
|
|
#if 0
|
|
static char sccsid[] = "@(#)fwrite.c 8.1 (Berkeley) 6/4/93";
|
|
#endif
|
|
static const char rcsid[] =
|
|
"$Id$";
|
|
#endif /* LIBC_SCCS and not lint */
|
|
|
|
#include <stdio.h>
|
|
#include "local.h"
|
|
#include "fvwrite.h"
|
|
#ifdef _THREAD_SAFE
|
|
#include <pthread.h>
|
|
#include "pthread_private.h"
|
|
#endif
|
|
|
|
/*
|
|
* Write `count' objects (each size `size') from memory to the given file.
|
|
* Return the number of whole objects written.
|
|
*/
|
|
size_t
|
|
fwrite(buf, size, count, fp)
|
|
const void *buf;
|
|
size_t size, count;
|
|
FILE *fp;
|
|
{
|
|
size_t n;
|
|
struct __suio uio;
|
|
struct __siov iov;
|
|
|
|
iov.iov_base = (void *)buf;
|
|
uio.uio_resid = iov.iov_len = n = count * size;
|
|
uio.uio_iov = &iov;
|
|
uio.uio_iovcnt = 1;
|
|
|
|
#ifdef _THREAD_SAFE
|
|
_thread_flockfile(fp,__FILE__,__LINE__);
|
|
#endif
|
|
/*
|
|
* The usual case is success (__sfvwrite returns 0);
|
|
* skip the divide if this happens, since divides are
|
|
* generally slow and since this occurs whenever size==0.
|
|
*/
|
|
if (__sfvwrite(fp, &uio) != 0)
|
|
count = (n - uio.uio_resid) / size;
|
|
#ifdef _THREAD_SAFE
|
|
_thread_funlockfile(fp);
|
|
#endif
|
|
return (count);
|
|
}
|