summaryrefslogtreecommitdiff
path: root/lib/libc/stdio/fread.c
blob: cf71060557cebd0d6991ced389c426ecbe4caa0a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
/*	$NetBSD: fread.c,v 1.26 2021/02/07 15:54:09 jdolecek Exp $	*/

/*-
 * 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. 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.
 */

#include <sys/cdefs.h>
#if defined(LIBC_SCCS) && !defined(lint)
#if 0
static char sccsid[] = "@(#)fread.c	8.2 (Berkeley) 12/11/93";
#else
__RCSID("$NetBSD: fread.c,v 1.26 2021/02/07 15:54:09 jdolecek Exp $");
#endif
#endif /* LIBC_SCCS and not lint */

#include <assert.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include "reentrant.h"
#include "local.h"

#define MUL_NO_OVERFLOW	(1UL << (sizeof(size_t) * 4))

size_t
fread(void *buf, size_t size, size_t count, FILE *fp)
{
	size_t resid;
	char *p;
	int r;
	size_t total;

	_DIAGASSERT(fp != NULL);

	/*
	 * Extension:  Catch integer overflow
	 */
	if ((size >= MUL_NO_OVERFLOW || count >= MUL_NO_OVERFLOW) &&
	    size > 0 && count > SIZE_MAX / size) {
		errno = EOVERFLOW;
		fp->_flags |= __SERR;
		return (0);
	}

	/*
	 * The ANSI standard requires a return value of 0 for a count
	 * or a size of 0.  Whilst ANSI imposes no such requirements on
	 * fwrite, the SUSv2 does.
	 */
	if ((resid = count * size) == 0)
		return 0;

	_DIAGASSERT(buf != NULL);

	FLOCKFILE(fp);
	total = resid;
	p = buf;

	/*
	 * If we're unbuffered we know that the buffer in fp is empty so
	 * we can read directly into buf.  This is much faster than a
	 * series of one byte reads into fp->_nbuf.
	 */
	if ((fp->_flags & __SNBF) != 0) {
		while (resid > 0) {
			/* set up the buffer */
			fp->_bf._base = fp->_p = (unsigned char *)p;
			fp->_bf._size = resid;

			if (__srefill(fp)) {
				/* no more input: return partial result */
				count = (total - resid) / size;
				break;
			}
			p += fp->_r;
			resid -= fp->_r;
		}

		/* restore the old buffer (see __smakebuf) */
		fp->_bf._base = fp->_p = fp->_nbuf;
		fp->_bf._size = 1;
		fp->_r = 0;

		FUNLOCKFILE(fp);
		return (count);
	}

	if (fp->_r <= 0) {
		/* Nothing to read on enter, refill the buffers. */
		goto refill;
	}

	while (resid > (size_t)(r = fp->_r)) {
		(void)memcpy(p, fp->_p, (size_t)r);
		fp->_p += r;
		/* fp->_r = 0 ... done in __srefill */
		p += r;
		resid -= r;
refill:
		if (__srefill(fp)) {
			/* no more input: return partial result */
			FUNLOCKFILE(fp);
			return (total - resid) / size;
		}
	}
	(void)memcpy(p, fp->_p, resid);

	_DIAGASSERT(__type_fit(int, fp->_r - resid));
	fp->_r -= (int)resid;
	fp->_p += resid;
	FUNLOCKFILE(fp);
	return count;
}