Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* -*- c -*- --------------------------------------------------------------- * |
2 | * | |
3 | * linux/fs/autofs/expire.c | |
4 | * | |
5 | * Copyright 1997-1998 Transmeta Corporation -- All Rights Reserved | |
6 | * Copyright 1999-2000 Jeremy Fitzhardinge <jeremy@goop.org> | |
3a15e2ab | 7 | * Copyright 2001-2006 Ian Kent <raven@themaw.net> |
1da177e4 LT |
8 | * |
9 | * This file is part of the Linux kernel and is made available under | |
10 | * the terms of the GNU General Public License, version 2, or at your | |
11 | * option, any later version, incorporated herein by reference. | |
12 | * | |
13 | * ------------------------------------------------------------------------- */ | |
14 | ||
15 | #include "autofs_i.h" | |
16 | ||
17 | static unsigned long now; | |
18 | ||
1f5f2c30 | 19 | /* Check if a dentry can be expired */ |
1da177e4 LT |
20 | static inline int autofs4_can_expire(struct dentry *dentry, |
21 | unsigned long timeout, int do_now) | |
22 | { | |
23 | struct autofs_info *ino = autofs4_dentry_ino(dentry); | |
24 | ||
25 | /* dentry in the process of being deleted */ | |
26 | if (ino == NULL) | |
27 | return 0; | |
28 | ||
1da177e4 LT |
29 | if (!do_now) { |
30 | /* Too young to die */ | |
c0ba7e51 | 31 | if (!timeout || time_after(ino->last_used + timeout, now)) |
1da177e4 LT |
32 | return 0; |
33 | ||
34 | /* update last_used here :- | |
35 | - obviously makes sense if it is in use now | |
36 | - less obviously, prevents rapid-fire expire | |
37 | attempts if expire fails the first time */ | |
38 | ino->last_used = now; | |
39 | } | |
1da177e4 LT |
40 | return 1; |
41 | } | |
42 | ||
1f5f2c30 IK |
43 | /* Check a mount point for busyness */ |
44 | static int autofs4_mount_busy(struct vfsmount *mnt, struct dentry *dentry) | |
1da177e4 | 45 | { |
e0a7aae9 | 46 | struct dentry *top = dentry; |
9393bd07 | 47 | struct path path = {.mnt = mnt, .dentry = dentry}; |
1f5f2c30 | 48 | int status = 1; |
1da177e4 LT |
49 | |
50 | DPRINTK("dentry %p %.*s", | |
51 | dentry, (int)dentry->d_name.len, dentry->d_name.name); | |
52 | ||
9393bd07 | 53 | path_get(&path); |
1da177e4 | 54 | |
cc53ce53 | 55 | if (!follow_down_one(&path)) |
1da177e4 LT |
56 | goto done; |
57 | ||
9393bd07 AV |
58 | if (is_autofs4_dentry(path.dentry)) { |
59 | struct autofs_sb_info *sbi = autofs4_sbi(path.dentry->d_sb); | |
bc9c4068 IK |
60 | |
61 | /* This is an autofs submount, we can't expire it */ | |
a92daf6b | 62 | if (autofs_type_indirect(sbi->type)) |
bc9c4068 | 63 | goto done; |
bc9c4068 | 64 | } |
1da177e4 | 65 | |
e0a7aae9 | 66 | /* Update the expiry counter if fs is busy */ |
37d0892c | 67 | if (!may_umount_tree(path.mnt)) { |
e0a7aae9 IK |
68 | struct autofs_info *ino = autofs4_dentry_ino(top); |
69 | ino->last_used = jiffies; | |
70 | goto done; | |
71 | } | |
72 | ||
73 | status = 0; | |
1da177e4 LT |
74 | done: |
75 | DPRINTK("returning = %d", status); | |
9393bd07 | 76 | path_put(&path); |
1da177e4 LT |
77 | return status; |
78 | } | |
79 | ||
d4a85e35 IK |
80 | /* |
81 | * Calculate and dget next entry in the subdirs list under root. | |
82 | */ | |
83 | static struct dentry *get_next_positive_subdir(struct dentry *prev, | |
84 | struct dentry *root) | |
85 | { | |
e7854723 | 86 | struct autofs_sb_info *sbi = autofs4_sbi(root->d_sb); |
d4a85e35 | 87 | struct list_head *next; |
a45440f0 | 88 | struct dentry *q; |
d4a85e35 | 89 | |
e7854723 | 90 | spin_lock(&sbi->lookup_lock); |
a45440f0 | 91 | spin_lock(&root->d_lock); |
d4a85e35 | 92 | |
a45440f0 IK |
93 | if (prev) |
94 | next = prev->d_u.d_child.next; | |
95 | else { | |
d4a85e35 IK |
96 | prev = dget_dlock(root); |
97 | next = prev->d_subdirs.next; | |
d4a85e35 IK |
98 | } |
99 | ||
a45440f0 | 100 | cont: |
d4a85e35 | 101 | if (next == &root->d_subdirs) { |
a45440f0 | 102 | spin_unlock(&root->d_lock); |
e7854723 | 103 | spin_unlock(&sbi->lookup_lock); |
d4a85e35 IK |
104 | dput(prev); |
105 | return NULL; | |
106 | } | |
107 | ||
108 | q = list_entry(next, struct dentry, d_u.d_child); | |
109 | ||
110 | spin_lock_nested(&q->d_lock, DENTRY_D_LOCK_NESTED); | |
a45440f0 IK |
111 | /* Already gone or negative dentry (under construction) - try next */ |
112 | if (q->d_count == 0 || !simple_positive(q)) { | |
113 | spin_unlock(&q->d_lock); | |
114 | next = q->d_u.d_child.next; | |
115 | goto cont; | |
d4a85e35 IK |
116 | } |
117 | dget_dlock(q); | |
118 | spin_unlock(&q->d_lock); | |
a45440f0 | 119 | spin_unlock(&root->d_lock); |
e7854723 | 120 | spin_unlock(&sbi->lookup_lock); |
d4a85e35 IK |
121 | |
122 | dput(prev); | |
123 | ||
124 | return q; | |
125 | } | |
126 | ||
1ce12bad | 127 | /* |
2fd6b7f5 | 128 | * Calculate and dget next entry in top down tree traversal. |
1ce12bad | 129 | */ |
2fd6b7f5 NP |
130 | static struct dentry *get_next_positive_dentry(struct dentry *prev, |
131 | struct dentry *root) | |
1ce12bad | 132 | { |
e7854723 | 133 | struct autofs_sb_info *sbi = autofs4_sbi(root->d_sb); |
2fd6b7f5 NP |
134 | struct list_head *next; |
135 | struct dentry *p, *ret; | |
136 | ||
137 | if (prev == NULL) | |
c14cc63a | 138 | return dget(root); |
1ce12bad | 139 | |
e7854723 | 140 | spin_lock(&sbi->lookup_lock); |
2fd6b7f5 NP |
141 | relock: |
142 | p = prev; | |
143 | spin_lock(&p->d_lock); | |
144 | again: | |
145 | next = p->d_subdirs.next; | |
1ce12bad IK |
146 | if (next == &p->d_subdirs) { |
147 | while (1) { | |
2fd6b7f5 NP |
148 | struct dentry *parent; |
149 | ||
150 | if (p == root) { | |
151 | spin_unlock(&p->d_lock); | |
e7854723 | 152 | spin_unlock(&sbi->lookup_lock); |
2fd6b7f5 | 153 | dput(prev); |
1ce12bad | 154 | return NULL; |
2fd6b7f5 NP |
155 | } |
156 | ||
157 | parent = p->d_parent; | |
158 | if (!spin_trylock(&parent->d_lock)) { | |
159 | spin_unlock(&p->d_lock); | |
160 | cpu_relax(); | |
161 | goto relock; | |
162 | } | |
163 | spin_unlock(&p->d_lock); | |
1ce12bad | 164 | next = p->d_u.d_child.next; |
2fd6b7f5 NP |
165 | p = parent; |
166 | if (next != &parent->d_subdirs) | |
1ce12bad | 167 | break; |
1ce12bad IK |
168 | } |
169 | } | |
2fd6b7f5 NP |
170 | ret = list_entry(next, struct dentry, d_u.d_child); |
171 | ||
172 | spin_lock_nested(&ret->d_lock, DENTRY_D_LOCK_NESTED); | |
173 | /* Negative dentry - try next */ | |
174 | if (!simple_positive(ret)) { | |
c14cc63a | 175 | spin_unlock(&p->d_lock); |
1d6f2097 | 176 | lock_set_subclass(&ret->d_lock.dep_map, 0, _RET_IP_); |
2fd6b7f5 NP |
177 | p = ret; |
178 | goto again; | |
179 | } | |
180 | dget_dlock(ret); | |
181 | spin_unlock(&ret->d_lock); | |
182 | spin_unlock(&p->d_lock); | |
e7854723 | 183 | spin_unlock(&sbi->lookup_lock); |
2fd6b7f5 NP |
184 | |
185 | dput(prev); | |
186 | ||
187 | return ret; | |
1ce12bad IK |
188 | } |
189 | ||
3a15e2ab IK |
190 | /* |
191 | * Check a direct mount point for busyness. | |
192 | * Direct mounts have similar expiry semantics to tree mounts. | |
193 | * The tree is not busy iff no mountpoints are busy and there are no | |
194 | * autofs submounts. | |
195 | */ | |
196 | static int autofs4_direct_busy(struct vfsmount *mnt, | |
197 | struct dentry *top, | |
198 | unsigned long timeout, | |
199 | int do_now) | |
200 | { | |
201 | DPRINTK("top %p %.*s", | |
202 | top, (int) top->d_name.len, top->d_name.name); | |
203 | ||
3a15e2ab IK |
204 | /* If it's busy update the expiry counters */ |
205 | if (!may_umount_tree(mnt)) { | |
206 | struct autofs_info *ino = autofs4_dentry_ino(top); | |
207 | if (ino) | |
208 | ino->last_used = jiffies; | |
209 | return 1; | |
210 | } | |
211 | ||
212 | /* Timeout of a direct mount is determined by its top dentry */ | |
213 | if (!autofs4_can_expire(top, timeout, do_now)) | |
214 | return 1; | |
215 | ||
216 | return 0; | |
217 | } | |
218 | ||
1da177e4 LT |
219 | /* Check a directory tree of mount points for busyness |
220 | * The tree is not busy iff no mountpoints are busy | |
1da177e4 | 221 | */ |
1f5f2c30 IK |
222 | static int autofs4_tree_busy(struct vfsmount *mnt, |
223 | struct dentry *top, | |
224 | unsigned long timeout, | |
225 | int do_now) | |
1da177e4 | 226 | { |
e0a7aae9 | 227 | struct autofs_info *top_ino = autofs4_dentry_ino(top); |
1ce12bad | 228 | struct dentry *p; |
1da177e4 | 229 | |
1f5f2c30 | 230 | DPRINTK("top %p %.*s", |
1da177e4 LT |
231 | top, (int)top->d_name.len, top->d_name.name); |
232 | ||
233 | /* Negative dentry - give up */ | |
234 | if (!simple_positive(top)) | |
1f5f2c30 | 235 | return 1; |
1da177e4 | 236 | |
2fd6b7f5 NP |
237 | p = NULL; |
238 | while ((p = get_next_positive_dentry(p, top))) { | |
1da177e4 | 239 | DPRINTK("dentry %p %.*s", |
1ce12bad | 240 | p, (int) p->d_name.len, p->d_name.name); |
1da177e4 | 241 | |
1aff3c8b IK |
242 | /* |
243 | * Is someone visiting anywhere in the subtree ? | |
244 | * If there's no mount we need to check the usage | |
245 | * count for the autofs dentry. | |
e0a7aae9 | 246 | * If the fs is busy update the expiry counter. |
1aff3c8b | 247 | */ |
1ce12bad | 248 | if (d_mountpoint(p)) { |
1ce12bad | 249 | if (autofs4_mount_busy(mnt, p)) { |
e0a7aae9 | 250 | top_ino->last_used = jiffies; |
1ce12bad | 251 | dput(p); |
1f5f2c30 | 252 | return 1; |
1da177e4 | 253 | } |
1aff3c8b | 254 | } else { |
e0a7aae9 | 255 | struct autofs_info *ino = autofs4_dentry_ino(p); |
1aff3c8b IK |
256 | unsigned int ino_count = atomic_read(&ino->count); |
257 | ||
f9022f66 IK |
258 | /* |
259 | * Clean stale dentries below that have not been | |
260 | * invalidated after a mount fail during lookup | |
261 | */ | |
262 | d_invalidate(p); | |
263 | ||
1aff3c8b IK |
264 | /* allow for dget above and top is already dgot */ |
265 | if (p == top) | |
266 | ino_count += 2; | |
267 | else | |
268 | ino_count++; | |
269 | ||
b7ab39f6 | 270 | if (p->d_count > ino_count) { |
e0a7aae9 | 271 | top_ino->last_used = jiffies; |
1aff3c8b IK |
272 | dput(p); |
273 | return 1; | |
274 | } | |
1da177e4 | 275 | } |
1da177e4 | 276 | } |
1aff3c8b IK |
277 | |
278 | /* Timeout of a tree mount is ultimately determined by its top dentry */ | |
279 | if (!autofs4_can_expire(top, timeout, do_now)) | |
280 | return 1; | |
281 | ||
1f5f2c30 | 282 | return 0; |
1da177e4 LT |
283 | } |
284 | ||
285 | static struct dentry *autofs4_check_leaves(struct vfsmount *mnt, | |
286 | struct dentry *parent, | |
287 | unsigned long timeout, | |
288 | int do_now) | |
289 | { | |
1ce12bad | 290 | struct dentry *p; |
1da177e4 LT |
291 | |
292 | DPRINTK("parent %p %.*s", | |
293 | parent, (int)parent->d_name.len, parent->d_name.name); | |
294 | ||
2fd6b7f5 NP |
295 | p = NULL; |
296 | while ((p = get_next_positive_dentry(p, parent))) { | |
1da177e4 | 297 | DPRINTK("dentry %p %.*s", |
1ce12bad | 298 | p, (int) p->d_name.len, p->d_name.name); |
1da177e4 | 299 | |
1ce12bad | 300 | if (d_mountpoint(p)) { |
e0a7aae9 IK |
301 | /* Can we umount this guy */ |
302 | if (autofs4_mount_busy(mnt, p)) | |
2fd6b7f5 | 303 | continue; |
1da177e4 | 304 | |
e0a7aae9 IK |
305 | /* Can we expire this guy */ |
306 | if (autofs4_can_expire(p, timeout, do_now)) | |
1ce12bad | 307 | return p; |
1da177e4 | 308 | } |
1da177e4 | 309 | } |
1da177e4 LT |
310 | return NULL; |
311 | } | |
312 | ||
3a15e2ab | 313 | /* Check if we can expire a direct mount (possibly a tree) */ |
8d7b48e0 IK |
314 | struct dentry *autofs4_expire_direct(struct super_block *sb, |
315 | struct vfsmount *mnt, | |
316 | struct autofs_sb_info *sbi, | |
317 | int how) | |
3a15e2ab IK |
318 | { |
319 | unsigned long timeout; | |
320 | struct dentry *root = dget(sb->s_root); | |
321 | int do_now = how & AUTOFS_EXP_IMMEDIATE; | |
b5b80177 | 322 | struct autofs_info *ino; |
3a15e2ab | 323 | |
c0ba7e51 | 324 | if (!root) |
3a15e2ab IK |
325 | return NULL; |
326 | ||
327 | now = jiffies; | |
328 | timeout = sbi->exp_timeout; | |
329 | ||
3a15e2ab | 330 | spin_lock(&sbi->fs_lock); |
b5b80177 IK |
331 | ino = autofs4_dentry_ino(root); |
332 | /* No point expiring a pending mount */ | |
f9398c23 IK |
333 | if (ino->flags & AUTOFS_INF_PENDING) |
334 | goto out; | |
3a15e2ab IK |
335 | if (!autofs4_direct_busy(mnt, root, timeout, do_now)) { |
336 | struct autofs_info *ino = autofs4_dentry_ino(root); | |
3a15e2ab | 337 | ino->flags |= AUTOFS_INF_EXPIRING; |
6e60a9ab | 338 | init_completion(&ino->expire_complete); |
3a15e2ab IK |
339 | spin_unlock(&sbi->fs_lock); |
340 | return root; | |
341 | } | |
f9398c23 | 342 | out: |
3a15e2ab IK |
343 | spin_unlock(&sbi->fs_lock); |
344 | dput(root); | |
345 | ||
346 | return NULL; | |
347 | } | |
348 | ||
1da177e4 LT |
349 | /* |
350 | * Find an eligible tree to time-out | |
351 | * A tree is eligible if :- | |
352 | * - it is unused by any user process | |
353 | * - it has been unused for exp_timeout time | |
354 | */ | |
8d7b48e0 IK |
355 | struct dentry *autofs4_expire_indirect(struct super_block *sb, |
356 | struct vfsmount *mnt, | |
357 | struct autofs_sb_info *sbi, | |
358 | int how) | |
1da177e4 LT |
359 | { |
360 | unsigned long timeout; | |
361 | struct dentry *root = sb->s_root; | |
2fd6b7f5 | 362 | struct dentry *dentry; |
1da177e4 | 363 | struct dentry *expired = NULL; |
1da177e4 LT |
364 | int do_now = how & AUTOFS_EXP_IMMEDIATE; |
365 | int exp_leaves = how & AUTOFS_EXP_LEAVES; | |
97e7449a IK |
366 | struct autofs_info *ino; |
367 | unsigned int ino_count; | |
1da177e4 | 368 | |
c0ba7e51 | 369 | if (!root) |
1da177e4 LT |
370 | return NULL; |
371 | ||
372 | now = jiffies; | |
373 | timeout = sbi->exp_timeout; | |
374 | ||
2fd6b7f5 | 375 | dentry = NULL; |
d4a85e35 | 376 | while ((dentry = get_next_positive_subdir(dentry, root))) { |
97e7449a IK |
377 | spin_lock(&sbi->fs_lock); |
378 | ino = autofs4_dentry_ino(dentry); | |
b5b80177 IK |
379 | /* No point expiring a pending mount */ |
380 | if (ino->flags & AUTOFS_INF_PENDING) | |
3c319985 | 381 | goto next; |
97e7449a | 382 | |
3a15e2ab IK |
383 | /* |
384 | * Case 1: (i) indirect mount or top level pseudo direct mount | |
385 | * (autofs-4.1). | |
386 | * (ii) indirect mount with offset mount, check the "/" | |
387 | * offset (autofs-5.0+). | |
388 | */ | |
1da177e4 LT |
389 | if (d_mountpoint(dentry)) { |
390 | DPRINTK("checking mountpoint %p %.*s", | |
391 | dentry, (int)dentry->d_name.len, dentry->d_name.name); | |
392 | ||
e0a7aae9 IK |
393 | /* Can we umount this guy */ |
394 | if (autofs4_mount_busy(mnt, dentry)) | |
1da177e4 LT |
395 | goto next; |
396 | ||
e0a7aae9 IK |
397 | /* Can we expire this guy */ |
398 | if (autofs4_can_expire(dentry, timeout, do_now)) { | |
1da177e4 | 399 | expired = dentry; |
afec570c | 400 | goto found; |
1da177e4 LT |
401 | } |
402 | goto next; | |
403 | } | |
404 | ||
1f5f2c30 | 405 | if (simple_empty(dentry)) |
1da177e4 LT |
406 | goto next; |
407 | ||
408 | /* Case 2: tree mount, expire iff entire tree is not busy */ | |
409 | if (!exp_leaves) { | |
97e7449a IK |
410 | /* Path walk currently on this dentry? */ |
411 | ino_count = atomic_read(&ino->count) + 1; | |
b7ab39f6 | 412 | if (dentry->d_count > ino_count) |
97e7449a | 413 | goto next; |
3a9720ce | 414 | |
97e7449a | 415 | if (!autofs4_tree_busy(mnt, dentry, timeout, do_now)) { |
3a9720ce | 416 | expired = dentry; |
afec570c | 417 | goto found; |
1da177e4 | 418 | } |
3a15e2ab IK |
419 | /* |
420 | * Case 3: pseudo direct mount, expire individual leaves | |
421 | * (autofs-4.1). | |
422 | */ | |
1da177e4 | 423 | } else { |
97e7449a IK |
424 | /* Path walk currently on this dentry? */ |
425 | ino_count = atomic_read(&ino->count) + 1; | |
b7ab39f6 | 426 | if (dentry->d_count > ino_count) |
97e7449a IK |
427 | goto next; |
428 | ||
1da177e4 LT |
429 | expired = autofs4_check_leaves(mnt, dentry, timeout, do_now); |
430 | if (expired) { | |
431 | dput(dentry); | |
afec570c | 432 | goto found; |
1da177e4 LT |
433 | } |
434 | } | |
435 | next: | |
97e7449a | 436 | spin_unlock(&sbi->fs_lock); |
1da177e4 | 437 | } |
1da177e4 | 438 | return NULL; |
afec570c IK |
439 | |
440 | found: | |
441 | DPRINTK("returning %p %.*s", | |
442 | expired, (int)expired->d_name.len, expired->d_name.name); | |
97e7449a IK |
443 | ino = autofs4_dentry_ino(expired); |
444 | ino->flags |= AUTOFS_INF_EXPIRING; | |
6e60a9ab | 445 | init_completion(&ino->expire_complete); |
97e7449a | 446 | spin_unlock(&sbi->fs_lock); |
e7854723 | 447 | spin_lock(&sbi->lookup_lock); |
2fd6b7f5 NP |
448 | spin_lock(&expired->d_parent->d_lock); |
449 | spin_lock_nested(&expired->d_lock, DENTRY_D_LOCK_NESTED); | |
afec570c | 450 | list_move(&expired->d_parent->d_subdirs, &expired->d_u.d_child); |
2fd6b7f5 NP |
451 | spin_unlock(&expired->d_lock); |
452 | spin_unlock(&expired->d_parent->d_lock); | |
e7854723 | 453 | spin_unlock(&sbi->lookup_lock); |
afec570c | 454 | return expired; |
1da177e4 LT |
455 | } |
456 | ||
06a35985 IK |
457 | int autofs4_expire_wait(struct dentry *dentry) |
458 | { | |
459 | struct autofs_sb_info *sbi = autofs4_sbi(dentry->d_sb); | |
460 | struct autofs_info *ino = autofs4_dentry_ino(dentry); | |
461 | int status; | |
462 | ||
463 | /* Block on any pending expire */ | |
464 | spin_lock(&sbi->fs_lock); | |
465 | if (ino->flags & AUTOFS_INF_EXPIRING) { | |
466 | spin_unlock(&sbi->fs_lock); | |
467 | ||
468 | DPRINTK("waiting for expire %p name=%.*s", | |
469 | dentry, dentry->d_name.len, dentry->d_name.name); | |
470 | ||
471 | status = autofs4_wait(sbi, dentry, NFY_NONE); | |
472 | wait_for_completion(&ino->expire_complete); | |
473 | ||
474 | DPRINTK("expire done status=%d", status); | |
475 | ||
4b1ae27a | 476 | if (d_unhashed(dentry)) |
06a35985 IK |
477 | return -EAGAIN; |
478 | ||
479 | return status; | |
480 | } | |
481 | spin_unlock(&sbi->fs_lock); | |
482 | ||
483 | return 0; | |
484 | } | |
485 | ||
1da177e4 LT |
486 | /* Perform an expiry operation */ |
487 | int autofs4_expire_run(struct super_block *sb, | |
488 | struct vfsmount *mnt, | |
489 | struct autofs_sb_info *sbi, | |
490 | struct autofs_packet_expire __user *pkt_p) | |
491 | { | |
492 | struct autofs_packet_expire pkt; | |
97e7449a | 493 | struct autofs_info *ino; |
1da177e4 | 494 | struct dentry *dentry; |
97e7449a | 495 | int ret = 0; |
1da177e4 LT |
496 | |
497 | memset(&pkt,0,sizeof pkt); | |
498 | ||
499 | pkt.hdr.proto_version = sbi->version; | |
500 | pkt.hdr.type = autofs_ptype_expire; | |
501 | ||
3a15e2ab | 502 | if ((dentry = autofs4_expire_indirect(sb, mnt, sbi, 0)) == NULL) |
1da177e4 LT |
503 | return -EAGAIN; |
504 | ||
505 | pkt.len = dentry->d_name.len; | |
506 | memcpy(pkt.name, dentry->d_name.name, pkt.len); | |
507 | pkt.name[pkt.len] = '\0'; | |
508 | dput(dentry); | |
509 | ||
510 | if ( copy_to_user(pkt_p, &pkt, sizeof(struct autofs_packet_expire)) ) | |
97e7449a | 511 | ret = -EFAULT; |
1da177e4 | 512 | |
97e7449a IK |
513 | spin_lock(&sbi->fs_lock); |
514 | ino = autofs4_dentry_ino(dentry); | |
515 | ino->flags &= ~AUTOFS_INF_EXPIRING; | |
6e60a9ab | 516 | complete_all(&ino->expire_complete); |
97e7449a IK |
517 | spin_unlock(&sbi->fs_lock); |
518 | ||
519 | return ret; | |
1da177e4 LT |
520 | } |
521 | ||
56fcef75 IK |
522 | int autofs4_do_expire_multi(struct super_block *sb, struct vfsmount *mnt, |
523 | struct autofs_sb_info *sbi, int when) | |
1da177e4 LT |
524 | { |
525 | struct dentry *dentry; | |
526 | int ret = -EAGAIN; | |
1da177e4 | 527 | |
a92daf6b | 528 | if (autofs_type_trigger(sbi->type)) |
56fcef75 | 529 | dentry = autofs4_expire_direct(sb, mnt, sbi, when); |
3a15e2ab | 530 | else |
56fcef75 | 531 | dentry = autofs4_expire_indirect(sb, mnt, sbi, when); |
3a15e2ab IK |
532 | |
533 | if (dentry) { | |
1f5f2c30 | 534 | struct autofs_info *ino = autofs4_dentry_ino(dentry); |
1da177e4 LT |
535 | |
536 | /* This is synchronous because it makes the daemon a | |
537 | little easier */ | |
1da177e4 | 538 | ret = autofs4_wait(sbi, dentry, NFY_EXPIRE); |
6e60a9ab | 539 | |
97e7449a | 540 | spin_lock(&sbi->fs_lock); |
1f5f2c30 | 541 | ino->flags &= ~AUTOFS_INF_EXPIRING; |
6e60a9ab | 542 | complete_all(&ino->expire_complete); |
97e7449a | 543 | spin_unlock(&sbi->fs_lock); |
1da177e4 LT |
544 | dput(dentry); |
545 | } | |
1f5f2c30 | 546 | |
1da177e4 LT |
547 | return ret; |
548 | } | |
549 | ||
56fcef75 IK |
550 | /* Call repeatedly until it returns -EAGAIN, meaning there's nothing |
551 | more to be done */ | |
552 | int autofs4_expire_multi(struct super_block *sb, struct vfsmount *mnt, | |
553 | struct autofs_sb_info *sbi, int __user *arg) | |
554 | { | |
555 | int do_now = 0; | |
556 | ||
557 | if (arg && get_user(do_now, arg)) | |
558 | return -EFAULT; | |
559 | ||
560 | return autofs4_do_expire_multi(sb, mnt, sbi, do_now); | |
561 | } | |
562 |