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 * @(#)read.c 8.1 (Berkeley) 6/11/93 35ca987d46SWarner Losh * 36ca987d46SWarner Losh * 37ca987d46SWarner Losh * Copyright (c) 1989, 1990, 1991 Carnegie Mellon University 38ca987d46SWarner Losh * All Rights Reserved. 39ca987d46SWarner Losh * 40ca987d46SWarner Losh * Author: Alessandro Forin 41ca987d46SWarner Losh * 42ca987d46SWarner Losh * Permission to use, copy, modify and distribute this software and its 43ca987d46SWarner Losh * documentation is hereby granted, provided that both the copyright 44ca987d46SWarner Losh * notice and this permission notice appear in all copies of the 45ca987d46SWarner Losh * software, derivative works or modified versions, and any portions 46ca987d46SWarner Losh * thereof, and that both notices appear in supporting documentation. 47ca987d46SWarner Losh * 48ca987d46SWarner Losh * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" 49ca987d46SWarner Losh * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR 50ca987d46SWarner Losh * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. 51ca987d46SWarner Losh * 52ca987d46SWarner Losh * Carnegie Mellon requests users of this software to return to 53ca987d46SWarner Losh * 54ca987d46SWarner Losh * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU 55ca987d46SWarner Losh * School of Computer Science 56ca987d46SWarner Losh * Carnegie Mellon University 57ca987d46SWarner Losh * Pittsburgh PA 15213-3890 58ca987d46SWarner Losh * 59ca987d46SWarner Losh * any improvements or extensions that they make and grant Carnegie the 60ca987d46SWarner Losh * rights to redistribute these changes. 61ca987d46SWarner Losh */ 62ca987d46SWarner Losh 63ca987d46SWarner Losh #include <sys/cdefs.h> 64ca987d46SWarner Losh __FBSDID("$FreeBSD$"); 65ca987d46SWarner Losh 66ca987d46SWarner Losh #include <sys/param.h> 67ca987d46SWarner Losh #include "stand.h" 68ca987d46SWarner Losh 69ca987d46SWarner Losh ssize_t 70ca987d46SWarner Losh read(int fd, void *dest, size_t bcount) 71ca987d46SWarner Losh { 72ca987d46SWarner Losh struct open_file *f = &files[fd]; 73ca987d46SWarner Losh size_t resid; 74ca987d46SWarner Losh 75ca987d46SWarner Losh if ((unsigned)fd >= SOPEN_MAX || !(f->f_flags & F_READ)) { 76ca987d46SWarner Losh errno = EBADF; 77ca987d46SWarner Losh return (-1); 78ca987d46SWarner Losh } 79ca987d46SWarner Losh if (f->f_flags & F_RAW) { 80ca987d46SWarner Losh twiddle(4); 81ca987d46SWarner Losh errno = (f->f_dev->dv_strategy)(f->f_devdata, F_READ, 82ca987d46SWarner Losh btodb(f->f_offset), bcount, dest, &resid); 83ca987d46SWarner Losh if (errno) 84ca987d46SWarner Losh return (-1); 85ca987d46SWarner Losh f->f_offset += resid; 86ca987d46SWarner Losh return (resid); 87ca987d46SWarner Losh } 88ca987d46SWarner Losh 89ca987d46SWarner Losh /* 90ca987d46SWarner Losh * Optimise reads from regular files using a readahead buffer. 91ca987d46SWarner Losh * If the request can't be satisfied from the current buffer contents, 92*f03b0832SToomas Soome * check to see if it should be bypassed, or refill the buffer and 93*f03b0832SToomas Soome * complete the request. 94ca987d46SWarner Losh */ 95ca987d46SWarner Losh resid = bcount; 96ca987d46SWarner Losh for (;;) { 97ca987d46SWarner Losh size_t ccount, cresid; 98ca987d46SWarner Losh /* how much can we supply? */ 99ca987d46SWarner Losh ccount = imin(f->f_ralen, resid); 100ca987d46SWarner Losh if (ccount > 0) { 101ca987d46SWarner Losh bcopy(f->f_rabuf + f->f_raoffset, dest, ccount); 102ca987d46SWarner Losh f->f_raoffset += ccount; 103ca987d46SWarner Losh f->f_ralen -= ccount; 104ca987d46SWarner Losh resid -= ccount; 105ca987d46SWarner Losh if (resid == 0) 106ca987d46SWarner Losh return (bcount); 107ca987d46SWarner Losh dest = (char *)dest + ccount; 108ca987d46SWarner Losh } 109ca987d46SWarner Losh 110ca987d46SWarner Losh /* will filling the readahead buffer again not help? */ 111ca987d46SWarner Losh if (resid >= SOPEN_RASIZE) { 112*f03b0832SToomas Soome /* 113*f03b0832SToomas Soome * bypass the rest of the request and leave the 114*f03b0832SToomas Soome * buffer empty 115*f03b0832SToomas Soome */ 116*f03b0832SToomas Soome errno = (f->f_ops->fo_read)(f, dest, resid, &cresid); 117*f03b0832SToomas Soome if (errno != 0) 118ca987d46SWarner Losh return (-1); 119ca987d46SWarner Losh return (bcount - cresid); 120ca987d46SWarner Losh } 121ca987d46SWarner Losh 122ca987d46SWarner Losh /* fetch more data */ 123*f03b0832SToomas Soome errno = (f->f_ops->fo_read)(f, f->f_rabuf, SOPEN_RASIZE, 124*f03b0832SToomas Soome &cresid); 125*f03b0832SToomas Soome if (errno != 0) 126ca987d46SWarner Losh return (-1); 127ca987d46SWarner Losh f->f_raoffset = 0; 128ca987d46SWarner Losh f->f_ralen = SOPEN_RASIZE - cresid; 129ca987d46SWarner Losh /* no more data, return what we had */ 130ca987d46SWarner Losh if (f->f_ralen == 0) 131ca987d46SWarner Losh return (bcount - resid); 132ca987d46SWarner Losh } 133ca987d46SWarner Losh } 134