Rev 2 | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
2 | pj | 1 | /*- |
2 | * Copyright (c) 1990, 1993 |
||
3 | * The Regents of the University of California. All rights reserved. |
||
4 | * |
||
5 | * This code is derived from software contributed to Berkeley by |
||
6 | * Chris Torek. |
||
7 | * |
||
8 | * Redistribution and use in source and binary forms, with or without |
||
9 | * modification, are permitted provided that the following conditions |
||
10 | * are met: |
||
11 | * 1. Redistributions of source code must retain the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer. |
||
13 | * 2. Redistributions in binary form must reproduce the above copyright |
||
14 | * notice, this list of conditions and the following disclaimer in the |
||
15 | * documentation and/or other materials provided with the distribution. |
||
16 | * 3. All advertising materials mentioning features or use of this software |
||
17 | * must display the following acknowledgement: |
||
18 | * This product includes software developed by the University of |
||
19 | * California, Berkeley and its contributors. |
||
20 | * 4. Neither the name of the University nor the names of its contributors |
||
21 | * may be used to endorse or promote products derived from this software |
||
22 | * without specific prior written permission. |
||
23 | * |
||
24 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
||
25 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
||
26 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
||
27 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
||
28 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
||
29 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
||
30 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
||
31 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
||
32 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
||
33 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
||
34 | * SUCH DAMAGE. |
||
35 | */ |
||
36 | |||
37 | /* MODIFIED: |
||
38 | * -- bug on unlock |
||
39 | */ |
||
40 | |||
41 | #if defined(LIBC_SCCS) && !defined(lint) |
||
42 | #if 0 |
||
43 | static char sccsid[] = "@(#)fread.c 8.2 (Berkeley) 12/11/93"; |
||
44 | #endif |
||
45 | static const char rcsid[] = |
||
46 | "$\Id: fread.c,v 1.3 1996/06/22 10:33:20 jraynard Exp $"; |
||
47 | #endif /* LIBC_SCCS and not lint */ |
||
48 | |||
49 | #include <stdio.h> |
||
50 | #include <string.h> |
||
51 | #include "local.h" |
||
52 | #ifdef _THREAD_SAFE |
||
53 | #include <pthread.h> |
||
54 | #include "pthread_private.h" |
||
55 | #endif |
||
56 | |||
57 | size_t |
||
58 | fread(buf, size, count, fp) |
||
59 | void *buf; |
||
60 | size_t size, count; |
||
61 | register FILE *fp; |
||
62 | { |
||
63 | register size_t resid; |
||
64 | register char *p; |
||
65 | register int r; |
||
66 | size_t total; |
||
67 | |||
68 | /* |
||
69 | * The ANSI standard requires a return value of 0 for a count |
||
70 | * or a size of 0. Peculiarily, it imposes no such requirements |
||
71 | * on fwrite; it only requires fread to be broken. |
||
72 | */ |
||
73 | if ((resid = count * size) == 0) |
||
74 | return (0); |
||
75 | #ifdef _THREAD_SAFE |
||
76 | _thread_flockfile(fp,__FILE__,__LINE__); |
||
77 | #endif |
||
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 | #ifdef _THREAD_SAFE |
||
91 | _thread_funlockfile(fp); |
||
92 | #endif |
||
93 | return ((total - resid) / size); |
||
94 | } |
||
95 | } |
||
96 | (void)memcpy((void *)p, (void *)fp->_p, resid); |
||
97 | fp->_r -= resid; |
||
98 | fp->_p += resid; |
||
99 | #ifdef _THREAD_SAFE |
||
100 | _thread_funlockfile(fp); |
||
101 | #endif |
||
102 | return (count); |
||
103 | } |