Home | History | Annotate | Line # | Download | only in stdio
fread.c revision 1.14 
      1 /*	$NetBSD: fread.c,v 1.14 2001/01/25 02:06:25 lukem Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1990, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * This code is derived from software contributed to Berkeley by
      8  * Chris Torek.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. All advertising materials mentioning features or use of this software
     19  *    must display the following acknowledgement:
     20  *	This product includes software developed by the University of
     21  *	California, Berkeley and its contributors.
     22  * 4. Neither the name of the University nor the names of its contributors
     23  *    may be used to endorse or promote products derived from this software
     24  *    without specific prior written permission.
     25  *
     26  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36  * SUCH DAMAGE.
     37  */
     38 
     39 #include <sys/cdefs.h>
     40 #if defined(LIBC_SCCS) && !defined(lint)
     41 #if 0
     42 static char sccsid[] = "@(#)fread.c	8.2 (Berkeley) 12/11/93";
     43 #else
     44 __RCSID("$NetBSD: fread.c,v 1.14 2001/01/25 02:06:25 lukem Exp $");
     45 #endif
     46 #endif /* LIBC_SCCS and not lint */
     47 
     48 #include <assert.h>
     49 #include <errno.h>
     50 #include <stdio.h>
     51 #include <string.h>
     52 #include "local.h"
     53 #include "reentrant.h"
     54 
     55 size_t
     56 fread(buf, size, count, fp)
     57 	void *buf;
     58 	size_t size, count;
     59 	FILE *fp;
     60 {
     61 	size_t resid;
     62 	char *p;
     63 	int r;
     64 	size_t total;
     65 
     66 	_DIAGASSERT(fp != NULL);
     67 	/*
     68 	 * The ANSI standard requires a return value of 0 for a count
     69 	 * or a size of 0.  Whilst ANSI imposes no such requirements on
     70 	 * fwrite, the SUSv2 does.
     71 	 */
     72 	if ((resid = count * size) == 0)
     73 		return (0);
     74 
     75 	_DIAGASSERT(buf != NULL);
     76 
     77 	FLOCKFILE(fp);
     78 	if (fp->_r < 0)
     79 		fp->_r = 0;
     80 	total = resid;
     81 	p = buf;
     82 	while (resid > (r = fp->_r)) {
     83 		(void)memcpy((void *)p, (void *)fp->_p, (size_t)r);
     84 		fp->_p += r;
     85 		/* fp->_r = 0 ... done in __srefill */
     86 		p += r;
     87 		resid -= r;
     88 		if (__srefill(fp)) {
     89 			/* no more input: return partial result */
     90 			FUNLOCKFILE(fp);
     91 			return ((total - resid) / size);
     92 		}
     93 	}
     94 	(void)memcpy((void *)p, (void *)fp->_p, resid);
     95 	fp->_r -= resid;
     96 	fp->_p += resid;
     97 	FUNLOCKFILE(fp);
     98 	return (count);
     99 }
    100