2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1989, 1993
5 * The Regents of the University of California. All rights reserved.
6 * (c) UNIX System Laboratories, Inc.
7 * All or some portions of this file are derived from material licensed
8 * to the University of California by American Telephone and Telegraph
9 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
10 * the permission of UNIX System Laboratories, Inc.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)vfs_subr.c 8.31 (Berkeley) 5/26/95
40 * External virtual filesystem routines
43 #include <sys/cdefs.h>
44 __FBSDID("$FreeBSD$");
46 #include "opt_compat.h"
48 #include "opt_watchdog.h"
50 #include <sys/param.h>
51 #include <sys/systm.h>
54 #include <sys/condvar.h>
56 #include <sys/counter.h>
57 #include <sys/dirent.h>
58 #include <sys/event.h>
59 #include <sys/eventhandler.h>
60 #include <sys/extattr.h>
62 #include <sys/fcntl.h>
65 #include <sys/kernel.h>
66 #include <sys/kthread.h>
67 #include <sys/lockf.h>
68 #include <sys/malloc.h>
69 #include <sys/mount.h>
70 #include <sys/namei.h>
71 #include <sys/pctrie.h>
73 #include <sys/reboot.h>
74 #include <sys/refcount.h>
75 #include <sys/rwlock.h>
76 #include <sys/sched.h>
77 #include <sys/sleepqueue.h>
80 #include <sys/sysctl.h>
81 #include <sys/syslog.h>
82 #include <sys/vmmeter.h>
83 #include <sys/vnode.h>
84 #include <sys/watchdog.h>
86 #include <machine/stdarg.h>
88 #include <security/mac/mac_framework.h>
91 #include <vm/vm_object.h>
92 #include <vm/vm_extern.h>
94 #include <vm/vm_map.h>
95 #include <vm/vm_page.h>
96 #include <vm/vm_kern.h>
103 static void delmntque(struct vnode *vp);
104 static int flushbuflist(struct bufv *bufv, int flags, struct bufobj *bo,
105 int slpflag, int slptimeo);
106 static void syncer_shutdown(void *arg, int howto);
107 static int vtryrecycle(struct vnode *vp);
108 static void v_init_counters(struct vnode *);
109 static void v_incr_usecount(struct vnode *);
110 static void v_incr_usecount_locked(struct vnode *);
111 static void v_incr_devcount(struct vnode *);
112 static void v_decr_devcount(struct vnode *);
113 static void vgonel(struct vnode *);
114 static void vfs_knllock(void *arg);
115 static void vfs_knlunlock(void *arg);
116 static void vfs_knl_assert_locked(void *arg);
117 static void vfs_knl_assert_unlocked(void *arg);
118 static void vnlru_return_batches(struct vfsops *mnt_op);
119 static void destroy_vpollinfo(struct vpollinfo *vi);
122 * Number of vnodes in existence. Increased whenever getnewvnode()
123 * allocates a new vnode, decreased in vdropl() for VI_DOOMED vnode.
125 static unsigned long numvnodes;
127 SYSCTL_ULONG(_vfs, OID_AUTO, numvnodes, CTLFLAG_RD, &numvnodes, 0,
128 "Number of vnodes in existence");
130 static counter_u64_t vnodes_created;
131 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, vnodes_created, CTLFLAG_RD, &vnodes_created,
132 "Number of vnodes created by getnewvnode");
134 static u_long mnt_free_list_batch = 128;
135 SYSCTL_ULONG(_vfs, OID_AUTO, mnt_free_list_batch, CTLFLAG_RW,
136 &mnt_free_list_batch, 0, "Limit of vnodes held on mnt's free list");
139 * Conversion tables for conversion from vnode types to inode formats
142 enum vtype iftovt_tab[16] = {
143 VNON, VFIFO, VCHR, VNON, VDIR, VNON, VBLK, VNON,
144 VREG, VNON, VLNK, VNON, VSOCK, VNON, VNON, VBAD,
146 int vttoif_tab[10] = {
147 0, S_IFREG, S_IFDIR, S_IFBLK, S_IFCHR, S_IFLNK,
148 S_IFSOCK, S_IFIFO, S_IFMT, S_IFMT
152 * List of vnodes that are ready for recycling.
154 static TAILQ_HEAD(freelst, vnode) vnode_free_list;
157 * "Free" vnode target. Free vnodes are rarely completely free, but are
158 * just ones that are cheap to recycle. Usually they are for files which
159 * have been stat'd but not read; these usually have inode and namecache
160 * data attached to them. This target is the preferred minimum size of a
161 * sub-cache consisting mostly of such files. The system balances the size
162 * of this sub-cache with its complement to try to prevent either from
163 * thrashing while the other is relatively inactive. The targets express
164 * a preference for the best balance.
166 * "Above" this target there are 2 further targets (watermarks) related
167 * to recyling of free vnodes. In the best-operating case, the cache is
168 * exactly full, the free list has size between vlowat and vhiwat above the
169 * free target, and recycling from it and normal use maintains this state.
170 * Sometimes the free list is below vlowat or even empty, but this state
171 * is even better for immediate use provided the cache is not full.
172 * Otherwise, vnlru_proc() runs to reclaim enough vnodes (usually non-free
173 * ones) to reach one of these states. The watermarks are currently hard-
174 * coded as 4% and 9% of the available space higher. These and the default
175 * of 25% for wantfreevnodes are too large if the memory size is large.
176 * E.g., 9% of 75% of MAXVNODES is more than 566000 vnodes to reclaim
177 * whenever vnlru_proc() becomes active.
179 static u_long wantfreevnodes;
180 SYSCTL_ULONG(_vfs, OID_AUTO, wantfreevnodes, CTLFLAG_RW,
181 &wantfreevnodes, 0, "Target for minimum number of \"free\" vnodes");
182 static u_long freevnodes;
183 SYSCTL_ULONG(_vfs, OID_AUTO, freevnodes, CTLFLAG_RD,
184 &freevnodes, 0, "Number of \"free\" vnodes");
186 static counter_u64_t recycles_count;
187 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, recycles, CTLFLAG_RD, &recycles_count,
188 "Number of vnodes recycled to meet vnode cache targets");
191 * Various variables used for debugging the new implementation of
193 * XXX these are probably of (very) limited utility now.
195 static int reassignbufcalls;
196 SYSCTL_INT(_vfs, OID_AUTO, reassignbufcalls, CTLFLAG_RW, &reassignbufcalls, 0,
197 "Number of calls to reassignbuf");
199 static counter_u64_t free_owe_inact;
200 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, free_owe_inact, CTLFLAG_RD, &free_owe_inact,
201 "Number of times free vnodes kept on active list due to VFS "
202 "owing inactivation");
204 /* To keep more than one thread at a time from running vfs_getnewfsid */
205 static struct mtx mntid_mtx;
208 * Lock for any access to the following:
213 static struct mtx vnode_free_list_mtx;
215 /* Publicly exported FS */
216 struct nfs_public nfs_pub;
218 static uma_zone_t buf_trie_zone;
220 /* Zone for allocation of new vnodes - used exclusively by getnewvnode() */
221 static uma_zone_t vnode_zone;
222 static uma_zone_t vnodepoll_zone;
225 * The workitem queue.
227 * It is useful to delay writes of file data and filesystem metadata
228 * for tens of seconds so that quickly created and deleted files need
229 * not waste disk bandwidth being created and removed. To realize this,
230 * we append vnodes to a "workitem" queue. When running with a soft
231 * updates implementation, most pending metadata dependencies should
232 * not wait for more than a few seconds. Thus, mounted on block devices
233 * are delayed only about a half the time that file data is delayed.
234 * Similarly, directory updates are more critical, so are only delayed
235 * about a third the time that file data is delayed. Thus, there are
236 * SYNCER_MAXDELAY queues that are processed round-robin at a rate of
237 * one each second (driven off the filesystem syncer process). The
238 * syncer_delayno variable indicates the next queue that is to be processed.
239 * Items that need to be processed soon are placed in this queue:
241 * syncer_workitem_pending[syncer_delayno]
243 * A delay of fifteen seconds is done by placing the request fifteen
244 * entries later in the queue:
246 * syncer_workitem_pending[(syncer_delayno + 15) & syncer_mask]
249 static int syncer_delayno;
250 static long syncer_mask;
251 LIST_HEAD(synclist, bufobj);
252 static struct synclist *syncer_workitem_pending;
254 * The sync_mtx protects:
259 * syncer_workitem_pending
260 * syncer_worklist_len
263 static struct mtx sync_mtx;
264 static struct cv sync_wakeup;
266 #define SYNCER_MAXDELAY 32
267 static int syncer_maxdelay = SYNCER_MAXDELAY; /* maximum delay time */
268 static int syncdelay = 30; /* max time to delay syncing data */
269 static int filedelay = 30; /* time to delay syncing files */
270 SYSCTL_INT(_kern, OID_AUTO, filedelay, CTLFLAG_RW, &filedelay, 0,
271 "Time to delay syncing files (in seconds)");
272 static int dirdelay = 29; /* time to delay syncing directories */
273 SYSCTL_INT(_kern, OID_AUTO, dirdelay, CTLFLAG_RW, &dirdelay, 0,
274 "Time to delay syncing directories (in seconds)");
275 static int metadelay = 28; /* time to delay syncing metadata */
276 SYSCTL_INT(_kern, OID_AUTO, metadelay, CTLFLAG_RW, &metadelay, 0,
277 "Time to delay syncing metadata (in seconds)");
278 static int rushjob; /* number of slots to run ASAP */
279 static int stat_rush_requests; /* number of times I/O speeded up */
280 SYSCTL_INT(_debug, OID_AUTO, rush_requests, CTLFLAG_RW, &stat_rush_requests, 0,
281 "Number of times I/O speeded up (rush requests)");
284 * When shutting down the syncer, run it at four times normal speed.
286 #define SYNCER_SHUTDOWN_SPEEDUP 4
287 static int sync_vnode_count;
288 static int syncer_worklist_len;
289 static enum { SYNCER_RUNNING, SYNCER_SHUTTING_DOWN, SYNCER_FINAL_DELAY }
292 /* Target for maximum number of vnodes. */
294 static int gapvnodes; /* gap between wanted and desired */
295 static int vhiwat; /* enough extras after expansion */
296 static int vlowat; /* minimal extras before expansion */
297 static int vstir; /* nonzero to stir non-free vnodes */
298 static volatile int vsmalltrigger = 8; /* pref to keep if > this many pages */
301 sysctl_update_desiredvnodes(SYSCTL_HANDLER_ARGS)
303 int error, old_desiredvnodes;
305 old_desiredvnodes = desiredvnodes;
306 if ((error = sysctl_handle_int(oidp, arg1, arg2, req)) != 0)
308 if (old_desiredvnodes != desiredvnodes) {
309 wantfreevnodes = desiredvnodes / 4;
310 /* XXX locking seems to be incomplete. */
311 vfs_hash_changesize(desiredvnodes);
312 cache_changesize(desiredvnodes);
317 SYSCTL_PROC(_kern, KERN_MAXVNODES, maxvnodes,
318 CTLTYPE_INT | CTLFLAG_MPSAFE | CTLFLAG_RW, &desiredvnodes, 0,
319 sysctl_update_desiredvnodes, "I", "Target for maximum number of vnodes");
320 SYSCTL_ULONG(_kern, OID_AUTO, minvnodes, CTLFLAG_RW,
321 &wantfreevnodes, 0, "Old name for vfs.wantfreevnodes (legacy)");
322 static int vnlru_nowhere;
323 SYSCTL_INT(_debug, OID_AUTO, vnlru_nowhere, CTLFLAG_RW,
324 &vnlru_nowhere, 0, "Number of times the vnlru process ran without success");
326 /* Shift count for (uintptr_t)vp to initialize vp->v_hash. */
330 * Support for the bufobj clean & dirty pctrie.
333 buf_trie_alloc(struct pctrie *ptree)
336 return uma_zalloc(buf_trie_zone, M_NOWAIT);
340 buf_trie_free(struct pctrie *ptree, void *node)
343 uma_zfree(buf_trie_zone, node);
345 PCTRIE_DEFINE(BUF, buf, b_lblkno, buf_trie_alloc, buf_trie_free);
348 * Initialize the vnode management data structures.
350 * Reevaluate the following cap on the number of vnodes after the physical
351 * memory size exceeds 512GB. In the limit, as the physical memory size
352 * grows, the ratio of the memory size in KB to vnodes approaches 64:1.
354 #ifndef MAXVNODES_MAX
355 #define MAXVNODES_MAX (512 * 1024 * 1024 / 64) /* 8M */
359 * Initialize a vnode as it first enters the zone.
362 vnode_init(void *mem, int size, int flags)
372 vp->v_vnlock = &vp->v_lock;
373 mtx_init(&vp->v_interlock, "vnode interlock", NULL, MTX_DEF);
375 * By default, don't allow shared locks unless filesystems opt-in.
377 lockinit(vp->v_vnlock, PVFS, "vnode", VLKTIMEOUT,
378 LK_NOSHARE | LK_IS_VNODE);
383 rw_init(BO_LOCKPTR(bo), "bufobj interlock");
385 TAILQ_INIT(&bo->bo_clean.bv_hd);
386 TAILQ_INIT(&bo->bo_dirty.bv_hd);
388 * Initialize namecache.
390 LIST_INIT(&vp->v_cache_src);
391 TAILQ_INIT(&vp->v_cache_dst);
393 * Initialize rangelocks.
395 rangelock_init(&vp->v_rl);
400 * Free a vnode when it is cleared from the zone.
403 vnode_fini(void *mem, int size)
409 rangelock_destroy(&vp->v_rl);
410 lockdestroy(vp->v_vnlock);
411 mtx_destroy(&vp->v_interlock);
413 rw_destroy(BO_LOCKPTR(bo));
417 * Provide the size of NFS nclnode and NFS fh for calculation of the
418 * vnode memory consumption. The size is specified directly to
419 * eliminate dependency on NFS-private header.
421 * Other filesystems may use bigger or smaller (like UFS and ZFS)
422 * private inode data, but the NFS-based estimation is ample enough.
423 * Still, we care about differences in the size between 64- and 32-bit
426 * Namecache structure size is heuristically
427 * sizeof(struct namecache_ts) + CACHE_PATH_CUTOFF + 1.
430 #define NFS_NCLNODE_SZ (528 + 64)
433 #define NFS_NCLNODE_SZ (360 + 32)
438 vntblinit(void *dummy __unused)
441 int physvnodes, virtvnodes;
444 * Desiredvnodes is a function of the physical memory size and the
445 * kernel's heap size. Generally speaking, it scales with the
446 * physical memory size. The ratio of desiredvnodes to the physical
447 * memory size is 1:16 until desiredvnodes exceeds 98,304.
449 * marginal ratio of desiredvnodes to the physical memory size is
450 * 1:64. However, desiredvnodes is limited by the kernel's heap
451 * size. The memory required by desiredvnodes vnodes and vm objects
452 * must not exceed 1/10th of the kernel's heap size.
454 physvnodes = maxproc + pgtok(vm_cnt.v_page_count) / 64 +
455 3 * min(98304 * 16, pgtok(vm_cnt.v_page_count)) / 64;
456 virtvnodes = vm_kmem_size / (10 * (sizeof(struct vm_object) +
457 sizeof(struct vnode) + NC_SZ * ncsizefactor + NFS_NCLNODE_SZ));
458 desiredvnodes = min(physvnodes, virtvnodes);
459 if (desiredvnodes > MAXVNODES_MAX) {
461 printf("Reducing kern.maxvnodes %d -> %d\n",
462 desiredvnodes, MAXVNODES_MAX);
463 desiredvnodes = MAXVNODES_MAX;
465 wantfreevnodes = desiredvnodes / 4;
466 mtx_init(&mntid_mtx, "mntid", NULL, MTX_DEF);
467 TAILQ_INIT(&vnode_free_list);
468 mtx_init(&vnode_free_list_mtx, "vnode_free_list", NULL, MTX_DEF);
469 vnode_zone = uma_zcreate("VNODE", sizeof (struct vnode), NULL, NULL,
470 vnode_init, vnode_fini, UMA_ALIGN_PTR, 0);
471 vnodepoll_zone = uma_zcreate("VNODEPOLL", sizeof (struct vpollinfo),
472 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
474 * Preallocate enough nodes to support one-per buf so that
475 * we can not fail an insert. reassignbuf() callers can not
476 * tolerate the insertion failure.
478 buf_trie_zone = uma_zcreate("BUF TRIE", pctrie_node_size(),
479 NULL, NULL, pctrie_zone_init, NULL, UMA_ALIGN_PTR,
480 UMA_ZONE_NOFREE | UMA_ZONE_VM);
481 uma_prealloc(buf_trie_zone, nbuf);
483 vnodes_created = counter_u64_alloc(M_WAITOK);
484 recycles_count = counter_u64_alloc(M_WAITOK);
485 free_owe_inact = counter_u64_alloc(M_WAITOK);
488 * Initialize the filesystem syncer.
490 syncer_workitem_pending = hashinit(syncer_maxdelay, M_VNODE,
492 syncer_maxdelay = syncer_mask + 1;
493 mtx_init(&sync_mtx, "Syncer mtx", NULL, MTX_DEF);
494 cv_init(&sync_wakeup, "syncer");
495 for (i = 1; i <= sizeof(struct vnode); i <<= 1)
499 SYSINIT(vfs, SI_SUB_VFS, SI_ORDER_FIRST, vntblinit, NULL);
503 * Mark a mount point as busy. Used to synchronize access and to delay
504 * unmounting. Eventually, mountlist_mtx is not released on failure.
506 * vfs_busy() is a custom lock, it can block the caller.
507 * vfs_busy() only sleeps if the unmount is active on the mount point.
508 * For a mountpoint mp, vfs_busy-enforced lock is before lock of any
509 * vnode belonging to mp.
511 * Lookup uses vfs_busy() to traverse mount points.
513 * / vnode lock A / vnode lock (/var) D
514 * /var vnode lock B /log vnode lock(/var/log) E
515 * vfs_busy lock C vfs_busy lock F
517 * Within each file system, the lock order is C->A->B and F->D->E.
519 * When traversing across mounts, the system follows that lock order:
525 * The lookup() process for namei("/var") illustrates the process:
526 * VOP_LOOKUP() obtains B while A is held
527 * vfs_busy() obtains a shared lock on F while A and B are held
528 * vput() releases lock on B
529 * vput() releases lock on A
530 * VFS_ROOT() obtains lock on D while shared lock on F is held
531 * vfs_unbusy() releases shared lock on F
532 * vn_lock() obtains lock on deadfs vnode vp_crossmp instead of A.
533 * Attempt to lock A (instead of vp_crossmp) while D is held would
534 * violate the global order, causing deadlocks.
536 * dounmount() locks B while F is drained.
539 vfs_busy(struct mount *mp, int flags)
542 MPASS((flags & ~MBF_MASK) == 0);
543 CTR3(KTR_VFS, "%s: mp %p with flags %d", __func__, mp, flags);
548 * If mount point is currently being unmounted, sleep until the
549 * mount point fate is decided. If thread doing the unmounting fails,
550 * it will clear MNTK_UNMOUNT flag before waking us up, indicating
551 * that this mount point has survived the unmount attempt and vfs_busy
552 * should retry. Otherwise the unmounter thread will set MNTK_REFEXPIRE
553 * flag in addition to MNTK_UNMOUNT, indicating that mount point is
554 * about to be really destroyed. vfs_busy needs to release its
555 * reference on the mount point in this case and return with ENOENT,
556 * telling the caller that mount mount it tried to busy is no longer
559 while (mp->mnt_kern_flag & MNTK_UNMOUNT) {
560 if (flags & MBF_NOWAIT || mp->mnt_kern_flag & MNTK_REFEXPIRE) {
563 CTR1(KTR_VFS, "%s: failed busying before sleeping",
567 if (flags & MBF_MNTLSTLOCK)
568 mtx_unlock(&mountlist_mtx);
569 mp->mnt_kern_flag |= MNTK_MWAIT;
570 msleep(mp, MNT_MTX(mp), PVFS | PDROP, "vfs_busy", 0);
571 if (flags & MBF_MNTLSTLOCK)
572 mtx_lock(&mountlist_mtx);
575 if (flags & MBF_MNTLSTLOCK)
576 mtx_unlock(&mountlist_mtx);
583 * Free a busy filesystem.
586 vfs_unbusy(struct mount *mp)
589 CTR2(KTR_VFS, "%s: mp %p", __func__, mp);
592 KASSERT(mp->mnt_lockref > 0, ("negative mnt_lockref"));
594 if (mp->mnt_lockref == 0 && (mp->mnt_kern_flag & MNTK_DRAINING) != 0) {
595 MPASS(mp->mnt_kern_flag & MNTK_UNMOUNT);
596 CTR1(KTR_VFS, "%s: waking up waiters", __func__);
597 mp->mnt_kern_flag &= ~MNTK_DRAINING;
598 wakeup(&mp->mnt_lockref);
604 * Lookup a mount point by filesystem identifier.
607 vfs_getvfs(fsid_t *fsid)
611 CTR2(KTR_VFS, "%s: fsid %p", __func__, fsid);
612 mtx_lock(&mountlist_mtx);
613 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
614 if (mp->mnt_stat.f_fsid.val[0] == fsid->val[0] &&
615 mp->mnt_stat.f_fsid.val[1] == fsid->val[1]) {
617 mtx_unlock(&mountlist_mtx);
621 mtx_unlock(&mountlist_mtx);
622 CTR2(KTR_VFS, "%s: lookup failed for %p id", __func__, fsid);
623 return ((struct mount *) 0);
627 * Lookup a mount point by filesystem identifier, busying it before
630 * To avoid congestion on mountlist_mtx, implement simple direct-mapped
631 * cache for popular filesystem identifiers. The cache is lockess, using
632 * the fact that struct mount's are never freed. In worst case we may
633 * get pointer to unmounted or even different filesystem, so we have to
634 * check what we got, and go slow way if so.
637 vfs_busyfs(fsid_t *fsid)
639 #define FSID_CACHE_SIZE 256
640 typedef struct mount * volatile vmp_t;
641 static vmp_t cache[FSID_CACHE_SIZE];
646 CTR2(KTR_VFS, "%s: fsid %p", __func__, fsid);
647 hash = fsid->val[0] ^ fsid->val[1];
648 hash = (hash >> 16 ^ hash) & (FSID_CACHE_SIZE - 1);
651 mp->mnt_stat.f_fsid.val[0] != fsid->val[0] ||
652 mp->mnt_stat.f_fsid.val[1] != fsid->val[1])
654 if (vfs_busy(mp, 0) != 0) {
658 if (mp->mnt_stat.f_fsid.val[0] == fsid->val[0] &&
659 mp->mnt_stat.f_fsid.val[1] == fsid->val[1])
665 mtx_lock(&mountlist_mtx);
666 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
667 if (mp->mnt_stat.f_fsid.val[0] == fsid->val[0] &&
668 mp->mnt_stat.f_fsid.val[1] == fsid->val[1]) {
669 error = vfs_busy(mp, MBF_MNTLSTLOCK);
672 mtx_unlock(&mountlist_mtx);
679 CTR2(KTR_VFS, "%s: lookup failed for %p id", __func__, fsid);
680 mtx_unlock(&mountlist_mtx);
681 return ((struct mount *) 0);
685 * Check if a user can access privileged mount options.
688 vfs_suser(struct mount *mp, struct thread *td)
693 * If the thread is jailed, but this is not a jail-friendly file
694 * system, deny immediately.
696 if (!(mp->mnt_vfc->vfc_flags & VFCF_JAIL) && jailed(td->td_ucred))
700 * If the file system was mounted outside the jail of the calling
701 * thread, deny immediately.
703 if (prison_check(td->td_ucred, mp->mnt_cred) != 0)
707 * If file system supports delegated administration, we don't check
708 * for the PRIV_VFS_MOUNT_OWNER privilege - it will be better verified
709 * by the file system itself.
710 * If this is not the user that did original mount, we check for
711 * the PRIV_VFS_MOUNT_OWNER privilege.
713 if (!(mp->mnt_vfc->vfc_flags & VFCF_DELEGADMIN) &&
714 mp->mnt_cred->cr_uid != td->td_ucred->cr_uid) {
715 if ((error = priv_check(td, PRIV_VFS_MOUNT_OWNER)) != 0)
722 * Get a new unique fsid. Try to make its val[0] unique, since this value
723 * will be used to create fake device numbers for stat(). Also try (but
724 * not so hard) make its val[0] unique mod 2^16, since some emulators only
725 * support 16-bit device numbers. We end up with unique val[0]'s for the
726 * first 2^16 calls and unique val[0]'s mod 2^16 for the first 2^8 calls.
728 * Keep in mind that several mounts may be running in parallel. Starting
729 * the search one past where the previous search terminated is both a
730 * micro-optimization and a defense against returning the same fsid to
734 vfs_getnewfsid(struct mount *mp)
736 static uint16_t mntid_base;
741 CTR2(KTR_VFS, "%s: mp %p", __func__, mp);
742 mtx_lock(&mntid_mtx);
743 mtype = mp->mnt_vfc->vfc_typenum;
744 tfsid.val[1] = mtype;
745 mtype = (mtype & 0xFF) << 24;
747 tfsid.val[0] = makedev(255,
748 mtype | ((mntid_base & 0xFF00) << 8) | (mntid_base & 0xFF));
750 if ((nmp = vfs_getvfs(&tfsid)) == NULL)
754 mp->mnt_stat.f_fsid.val[0] = tfsid.val[0];
755 mp->mnt_stat.f_fsid.val[1] = tfsid.val[1];
756 mtx_unlock(&mntid_mtx);
760 * Knob to control the precision of file timestamps:
762 * 0 = seconds only; nanoseconds zeroed.
763 * 1 = seconds and nanoseconds, accurate within 1/HZ.
764 * 2 = seconds and nanoseconds, truncated to microseconds.
765 * >=3 = seconds and nanoseconds, maximum precision.
767 enum { TSP_SEC, TSP_HZ, TSP_USEC, TSP_NSEC };
769 static int timestamp_precision = TSP_USEC;
770 SYSCTL_INT(_vfs, OID_AUTO, timestamp_precision, CTLFLAG_RW,
771 ×tamp_precision, 0, "File timestamp precision (0: seconds, "
772 "1: sec + ns accurate to 1/HZ, 2: sec + ns truncated to us, "
773 "3+: sec + ns (max. precision))");
776 * Get a current timestamp.
779 vfs_timestamp(struct timespec *tsp)
783 switch (timestamp_precision) {
785 tsp->tv_sec = time_second;
793 TIMEVAL_TO_TIMESPEC(&tv, tsp);
803 * Set vnode attributes to VNOVAL
806 vattr_null(struct vattr *vap)
810 vap->va_size = VNOVAL;
811 vap->va_bytes = VNOVAL;
812 vap->va_mode = VNOVAL;
813 vap->va_nlink = VNOVAL;
814 vap->va_uid = VNOVAL;
815 vap->va_gid = VNOVAL;
816 vap->va_fsid = VNOVAL;
817 vap->va_fileid = VNOVAL;
818 vap->va_blocksize = VNOVAL;
819 vap->va_rdev = VNOVAL;
820 vap->va_atime.tv_sec = VNOVAL;
821 vap->va_atime.tv_nsec = VNOVAL;
822 vap->va_mtime.tv_sec = VNOVAL;
823 vap->va_mtime.tv_nsec = VNOVAL;
824 vap->va_ctime.tv_sec = VNOVAL;
825 vap->va_ctime.tv_nsec = VNOVAL;
826 vap->va_birthtime.tv_sec = VNOVAL;
827 vap->va_birthtime.tv_nsec = VNOVAL;
828 vap->va_flags = VNOVAL;
829 vap->va_gen = VNOVAL;
834 * This routine is called when we have too many vnodes. It attempts
835 * to free <count> vnodes and will potentially free vnodes that still
836 * have VM backing store (VM backing store is typically the cause
837 * of a vnode blowout so we want to do this). Therefore, this operation
838 * is not considered cheap.
840 * A number of conditions may prevent a vnode from being reclaimed.
841 * the buffer cache may have references on the vnode, a directory
842 * vnode may still have references due to the namei cache representing
843 * underlying files, or the vnode may be in active use. It is not
844 * desirable to reuse such vnodes. These conditions may cause the
845 * number of vnodes to reach some minimum value regardless of what
846 * you set kern.maxvnodes to. Do not set kern.maxvnodes too low.
849 vlrureclaim(struct mount *mp, int reclaim_nc_src, int trigger)
852 int count, done, target;
855 vn_start_write(NULL, &mp, V_WAIT);
857 count = mp->mnt_nvnodelistsize;
858 target = count * (int64_t)gapvnodes / imax(desiredvnodes, 1);
859 target = target / 10 + 1;
860 while (count != 0 && done < target) {
861 vp = TAILQ_FIRST(&mp->mnt_nvnodelist);
862 while (vp != NULL && vp->v_type == VMARKER)
863 vp = TAILQ_NEXT(vp, v_nmntvnodes);
867 * XXX LRU is completely broken for non-free vnodes. First
868 * by calling here in mountpoint order, then by moving
869 * unselected vnodes to the end here, and most grossly by
870 * removing the vlruvp() function that was supposed to
871 * maintain the order. (This function was born broken
872 * since syncer problems prevented it doing anything.) The
873 * order is closer to LRC (C = Created).
875 * LRU reclaiming of vnodes seems to have last worked in
876 * FreeBSD-3 where LRU wasn't mentioned under any spelling.
877 * Then there was no hold count, and inactive vnodes were
878 * simply put on the free list in LRU order. The separate
879 * lists also break LRU. We prefer to reclaim from the
880 * free list for technical reasons. This tends to thrash
881 * the free list to keep very unrecently used held vnodes.
882 * The problem is mitigated by keeping the free list large.
884 TAILQ_REMOVE(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
885 TAILQ_INSERT_TAIL(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
890 * If it's been deconstructed already, it's still
891 * referenced, or it exceeds the trigger, skip it.
892 * Also skip free vnodes. We are trying to make space
893 * to expand the free list, not reduce it.
895 if (vp->v_usecount ||
896 (!reclaim_nc_src && !LIST_EMPTY(&vp->v_cache_src)) ||
897 ((vp->v_iflag & VI_FREE) != 0) ||
898 (vp->v_iflag & VI_DOOMED) != 0 || (vp->v_object != NULL &&
899 vp->v_object->resident_page_count > trigger)) {
905 if (VOP_LOCK(vp, LK_INTERLOCK|LK_EXCLUSIVE|LK_NOWAIT)) {
907 goto next_iter_mntunlocked;
911 * v_usecount may have been bumped after VOP_LOCK() dropped
912 * the vnode interlock and before it was locked again.
914 * It is not necessary to recheck VI_DOOMED because it can
915 * only be set by another thread that holds both the vnode
916 * lock and vnode interlock. If another thread has the
917 * vnode lock before we get to VOP_LOCK() and obtains the
918 * vnode interlock after VOP_LOCK() drops the vnode
919 * interlock, the other thread will be unable to drop the
920 * vnode lock before our VOP_LOCK() call fails.
922 if (vp->v_usecount ||
923 (!reclaim_nc_src && !LIST_EMPTY(&vp->v_cache_src)) ||
924 (vp->v_iflag & VI_FREE) != 0 ||
925 (vp->v_object != NULL &&
926 vp->v_object->resident_page_count > trigger)) {
927 VOP_UNLOCK(vp, LK_INTERLOCK);
929 goto next_iter_mntunlocked;
931 KASSERT((vp->v_iflag & VI_DOOMED) == 0,
932 ("VI_DOOMED unexpectedly detected in vlrureclaim()"));
933 counter_u64_add(recycles_count, 1);
938 next_iter_mntunlocked:
947 kern_yield(PRI_USER);
952 vn_finished_write(mp);
956 static int max_vnlru_free = 10000; /* limit on vnode free requests per call */
957 SYSCTL_INT(_debug, OID_AUTO, max_vnlru_free, CTLFLAG_RW, &max_vnlru_free,
959 "limit on vnode free requests per call to the vnlru_free routine");
962 * Attempt to reduce the free list by the requested amount.
965 vnlru_free_locked(int count, struct vfsops *mnt_op)
971 tried_batches = false;
972 mtx_assert(&vnode_free_list_mtx, MA_OWNED);
973 if (count > max_vnlru_free)
974 count = max_vnlru_free;
975 for (; count > 0; count--) {
976 vp = TAILQ_FIRST(&vnode_free_list);
978 * The list can be modified while the free_list_mtx
979 * has been dropped and vp could be NULL here.
984 mtx_unlock(&vnode_free_list_mtx);
985 vnlru_return_batches(mnt_op);
986 tried_batches = true;
987 mtx_lock(&vnode_free_list_mtx);
991 VNASSERT(vp->v_op != NULL, vp,
992 ("vnlru_free: vnode already reclaimed."));
993 KASSERT((vp->v_iflag & VI_FREE) != 0,
994 ("Removing vnode not on freelist"));
995 KASSERT((vp->v_iflag & VI_ACTIVE) == 0,
996 ("Mangling active vnode"));
997 TAILQ_REMOVE(&vnode_free_list, vp, v_actfreelist);
1000 * Don't recycle if our vnode is from different type
1001 * of mount point. Note that mp is type-safe, the
1002 * check does not reach unmapped address even if
1003 * vnode is reclaimed.
1004 * Don't recycle if we can't get the interlock without
1007 if ((mnt_op != NULL && (mp = vp->v_mount) != NULL &&
1008 mp->mnt_op != mnt_op) || !VI_TRYLOCK(vp)) {
1009 TAILQ_INSERT_TAIL(&vnode_free_list, vp, v_actfreelist);
1012 VNASSERT((vp->v_iflag & VI_FREE) != 0 && vp->v_holdcnt == 0,
1013 vp, ("vp inconsistent on freelist"));
1016 * The clear of VI_FREE prevents activation of the
1017 * vnode. There is no sense in putting the vnode on
1018 * the mount point active list, only to remove it
1019 * later during recycling. Inline the relevant part
1020 * of vholdl(), to avoid triggering assertions or
1024 vp->v_iflag &= ~VI_FREE;
1025 refcount_acquire(&vp->v_holdcnt);
1027 mtx_unlock(&vnode_free_list_mtx);
1031 * If the recycled succeeded this vdrop will actually free
1032 * the vnode. If not it will simply place it back on
1036 mtx_lock(&vnode_free_list_mtx);
1041 vnlru_free(int count, struct vfsops *mnt_op)
1044 mtx_lock(&vnode_free_list_mtx);
1045 vnlru_free_locked(count, mnt_op);
1046 mtx_unlock(&vnode_free_list_mtx);
1050 /* XXX some names and initialization are bad for limits and watermarks. */
1056 gapvnodes = imax(desiredvnodes - wantfreevnodes, 100);
1057 vhiwat = gapvnodes / 11; /* 9% -- just under the 10% in vlrureclaim() */
1058 vlowat = vhiwat / 2;
1059 if (numvnodes > desiredvnodes)
1061 space = desiredvnodes - numvnodes;
1062 if (freevnodes > wantfreevnodes)
1063 space += freevnodes - wantfreevnodes;
1068 vnlru_return_batch_locked(struct mount *mp)
1072 mtx_assert(&mp->mnt_listmtx, MA_OWNED);
1074 if (mp->mnt_tmpfreevnodelistsize == 0)
1077 TAILQ_FOREACH(vp, &mp->mnt_tmpfreevnodelist, v_actfreelist) {
1078 VNASSERT((vp->v_mflag & VMP_TMPMNTFREELIST) != 0, vp,
1079 ("vnode without VMP_TMPMNTFREELIST on mnt_tmpfreevnodelist"));
1080 vp->v_mflag &= ~VMP_TMPMNTFREELIST;
1082 mtx_lock(&vnode_free_list_mtx);
1083 TAILQ_CONCAT(&vnode_free_list, &mp->mnt_tmpfreevnodelist, v_actfreelist);
1084 freevnodes += mp->mnt_tmpfreevnodelistsize;
1085 mtx_unlock(&vnode_free_list_mtx);
1086 mp->mnt_tmpfreevnodelistsize = 0;
1090 vnlru_return_batch(struct mount *mp)
1093 mtx_lock(&mp->mnt_listmtx);
1094 vnlru_return_batch_locked(mp);
1095 mtx_unlock(&mp->mnt_listmtx);
1099 vnlru_return_batches(struct vfsops *mnt_op)
1101 struct mount *mp, *nmp;
1104 mtx_lock(&mountlist_mtx);
1105 for (mp = TAILQ_FIRST(&mountlist); mp != NULL; mp = nmp) {
1106 need_unbusy = false;
1107 if (mnt_op != NULL && mp->mnt_op != mnt_op)
1109 if (mp->mnt_tmpfreevnodelistsize == 0)
1111 if (vfs_busy(mp, MBF_NOWAIT | MBF_MNTLSTLOCK) == 0) {
1112 vnlru_return_batch(mp);
1114 mtx_lock(&mountlist_mtx);
1117 nmp = TAILQ_NEXT(mp, mnt_list);
1121 mtx_unlock(&mountlist_mtx);
1125 * Attempt to recycle vnodes in a context that is always safe to block.
1126 * Calling vlrurecycle() from the bowels of filesystem code has some
1127 * interesting deadlock problems.
1129 static struct proc *vnlruproc;
1130 static int vnlruproc_sig;
1135 struct mount *mp, *nmp;
1136 unsigned long onumvnodes;
1137 int done, force, reclaim_nc_src, trigger, usevnodes;
1139 EVENTHANDLER_REGISTER(shutdown_pre_sync, kproc_shutdown, vnlruproc,
1140 SHUTDOWN_PRI_FIRST);
1144 kproc_suspend_check(vnlruproc);
1145 mtx_lock(&vnode_free_list_mtx);
1147 * If numvnodes is too large (due to desiredvnodes being
1148 * adjusted using its sysctl, or emergency growth), first
1149 * try to reduce it by discarding from the free list.
1151 if (numvnodes > desiredvnodes)
1152 vnlru_free_locked(numvnodes - desiredvnodes, NULL);
1154 * Sleep if the vnode cache is in a good state. This is
1155 * when it is not over-full and has space for about a 4%
1156 * or 9% expansion (by growing its size or inexcessively
1157 * reducing its free list). Otherwise, try to reclaim
1158 * space for a 10% expansion.
1160 if (vstir && force == 0) {
1164 if (vspace() >= vlowat && force == 0) {
1166 wakeup(&vnlruproc_sig);
1167 msleep(vnlruproc, &vnode_free_list_mtx,
1168 PVFS|PDROP, "vlruwt", hz);
1171 mtx_unlock(&vnode_free_list_mtx);
1173 onumvnodes = numvnodes;
1175 * Calculate parameters for recycling. These are the same
1176 * throughout the loop to give some semblance of fairness.
1177 * The trigger point is to avoid recycling vnodes with lots
1178 * of resident pages. We aren't trying to free memory; we
1179 * are trying to recycle or at least free vnodes.
1181 if (numvnodes <= desiredvnodes)
1182 usevnodes = numvnodes - freevnodes;
1184 usevnodes = numvnodes;
1188 * The trigger value is is chosen to give a conservatively
1189 * large value to ensure that it alone doesn't prevent
1190 * making progress. The value can easily be so large that
1191 * it is effectively infinite in some congested and
1192 * misconfigured cases, and this is necessary. Normally
1193 * it is about 8 to 100 (pages), which is quite large.
1195 trigger = vm_cnt.v_page_count * 2 / usevnodes;
1197 trigger = vsmalltrigger;
1198 reclaim_nc_src = force >= 3;
1199 mtx_lock(&mountlist_mtx);
1200 for (mp = TAILQ_FIRST(&mountlist); mp != NULL; mp = nmp) {
1201 if (vfs_busy(mp, MBF_NOWAIT | MBF_MNTLSTLOCK)) {
1202 nmp = TAILQ_NEXT(mp, mnt_list);
1205 done += vlrureclaim(mp, reclaim_nc_src, trigger);
1206 mtx_lock(&mountlist_mtx);
1207 nmp = TAILQ_NEXT(mp, mnt_list);
1210 mtx_unlock(&mountlist_mtx);
1211 if (onumvnodes > desiredvnodes && numvnodes <= desiredvnodes)
1214 if (force == 0 || force == 1) {
1224 tsleep(vnlruproc, PPAUSE, "vlrup", hz * 3);
1226 kern_yield(PRI_USER);
1228 * After becoming active to expand above low water, keep
1229 * active until above high water.
1231 force = vspace() < vhiwat;
1235 static struct kproc_desc vnlru_kp = {
1240 SYSINIT(vnlru, SI_SUB_KTHREAD_UPDATE, SI_ORDER_FIRST, kproc_start,
1244 * Routines having to do with the management of the vnode table.
1248 * Try to recycle a freed vnode. We abort if anyone picks up a reference
1249 * before we actually vgone(). This function must be called with the vnode
1250 * held to prevent the vnode from being returned to the free list midway
1254 vtryrecycle(struct vnode *vp)
1258 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
1259 VNASSERT(vp->v_holdcnt, vp,
1260 ("vtryrecycle: Recycling vp %p without a reference.", vp));
1262 * This vnode may found and locked via some other list, if so we
1263 * can't recycle it yet.
1265 if (VOP_LOCK(vp, LK_EXCLUSIVE | LK_NOWAIT) != 0) {
1267 "%s: impossible to recycle, vp %p lock is already held",
1269 return (EWOULDBLOCK);
1272 * Don't recycle if its filesystem is being suspended.
1274 if (vn_start_write(vp, &vnmp, V_NOWAIT) != 0) {
1277 "%s: impossible to recycle, cannot start the write for %p",
1282 * If we got this far, we need to acquire the interlock and see if
1283 * anyone picked up this vnode from another list. If not, we will
1284 * mark it with DOOMED via vgonel() so that anyone who does find it
1285 * will skip over it.
1288 if (vp->v_usecount) {
1289 VOP_UNLOCK(vp, LK_INTERLOCK);
1290 vn_finished_write(vnmp);
1292 "%s: impossible to recycle, %p is already referenced",
1296 if ((vp->v_iflag & VI_DOOMED) == 0) {
1297 counter_u64_add(recycles_count, 1);
1300 VOP_UNLOCK(vp, LK_INTERLOCK);
1301 vn_finished_write(vnmp);
1309 if (vspace() < vlowat && vnlruproc_sig == 0) {
1316 * Wait if necessary for space for a new vnode.
1319 getnewvnode_wait(int suspended)
1322 mtx_assert(&vnode_free_list_mtx, MA_OWNED);
1323 if (numvnodes >= desiredvnodes) {
1326 * The file system is being suspended. We cannot
1327 * risk a deadlock here, so allow allocation of
1328 * another vnode even if this would give too many.
1332 if (vnlruproc_sig == 0) {
1333 vnlruproc_sig = 1; /* avoid unnecessary wakeups */
1336 msleep(&vnlruproc_sig, &vnode_free_list_mtx, PVFS,
1339 /* Post-adjust like the pre-adjust in getnewvnode(). */
1340 if (numvnodes + 1 > desiredvnodes && freevnodes > 1)
1341 vnlru_free_locked(1, NULL);
1342 return (numvnodes >= desiredvnodes ? ENFILE : 0);
1346 * This hack is fragile, and probably not needed any more now that the
1347 * watermark handling works.
1350 getnewvnode_reserve(u_int count)
1354 /* Pre-adjust like the pre-adjust in getnewvnode(), with any count. */
1355 /* XXX no longer so quick, but this part is not racy. */
1356 mtx_lock(&vnode_free_list_mtx);
1357 if (numvnodes + count > desiredvnodes && freevnodes > wantfreevnodes)
1358 vnlru_free_locked(ulmin(numvnodes + count - desiredvnodes,
1359 freevnodes - wantfreevnodes), NULL);
1360 mtx_unlock(&vnode_free_list_mtx);
1363 /* First try to be quick and racy. */
1364 if (atomic_fetchadd_long(&numvnodes, count) + count <= desiredvnodes) {
1365 td->td_vp_reserv += count;
1366 vcheckspace(); /* XXX no longer so quick, but more racy */
1369 atomic_subtract_long(&numvnodes, count);
1371 mtx_lock(&vnode_free_list_mtx);
1373 if (getnewvnode_wait(0) == 0) {
1376 atomic_add_long(&numvnodes, 1);
1380 mtx_unlock(&vnode_free_list_mtx);
1384 * This hack is fragile, especially if desiredvnodes or wantvnodes are
1385 * misconfgured or changed significantly. Reducing desiredvnodes below
1386 * the reserved amount should cause bizarre behaviour like reducing it
1387 * below the number of active vnodes -- the system will try to reduce
1388 * numvnodes to match, but should fail, so the subtraction below should
1392 getnewvnode_drop_reserve(void)
1397 atomic_subtract_long(&numvnodes, td->td_vp_reserv);
1398 td->td_vp_reserv = 0;
1402 * Return the next vnode from the free list.
1405 getnewvnode(const char *tag, struct mount *mp, struct vop_vector *vops,
1410 struct lock_object *lo;
1411 static int cyclecount;
1414 CTR3(KTR_VFS, "%s: mp %p with tag %s", __func__, mp, tag);
1417 if (td->td_vp_reserv > 0) {
1418 td->td_vp_reserv -= 1;
1421 mtx_lock(&vnode_free_list_mtx);
1422 if (numvnodes < desiredvnodes)
1424 else if (cyclecount++ >= freevnodes) {
1429 * Grow the vnode cache if it will not be above its target max
1430 * after growing. Otherwise, if the free list is nonempty, try
1431 * to reclaim 1 item from it before growing the cache (possibly
1432 * above its target max if the reclamation failed or is delayed).
1433 * Otherwise, wait for some space. In all cases, schedule
1434 * vnlru_proc() if we are getting short of space. The watermarks
1435 * should be chosen so that we never wait or even reclaim from
1436 * the free list to below its target minimum.
1438 if (numvnodes + 1 <= desiredvnodes)
1440 else if (freevnodes > 0)
1441 vnlru_free_locked(1, NULL);
1443 error = getnewvnode_wait(mp != NULL && (mp->mnt_kern_flag &
1445 #if 0 /* XXX Not all VFS_VGET/ffs_vget callers check returns. */
1447 mtx_unlock(&vnode_free_list_mtx);
1453 atomic_add_long(&numvnodes, 1);
1454 mtx_unlock(&vnode_free_list_mtx);
1456 counter_u64_add(vnodes_created, 1);
1457 vp = (struct vnode *) uma_zalloc(vnode_zone, M_WAITOK);
1459 * Locks are given the generic name "vnode" when created.
1460 * Follow the historic practice of using the filesystem
1461 * name when they allocated, e.g., "zfs", "ufs", "nfs, etc.
1463 * Locks live in a witness group keyed on their name. Thus,
1464 * when a lock is renamed, it must also move from the witness
1465 * group of its old name to the witness group of its new name.
1467 * The change only needs to be made when the vnode moves
1468 * from one filesystem type to another. We ensure that each
1469 * filesystem use a single static name pointer for its tag so
1470 * that we can compare pointers rather than doing a strcmp().
1472 lo = &vp->v_vnlock->lock_object;
1473 if (lo->lo_name != tag) {
1475 WITNESS_DESTROY(lo);
1476 WITNESS_INIT(lo, tag);
1479 * By default, don't allow shared locks unless filesystems opt-in.
1481 vp->v_vnlock->lock_object.lo_flags |= LK_NOSHARE;
1483 * Finalize various vnode identity bits.
1485 KASSERT(vp->v_object == NULL, ("stale v_object %p", vp));
1486 KASSERT(vp->v_lockf == NULL, ("stale v_lockf %p", vp));
1487 KASSERT(vp->v_pollinfo == NULL, ("stale v_pollinfo %p", vp));
1491 v_init_counters(vp);
1492 vp->v_bufobj.bo_ops = &buf_ops_bio;
1494 if (mp == NULL && vops != &dead_vnodeops)
1495 printf("NULL mp in getnewvnode(9), tag %s\n", tag);
1499 if (mp != NULL && (mp->mnt_flag & MNT_MULTILABEL) == 0)
1500 mac_vnode_associate_singlelabel(mp, vp);
1503 vp->v_bufobj.bo_bsize = mp->mnt_stat.f_iosize;
1504 if ((mp->mnt_kern_flag & MNTK_NOKNOTE) != 0)
1505 vp->v_vflag |= VV_NOKNOTE;
1509 * For the filesystems which do not use vfs_hash_insert(),
1510 * still initialize v_hash to have vfs_hash_index() useful.
1511 * E.g., nullfs uses vfs_hash_index() on the lower vnode for
1514 vp->v_hash = (uintptr_t)vp >> vnsz2log;
1521 * Delete from old mount point vnode list, if on one.
1524 delmntque(struct vnode *vp)
1534 KASSERT(mp->mnt_activevnodelistsize <= mp->mnt_nvnodelistsize,
1535 ("Active vnode list size %d > Vnode list size %d",
1536 mp->mnt_activevnodelistsize, mp->mnt_nvnodelistsize));
1537 active = vp->v_iflag & VI_ACTIVE;
1538 vp->v_iflag &= ~VI_ACTIVE;
1540 mtx_lock(&mp->mnt_listmtx);
1541 TAILQ_REMOVE(&mp->mnt_activevnodelist, vp, v_actfreelist);
1542 mp->mnt_activevnodelistsize--;
1543 mtx_unlock(&mp->mnt_listmtx);
1547 VNASSERT(mp->mnt_nvnodelistsize > 0, vp,
1548 ("bad mount point vnode list size"));
1549 TAILQ_REMOVE(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
1550 mp->mnt_nvnodelistsize--;
1556 insmntque_stddtr(struct vnode *vp, void *dtr_arg)
1560 vp->v_op = &dead_vnodeops;
1566 * Insert into list of vnodes for the new mount point, if available.
1569 insmntque1(struct vnode *vp, struct mount *mp,
1570 void (*dtr)(struct vnode *, void *), void *dtr_arg)
1573 KASSERT(vp->v_mount == NULL,
1574 ("insmntque: vnode already on per mount vnode list"));
1575 VNASSERT(mp != NULL, vp, ("Don't call insmntque(foo, NULL)"));
1576 ASSERT_VOP_ELOCKED(vp, "insmntque: non-locked vp");
1579 * We acquire the vnode interlock early to ensure that the
1580 * vnode cannot be recycled by another process releasing a
1581 * holdcnt on it before we get it on both the vnode list
1582 * and the active vnode list. The mount mutex protects only
1583 * manipulation of the vnode list and the vnode freelist
1584 * mutex protects only manipulation of the active vnode list.
1585 * Hence the need to hold the vnode interlock throughout.
1589 if (((mp->mnt_kern_flag & MNTK_NOINSMNTQ) != 0 &&
1590 ((mp->mnt_kern_flag & MNTK_UNMOUNTF) != 0 ||
1591 mp->mnt_nvnodelistsize == 0)) &&
1592 (vp->v_vflag & VV_FORCEINSMQ) == 0) {
1601 TAILQ_INSERT_TAIL(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
1602 VNASSERT(mp->mnt_nvnodelistsize >= 0, vp,
1603 ("neg mount point vnode list size"));
1604 mp->mnt_nvnodelistsize++;
1605 KASSERT((vp->v_iflag & VI_ACTIVE) == 0,
1606 ("Activating already active vnode"));
1607 vp->v_iflag |= VI_ACTIVE;
1608 mtx_lock(&mp->mnt_listmtx);
1609 TAILQ_INSERT_HEAD(&mp->mnt_activevnodelist, vp, v_actfreelist);
1610 mp->mnt_activevnodelistsize++;
1611 mtx_unlock(&mp->mnt_listmtx);
1618 insmntque(struct vnode *vp, struct mount *mp)
1621 return (insmntque1(vp, mp, insmntque_stddtr, NULL));
1625 * Flush out and invalidate all buffers associated with a bufobj
1626 * Called with the underlying object locked.
1629 bufobj_invalbuf(struct bufobj *bo, int flags, int slpflag, int slptimeo)
1634 if (flags & V_SAVE) {
1635 error = bufobj_wwait(bo, slpflag, slptimeo);
1640 if (bo->bo_dirty.bv_cnt > 0) {
1642 if ((error = BO_SYNC(bo, MNT_WAIT)) != 0)
1645 * XXX We could save a lock/unlock if this was only
1646 * enabled under INVARIANTS
1649 if (bo->bo_numoutput > 0 || bo->bo_dirty.bv_cnt > 0)
1650 panic("vinvalbuf: dirty bufs");
1654 * If you alter this loop please notice that interlock is dropped and
1655 * reacquired in flushbuflist. Special care is needed to ensure that
1656 * no race conditions occur from this.
1659 error = flushbuflist(&bo->bo_clean,
1660 flags, bo, slpflag, slptimeo);
1661 if (error == 0 && !(flags & V_CLEANONLY))
1662 error = flushbuflist(&bo->bo_dirty,
1663 flags, bo, slpflag, slptimeo);
1664 if (error != 0 && error != EAGAIN) {
1668 } while (error != 0);
1671 * Wait for I/O to complete. XXX needs cleaning up. The vnode can
1672 * have write I/O in-progress but if there is a VM object then the
1673 * VM object can also have read-I/O in-progress.
1676 bufobj_wwait(bo, 0, 0);
1677 if ((flags & V_VMIO) == 0) {
1679 if (bo->bo_object != NULL) {
1680 VM_OBJECT_WLOCK(bo->bo_object);
1681 vm_object_pip_wait(bo->bo_object, "bovlbx");
1682 VM_OBJECT_WUNLOCK(bo->bo_object);
1686 } while (bo->bo_numoutput > 0);
1690 * Destroy the copy in the VM cache, too.
1692 if (bo->bo_object != NULL &&
1693 (flags & (V_ALT | V_NORMAL | V_CLEANONLY | V_VMIO)) == 0) {
1694 VM_OBJECT_WLOCK(bo->bo_object);
1695 vm_object_page_remove(bo->bo_object, 0, 0, (flags & V_SAVE) ?
1696 OBJPR_CLEANONLY : 0);
1697 VM_OBJECT_WUNLOCK(bo->bo_object);
1702 if ((flags & (V_ALT | V_NORMAL | V_CLEANONLY | V_VMIO |
1703 V_ALLOWCLEAN)) == 0 && (bo->bo_dirty.bv_cnt > 0 ||
1704 bo->bo_clean.bv_cnt > 0))
1705 panic("vinvalbuf: flush failed");
1706 if ((flags & (V_ALT | V_NORMAL | V_CLEANONLY | V_VMIO)) == 0 &&
1707 bo->bo_dirty.bv_cnt > 0)
1708 panic("vinvalbuf: flush dirty failed");
1715 * Flush out and invalidate all buffers associated with a vnode.
1716 * Called with the underlying object locked.
1719 vinvalbuf(struct vnode *vp, int flags, int slpflag, int slptimeo)
1722 CTR3(KTR_VFS, "%s: vp %p with flags %d", __func__, vp, flags);
1723 ASSERT_VOP_LOCKED(vp, "vinvalbuf");
1724 if (vp->v_object != NULL && vp->v_object->handle != vp)
1726 return (bufobj_invalbuf(&vp->v_bufobj, flags, slpflag, slptimeo));
1730 * Flush out buffers on the specified list.
1734 flushbuflist(struct bufv *bufv, int flags, struct bufobj *bo, int slpflag,
1737 struct buf *bp, *nbp;
1742 ASSERT_BO_WLOCKED(bo);
1745 TAILQ_FOREACH_SAFE(bp, &bufv->bv_hd, b_bobufs, nbp) {
1746 if (((flags & V_NORMAL) && (bp->b_xflags & BX_ALTDATA)) ||
1747 ((flags & V_ALT) && (bp->b_xflags & BX_ALTDATA) == 0)) {
1751 lblkno = nbp->b_lblkno;
1752 xflags = nbp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN);
1755 error = BUF_TIMELOCK(bp,
1756 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK, BO_LOCKPTR(bo),
1757 "flushbuf", slpflag, slptimeo);
1760 return (error != ENOLCK ? error : EAGAIN);
1762 KASSERT(bp->b_bufobj == bo,
1763 ("bp %p wrong b_bufobj %p should be %p",
1764 bp, bp->b_bufobj, bo));
1766 * XXX Since there are no node locks for NFS, I
1767 * believe there is a slight chance that a delayed
1768 * write will occur while sleeping just above, so
1771 if (((bp->b_flags & (B_DELWRI | B_INVAL)) == B_DELWRI) &&
1774 bp->b_flags |= B_ASYNC;
1777 return (EAGAIN); /* XXX: why not loop ? */
1780 bp->b_flags |= (B_INVAL | B_RELBUF);
1781 bp->b_flags &= ~B_ASYNC;
1786 nbp = gbincore(bo, lblkno);
1787 if (nbp == NULL || (nbp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN))
1789 break; /* nbp invalid */
1795 bnoreuselist(struct bufv *bufv, struct bufobj *bo, daddr_t startn, daddr_t endn)
1801 ASSERT_BO_LOCKED(bo);
1803 for (lblkno = startn;;) {
1805 bp = BUF_PCTRIE_LOOKUP_GE(&bufv->bv_root, lblkno);
1806 if (bp == NULL || bp->b_lblkno >= endn ||
1807 bp->b_lblkno < startn)
1809 error = BUF_TIMELOCK(bp, LK_EXCLUSIVE | LK_SLEEPFAIL |
1810 LK_INTERLOCK, BO_LOCKPTR(bo), "brlsfl", 0, 0);
1813 if (error == ENOLCK)
1817 KASSERT(bp->b_bufobj == bo,
1818 ("bp %p wrong b_bufobj %p should be %p",
1819 bp, bp->b_bufobj, bo));
1820 lblkno = bp->b_lblkno + 1;
1821 if ((bp->b_flags & B_MANAGED) == 0)
1823 bp->b_flags |= B_RELBUF;
1825 * In the VMIO case, use the B_NOREUSE flag to hint that the
1826 * pages backing each buffer in the range are unlikely to be
1827 * reused. Dirty buffers will have the hint applied once
1828 * they've been written.
1830 if (bp->b_vp->v_object != NULL)
1831 bp->b_flags |= B_NOREUSE;
1839 * Truncate a file's buffer and pages to a specified length. This
1840 * is in lieu of the old vinvalbuf mechanism, which performed unneeded
1844 vtruncbuf(struct vnode *vp, struct ucred *cred, off_t length, int blksize)
1846 struct buf *bp, *nbp;
1851 CTR5(KTR_VFS, "%s: vp %p with cred %p and block %d:%ju", __func__,
1852 vp, cred, blksize, (uintmax_t)length);
1855 * Round up to the *next* lbn.
1857 trunclbn = howmany(length, blksize);
1859 ASSERT_VOP_LOCKED(vp, "vtruncbuf");
1866 TAILQ_FOREACH_SAFE(bp, &bo->bo_clean.bv_hd, b_bobufs, nbp) {
1867 if (bp->b_lblkno < trunclbn)
1870 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK,
1871 BO_LOCKPTR(bo)) == ENOLCK)
1875 bp->b_flags |= (B_INVAL | B_RELBUF);
1876 bp->b_flags &= ~B_ASYNC;
1882 (((nbp->b_xflags & BX_VNCLEAN) == 0) ||
1883 (nbp->b_vp != vp) ||
1884 (nbp->b_flags & B_DELWRI))) {
1890 TAILQ_FOREACH_SAFE(bp, &bo->bo_dirty.bv_hd, b_bobufs, nbp) {
1891 if (bp->b_lblkno < trunclbn)
1894 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK,
1895 BO_LOCKPTR(bo)) == ENOLCK)
1898 bp->b_flags |= (B_INVAL | B_RELBUF);
1899 bp->b_flags &= ~B_ASYNC;
1905 (((nbp->b_xflags & BX_VNDIRTY) == 0) ||
1906 (nbp->b_vp != vp) ||
1907 (nbp->b_flags & B_DELWRI) == 0)) {
1916 TAILQ_FOREACH_SAFE(bp, &bo->bo_dirty.bv_hd, b_bobufs, nbp) {
1917 if (bp->b_lblkno > 0)
1920 * Since we hold the vnode lock this should only
1921 * fail if we're racing with the buf daemon.
1924 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK,
1925 BO_LOCKPTR(bo)) == ENOLCK) {
1928 VNASSERT((bp->b_flags & B_DELWRI), vp,
1929 ("buf(%p) on dirty queue without DELWRI", bp));
1938 bufobj_wwait(bo, 0, 0);
1940 vnode_pager_setsize(vp, length);
1946 buf_vlist_remove(struct buf *bp)
1950 KASSERT(bp->b_bufobj != NULL, ("No b_bufobj %p", bp));
1951 ASSERT_BO_WLOCKED(bp->b_bufobj);
1952 KASSERT((bp->b_xflags & (BX_VNDIRTY|BX_VNCLEAN)) !=
1953 (BX_VNDIRTY|BX_VNCLEAN),
1954 ("buf_vlist_remove: Buf %p is on two lists", bp));
1955 if (bp->b_xflags & BX_VNDIRTY)
1956 bv = &bp->b_bufobj->bo_dirty;
1958 bv = &bp->b_bufobj->bo_clean;
1959 BUF_PCTRIE_REMOVE(&bv->bv_root, bp->b_lblkno);
1960 TAILQ_REMOVE(&bv->bv_hd, bp, b_bobufs);
1962 bp->b_xflags &= ~(BX_VNDIRTY | BX_VNCLEAN);
1966 * Add the buffer to the sorted clean or dirty block list.
1968 * NOTE: xflags is passed as a constant, optimizing this inline function!
1971 buf_vlist_add(struct buf *bp, struct bufobj *bo, b_xflags_t xflags)
1977 ASSERT_BO_WLOCKED(bo);
1978 KASSERT((xflags & BX_VNDIRTY) == 0 || (bo->bo_flag & BO_DEAD) == 0,
1979 ("dead bo %p", bo));
1980 KASSERT((bp->b_xflags & (BX_VNDIRTY|BX_VNCLEAN)) == 0,
1981 ("buf_vlist_add: Buf %p has existing xflags %d", bp, bp->b_xflags));
1982 bp->b_xflags |= xflags;
1983 if (xflags & BX_VNDIRTY)
1989 * Keep the list ordered. Optimize empty list insertion. Assume
1990 * we tend to grow at the tail so lookup_le should usually be cheaper
1993 if (bv->bv_cnt == 0 ||
1994 bp->b_lblkno > TAILQ_LAST(&bv->bv_hd, buflists)->b_lblkno)
1995 TAILQ_INSERT_TAIL(&bv->bv_hd, bp, b_bobufs);
1996 else if ((n = BUF_PCTRIE_LOOKUP_LE(&bv->bv_root, bp->b_lblkno)) == NULL)
1997 TAILQ_INSERT_HEAD(&bv->bv_hd, bp, b_bobufs);
1999 TAILQ_INSERT_AFTER(&bv->bv_hd, n, bp, b_bobufs);
2000 error = BUF_PCTRIE_INSERT(&bv->bv_root, bp);
2002 panic("buf_vlist_add: Preallocated nodes insufficient.");
2007 * Look up a buffer using the buffer tries.
2010 gbincore(struct bufobj *bo, daddr_t lblkno)
2014 ASSERT_BO_LOCKED(bo);
2015 bp = BUF_PCTRIE_LOOKUP(&bo->bo_clean.bv_root, lblkno);
2018 return BUF_PCTRIE_LOOKUP(&bo->bo_dirty.bv_root, lblkno);
2022 * Associate a buffer with a vnode.
2025 bgetvp(struct vnode *vp, struct buf *bp)
2030 ASSERT_BO_WLOCKED(bo);
2031 VNASSERT(bp->b_vp == NULL, bp->b_vp, ("bgetvp: not free"));
2033 CTR3(KTR_BUF, "bgetvp(%p) vp %p flags %X", bp, vp, bp->b_flags);
2034 VNASSERT((bp->b_xflags & (BX_VNDIRTY|BX_VNCLEAN)) == 0, vp,
2035 ("bgetvp: bp already attached! %p", bp));
2041 * Insert onto list for new vnode.
2043 buf_vlist_add(bp, bo, BX_VNCLEAN);
2047 * Disassociate a buffer from a vnode.
2050 brelvp(struct buf *bp)
2055 CTR3(KTR_BUF, "brelvp(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
2056 KASSERT(bp->b_vp != NULL, ("brelvp: NULL"));
2059 * Delete from old vnode list, if on one.
2061 vp = bp->b_vp; /* XXX */
2064 if (bp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN))
2065 buf_vlist_remove(bp);
2067 panic("brelvp: Buffer %p not on queue.", bp);
2068 if ((bo->bo_flag & BO_ONWORKLST) && bo->bo_dirty.bv_cnt == 0) {
2069 bo->bo_flag &= ~BO_ONWORKLST;
2070 mtx_lock(&sync_mtx);
2071 LIST_REMOVE(bo, bo_synclist);
2072 syncer_worklist_len--;
2073 mtx_unlock(&sync_mtx);
2076 bp->b_bufobj = NULL;
2082 * Add an item to the syncer work queue.
2085 vn_syncer_add_to_worklist(struct bufobj *bo, int delay)
2089 ASSERT_BO_WLOCKED(bo);
2091 mtx_lock(&sync_mtx);
2092 if (bo->bo_flag & BO_ONWORKLST)
2093 LIST_REMOVE(bo, bo_synclist);
2095 bo->bo_flag |= BO_ONWORKLST;
2096 syncer_worklist_len++;
2099 if (delay > syncer_maxdelay - 2)
2100 delay = syncer_maxdelay - 2;
2101 slot = (syncer_delayno + delay) & syncer_mask;
2103 LIST_INSERT_HEAD(&syncer_workitem_pending[slot], bo, bo_synclist);
2104 mtx_unlock(&sync_mtx);
2108 sysctl_vfs_worklist_len(SYSCTL_HANDLER_ARGS)
2112 mtx_lock(&sync_mtx);
2113 len = syncer_worklist_len - sync_vnode_count;
2114 mtx_unlock(&sync_mtx);
2115 error = SYSCTL_OUT(req, &len, sizeof(len));
2119 SYSCTL_PROC(_vfs, OID_AUTO, worklist_len, CTLTYPE_INT | CTLFLAG_RD, NULL, 0,
2120 sysctl_vfs_worklist_len, "I", "Syncer thread worklist length");
2122 static struct proc *updateproc;
2123 static void sched_sync(void);
2124 static struct kproc_desc up_kp = {
2129 SYSINIT(syncer, SI_SUB_KTHREAD_UPDATE, SI_ORDER_FIRST, kproc_start, &up_kp);
2132 sync_vnode(struct synclist *slp, struct bufobj **bo, struct thread *td)
2137 *bo = LIST_FIRST(slp);
2141 if (VOP_ISLOCKED(vp) != 0 || VI_TRYLOCK(vp) == 0)
2144 * We use vhold in case the vnode does not
2145 * successfully sync. vhold prevents the vnode from
2146 * going away when we unlock the sync_mtx so that
2147 * we can acquire the vnode interlock.
2150 mtx_unlock(&sync_mtx);
2152 if (vn_start_write(vp, &mp, V_NOWAIT) != 0) {
2154 mtx_lock(&sync_mtx);
2155 return (*bo == LIST_FIRST(slp));
2157 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
2158 (void) VOP_FSYNC(vp, MNT_LAZY, td);
2160 vn_finished_write(mp);
2162 if (((*bo)->bo_flag & BO_ONWORKLST) != 0) {
2164 * Put us back on the worklist. The worklist
2165 * routine will remove us from our current
2166 * position and then add us back in at a later
2169 vn_syncer_add_to_worklist(*bo, syncdelay);
2173 mtx_lock(&sync_mtx);
2177 static int first_printf = 1;
2180 * System filesystem synchronizer daemon.
2185 struct synclist *next, *slp;
2188 struct thread *td = curthread;
2190 int net_worklist_len;
2191 int syncer_final_iter;
2195 syncer_final_iter = 0;
2196 syncer_state = SYNCER_RUNNING;
2197 starttime = time_uptime;
2198 td->td_pflags |= TDP_NORUNNINGBUF;
2200 EVENTHANDLER_REGISTER(shutdown_pre_sync, syncer_shutdown, td->td_proc,
2203 mtx_lock(&sync_mtx);
2205 if (syncer_state == SYNCER_FINAL_DELAY &&
2206 syncer_final_iter == 0) {
2207 mtx_unlock(&sync_mtx);
2208 kproc_suspend_check(td->td_proc);
2209 mtx_lock(&sync_mtx);
2211 net_worklist_len = syncer_worklist_len - sync_vnode_count;
2212 if (syncer_state != SYNCER_RUNNING &&
2213 starttime != time_uptime) {
2215 printf("\nSyncing disks, vnodes remaining... ");
2218 printf("%d ", net_worklist_len);
2220 starttime = time_uptime;
2223 * Push files whose dirty time has expired. Be careful
2224 * of interrupt race on slp queue.
2226 * Skip over empty worklist slots when shutting down.
2229 slp = &syncer_workitem_pending[syncer_delayno];
2230 syncer_delayno += 1;
2231 if (syncer_delayno == syncer_maxdelay)
2233 next = &syncer_workitem_pending[syncer_delayno];
2235 * If the worklist has wrapped since the
2236 * it was emptied of all but syncer vnodes,
2237 * switch to the FINAL_DELAY state and run
2238 * for one more second.
2240 if (syncer_state == SYNCER_SHUTTING_DOWN &&
2241 net_worklist_len == 0 &&
2242 last_work_seen == syncer_delayno) {
2243 syncer_state = SYNCER_FINAL_DELAY;
2244 syncer_final_iter = SYNCER_SHUTDOWN_SPEEDUP;
2246 } while (syncer_state != SYNCER_RUNNING && LIST_EMPTY(slp) &&
2247 syncer_worklist_len > 0);
2250 * Keep track of the last time there was anything
2251 * on the worklist other than syncer vnodes.
2252 * Return to the SHUTTING_DOWN state if any
2255 if (net_worklist_len > 0 || syncer_state == SYNCER_RUNNING)
2256 last_work_seen = syncer_delayno;
2257 if (net_worklist_len > 0 && syncer_state == SYNCER_FINAL_DELAY)
2258 syncer_state = SYNCER_SHUTTING_DOWN;
2259 while (!LIST_EMPTY(slp)) {
2260 error = sync_vnode(slp, &bo, td);
2262 LIST_REMOVE(bo, bo_synclist);
2263 LIST_INSERT_HEAD(next, bo, bo_synclist);
2267 if (first_printf == 0) {
2269 * Drop the sync mutex, because some watchdog
2270 * drivers need to sleep while patting
2272 mtx_unlock(&sync_mtx);
2273 wdog_kern_pat(WD_LASTVAL);
2274 mtx_lock(&sync_mtx);
2278 if (syncer_state == SYNCER_FINAL_DELAY && syncer_final_iter > 0)
2279 syncer_final_iter--;
2281 * The variable rushjob allows the kernel to speed up the
2282 * processing of the filesystem syncer process. A rushjob
2283 * value of N tells the filesystem syncer to process the next
2284 * N seconds worth of work on its queue ASAP. Currently rushjob
2285 * is used by the soft update code to speed up the filesystem
2286 * syncer process when the incore state is getting so far
2287 * ahead of the disk that the kernel memory pool is being
2288 * threatened with exhaustion.
2295 * Just sleep for a short period of time between
2296 * iterations when shutting down to allow some I/O
2299 * If it has taken us less than a second to process the
2300 * current work, then wait. Otherwise start right over
2301 * again. We can still lose time if any single round
2302 * takes more than two seconds, but it does not really
2303 * matter as we are just trying to generally pace the
2304 * filesystem activity.
2306 if (syncer_state != SYNCER_RUNNING ||
2307 time_uptime == starttime) {
2309 sched_prio(td, PPAUSE);
2312 if (syncer_state != SYNCER_RUNNING)
2313 cv_timedwait(&sync_wakeup, &sync_mtx,
2314 hz / SYNCER_SHUTDOWN_SPEEDUP);
2315 else if (time_uptime == starttime)
2316 cv_timedwait(&sync_wakeup, &sync_mtx, hz);
2321 * Request the syncer daemon to speed up its work.
2322 * We never push it to speed up more than half of its
2323 * normal turn time, otherwise it could take over the cpu.
2326 speedup_syncer(void)
2330 mtx_lock(&sync_mtx);
2331 if (rushjob < syncdelay / 2) {
2333 stat_rush_requests += 1;
2336 mtx_unlock(&sync_mtx);
2337 cv_broadcast(&sync_wakeup);
2342 * Tell the syncer to speed up its work and run though its work
2343 * list several times, then tell it to shut down.
2346 syncer_shutdown(void *arg, int howto)
2349 if (howto & RB_NOSYNC)
2351 mtx_lock(&sync_mtx);
2352 syncer_state = SYNCER_SHUTTING_DOWN;
2354 mtx_unlock(&sync_mtx);
2355 cv_broadcast(&sync_wakeup);
2356 kproc_shutdown(arg, howto);
2360 syncer_suspend(void)
2363 syncer_shutdown(updateproc, 0);
2370 mtx_lock(&sync_mtx);
2372 syncer_state = SYNCER_RUNNING;
2373 mtx_unlock(&sync_mtx);
2374 cv_broadcast(&sync_wakeup);
2375 kproc_resume(updateproc);
2379 * Reassign a buffer from one vnode to another.
2380 * Used to assign file specific control information
2381 * (indirect blocks) to the vnode to which they belong.
2384 reassignbuf(struct buf *bp)
2397 CTR3(KTR_BUF, "reassignbuf(%p) vp %p flags %X",
2398 bp, bp->b_vp, bp->b_flags);
2400 * B_PAGING flagged buffers cannot be reassigned because their vp
2401 * is not fully linked in.
2403 if (bp->b_flags & B_PAGING)
2404 panic("cannot reassign paging buffer");
2407 * Delete from old vnode list, if on one.
2410 if (bp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN))
2411 buf_vlist_remove(bp);
2413 panic("reassignbuf: Buffer %p not on queue.", bp);
2415 * If dirty, put on list of dirty buffers; otherwise insert onto list
2418 if (bp->b_flags & B_DELWRI) {
2419 if ((bo->bo_flag & BO_ONWORKLST) == 0) {
2420 switch (vp->v_type) {
2430 vn_syncer_add_to_worklist(bo, delay);
2432 buf_vlist_add(bp, bo, BX_VNDIRTY);
2434 buf_vlist_add(bp, bo, BX_VNCLEAN);
2436 if ((bo->bo_flag & BO_ONWORKLST) && bo->bo_dirty.bv_cnt == 0) {
2437 mtx_lock(&sync_mtx);
2438 LIST_REMOVE(bo, bo_synclist);
2439 syncer_worklist_len--;
2440 mtx_unlock(&sync_mtx);
2441 bo->bo_flag &= ~BO_ONWORKLST;
2446 bp = TAILQ_FIRST(&bv->bv_hd);
2447 KASSERT(bp == NULL || bp->b_bufobj == bo,
2448 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2449 bp = TAILQ_LAST(&bv->bv_hd, buflists);
2450 KASSERT(bp == NULL || bp->b_bufobj == bo,
2451 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2453 bp = TAILQ_FIRST(&bv->bv_hd);
2454 KASSERT(bp == NULL || bp->b_bufobj == bo,
2455 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2456 bp = TAILQ_LAST(&bv->bv_hd, buflists);
2457 KASSERT(bp == NULL || bp->b_bufobj == bo,
2458 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2464 * A temporary hack until refcount_* APIs are sorted out.
2467 vfs_refcount_acquire_if_not_zero(volatile u_int *count)
2475 if (atomic_fcmpset_int(count, &old, old + 1))
2481 vfs_refcount_release_if_not_last(volatile u_int *count)
2489 if (atomic_fcmpset_int(count, &old, old - 1))
2495 v_init_counters(struct vnode *vp)
2498 VNASSERT(vp->v_type == VNON && vp->v_data == NULL && vp->v_iflag == 0,
2499 vp, ("%s called for an initialized vnode", __FUNCTION__));
2500 ASSERT_VI_UNLOCKED(vp, __FUNCTION__);
2502 refcount_init(&vp->v_holdcnt, 1);
2503 refcount_init(&vp->v_usecount, 1);
2507 v_incr_usecount_locked(struct vnode *vp)
2510 ASSERT_VI_LOCKED(vp, __func__);
2511 if ((vp->v_iflag & VI_OWEINACT) != 0) {
2512 VNASSERT(vp->v_usecount == 0, vp,
2513 ("vnode with usecount and VI_OWEINACT set"));
2514 vp->v_iflag &= ~VI_OWEINACT;
2516 refcount_acquire(&vp->v_usecount);
2517 v_incr_devcount(vp);
2521 * Increment the use count on the vnode, taking care to reference
2522 * the driver's usecount if this is a chardev.
2525 v_incr_usecount(struct vnode *vp)
2528 ASSERT_VI_UNLOCKED(vp, __func__);
2529 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2531 if (vp->v_type != VCHR &&
2532 vfs_refcount_acquire_if_not_zero(&vp->v_usecount)) {
2533 VNASSERT((vp->v_iflag & VI_OWEINACT) == 0, vp,
2534 ("vnode with usecount and VI_OWEINACT set"));
2537 v_incr_usecount_locked(vp);
2543 * Increment si_usecount of the associated device, if any.
2546 v_incr_devcount(struct vnode *vp)
2549 ASSERT_VI_LOCKED(vp, __FUNCTION__);
2550 if (vp->v_type == VCHR && vp->v_rdev != NULL) {
2552 vp->v_rdev->si_usecount++;
2558 * Decrement si_usecount of the associated device, if any.
2561 v_decr_devcount(struct vnode *vp)
2564 ASSERT_VI_LOCKED(vp, __FUNCTION__);
2565 if (vp->v_type == VCHR && vp->v_rdev != NULL) {
2567 vp->v_rdev->si_usecount--;
2573 * Grab a particular vnode from the free list, increment its
2574 * reference count and lock it. VI_DOOMED is set if the vnode
2575 * is being destroyed. Only callers who specify LK_RETRY will
2576 * see doomed vnodes. If inactive processing was delayed in
2577 * vput try to do it here.
2579 * Notes on lockless counter manipulation:
2580 * _vhold, vputx and other routines make various decisions based
2581 * on either holdcnt or usecount being 0. As long as either counter
2582 * is not transitioning 0->1 nor 1->0, the manipulation can be done
2583 * with atomic operations. Otherwise the interlock is taken covering
2584 * both the atomic and additional actions.
2587 vget(struct vnode *vp, int flags, struct thread *td)
2589 int error, oweinact;
2591 VNASSERT((flags & LK_TYPE_MASK) != 0, vp,
2592 ("vget: invalid lock operation"));
2594 if ((flags & LK_INTERLOCK) != 0)
2595 ASSERT_VI_LOCKED(vp, __func__);
2597 ASSERT_VI_UNLOCKED(vp, __func__);
2598 if ((flags & LK_VNHELD) != 0)
2599 VNASSERT((vp->v_holdcnt > 0), vp,
2600 ("vget: LK_VNHELD passed but vnode not held"));
2602 CTR3(KTR_VFS, "%s: vp %p with flags %d", __func__, vp, flags);
2604 if ((flags & LK_VNHELD) == 0)
2605 _vhold(vp, (flags & LK_INTERLOCK) != 0);
2607 if ((error = vn_lock(vp, flags)) != 0) {
2609 CTR2(KTR_VFS, "%s: impossible to lock vnode %p", __func__,
2613 if (vp->v_iflag & VI_DOOMED && (flags & LK_RETRY) == 0)
2614 panic("vget: vn_lock failed to return ENOENT\n");
2616 * We don't guarantee that any particular close will
2617 * trigger inactive processing so just make a best effort
2618 * here at preventing a reference to a removed file. If
2619 * we don't succeed no harm is done.
2621 * Upgrade our holdcnt to a usecount.
2623 if (vp->v_type == VCHR ||
2624 !vfs_refcount_acquire_if_not_zero(&vp->v_usecount)) {
2626 if ((vp->v_iflag & VI_OWEINACT) == 0) {
2630 vp->v_iflag &= ~VI_OWEINACT;
2632 refcount_acquire(&vp->v_usecount);
2633 v_incr_devcount(vp);
2634 if (oweinact && VOP_ISLOCKED(vp) == LK_EXCLUSIVE &&
2635 (flags & LK_NOWAIT) == 0)
2643 * Increase the reference (use) and hold count of a vnode.
2644 * This will also remove the vnode from the free list if it is presently free.
2647 vref(struct vnode *vp)
2650 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2652 v_incr_usecount(vp);
2656 vrefl(struct vnode *vp)
2659 ASSERT_VI_LOCKED(vp, __func__);
2660 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2662 v_incr_usecount_locked(vp);
2666 vrefact(struct vnode *vp)
2669 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2670 if (__predict_false(vp->v_type == VCHR)) {
2671 VNASSERT(vp->v_holdcnt > 0 && vp->v_usecount > 0, vp,
2672 ("%s: wrong ref counts", __func__));
2677 int old = atomic_fetchadd_int(&vp->v_holdcnt, 1);
2678 VNASSERT(old > 0, vp, ("%s: wrong hold count", __func__));
2679 old = atomic_fetchadd_int(&vp->v_usecount, 1);
2680 VNASSERT(old > 0, vp, ("%s: wrong use count", __func__));
2682 refcount_acquire(&vp->v_holdcnt);
2683 refcount_acquire(&vp->v_usecount);
2688 * Return reference count of a vnode.
2690 * The results of this call are only guaranteed when some mechanism is used to
2691 * stop other processes from gaining references to the vnode. This may be the
2692 * case if the caller holds the only reference. This is also useful when stale
2693 * data is acceptable as race conditions may be accounted for by some other
2697 vrefcnt(struct vnode *vp)
2700 return (vp->v_usecount);
2703 #define VPUTX_VRELE 1
2704 #define VPUTX_VPUT 2
2705 #define VPUTX_VUNREF 3
2708 * Decrement the use and hold counts for a vnode.
2710 * See an explanation near vget() as to why atomic operation is safe.
2713 vputx(struct vnode *vp, int func)
2717 KASSERT(vp != NULL, ("vputx: null vp"));
2718 if (func == VPUTX_VUNREF)
2719 ASSERT_VOP_LOCKED(vp, "vunref");
2720 else if (func == VPUTX_VPUT)
2721 ASSERT_VOP_LOCKED(vp, "vput");
2723 KASSERT(func == VPUTX_VRELE, ("vputx: wrong func"));
2724 ASSERT_VI_UNLOCKED(vp, __func__);
2725 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2727 if (vp->v_type != VCHR &&
2728 vfs_refcount_release_if_not_last(&vp->v_usecount)) {
2729 if (func == VPUTX_VPUT)
2738 * We want to hold the vnode until the inactive finishes to
2739 * prevent vgone() races. We drop the use count here and the
2740 * hold count below when we're done.
2742 if (!refcount_release(&vp->v_usecount) ||
2743 (vp->v_iflag & VI_DOINGINACT)) {
2744 if (func == VPUTX_VPUT)
2746 v_decr_devcount(vp);
2751 v_decr_devcount(vp);
2755 if (vp->v_usecount != 0) {
2756 vn_printf(vp, "vputx: usecount not zero for vnode ");
2757 panic("vputx: usecount not zero");
2760 CTR2(KTR_VFS, "%s: return vnode %p to the freelist", __func__, vp);
2763 * We must call VOP_INACTIVE with the node locked. Mark
2764 * as VI_DOINGINACT to avoid recursion.
2766 vp->v_iflag |= VI_OWEINACT;
2769 error = vn_lock(vp, LK_EXCLUSIVE | LK_INTERLOCK);
2773 if (VOP_ISLOCKED(vp) != LK_EXCLUSIVE) {
2774 error = VOP_LOCK(vp, LK_UPGRADE | LK_INTERLOCK |
2780 if (VOP_ISLOCKED(vp) != LK_EXCLUSIVE) {
2781 error = VOP_LOCK(vp, LK_TRYUPGRADE | LK_INTERLOCK);
2786 VNASSERT(vp->v_usecount == 0 || (vp->v_iflag & VI_OWEINACT) == 0, vp,
2787 ("vnode with usecount and VI_OWEINACT set"));
2789 if (vp->v_iflag & VI_OWEINACT)
2790 vinactive(vp, curthread);
2791 if (func != VPUTX_VUNREF)
2798 * Vnode put/release.
2799 * If count drops to zero, call inactive routine and return to freelist.
2802 vrele(struct vnode *vp)
2805 vputx(vp, VPUTX_VRELE);
2809 * Release an already locked vnode. This give the same effects as
2810 * unlock+vrele(), but takes less time and avoids releasing and
2811 * re-aquiring the lock (as vrele() acquires the lock internally.)
2814 vput(struct vnode *vp)
2817 vputx(vp, VPUTX_VPUT);
2821 * Release an exclusively locked vnode. Do not unlock the vnode lock.
2824 vunref(struct vnode *vp)
2827 vputx(vp, VPUTX_VUNREF);
2831 * Increase the hold count and activate if this is the first reference.
2834 _vhold(struct vnode *vp, bool locked)
2839 ASSERT_VI_LOCKED(vp, __func__);
2841 ASSERT_VI_UNLOCKED(vp, __func__);
2842 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2843 if (!locked && vfs_refcount_acquire_if_not_zero(&vp->v_holdcnt)) {
2844 VNASSERT((vp->v_iflag & VI_FREE) == 0, vp,
2845 ("_vhold: vnode with holdcnt is free"));
2851 if ((vp->v_iflag & VI_FREE) == 0) {
2852 refcount_acquire(&vp->v_holdcnt);
2857 VNASSERT(vp->v_holdcnt == 0, vp,
2858 ("%s: wrong hold count", __func__));
2859 VNASSERT(vp->v_op != NULL, vp,
2860 ("%s: vnode already reclaimed.", __func__));
2862 * Remove a vnode from the free list, mark it as in use,
2863 * and put it on the active list.
2865 VNASSERT(vp->v_mount != NULL, vp,
2866 ("_vhold: vnode not on per mount vnode list"));
2868 mtx_lock(&mp->mnt_listmtx);
2869 if ((vp->v_mflag & VMP_TMPMNTFREELIST) != 0) {
2870 TAILQ_REMOVE(&mp->mnt_tmpfreevnodelist, vp, v_actfreelist);
2871 mp->mnt_tmpfreevnodelistsize--;
2872 vp->v_mflag &= ~VMP_TMPMNTFREELIST;
2874 mtx_lock(&vnode_free_list_mtx);
2875 TAILQ_REMOVE(&vnode_free_list, vp, v_actfreelist);
2877 mtx_unlock(&vnode_free_list_mtx);
2879 KASSERT((vp->v_iflag & VI_ACTIVE) == 0,
2880 ("Activating already active vnode"));
2881 vp->v_iflag &= ~VI_FREE;
2882 vp->v_iflag |= VI_ACTIVE;
2883 TAILQ_INSERT_HEAD(&mp->mnt_activevnodelist, vp, v_actfreelist);
2884 mp->mnt_activevnodelistsize++;
2885 mtx_unlock(&mp->mnt_listmtx);
2886 refcount_acquire(&vp->v_holdcnt);
2892 * Drop the hold count of the vnode. If this is the last reference to
2893 * the vnode we place it on the free list unless it has been vgone'd
2894 * (marked VI_DOOMED) in which case we will free it.
2896 * Because the vnode vm object keeps a hold reference on the vnode if
2897 * there is at least one resident non-cached page, the vnode cannot
2898 * leave the active list without the page cleanup done.
2901 _vdrop(struct vnode *vp, bool locked)
2908 ASSERT_VI_LOCKED(vp, __func__);
2910 ASSERT_VI_UNLOCKED(vp, __func__);
2911 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2912 if ((int)vp->v_holdcnt <= 0)
2913 panic("vdrop: holdcnt %d", vp->v_holdcnt);
2914 if (vfs_refcount_release_if_not_last(&vp->v_holdcnt)) {
2922 if (refcount_release(&vp->v_holdcnt) == 0) {
2926 if ((vp->v_iflag & VI_DOOMED) == 0) {
2928 * Mark a vnode as free: remove it from its active list
2929 * and put it up for recycling on the freelist.
2931 VNASSERT(vp->v_op != NULL, vp,
2932 ("vdropl: vnode already reclaimed."));
2933 VNASSERT((vp->v_iflag & VI_FREE) == 0, vp,
2934 ("vnode already free"));
2935 VNASSERT(vp->v_holdcnt == 0, vp,
2936 ("vdropl: freeing when we shouldn't"));
2937 active = vp->v_iflag & VI_ACTIVE;
2938 if ((vp->v_iflag & VI_OWEINACT) == 0) {
2939 vp->v_iflag &= ~VI_ACTIVE;
2942 mtx_lock(&mp->mnt_listmtx);
2944 TAILQ_REMOVE(&mp->mnt_activevnodelist,
2946 mp->mnt_activevnodelistsize--;
2948 TAILQ_INSERT_TAIL(&mp->mnt_tmpfreevnodelist,
2950 mp->mnt_tmpfreevnodelistsize++;
2951 vp->v_iflag |= VI_FREE;
2952 vp->v_mflag |= VMP_TMPMNTFREELIST;
2954 if (mp->mnt_tmpfreevnodelistsize >=
2955 mnt_free_list_batch)
2956 vnlru_return_batch_locked(mp);
2957 mtx_unlock(&mp->mnt_listmtx);
2959 VNASSERT(active == 0, vp,
2960 ("vdropl: active vnode not on per mount "
2962 mtx_lock(&vnode_free_list_mtx);
2963 TAILQ_INSERT_TAIL(&vnode_free_list, vp,
2966 vp->v_iflag |= VI_FREE;
2968 mtx_unlock(&vnode_free_list_mtx);
2972 counter_u64_add(free_owe_inact, 1);
2977 * The vnode has been marked for destruction, so free it.
2979 * The vnode will be returned to the zone where it will
2980 * normally remain until it is needed for another vnode. We
2981 * need to cleanup (or verify that the cleanup has already
2982 * been done) any residual data left from its current use
2983 * so as not to contaminate the freshly allocated vnode.
2985 CTR2(KTR_VFS, "%s: destroying the vnode %p", __func__, vp);
2986 atomic_subtract_long(&numvnodes, 1);
2988 VNASSERT((vp->v_iflag & VI_FREE) == 0, vp,
2989 ("cleaned vnode still on the free list."));
2990 VNASSERT(vp->v_data == NULL, vp, ("cleaned vnode isn't"));
2991 VNASSERT(vp->v_holdcnt == 0, vp, ("Non-zero hold count"));
2992 VNASSERT(vp->v_usecount == 0, vp, ("Non-zero use count"));
2993 VNASSERT(vp->v_writecount == 0, vp, ("Non-zero write count"));
2994 VNASSERT(bo->bo_numoutput == 0, vp, ("Clean vnode has pending I/O's"));
2995 VNASSERT(bo->bo_clean.bv_cnt == 0, vp, ("cleanbufcnt not 0"));
2996 VNASSERT(pctrie_is_empty(&bo->bo_clean.bv_root), vp,
2997 ("clean blk trie not empty"));
2998 VNASSERT(bo->bo_dirty.bv_cnt == 0, vp, ("dirtybufcnt not 0"));
2999 VNASSERT(pctrie_is_empty(&bo->bo_dirty.bv_root), vp,
3000 ("dirty blk trie not empty"));
3001 VNASSERT(TAILQ_EMPTY(&vp->v_cache_dst), vp, ("vp has namecache dst"));
3002 VNASSERT(LIST_EMPTY(&vp->v_cache_src), vp, ("vp has namecache src"));
3003 VNASSERT(vp->v_cache_dd == NULL, vp, ("vp has namecache for .."));
3004 VNASSERT(TAILQ_EMPTY(&vp->v_rl.rl_waiters), vp,
3005 ("Dangling rangelock waiters"));
3008 mac_vnode_destroy(vp);
3010 if (vp->v_pollinfo != NULL) {
3011 destroy_vpollinfo(vp->v_pollinfo);
3012 vp->v_pollinfo = NULL;
3015 /* XXX Elsewhere we detect an already freed vnode via NULL v_op. */
3018 vp->v_mountedhere = NULL;
3021 vp->v_fifoinfo = NULL;
3022 vp->v_lasta = vp->v_clen = vp->v_cstart = vp->v_lastw = 0;
3026 uma_zfree(vnode_zone, vp);
3030 * Call VOP_INACTIVE on the vnode and manage the DOINGINACT and OWEINACT
3031 * flags. DOINGINACT prevents us from recursing in calls to vinactive.
3032 * OWEINACT tracks whether a vnode missed a call to inactive due to a
3033 * failed lock upgrade.
3036 vinactive(struct vnode *vp, struct thread *td)
3038 struct vm_object *obj;
3040 ASSERT_VOP_ELOCKED(vp, "vinactive");
3041 ASSERT_VI_LOCKED(vp, "vinactive");
3042 VNASSERT((vp->v_iflag & VI_DOINGINACT) == 0, vp,
3043 ("vinactive: recursed on VI_DOINGINACT"));
3044 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
3045 vp->v_iflag |= VI_DOINGINACT;
3046 vp->v_iflag &= ~VI_OWEINACT;
3049 * Before moving off the active list, we must be sure that any
3050 * modified pages are converted into the vnode's dirty
3051 * buffers, since these will no longer be checked once the
3052 * vnode is on the inactive list.
3054 * The write-out of the dirty pages is asynchronous. At the
3055 * point that VOP_INACTIVE() is called, there could still be
3056 * pending I/O and dirty pages in the object.
3058 if ((obj = vp->v_object) != NULL && (vp->v_vflag & VV_NOSYNC) == 0 &&
3059 (obj->flags & OBJ_MIGHTBEDIRTY) != 0) {
3060 VM_OBJECT_WLOCK(obj);
3061 vm_object_page_clean(obj, 0, 0, 0);
3062 VM_OBJECT_WUNLOCK(obj);
3064 VOP_INACTIVE(vp, td);
3066 VNASSERT(vp->v_iflag & VI_DOINGINACT, vp,
3067 ("vinactive: lost VI_DOINGINACT"));
3068 vp->v_iflag &= ~VI_DOINGINACT;
3072 * Remove any vnodes in the vnode table belonging to mount point mp.
3074 * If FORCECLOSE is not specified, there should not be any active ones,
3075 * return error if any are found (nb: this is a user error, not a
3076 * system error). If FORCECLOSE is specified, detach any active vnodes
3079 * If WRITECLOSE is set, only flush out regular file vnodes open for
3082 * SKIPSYSTEM causes any vnodes marked VV_SYSTEM to be skipped.
3084 * `rootrefs' specifies the base reference count for the root vnode
3085 * of this filesystem. The root vnode is considered busy if its
3086 * v_usecount exceeds this value. On a successful return, vflush(, td)
3087 * will call vrele() on the root vnode exactly rootrefs times.
3088 * If the SKIPSYSTEM or WRITECLOSE flags are specified, rootrefs must
3092 static int busyprt = 0; /* print out busy vnodes */
3093 SYSCTL_INT(_debug, OID_AUTO, busyprt, CTLFLAG_RW, &busyprt, 0, "Print out busy vnodes");
3097 vflush(struct mount *mp, int rootrefs, int flags, struct thread *td)
3099 struct vnode *vp, *mvp, *rootvp = NULL;
3101 int busy = 0, error;
3103 CTR4(KTR_VFS, "%s: mp %p with rootrefs %d and flags %d", __func__, mp,
3106 KASSERT((flags & (SKIPSYSTEM | WRITECLOSE)) == 0,
3107 ("vflush: bad args"));
3109 * Get the filesystem root vnode. We can vput() it
3110 * immediately, since with rootrefs > 0, it won't go away.
3112 if ((error = VFS_ROOT(mp, LK_EXCLUSIVE, &rootvp)) != 0) {
3113 CTR2(KTR_VFS, "%s: vfs_root lookup failed with %d",
3120 MNT_VNODE_FOREACH_ALL(vp, mp, mvp) {
3122 error = vn_lock(vp, LK_INTERLOCK | LK_EXCLUSIVE);
3125 MNT_VNODE_FOREACH_ALL_ABORT(mp, mvp);
3129 * Skip over a vnodes marked VV_SYSTEM.
3131 if ((flags & SKIPSYSTEM) && (vp->v_vflag & VV_SYSTEM)) {
3137 * If WRITECLOSE is set, flush out unlinked but still open
3138 * files (even if open only for reading) and regular file
3139 * vnodes open for writing.
3141 if (flags & WRITECLOSE) {
3142 if (vp->v_object != NULL) {
3143 VM_OBJECT_WLOCK(vp->v_object);
3144 vm_object_page_clean(vp->v_object, 0, 0, 0);
3145 VM_OBJECT_WUNLOCK(vp->v_object);
3147 error = VOP_FSYNC(vp, MNT_WAIT, td);
3151 MNT_VNODE_FOREACH_ALL_ABORT(mp, mvp);
3154 error = VOP_GETATTR(vp, &vattr, td->td_ucred);
3157 if ((vp->v_type == VNON ||
3158 (error == 0 && vattr.va_nlink > 0)) &&
3159 (vp->v_writecount == 0 || vp->v_type != VREG)) {
3167 * With v_usecount == 0, all we need to do is clear out the
3168 * vnode data structures and we are done.
3170 * If FORCECLOSE is set, forcibly close the vnode.
3172 if (vp->v_usecount == 0 || (flags & FORCECLOSE)) {
3178 vn_printf(vp, "vflush: busy vnode ");
3184 if (rootrefs > 0 && (flags & FORCECLOSE) == 0) {
3186 * If just the root vnode is busy, and if its refcount
3187 * is equal to `rootrefs', then go ahead and kill it.
3190 KASSERT(busy > 0, ("vflush: not busy"));
3191 VNASSERT(rootvp->v_usecount >= rootrefs, rootvp,
3192 ("vflush: usecount %d < rootrefs %d",
3193 rootvp->v_usecount, rootrefs));
3194 if (busy == 1 && rootvp->v_usecount == rootrefs) {
3195 VOP_LOCK(rootvp, LK_EXCLUSIVE|LK_INTERLOCK);
3197 VOP_UNLOCK(rootvp, 0);
3203 CTR2(KTR_VFS, "%s: failing as %d vnodes are busy", __func__,
3207 for (; rootrefs > 0; rootrefs--)
3213 * Recycle an unused vnode to the front of the free list.
3216 vrecycle(struct vnode *vp)
3221 recycled = vrecyclel(vp);
3227 * vrecycle, with the vp interlock held.
3230 vrecyclel(struct vnode *vp)
3234 ASSERT_VOP_ELOCKED(vp, __func__);
3235 ASSERT_VI_LOCKED(vp, __func__);
3236 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
3238 if (vp->v_usecount == 0) {
3246 * Eliminate all activity associated with a vnode
3247 * in preparation for reuse.
3250 vgone(struct vnode *vp)
3258 notify_lowervp_vfs_dummy(struct mount *mp __unused,
3259 struct vnode *lowervp __unused)
3264 * Notify upper mounts about reclaimed or unlinked vnode.
3267 vfs_notify_upper(struct vnode *vp, int event)
3269 static struct vfsops vgonel_vfsops = {
3270 .vfs_reclaim_lowervp = notify_lowervp_vfs_dummy,
3271 .vfs_unlink_lowervp = notify_lowervp_vfs_dummy,
3273 struct mount *mp, *ump, *mmp;
3280 if (TAILQ_EMPTY(&mp->mnt_uppers))
3283 mmp = malloc(sizeof(struct mount), M_TEMP, M_WAITOK | M_ZERO);
3284 mmp->mnt_op = &vgonel_vfsops;
3285 mmp->mnt_kern_flag |= MNTK_MARKER;
3287 mp->mnt_kern_flag |= MNTK_VGONE_UPPER;
3288 for (ump = TAILQ_FIRST(&mp->mnt_uppers); ump != NULL;) {
3289 if ((ump->mnt_kern_flag & MNTK_MARKER) != 0) {
3290 ump = TAILQ_NEXT(ump, mnt_upper_link);
3293 TAILQ_INSERT_AFTER(&mp->mnt_uppers, ump, mmp, mnt_upper_link);
3296 case VFS_NOTIFY_UPPER_RECLAIM:
3297 VFS_RECLAIM_LOWERVP(ump, vp);
3299 case VFS_NOTIFY_UPPER_UNLINK:
3300 VFS_UNLINK_LOWERVP(ump, vp);
3303 KASSERT(0, ("invalid event %d", event));
3307 ump = TAILQ_NEXT(mmp, mnt_upper_link);
3308 TAILQ_REMOVE(&mp->mnt_uppers, mmp, mnt_upper_link);
3311 mp->mnt_kern_flag &= ~MNTK_VGONE_UPPER;
3312 if ((mp->mnt_kern_flag & MNTK_VGONE_WAITER) != 0) {
3313 mp->mnt_kern_flag &= ~MNTK_VGONE_WAITER;
3314 wakeup(&mp->mnt_uppers);
3321 * vgone, with the vp interlock held.
3324 vgonel(struct vnode *vp)
3331 ASSERT_VOP_ELOCKED(vp, "vgonel");
3332 ASSERT_VI_LOCKED(vp, "vgonel");
3333 VNASSERT(vp->v_holdcnt, vp,
3334 ("vgonel: vp %p has no reference.", vp));
3335 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
3339 * Don't vgonel if we're already doomed.
3341 if (vp->v_iflag & VI_DOOMED)
3343 vp->v_iflag |= VI_DOOMED;
3346 * Check to see if the vnode is in use. If so, we have to call
3347 * VOP_CLOSE() and VOP_INACTIVE().
3349 active = vp->v_usecount;
3350 oweinact = (vp->v_iflag & VI_OWEINACT);
3352 vfs_notify_upper(vp, VFS_NOTIFY_UPPER_RECLAIM);
3355 * If purging an active vnode, it must be closed and
3356 * deactivated before being reclaimed.
3359 VOP_CLOSE(vp, FNONBLOCK, NOCRED, td);
3360 if (oweinact || active) {
3362 if ((vp->v_iflag & VI_DOINGINACT) == 0)
3366 if (vp->v_type == VSOCK)
3367 vfs_unp_reclaim(vp);
3370 * Clean out any buffers associated with the vnode.
3371 * If the flush fails, just toss the buffers.
3374 if (!TAILQ_EMPTY(&vp->v_bufobj.bo_dirty.bv_hd))
3375 (void) vn_start_secondary_write(vp, &mp, V_WAIT);
3376 if (vinvalbuf(vp, V_SAVE, 0, 0) != 0) {
3377 while (vinvalbuf(vp, 0, 0, 0) != 0)
3381 BO_LOCK(&vp->v_bufobj);
3382 KASSERT(TAILQ_EMPTY(&vp->v_bufobj.bo_dirty.bv_hd) &&
3383 vp->v_bufobj.bo_dirty.bv_cnt == 0 &&
3384 TAILQ_EMPTY(&vp->v_bufobj.bo_clean.bv_hd) &&
3385 vp->v_bufobj.bo_clean.bv_cnt == 0,
3386 ("vp %p bufobj not invalidated", vp));
3389 * For VMIO bufobj, BO_DEAD is set in vm_object_terminate()
3390 * after the object's page queue is flushed.
3392 if (vp->v_bufobj.bo_object == NULL)
3393 vp->v_bufobj.bo_flag |= BO_DEAD;
3394 BO_UNLOCK(&vp->v_bufobj);
3397 * Reclaim the vnode.
3399 if (VOP_RECLAIM(vp, td))
3400 panic("vgone: cannot reclaim");
3402 vn_finished_secondary_write(mp);
3403 VNASSERT(vp->v_object == NULL, vp,
3404 ("vop_reclaim left v_object vp=%p, tag=%s", vp, vp->v_tag));
3406 * Clear the advisory locks and wake up waiting threads.
3408 (void)VOP_ADVLOCKPURGE(vp);
3411 * Delete from old mount point vnode list.
3416 * Done with purge, reset to the standard lock and invalidate
3420 vp->v_vnlock = &vp->v_lock;
3421 vp->v_op = &dead_vnodeops;
3427 * Calculate the total number of references to a special device.
3430 vcount(struct vnode *vp)
3435 count = vp->v_rdev->si_usecount;
3441 * Same as above, but using the struct cdev *as argument
3444 count_dev(struct cdev *dev)
3449 count = dev->si_usecount;
3455 * Print out a description of a vnode.
3457 static char *typename[] =
3458 {"VNON", "VREG", "VDIR", "VBLK", "VCHR", "VLNK", "VSOCK", "VFIFO", "VBAD",
3462 vn_printf(struct vnode *vp, const char *fmt, ...)
3465 char buf[256], buf2[16];
3471 printf("%p: ", (void *)vp);
3472 printf("tag %s, type %s\n", vp->v_tag, typename[vp->v_type]);
3473 printf(" usecount %d, writecount %d, refcount %d mountedhere %p\n",
3474 vp->v_usecount, vp->v_writecount, vp->v_holdcnt, vp->v_mountedhere);
3477 if (vp->v_vflag & VV_ROOT)
3478 strlcat(buf, "|VV_ROOT", sizeof(buf));
3479 if (vp->v_vflag & VV_ISTTY)
3480 strlcat(buf, "|VV_ISTTY", sizeof(buf));
3481 if (vp->v_vflag & VV_NOSYNC)
3482 strlcat(buf, "|VV_NOSYNC", sizeof(buf));
3483 if (vp->v_vflag & VV_ETERNALDEV)
3484 strlcat(buf, "|VV_ETERNALDEV", sizeof(buf));
3485 if (vp->v_vflag & VV_CACHEDLABEL)
3486 strlcat(buf, "|VV_CACHEDLABEL", sizeof(buf));
3487 if (vp->v_vflag & VV_TEXT)
3488 strlcat(buf, "|VV_TEXT", sizeof(buf));
3489 if (vp->v_vflag & VV_COPYONWRITE)
3490 strlcat(buf, "|VV_COPYONWRITE", sizeof(buf));
3491 if (vp->v_vflag & VV_SYSTEM)
3492 strlcat(buf, "|VV_SYSTEM", sizeof(buf));
3493 if (vp->v_vflag & VV_PROCDEP)
3494 strlcat(buf, "|VV_PROCDEP", sizeof(buf));
3495 if (vp->v_vflag & VV_NOKNOTE)
3496 strlcat(buf, "|VV_NOKNOTE", sizeof(buf));
3497 if (vp->v_vflag & VV_DELETED)
3498 strlcat(buf, "|VV_DELETED", sizeof(buf));
3499 if (vp->v_vflag & VV_MD)
3500 strlcat(buf, "|VV_MD", sizeof(buf));
3501 if (vp->v_vflag & VV_FORCEINSMQ)
3502 strlcat(buf, "|VV_FORCEINSMQ", sizeof(buf));
3503 flags = vp->v_vflag & ~(VV_ROOT | VV_ISTTY | VV_NOSYNC | VV_ETERNALDEV |
3504 VV_CACHEDLABEL | VV_TEXT | VV_COPYONWRITE | VV_SYSTEM | VV_PROCDEP |
3505 VV_NOKNOTE | VV_DELETED | VV_MD | VV_FORCEINSMQ);
3507 snprintf(buf2, sizeof(buf2), "|VV(0x%lx)", flags);
3508 strlcat(buf, buf2, sizeof(buf));
3510 if (vp->v_iflag & VI_MOUNT)
3511 strlcat(buf, "|VI_MOUNT", sizeof(buf));
3512 if (vp->v_iflag & VI_DOOMED)
3513 strlcat(buf, "|VI_DOOMED", sizeof(buf));
3514 if (vp->v_iflag & VI_FREE)
3515 strlcat(buf, "|VI_FREE", sizeof(buf));
3516 if (vp->v_iflag & VI_ACTIVE)
3517 strlcat(buf, "|VI_ACTIVE", sizeof(buf));
3518 if (vp->v_iflag & VI_DOINGINACT)
3519 strlcat(buf, "|VI_DOINGINACT", sizeof(buf));
3520 if (vp->v_iflag & VI_OWEINACT)
3521 strlcat(buf, "|VI_OWEINACT", sizeof(buf));
3522 flags = vp->v_iflag & ~(VI_MOUNT | VI_DOOMED | VI_FREE |
3523 VI_ACTIVE | VI_DOINGINACT | VI_OWEINACT);
3525 snprintf(buf2, sizeof(buf2), "|VI(0x%lx)", flags);
3526 strlcat(buf, buf2, sizeof(buf));
3528 printf(" flags (%s)\n", buf + 1);
3529 if (mtx_owned(VI_MTX(vp)))
3530 printf(" VI_LOCKed");
3531 if (vp->v_object != NULL)
3532 printf(" v_object %p ref %d pages %d "
3533 "cleanbuf %d dirtybuf %d\n",
3534 vp->v_object, vp->v_object->ref_count,
3535 vp->v_object->resident_page_count,
3536 vp->v_bufobj.bo_clean.bv_cnt,
3537 vp->v_bufobj.bo_dirty.bv_cnt);
3539 lockmgr_printinfo(vp->v_vnlock);
3540 if (vp->v_data != NULL)
3546 * List all of the locked vnodes in the system.
3547 * Called when debugging the kernel.
3549 DB_SHOW_COMMAND(lockedvnods, lockedvnodes)
3555 * Note: because this is DDB, we can't obey the locking semantics
3556 * for these structures, which means we could catch an inconsistent
3557 * state and dereference a nasty pointer. Not much to be done
3560 db_printf("Locked vnodes\n");
3561 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
3562 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
3563 if (vp->v_type != VMARKER && VOP_ISLOCKED(vp))
3564 vn_printf(vp, "vnode ");
3570 * Show details about the given vnode.
3572 DB_SHOW_COMMAND(vnode, db_show_vnode)
3578 vp = (struct vnode *)addr;
3579 vn_printf(vp, "vnode ");
3583 * Show details about the given mount point.
3585 DB_SHOW_COMMAND(mount, db_show_mount)
3596 /* No address given, print short info about all mount points. */
3597 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
3598 db_printf("%p %s on %s (%s)\n", mp,
3599 mp->mnt_stat.f_mntfromname,
3600 mp->mnt_stat.f_mntonname,
3601 mp->mnt_stat.f_fstypename);
3605 db_printf("\nMore info: show mount <addr>\n");
3609 mp = (struct mount *)addr;
3610 db_printf("%p %s on %s (%s)\n", mp, mp->mnt_stat.f_mntfromname,
3611 mp->mnt_stat.f_mntonname, mp->mnt_stat.f_fstypename);
3614 mflags = mp->mnt_flag;
3615 #define MNT_FLAG(flag) do { \
3616 if (mflags & (flag)) { \
3617 if (buf[0] != '\0') \
3618 strlcat(buf, ", ", sizeof(buf)); \
3619 strlcat(buf, (#flag) + 4, sizeof(buf)); \
3620 mflags &= ~(flag); \
3623 MNT_FLAG(MNT_RDONLY);
3624 MNT_FLAG(MNT_SYNCHRONOUS);
3625 MNT_FLAG(MNT_NOEXEC);
3626 MNT_FLAG(MNT_NOSUID);
3627 MNT_FLAG(MNT_NFS4ACLS);
3628 MNT_FLAG(MNT_UNION);
3629 MNT_FLAG(MNT_ASYNC);
3630 MNT_FLAG(MNT_SUIDDIR);
3631 MNT_FLAG(MNT_SOFTDEP);
3632 MNT_FLAG(MNT_NOSYMFOLLOW);
3633 MNT_FLAG(MNT_GJOURNAL);
3634 MNT_FLAG(MNT_MULTILABEL);
3636 MNT_FLAG(MNT_NOATIME);
3637 MNT_FLAG(MNT_NOCLUSTERR);
3638 MNT_FLAG(MNT_NOCLUSTERW);
3640 MNT_FLAG(MNT_EXRDONLY);
3641 MNT_FLAG(MNT_EXPORTED);
3642 MNT_FLAG(MNT_DEFEXPORTED);
3643 MNT_FLAG(MNT_EXPORTANON);
3644 MNT_FLAG(MNT_EXKERB);
3645 MNT_FLAG(MNT_EXPUBLIC);
3646 MNT_FLAG(MNT_LOCAL);
3647 MNT_FLAG(MNT_QUOTA);
3648 MNT_FLAG(MNT_ROOTFS);
3650 MNT_FLAG(MNT_IGNORE);
3651 MNT_FLAG(MNT_UPDATE);
3652 MNT_FLAG(MNT_DELEXPORT);
3653 MNT_FLAG(MNT_RELOAD);
3654 MNT_FLAG(MNT_FORCE);
3655 MNT_FLAG(MNT_SNAPSHOT);
3656 MNT_FLAG(MNT_BYFSID);
3660 strlcat(buf, ", ", sizeof(buf));
3661 snprintf(buf + strlen(buf), sizeof(buf) - strlen(buf),
3662 "0x%016jx", mflags);
3664 db_printf(" mnt_flag = %s\n", buf);
3667 flags = mp->mnt_kern_flag;
3668 #define MNT_KERN_FLAG(flag) do { \
3669 if (flags & (flag)) { \
3670 if (buf[0] != '\0') \
3671 strlcat(buf, ", ", sizeof(buf)); \
3672 strlcat(buf, (#flag) + 5, sizeof(buf)); \
3676 MNT_KERN_FLAG(MNTK_UNMOUNTF);
3677 MNT_KERN_FLAG(MNTK_ASYNC);
3678 MNT_KERN_FLAG(MNTK_SOFTDEP);
3679 MNT_KERN_FLAG(MNTK_NOINSMNTQ);
3680 MNT_KERN_FLAG(MNTK_DRAINING);
3681 MNT_KERN_FLAG(MNTK_REFEXPIRE);
3682 MNT_KERN_FLAG(MNTK_EXTENDED_SHARED);
3683 MNT_KERN_FLAG(MNTK_SHARED_WRITES);
3684 MNT_KERN_FLAG(MNTK_NO_IOPF);
3685 MNT_KERN_FLAG(MNTK_VGONE_UPPER);
3686 MNT_KERN_FLAG(MNTK_VGONE_WAITER);
3687 MNT_KERN_FLAG(MNTK_LOOKUP_EXCL_DOTDOT);
3688 MNT_KERN_FLAG(MNTK_MARKER);
3689 MNT_KERN_FLAG(MNTK_USES_BCACHE);
3690 MNT_KERN_FLAG(MNTK_NOASYNC);
3691 MNT_KERN_FLAG(MNTK_UNMOUNT);
3692 MNT_KERN_FLAG(MNTK_MWAIT);
3693 MNT_KERN_FLAG(MNTK_SUSPEND);
3694 MNT_KERN_FLAG(MNTK_SUSPEND2);
3695 MNT_KERN_FLAG(MNTK_SUSPENDED);
3696 MNT_KERN_FLAG(MNTK_LOOKUP_SHARED);
3697 MNT_KERN_FLAG(MNTK_NOKNOTE);
3698 #undef MNT_KERN_FLAG
3701 strlcat(buf, ", ", sizeof(buf));
3702 snprintf(buf + strlen(buf), sizeof(buf) - strlen(buf),
3705 db_printf(" mnt_kern_flag = %s\n", buf);
3707 db_printf(" mnt_opt = ");
3708 opt = TAILQ_FIRST(mp->mnt_opt);
3710 db_printf("%s", opt->name);
3711 opt = TAILQ_NEXT(opt, link);
3712 while (opt != NULL) {
3713 db_printf(", %s", opt->name);
3714 opt = TAILQ_NEXT(opt, link);
3720 db_printf(" mnt_stat = { version=%u type=%u flags=0x%016jx "
3721 "bsize=%ju iosize=%ju blocks=%ju bfree=%ju bavail=%jd files=%ju "
3722 "ffree=%jd syncwrites=%ju asyncwrites=%ju syncreads=%ju "
3723 "asyncreads=%ju namemax=%u owner=%u fsid=[%d, %d] }\n",
3724 (u_int)sp->f_version, (u_int)sp->f_type, (uintmax_t)sp->f_flags,
3725 (uintmax_t)sp->f_bsize, (uintmax_t)sp->f_iosize,
3726 (uintmax_t)sp->f_blocks, (uintmax_t)sp->f_bfree,
3727 (intmax_t)sp->f_bavail, (uintmax_t)sp->f_files,
3728 (intmax_t)sp->f_ffree, (uintmax_t)sp->f_syncwrites,
3729 (uintmax_t)sp->f_asyncwrites, (uintmax_t)sp->f_syncreads,
3730 (uintmax_t)sp->f_asyncreads, (u_int)sp->f_namemax,
3731 (u_int)sp->f_owner, (int)sp->f_fsid.val[0], (int)sp->f_fsid.val[1]);
3733 db_printf(" mnt_cred = { uid=%u ruid=%u",
3734 (u_int)mp->mnt_cred->cr_uid, (u_int)mp->mnt_cred->cr_ruid);
3735 if (jailed(mp->mnt_cred))
3736 db_printf(", jail=%d", mp->mnt_cred->cr_prison->pr_id);
3738 db_printf(" mnt_ref = %d\n", mp->mnt_ref);
3739 db_printf(" mnt_gen = %d\n", mp->mnt_gen);
3740 db_printf(" mnt_nvnodelistsize = %d\n", mp->mnt_nvnodelistsize);
3741 db_printf(" mnt_activevnodelistsize = %d\n",
3742 mp->mnt_activevnodelistsize);
3743 db_printf(" mnt_writeopcount = %d\n", mp->mnt_writeopcount);
3744 db_printf(" mnt_maxsymlinklen = %d\n", mp->mnt_maxsymlinklen);
3745 db_printf(" mnt_iosize_max = %d\n", mp->mnt_iosize_max);
3746 db_printf(" mnt_hashseed = %u\n", mp->mnt_hashseed);
3747 db_printf(" mnt_lockref = %d\n", mp->mnt_lockref);
3748 db_printf(" mnt_secondary_writes = %d\n", mp->mnt_secondary_writes);
3749 db_printf(" mnt_secondary_accwrites = %d\n",
3750 mp->mnt_secondary_accwrites);
3751 db_printf(" mnt_gjprovider = %s\n",
3752 mp->mnt_gjprovider != NULL ? mp->mnt_gjprovider : "NULL");
3754 db_printf("\n\nList of active vnodes\n");
3755 TAILQ_FOREACH(vp, &mp->mnt_activevnodelist, v_actfreelist) {
3756 if (vp->v_type != VMARKER) {
3757 vn_printf(vp, "vnode ");
3762 db_printf("\n\nList of inactive vnodes\n");
3763 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
3764 if (vp->v_type != VMARKER && (vp->v_iflag & VI_ACTIVE) == 0) {
3765 vn_printf(vp, "vnode ");
3774 * Fill in a struct xvfsconf based on a struct vfsconf.
3777 vfsconf2x(struct sysctl_req *req, struct vfsconf *vfsp)
3779 struct xvfsconf xvfsp;
3781 bzero(&xvfsp, sizeof(xvfsp));
3782 strcpy(xvfsp.vfc_name, vfsp->vfc_name);
3783 xvfsp.vfc_typenum = vfsp->vfc_typenum;
3784 xvfsp.vfc_refcount = vfsp->vfc_refcount;
3785 xvfsp.vfc_flags = vfsp->vfc_flags;
3787 * These are unused in userland, we keep them
3788 * to not break binary compatibility.
3790 xvfsp.vfc_vfsops = NULL;
3791 xvfsp.vfc_next = NULL;
3792 return (SYSCTL_OUT(req, &xvfsp, sizeof(xvfsp)));
3795 #ifdef COMPAT_FREEBSD32
3797 uint32_t vfc_vfsops;
3798 char vfc_name[MFSNAMELEN];
3799 int32_t vfc_typenum;
3800 int32_t vfc_refcount;
3806 vfsconf2x32(struct sysctl_req *req, struct vfsconf *vfsp)
3808 struct xvfsconf32 xvfsp;
3810 bzero(&xvfsp, sizeof(xvfsp));
3811 strcpy(xvfsp.vfc_name, vfsp->vfc_name);
3812 xvfsp.vfc_typenum = vfsp->vfc_typenum;
3813 xvfsp.vfc_refcount = vfsp->vfc_refcount;
3814 xvfsp.vfc_flags = vfsp->vfc_flags;
3815 return (SYSCTL_OUT(req, &xvfsp, sizeof(xvfsp)));
3820 * Top level filesystem related information gathering.
3823 sysctl_vfs_conflist(SYSCTL_HANDLER_ARGS)
3825 struct vfsconf *vfsp;
3830 TAILQ_FOREACH(vfsp, &vfsconf, vfc_list) {
3831 #ifdef COMPAT_FREEBSD32
3832 if (req->flags & SCTL_MASK32)
3833 error = vfsconf2x32(req, vfsp);
3836 error = vfsconf2x(req, vfsp);
3844 SYSCTL_PROC(_vfs, OID_AUTO, conflist, CTLTYPE_OPAQUE | CTLFLAG_RD |
3845 CTLFLAG_MPSAFE, NULL, 0, sysctl_vfs_conflist,
3846 "S,xvfsconf", "List of all configured filesystems");
3848 #ifndef BURN_BRIDGES
3849 static int sysctl_ovfs_conf(SYSCTL_HANDLER_ARGS);
3852 vfs_sysctl(SYSCTL_HANDLER_ARGS)
3854 int *name = (int *)arg1 - 1; /* XXX */
3855 u_int namelen = arg2 + 1; /* XXX */
3856 struct vfsconf *vfsp;
3858 log(LOG_WARNING, "userland calling deprecated sysctl, "
3859 "please rebuild world\n");
3861 #if 1 || defined(COMPAT_PRELITE2)
3862 /* Resolve ambiguity between VFS_VFSCONF and VFS_GENERIC. */
3864 return (sysctl_ovfs_conf(oidp, arg1, arg2, req));
3868 case VFS_MAXTYPENUM:
3871 return (SYSCTL_OUT(req, &maxvfsconf, sizeof(int)));
3874 return (ENOTDIR); /* overloaded */
3876 TAILQ_FOREACH(vfsp, &vfsconf, vfc_list) {
3877 if (vfsp->vfc_typenum == name[2])
3882 return (EOPNOTSUPP);
3883 #ifdef COMPAT_FREEBSD32
3884 if (req->flags & SCTL_MASK32)
3885 return (vfsconf2x32(req, vfsp));
3888 return (vfsconf2x(req, vfsp));
3890 return (EOPNOTSUPP);
3893 static SYSCTL_NODE(_vfs, VFS_GENERIC, generic, CTLFLAG_RD | CTLFLAG_SKIP |
3894 CTLFLAG_MPSAFE, vfs_sysctl,
3895 "Generic filesystem");
3897 #if 1 || defined(COMPAT_PRELITE2)
3900 sysctl_ovfs_conf(SYSCTL_HANDLER_ARGS)
3903 struct vfsconf *vfsp;
3904 struct ovfsconf ovfs;
3907 TAILQ_FOREACH(vfsp, &vfsconf, vfc_list) {
3908 bzero(&ovfs, sizeof(ovfs));
3909 ovfs.vfc_vfsops = vfsp->vfc_vfsops; /* XXX used as flag */
3910 strcpy(ovfs.vfc_name, vfsp->vfc_name);
3911 ovfs.vfc_index = vfsp->vfc_typenum;
3912 ovfs.vfc_refcount = vfsp->vfc_refcount;
3913 ovfs.vfc_flags = vfsp->vfc_flags;
3914 error = SYSCTL_OUT(req, &ovfs, sizeof ovfs);
3924 #endif /* 1 || COMPAT_PRELITE2 */
3925 #endif /* !BURN_BRIDGES */
3927 #define KINFO_VNODESLOP 10
3930 * Dump vnode list (via sysctl).
3934 sysctl_vnode(SYSCTL_HANDLER_ARGS)
3942 * Stale numvnodes access is not fatal here.
3945 len = (numvnodes + KINFO_VNODESLOP) * sizeof *xvn;
3947 /* Make an estimate */
3948 return (SYSCTL_OUT(req, 0, len));
3950 error = sysctl_wire_old_buffer(req, 0);
3953 xvn = malloc(len, M_TEMP, M_ZERO | M_WAITOK);
3955 mtx_lock(&mountlist_mtx);
3956 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
3957 if (vfs_busy(mp, MBF_NOWAIT | MBF_MNTLSTLOCK))
3960 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
3964 xvn[n].xv_size = sizeof *xvn;
3965 xvn[n].xv_vnode = vp;
3966 xvn[n].xv_id = 0; /* XXX compat */
3967 #define XV_COPY(field) xvn[n].xv_##field = vp->v_##field
3969 XV_COPY(writecount);
3975 xvn[n].xv_flag = vp->v_vflag;
3977 switch (vp->v_type) {
3984 if (vp->v_rdev == NULL) {
3988 xvn[n].xv_dev = dev2udev(vp->v_rdev);
3991 xvn[n].xv_socket = vp->v_socket;
3994 xvn[n].xv_fifo = vp->v_fifoinfo;
3999 /* shouldn't happen? */
4007 mtx_lock(&mountlist_mtx);
4012 mtx_unlock(&mountlist_mtx);
4014 error = SYSCTL_OUT(req, xvn, n * sizeof *xvn);
4019 SYSCTL_PROC(_kern, KERN_VNODE, vnode, CTLTYPE_OPAQUE | CTLFLAG_RD |
4020 CTLFLAG_MPSAFE, 0, 0, sysctl_vnode, "S,xvnode",
4025 unmount_or_warn(struct mount *mp)
4029 error = dounmount(mp, MNT_FORCE, curthread);
4031 printf("unmount of %s failed (", mp->mnt_stat.f_mntonname);
4035 printf("%d)\n", error);
4040 * Unmount all filesystems. The list is traversed in reverse order
4041 * of mounting to avoid dependencies.
4044 vfs_unmountall(void)
4046 struct mount *mp, *tmp;
4048 CTR1(KTR_VFS, "%s: unmounting all filesystems", __func__);
4051 * Since this only runs when rebooting, it is not interlocked.
4053 TAILQ_FOREACH_REVERSE_SAFE(mp, &mountlist, mntlist, mnt_list, tmp) {
4057 * Forcibly unmounting "/dev" before "/" would prevent clean
4058 * unmount of the latter.
4060 if (mp == rootdevmp)
4063 unmount_or_warn(mp);
4066 if (rootdevmp != NULL)
4067 unmount_or_warn(rootdevmp);
4071 * perform msync on all vnodes under a mount point
4072 * the mount point must be locked.
4075 vfs_msync(struct mount *mp, int flags)
4077 struct vnode *vp, *mvp;
4078 struct vm_object *obj;
4080 CTR2(KTR_VFS, "%s: mp %p", __func__, mp);
4082 vnlru_return_batch(mp);
4084 MNT_VNODE_FOREACH_ACTIVE(vp, mp, mvp) {
4086 if (obj != NULL && (obj->flags & OBJ_MIGHTBEDIRTY) != 0 &&
4087 (flags == MNT_WAIT || VOP_ISLOCKED(vp) == 0)) {
4089 LK_EXCLUSIVE | LK_RETRY | LK_INTERLOCK,
4091 if (vp->v_vflag & VV_NOSYNC) { /* unlinked */
4098 VM_OBJECT_WLOCK(obj);
4099 vm_object_page_clean(obj, 0, 0,
4101 OBJPC_SYNC : OBJPC_NOSYNC);
4102 VM_OBJECT_WUNLOCK(obj);
4112 destroy_vpollinfo_free(struct vpollinfo *vi)
4115 knlist_destroy(&vi->vpi_selinfo.si_note);
4116 mtx_destroy(&vi->vpi_lock);
4117 uma_zfree(vnodepoll_zone, vi);
4121 destroy_vpollinfo(struct vpollinfo *vi)
4124 knlist_clear(&vi->vpi_selinfo.si_note, 1);
4125 seldrain(&vi->vpi_selinfo);
4126 destroy_vpollinfo_free(vi);
4130 * Initialize per-vnode helper structure to hold poll-related state.
4133 v_addpollinfo(struct vnode *vp)
4135 struct vpollinfo *vi;
4137 if (vp->v_pollinfo != NULL)
4139 vi = uma_zalloc(vnodepoll_zone, M_WAITOK | M_ZERO);
4140 mtx_init(&vi->vpi_lock, "vnode pollinfo", NULL, MTX_DEF);
4141 knlist_init(&vi->vpi_selinfo.si_note, vp, vfs_knllock,
4142 vfs_knlunlock, vfs_knl_assert_locked, vfs_knl_assert_unlocked);
4144 if (vp->v_pollinfo != NULL) {
4146 destroy_vpollinfo_free(vi);
4149 vp->v_pollinfo = vi;
4154 * Record a process's interest in events which might happen to
4155 * a vnode. Because poll uses the historic select-style interface
4156 * internally, this routine serves as both the ``check for any
4157 * pending events'' and the ``record my interest in future events''
4158 * functions. (These are done together, while the lock is held,
4159 * to avoid race conditions.)
4162 vn_pollrecord(struct vnode *vp, struct thread *td, int events)
4166 mtx_lock(&vp->v_pollinfo->vpi_lock);
4167 if (vp->v_pollinfo->vpi_revents & events) {
4169 * This leaves events we are not interested
4170 * in available for the other process which
4171 * which presumably had requested them
4172 * (otherwise they would never have been
4175 events &= vp->v_pollinfo->vpi_revents;
4176 vp->v_pollinfo->vpi_revents &= ~events;
4178 mtx_unlock(&vp->v_pollinfo->vpi_lock);
4181 vp->v_pollinfo->vpi_events |= events;
4182 selrecord(td, &vp->v_pollinfo->vpi_selinfo);
4183 mtx_unlock(&vp->v_pollinfo->vpi_lock);
4188 * Routine to create and manage a filesystem syncer vnode.
4190 #define sync_close ((int (*)(struct vop_close_args *))nullop)
4191 static int sync_fsync(struct vop_fsync_args *);
4192 static int sync_inactive(struct vop_inactive_args *);
4193 static int sync_reclaim(struct vop_reclaim_args *);
4195 static struct vop_vector sync_vnodeops = {
4196 .vop_bypass = VOP_EOPNOTSUPP,
4197 .vop_close = sync_close, /* close */
4198 .vop_fsync = sync_fsync, /* fsync */
4199 .vop_inactive = sync_inactive, /* inactive */
4200 .vop_reclaim = sync_reclaim, /* reclaim */
4201 .vop_lock1 = vop_stdlock, /* lock */
4202 .vop_unlock = vop_stdunlock, /* unlock */
4203 .vop_islocked = vop_stdislocked, /* islocked */
4207 * Create a new filesystem syncer vnode for the specified mount point.
4210 vfs_allocate_syncvnode(struct mount *mp)
4214 static long start, incr, next;
4217 /* Allocate a new vnode */
4218 error = getnewvnode("syncer", mp, &sync_vnodeops, &vp);
4220 panic("vfs_allocate_syncvnode: getnewvnode() failed");
4222 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
4223 vp->v_vflag |= VV_FORCEINSMQ;
4224 error = insmntque(vp, mp);
4226 panic("vfs_allocate_syncvnode: insmntque() failed");
4227 vp->v_vflag &= ~VV_FORCEINSMQ;
4230 * Place the vnode onto the syncer worklist. We attempt to
4231 * scatter them about on the list so that they will go off
4232 * at evenly distributed times even if all the filesystems
4233 * are mounted at once.
4236 if (next == 0 || next > syncer_maxdelay) {
4240 start = syncer_maxdelay / 2;
4241 incr = syncer_maxdelay;
4247 vn_syncer_add_to_worklist(bo, syncdelay > 0 ? next % syncdelay : 0);
4248 /* XXX - vn_syncer_add_to_worklist() also grabs and drops sync_mtx. */
4249 mtx_lock(&sync_mtx);
4251 if (mp->mnt_syncer == NULL) {
4252 mp->mnt_syncer = vp;
4255 mtx_unlock(&sync_mtx);
4258 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
4265 vfs_deallocate_syncvnode(struct mount *mp)
4269 mtx_lock(&sync_mtx);
4270 vp = mp->mnt_syncer;
4272 mp->mnt_syncer = NULL;
4273 mtx_unlock(&sync_mtx);
4279 * Do a lazy sync of the filesystem.
4282 sync_fsync(struct vop_fsync_args *ap)
4284 struct vnode *syncvp = ap->a_vp;
4285 struct mount *mp = syncvp->v_mount;
4290 * We only need to do something if this is a lazy evaluation.
4292 if (ap->a_waitfor != MNT_LAZY)
4296 * Move ourselves to the back of the sync list.
4298 bo = &syncvp->v_bufobj;
4300 vn_syncer_add_to_worklist(bo, syncdelay);
4304 * Walk the list of vnodes pushing all that are dirty and
4305 * not already on the sync list.
4307 if (vfs_busy(mp, MBF_NOWAIT) != 0)
4309 if (vn_start_write(NULL, &mp, V_NOWAIT) != 0) {
4313 save = curthread_pflags_set(TDP_SYNCIO);
4314 vfs_msync(mp, MNT_NOWAIT);
4315 error = VFS_SYNC(mp, MNT_LAZY);
4316 curthread_pflags_restore(save);
4317 vn_finished_write(mp);
4323 * The syncer vnode is no referenced.
4326 sync_inactive(struct vop_inactive_args *ap)
4334 * The syncer vnode is no longer needed and is being decommissioned.
4336 * Modifications to the worklist must be protected by sync_mtx.
4339 sync_reclaim(struct vop_reclaim_args *ap)
4341 struct vnode *vp = ap->a_vp;
4346 mtx_lock(&sync_mtx);
4347 if (vp->v_mount->mnt_syncer == vp)
4348 vp->v_mount->mnt_syncer = NULL;
4349 if (bo->bo_flag & BO_ONWORKLST) {
4350 LIST_REMOVE(bo, bo_synclist);
4351 syncer_worklist_len--;
4353 bo->bo_flag &= ~BO_ONWORKLST;
4355 mtx_unlock(&sync_mtx);
4362 * Check if vnode represents a disk device
4365 vn_isdisk(struct vnode *vp, int *errp)
4369 if (vp->v_type != VCHR) {
4375 if (vp->v_rdev == NULL)
4377 else if (vp->v_rdev->si_devsw == NULL)
4379 else if (!(vp->v_rdev->si_devsw->d_flags & D_DISK))
4385 return (error == 0);
4389 * Common filesystem object access control check routine. Accepts a
4390 * vnode's type, "mode", uid and gid, requested access mode, credentials,
4391 * and optional call-by-reference privused argument allowing vaccess()
4392 * to indicate to the caller whether privilege was used to satisfy the
4393 * request (obsoleted). Returns 0 on success, or an errno on failure.
4396 vaccess(enum vtype type, mode_t file_mode, uid_t file_uid, gid_t file_gid,
4397 accmode_t accmode, struct ucred *cred, int *privused)
4399 accmode_t dac_granted;
4400 accmode_t priv_granted;
4402 KASSERT((accmode & ~(VEXEC | VWRITE | VREAD | VADMIN | VAPPEND)) == 0,
4403 ("invalid bit in accmode"));
4404 KASSERT((accmode & VAPPEND) == 0 || (accmode & VWRITE),
4405 ("VAPPEND without VWRITE"));
4408 * Look for a normal, non-privileged way to access the file/directory
4409 * as requested. If it exists, go with that.
4412 if (privused != NULL)
4417 /* Check the owner. */
4418 if (cred->cr_uid == file_uid) {
4419 dac_granted |= VADMIN;
4420 if (file_mode & S_IXUSR)
4421 dac_granted |= VEXEC;
4422 if (file_mode & S_IRUSR)
4423 dac_granted |= VREAD;
4424 if (file_mode & S_IWUSR)
4425 dac_granted |= (VWRITE | VAPPEND);
4427 if ((accmode & dac_granted) == accmode)
4433 /* Otherwise, check the groups (first match) */
4434 if (groupmember(file_gid, cred)) {
4435 if (file_mode & S_IXGRP)
4436 dac_granted |= VEXEC;
4437 if (file_mode & S_IRGRP)
4438 dac_granted |= VREAD;
4439 if (file_mode & S_IWGRP)
4440 dac_granted |= (VWRITE | VAPPEND);
4442 if ((accmode & dac_granted) == accmode)
4448 /* Otherwise, check everyone else. */
4449 if (file_mode & S_IXOTH)
4450 dac_granted |= VEXEC;
4451 if (file_mode & S_IROTH)
4452 dac_granted |= VREAD;
4453 if (file_mode & S_IWOTH)
4454 dac_granted |= (VWRITE | VAPPEND);
4455 if ((accmode & dac_granted) == accmode)
4460 * Build a privilege mask to determine if the set of privileges
4461 * satisfies the requirements when combined with the granted mask
4462 * from above. For each privilege, if the privilege is required,
4463 * bitwise or the request type onto the priv_granted mask.
4469 * For directories, use PRIV_VFS_LOOKUP to satisfy VEXEC
4470 * requests, instead of PRIV_VFS_EXEC.
4472 if ((accmode & VEXEC) && ((dac_granted & VEXEC) == 0) &&
4473 !priv_check_cred(cred, PRIV_VFS_LOOKUP, 0))
4474 priv_granted |= VEXEC;
4477 * Ensure that at least one execute bit is on. Otherwise,
4478 * a privileged user will always succeed, and we don't want
4479 * this to happen unless the file really is executable.
4481 if ((accmode & VEXEC) && ((dac_granted & VEXEC) == 0) &&
4482 (file_mode & (S_IXUSR | S_IXGRP | S_IXOTH)) != 0 &&
4483 !priv_check_cred(cred, PRIV_VFS_EXEC, 0))
4484 priv_granted |= VEXEC;
4487 if ((accmode & VREAD) && ((dac_granted & VREAD) == 0) &&
4488 !priv_check_cred(cred, PRIV_VFS_READ, 0))
4489 priv_granted |= VREAD;
4491 if ((accmode & VWRITE) && ((dac_granted & VWRITE) == 0) &&
4492 !priv_check_cred(cred, PRIV_VFS_WRITE, 0))
4493 priv_granted |= (VWRITE | VAPPEND);
4495 if ((accmode & VADMIN) && ((dac_granted & VADMIN) == 0) &&
4496 !priv_check_cred(cred, PRIV_VFS_ADMIN, 0))
4497 priv_granted |= VADMIN;
4499 if ((accmode & (priv_granted | dac_granted)) == accmode) {
4500 /* XXX audit: privilege used */
4501 if (privused != NULL)
4506 return ((accmode & VADMIN) ? EPERM : EACCES);
4510 * Credential check based on process requesting service, and per-attribute
4514 extattr_check_cred(struct vnode *vp, int attrnamespace, struct ucred *cred,
4515 struct thread *td, accmode_t accmode)
4519 * Kernel-invoked always succeeds.
4525 * Do not allow privileged processes in jail to directly manipulate
4526 * system attributes.
4528 switch (attrnamespace) {
4529 case EXTATTR_NAMESPACE_SYSTEM:
4530 /* Potentially should be: return (EPERM); */
4531 return (priv_check_cred(cred, PRIV_VFS_EXTATTR_SYSTEM, 0));
4532 case EXTATTR_NAMESPACE_USER:
4533 return (VOP_ACCESS(vp, accmode, cred, td));
4539 #ifdef DEBUG_VFS_LOCKS
4541 * This only exists to suppress warnings from unlocked specfs accesses. It is
4542 * no longer ok to have an unlocked VFS.
4544 #define IGNORE_LOCK(vp) (panicstr != NULL || (vp) == NULL || \
4545 (vp)->v_type == VCHR || (vp)->v_type == VBAD)
4547 int vfs_badlock_ddb = 1; /* Drop into debugger on violation. */
4548 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_ddb, CTLFLAG_RW, &vfs_badlock_ddb, 0,
4549 "Drop into debugger on lock violation");
4551 int vfs_badlock_mutex = 1; /* Check for interlock across VOPs. */
4552 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_mutex, CTLFLAG_RW, &vfs_badlock_mutex,
4553 0, "Check for interlock across VOPs");
4555 int vfs_badlock_print = 1; /* Print lock violations. */
4556 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_print, CTLFLAG_RW, &vfs_badlock_print,
4557 0, "Print lock violations");
4559 int vfs_badlock_vnode = 1; /* Print vnode details on lock violations. */
4560 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_vnode, CTLFLAG_RW, &vfs_badlock_vnode,
4561 0, "Print vnode details on lock violations");
4564 int vfs_badlock_backtrace = 1; /* Print backtrace at lock violations. */
4565 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_backtrace, CTLFLAG_RW,
4566 &vfs_badlock_backtrace, 0, "Print backtrace at lock violations");
4570 vfs_badlock(const char *msg, const char *str, struct vnode *vp)
4574 if (vfs_badlock_backtrace)
4577 if (vfs_badlock_vnode)
4578 vn_printf(vp, "vnode ");
4579 if (vfs_badlock_print)
4580 printf("%s: %p %s\n", str, (void *)vp, msg);
4581 if (vfs_badlock_ddb)
4582 kdb_enter(KDB_WHY_VFSLOCK, "lock violation");
4586 assert_vi_locked(struct vnode *vp, const char *str)
4589 if (vfs_badlock_mutex && !mtx_owned(VI_MTX(vp)))
4590 vfs_badlock("interlock is not locked but should be", str, vp);
4594 assert_vi_unlocked(struct vnode *vp, const char *str)
4597 if (vfs_badlock_mutex && mtx_owned(VI_MTX(vp)))
4598 vfs_badlock("interlock is locked but should not be", str, vp);
4602 assert_vop_locked(struct vnode *vp, const char *str)
4606 if (!IGNORE_LOCK(vp)) {
4607 locked = VOP_ISLOCKED(vp);
4608 if (locked == 0 || locked == LK_EXCLOTHER)
4609 vfs_badlock("is not locked but should be", str, vp);
4614 assert_vop_unlocked(struct vnode *vp, const char *str)
4617 if (!IGNORE_LOCK(vp) && VOP_ISLOCKED(vp) == LK_EXCLUSIVE)
4618 vfs_badlock("is locked but should not be", str, vp);
4622 assert_vop_elocked(struct vnode *vp, const char *str)
4625 if (!IGNORE_LOCK(vp) && VOP_ISLOCKED(vp) != LK_EXCLUSIVE)
4626 vfs_badlock("is not exclusive locked but should be", str, vp);
4628 #endif /* DEBUG_VFS_LOCKS */
4631 vop_rename_fail(struct vop_rename_args *ap)
4634 if (ap->a_tvp != NULL)
4636 if (ap->a_tdvp == ap->a_tvp)
4645 vop_rename_pre(void *ap)
4647 struct vop_rename_args *a = ap;
4649 #ifdef DEBUG_VFS_LOCKS
4651 ASSERT_VI_UNLOCKED(a->a_tvp, "VOP_RENAME");
4652 ASSERT_VI_UNLOCKED(a->a_tdvp, "VOP_RENAME");
4653 ASSERT_VI_UNLOCKED(a->a_fvp, "VOP_RENAME");
4654 ASSERT_VI_UNLOCKED(a->a_fdvp, "VOP_RENAME");
4656 /* Check the source (from). */
4657 if (a->a_tdvp->v_vnlock != a->a_fdvp->v_vnlock &&
4658 (a->a_tvp == NULL || a->a_tvp->v_vnlock != a->a_fdvp->v_vnlock))
4659 ASSERT_VOP_UNLOCKED(a->a_fdvp, "vop_rename: fdvp locked");
4660 if (a->a_tvp == NULL || a->a_tvp->v_vnlock != a->a_fvp->v_vnlock)
4661 ASSERT_VOP_UNLOCKED(a->a_fvp, "vop_rename: fvp locked");
4663 /* Check the target. */
4665 ASSERT_VOP_LOCKED(a->a_tvp, "vop_rename: tvp not locked");
4666 ASSERT_VOP_LOCKED(a->a_tdvp, "vop_rename: tdvp not locked");
4668 if (a->a_tdvp != a->a_fdvp)
4670 if (a->a_tvp != a->a_fvp)
4677 #ifdef DEBUG_VFS_LOCKS
4679 vop_strategy_pre(void *ap)
4681 struct vop_strategy_args *a;
4688 * Cluster ops lock their component buffers but not the IO container.
4690 if ((bp->b_flags & B_CLUSTER) != 0)
4693 if (panicstr == NULL && !BUF_ISLOCKED(bp)) {
4694 if (vfs_badlock_print)
4696 "VOP_STRATEGY: bp is not locked but should be\n");
4697 if (vfs_badlock_ddb)
4698 kdb_enter(KDB_WHY_VFSLOCK, "lock violation");
4703 vop_lock_pre(void *ap)
4705 struct vop_lock1_args *a = ap;
4707 if ((a->a_flags & LK_INTERLOCK) == 0)
4708 ASSERT_VI_UNLOCKED(a->a_vp, "VOP_LOCK");
4710 ASSERT_VI_LOCKED(a->a_vp, "VOP_LOCK");
4714 vop_lock_post(void *ap, int rc)
4716 struct vop_lock1_args *a = ap;
4718 ASSERT_VI_UNLOCKED(a->a_vp, "VOP_LOCK");
4719 if (rc == 0 && (a->a_flags & LK_EXCLOTHER) == 0)
4720 ASSERT_VOP_LOCKED(a->a_vp, "VOP_LOCK");
4724 vop_unlock_pre(void *ap)
4726 struct vop_unlock_args *a = ap;
4728 if (a->a_flags & LK_INTERLOCK)
4729 ASSERT_VI_LOCKED(a->a_vp, "VOP_UNLOCK");
4730 ASSERT_VOP_LOCKED(a->a_vp, "VOP_UNLOCK");
4734 vop_unlock_post(void *ap, int rc)
4736 struct vop_unlock_args *a = ap;
4738 if (a->a_flags & LK_INTERLOCK)
4739 ASSERT_VI_UNLOCKED(a->a_vp, "VOP_UNLOCK");
4744 vop_create_post(void *ap, int rc)
4746 struct vop_create_args *a = ap;
4749 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
4753 vop_deleteextattr_post(void *ap, int rc)
4755 struct vop_deleteextattr_args *a = ap;
4758 VFS_KNOTE_LOCKED(a->a_vp, NOTE_ATTRIB);
4762 vop_link_post(void *ap, int rc)
4764 struct vop_link_args *a = ap;
4767 VFS_KNOTE_LOCKED(a->a_vp, NOTE_LINK);
4768 VFS_KNOTE_LOCKED(a->a_tdvp, NOTE_WRITE);
4773 vop_mkdir_post(void *ap, int rc)
4775 struct vop_mkdir_args *a = ap;
4778 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE | NOTE_LINK);
4782 vop_mknod_post(void *ap, int rc)
4784 struct vop_mknod_args *a = ap;
4787 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
4791 vop_reclaim_post(void *ap, int rc)
4793 struct vop_reclaim_args *a = ap;
4796 VFS_KNOTE_LOCKED(a->a_vp, NOTE_REVOKE);
4800 vop_remove_post(void *ap, int rc)
4802 struct vop_remove_args *a = ap;
4805 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
4806 VFS_KNOTE_LOCKED(a->a_vp, NOTE_DELETE);
4811 vop_rename_post(void *ap, int rc)
4813 struct vop_rename_args *a = ap;
4818 if (a->a_fdvp == a->a_tdvp) {
4819 if (a->a_tvp != NULL && a->a_tvp->v_type == VDIR)
4821 VFS_KNOTE_UNLOCKED(a->a_fdvp, hint);
4822 VFS_KNOTE_UNLOCKED(a->a_tdvp, hint);
4824 hint |= NOTE_EXTEND;
4825 if (a->a_fvp->v_type == VDIR)
4827 VFS_KNOTE_UNLOCKED(a->a_fdvp, hint);
4829 if (a->a_fvp->v_type == VDIR && a->a_tvp != NULL &&
4830 a->a_tvp->v_type == VDIR)
4832 VFS_KNOTE_UNLOCKED(a->a_tdvp, hint);
4835 VFS_KNOTE_UNLOCKED(a->a_fvp, NOTE_RENAME);
4837 VFS_KNOTE_UNLOCKED(a->a_tvp, NOTE_DELETE);
4839 if (a->a_tdvp != a->a_fdvp)
4841 if (a->a_tvp != a->a_fvp)
4849 vop_rmdir_post(void *ap, int rc)
4851 struct vop_rmdir_args *a = ap;
4854 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE | NOTE_LINK);
4855 VFS_KNOTE_LOCKED(a->a_vp, NOTE_DELETE);
4860 vop_setattr_post(void *ap, int rc)
4862 struct vop_setattr_args *a = ap;
4865 VFS_KNOTE_LOCKED(a->a_vp, NOTE_ATTRIB);
4869 vop_setextattr_post(void *ap, int rc)
4871 struct vop_setextattr_args *a = ap;
4874 VFS_KNOTE_LOCKED(a->a_vp, NOTE_ATTRIB);
4878 vop_symlink_post(void *ap, int rc)
4880 struct vop_symlink_args *a = ap;
4883 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
4887 vop_open_post(void *ap, int rc)
4889 struct vop_open_args *a = ap;
4892 VFS_KNOTE_LOCKED(a->a_vp, NOTE_OPEN);
4896 vop_close_post(void *ap, int rc)
4898 struct vop_close_args *a = ap;
4900 if (!rc && (a->a_cred != NOCRED || /* filter out revokes */
4901 (a->a_vp->v_iflag & VI_DOOMED) == 0)) {
4902 VFS_KNOTE_LOCKED(a->a_vp, (a->a_fflag & FWRITE) != 0 ?
4903 NOTE_CLOSE_WRITE : NOTE_CLOSE);
4908 vop_read_post(void *ap, int rc)
4910 struct vop_read_args *a = ap;
4913 VFS_KNOTE_LOCKED(a->a_vp, NOTE_READ);
4917 vop_readdir_post(void *ap, int rc)
4919 struct vop_readdir_args *a = ap;
4922 VFS_KNOTE_LOCKED(a->a_vp, NOTE_READ);
4925 static struct knlist fs_knlist;
4928 vfs_event_init(void *arg)
4930 knlist_init_mtx(&fs_knlist, NULL);
4932 /* XXX - correct order? */
4933 SYSINIT(vfs_knlist, SI_SUB_VFS, SI_ORDER_ANY, vfs_event_init, NULL);
4936 vfs_event_signal(fsid_t *fsid, uint32_t event, intptr_t data __unused)
4939 KNOTE_UNLOCKED(&fs_knlist, event);
4942 static int filt_fsattach(struct knote *kn);
4943 static void filt_fsdetach(struct knote *kn);
4944 static int filt_fsevent(struct knote *kn, long hint);
4946 struct filterops fs_filtops = {
4948 .f_attach = filt_fsattach,
4949 .f_detach = filt_fsdetach,
4950 .f_event = filt_fsevent
4954 filt_fsattach(struct knote *kn)
4957 kn->kn_flags |= EV_CLEAR;
4958 knlist_add(&fs_knlist, kn, 0);
4963 filt_fsdetach(struct knote *kn)
4966 knlist_remove(&fs_knlist, kn, 0);
4970 filt_fsevent(struct knote *kn, long hint)
4973 kn->kn_fflags |= hint;
4974 return (kn->kn_fflags != 0);
4978 sysctl_vfs_ctl(SYSCTL_HANDLER_ARGS)
4984 error = SYSCTL_IN(req, &vc, sizeof(vc));
4987 if (vc.vc_vers != VFS_CTL_VERS1)
4989 mp = vfs_getvfs(&vc.vc_fsid);
4992 /* ensure that a specific sysctl goes to the right filesystem. */
4993 if (strcmp(vc.vc_fstypename, "*") != 0 &&
4994 strcmp(vc.vc_fstypename, mp->mnt_vfc->vfc_name) != 0) {
4998 VCTLTOREQ(&vc, req);
4999 error = VFS_SYSCTL(mp, vc.vc_op, req);
5004 SYSCTL_PROC(_vfs, OID_AUTO, ctl, CTLTYPE_OPAQUE | CTLFLAG_WR,
5005 NULL, 0, sysctl_vfs_ctl, "",
5009 * Function to initialize a va_filerev field sensibly.
5010 * XXX: Wouldn't a random number make a lot more sense ??
5013 init_va_filerev(void)
5018 return (((u_quad_t)bt.sec << 32LL) | (bt.frac >> 32LL));
5021 static int filt_vfsread(struct knote *kn, long hint);
5022 static int filt_vfswrite(struct knote *kn, long hint);
5023 static int filt_vfsvnode(struct knote *kn, long hint);
5024 static void filt_vfsdetach(struct knote *kn);
5025 static struct filterops vfsread_filtops = {
5027 .f_detach = filt_vfsdetach,
5028 .f_event = filt_vfsread
5030 static struct filterops vfswrite_filtops = {
5032 .f_detach = filt_vfsdetach,
5033 .f_event = filt_vfswrite
5035 static struct filterops vfsvnode_filtops = {
5037 .f_detach = filt_vfsdetach,
5038 .f_event = filt_vfsvnode
5042 vfs_knllock(void *arg)
5044 struct vnode *vp = arg;
5046 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
5050 vfs_knlunlock(void *arg)
5052 struct vnode *vp = arg;
5058 vfs_knl_assert_locked(void *arg)
5060 #ifdef DEBUG_VFS_LOCKS
5061 struct vnode *vp = arg;
5063 ASSERT_VOP_LOCKED(vp, "vfs_knl_assert_locked");
5068 vfs_knl_assert_unlocked(void *arg)
5070 #ifdef DEBUG_VFS_LOCKS
5071 struct vnode *vp = arg;
5073 ASSERT_VOP_UNLOCKED(vp, "vfs_knl_assert_unlocked");
5078 vfs_kqfilter(struct vop_kqfilter_args *ap)
5080 struct vnode *vp = ap->a_vp;
5081 struct knote *kn = ap->a_kn;
5084 switch (kn->kn_filter) {
5086 kn->kn_fop = &vfsread_filtops;
5089 kn->kn_fop = &vfswrite_filtops;
5092 kn->kn_fop = &vfsvnode_filtops;
5098 kn->kn_hook = (caddr_t)vp;
5101 if (vp->v_pollinfo == NULL)
5103 knl = &vp->v_pollinfo->vpi_selinfo.si_note;
5105 knlist_add(knl, kn, 0);
5111 * Detach knote from vnode
5114 filt_vfsdetach(struct knote *kn)
5116 struct vnode *vp = (struct vnode *)kn->kn_hook;
5118 KASSERT(vp->v_pollinfo != NULL, ("Missing v_pollinfo"));
5119 knlist_remove(&vp->v_pollinfo->vpi_selinfo.si_note, kn, 0);
5125 filt_vfsread(struct knote *kn, long hint)
5127 struct vnode *vp = (struct vnode *)kn->kn_hook;
5132 * filesystem is gone, so set the EOF flag and schedule
5133 * the knote for deletion.
5135 if (hint == NOTE_REVOKE || (hint == 0 && vp->v_type == VBAD)) {
5137 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
5142 if (VOP_GETATTR(vp, &va, curthread->td_ucred))
5146 kn->kn_data = va.va_size - kn->kn_fp->f_offset;
5147 res = (kn->kn_sfflags & NOTE_FILE_POLL) != 0 || kn->kn_data != 0;
5154 filt_vfswrite(struct knote *kn, long hint)
5156 struct vnode *vp = (struct vnode *)kn->kn_hook;
5161 * filesystem is gone, so set the EOF flag and schedule
5162 * the knote for deletion.
5164 if (hint == NOTE_REVOKE || (hint == 0 && vp->v_type == VBAD))
5165 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
5173 filt_vfsvnode(struct knote *kn, long hint)
5175 struct vnode *vp = (struct vnode *)kn->kn_hook;
5179 if (kn->kn_sfflags & hint)
5180 kn->kn_fflags |= hint;
5181 if (hint == NOTE_REVOKE || (hint == 0 && vp->v_type == VBAD)) {
5182 kn->kn_flags |= EV_EOF;
5186 res = (kn->kn_fflags != 0);
5192 vfs_read_dirent(struct vop_readdir_args *ap, struct dirent *dp, off_t off)
5196 if (dp->d_reclen > ap->a_uio->uio_resid)
5197 return (ENAMETOOLONG);
5198 error = uiomove(dp, dp->d_reclen, ap->a_uio);
5200 if (ap->a_ncookies != NULL) {
5201 if (ap->a_cookies != NULL)
5202 free(ap->a_cookies, M_TEMP);
5203 ap->a_cookies = NULL;
5204 *ap->a_ncookies = 0;
5208 if (ap->a_ncookies == NULL)
5211 KASSERT(ap->a_cookies,
5212 ("NULL ap->a_cookies value with non-NULL ap->a_ncookies!"));
5214 *ap->a_cookies = realloc(*ap->a_cookies,
5215 (*ap->a_ncookies + 1) * sizeof(u_long), M_TEMP, M_WAITOK | M_ZERO);
5216 (*ap->a_cookies)[*ap->a_ncookies] = off;
5217 *ap->a_ncookies += 1;
5222 * Mark for update the access time of the file if the filesystem
5223 * supports VOP_MARKATIME. This functionality is used by execve and
5224 * mmap, so we want to avoid the I/O implied by directly setting
5225 * va_atime for the sake of efficiency.
5228 vfs_mark_atime(struct vnode *vp, struct ucred *cred)
5233 ASSERT_VOP_LOCKED(vp, "vfs_mark_atime");
5234 if (mp != NULL && (mp->mnt_flag & (MNT_NOATIME | MNT_RDONLY)) == 0)
5235 (void)VOP_MARKATIME(vp);
5239 * The purpose of this routine is to remove granularity from accmode_t,
5240 * reducing it into standard unix access bits - VEXEC, VREAD, VWRITE,
5241 * VADMIN and VAPPEND.
5243 * If it returns 0, the caller is supposed to continue with the usual
5244 * access checks using 'accmode' as modified by this routine. If it
5245 * returns nonzero value, the caller is supposed to return that value
5248 * Note that after this routine runs, accmode may be zero.
5251 vfs_unixify_accmode(accmode_t *accmode)
5254 * There is no way to specify explicit "deny" rule using
5255 * file mode or POSIX.1e ACLs.
5257 if (*accmode & VEXPLICIT_DENY) {
5263 * None of these can be translated into usual access bits.
5264 * Also, the common case for NFSv4 ACLs is to not contain
5265 * either of these bits. Caller should check for VWRITE
5266 * on the containing directory instead.
5268 if (*accmode & (VDELETE_CHILD | VDELETE))
5271 if (*accmode & VADMIN_PERMS) {
5272 *accmode &= ~VADMIN_PERMS;
5277 * There is no way to deny VREAD_ATTRIBUTES, VREAD_ACL
5278 * or VSYNCHRONIZE using file mode or POSIX.1e ACL.
5280 *accmode &= ~(VSTAT_PERMS | VSYNCHRONIZE);
5286 * These are helper functions for filesystems to traverse all
5287 * their vnodes. See MNT_VNODE_FOREACH_ALL() in sys/mount.h.
5289 * This interface replaces MNT_VNODE_FOREACH.
5292 MALLOC_DEFINE(M_VNODE_MARKER, "vnodemarker", "vnode marker");
5295 __mnt_vnode_next_all(struct vnode **mvp, struct mount *mp)
5300 kern_yield(PRI_USER);
5302 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
5303 for (vp = TAILQ_NEXT(*mvp, v_nmntvnodes); vp != NULL;
5304 vp = TAILQ_NEXT(vp, v_nmntvnodes)) {
5305 /* Allow a racy peek at VI_DOOMED to save a lock acquisition. */
5306 if (vp->v_type == VMARKER || (vp->v_iflag & VI_DOOMED) != 0)
5309 if ((vp->v_iflag & VI_DOOMED) != 0) {
5316 __mnt_vnode_markerfree_all(mvp, mp);
5317 /* MNT_IUNLOCK(mp); -- done in above function */
5318 mtx_assert(MNT_MTX(mp), MA_NOTOWNED);
5321 TAILQ_REMOVE(&mp->mnt_nvnodelist, *mvp, v_nmntvnodes);
5322 TAILQ_INSERT_AFTER(&mp->mnt_nvnodelist, vp, *mvp, v_nmntvnodes);
5328 __mnt_vnode_first_all(struct vnode **mvp, struct mount *mp)
5332 *mvp = malloc(sizeof(struct vnode), M_VNODE_MARKER, M_WAITOK | M_ZERO);
5335 (*mvp)->v_mount = mp;
5336 (*mvp)->v_type = VMARKER;
5338 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
5339 /* Allow a racy peek at VI_DOOMED to save a lock acquisition. */
5340 if (vp->v_type == VMARKER || (vp->v_iflag & VI_DOOMED) != 0)
5343 if ((vp->v_iflag & VI_DOOMED) != 0) {
5352 free(*mvp, M_VNODE_MARKER);
5356 TAILQ_INSERT_AFTER(&mp->mnt_nvnodelist, vp, *mvp, v_nmntvnodes);
5362 __mnt_vnode_markerfree_all(struct vnode **mvp, struct mount *mp)
5370 mtx_assert(MNT_MTX(mp), MA_OWNED);
5372 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
5373 TAILQ_REMOVE(&mp->mnt_nvnodelist, *mvp, v_nmntvnodes);
5376 free(*mvp, M_VNODE_MARKER);
5381 * These are helper functions for filesystems to traverse their
5382 * active vnodes. See MNT_VNODE_FOREACH_ACTIVE() in sys/mount.h
5385 mnt_vnode_markerfree_active(struct vnode **mvp, struct mount *mp)
5388 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
5393 free(*mvp, M_VNODE_MARKER);
5398 * Relock the mp mount vnode list lock with the vp vnode interlock in the
5399 * conventional lock order during mnt_vnode_next_active iteration.
5401 * On entry, the mount vnode list lock is held and the vnode interlock is not.
5402 * The list lock is dropped and reacquired. On success, both locks are held.
5403 * On failure, the mount vnode list lock is held but the vnode interlock is
5404 * not, and the procedure may have yielded.
5407 mnt_vnode_next_active_relock(struct vnode *mvp, struct mount *mp,
5410 const struct vnode *tmp;
5413 VNASSERT(mvp->v_mount == mp && mvp->v_type == VMARKER &&
5414 TAILQ_NEXT(mvp, v_actfreelist) != NULL, mvp,
5415 ("%s: bad marker", __func__));
5416 VNASSERT(vp->v_mount == mp && vp->v_type != VMARKER, vp,
5417 ("%s: inappropriate vnode", __func__));
5418 ASSERT_VI_UNLOCKED(vp, __func__);
5419 mtx_assert(&mp->mnt_listmtx, MA_OWNED);
5423 TAILQ_REMOVE(&mp->mnt_activevnodelist, mvp, v_actfreelist);
5424 TAILQ_INSERT_BEFORE(vp, mvp, v_actfreelist);
5427 * Use a hold to prevent vp from disappearing while the mount vnode
5428 * list lock is dropped and reacquired. Normally a hold would be
5429 * acquired with vhold(), but that might try to acquire the vnode
5430 * interlock, which would be a LOR with the mount vnode list lock.
5432 held = vfs_refcount_acquire_if_not_zero(&vp->v_holdcnt);
5433 mtx_unlock(&mp->mnt_listmtx);
5437 if (!vfs_refcount_release_if_not_last(&vp->v_holdcnt)) {
5441 mtx_lock(&mp->mnt_listmtx);
5444 * Determine whether the vnode is still the next one after the marker,
5445 * excepting any other markers. If the vnode has not been doomed by
5446 * vgone() then the hold should have ensured that it remained on the
5447 * active list. If it has been doomed but is still on the active list,
5448 * don't abort, but rather skip over it (avoid spinning on doomed
5453 tmp = TAILQ_NEXT(tmp, v_actfreelist);
5454 } while (tmp != NULL && tmp->v_type == VMARKER);
5456 mtx_unlock(&mp->mnt_listmtx);
5465 mtx_lock(&mp->mnt_listmtx);
5468 ASSERT_VI_LOCKED(vp, __func__);
5470 ASSERT_VI_UNLOCKED(vp, __func__);
5471 mtx_assert(&mp->mnt_listmtx, MA_OWNED);
5475 static struct vnode *
5476 mnt_vnode_next_active(struct vnode **mvp, struct mount *mp)
5478 struct vnode *vp, *nvp;
5480 mtx_assert(&mp->mnt_listmtx, MA_OWNED);
5481 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
5483 vp = TAILQ_NEXT(*mvp, v_actfreelist);
5484 while (vp != NULL) {
5485 if (vp->v_type == VMARKER) {
5486 vp = TAILQ_NEXT(vp, v_actfreelist);
5490 * Try-lock because this is the wrong lock order. If that does
5491 * not succeed, drop the mount vnode list lock and try to
5492 * reacquire it and the vnode interlock in the right order.
5494 if (!VI_TRYLOCK(vp) &&
5495 !mnt_vnode_next_active_relock(*mvp, mp, vp))
5497 KASSERT(vp->v_type != VMARKER, ("locked marker %p", vp));
5498 KASSERT(vp->v_mount == mp || vp->v_mount == NULL,
5499 ("alien vnode on the active list %p %p", vp, mp));
5500 if (vp->v_mount == mp && (vp->v_iflag & VI_DOOMED) == 0)
5502 nvp = TAILQ_NEXT(vp, v_actfreelist);
5506 TAILQ_REMOVE(&mp->mnt_activevnodelist, *mvp, v_actfreelist);
5508 /* Check if we are done */
5510 mtx_unlock(&mp->mnt_listmtx);
5511 mnt_vnode_markerfree_active(mvp, mp);
5514 TAILQ_INSERT_AFTER(&mp->mnt_activevnodelist, vp, *mvp, v_actfreelist);
5515 mtx_unlock(&mp->mnt_listmtx);
5516 ASSERT_VI_LOCKED(vp, "active iter");
5517 KASSERT((vp->v_iflag & VI_ACTIVE) != 0, ("Non-active vp %p", vp));
5522 __mnt_vnode_next_active(struct vnode **mvp, struct mount *mp)
5526 kern_yield(PRI_USER);
5527 mtx_lock(&mp->mnt_listmtx);
5528 return (mnt_vnode_next_active(mvp, mp));
5532 __mnt_vnode_first_active(struct vnode **mvp, struct mount *mp)
5536 *mvp = malloc(sizeof(struct vnode), M_VNODE_MARKER, M_WAITOK | M_ZERO);
5540 (*mvp)->v_type = VMARKER;
5541 (*mvp)->v_mount = mp;
5543 mtx_lock(&mp->mnt_listmtx);
5544 vp = TAILQ_FIRST(&mp->mnt_activevnodelist);
5546 mtx_unlock(&mp->mnt_listmtx);
5547 mnt_vnode_markerfree_active(mvp, mp);
5550 TAILQ_INSERT_BEFORE(vp, *mvp, v_actfreelist);
5551 return (mnt_vnode_next_active(mvp, mp));
5555 __mnt_vnode_markerfree_active(struct vnode **mvp, struct mount *mp)
5561 mtx_lock(&mp->mnt_listmtx);
5562 TAILQ_REMOVE(&mp->mnt_activevnodelist, *mvp, v_actfreelist);
5563 mtx_unlock(&mp->mnt_listmtx);
5564 mnt_vnode_markerfree_active(mvp, mp);