Home | History | Annotate | Line # | Download | only in stdio
fread.c revision 1.27
      1  1.27  christos /*	$NetBSD: fread.c,v 1.27 2024/01/20 14:52:49 christos Exp $	*/
      2   1.6       jtc 
      3   1.1       cgd /*-
      4   1.6       jtc  * Copyright (c) 1990, 1993
      5   1.6       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.16       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.6       jtc #if 0
     38   1.6       jtc static char sccsid[] = "@(#)fread.c	8.2 (Berkeley) 12/11/93";
     39   1.7  christos #else
     40  1.27  christos __RCSID("$NetBSD: fread.c,v 1.27 2024/01/20 14:52:49 christos Exp $");
     41   1.6       jtc #endif
     42   1.1       cgd #endif /* LIBC_SCCS and not lint */
     43   1.1       cgd 
     44  1.10     lukem #include <assert.h>
     45  1.10     lukem #include <errno.h>
     46   1.1       cgd #include <stdio.h>
     47   1.1       cgd #include <string.h>
     48  1.15   thorpej #include "reentrant.h"
     49   1.7  christos #include "local.h"
     50   1.1       cgd 
     51  1.25  jdolecek #define MUL_NO_OVERFLOW	(1UL << (sizeof(size_t) * 4))
     52  1.25  jdolecek 
     53   1.4       jtc size_t
     54  1.22  christos fread(void *buf, size_t size, size_t count, FILE *fp)
     55   1.1       cgd {
     56   1.9     perry 	size_t resid;
     57   1.9     perry 	char *p;
     58   1.9     perry 	int r;
     59   1.1       cgd 	size_t total;
     60  1.10     lukem 
     61  1.10     lukem 	_DIAGASSERT(fp != NULL);
     62  1.25  jdolecek 
     63  1.25  jdolecek 	/*
     64  1.25  jdolecek 	 * Extension:  Catch integer overflow
     65  1.25  jdolecek 	 */
     66  1.25  jdolecek 	if ((size >= MUL_NO_OVERFLOW || count >= MUL_NO_OVERFLOW) &&
     67  1.25  jdolecek 	    size > 0 && count > SIZE_MAX / size) {
     68  1.25  jdolecek 		errno = EOVERFLOW;
     69  1.25  jdolecek 		fp->_flags |= __SERR;
     70  1.25  jdolecek 		return (0);
     71  1.25  jdolecek 	}
     72  1.25  jdolecek 
     73   1.6       jtc 	/*
     74   1.6       jtc 	 * The ANSI standard requires a return value of 0 for a count
     75  1.14     lukem 	 * or a size of 0.  Whilst ANSI imposes no such requirements on
     76  1.14     lukem 	 * fwrite, the SUSv2 does.
     77   1.6       jtc 	 */
     78   1.1       cgd 	if ((resid = count * size) == 0)
     79  1.22  christos 		return 0;
     80  1.14     lukem 
     81  1.14     lukem 	_DIAGASSERT(buf != NULL);
     82  1.14     lukem 
     83   1.8       jtc 	FLOCKFILE(fp);
     84   1.1       cgd 	total = resid;
     85   1.1       cgd 	p = buf;
     86  1.23     kamil 
     87  1.24  jdolecek 	/*
     88  1.24  jdolecek 	 * If we're unbuffered we know that the buffer in fp is empty so
     89  1.24  jdolecek 	 * we can read directly into buf.  This is much faster than a
     90  1.24  jdolecek 	 * series of one byte reads into fp->_nbuf.
     91  1.24  jdolecek 	 */
     92  1.24  jdolecek 	if ((fp->_flags & __SNBF) != 0) {
     93  1.24  jdolecek 		while (resid > 0) {
     94  1.24  jdolecek 			/* set up the buffer */
     95  1.24  jdolecek 			fp->_bf._base = fp->_p = (unsigned char *)p;
     96  1.27  christos 			fp->_bf._size = (int)resid;
     97  1.24  jdolecek 
     98  1.24  jdolecek 			if (__srefill(fp)) {
     99  1.24  jdolecek 				/* no more input: return partial result */
    100  1.24  jdolecek 				count = (total - resid) / size;
    101  1.24  jdolecek 				break;
    102  1.24  jdolecek 			}
    103  1.24  jdolecek 			p += fp->_r;
    104  1.24  jdolecek 			resid -= fp->_r;
    105  1.24  jdolecek 		}
    106  1.24  jdolecek 
    107  1.24  jdolecek 		/* restore the old buffer (see __smakebuf) */
    108  1.24  jdolecek 		fp->_bf._base = fp->_p = fp->_nbuf;
    109  1.24  jdolecek 		fp->_bf._size = 1;
    110  1.24  jdolecek 		fp->_r = 0;
    111  1.24  jdolecek 
    112  1.24  jdolecek 		FUNLOCKFILE(fp);
    113  1.24  jdolecek 		return (count);
    114  1.23     kamil 	}
    115  1.23     kamil 
    116  1.26  jdolecek 	if (fp->_r <= 0) {
    117  1.26  jdolecek 		/* Nothing to read on enter, refill the buffers. */
    118  1.26  jdolecek 		goto refill;
    119  1.26  jdolecek 	}
    120  1.26  jdolecek 
    121  1.17     lukem 	while (resid > (size_t)(r = fp->_r)) {
    122  1.20  christos 		(void)memcpy(p, fp->_p, (size_t)r);
    123   1.1       cgd 		fp->_p += r;
    124   1.1       cgd 		/* fp->_r = 0 ... done in __srefill */
    125   1.1       cgd 		p += r;
    126   1.1       cgd 		resid -= r;
    127  1.26  jdolecek refill:
    128   1.1       cgd 		if (__srefill(fp)) {
    129   1.1       cgd 			/* no more input: return partial result */
    130   1.8       jtc 			FUNLOCKFILE(fp);
    131  1.22  christos 			return (total - resid) / size;
    132   1.1       cgd 		}
    133   1.1       cgd 	}
    134  1.18       dsl 	(void)memcpy(p, fp->_p, resid);
    135  1.21  christos 
    136  1.21  christos 	_DIAGASSERT(__type_fit(int, fp->_r - resid));
    137  1.21  christos 	fp->_r -= (int)resid;
    138   1.1       cgd 	fp->_p += resid;
    139   1.8       jtc 	FUNLOCKFILE(fp);
    140  1.22  christos 	return count;
    141   1.1       cgd }
    142