1 /* -*- linux-c -*- --------------------------------------------------------- *
3 * linux/fs/autofs/dirhash.c
5 * Copyright 1997-1998 Transmeta Corporation -- All Rights Reserved
7 * This file is part of the Linux kernel and is made available under
8 * the terms of the GNU General Public License, version 2, or at your
9 * option, any later version, incorporated herein by reference.
11 * ------------------------------------------------------------------------- */
15 /* Functions for maintenance of expiry queue */
17 static void autofs_init_usage(struct autofs_dirhash
*dh
,
18 struct autofs_dir_ent
*ent
)
20 list_add_tail(&ent
->exp
, &dh
->expiry_head
);
21 ent
->last_usage
= jiffies
;
24 static void autofs_delete_usage(struct autofs_dir_ent
*ent
)
29 void autofs_update_usage(struct autofs_dirhash
*dh
,
30 struct autofs_dir_ent
*ent
)
32 autofs_delete_usage(ent
); /* Unlink from current position */
33 autofs_init_usage(dh
,ent
); /* Relink at queue tail */
36 struct autofs_dir_ent
*autofs_expire(struct super_block
*sb
,
37 struct autofs_sb_info
*sbi
,
40 struct autofs_dirhash
*dh
= &sbi
->dirhash
;
41 struct autofs_dir_ent
*ent
;
42 struct dentry
*dentry
;
43 unsigned long timeout
= sbi
->exp_timeout
;
46 if ( list_empty(&dh
->expiry_head
) || sbi
->catatonic
)
47 return NULL
; /* No entries */
48 /* We keep the list sorted by last_usage and want old stuff */
49 ent
= list_entry(dh
->expiry_head
.next
, struct autofs_dir_ent
, exp
);
50 if (jiffies
- ent
->last_usage
< timeout
)
52 /* Move to end of list in case expiry isn't desirable */
53 autofs_update_usage(dh
, ent
);
55 /* Check to see that entry is expirable */
56 if ( ent
->ino
< AUTOFS_FIRST_DIR_INO
)
57 return ent
; /* Symlinks are always expirable */
59 /* Get the dentry for the autofs subdirectory */
63 /* Should only happen in catatonic mode */
64 printk("autofs: dentry == NULL but inode range is directory, entry %s\n", ent
->name
);
65 autofs_delete_usage(ent
);
69 if ( !dentry
->d_inode
) {
71 printk("autofs: negative dentry on expiry queue: %s\n",
73 autofs_delete_usage(ent
);
77 /* Make sure entry is mounted and unused; note that dentry will
78 point to the mounted-on-top root. */
79 if (!S_ISDIR(dentry
->d_inode
->i_mode
)||!d_mountpoint(dentry
)) {
80 DPRINTK(("autofs: not expirable (not a mounted directory): %s\n", ent
->name
));
85 if (!follow_down(&mnt
, &dentry
)) {
88 DPRINTK(("autofs: not expirable (not a mounted directory): %s\n", ent
->name
));
91 while (d_mountpoint(dentry
) && follow_down(&mnt
, &dentry
))
95 if ( may_umount(mnt
) ) {
97 DPRINTK(("autofs: signaling expire on %s\n", ent
->name
));
98 return ent
; /* Expirable! */
100 DPRINTK(("autofs: didn't expire due to may_umount: %s\n", ent
->name
));
103 return NULL
; /* No expirable entries */
106 void autofs_initialize_hash(struct autofs_dirhash
*dh
) {
107 memset(&dh
->h
, 0, AUTOFS_HASH_SIZE
*sizeof(struct autofs_dir_ent
*));
108 INIT_LIST_HEAD(&dh
->expiry_head
);
111 struct autofs_dir_ent
*autofs_hash_lookup(const struct autofs_dirhash
*dh
, struct qstr
*name
)
113 struct autofs_dir_ent
*dhn
;
115 DPRINTK(("autofs_hash_lookup: hash = 0x%08x, name = ", name
->hash
));
116 autofs_say(name
->name
,name
->len
);
118 for ( dhn
= dh
->h
[(unsigned) name
->hash
% AUTOFS_HASH_SIZE
] ; dhn
; dhn
= dhn
->next
) {
119 if ( name
->hash
== dhn
->hash
&&
120 name
->len
== dhn
->len
&&
121 !memcmp(name
->name
, dhn
->name
, name
->len
) )
128 void autofs_hash_insert(struct autofs_dirhash
*dh
, struct autofs_dir_ent
*ent
)
130 struct autofs_dir_ent
**dhnp
;
132 DPRINTK(("autofs_hash_insert: hash = 0x%08x, name = ", ent
->hash
));
133 autofs_say(ent
->name
,ent
->len
);
135 autofs_init_usage(dh
,ent
);
139 dhnp
= &dh
->h
[(unsigned) ent
->hash
% AUTOFS_HASH_SIZE
];
144 ent
->next
->back
= &(ent
->next
);
147 void autofs_hash_delete(struct autofs_dir_ent
*ent
)
149 *(ent
->back
) = ent
->next
;
151 ent
->next
->back
= ent
->back
;
153 autofs_delete_usage(ent
);
162 * Used by readdir(). We must validate "ptr", so we can't simply make it
163 * a pointer. Values below 0xffff are reserved; calling with any value
164 * <= 0x10000 will return the first entry found.
166 * "last" can be NULL or the value returned by the last search *if* we
167 * want the next sequential entry.
169 struct autofs_dir_ent
*autofs_hash_enum(const struct autofs_dirhash
*dh
,
170 off_t
*ptr
, struct autofs_dir_ent
*last
)
172 int bucket
, ecount
, i
;
173 struct autofs_dir_ent
*ent
;
175 bucket
= (*ptr
>> 16) - 1;
176 ecount
= *ptr
& 0xffff;
182 DPRINTK(("autofs_hash_enum: bucket %d, entry %d\n", bucket
, ecount
));
184 ent
= last
? last
->next
: NULL
;
189 while ( bucket
< AUTOFS_HASH_SIZE
) {
191 for ( i
= ecount
; ent
&& i
; i
-- )
195 ecount
++; /* Point to *next* entry */
199 bucket
++; ecount
= 0;
205 printk("autofs_hash_enum: nothing found\n");
207 printk("autofs_hash_enum: found hash %08x, name", ent
->hash
);
208 autofs_say(ent
->name
,ent
->len
);
212 *ptr
= ((bucket
+1) << 16) + ecount
;
216 /* Iterate over all the ents, and remove all dentry pointers. Used on
217 entering catatonic mode, in order to make the filesystem unmountable. */
218 void autofs_hash_dputall(struct autofs_dirhash
*dh
)
221 struct autofs_dir_ent
*ent
;
223 for ( i
= 0 ; i
< AUTOFS_HASH_SIZE
; i
++ ) {
224 for ( ent
= dh
->h
[i
] ; ent
; ent
= ent
->next
) {
233 /* Delete everything. This is used on filesystem destruction, so we
234 make no attempt to keep the pointers valid */
235 void autofs_hash_nuke(struct autofs_sb_info
*sbi
)
238 struct autofs_dir_ent
*ent
, *nent
;
240 for ( i
= 0 ; i
< AUTOFS_HASH_SIZE
; i
++ ) {
241 for ( ent
= sbi
->dirhash
.h
[i
] ; ent
; ent
= nent
) {