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