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