fseek.c revision 1.7 1 1.7 jtc /* $NetBSD: fseek.c,v 1.7 1995/02/02 02:09:39 jtc Exp $ */
2 1.7 jtc
3 1.1 cgd /*-
4 1.7 jtc * Copyright (c) 1990, 1993
5 1.7 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.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd */
38 1.1 cgd
39 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
40 1.7 jtc #if 0
41 1.7 jtc static char sccsid[] = "@(#)fseek.c 8.3 (Berkeley) 1/2/94";
42 1.7 jtc #endif
43 1.7 jtc static char rcsid[] = "$NetBSD: fseek.c,v 1.7 1995/02/02 02:09:39 jtc Exp $";
44 1.1 cgd #endif /* LIBC_SCCS and not lint */
45 1.1 cgd
46 1.1 cgd #include <sys/types.h>
47 1.1 cgd #include <sys/stat.h>
48 1.1 cgd #include <fcntl.h>
49 1.1 cgd #include <stdio.h>
50 1.1 cgd #include <stdlib.h>
51 1.1 cgd #include <errno.h>
52 1.1 cgd #include "local.h"
53 1.1 cgd
54 1.1 cgd #define POS_ERR (-(fpos_t)1)
55 1.1 cgd
56 1.1 cgd /*
57 1.1 cgd * Seek the given file to the given offset.
58 1.1 cgd * `Whence' must be one of the three SEEK_* macros.
59 1.1 cgd */
60 1.7 jtc int
61 1.1 cgd fseek(fp, offset, whence)
62 1.1 cgd register FILE *fp;
63 1.1 cgd long offset;
64 1.1 cgd int whence;
65 1.1 cgd {
66 1.7 jtc register fpos_t (*seekfn) __P((void *, fpos_t, int));
67 1.1 cgd fpos_t target, curoff;
68 1.1 cgd size_t n;
69 1.1 cgd struct stat st;
70 1.1 cgd int havepos;
71 1.1 cgd
72 1.1 cgd /* make sure stdio is set up */
73 1.1 cgd if (!__sdidinit)
74 1.1 cgd __sinit();
75 1.1 cgd
76 1.1 cgd /*
77 1.1 cgd * Have to be able to seek.
78 1.1 cgd */
79 1.1 cgd if ((seekfn = fp->_seek) == NULL) {
80 1.1 cgd errno = ESPIPE; /* historic practice */
81 1.1 cgd return (EOF);
82 1.1 cgd }
83 1.1 cgd
84 1.1 cgd /*
85 1.1 cgd * Change any SEEK_CUR to SEEK_SET, and check `whence' argument.
86 1.1 cgd * After this, whence is either SEEK_SET or SEEK_END.
87 1.1 cgd */
88 1.1 cgd switch (whence) {
89 1.1 cgd
90 1.1 cgd case SEEK_CUR:
91 1.1 cgd /*
92 1.1 cgd * In order to seek relative to the current stream offset,
93 1.1 cgd * we have to first find the current stream offset a la
94 1.1 cgd * ftell (see ftell for details).
95 1.1 cgd */
96 1.1 cgd if (fp->_flags & __SOFF)
97 1.1 cgd curoff = fp->_offset;
98 1.1 cgd else {
99 1.1 cgd curoff = (*seekfn)(fp->_cookie, (fpos_t)0, SEEK_CUR);
100 1.1 cgd if (curoff == -1L)
101 1.1 cgd return (EOF);
102 1.1 cgd }
103 1.1 cgd if (fp->_flags & __SRD) {
104 1.1 cgd curoff -= fp->_r;
105 1.1 cgd if (HASUB(fp))
106 1.1 cgd curoff -= fp->_ur;
107 1.1 cgd } else if (fp->_flags & __SWR && fp->_p != NULL)
108 1.1 cgd curoff += fp->_p - fp->_bf._base;
109 1.1 cgd
110 1.1 cgd offset += curoff;
111 1.1 cgd whence = SEEK_SET;
112 1.1 cgd havepos = 1;
113 1.1 cgd break;
114 1.1 cgd
115 1.1 cgd case SEEK_SET:
116 1.1 cgd case SEEK_END:
117 1.1 cgd curoff = 0; /* XXX just to keep gcc quiet */
118 1.1 cgd havepos = 0;
119 1.1 cgd break;
120 1.1 cgd
121 1.1 cgd default:
122 1.1 cgd errno = EINVAL;
123 1.1 cgd return (EOF);
124 1.1 cgd }
125 1.1 cgd
126 1.1 cgd /*
127 1.1 cgd * Can only optimise if:
128 1.1 cgd * reading (and not reading-and-writing);
129 1.1 cgd * not unbuffered; and
130 1.1 cgd * this is a `regular' Unix file (and hence seekfn==__sseek).
131 1.1 cgd * We must check __NBF first, because it is possible to have __NBF
132 1.1 cgd * and __SOPT both set.
133 1.1 cgd */
134 1.1 cgd if (fp->_bf._base == NULL)
135 1.1 cgd __smakebuf(fp);
136 1.1 cgd if (fp->_flags & (__SWR | __SRW | __SNBF | __SNPT))
137 1.1 cgd goto dumb;
138 1.1 cgd if ((fp->_flags & __SOPT) == 0) {
139 1.1 cgd if (seekfn != __sseek ||
140 1.1 cgd fp->_file < 0 || fstat(fp->_file, &st) ||
141 1.1 cgd (st.st_mode & S_IFMT) != S_IFREG) {
142 1.1 cgd fp->_flags |= __SNPT;
143 1.1 cgd goto dumb;
144 1.1 cgd }
145 1.1 cgd fp->_blksize = st.st_blksize;
146 1.1 cgd fp->_flags |= __SOPT;
147 1.1 cgd }
148 1.1 cgd
149 1.1 cgd /*
150 1.1 cgd * We are reading; we can try to optimise.
151 1.1 cgd * Figure out where we are going and where we are now.
152 1.1 cgd */
153 1.1 cgd if (whence == SEEK_SET)
154 1.1 cgd target = offset;
155 1.1 cgd else {
156 1.1 cgd if (fstat(fp->_file, &st))
157 1.1 cgd goto dumb;
158 1.1 cgd target = st.st_size + offset;
159 1.1 cgd }
160 1.1 cgd
161 1.1 cgd if (!havepos) {
162 1.1 cgd if (fp->_flags & __SOFF)
163 1.1 cgd curoff = fp->_offset;
164 1.1 cgd else {
165 1.7 jtc curoff = (*seekfn)(fp->_cookie, (fpos_t)0, SEEK_CUR);
166 1.1 cgd if (curoff == POS_ERR)
167 1.1 cgd goto dumb;
168 1.1 cgd }
169 1.1 cgd curoff -= fp->_r;
170 1.1 cgd if (HASUB(fp))
171 1.1 cgd curoff -= fp->_ur;
172 1.1 cgd }
173 1.1 cgd
174 1.1 cgd /*
175 1.1 cgd * Compute the number of bytes in the input buffer (pretending
176 1.1 cgd * that any ungetc() input has been discarded). Adjust current
177 1.1 cgd * offset backwards by this count so that it represents the
178 1.1 cgd * file offset for the first byte in the current input buffer.
179 1.1 cgd */
180 1.1 cgd if (HASUB(fp)) {
181 1.7 jtc curoff += fp->_r; /* kill off ungetc */
182 1.1 cgd n = fp->_up - fp->_bf._base;
183 1.1 cgd curoff -= n;
184 1.1 cgd n += fp->_ur;
185 1.1 cgd } else {
186 1.1 cgd n = fp->_p - fp->_bf._base;
187 1.1 cgd curoff -= n;
188 1.1 cgd n += fp->_r;
189 1.1 cgd }
190 1.1 cgd
191 1.1 cgd /*
192 1.1 cgd * If the target offset is within the current buffer,
193 1.1 cgd * simply adjust the pointers, clear EOF, undo ungetc(),
194 1.1 cgd * and return. (If the buffer was modified, we have to
195 1.6 cgd * skip this; see fgetln.c.)
196 1.1 cgd */
197 1.1 cgd if ((fp->_flags & __SMOD) == 0 &&
198 1.1 cgd target >= curoff && target < curoff + n) {
199 1.1 cgd register int o = target - curoff;
200 1.1 cgd
201 1.1 cgd fp->_p = fp->_bf._base + o;
202 1.1 cgd fp->_r = n - o;
203 1.1 cgd if (HASUB(fp))
204 1.1 cgd FREEUB(fp);
205 1.1 cgd fp->_flags &= ~__SEOF;
206 1.1 cgd return (0);
207 1.1 cgd }
208 1.1 cgd
209 1.1 cgd /*
210 1.1 cgd * The place we want to get to is not within the current buffer,
211 1.1 cgd * but we can still be kind to the kernel copyout mechanism.
212 1.1 cgd * By aligning the file offset to a block boundary, we can let
213 1.1 cgd * the kernel use the VM hardware to map pages instead of
214 1.1 cgd * copying bytes laboriously. Using a block boundary also
215 1.1 cgd * ensures that we only read one block, rather than two.
216 1.1 cgd */
217 1.1 cgd curoff = target & ~(fp->_blksize - 1);
218 1.1 cgd if ((*seekfn)(fp->_cookie, curoff, SEEK_SET) == POS_ERR)
219 1.1 cgd goto dumb;
220 1.1 cgd fp->_r = 0;
221 1.2 cgd fp->_p = fp->_bf._base;
222 1.1 cgd if (HASUB(fp))
223 1.1 cgd FREEUB(fp);
224 1.1 cgd fp->_flags &= ~__SEOF;
225 1.1 cgd n = target - curoff;
226 1.1 cgd if (n) {
227 1.1 cgd if (__srefill(fp) || fp->_r < n)
228 1.1 cgd goto dumb;
229 1.1 cgd fp->_p += n;
230 1.1 cgd fp->_r -= n;
231 1.1 cgd }
232 1.1 cgd return (0);
233 1.1 cgd
234 1.1 cgd /*
235 1.1 cgd * We get here if we cannot optimise the seek ... just
236 1.1 cgd * do it. Allow the seek function to change fp->_bf._base.
237 1.1 cgd */
238 1.1 cgd dumb:
239 1.1 cgd if (__sflush(fp) ||
240 1.7 jtc (*seekfn)(fp->_cookie, (fpos_t)offset, whence) == POS_ERR) {
241 1.1 cgd return (EOF);
242 1.1 cgd }
243 1.1 cgd /* success: clear EOF indicator and discard ungetc() data */
244 1.1 cgd if (HASUB(fp))
245 1.1 cgd FREEUB(fp);
246 1.1 cgd fp->_p = fp->_bf._base;
247 1.1 cgd fp->_r = 0;
248 1.1 cgd /* fp->_w = 0; */ /* unnecessary (I think...) */
249 1.1 cgd fp->_flags &= ~__SEOF;
250 1.1 cgd return (0);
251 1.1 cgd }
252