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