Home | History | Annotate | Line # | Download | only in gen
telldir.c revision 1.1
      1  1.1  cgd /*
      2  1.1  cgd  * Copyright (c) 1983 Regents of the University of California.
      3  1.1  cgd  * All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1  cgd  * modification, are permitted provided that the following conditions
      7  1.1  cgd  * are met:
      8  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1  cgd  *    must display the following acknowledgement:
     15  1.1  cgd  *	This product includes software developed by the University of
     16  1.1  cgd  *	California, Berkeley and its contributors.
     17  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1  cgd  *    may be used to endorse or promote products derived from this software
     19  1.1  cgd  *    without specific prior written permission.
     20  1.1  cgd  *
     21  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1  cgd  * SUCH DAMAGE.
     32  1.1  cgd  */
     33  1.1  cgd 
     34  1.1  cgd #if defined(LIBC_SCCS) && !defined(lint)
     35  1.1  cgd static char sccsid[] = "@(#)telldir.c	5.9 (Berkeley) 2/23/91";
     36  1.1  cgd #endif /* LIBC_SCCS and not lint */
     37  1.1  cgd 
     38  1.1  cgd #include <sys/param.h>
     39  1.1  cgd #include <dirent.h>
     40  1.1  cgd #include <stdlib.h>
     41  1.1  cgd #include <unistd.h>
     42  1.1  cgd 
     43  1.1  cgd /*
     44  1.1  cgd  * The option SINGLEUSE may be defined to say that a telldir
     45  1.1  cgd  * cookie may be used only once before it is freed. This option
     46  1.1  cgd  * is used to avoid having memory usage grow without bound.
     47  1.1  cgd  */
     48  1.1  cgd #define SINGLEUSE
     49  1.1  cgd 
     50  1.1  cgd /*
     51  1.1  cgd  * One of these structures is malloced to describe the current directory
     52  1.1  cgd  * position each time telldir is called. It records the current magic
     53  1.1  cgd  * cookie returned by getdirentries and the offset within the buffer
     54  1.1  cgd  * associated with that return value.
     55  1.1  cgd  */
     56  1.1  cgd struct ddloc {
     57  1.1  cgd 	struct	ddloc *loc_next;/* next structure in list */
     58  1.1  cgd 	long	loc_index;	/* key associated with structure */
     59  1.1  cgd 	long	loc_seek;	/* magic cookie returned by getdirentries */
     60  1.1  cgd 	long	loc_loc;	/* offset of entry in buffer */
     61  1.1  cgd };
     62  1.1  cgd 
     63  1.1  cgd #define	NDIRHASH	32	/* Num of hash lists, must be a power of 2 */
     64  1.1  cgd #define	LOCHASH(i)	((i)&(NDIRHASH-1))
     65  1.1  cgd 
     66  1.1  cgd static long	dd_loccnt;	/* Index of entry for sequential readdir's */
     67  1.1  cgd static struct	ddloc *dd_hash[NDIRHASH];   /* Hash list heads for ddlocs */
     68  1.1  cgd 
     69  1.1  cgd /*
     70  1.1  cgd  * return a pointer into a directory
     71  1.1  cgd  */
     72  1.1  cgd long
     73  1.1  cgd telldir(dirp)
     74  1.1  cgd 	const DIR *dirp;
     75  1.1  cgd {
     76  1.1  cgd 	register int index;
     77  1.1  cgd 	register struct ddloc *lp;
     78  1.1  cgd 
     79  1.1  cgd 	if ((lp = (struct ddloc *)malloc(sizeof(struct ddloc))) == NULL)
     80  1.1  cgd 		return (-1);
     81  1.1  cgd 	index = dd_loccnt++;
     82  1.1  cgd 	lp->loc_index = index;
     83  1.1  cgd 	lp->loc_seek = dirp->dd_seek;
     84  1.1  cgd 	lp->loc_loc = dirp->dd_loc;
     85  1.1  cgd 	lp->loc_next = dd_hash[LOCHASH(index)];
     86  1.1  cgd 	dd_hash[LOCHASH(index)] = lp;
     87  1.1  cgd 	return (index);
     88  1.1  cgd }
     89  1.1  cgd 
     90  1.1  cgd /*
     91  1.1  cgd  * seek to an entry in a directory.
     92  1.1  cgd  * Only values returned by "telldir" should be passed to seekdir.
     93  1.1  cgd  */
     94  1.1  cgd void
     95  1.1  cgd _seekdir(dirp, loc)
     96  1.1  cgd 	register DIR *dirp;
     97  1.1  cgd 	long loc;
     98  1.1  cgd {
     99  1.1  cgd 	register struct ddloc *lp;
    100  1.1  cgd 	register struct ddloc **prevlp;
    101  1.1  cgd 	struct dirent *dp;
    102  1.1  cgd 	extern long lseek();
    103  1.1  cgd 
    104  1.1  cgd 	prevlp = &dd_hash[LOCHASH(loc)];
    105  1.1  cgd 	lp = *prevlp;
    106  1.1  cgd 	while (lp != NULL) {
    107  1.1  cgd 		if (lp->loc_index == loc)
    108  1.1  cgd 			break;
    109  1.1  cgd 		prevlp = &lp->loc_next;
    110  1.1  cgd 		lp = lp->loc_next;
    111  1.1  cgd 	}
    112  1.1  cgd 	if (lp == NULL)
    113  1.1  cgd 		return;
    114  1.1  cgd 	if (lp->loc_loc == dirp->dd_loc && lp->loc_seek == dirp->dd_seek)
    115  1.1  cgd 		goto found;
    116  1.1  cgd 	(void) lseek(dirp->dd_fd, lp->loc_seek, 0);
    117  1.1  cgd 	dirp->dd_seek = lp->loc_seek;
    118  1.1  cgd 	dirp->dd_loc = 0;
    119  1.1  cgd 	while (dirp->dd_loc < lp->loc_loc) {
    120  1.1  cgd 		dp = readdir(dirp);
    121  1.1  cgd 		if (dp == NULL)
    122  1.1  cgd 			break;
    123  1.1  cgd 	}
    124  1.1  cgd found:
    125  1.1  cgd #ifdef SINGLEUSE
    126  1.1  cgd 	*prevlp = lp->loc_next;
    127  1.1  cgd 	free((caddr_t)lp);
    128  1.1  cgd #endif
    129  1.1  cgd }
    130