]> git.saurik.com Git - apple/xnu.git/blob - bsd/hfs/hfs_chash.c
xnu-1504.9.17.tar.gz
[apple/xnu.git] / bsd / hfs / hfs_chash.c
1 /*
2 * Copyright (c) 2002-2008 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
5 *
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
14 *
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
17 *
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
25 *
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
27 */
28
29 /*
30 * Copyright (c) 1982, 1986, 1989, 1991, 1993, 1995
31 * The Regents of the University of California. All rights reserved.
32 *
33 * Redistribution and use in source and binary forms, with or without
34 * modification, are permitted provided that the following conditions
35 * are met:
36 * 1. Redistributions of source code must retain the above copyright
37 * notice, this list of conditions and the following disclaimer.
38 * 2. Redistributions in binary form must reproduce the above copyright
39 * notice, this list of conditions and the following disclaimer in the
40 * documentation and/or other materials provided with the distribution.
41 * 3. All advertising materials mentioning features or use of this software
42 * must display the following acknowledgement:
43 * This product includes software developed by the University of
44 * California, Berkeley and its contributors.
45 * 4. Neither the name of the University nor the names of its contributors
46 * may be used to endorse or promote products derived from this software
47 * without specific prior written permission.
48 *
49 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
50 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
51 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
53 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
54 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
55 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
56 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
57 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
58 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
59 * SUCH DAMAGE.
60 *
61 * @(#)hfs_chash.c
62 * derived from @(#)ufs_ihash.c 8.7 (Berkeley) 5/17/95
63 */
64
65 #include <sys/param.h>
66 #include <sys/systm.h>
67 #include <sys/vnode.h>
68 #include <sys/kernel.h>
69 #include <sys/malloc.h>
70 #include <sys/proc.h>
71 #include <sys/queue.h>
72
73
74 #include "hfs.h" /* XXX bringup */
75 #include "hfs_cnode.h"
76
77 extern lck_attr_t * hfs_lock_attr;
78 extern lck_grp_t * hfs_mutex_group;
79 extern lck_grp_t * hfs_rwlock_group;
80
81 lck_grp_t * chash_lck_grp;
82 lck_grp_attr_t * chash_lck_grp_attr;
83 lck_attr_t * chash_lck_attr;
84
85
86 #define CNODEHASH(hfsmp, inum) (&hfsmp->hfs_cnodehashtbl[(inum) & hfsmp->hfs_cnodehash])
87
88
89 /*
90 * Initialize cnode hash table.
91 */
92 __private_extern__
93 void
94 hfs_chashinit()
95 {
96 chash_lck_grp_attr= lck_grp_attr_alloc_init();
97 chash_lck_grp = lck_grp_alloc_init("cnode_hash", chash_lck_grp_attr);
98 chash_lck_attr = lck_attr_alloc_init();
99 }
100
101 static void hfs_chash_lock(struct hfsmount *hfsmp)
102 {
103 lck_mtx_lock(&hfsmp->hfs_chash_mutex);
104 }
105
106 static void hfs_chash_lock_spin(struct hfsmount *hfsmp)
107 {
108 lck_mtx_lock_spin(&hfsmp->hfs_chash_mutex);
109 }
110
111 #ifdef i386
112 static void hfs_chash_lock_convert (struct hfsmount *hfsmp)
113 #else
114 static void hfs_chash_lock_convert (__unused struct hfsmount *hfsmp)
115 #endif
116 {
117 lck_mtx_convert_spin(&hfsmp->hfs_chash_mutex);
118 }
119
120 static void hfs_chash_unlock(struct hfsmount *hfsmp)
121 {
122 lck_mtx_unlock(&hfsmp->hfs_chash_mutex);
123 }
124
125 __private_extern__
126 void
127 hfs_chashinit_finish(struct hfsmount *hfsmp)
128 {
129 lck_mtx_init(&hfsmp->hfs_chash_mutex, chash_lck_grp, chash_lck_attr);
130
131 hfsmp->hfs_cnodehashtbl = hashinit(desiredvnodes / 4, M_HFSMNT, &hfsmp->hfs_cnodehash);
132 }
133
134 __private_extern__
135 void
136 hfs_delete_chash(struct hfsmount *hfsmp)
137 {
138 lck_mtx_destroy(&hfsmp->hfs_chash_mutex, chash_lck_grp);
139
140 FREE(hfsmp->hfs_cnodehashtbl, M_HFSMNT);
141 }
142
143
144 /*
145 * Use the device, inum pair to find the incore cnode.
146 *
147 * If it is in core, but locked, wait for it.
148 */
149 __private_extern__
150 struct vnode *
151 hfs_chash_getvnode(struct hfsmount *hfsmp, ino_t inum, int wantrsrc, int skiplock)
152 {
153 struct cnode *cp;
154 struct vnode *vp;
155 int error;
156 u_int32_t vid;
157
158 /*
159 * Go through the hash list
160 * If a cnode is in the process of being cleaned out or being
161 * allocated, wait for it to be finished and then try again.
162 */
163 loop:
164 hfs_chash_lock_spin(hfsmp);
165
166 for (cp = CNODEHASH(hfsmp, inum)->lh_first; cp; cp = cp->c_hash.le_next) {
167 if (cp->c_fileid != inum)
168 continue;
169 /* Wait if cnode is being created or reclaimed. */
170 if (ISSET(cp->c_hflag, H_ALLOC | H_TRANSIT | H_ATTACH)) {
171 SET(cp->c_hflag, H_WAITING);
172
173 (void) msleep(cp, &hfsmp->hfs_chash_mutex, PDROP | PINOD,
174 "hfs_chash_getvnode", 0);
175 goto loop;
176 }
177 /* Obtain the desired vnode. */
178 vp = wantrsrc ? cp->c_rsrc_vp : cp->c_vp;
179 if (vp == NULLVP)
180 goto exit;
181
182 vid = vnode_vid(vp);
183 hfs_chash_unlock(hfsmp);
184
185 if ((error = vnode_getwithvid(vp, vid))) {
186 /*
187 * If vnode is being reclaimed, or has
188 * already changed identity, no need to wait
189 */
190 return (NULL);
191 }
192 if (!skiplock && hfs_lock(cp, HFS_EXCLUSIVE_LOCK) != 0) {
193 vnode_put(vp);
194 return (NULL);
195 }
196
197 /*
198 * Skip cnodes that are not in the name space anymore
199 * we need to check with the cnode lock held because
200 * we may have blocked acquiring the vnode ref or the
201 * lock on the cnode which would allow the node to be
202 * unlinked
203 */
204 if (cp->c_flag & (C_NOEXISTS | C_DELETED)) {
205 if (!skiplock)
206 hfs_unlock(cp);
207 vnode_put(vp);
208
209 return (NULL);
210 }
211 return (vp);
212 }
213 exit:
214 hfs_chash_unlock(hfsmp);
215 return (NULL);
216 }
217
218
219 /*
220 * Use the device, fileid pair to snoop an incore cnode.
221 */
222 __private_extern__
223 int
224 hfs_chash_snoop(struct hfsmount *hfsmp, ino_t inum, int (*callout)(const struct cat_desc *,
225 const struct cat_attr *, void *), void * arg)
226 {
227 struct cnode *cp;
228 int result = ENOENT;
229
230 /*
231 * Go through the hash list
232 * If a cnode is in the process of being cleaned out or being
233 * allocated, wait for it to be finished and then try again.
234 */
235 hfs_chash_lock(hfsmp);
236
237 for (cp = CNODEHASH(hfsmp, inum)->lh_first; cp; cp = cp->c_hash.le_next) {
238 if (cp->c_fileid != inum)
239 continue;
240 /* Skip cnodes being created or reclaimed. */
241 if (!ISSET(cp->c_hflag, H_ALLOC | H_TRANSIT | H_ATTACH)) {
242 result = callout(&cp->c_desc, &cp->c_attr, arg);
243 }
244 break;
245 }
246 hfs_chash_unlock(hfsmp);
247
248 return (result);
249 }
250
251
252 /*
253 * Use the device, fileid pair to find the incore cnode.
254 * If no cnode if found one is created
255 *
256 * If it is in core, but locked, wait for it.
257 *
258 * If the cnode is C_DELETED, then return NULL since that
259 * inum is no longer valid for lookups (open-unlinked file).
260 */
261 __private_extern__
262 struct cnode *
263 hfs_chash_getcnode(struct hfsmount *hfsmp, ino_t inum, struct vnode **vpp, int wantrsrc, int skiplock)
264 {
265 struct cnode *cp;
266 struct cnode *ncp = NULL;
267 vnode_t vp;
268 u_int32_t vid;
269
270 /*
271 * Go through the hash list
272 * If a cnode is in the process of being cleaned out or being
273 * allocated, wait for it to be finished and then try again.
274 */
275 loop:
276 hfs_chash_lock_spin(hfsmp);
277
278 loop_with_lock:
279 for (cp = CNODEHASH(hfsmp, inum)->lh_first; cp; cp = cp->c_hash.le_next) {
280 if (cp->c_fileid != inum)
281 continue;
282 /*
283 * Wait if cnode is being created, attached to or reclaimed.
284 */
285 if (ISSET(cp->c_hflag, H_ALLOC | H_ATTACH | H_TRANSIT)) {
286 SET(cp->c_hflag, H_WAITING);
287
288 (void) msleep(cp, &hfsmp->hfs_chash_mutex, PINOD,
289 "hfs_chash_getcnode", 0);
290 goto loop_with_lock;
291 }
292 vp = wantrsrc ? cp->c_rsrc_vp : cp->c_vp;
293 if (vp == NULL) {
294 /*
295 * The desired vnode isn't there so tag the cnode.
296 */
297 SET(cp->c_hflag, H_ATTACH);
298
299 hfs_chash_unlock(hfsmp);
300 } else {
301 vid = vnode_vid(vp);
302
303 hfs_chash_unlock(hfsmp);
304
305 if (vnode_getwithvid(vp, vid))
306 goto loop;
307 }
308 if (ncp) {
309 /*
310 * someone else won the race to create
311 * this cnode and add it to the hash
312 * just dump our allocation
313 */
314 FREE_ZONE(ncp, sizeof(struct cnode), M_HFSNODE);
315 ncp = NULL;
316 }
317
318 if (!skiplock) {
319 hfs_lock(cp, HFS_FORCE_LOCK);
320 }
321
322 /*
323 * Skip cnodes that are not in the name space anymore
324 * we need to check with the cnode lock held because
325 * we may have blocked acquiring the vnode ref or the
326 * lock on the cnode which would allow the node to be
327 * unlinked.
328 *
329 * Don't return a cnode in this case since the inum
330 * is no longer valid for lookups.
331 */
332 if ((cp->c_flag & (C_NOEXISTS | C_DELETED)) && !wantrsrc) {
333 if (!skiplock)
334 hfs_unlock(cp);
335 if (vp != NULLVP) {
336 vnode_put(vp);
337 } else {
338 hfs_chash_lock_spin(hfsmp);
339 CLR(cp->c_hflag, H_ATTACH);
340 if (ISSET(cp->c_hflag, H_WAITING)) {
341 CLR(cp->c_hflag, H_WAITING);
342 wakeup((caddr_t)cp);
343 }
344 hfs_chash_unlock(hfsmp);
345 }
346 vp = NULL;
347 cp = NULL;
348 }
349 *vpp = vp;
350 return (cp);
351 }
352
353 /*
354 * Allocate a new cnode
355 */
356 if (skiplock && !wantrsrc)
357 panic("%s - should never get here when skiplock is set \n", __FUNCTION__);
358
359 if (ncp == NULL) {
360 hfs_chash_unlock(hfsmp);
361
362 MALLOC_ZONE(ncp, struct cnode *, sizeof(struct cnode), M_HFSNODE, M_WAITOK);
363 /*
364 * since we dropped the chash lock,
365 * we need to go back and re-verify
366 * that this node hasn't come into
367 * existence...
368 */
369 goto loop;
370 }
371 hfs_chash_lock_convert(hfsmp);
372
373 bzero(ncp, sizeof(struct cnode));
374 SET(ncp->c_hflag, H_ALLOC);
375 ncp->c_fileid = inum;
376 TAILQ_INIT(&ncp->c_hintlist); /* make the list empty */
377 TAILQ_INIT(&ncp->c_originlist);
378
379 lck_rw_init(&ncp->c_rwlock, hfs_rwlock_group, hfs_lock_attr);
380 if (!skiplock)
381 (void) hfs_lock(ncp, HFS_EXCLUSIVE_LOCK);
382
383 /* Insert the new cnode with it's H_ALLOC flag set */
384 LIST_INSERT_HEAD(CNODEHASH(hfsmp, inum), ncp, c_hash);
385 hfs_chash_unlock(hfsmp);
386
387 *vpp = NULL;
388 return (ncp);
389 }
390
391
392 __private_extern__
393 void
394 hfs_chashwakeup(struct hfsmount *hfsmp, struct cnode *cp, int hflags)
395 {
396 hfs_chash_lock_spin(hfsmp);
397
398 CLR(cp->c_hflag, hflags);
399
400 if (ISSET(cp->c_hflag, H_WAITING)) {
401 CLR(cp->c_hflag, H_WAITING);
402 wakeup((caddr_t)cp);
403 }
404 hfs_chash_unlock(hfsmp);
405 }
406
407
408 /*
409 * Re-hash two cnodes in the hash table.
410 */
411 __private_extern__
412 void
413 hfs_chash_rehash(struct hfsmount *hfsmp, struct cnode *cp1, struct cnode *cp2)
414 {
415 hfs_chash_lock_spin(hfsmp);
416
417 LIST_REMOVE(cp1, c_hash);
418 LIST_REMOVE(cp2, c_hash);
419 LIST_INSERT_HEAD(CNODEHASH(hfsmp, cp1->c_fileid), cp1, c_hash);
420 LIST_INSERT_HEAD(CNODEHASH(hfsmp, cp2->c_fileid), cp2, c_hash);
421
422 hfs_chash_unlock(hfsmp);
423 }
424
425
426 /*
427 * Remove a cnode from the hash table.
428 */
429 __private_extern__
430 int
431 hfs_chashremove(struct hfsmount *hfsmp, struct cnode *cp)
432 {
433 hfs_chash_lock_spin(hfsmp);
434
435 /* Check if a vnode is getting attached */
436 if (ISSET(cp->c_hflag, H_ATTACH)) {
437 hfs_chash_unlock(hfsmp);
438 return (EBUSY);
439 }
440 if (cp->c_hash.le_next || cp->c_hash.le_prev) {
441 LIST_REMOVE(cp, c_hash);
442 cp->c_hash.le_next = NULL;
443 cp->c_hash.le_prev = NULL;
444 }
445 hfs_chash_unlock(hfsmp);
446
447 return (0);
448 }
449
450 /*
451 * Remove a cnode from the hash table and wakeup any waiters.
452 */
453 __private_extern__
454 void
455 hfs_chash_abort(struct hfsmount *hfsmp, struct cnode *cp)
456 {
457 hfs_chash_lock_spin(hfsmp);
458
459 LIST_REMOVE(cp, c_hash);
460 cp->c_hash.le_next = NULL;
461 cp->c_hash.le_prev = NULL;
462
463 CLR(cp->c_hflag, H_ATTACH | H_ALLOC);
464 if (ISSET(cp->c_hflag, H_WAITING)) {
465 CLR(cp->c_hflag, H_WAITING);
466 wakeup((caddr_t)cp);
467 }
468 hfs_chash_unlock(hfsmp);
469 }
470
471
472 /*
473 * mark a cnode as in transition
474 */
475 __private_extern__
476 void
477 hfs_chash_mark_in_transit(struct hfsmount *hfsmp, struct cnode *cp)
478 {
479 hfs_chash_lock_spin(hfsmp);
480
481 SET(cp->c_hflag, H_TRANSIT);
482
483 hfs_chash_unlock(hfsmp);
484 }
485
486 /* Search a cnode in the hash. This function does not return cnode which
487 * are getting created, destroyed or in transition. Note that this function
488 * does not acquire the cnode hash mutex, and expects the caller to acquire it.
489 * On success, returns pointer to the cnode found. On failure, returns NULL.
490 */
491 static
492 struct cnode *
493 hfs_chash_search_cnid(struct hfsmount *hfsmp, cnid_t cnid)
494 {
495 struct cnode *cp;
496
497 for (cp = CNODEHASH(hfsmp, cnid)->lh_first; cp; cp = cp->c_hash.le_next) {
498 if (cp->c_fileid == cnid) {
499 break;
500 }
501 }
502
503 /* If cnode is being created or reclaimed, return error. */
504 if (cp && ISSET(cp->c_hflag, H_ALLOC | H_TRANSIT | H_ATTACH)) {
505 cp = NULL;
506 }
507
508 return cp;
509 }
510
511 /* Search a cnode corresponding to given device and ID in the hash. If the
512 * found cnode has kHFSHasChildLinkBit cleared, set it. If the cnode is not
513 * found, no new cnode is created and error is returned.
514 *
515 * Return values -
516 * -1 : The cnode was not found.
517 * 0 : The cnode was found, and the kHFSHasChildLinkBit was already set.
518 * 1 : The cnode was found, the kHFSHasChildLinkBit was not set, and the
519 * function had to set that bit.
520 */
521 __private_extern__
522 int
523 hfs_chash_set_childlinkbit(struct hfsmount *hfsmp, cnid_t cnid)
524 {
525 int retval = -1;
526 struct cnode *cp;
527
528 hfs_chash_lock_spin(hfsmp);
529
530 cp = hfs_chash_search_cnid(hfsmp, cnid);
531 if (cp) {
532 if (cp->c_attr.ca_recflags & kHFSHasChildLinkMask) {
533 retval = 0;
534 } else {
535 cp->c_attr.ca_recflags |= kHFSHasChildLinkMask;
536 retval = 1;
537 }
538 }
539 hfs_chash_unlock(hfsmp);
540
541 return retval;
542 }