]>
Commit | Line | Data |
---|---|---|
224c7076 A |
1 | /* |
2 | * Copyright (c) 1983, 1993 | |
3 | * The Regents of the University of California. All rights reserved. | |
4 | * | |
5 | * Redistribution and use in source and binary forms, with or without | |
6 | * modification, are permitted provided that the following conditions | |
7 | * are met: | |
8 | * 1. Redistributions of source code must retain the above copyright | |
9 | * notice, this list of conditions and the following disclaimer. | |
10 | * 2. Redistributions in binary form must reproduce the above copyright | |
11 | * notice, this list of conditions and the following disclaimer in the | |
12 | * documentation and/or other materials provided with the distribution. | |
13 | * 3. All advertising materials mentioning features or use of this software | |
14 | * must display the following acknowledgement: | |
15 | * This product includes software developed by the University of | |
16 | * California, Berkeley and its contributors. | |
17 | * 4. Neither the name of the University nor the names of its contributors | |
18 | * may be used to endorse or promote products derived from this software | |
19 | * without specific prior written permission. | |
20 | * | |
21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
31 | * SUCH DAMAGE. | |
32 | */ | |
33 | ||
34 | #if defined(LIBC_SCCS) && !defined(lint) | |
35 | static char sccsid[] = "@(#)telldir.c 8.1 (Berkeley) 6/4/93"; | |
36 | #endif /* LIBC_SCCS and not lint */ | |
37 | #include <sys/cdefs.h> | |
38 | __FBSDID("$FreeBSD: src/lib/libc/gen/telldir.c,v 1.8 2002/02/01 00:57:29 obrien Exp $"); | |
39 | ||
40 | #include "namespace.h" | |
41 | #include <sys/param.h> | |
42 | #include <sys/queue.h> | |
43 | #include <dirent.h> | |
44 | #include <pthread.h> | |
45 | #include <stdlib.h> | |
46 | #include <unistd.h> | |
47 | #include "un-namespace.h" | |
48 | ||
49 | #include "libc_private.h" | |
50 | #include "telldir.h" | |
51 | ||
52 | /* | |
53 | * The option SINGLEUSE may be defined to say that a telldir | |
54 | * cookie may be used only once before it is freed. This option | |
55 | * is used to avoid having memory usage grow without bound. | |
56 | */ | |
57 | #if !__DARWIN_UNIX03 | |
58 | #define SINGLEUSE | |
59 | #endif /* !__DARWIN_UNIX03 */ | |
60 | ||
61 | /* | |
62 | * return a pointer into a directory | |
63 | */ | |
64 | long | |
65 | telldir(dirp) | |
66 | DIR *dirp; | |
67 | { | |
68 | struct ddloc *lp; | |
69 | ||
70 | #if __DARWIN_UNIX03 | |
71 | if (__isthreaded) | |
72 | _pthread_mutex_lock((pthread_mutex_t *)&dirp->dd_lock); | |
73 | LIST_FOREACH(lp, &dirp->dd_td->td_locq, loc_lqe) { | |
74 | if ( | |
75 | #if __DARWIN_64_BIT_INO_T | |
76 | (lp->loc_seek == dirp->dd_td->seekoff) | |
77 | #else /* !__DARWIN_64_BIT_INO_T */ | |
78 | (lp->loc_seek == dirp->dd_seek) | |
79 | #endif /* __DARWIN_64_BIT_INO_T */ | |
80 | && (lp->loc_loc == dirp->dd_loc)) | |
81 | goto found; | |
82 | } | |
83 | if ((lp = (struct ddloc *)malloc(sizeof(struct ddloc))) == NULL) { | |
84 | if (__isthreaded) | |
85 | _pthread_mutex_unlock((pthread_mutex_t *)&dirp->dd_lock); | |
86 | return (-1); | |
87 | } | |
88 | #else /* !__DARWIN_UNIX03 */ | |
89 | if ((lp = (struct ddloc *)malloc(sizeof(struct ddloc))) == NULL) | |
90 | return (-1); | |
91 | if (__isthreaded) | |
92 | _pthread_mutex_lock((pthread_mutex_t *)&dirp->dd_lock); | |
93 | #endif /* __DARWIN_UNIX03 */ | |
94 | lp->loc_index = dirp->dd_td->td_loccnt++; | |
95 | #if __DARWIN_64_BIT_INO_T | |
96 | lp->loc_seek = dirp->dd_td->seekoff; | |
97 | #else /* !__DARWIN_64_BIT_INO_T */ | |
98 | lp->loc_seek = dirp->dd_seek; | |
99 | #endif /* __DARWIN_64_BIT_INO_T */ | |
100 | lp->loc_loc = dirp->dd_loc; | |
101 | LIST_INSERT_HEAD(&dirp->dd_td->td_locq, lp, loc_lqe); | |
102 | #if __DARWIN_UNIX03 | |
103 | found: | |
104 | #endif /* __DARWIN_UNIX03 */ | |
105 | if (__isthreaded) | |
106 | _pthread_mutex_unlock((pthread_mutex_t *)&dirp->dd_lock); | |
107 | return (lp->loc_index); | |
108 | } | |
109 | ||
110 | /* | |
111 | * seek to an entry in a directory. | |
112 | * Only values returned by "telldir" should be passed to seekdir. | |
113 | */ | |
114 | void | |
115 | _seekdir(dirp, loc) | |
116 | DIR *dirp; | |
117 | long loc; | |
118 | { | |
119 | struct ddloc *lp; | |
120 | struct dirent *dp; | |
121 | ||
122 | LIST_FOREACH(lp, &dirp->dd_td->td_locq, loc_lqe) { | |
123 | if (lp->loc_index == loc) | |
124 | break; | |
125 | } | |
126 | if (lp == NULL) | |
127 | return; | |
128 | if (lp->loc_loc == dirp->dd_loc && | |
129 | #if __DARWIN_64_BIT_INO_T | |
130 | lp->loc_seek == dirp->dd_td->seekoff | |
131 | #else /* !__DARWIN_64_BIT_INO_T */ | |
132 | lp->loc_seek == dirp->dd_seek | |
133 | #endif /* __DARWIN_64_BIT_INO_T */ | |
134 | ) | |
135 | goto found; | |
136 | (void) lseek(dirp->dd_fd, (off_t)lp->loc_seek, SEEK_SET); | |
137 | #if __DARWIN_64_BIT_INO_T | |
138 | dirp->dd_td->seekoff = lp->loc_seek; | |
139 | #else /* !__DARWIN_64_BIT_INO_T */ | |
140 | dirp->dd_seek = lp->loc_seek; | |
141 | #endif /* __DARWIN_64_BIT_INO_T */ | |
142 | dirp->dd_loc = 0; | |
143 | while (dirp->dd_loc < lp->loc_loc) { | |
144 | dp = _readdir_unlocked(dirp); | |
145 | if (dp == NULL) | |
146 | break; | |
147 | } | |
148 | found:; | |
149 | #ifdef SINGLEUSE | |
150 | LIST_REMOVE(lp, loc_lqe); | |
151 | free((caddr_t)lp); | |
152 | #endif | |
153 | } | |
154 | ||
155 | #ifndef BUILDING_VARIANT | |
156 | /* | |
157 | * Reclaim memory for telldir cookies which weren't used. | |
158 | */ | |
159 | void | |
160 | _reclaim_telldir(dirp) | |
161 | DIR *dirp; | |
162 | { | |
163 | struct ddloc *lp; | |
164 | struct ddloc *templp; | |
165 | ||
166 | lp = LIST_FIRST(&dirp->dd_td->td_locq); | |
167 | while (lp != NULL) { | |
168 | templp = lp; | |
169 | lp = LIST_NEXT(lp, loc_lqe); | |
170 | free(templp); | |
171 | } | |
172 | LIST_INIT(&dirp->dd_td->td_locq); | |
173 | } | |
174 | #endif /* !BUILDING_VARIANT */ |