fread.c revision 1.24 1 1.24 jdolecek /* $NetBSD: fread.c,v 1.24 2021/01/31 16:18:22 jdolecek 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.24 jdolecek __RCSID("$NetBSD: fread.c,v 1.24 2021/01/31 16:18:22 jdolecek 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.4 jtc size_t
52 1.22 christos fread(void *buf, size_t size, size_t count, FILE *fp)
53 1.1 cgd {
54 1.9 perry size_t resid;
55 1.9 perry char *p;
56 1.9 perry int r;
57 1.1 cgd size_t total;
58 1.10 lukem
59 1.10 lukem _DIAGASSERT(fp != NULL);
60 1.6 jtc /*
61 1.6 jtc * The ANSI standard requires a return value of 0 for a count
62 1.14 lukem * or a size of 0. Whilst ANSI imposes no such requirements on
63 1.14 lukem * fwrite, the SUSv2 does.
64 1.6 jtc */
65 1.1 cgd if ((resid = count * size) == 0)
66 1.22 christos return 0;
67 1.14 lukem
68 1.14 lukem _DIAGASSERT(buf != NULL);
69 1.14 lukem
70 1.8 jtc FLOCKFILE(fp);
71 1.24 jdolecek if (fp->_r < 0)
72 1.24 jdolecek fp->_r = 0;
73 1.1 cgd total = resid;
74 1.1 cgd p = buf;
75 1.23 kamil
76 1.24 jdolecek /*
77 1.24 jdolecek * If we're unbuffered we know that the buffer in fp is empty so
78 1.24 jdolecek * we can read directly into buf. This is much faster than a
79 1.24 jdolecek * series of one byte reads into fp->_nbuf.
80 1.24 jdolecek */
81 1.24 jdolecek if ((fp->_flags & __SNBF) != 0) {
82 1.24 jdolecek while (resid > 0) {
83 1.24 jdolecek /* set up the buffer */
84 1.24 jdolecek fp->_bf._base = fp->_p = (unsigned char *)p;
85 1.24 jdolecek fp->_bf._size = resid;
86 1.24 jdolecek
87 1.24 jdolecek if (__srefill(fp)) {
88 1.24 jdolecek /* no more input: return partial result */
89 1.24 jdolecek count = (total - resid) / size;
90 1.24 jdolecek break;
91 1.24 jdolecek }
92 1.24 jdolecek p += fp->_r;
93 1.24 jdolecek resid -= fp->_r;
94 1.24 jdolecek }
95 1.24 jdolecek
96 1.24 jdolecek /* restore the old buffer (see __smakebuf) */
97 1.24 jdolecek fp->_bf._base = fp->_p = fp->_nbuf;
98 1.24 jdolecek fp->_bf._size = 1;
99 1.24 jdolecek fp->_r = 0;
100 1.24 jdolecek
101 1.24 jdolecek FUNLOCKFILE(fp);
102 1.24 jdolecek return (count);
103 1.23 kamil }
104 1.23 kamil
105 1.17 lukem while (resid > (size_t)(r = fp->_r)) {
106 1.20 christos (void)memcpy(p, fp->_p, (size_t)r);
107 1.1 cgd fp->_p += r;
108 1.1 cgd /* fp->_r = 0 ... done in __srefill */
109 1.1 cgd p += r;
110 1.1 cgd resid -= r;
111 1.1 cgd if (__srefill(fp)) {
112 1.1 cgd /* no more input: return partial result */
113 1.8 jtc FUNLOCKFILE(fp);
114 1.22 christos return (total - resid) / size;
115 1.1 cgd }
116 1.1 cgd }
117 1.18 dsl (void)memcpy(p, fp->_p, resid);
118 1.21 christos
119 1.21 christos _DIAGASSERT(__type_fit(int, fp->_r - resid));
120 1.21 christos fp->_r -= (int)resid;
121 1.1 cgd fp->_p += resid;
122 1.8 jtc FUNLOCKFILE(fp);
123 1.22 christos return count;
124 1.1 cgd }
125