158f0484fSRodney W. Grimes /*- 28a16b7a1SPedro F. Giffuni * SPDX-License-Identifier: BSD-3-Clause 38a16b7a1SPedro F. Giffuni * 458f0484fSRodney W. Grimes * Copyright (c) 1990, 1993 558f0484fSRodney W. Grimes * The Regents of the University of California. All rights reserved. 658f0484fSRodney W. Grimes * 758f0484fSRodney W. Grimes * This code is derived from software contributed to Berkeley by 858f0484fSRodney W. Grimes * Chris Torek. 958f0484fSRodney W. Grimes * 1058f0484fSRodney W. Grimes * Redistribution and use in source and binary forms, with or without 1158f0484fSRodney W. Grimes * modification, are permitted provided that the following conditions 1258f0484fSRodney W. Grimes * are met: 1358f0484fSRodney W. Grimes * 1. Redistributions of source code must retain the above copyright 1458f0484fSRodney W. Grimes * notice, this list of conditions and the following disclaimer. 1558f0484fSRodney W. Grimes * 2. Redistributions in binary form must reproduce the above copyright 1658f0484fSRodney W. Grimes * notice, this list of conditions and the following disclaimer in the 1758f0484fSRodney W. Grimes * documentation and/or other materials provided with the distribution. 181d8053c5SEd Maste * 3. Neither the name of the University nor the names of its contributors 1958f0484fSRodney W. Grimes * may be used to endorse or promote products derived from this software 2058f0484fSRodney W. Grimes * without specific prior written permission. 2158f0484fSRodney W. Grimes * 2258f0484fSRodney W. Grimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 2358f0484fSRodney W. Grimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 2458f0484fSRodney W. Grimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 2558f0484fSRodney W. Grimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 2658f0484fSRodney W. Grimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2758f0484fSRodney W. Grimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2858f0484fSRodney W. Grimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2958f0484fSRodney W. Grimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 3058f0484fSRodney W. Grimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 3158f0484fSRodney W. Grimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 3258f0484fSRodney W. Grimes * SUCH DAMAGE. 3358f0484fSRodney W. Grimes */ 3458f0484fSRodney W. Grimes 3558f0484fSRodney W. Grimes #if defined(LIBC_SCCS) && !defined(lint) 3658f0484fSRodney W. Grimes static char sccsid[] = "@(#)fread.c 8.2 (Berkeley) 12/11/93"; 3758f0484fSRodney W. Grimes #endif /* LIBC_SCCS and not lint */ 38333fc21eSDavid E. O'Brien #include <sys/cdefs.h> 39333fc21eSDavid E. O'Brien __FBSDID("$FreeBSD$"); 4058f0484fSRodney W. Grimes 41d201fe46SDaniel Eischen #include "namespace.h" 42c6a96a84SColin Percival #include <errno.h> 43c6a96a84SColin Percival #include <stdint.h> 4458f0484fSRodney W. Grimes #include <stdio.h> 4558f0484fSRodney W. Grimes #include <string.h> 46d201fe46SDaniel Eischen #include "un-namespace.h" 47f70177e7SJulian Elischer #include "local.h" 48ec216c26SJohn Birrell #include "libc_private.h" 4958f0484fSRodney W. Grimes 503b52e4d1SDavid Xu /* 513b52e4d1SDavid Xu * MT-safe version 523b52e4d1SDavid Xu */ 533b52e4d1SDavid Xu 5458f0484fSRodney W. Grimes size_t 553b52e4d1SDavid Xu fread(void * __restrict buf, size_t size, size_t count, FILE * __restrict fp) 563b52e4d1SDavid Xu { 57e95f37bbSRuslan Ermilov size_t ret; 583b52e4d1SDavid Xu 59fda0a14fSKonstantin Belousov FLOCKFILE_CANCELSAFE(fp); 603b52e4d1SDavid Xu ret = __fread(buf, size, count, fp); 61fda0a14fSKonstantin Belousov FUNLOCKFILE_CANCELSAFE(); 623b52e4d1SDavid Xu return (ret); 633b52e4d1SDavid Xu } 643b52e4d1SDavid Xu 653b52e4d1SDavid Xu size_t 663b52e4d1SDavid Xu __fread(void * __restrict buf, size_t size, size_t count, FILE * __restrict fp) 6758f0484fSRodney W. Grimes { 688fb3f3f6SDavid E. O'Brien size_t resid; 698fb3f3f6SDavid E. O'Brien char *p; 708fb3f3f6SDavid E. O'Brien int r; 7158f0484fSRodney W. Grimes size_t total; 7258f0484fSRodney W. Grimes 7358f0484fSRodney W. Grimes /* 7477822acfSEd Schouten * ANSI and SUSv2 require a return value of 0 if size or count are 0. 7558f0484fSRodney W. Grimes */ 76c6a96a84SColin Percival if ((count == 0) || (size == 0)) 7758f0484fSRodney W. Grimes return (0); 78c6a96a84SColin Percival 79c6a96a84SColin Percival /* 80c6a96a84SColin Percival * Check for integer overflow. As an optimization, first check that 81c6a96a84SColin Percival * at least one of {count, size} is at least 2^16, since if both 82c6a96a84SColin Percival * values are less than that, their product can't possible overflow 83c6a96a84SColin Percival * (size_t is always at least 32 bits on FreeBSD). 84c6a96a84SColin Percival */ 85c6a96a84SColin Percival if (((count | size) > 0xFFFF) && 86c6a96a84SColin Percival (count > SIZE_MAX / size)) { 87c6a96a84SColin Percival errno = EINVAL; 88c6a96a84SColin Percival fp->_flags |= __SERR; 89c6a96a84SColin Percival return (0); 90c6a96a84SColin Percival } 91c6a96a84SColin Percival 92c6a96a84SColin Percival /* 93c6a96a84SColin Percival * Compute the (now required to not overflow) number of bytes to 94c6a96a84SColin Percival * read and actually do the work. 95c6a96a84SColin Percival */ 96c6a96a84SColin Percival resid = count * size; 97e74101e4STim J. Robbins ORIENT(fp, -1); 9858f0484fSRodney W. Grimes if (fp->_r < 0) 9958f0484fSRodney W. Grimes fp->_r = 0; 10058f0484fSRodney W. Grimes total = resid; 10158f0484fSRodney W. Grimes p = buf; 102*a45843c8SPedro F. Giffuni 103*a45843c8SPedro F. Giffuni /* 104*a45843c8SPedro F. Giffuni * If we're unbuffered we know that the buffer in fp is empty so 105*a45843c8SPedro F. Giffuni * we can read directly into buf. This is much faster than a 106*a45843c8SPedro F. Giffuni * series of one byte reads into fp->_nbuf. 107*a45843c8SPedro F. Giffuni */ 108*a45843c8SPedro F. Giffuni if ((fp->_flags & __SNBF) != 0 && buf != NULL) { 109*a45843c8SPedro F. Giffuni while (resid > 0) { 110*a45843c8SPedro F. Giffuni /* set up the buffer */ 111*a45843c8SPedro F. Giffuni fp->_bf._base = fp->_p = p; 112*a45843c8SPedro F. Giffuni fp->_bf._size = resid; 113*a45843c8SPedro F. Giffuni 114*a45843c8SPedro F. Giffuni if (__srefill(fp)) { 115*a45843c8SPedro F. Giffuni /* no more input: return partial result */ 116*a45843c8SPedro F. Giffuni count = (total - resid) / size; 117*a45843c8SPedro F. Giffuni break; 118*a45843c8SPedro F. Giffuni } 119*a45843c8SPedro F. Giffuni p += fp->_r; 120*a45843c8SPedro F. Giffuni resid -= fp->_r; 121*a45843c8SPedro F. Giffuni } 122*a45843c8SPedro F. Giffuni 123*a45843c8SPedro F. Giffuni /* restore the old buffer (see __smakebuf) */ 124*a45843c8SPedro F. Giffuni fp->_bf._base = fp->_p = fp->_nbuf; 125*a45843c8SPedro F. Giffuni fp->_bf._size = 1; 126*a45843c8SPedro F. Giffuni fp->_r = 0; 127*a45843c8SPedro F. Giffuni 128*a45843c8SPedro F. Giffuni return (count); 129*a45843c8SPedro F. Giffuni } 130*a45843c8SPedro F. Giffuni 13158f0484fSRodney W. Grimes while (resid > (r = fp->_r)) { 13258f0484fSRodney W. Grimes (void)memcpy((void *)p, (void *)fp->_p, (size_t)r); 13358f0484fSRodney W. Grimes fp->_p += r; 13458f0484fSRodney W. Grimes /* fp->_r = 0 ... done in __srefill */ 13558f0484fSRodney W. Grimes p += r; 13658f0484fSRodney W. Grimes resid -= r; 13758f0484fSRodney W. Grimes if (__srefill(fp)) { 13858f0484fSRodney W. Grimes /* no more input: return partial result */ 13958f0484fSRodney W. Grimes return ((total - resid) / size); 14058f0484fSRodney W. Grimes } 14158f0484fSRodney W. Grimes } 14258f0484fSRodney W. Grimes (void)memcpy((void *)p, (void *)fp->_p, resid); 14358f0484fSRodney W. Grimes fp->_r -= resid; 14458f0484fSRodney W. Grimes fp->_p += resid; 14558f0484fSRodney W. Grimes return (count); 14658f0484fSRodney W. Grimes } 14712fe218fSKyle Evans 14812fe218fSKyle Evans __weak_reference(__fread, fread_unlocked); 149