xref: /freebsd/stand/libsa/lseek.c (revision 3e15b01d)
1ca987d46SWarner Losh /*	$NetBSD: lseek.c,v 1.4 1997/01/22 00:38:10 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 "stand.h"
62ca987d46SWarner Losh 
63ca987d46SWarner Losh off_t
lseek(int fd,off_t offset,int where)64ca987d46SWarner Losh lseek(int fd, off_t offset, int where)
65ca987d46SWarner Losh {
66ca987d46SWarner Losh 	off_t bufpos, filepos, target;
6797cbd5e7SToomas Soome 	struct open_file *f;
68ca987d46SWarner Losh 
6997cbd5e7SToomas Soome 	f = fd2open_file(fd);
7097cbd5e7SToomas Soome 	if (f == NULL || f->f_flags == 0) {
71ca987d46SWarner Losh 		errno = EBADF;
72ca987d46SWarner Losh 		return (-1);
73ca987d46SWarner Losh 	}
74ca987d46SWarner Losh 
75ca987d46SWarner Losh 	if (f->f_flags & F_RAW) {
76ca987d46SWarner Losh 		/*
77ca987d46SWarner Losh 		 * On RAW devices, update internal offset.
78ca987d46SWarner Losh 		 */
79ca987d46SWarner Losh 		switch (where) {
80ca987d46SWarner Losh 		case SEEK_SET:
81ca987d46SWarner Losh 			f->f_offset = offset;
82ca987d46SWarner Losh 			break;
83ca987d46SWarner Losh 		case SEEK_CUR:
84ca987d46SWarner Losh 			f->f_offset += offset;
85ca987d46SWarner Losh 			break;
86ca987d46SWarner Losh 		default:
87ca987d46SWarner Losh 			errno = EOFFSET;
88ca987d46SWarner Losh 			return (-1);
89ca987d46SWarner Losh 		}
90ca987d46SWarner Losh 		return (f->f_offset);
91ca987d46SWarner Losh 	}
92ca987d46SWarner Losh 
93ca987d46SWarner Losh 	/*
94ca987d46SWarner Losh 	 * If there is some unconsumed data in the readahead buffer and it
95ca987d46SWarner Losh 	 * contains the desired offset, simply adjust the buffer offset and
96ca987d46SWarner Losh 	 * length.  We don't bother with SEEK_END here, since the code to
97ca987d46SWarner Losh 	 * handle it would fail in the same cases where the non-readahead
98ca987d46SWarner Losh 	 * code fails (namely, for streams which cannot seek backward and whose
99ca987d46SWarner Losh 	 * size isn't known in advance).
100ca987d46SWarner Losh 	 */
101ca987d46SWarner Losh 	if (f->f_ralen != 0 && where != SEEK_END) {
102bbb539b8SToomas Soome 		filepos = (f->f_ops->fo_seek)(f, 0, SEEK_CUR);
103bbb539b8SToomas Soome 		if (filepos == -1)
104ca987d46SWarner Losh 			return (-1);
105ca987d46SWarner Losh 		bufpos = filepos - f->f_ralen;
106ca987d46SWarner Losh 		switch (where) {
107ca987d46SWarner Losh 		case SEEK_SET:
108ca987d46SWarner Losh 			target = offset;
109ca987d46SWarner Losh 			break;
110ca987d46SWarner Losh 		case SEEK_CUR:
111ca987d46SWarner Losh 			target = bufpos + offset;
112ca987d46SWarner Losh 			break;
113ca987d46SWarner Losh 		default:
114ca987d46SWarner Losh 			errno = EINVAL;
115ca987d46SWarner Losh 			return (-1);
116ca987d46SWarner Losh 		}
117ca987d46SWarner Losh 		if (bufpos <= target && target < filepos) {
118ca987d46SWarner Losh 			f->f_raoffset += target - bufpos;
119ca987d46SWarner Losh 			f->f_ralen -= target - bufpos;
120ca987d46SWarner Losh 			return (target);
121ca987d46SWarner Losh 		}
122ca987d46SWarner Losh 	}
123ca987d46SWarner Losh 
124ca987d46SWarner Losh 	/*
125ca987d46SWarner Losh 	 * If this is a relative seek, we need to correct the offset for
126ca987d46SWarner Losh 	 * bytes that we have already read but the caller doesn't know
127ca987d46SWarner Losh 	 * about.
128ca987d46SWarner Losh 	 */
129ca987d46SWarner Losh 	if (where == SEEK_CUR)
130ca987d46SWarner Losh 		offset -= f->f_ralen;
131ca987d46SWarner Losh 
132ca987d46SWarner Losh 	/*
133ca987d46SWarner Losh 	 * Invalidate the readahead buffer.
134ca987d46SWarner Losh 	 */
135ca987d46SWarner Losh 	f->f_ralen = 0;
136ca987d46SWarner Losh 
137ca987d46SWarner Losh 	return (f->f_ops->fo_seek)(f, offset, where);
138ca987d46SWarner Losh }
139