1ca987d46SWarner Losh /* $NetBSD: read.c,v 1.8 1997/01/22 00:38:12 cgd Exp $ */
2ca987d46SWarner Losh
3ca987d46SWarner Losh /*-
4ca987d46SWarner Losh * Copyright (c) 1993
5ca987d46SWarner Losh * The Regents of the University of California. All rights reserved.
6ca987d46SWarner Losh *
7ca987d46SWarner Losh * This code is derived from software contributed to Berkeley by
8ca987d46SWarner Losh * The Mach Operating System project at Carnegie-Mellon University.
9ca987d46SWarner Losh *
10ca987d46SWarner Losh * Redistribution and use in source and binary forms, with or without
11ca987d46SWarner Losh * modification, are permitted provided that the following conditions
12ca987d46SWarner Losh * are met:
13ca987d46SWarner Losh * 1. Redistributions of source code must retain the above copyright
14ca987d46SWarner Losh * notice, this list of conditions and the following disclaimer.
15ca987d46SWarner Losh * 2. Redistributions in binary form must reproduce the above copyright
16ca987d46SWarner Losh * notice, this list of conditions and the following disclaimer in the
17ca987d46SWarner Losh * documentation and/or other materials provided with the distribution.
18ca987d46SWarner Losh * 3. Neither the name of the University nor the names of its contributors
19ca987d46SWarner Losh * may be used to endorse or promote products derived from this software
20ca987d46SWarner Losh * without specific prior written permission.
21ca987d46SWarner Losh *
22ca987d46SWarner Losh * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23ca987d46SWarner Losh * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24ca987d46SWarner Losh * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25ca987d46SWarner Losh * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26ca987d46SWarner Losh * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27ca987d46SWarner Losh * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28ca987d46SWarner Losh * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29ca987d46SWarner Losh * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30ca987d46SWarner Losh * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31ca987d46SWarner Losh * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32ca987d46SWarner Losh * SUCH DAMAGE.
33ca987d46SWarner Losh *
34ca987d46SWarner Losh *
35ca987d46SWarner Losh * Copyright (c) 1989, 1990, 1991 Carnegie Mellon University
36ca987d46SWarner Losh * All Rights Reserved.
37ca987d46SWarner Losh *
38ca987d46SWarner Losh * Author: Alessandro Forin
39ca987d46SWarner Losh *
40ca987d46SWarner Losh * Permission to use, copy, modify and distribute this software and its
41ca987d46SWarner Losh * documentation is hereby granted, provided that both the copyright
42ca987d46SWarner Losh * notice and this permission notice appear in all copies of the
43ca987d46SWarner Losh * software, derivative works or modified versions, and any portions
44ca987d46SWarner Losh * thereof, and that both notices appear in supporting documentation.
45ca987d46SWarner Losh *
46ca987d46SWarner Losh * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
47ca987d46SWarner Losh * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
48ca987d46SWarner Losh * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
49ca987d46SWarner Losh *
50ca987d46SWarner Losh * Carnegie Mellon requests users of this software to return to
51ca987d46SWarner Losh *
52ca987d46SWarner Losh * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
53ca987d46SWarner Losh * School of Computer Science
54ca987d46SWarner Losh * Carnegie Mellon University
55ca987d46SWarner Losh * Pittsburgh PA 15213-3890
56ca987d46SWarner Losh *
57ca987d46SWarner Losh * any improvements or extensions that they make and grant Carnegie the
58ca987d46SWarner Losh * rights to redistribute these changes.
59ca987d46SWarner Losh */
60ca987d46SWarner Losh
61ca987d46SWarner Losh #include <sys/param.h>
62ca987d46SWarner Losh #include "stand.h"
63ca987d46SWarner Losh
64ca987d46SWarner Losh ssize_t
read(int fd,void * dest,size_t bcount)65ca987d46SWarner Losh read(int fd, void *dest, size_t bcount)
66ca987d46SWarner Losh {
67*97cbd5e7SToomas Soome struct open_file *f;
68ca987d46SWarner Losh size_t resid;
69ca987d46SWarner Losh
70313724baSColin Percival TSENTER();
71313724baSColin Percival
72*97cbd5e7SToomas Soome f = fd2open_file(fd);
73*97cbd5e7SToomas Soome if (f == NULL || !(f->f_flags & F_READ)) {
74ca987d46SWarner Losh errno = EBADF;
75ca987d46SWarner Losh return (-1);
76ca987d46SWarner Losh }
77ca987d46SWarner Losh if (f->f_flags & F_RAW) {
78ca987d46SWarner Losh twiddle(4);
79ca987d46SWarner Losh errno = (f->f_dev->dv_strategy)(f->f_devdata, F_READ,
80ca987d46SWarner Losh btodb(f->f_offset), bcount, dest, &resid);
81ca987d46SWarner Losh if (errno)
82ca987d46SWarner Losh return (-1);
83ca987d46SWarner Losh f->f_offset += resid;
84313724baSColin Percival TSEXIT();
85ca987d46SWarner Losh return (resid);
86ca987d46SWarner Losh }
87ca987d46SWarner Losh
88ca987d46SWarner Losh /*
89ca987d46SWarner Losh * Optimise reads from regular files using a readahead buffer.
90ca987d46SWarner Losh * If the request can't be satisfied from the current buffer contents,
91f03b0832SToomas Soome * check to see if it should be bypassed, or refill the buffer and
92f03b0832SToomas Soome * complete the request.
93ca987d46SWarner Losh */
94ca987d46SWarner Losh resid = bcount;
95ca987d46SWarner Losh for (;;) {
96ca987d46SWarner Losh size_t ccount, cresid;
97ca987d46SWarner Losh /* how much can we supply? */
98ca987d46SWarner Losh ccount = imin(f->f_ralen, resid);
99ca987d46SWarner Losh if (ccount > 0) {
100ca987d46SWarner Losh bcopy(f->f_rabuf + f->f_raoffset, dest, ccount);
101ca987d46SWarner Losh f->f_raoffset += ccount;
102ca987d46SWarner Losh f->f_ralen -= ccount;
103ca987d46SWarner Losh resid -= ccount;
104313724baSColin Percival if (resid == 0) {
105313724baSColin Percival TSEXIT();
106ca987d46SWarner Losh return (bcount);
107313724baSColin Percival }
108ca987d46SWarner Losh dest = (char *)dest + ccount;
109ca987d46SWarner Losh }
110ca987d46SWarner Losh
111ca987d46SWarner Losh /* will filling the readahead buffer again not help? */
1127416e819SToomas Soome if (f->f_rabuf == NULL || resid >= SOPEN_RASIZE) {
113f03b0832SToomas Soome /*
114f03b0832SToomas Soome * bypass the rest of the request and leave the
115f03b0832SToomas Soome * buffer empty
116f03b0832SToomas Soome */
117f03b0832SToomas Soome errno = (f->f_ops->fo_read)(f, dest, resid, &cresid);
118f03b0832SToomas Soome if (errno != 0)
119ca987d46SWarner Losh return (-1);
120313724baSColin Percival TSEXIT();
121ca987d46SWarner Losh return (bcount - cresid);
122ca987d46SWarner Losh }
123ca987d46SWarner Losh
124ca987d46SWarner Losh /* fetch more data */
125f03b0832SToomas Soome errno = (f->f_ops->fo_read)(f, f->f_rabuf, SOPEN_RASIZE,
126f03b0832SToomas Soome &cresid);
127f03b0832SToomas Soome if (errno != 0)
128ca987d46SWarner Losh return (-1);
129ca987d46SWarner Losh f->f_raoffset = 0;
130ca987d46SWarner Losh f->f_ralen = SOPEN_RASIZE - cresid;
131ca987d46SWarner Losh /* no more data, return what we had */
132313724baSColin Percival if (f->f_ralen == 0) {
133313724baSColin Percival TSEXIT();
134ca987d46SWarner Losh return (bcount - resid);
135ca987d46SWarner Losh }
136ca987d46SWarner Losh }
137313724baSColin Percival }
138