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$");
47 #include "opt_watchdog.h"
49 #include <sys/param.h>
50 #include <sys/systm.h>
53 #include <sys/capsicum.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>
68 #include <sys/lockf.h>
69 #include <sys/malloc.h>
70 #include <sys/mount.h>
71 #include <sys/namei.h>
72 #include <sys/pctrie.h>
74 #include <sys/reboot.h>
75 #include <sys/refcount.h>
76 #include <sys/rwlock.h>
77 #include <sys/sched.h>
78 #include <sys/sleepqueue.h>
81 #include <sys/sysctl.h>
82 #include <sys/syslog.h>
83 #include <sys/vmmeter.h>
84 #include <sys/vnode.h>
85 #include <sys/watchdog.h>
87 #include <machine/stdarg.h>
89 #include <security/mac/mac_framework.h>
92 #include <vm/vm_object.h>
93 #include <vm/vm_extern.h>
95 #include <vm/vm_map.h>
96 #include <vm/vm_page.h>
97 #include <vm/vm_kern.h>
104 static void delmntque(struct vnode *vp);
105 static int flushbuflist(struct bufv *bufv, int flags, struct bufobj *bo,
106 int slpflag, int slptimeo);
107 static void syncer_shutdown(void *arg, int howto);
108 static int vtryrecycle(struct vnode *vp);
109 static void v_init_counters(struct vnode *);
110 static void v_incr_devcount(struct vnode *);
111 static void v_decr_devcount(struct vnode *);
112 static void vgonel(struct vnode *);
113 static void vfs_knllock(void *arg);
114 static void vfs_knlunlock(void *arg);
115 static void vfs_knl_assert_locked(void *arg);
116 static void vfs_knl_assert_unlocked(void *arg);
117 static void vnlru_return_batches(struct vfsops *mnt_op);
118 static void destroy_vpollinfo(struct vpollinfo *vi);
119 static int v_inval_buf_range_locked(struct vnode *vp, struct bufobj *bo,
120 daddr_t startlbn, daddr_t endlbn);
123 * These fences are intended for cases where some synchronization is
124 * needed between access of v_iflags and lockless vnode refcount (v_holdcnt
125 * and v_usecount) updates. Access to v_iflags is generally synchronized
126 * by the interlock, but we have some internal assertions that check vnode
127 * flags without acquiring the lock. Thus, these fences are INVARIANTS-only
131 #define VNODE_REFCOUNT_FENCE_ACQ() atomic_thread_fence_acq()
132 #define VNODE_REFCOUNT_FENCE_REL() atomic_thread_fence_rel()
134 #define VNODE_REFCOUNT_FENCE_ACQ()
135 #define VNODE_REFCOUNT_FENCE_REL()
139 * Number of vnodes in existence. Increased whenever getnewvnode()
140 * allocates a new vnode, decreased in vdropl() for VI_DOOMED vnode.
142 static unsigned long numvnodes;
144 SYSCTL_ULONG(_vfs, OID_AUTO, numvnodes, CTLFLAG_RD, &numvnodes, 0,
145 "Number of vnodes in existence");
147 static counter_u64_t vnodes_created;
148 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, vnodes_created, CTLFLAG_RD, &vnodes_created,
149 "Number of vnodes created by getnewvnode");
151 static u_long mnt_free_list_batch = 128;
152 SYSCTL_ULONG(_vfs, OID_AUTO, mnt_free_list_batch, CTLFLAG_RW,
153 &mnt_free_list_batch, 0, "Limit of vnodes held on mnt's free list");
156 * Conversion tables for conversion from vnode types to inode formats
159 enum vtype iftovt_tab[16] = {
160 VNON, VFIFO, VCHR, VNON, VDIR, VNON, VBLK, VNON,
161 VREG, VNON, VLNK, VNON, VSOCK, VNON, VNON, VNON
163 int vttoif_tab[10] = {
164 0, S_IFREG, S_IFDIR, S_IFBLK, S_IFCHR, S_IFLNK,
165 S_IFSOCK, S_IFIFO, S_IFMT, S_IFMT
169 * List of vnodes that are ready for recycling.
171 static TAILQ_HEAD(freelst, vnode) vnode_free_list;
174 * "Free" vnode target. Free vnodes are rarely completely free, but are
175 * just ones that are cheap to recycle. Usually they are for files which
176 * have been stat'd but not read; these usually have inode and namecache
177 * data attached to them. This target is the preferred minimum size of a
178 * sub-cache consisting mostly of such files. The system balances the size
179 * of this sub-cache with its complement to try to prevent either from
180 * thrashing while the other is relatively inactive. The targets express
181 * a preference for the best balance.
183 * "Above" this target there are 2 further targets (watermarks) related
184 * to recyling of free vnodes. In the best-operating case, the cache is
185 * exactly full, the free list has size between vlowat and vhiwat above the
186 * free target, and recycling from it and normal use maintains this state.
187 * Sometimes the free list is below vlowat or even empty, but this state
188 * is even better for immediate use provided the cache is not full.
189 * Otherwise, vnlru_proc() runs to reclaim enough vnodes (usually non-free
190 * ones) to reach one of these states. The watermarks are currently hard-
191 * coded as 4% and 9% of the available space higher. These and the default
192 * of 25% for wantfreevnodes are too large if the memory size is large.
193 * E.g., 9% of 75% of MAXVNODES is more than 566000 vnodes to reclaim
194 * whenever vnlru_proc() becomes active.
196 static u_long wantfreevnodes;
197 SYSCTL_ULONG(_vfs, OID_AUTO, wantfreevnodes, CTLFLAG_RW,
198 &wantfreevnodes, 0, "Target for minimum number of \"free\" vnodes");
199 static u_long freevnodes;
200 SYSCTL_ULONG(_vfs, OID_AUTO, freevnodes, CTLFLAG_RD,
201 &freevnodes, 0, "Number of \"free\" vnodes");
203 static counter_u64_t recycles_count;
204 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, recycles, CTLFLAG_RD, &recycles_count,
205 "Number of vnodes recycled to meet vnode cache targets");
208 * Various variables used for debugging the new implementation of
210 * XXX these are probably of (very) limited utility now.
212 static int reassignbufcalls;
213 SYSCTL_INT(_vfs, OID_AUTO, reassignbufcalls, CTLFLAG_RW, &reassignbufcalls, 0,
214 "Number of calls to reassignbuf");
216 static counter_u64_t free_owe_inact;
217 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, free_owe_inact, CTLFLAG_RD, &free_owe_inact,
218 "Number of times free vnodes kept on active list due to VFS "
219 "owing inactivation");
221 /* To keep more than one thread at a time from running vfs_getnewfsid */
222 static struct mtx mntid_mtx;
225 * Lock for any access to the following:
230 static struct mtx vnode_free_list_mtx;
232 /* Publicly exported FS */
233 struct nfs_public nfs_pub;
235 static uma_zone_t buf_trie_zone;
237 /* Zone for allocation of new vnodes - used exclusively by getnewvnode() */
238 static uma_zone_t vnode_zone;
239 static uma_zone_t vnodepoll_zone;
242 * The workitem queue.
244 * It is useful to delay writes of file data and filesystem metadata
245 * for tens of seconds so that quickly created and deleted files need
246 * not waste disk bandwidth being created and removed. To realize this,
247 * we append vnodes to a "workitem" queue. When running with a soft
248 * updates implementation, most pending metadata dependencies should
249 * not wait for more than a few seconds. Thus, mounted on block devices
250 * are delayed only about a half the time that file data is delayed.
251 * Similarly, directory updates are more critical, so are only delayed
252 * about a third the time that file data is delayed. Thus, there are
253 * SYNCER_MAXDELAY queues that are processed round-robin at a rate of
254 * one each second (driven off the filesystem syncer process). The
255 * syncer_delayno variable indicates the next queue that is to be processed.
256 * Items that need to be processed soon are placed in this queue:
258 * syncer_workitem_pending[syncer_delayno]
260 * A delay of fifteen seconds is done by placing the request fifteen
261 * entries later in the queue:
263 * syncer_workitem_pending[(syncer_delayno + 15) & syncer_mask]
266 static int syncer_delayno;
267 static long syncer_mask;
268 LIST_HEAD(synclist, bufobj);
269 static struct synclist *syncer_workitem_pending;
271 * The sync_mtx protects:
276 * syncer_workitem_pending
277 * syncer_worklist_len
280 static struct mtx sync_mtx;
281 static struct cv sync_wakeup;
283 #define SYNCER_MAXDELAY 32
284 static int syncer_maxdelay = SYNCER_MAXDELAY; /* maximum delay time */
285 static int syncdelay = 30; /* max time to delay syncing data */
286 static int filedelay = 30; /* time to delay syncing files */
287 SYSCTL_INT(_kern, OID_AUTO, filedelay, CTLFLAG_RW, &filedelay, 0,
288 "Time to delay syncing files (in seconds)");
289 static int dirdelay = 29; /* time to delay syncing directories */
290 SYSCTL_INT(_kern, OID_AUTO, dirdelay, CTLFLAG_RW, &dirdelay, 0,
291 "Time to delay syncing directories (in seconds)");
292 static int metadelay = 28; /* time to delay syncing metadata */
293 SYSCTL_INT(_kern, OID_AUTO, metadelay, CTLFLAG_RW, &metadelay, 0,
294 "Time to delay syncing metadata (in seconds)");
295 static int rushjob; /* number of slots to run ASAP */
296 static int stat_rush_requests; /* number of times I/O speeded up */
297 SYSCTL_INT(_debug, OID_AUTO, rush_requests, CTLFLAG_RW, &stat_rush_requests, 0,
298 "Number of times I/O speeded up (rush requests)");
301 * When shutting down the syncer, run it at four times normal speed.
303 #define SYNCER_SHUTDOWN_SPEEDUP 4
304 static int sync_vnode_count;
305 static int syncer_worklist_len;
306 static enum { SYNCER_RUNNING, SYNCER_SHUTTING_DOWN, SYNCER_FINAL_DELAY }
309 /* Target for maximum number of vnodes. */
311 static int gapvnodes; /* gap between wanted and desired */
312 static int vhiwat; /* enough extras after expansion */
313 static int vlowat; /* minimal extras before expansion */
314 static int vstir; /* nonzero to stir non-free vnodes */
315 static volatile int vsmalltrigger = 8; /* pref to keep if > this many pages */
318 sysctl_update_desiredvnodes(SYSCTL_HANDLER_ARGS)
320 int error, old_desiredvnodes;
322 old_desiredvnodes = desiredvnodes;
323 if ((error = sysctl_handle_int(oidp, arg1, arg2, req)) != 0)
325 if (old_desiredvnodes != desiredvnodes) {
326 wantfreevnodes = desiredvnodes / 4;
327 /* XXX locking seems to be incomplete. */
328 vfs_hash_changesize(desiredvnodes);
329 cache_changesize(desiredvnodes);
334 SYSCTL_PROC(_kern, KERN_MAXVNODES, maxvnodes,
335 CTLTYPE_INT | CTLFLAG_MPSAFE | CTLFLAG_RW, &desiredvnodes, 0,
336 sysctl_update_desiredvnodes, "I", "Target for maximum number of vnodes");
337 SYSCTL_ULONG(_kern, OID_AUTO, minvnodes, CTLFLAG_RW,
338 &wantfreevnodes, 0, "Old name for vfs.wantfreevnodes (legacy)");
339 static int vnlru_nowhere;
340 SYSCTL_INT(_debug, OID_AUTO, vnlru_nowhere, CTLFLAG_RW,
341 &vnlru_nowhere, 0, "Number of times the vnlru process ran without success");
344 sysctl_try_reclaim_vnode(SYSCTL_HANDLER_ARGS)
349 unsigned long ndflags;
352 if (req->newptr == NULL)
354 if (req->newlen > PATH_MAX)
357 buf = malloc(PATH_MAX + 1, M_TEMP, M_WAITOK);
358 error = SYSCTL_IN(req, buf, req->newlen);
362 buf[req->newlen] = '\0';
364 ndflags = LOCKLEAF | NOFOLLOW | AUDITVNODE1 | NOCACHE | SAVENAME;
365 NDINIT(&nd, LOOKUP, ndflags, UIO_SYSSPACE, buf, curthread);
366 if ((error = namei(&nd)) != 0)
370 if ((vp->v_iflag & VI_DOOMED) != 0) {
372 * This vnode is being recycled. Return != 0 to let the caller
373 * know that the sysctl had no effect. Return EAGAIN because a
374 * subsequent call will likely succeed (since namei will create
375 * a new vnode if necessary)
381 counter_u64_add(recycles_count, 1);
391 sysctl_ftry_reclaim_vnode(SYSCTL_HANDLER_ARGS)
393 struct thread *td = curthread;
399 if (req->newptr == NULL)
402 error = sysctl_handle_int(oidp, &fd, 0, req);
405 error = getvnode(curthread, fd, &cap_fcntl_rights, &fp);
410 error = vn_lock(vp, LK_EXCLUSIVE);
414 counter_u64_add(recycles_count, 1);
422 SYSCTL_PROC(_debug, OID_AUTO, try_reclaim_vnode,
423 CTLTYPE_STRING | CTLFLAG_MPSAFE | CTLFLAG_WR, NULL, 0,
424 sysctl_try_reclaim_vnode, "A", "Try to reclaim a vnode by its pathname");
425 SYSCTL_PROC(_debug, OID_AUTO, ftry_reclaim_vnode,
426 CTLTYPE_INT | CTLFLAG_MPSAFE | CTLFLAG_WR, NULL, 0,
427 sysctl_ftry_reclaim_vnode, "I",
428 "Try to reclaim a vnode by its file descriptor");
430 /* Shift count for (uintptr_t)vp to initialize vp->v_hash. */
434 * Support for the bufobj clean & dirty pctrie.
437 buf_trie_alloc(struct pctrie *ptree)
440 return uma_zalloc(buf_trie_zone, M_NOWAIT);
444 buf_trie_free(struct pctrie *ptree, void *node)
447 uma_zfree(buf_trie_zone, node);
449 PCTRIE_DEFINE(BUF, buf, b_lblkno, buf_trie_alloc, buf_trie_free);
452 * Initialize the vnode management data structures.
454 * Reevaluate the following cap on the number of vnodes after the physical
455 * memory size exceeds 512GB. In the limit, as the physical memory size
456 * grows, the ratio of the memory size in KB to vnodes approaches 64:1.
458 #ifndef MAXVNODES_MAX
459 #define MAXVNODES_MAX (512 * 1024 * 1024 / 64) /* 8M */
463 * Initialize a vnode as it first enters the zone.
466 vnode_init(void *mem, int size, int flags)
475 vp->v_vnlock = &vp->v_lock;
476 mtx_init(&vp->v_interlock, "vnode interlock", NULL, MTX_DEF);
478 * By default, don't allow shared locks unless filesystems opt-in.
480 lockinit(vp->v_vnlock, PVFS, "vnode", VLKTIMEOUT,
481 LK_NOSHARE | LK_IS_VNODE);
485 bufobj_init(&vp->v_bufobj, vp);
487 * Initialize namecache.
489 LIST_INIT(&vp->v_cache_src);
490 TAILQ_INIT(&vp->v_cache_dst);
492 * Initialize rangelocks.
494 rangelock_init(&vp->v_rl);
499 * Free a vnode when it is cleared from the zone.
502 vnode_fini(void *mem, int size)
508 rangelock_destroy(&vp->v_rl);
509 lockdestroy(vp->v_vnlock);
510 mtx_destroy(&vp->v_interlock);
512 rw_destroy(BO_LOCKPTR(bo));
516 * Provide the size of NFS nclnode and NFS fh for calculation of the
517 * vnode memory consumption. The size is specified directly to
518 * eliminate dependency on NFS-private header.
520 * Other filesystems may use bigger or smaller (like UFS and ZFS)
521 * private inode data, but the NFS-based estimation is ample enough.
522 * Still, we care about differences in the size between 64- and 32-bit
525 * Namecache structure size is heuristically
526 * sizeof(struct namecache_ts) + CACHE_PATH_CUTOFF + 1.
529 #define NFS_NCLNODE_SZ (528 + 64)
532 #define NFS_NCLNODE_SZ (360 + 32)
537 vntblinit(void *dummy __unused)
540 int physvnodes, virtvnodes;
543 * Desiredvnodes is a function of the physical memory size and the
544 * kernel's heap size. Generally speaking, it scales with the
545 * physical memory size. The ratio of desiredvnodes to the physical
546 * memory size is 1:16 until desiredvnodes exceeds 98,304.
548 * marginal ratio of desiredvnodes to the physical memory size is
549 * 1:64. However, desiredvnodes is limited by the kernel's heap
550 * size. The memory required by desiredvnodes vnodes and vm objects
551 * must not exceed 1/10th of the kernel's heap size.
553 physvnodes = maxproc + pgtok(vm_cnt.v_page_count) / 64 +
554 3 * min(98304 * 16, pgtok(vm_cnt.v_page_count)) / 64;
555 virtvnodes = vm_kmem_size / (10 * (sizeof(struct vm_object) +
556 sizeof(struct vnode) + NC_SZ * ncsizefactor + NFS_NCLNODE_SZ));
557 desiredvnodes = min(physvnodes, virtvnodes);
558 if (desiredvnodes > MAXVNODES_MAX) {
560 printf("Reducing kern.maxvnodes %d -> %d\n",
561 desiredvnodes, MAXVNODES_MAX);
562 desiredvnodes = MAXVNODES_MAX;
564 wantfreevnodes = desiredvnodes / 4;
565 mtx_init(&mntid_mtx, "mntid", NULL, MTX_DEF);
566 TAILQ_INIT(&vnode_free_list);
567 mtx_init(&vnode_free_list_mtx, "vnode_free_list", NULL, MTX_DEF);
568 vnode_zone = uma_zcreate("VNODE", sizeof (struct vnode), NULL, NULL,
569 vnode_init, vnode_fini, UMA_ALIGN_PTR, 0);
570 vnodepoll_zone = uma_zcreate("VNODEPOLL", sizeof (struct vpollinfo),
571 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
573 * Preallocate enough nodes to support one-per buf so that
574 * we can not fail an insert. reassignbuf() callers can not
575 * tolerate the insertion failure.
577 buf_trie_zone = uma_zcreate("BUF TRIE", pctrie_node_size(),
578 NULL, NULL, pctrie_zone_init, NULL, UMA_ALIGN_PTR,
579 UMA_ZONE_NOFREE | UMA_ZONE_VM);
580 uma_prealloc(buf_trie_zone, nbuf);
582 vnodes_created = counter_u64_alloc(M_WAITOK);
583 recycles_count = counter_u64_alloc(M_WAITOK);
584 free_owe_inact = counter_u64_alloc(M_WAITOK);
587 * Initialize the filesystem syncer.
589 syncer_workitem_pending = hashinit(syncer_maxdelay, M_VNODE,
591 syncer_maxdelay = syncer_mask + 1;
592 mtx_init(&sync_mtx, "Syncer mtx", NULL, MTX_DEF);
593 cv_init(&sync_wakeup, "syncer");
594 for (i = 1; i <= sizeof(struct vnode); i <<= 1)
598 SYSINIT(vfs, SI_SUB_VFS, SI_ORDER_FIRST, vntblinit, NULL);
602 * Mark a mount point as busy. Used to synchronize access and to delay
603 * unmounting. Eventually, mountlist_mtx is not released on failure.
605 * vfs_busy() is a custom lock, it can block the caller.
606 * vfs_busy() only sleeps if the unmount is active on the mount point.
607 * For a mountpoint mp, vfs_busy-enforced lock is before lock of any
608 * vnode belonging to mp.
610 * Lookup uses vfs_busy() to traverse mount points.
612 * / vnode lock A / vnode lock (/var) D
613 * /var vnode lock B /log vnode lock(/var/log) E
614 * vfs_busy lock C vfs_busy lock F
616 * Within each file system, the lock order is C->A->B and F->D->E.
618 * When traversing across mounts, the system follows that lock order:
624 * The lookup() process for namei("/var") illustrates the process:
625 * VOP_LOOKUP() obtains B while A is held
626 * vfs_busy() obtains a shared lock on F while A and B are held
627 * vput() releases lock on B
628 * vput() releases lock on A
629 * VFS_ROOT() obtains lock on D while shared lock on F is held
630 * vfs_unbusy() releases shared lock on F
631 * vn_lock() obtains lock on deadfs vnode vp_crossmp instead of A.
632 * Attempt to lock A (instead of vp_crossmp) while D is held would
633 * violate the global order, causing deadlocks.
635 * dounmount() locks B while F is drained.
638 vfs_busy(struct mount *mp, int flags)
641 MPASS((flags & ~MBF_MASK) == 0);
642 CTR3(KTR_VFS, "%s: mp %p with flags %d", __func__, mp, flags);
644 if (vfs_op_thread_enter(mp)) {
645 MPASS((mp->mnt_kern_flag & MNTK_DRAINING) == 0);
646 MPASS((mp->mnt_kern_flag & MNTK_UNMOUNT) == 0);
647 MPASS((mp->mnt_kern_flag & MNTK_REFEXPIRE) == 0);
648 vfs_mp_count_add_pcpu(mp, ref, 1);
649 vfs_mp_count_add_pcpu(mp, lockref, 1);
650 vfs_op_thread_exit(mp);
651 if (flags & MBF_MNTLSTLOCK)
652 mtx_unlock(&mountlist_mtx);
657 vfs_assert_mount_counters(mp);
660 * If mount point is currently being unmounted, sleep until the
661 * mount point fate is decided. If thread doing the unmounting fails,
662 * it will clear MNTK_UNMOUNT flag before waking us up, indicating
663 * that this mount point has survived the unmount attempt and vfs_busy
664 * should retry. Otherwise the unmounter thread will set MNTK_REFEXPIRE
665 * flag in addition to MNTK_UNMOUNT, indicating that mount point is
666 * about to be really destroyed. vfs_busy needs to release its
667 * reference on the mount point in this case and return with ENOENT,
668 * telling the caller that mount mount it tried to busy is no longer
671 while (mp->mnt_kern_flag & MNTK_UNMOUNT) {
672 if (flags & MBF_NOWAIT || mp->mnt_kern_flag & MNTK_REFEXPIRE) {
675 CTR1(KTR_VFS, "%s: failed busying before sleeping",
679 if (flags & MBF_MNTLSTLOCK)
680 mtx_unlock(&mountlist_mtx);
681 mp->mnt_kern_flag |= MNTK_MWAIT;
682 msleep(mp, MNT_MTX(mp), PVFS | PDROP, "vfs_busy", 0);
683 if (flags & MBF_MNTLSTLOCK)
684 mtx_lock(&mountlist_mtx);
687 if (flags & MBF_MNTLSTLOCK)
688 mtx_unlock(&mountlist_mtx);
695 * Free a busy filesystem.
698 vfs_unbusy(struct mount *mp)
702 CTR2(KTR_VFS, "%s: mp %p", __func__, mp);
704 if (vfs_op_thread_enter(mp)) {
705 MPASS((mp->mnt_kern_flag & MNTK_DRAINING) == 0);
706 vfs_mp_count_sub_pcpu(mp, lockref, 1);
707 vfs_mp_count_sub_pcpu(mp, ref, 1);
708 vfs_op_thread_exit(mp);
713 vfs_assert_mount_counters(mp);
715 c = --mp->mnt_lockref;
716 if (mp->mnt_vfs_ops == 0) {
717 MPASS((mp->mnt_kern_flag & MNTK_DRAINING) == 0);
722 vfs_dump_mount_counters(mp);
723 if (c == 0 && (mp->mnt_kern_flag & MNTK_DRAINING) != 0) {
724 MPASS(mp->mnt_kern_flag & MNTK_UNMOUNT);
725 CTR1(KTR_VFS, "%s: waking up waiters", __func__);
726 mp->mnt_kern_flag &= ~MNTK_DRAINING;
727 wakeup(&mp->mnt_lockref);
733 * Lookup a mount point by filesystem identifier.
736 vfs_getvfs(fsid_t *fsid)
740 CTR2(KTR_VFS, "%s: fsid %p", __func__, fsid);
741 mtx_lock(&mountlist_mtx);
742 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
743 if (mp->mnt_stat.f_fsid.val[0] == fsid->val[0] &&
744 mp->mnt_stat.f_fsid.val[1] == fsid->val[1]) {
746 mtx_unlock(&mountlist_mtx);
750 mtx_unlock(&mountlist_mtx);
751 CTR2(KTR_VFS, "%s: lookup failed for %p id", __func__, fsid);
752 return ((struct mount *) 0);
756 * Lookup a mount point by filesystem identifier, busying it before
759 * To avoid congestion on mountlist_mtx, implement simple direct-mapped
760 * cache for popular filesystem identifiers. The cache is lockess, using
761 * the fact that struct mount's are never freed. In worst case we may
762 * get pointer to unmounted or even different filesystem, so we have to
763 * check what we got, and go slow way if so.
766 vfs_busyfs(fsid_t *fsid)
768 #define FSID_CACHE_SIZE 256
769 typedef struct mount * volatile vmp_t;
770 static vmp_t cache[FSID_CACHE_SIZE];
775 CTR2(KTR_VFS, "%s: fsid %p", __func__, fsid);
776 hash = fsid->val[0] ^ fsid->val[1];
777 hash = (hash >> 16 ^ hash) & (FSID_CACHE_SIZE - 1);
780 mp->mnt_stat.f_fsid.val[0] != fsid->val[0] ||
781 mp->mnt_stat.f_fsid.val[1] != fsid->val[1])
783 if (vfs_busy(mp, 0) != 0) {
787 if (mp->mnt_stat.f_fsid.val[0] == fsid->val[0] &&
788 mp->mnt_stat.f_fsid.val[1] == fsid->val[1])
794 mtx_lock(&mountlist_mtx);
795 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
796 if (mp->mnt_stat.f_fsid.val[0] == fsid->val[0] &&
797 mp->mnt_stat.f_fsid.val[1] == fsid->val[1]) {
798 error = vfs_busy(mp, MBF_MNTLSTLOCK);
801 mtx_unlock(&mountlist_mtx);
808 CTR2(KTR_VFS, "%s: lookup failed for %p id", __func__, fsid);
809 mtx_unlock(&mountlist_mtx);
810 return ((struct mount *) 0);
814 * Check if a user can access privileged mount options.
817 vfs_suser(struct mount *mp, struct thread *td)
821 if (jailed(td->td_ucred)) {
823 * If the jail of the calling thread lacks permission for
824 * this type of file system, deny immediately.
826 if (!prison_allow(td->td_ucred, mp->mnt_vfc->vfc_prison_flag))
830 * If the file system was mounted outside the jail of the
831 * calling thread, deny immediately.
833 if (prison_check(td->td_ucred, mp->mnt_cred) != 0)
838 * If file system supports delegated administration, we don't check
839 * for the PRIV_VFS_MOUNT_OWNER privilege - it will be better verified
840 * by the file system itself.
841 * If this is not the user that did original mount, we check for
842 * the PRIV_VFS_MOUNT_OWNER privilege.
844 if (!(mp->mnt_vfc->vfc_flags & VFCF_DELEGADMIN) &&
845 mp->mnt_cred->cr_uid != td->td_ucred->cr_uid) {
846 if ((error = priv_check(td, PRIV_VFS_MOUNT_OWNER)) != 0)
853 * Get a new unique fsid. Try to make its val[0] unique, since this value
854 * will be used to create fake device numbers for stat(). Also try (but
855 * not so hard) make its val[0] unique mod 2^16, since some emulators only
856 * support 16-bit device numbers. We end up with unique val[0]'s for the
857 * first 2^16 calls and unique val[0]'s mod 2^16 for the first 2^8 calls.
859 * Keep in mind that several mounts may be running in parallel. Starting
860 * the search one past where the previous search terminated is both a
861 * micro-optimization and a defense against returning the same fsid to
865 vfs_getnewfsid(struct mount *mp)
867 static uint16_t mntid_base;
872 CTR2(KTR_VFS, "%s: mp %p", __func__, mp);
873 mtx_lock(&mntid_mtx);
874 mtype = mp->mnt_vfc->vfc_typenum;
875 tfsid.val[1] = mtype;
876 mtype = (mtype & 0xFF) << 24;
878 tfsid.val[0] = makedev(255,
879 mtype | ((mntid_base & 0xFF00) << 8) | (mntid_base & 0xFF));
881 if ((nmp = vfs_getvfs(&tfsid)) == NULL)
885 mp->mnt_stat.f_fsid.val[0] = tfsid.val[0];
886 mp->mnt_stat.f_fsid.val[1] = tfsid.val[1];
887 mtx_unlock(&mntid_mtx);
891 * Knob to control the precision of file timestamps:
893 * 0 = seconds only; nanoseconds zeroed.
894 * 1 = seconds and nanoseconds, accurate within 1/HZ.
895 * 2 = seconds and nanoseconds, truncated to microseconds.
896 * >=3 = seconds and nanoseconds, maximum precision.
898 enum { TSP_SEC, TSP_HZ, TSP_USEC, TSP_NSEC };
900 static int timestamp_precision = TSP_USEC;
901 SYSCTL_INT(_vfs, OID_AUTO, timestamp_precision, CTLFLAG_RW,
902 ×tamp_precision, 0, "File timestamp precision (0: seconds, "
903 "1: sec + ns accurate to 1/HZ, 2: sec + ns truncated to us, "
904 "3+: sec + ns (max. precision))");
907 * Get a current timestamp.
910 vfs_timestamp(struct timespec *tsp)
914 switch (timestamp_precision) {
916 tsp->tv_sec = time_second;
924 TIMEVAL_TO_TIMESPEC(&tv, tsp);
934 * Set vnode attributes to VNOVAL
937 vattr_null(struct vattr *vap)
941 vap->va_size = VNOVAL;
942 vap->va_bytes = VNOVAL;
943 vap->va_mode = VNOVAL;
944 vap->va_nlink = VNOVAL;
945 vap->va_uid = VNOVAL;
946 vap->va_gid = VNOVAL;
947 vap->va_fsid = VNOVAL;
948 vap->va_fileid = VNOVAL;
949 vap->va_blocksize = VNOVAL;
950 vap->va_rdev = VNOVAL;
951 vap->va_atime.tv_sec = VNOVAL;
952 vap->va_atime.tv_nsec = VNOVAL;
953 vap->va_mtime.tv_sec = VNOVAL;
954 vap->va_mtime.tv_nsec = VNOVAL;
955 vap->va_ctime.tv_sec = VNOVAL;
956 vap->va_ctime.tv_nsec = VNOVAL;
957 vap->va_birthtime.tv_sec = VNOVAL;
958 vap->va_birthtime.tv_nsec = VNOVAL;
959 vap->va_flags = VNOVAL;
960 vap->va_gen = VNOVAL;
965 * This routine is called when we have too many vnodes. It attempts
966 * to free <count> vnodes and will potentially free vnodes that still
967 * have VM backing store (VM backing store is typically the cause
968 * of a vnode blowout so we want to do this). Therefore, this operation
969 * is not considered cheap.
971 * A number of conditions may prevent a vnode from being reclaimed.
972 * the buffer cache may have references on the vnode, a directory
973 * vnode may still have references due to the namei cache representing
974 * underlying files, or the vnode may be in active use. It is not
975 * desirable to reuse such vnodes. These conditions may cause the
976 * number of vnodes to reach some minimum value regardless of what
977 * you set kern.maxvnodes to. Do not set kern.maxvnodes too low.
979 * @param mp Try to reclaim vnodes from this mountpoint
980 * @param reclaim_nc_src Only reclaim directories with outgoing namecache
981 * entries if this argument is strue
982 * @param trigger Only reclaim vnodes with fewer than this many resident
984 * @return The number of vnodes that were reclaimed.
987 vlrureclaim(struct mount *mp, bool reclaim_nc_src, int trigger)
990 int count, done, target;
993 vn_start_write(NULL, &mp, V_WAIT);
995 count = mp->mnt_nvnodelistsize;
996 target = count * (int64_t)gapvnodes / imax(desiredvnodes, 1);
997 target = target / 10 + 1;
998 while (count != 0 && done < target) {
999 vp = TAILQ_FIRST(&mp->mnt_nvnodelist);
1000 while (vp != NULL && vp->v_type == VMARKER)
1001 vp = TAILQ_NEXT(vp, v_nmntvnodes);
1005 * XXX LRU is completely broken for non-free vnodes. First
1006 * by calling here in mountpoint order, then by moving
1007 * unselected vnodes to the end here, and most grossly by
1008 * removing the vlruvp() function that was supposed to
1009 * maintain the order. (This function was born broken
1010 * since syncer problems prevented it doing anything.) The
1011 * order is closer to LRC (C = Created).
1013 * LRU reclaiming of vnodes seems to have last worked in
1014 * FreeBSD-3 where LRU wasn't mentioned under any spelling.
1015 * Then there was no hold count, and inactive vnodes were
1016 * simply put on the free list in LRU order. The separate
1017 * lists also break LRU. We prefer to reclaim from the
1018 * free list for technical reasons. This tends to thrash
1019 * the free list to keep very unrecently used held vnodes.
1020 * The problem is mitigated by keeping the free list large.
1022 TAILQ_REMOVE(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
1023 TAILQ_INSERT_TAIL(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
1025 if (!VI_TRYLOCK(vp))
1028 * If it's been deconstructed already, it's still
1029 * referenced, or it exceeds the trigger, skip it.
1030 * Also skip free vnodes. We are trying to make space
1031 * to expand the free list, not reduce it.
1033 if (vp->v_usecount ||
1034 (!reclaim_nc_src && !LIST_EMPTY(&vp->v_cache_src)) ||
1035 ((vp->v_iflag & VI_FREE) != 0) ||
1036 (vp->v_iflag & VI_DOOMED) != 0 || (vp->v_object != NULL &&
1037 vp->v_object->resident_page_count > trigger)) {
1043 if (VOP_LOCK(vp, LK_INTERLOCK|LK_EXCLUSIVE|LK_NOWAIT)) {
1045 goto next_iter_mntunlocked;
1049 * v_usecount may have been bumped after VOP_LOCK() dropped
1050 * the vnode interlock and before it was locked again.
1052 * It is not necessary to recheck VI_DOOMED because it can
1053 * only be set by another thread that holds both the vnode
1054 * lock and vnode interlock. If another thread has the
1055 * vnode lock before we get to VOP_LOCK() and obtains the
1056 * vnode interlock after VOP_LOCK() drops the vnode
1057 * interlock, the other thread will be unable to drop the
1058 * vnode lock before our VOP_LOCK() call fails.
1060 if (vp->v_usecount ||
1061 (!reclaim_nc_src && !LIST_EMPTY(&vp->v_cache_src)) ||
1062 (vp->v_iflag & VI_FREE) != 0 ||
1063 (vp->v_object != NULL &&
1064 vp->v_object->resident_page_count > trigger)) {
1067 goto next_iter_mntunlocked;
1069 KASSERT((vp->v_iflag & VI_DOOMED) == 0,
1070 ("VI_DOOMED unexpectedly detected in vlrureclaim()"));
1071 counter_u64_add(recycles_count, 1);
1076 next_iter_mntunlocked:
1077 if (!should_yield())
1081 if (!should_yield())
1085 kern_yield(PRI_USER);
1090 vn_finished_write(mp);
1094 static int max_vnlru_free = 10000; /* limit on vnode free requests per call */
1095 SYSCTL_INT(_debug, OID_AUTO, max_vnlru_free, CTLFLAG_RW, &max_vnlru_free,
1097 "limit on vnode free requests per call to the vnlru_free routine");
1100 * Attempt to reduce the free list by the requested amount.
1103 vnlru_free_locked(int count, struct vfsops *mnt_op)
1109 tried_batches = false;
1110 mtx_assert(&vnode_free_list_mtx, MA_OWNED);
1111 if (count > max_vnlru_free)
1112 count = max_vnlru_free;
1113 for (; count > 0; count--) {
1114 vp = TAILQ_FIRST(&vnode_free_list);
1116 * The list can be modified while the free_list_mtx
1117 * has been dropped and vp could be NULL here.
1122 mtx_unlock(&vnode_free_list_mtx);
1123 vnlru_return_batches(mnt_op);
1124 tried_batches = true;
1125 mtx_lock(&vnode_free_list_mtx);
1129 VNASSERT(vp->v_op != NULL, vp,
1130 ("vnlru_free: vnode already reclaimed."));
1131 KASSERT((vp->v_iflag & VI_FREE) != 0,
1132 ("Removing vnode not on freelist"));
1133 KASSERT((vp->v_iflag & VI_ACTIVE) == 0,
1134 ("Mangling active vnode"));
1135 TAILQ_REMOVE(&vnode_free_list, vp, v_actfreelist);
1138 * Don't recycle if our vnode is from different type
1139 * of mount point. Note that mp is type-safe, the
1140 * check does not reach unmapped address even if
1141 * vnode is reclaimed.
1142 * Don't recycle if we can't get the interlock without
1145 if ((mnt_op != NULL && (mp = vp->v_mount) != NULL &&
1146 mp->mnt_op != mnt_op) || !VI_TRYLOCK(vp)) {
1147 TAILQ_INSERT_TAIL(&vnode_free_list, vp, v_actfreelist);
1150 VNASSERT((vp->v_iflag & VI_FREE) != 0 && vp->v_holdcnt == 0,
1151 vp, ("vp inconsistent on freelist"));
1154 * The clear of VI_FREE prevents activation of the
1155 * vnode. There is no sense in putting the vnode on
1156 * the mount point active list, only to remove it
1157 * later during recycling. Inline the relevant part
1158 * of vholdl(), to avoid triggering assertions or
1162 vp->v_iflag &= ~VI_FREE;
1163 VNODE_REFCOUNT_FENCE_REL();
1164 refcount_acquire(&vp->v_holdcnt);
1166 mtx_unlock(&vnode_free_list_mtx);
1170 * If the recycled succeeded this vdrop will actually free
1171 * the vnode. If not it will simply place it back on
1175 mtx_lock(&vnode_free_list_mtx);
1180 vnlru_free(int count, struct vfsops *mnt_op)
1183 mtx_lock(&vnode_free_list_mtx);
1184 vnlru_free_locked(count, mnt_op);
1185 mtx_unlock(&vnode_free_list_mtx);
1189 /* XXX some names and initialization are bad for limits and watermarks. */
1195 gapvnodes = imax(desiredvnodes - wantfreevnodes, 100);
1196 vhiwat = gapvnodes / 11; /* 9% -- just under the 10% in vlrureclaim() */
1197 vlowat = vhiwat / 2;
1198 if (numvnodes > desiredvnodes)
1200 space = desiredvnodes - numvnodes;
1201 if (freevnodes > wantfreevnodes)
1202 space += freevnodes - wantfreevnodes;
1207 vnlru_return_batch_locked(struct mount *mp)
1211 mtx_assert(&mp->mnt_listmtx, MA_OWNED);
1213 if (mp->mnt_tmpfreevnodelistsize == 0)
1216 TAILQ_FOREACH(vp, &mp->mnt_tmpfreevnodelist, v_actfreelist) {
1217 VNASSERT((vp->v_mflag & VMP_TMPMNTFREELIST) != 0, vp,
1218 ("vnode without VMP_TMPMNTFREELIST on mnt_tmpfreevnodelist"));
1219 vp->v_mflag &= ~VMP_TMPMNTFREELIST;
1221 mtx_lock(&vnode_free_list_mtx);
1222 TAILQ_CONCAT(&vnode_free_list, &mp->mnt_tmpfreevnodelist, v_actfreelist);
1223 freevnodes += mp->mnt_tmpfreevnodelistsize;
1224 mtx_unlock(&vnode_free_list_mtx);
1225 mp->mnt_tmpfreevnodelistsize = 0;
1229 vnlru_return_batch(struct mount *mp)
1232 mtx_lock(&mp->mnt_listmtx);
1233 vnlru_return_batch_locked(mp);
1234 mtx_unlock(&mp->mnt_listmtx);
1238 vnlru_return_batches(struct vfsops *mnt_op)
1240 struct mount *mp, *nmp;
1243 mtx_lock(&mountlist_mtx);
1244 for (mp = TAILQ_FIRST(&mountlist); mp != NULL; mp = nmp) {
1245 need_unbusy = false;
1246 if (mnt_op != NULL && mp->mnt_op != mnt_op)
1248 if (mp->mnt_tmpfreevnodelistsize == 0)
1250 if (vfs_busy(mp, MBF_NOWAIT | MBF_MNTLSTLOCK) == 0) {
1251 vnlru_return_batch(mp);
1253 mtx_lock(&mountlist_mtx);
1256 nmp = TAILQ_NEXT(mp, mnt_list);
1260 mtx_unlock(&mountlist_mtx);
1264 * Attempt to recycle vnodes in a context that is always safe to block.
1265 * Calling vlrurecycle() from the bowels of filesystem code has some
1266 * interesting deadlock problems.
1268 static struct proc *vnlruproc;
1269 static int vnlruproc_sig;
1274 struct mount *mp, *nmp;
1275 unsigned long onumvnodes;
1276 int done, force, trigger, usevnodes;
1277 bool reclaim_nc_src;
1279 EVENTHANDLER_REGISTER(shutdown_pre_sync, kproc_shutdown, vnlruproc,
1280 SHUTDOWN_PRI_FIRST);
1284 kproc_suspend_check(vnlruproc);
1285 mtx_lock(&vnode_free_list_mtx);
1287 * If numvnodes is too large (due to desiredvnodes being
1288 * adjusted using its sysctl, or emergency growth), first
1289 * try to reduce it by discarding from the free list.
1291 if (numvnodes > desiredvnodes)
1292 vnlru_free_locked(numvnodes - desiredvnodes, NULL);
1294 * Sleep if the vnode cache is in a good state. This is
1295 * when it is not over-full and has space for about a 4%
1296 * or 9% expansion (by growing its size or inexcessively
1297 * reducing its free list). Otherwise, try to reclaim
1298 * space for a 10% expansion.
1300 if (vstir && force == 0) {
1304 if (vspace() >= vlowat && force == 0) {
1306 wakeup(&vnlruproc_sig);
1307 msleep(vnlruproc, &vnode_free_list_mtx,
1308 PVFS|PDROP, "vlruwt", hz);
1311 mtx_unlock(&vnode_free_list_mtx);
1313 onumvnodes = numvnodes;
1315 * Calculate parameters for recycling. These are the same
1316 * throughout the loop to give some semblance of fairness.
1317 * The trigger point is to avoid recycling vnodes with lots
1318 * of resident pages. We aren't trying to free memory; we
1319 * are trying to recycle or at least free vnodes.
1321 if (numvnodes <= desiredvnodes)
1322 usevnodes = numvnodes - freevnodes;
1324 usevnodes = numvnodes;
1328 * The trigger value is is chosen to give a conservatively
1329 * large value to ensure that it alone doesn't prevent
1330 * making progress. The value can easily be so large that
1331 * it is effectively infinite in some congested and
1332 * misconfigured cases, and this is necessary. Normally
1333 * it is about 8 to 100 (pages), which is quite large.
1335 trigger = vm_cnt.v_page_count * 2 / usevnodes;
1337 trigger = vsmalltrigger;
1338 reclaim_nc_src = force >= 3;
1339 mtx_lock(&mountlist_mtx);
1340 for (mp = TAILQ_FIRST(&mountlist); mp != NULL; mp = nmp) {
1341 if (vfs_busy(mp, MBF_NOWAIT | MBF_MNTLSTLOCK)) {
1342 nmp = TAILQ_NEXT(mp, mnt_list);
1345 done += vlrureclaim(mp, reclaim_nc_src, trigger);
1346 mtx_lock(&mountlist_mtx);
1347 nmp = TAILQ_NEXT(mp, mnt_list);
1350 mtx_unlock(&mountlist_mtx);
1351 if (onumvnodes > desiredvnodes && numvnodes <= desiredvnodes)
1352 uma_reclaim(UMA_RECLAIM_DRAIN);
1354 if (force == 0 || force == 1) {
1364 tsleep(vnlruproc, PPAUSE, "vlrup", hz * 3);
1366 kern_yield(PRI_USER);
1368 * After becoming active to expand above low water, keep
1369 * active until above high water.
1371 force = vspace() < vhiwat;
1375 static struct kproc_desc vnlru_kp = {
1380 SYSINIT(vnlru, SI_SUB_KTHREAD_UPDATE, SI_ORDER_FIRST, kproc_start,
1384 * Routines having to do with the management of the vnode table.
1388 * Try to recycle a freed vnode. We abort if anyone picks up a reference
1389 * before we actually vgone(). This function must be called with the vnode
1390 * held to prevent the vnode from being returned to the free list midway
1394 vtryrecycle(struct vnode *vp)
1398 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
1399 VNASSERT(vp->v_holdcnt, vp,
1400 ("vtryrecycle: Recycling vp %p without a reference.", vp));
1402 * This vnode may found and locked via some other list, if so we
1403 * can't recycle it yet.
1405 if (VOP_LOCK(vp, LK_EXCLUSIVE | LK_NOWAIT) != 0) {
1407 "%s: impossible to recycle, vp %p lock is already held",
1409 return (EWOULDBLOCK);
1412 * Don't recycle if its filesystem is being suspended.
1414 if (vn_start_write(vp, &vnmp, V_NOWAIT) != 0) {
1417 "%s: impossible to recycle, cannot start the write for %p",
1422 * If we got this far, we need to acquire the interlock and see if
1423 * anyone picked up this vnode from another list. If not, we will
1424 * mark it with DOOMED via vgonel() so that anyone who does find it
1425 * will skip over it.
1428 if (vp->v_usecount) {
1431 vn_finished_write(vnmp);
1433 "%s: impossible to recycle, %p is already referenced",
1437 if ((vp->v_iflag & VI_DOOMED) == 0) {
1438 counter_u64_add(recycles_count, 1);
1443 vn_finished_write(vnmp);
1451 if (vspace() < vlowat && vnlruproc_sig == 0) {
1458 * Wait if necessary for space for a new vnode.
1461 getnewvnode_wait(int suspended)
1464 mtx_assert(&vnode_free_list_mtx, MA_OWNED);
1465 if (numvnodes >= desiredvnodes) {
1468 * The file system is being suspended. We cannot
1469 * risk a deadlock here, so allow allocation of
1470 * another vnode even if this would give too many.
1474 if (vnlruproc_sig == 0) {
1475 vnlruproc_sig = 1; /* avoid unnecessary wakeups */
1478 msleep(&vnlruproc_sig, &vnode_free_list_mtx, PVFS,
1481 /* Post-adjust like the pre-adjust in getnewvnode(). */
1482 if (numvnodes + 1 > desiredvnodes && freevnodes > 1)
1483 vnlru_free_locked(1, NULL);
1484 return (numvnodes >= desiredvnodes ? ENFILE : 0);
1488 * This hack is fragile, and probably not needed any more now that the
1489 * watermark handling works.
1492 getnewvnode_reserve(u_int count)
1496 /* Pre-adjust like the pre-adjust in getnewvnode(), with any count. */
1497 /* XXX no longer so quick, but this part is not racy. */
1498 mtx_lock(&vnode_free_list_mtx);
1499 if (numvnodes + count > desiredvnodes && freevnodes > wantfreevnodes)
1500 vnlru_free_locked(ulmin(numvnodes + count - desiredvnodes,
1501 freevnodes - wantfreevnodes), NULL);
1502 mtx_unlock(&vnode_free_list_mtx);
1505 /* First try to be quick and racy. */
1506 if (atomic_fetchadd_long(&numvnodes, count) + count <= desiredvnodes) {
1507 td->td_vp_reserv += count;
1508 vcheckspace(); /* XXX no longer so quick, but more racy */
1511 atomic_subtract_long(&numvnodes, count);
1513 mtx_lock(&vnode_free_list_mtx);
1515 if (getnewvnode_wait(0) == 0) {
1518 atomic_add_long(&numvnodes, 1);
1522 mtx_unlock(&vnode_free_list_mtx);
1526 * This hack is fragile, especially if desiredvnodes or wantvnodes are
1527 * misconfgured or changed significantly. Reducing desiredvnodes below
1528 * the reserved amount should cause bizarre behaviour like reducing it
1529 * below the number of active vnodes -- the system will try to reduce
1530 * numvnodes to match, but should fail, so the subtraction below should
1534 getnewvnode_drop_reserve(void)
1539 atomic_subtract_long(&numvnodes, td->td_vp_reserv);
1540 td->td_vp_reserv = 0;
1544 * Return the next vnode from the free list.
1547 getnewvnode(const char *tag, struct mount *mp, struct vop_vector *vops,
1552 struct lock_object *lo;
1553 static int cyclecount;
1556 CTR3(KTR_VFS, "%s: mp %p with tag %s", __func__, mp, tag);
1559 if (td->td_vp_reserv > 0) {
1560 td->td_vp_reserv -= 1;
1563 mtx_lock(&vnode_free_list_mtx);
1564 if (numvnodes < desiredvnodes)
1566 else if (cyclecount++ >= freevnodes) {
1571 * Grow the vnode cache if it will not be above its target max
1572 * after growing. Otherwise, if the free list is nonempty, try
1573 * to reclaim 1 item from it before growing the cache (possibly
1574 * above its target max if the reclamation failed or is delayed).
1575 * Otherwise, wait for some space. In all cases, schedule
1576 * vnlru_proc() if we are getting short of space. The watermarks
1577 * should be chosen so that we never wait or even reclaim from
1578 * the free list to below its target minimum.
1580 if (numvnodes + 1 <= desiredvnodes)
1582 else if (freevnodes > 0)
1583 vnlru_free_locked(1, NULL);
1585 error = getnewvnode_wait(mp != NULL && (mp->mnt_kern_flag &
1587 #if 0 /* XXX Not all VFS_VGET/ffs_vget callers check returns. */
1589 mtx_unlock(&vnode_free_list_mtx);
1595 atomic_add_long(&numvnodes, 1);
1596 mtx_unlock(&vnode_free_list_mtx);
1598 counter_u64_add(vnodes_created, 1);
1599 vp = (struct vnode *) uma_zalloc(vnode_zone, M_WAITOK);
1601 * Locks are given the generic name "vnode" when created.
1602 * Follow the historic practice of using the filesystem
1603 * name when they allocated, e.g., "zfs", "ufs", "nfs, etc.
1605 * Locks live in a witness group keyed on their name. Thus,
1606 * when a lock is renamed, it must also move from the witness
1607 * group of its old name to the witness group of its new name.
1609 * The change only needs to be made when the vnode moves
1610 * from one filesystem type to another. We ensure that each
1611 * filesystem use a single static name pointer for its tag so
1612 * that we can compare pointers rather than doing a strcmp().
1614 lo = &vp->v_vnlock->lock_object;
1615 if (lo->lo_name != tag) {
1617 WITNESS_DESTROY(lo);
1618 WITNESS_INIT(lo, tag);
1621 * By default, don't allow shared locks unless filesystems opt-in.
1623 vp->v_vnlock->lock_object.lo_flags |= LK_NOSHARE;
1625 * Finalize various vnode identity bits.
1627 KASSERT(vp->v_object == NULL, ("stale v_object %p", vp));
1628 KASSERT(vp->v_lockf == NULL, ("stale v_lockf %p", vp));
1629 KASSERT(vp->v_pollinfo == NULL, ("stale v_pollinfo %p", vp));
1633 v_init_counters(vp);
1634 vp->v_bufobj.bo_ops = &buf_ops_bio;
1636 if (mp == NULL && vops != &dead_vnodeops)
1637 printf("NULL mp in getnewvnode(9), tag %s\n", tag);
1641 if (mp != NULL && (mp->mnt_flag & MNT_MULTILABEL) == 0)
1642 mac_vnode_associate_singlelabel(mp, vp);
1645 vp->v_bufobj.bo_bsize = mp->mnt_stat.f_iosize;
1646 if ((mp->mnt_kern_flag & MNTK_NOKNOTE) != 0)
1647 vp->v_vflag |= VV_NOKNOTE;
1651 * For the filesystems which do not use vfs_hash_insert(),
1652 * still initialize v_hash to have vfs_hash_index() useful.
1653 * E.g., nullfs uses vfs_hash_index() on the lower vnode for
1656 vp->v_hash = (uintptr_t)vp >> vnsz2log;
1663 * Delete from old mount point vnode list, if on one.
1666 delmntque(struct vnode *vp)
1676 KASSERT(mp->mnt_activevnodelistsize <= mp->mnt_nvnodelistsize,
1677 ("Active vnode list size %d > Vnode list size %d",
1678 mp->mnt_activevnodelistsize, mp->mnt_nvnodelistsize));
1679 active = vp->v_iflag & VI_ACTIVE;
1680 vp->v_iflag &= ~VI_ACTIVE;
1682 mtx_lock(&mp->mnt_listmtx);
1683 TAILQ_REMOVE(&mp->mnt_activevnodelist, vp, v_actfreelist);
1684 mp->mnt_activevnodelistsize--;
1685 mtx_unlock(&mp->mnt_listmtx);
1689 VNASSERT(mp->mnt_nvnodelistsize > 0, vp,
1690 ("bad mount point vnode list size"));
1691 TAILQ_REMOVE(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
1692 mp->mnt_nvnodelistsize--;
1698 insmntque_stddtr(struct vnode *vp, void *dtr_arg)
1702 vp->v_op = &dead_vnodeops;
1708 * Insert into list of vnodes for the new mount point, if available.
1711 insmntque1(struct vnode *vp, struct mount *mp,
1712 void (*dtr)(struct vnode *, void *), void *dtr_arg)
1715 KASSERT(vp->v_mount == NULL,
1716 ("insmntque: vnode already on per mount vnode list"));
1717 VNASSERT(mp != NULL, vp, ("Don't call insmntque(foo, NULL)"));
1718 ASSERT_VOP_ELOCKED(vp, "insmntque: non-locked vp");
1721 * We acquire the vnode interlock early to ensure that the
1722 * vnode cannot be recycled by another process releasing a
1723 * holdcnt on it before we get it on both the vnode list
1724 * and the active vnode list. The mount mutex protects only
1725 * manipulation of the vnode list and the vnode freelist
1726 * mutex protects only manipulation of the active vnode list.
1727 * Hence the need to hold the vnode interlock throughout.
1731 if (((mp->mnt_kern_flag & MNTK_UNMOUNT) != 0 &&
1732 ((mp->mnt_kern_flag & MNTK_UNMOUNTF) != 0 ||
1733 mp->mnt_nvnodelistsize == 0)) &&
1734 (vp->v_vflag & VV_FORCEINSMQ) == 0) {
1743 TAILQ_INSERT_TAIL(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
1744 VNASSERT(mp->mnt_nvnodelistsize >= 0, vp,
1745 ("neg mount point vnode list size"));
1746 mp->mnt_nvnodelistsize++;
1747 KASSERT((vp->v_iflag & VI_ACTIVE) == 0,
1748 ("Activating already active vnode"));
1749 vp->v_iflag |= VI_ACTIVE;
1750 mtx_lock(&mp->mnt_listmtx);
1751 TAILQ_INSERT_HEAD(&mp->mnt_activevnodelist, vp, v_actfreelist);
1752 mp->mnt_activevnodelistsize++;
1753 mtx_unlock(&mp->mnt_listmtx);
1760 insmntque(struct vnode *vp, struct mount *mp)
1763 return (insmntque1(vp, mp, insmntque_stddtr, NULL));
1767 * Flush out and invalidate all buffers associated with a bufobj
1768 * Called with the underlying object locked.
1771 bufobj_invalbuf(struct bufobj *bo, int flags, int slpflag, int slptimeo)
1776 if (flags & V_SAVE) {
1777 error = bufobj_wwait(bo, slpflag, slptimeo);
1782 if (bo->bo_dirty.bv_cnt > 0) {
1784 if ((error = BO_SYNC(bo, MNT_WAIT)) != 0)
1787 * XXX We could save a lock/unlock if this was only
1788 * enabled under INVARIANTS
1791 if (bo->bo_numoutput > 0 || bo->bo_dirty.bv_cnt > 0)
1792 panic("vinvalbuf: dirty bufs");
1796 * If you alter this loop please notice that interlock is dropped and
1797 * reacquired in flushbuflist. Special care is needed to ensure that
1798 * no race conditions occur from this.
1801 error = flushbuflist(&bo->bo_clean,
1802 flags, bo, slpflag, slptimeo);
1803 if (error == 0 && !(flags & V_CLEANONLY))
1804 error = flushbuflist(&bo->bo_dirty,
1805 flags, bo, slpflag, slptimeo);
1806 if (error != 0 && error != EAGAIN) {
1810 } while (error != 0);
1813 * Wait for I/O to complete. XXX needs cleaning up. The vnode can
1814 * have write I/O in-progress but if there is a VM object then the
1815 * VM object can also have read-I/O in-progress.
1818 bufobj_wwait(bo, 0, 0);
1819 if ((flags & V_VMIO) == 0 && bo->bo_object != NULL) {
1821 vm_object_pip_wait_unlocked(bo->bo_object, "bovlbx");
1824 } while (bo->bo_numoutput > 0);
1828 * Destroy the copy in the VM cache, too.
1830 if (bo->bo_object != NULL &&
1831 (flags & (V_ALT | V_NORMAL | V_CLEANONLY | V_VMIO)) == 0) {
1832 VM_OBJECT_WLOCK(bo->bo_object);
1833 vm_object_page_remove(bo->bo_object, 0, 0, (flags & V_SAVE) ?
1834 OBJPR_CLEANONLY : 0);
1835 VM_OBJECT_WUNLOCK(bo->bo_object);
1840 if ((flags & (V_ALT | V_NORMAL | V_CLEANONLY | V_VMIO |
1841 V_ALLOWCLEAN)) == 0 && (bo->bo_dirty.bv_cnt > 0 ||
1842 bo->bo_clean.bv_cnt > 0))
1843 panic("vinvalbuf: flush failed");
1844 if ((flags & (V_ALT | V_NORMAL | V_CLEANONLY | V_VMIO)) == 0 &&
1845 bo->bo_dirty.bv_cnt > 0)
1846 panic("vinvalbuf: flush dirty failed");
1853 * Flush out and invalidate all buffers associated with a vnode.
1854 * Called with the underlying object locked.
1857 vinvalbuf(struct vnode *vp, int flags, int slpflag, int slptimeo)
1860 CTR3(KTR_VFS, "%s: vp %p with flags %d", __func__, vp, flags);
1861 ASSERT_VOP_LOCKED(vp, "vinvalbuf");
1862 if (vp->v_object != NULL && vp->v_object->handle != vp)
1864 return (bufobj_invalbuf(&vp->v_bufobj, flags, slpflag, slptimeo));
1868 * Flush out buffers on the specified list.
1872 flushbuflist(struct bufv *bufv, int flags, struct bufobj *bo, int slpflag,
1875 struct buf *bp, *nbp;
1880 ASSERT_BO_WLOCKED(bo);
1883 TAILQ_FOREACH_SAFE(bp, &bufv->bv_hd, b_bobufs, nbp) {
1885 * If we are flushing both V_NORMAL and V_ALT buffers then
1886 * do not skip any buffers. If we are flushing only V_NORMAL
1887 * buffers then skip buffers marked as BX_ALTDATA. If we are
1888 * flushing only V_ALT buffers then skip buffers not marked
1891 if (((flags & (V_NORMAL | V_ALT)) != (V_NORMAL | V_ALT)) &&
1892 (((flags & V_NORMAL) && (bp->b_xflags & BX_ALTDATA) != 0) ||
1893 ((flags & V_ALT) && (bp->b_xflags & BX_ALTDATA) == 0))) {
1897 lblkno = nbp->b_lblkno;
1898 xflags = nbp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN);
1901 error = BUF_TIMELOCK(bp,
1902 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK, BO_LOCKPTR(bo),
1903 "flushbuf", slpflag, slptimeo);
1906 return (error != ENOLCK ? error : EAGAIN);
1908 KASSERT(bp->b_bufobj == bo,
1909 ("bp %p wrong b_bufobj %p should be %p",
1910 bp, bp->b_bufobj, bo));
1912 * XXX Since there are no node locks for NFS, I
1913 * believe there is a slight chance that a delayed
1914 * write will occur while sleeping just above, so
1917 if (((bp->b_flags & (B_DELWRI | B_INVAL)) == B_DELWRI) &&
1920 bp->b_flags |= B_ASYNC;
1923 return (EAGAIN); /* XXX: why not loop ? */
1926 bp->b_flags |= (B_INVAL | B_RELBUF);
1927 bp->b_flags &= ~B_ASYNC;
1932 nbp = gbincore(bo, lblkno);
1933 if (nbp == NULL || (nbp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN))
1935 break; /* nbp invalid */
1941 bnoreuselist(struct bufv *bufv, struct bufobj *bo, daddr_t startn, daddr_t endn)
1947 ASSERT_BO_LOCKED(bo);
1949 for (lblkno = startn;;) {
1951 bp = BUF_PCTRIE_LOOKUP_GE(&bufv->bv_root, lblkno);
1952 if (bp == NULL || bp->b_lblkno >= endn ||
1953 bp->b_lblkno < startn)
1955 error = BUF_TIMELOCK(bp, LK_EXCLUSIVE | LK_SLEEPFAIL |
1956 LK_INTERLOCK, BO_LOCKPTR(bo), "brlsfl", 0, 0);
1959 if (error == ENOLCK)
1963 KASSERT(bp->b_bufobj == bo,
1964 ("bp %p wrong b_bufobj %p should be %p",
1965 bp, bp->b_bufobj, bo));
1966 lblkno = bp->b_lblkno + 1;
1967 if ((bp->b_flags & B_MANAGED) == 0)
1969 bp->b_flags |= B_RELBUF;
1971 * In the VMIO case, use the B_NOREUSE flag to hint that the
1972 * pages backing each buffer in the range are unlikely to be
1973 * reused. Dirty buffers will have the hint applied once
1974 * they've been written.
1976 if ((bp->b_flags & B_VMIO) != 0)
1977 bp->b_flags |= B_NOREUSE;
1985 * Truncate a file's buffer and pages to a specified length. This
1986 * is in lieu of the old vinvalbuf mechanism, which performed unneeded
1990 vtruncbuf(struct vnode *vp, off_t length, int blksize)
1992 struct buf *bp, *nbp;
1996 CTR4(KTR_VFS, "%s: vp %p with block %d:%ju", __func__,
1997 vp, blksize, (uintmax_t)length);
2000 * Round up to the *next* lbn.
2002 startlbn = howmany(length, blksize);
2004 ASSERT_VOP_LOCKED(vp, "vtruncbuf");
2010 while (v_inval_buf_range_locked(vp, bo, startlbn, INT64_MAX) == EAGAIN)
2015 TAILQ_FOREACH_SAFE(bp, &bo->bo_dirty.bv_hd, b_bobufs, nbp) {
2016 if (bp->b_lblkno > 0)
2019 * Since we hold the vnode lock this should only
2020 * fail if we're racing with the buf daemon.
2023 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK,
2024 BO_LOCKPTR(bo)) == ENOLCK)
2025 goto restart_unlocked;
2027 VNASSERT((bp->b_flags & B_DELWRI), vp,
2028 ("buf(%p) on dirty queue without DELWRI", bp));
2037 bufobj_wwait(bo, 0, 0);
2039 vnode_pager_setsize(vp, length);
2045 * Invalidate the cached pages of a file's buffer within the range of block
2046 * numbers [startlbn, endlbn).
2049 v_inval_buf_range(struct vnode *vp, daddr_t startlbn, daddr_t endlbn,
2055 ASSERT_VOP_LOCKED(vp, "v_inval_buf_range");
2057 start = blksize * startlbn;
2058 end = blksize * endlbn;
2062 MPASS(blksize == bo->bo_bsize);
2064 while (v_inval_buf_range_locked(vp, bo, startlbn, endlbn) == EAGAIN)
2068 vn_pages_remove(vp, OFF_TO_IDX(start), OFF_TO_IDX(end + PAGE_SIZE - 1));
2072 v_inval_buf_range_locked(struct vnode *vp, struct bufobj *bo,
2073 daddr_t startlbn, daddr_t endlbn)
2075 struct buf *bp, *nbp;
2078 ASSERT_VOP_LOCKED(vp, "v_inval_buf_range_locked");
2079 ASSERT_BO_LOCKED(bo);
2083 TAILQ_FOREACH_SAFE(bp, &bo->bo_clean.bv_hd, b_bobufs, nbp) {
2084 if (bp->b_lblkno < startlbn || bp->b_lblkno >= endlbn)
2087 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK,
2088 BO_LOCKPTR(bo)) == ENOLCK) {
2094 bp->b_flags |= B_INVAL | B_RELBUF;
2095 bp->b_flags &= ~B_ASYNC;
2101 (((nbp->b_xflags & BX_VNCLEAN) == 0) ||
2103 (nbp->b_flags & B_DELWRI) != 0))
2107 TAILQ_FOREACH_SAFE(bp, &bo->bo_dirty.bv_hd, b_bobufs, nbp) {
2108 if (bp->b_lblkno < startlbn || bp->b_lblkno >= endlbn)
2111 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK,
2112 BO_LOCKPTR(bo)) == ENOLCK) {
2117 bp->b_flags |= B_INVAL | B_RELBUF;
2118 bp->b_flags &= ~B_ASYNC;
2124 (((nbp->b_xflags & BX_VNDIRTY) == 0) ||
2125 (nbp->b_vp != vp) ||
2126 (nbp->b_flags & B_DELWRI) == 0))
2134 buf_vlist_remove(struct buf *bp)
2138 KASSERT(bp->b_bufobj != NULL, ("No b_bufobj %p", bp));
2139 ASSERT_BO_WLOCKED(bp->b_bufobj);
2140 KASSERT((bp->b_xflags & (BX_VNDIRTY|BX_VNCLEAN)) !=
2141 (BX_VNDIRTY|BX_VNCLEAN),
2142 ("buf_vlist_remove: Buf %p is on two lists", bp));
2143 if (bp->b_xflags & BX_VNDIRTY)
2144 bv = &bp->b_bufobj->bo_dirty;
2146 bv = &bp->b_bufobj->bo_clean;
2147 BUF_PCTRIE_REMOVE(&bv->bv_root, bp->b_lblkno);
2148 TAILQ_REMOVE(&bv->bv_hd, bp, b_bobufs);
2150 bp->b_xflags &= ~(BX_VNDIRTY | BX_VNCLEAN);
2154 * Add the buffer to the sorted clean or dirty block list.
2156 * NOTE: xflags is passed as a constant, optimizing this inline function!
2159 buf_vlist_add(struct buf *bp, struct bufobj *bo, b_xflags_t xflags)
2165 ASSERT_BO_WLOCKED(bo);
2166 KASSERT((xflags & BX_VNDIRTY) == 0 || (bo->bo_flag & BO_DEAD) == 0,
2167 ("dead bo %p", bo));
2168 KASSERT((bp->b_xflags & (BX_VNDIRTY|BX_VNCLEAN)) == 0,
2169 ("buf_vlist_add: Buf %p has existing xflags %d", bp, bp->b_xflags));
2170 bp->b_xflags |= xflags;
2171 if (xflags & BX_VNDIRTY)
2177 * Keep the list ordered. Optimize empty list insertion. Assume
2178 * we tend to grow at the tail so lookup_le should usually be cheaper
2181 if (bv->bv_cnt == 0 ||
2182 bp->b_lblkno > TAILQ_LAST(&bv->bv_hd, buflists)->b_lblkno)
2183 TAILQ_INSERT_TAIL(&bv->bv_hd, bp, b_bobufs);
2184 else if ((n = BUF_PCTRIE_LOOKUP_LE(&bv->bv_root, bp->b_lblkno)) == NULL)
2185 TAILQ_INSERT_HEAD(&bv->bv_hd, bp, b_bobufs);
2187 TAILQ_INSERT_AFTER(&bv->bv_hd, n, bp, b_bobufs);
2188 error = BUF_PCTRIE_INSERT(&bv->bv_root, bp);
2190 panic("buf_vlist_add: Preallocated nodes insufficient.");
2195 * Look up a buffer using the buffer tries.
2198 gbincore(struct bufobj *bo, daddr_t lblkno)
2202 ASSERT_BO_LOCKED(bo);
2203 bp = BUF_PCTRIE_LOOKUP(&bo->bo_clean.bv_root, lblkno);
2206 return BUF_PCTRIE_LOOKUP(&bo->bo_dirty.bv_root, lblkno);
2210 * Associate a buffer with a vnode.
2213 bgetvp(struct vnode *vp, struct buf *bp)
2218 ASSERT_BO_WLOCKED(bo);
2219 VNASSERT(bp->b_vp == NULL, bp->b_vp, ("bgetvp: not free"));
2221 CTR3(KTR_BUF, "bgetvp(%p) vp %p flags %X", bp, vp, bp->b_flags);
2222 VNASSERT((bp->b_xflags & (BX_VNDIRTY|BX_VNCLEAN)) == 0, vp,
2223 ("bgetvp: bp already attached! %p", bp));
2229 * Insert onto list for new vnode.
2231 buf_vlist_add(bp, bo, BX_VNCLEAN);
2235 * Disassociate a buffer from a vnode.
2238 brelvp(struct buf *bp)
2243 CTR3(KTR_BUF, "brelvp(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
2244 KASSERT(bp->b_vp != NULL, ("brelvp: NULL"));
2247 * Delete from old vnode list, if on one.
2249 vp = bp->b_vp; /* XXX */
2252 if (bp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN))
2253 buf_vlist_remove(bp);
2255 panic("brelvp: Buffer %p not on queue.", bp);
2256 if ((bo->bo_flag & BO_ONWORKLST) && bo->bo_dirty.bv_cnt == 0) {
2257 bo->bo_flag &= ~BO_ONWORKLST;
2258 mtx_lock(&sync_mtx);
2259 LIST_REMOVE(bo, bo_synclist);
2260 syncer_worklist_len--;
2261 mtx_unlock(&sync_mtx);
2264 bp->b_bufobj = NULL;
2270 * Add an item to the syncer work queue.
2273 vn_syncer_add_to_worklist(struct bufobj *bo, int delay)
2277 ASSERT_BO_WLOCKED(bo);
2279 mtx_lock(&sync_mtx);
2280 if (bo->bo_flag & BO_ONWORKLST)
2281 LIST_REMOVE(bo, bo_synclist);
2283 bo->bo_flag |= BO_ONWORKLST;
2284 syncer_worklist_len++;
2287 if (delay > syncer_maxdelay - 2)
2288 delay = syncer_maxdelay - 2;
2289 slot = (syncer_delayno + delay) & syncer_mask;
2291 LIST_INSERT_HEAD(&syncer_workitem_pending[slot], bo, bo_synclist);
2292 mtx_unlock(&sync_mtx);
2296 sysctl_vfs_worklist_len(SYSCTL_HANDLER_ARGS)
2300 mtx_lock(&sync_mtx);
2301 len = syncer_worklist_len - sync_vnode_count;
2302 mtx_unlock(&sync_mtx);
2303 error = SYSCTL_OUT(req, &len, sizeof(len));
2307 SYSCTL_PROC(_vfs, OID_AUTO, worklist_len, CTLTYPE_INT | CTLFLAG_RD, NULL, 0,
2308 sysctl_vfs_worklist_len, "I", "Syncer thread worklist length");
2310 static struct proc *updateproc;
2311 static void sched_sync(void);
2312 static struct kproc_desc up_kp = {
2317 SYSINIT(syncer, SI_SUB_KTHREAD_UPDATE, SI_ORDER_FIRST, kproc_start, &up_kp);
2320 sync_vnode(struct synclist *slp, struct bufobj **bo, struct thread *td)
2325 *bo = LIST_FIRST(slp);
2329 if (VOP_ISLOCKED(vp) != 0 || VI_TRYLOCK(vp) == 0)
2332 * We use vhold in case the vnode does not
2333 * successfully sync. vhold prevents the vnode from
2334 * going away when we unlock the sync_mtx so that
2335 * we can acquire the vnode interlock.
2338 mtx_unlock(&sync_mtx);
2340 if (vn_start_write(vp, &mp, V_NOWAIT) != 0) {
2342 mtx_lock(&sync_mtx);
2343 return (*bo == LIST_FIRST(slp));
2345 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
2346 (void) VOP_FSYNC(vp, MNT_LAZY, td);
2348 vn_finished_write(mp);
2350 if (((*bo)->bo_flag & BO_ONWORKLST) != 0) {
2352 * Put us back on the worklist. The worklist
2353 * routine will remove us from our current
2354 * position and then add us back in at a later
2357 vn_syncer_add_to_worklist(*bo, syncdelay);
2361 mtx_lock(&sync_mtx);
2365 static int first_printf = 1;
2368 * System filesystem synchronizer daemon.
2373 struct synclist *next, *slp;
2376 struct thread *td = curthread;
2378 int net_worklist_len;
2379 int syncer_final_iter;
2383 syncer_final_iter = 0;
2384 syncer_state = SYNCER_RUNNING;
2385 starttime = time_uptime;
2386 td->td_pflags |= TDP_NORUNNINGBUF;
2388 EVENTHANDLER_REGISTER(shutdown_pre_sync, syncer_shutdown, td->td_proc,
2391 mtx_lock(&sync_mtx);
2393 if (syncer_state == SYNCER_FINAL_DELAY &&
2394 syncer_final_iter == 0) {
2395 mtx_unlock(&sync_mtx);
2396 kproc_suspend_check(td->td_proc);
2397 mtx_lock(&sync_mtx);
2399 net_worklist_len = syncer_worklist_len - sync_vnode_count;
2400 if (syncer_state != SYNCER_RUNNING &&
2401 starttime != time_uptime) {
2403 printf("\nSyncing disks, vnodes remaining... ");
2406 printf("%d ", net_worklist_len);
2408 starttime = time_uptime;
2411 * Push files whose dirty time has expired. Be careful
2412 * of interrupt race on slp queue.
2414 * Skip over empty worklist slots when shutting down.
2417 slp = &syncer_workitem_pending[syncer_delayno];
2418 syncer_delayno += 1;
2419 if (syncer_delayno == syncer_maxdelay)
2421 next = &syncer_workitem_pending[syncer_delayno];
2423 * If the worklist has wrapped since the
2424 * it was emptied of all but syncer vnodes,
2425 * switch to the FINAL_DELAY state and run
2426 * for one more second.
2428 if (syncer_state == SYNCER_SHUTTING_DOWN &&
2429 net_worklist_len == 0 &&
2430 last_work_seen == syncer_delayno) {
2431 syncer_state = SYNCER_FINAL_DELAY;
2432 syncer_final_iter = SYNCER_SHUTDOWN_SPEEDUP;
2434 } while (syncer_state != SYNCER_RUNNING && LIST_EMPTY(slp) &&
2435 syncer_worklist_len > 0);
2438 * Keep track of the last time there was anything
2439 * on the worklist other than syncer vnodes.
2440 * Return to the SHUTTING_DOWN state if any
2443 if (net_worklist_len > 0 || syncer_state == SYNCER_RUNNING)
2444 last_work_seen = syncer_delayno;
2445 if (net_worklist_len > 0 && syncer_state == SYNCER_FINAL_DELAY)
2446 syncer_state = SYNCER_SHUTTING_DOWN;
2447 while (!LIST_EMPTY(slp)) {
2448 error = sync_vnode(slp, &bo, td);
2450 LIST_REMOVE(bo, bo_synclist);
2451 LIST_INSERT_HEAD(next, bo, bo_synclist);
2455 if (first_printf == 0) {
2457 * Drop the sync mutex, because some watchdog
2458 * drivers need to sleep while patting
2460 mtx_unlock(&sync_mtx);
2461 wdog_kern_pat(WD_LASTVAL);
2462 mtx_lock(&sync_mtx);
2466 if (syncer_state == SYNCER_FINAL_DELAY && syncer_final_iter > 0)
2467 syncer_final_iter--;
2469 * The variable rushjob allows the kernel to speed up the
2470 * processing of the filesystem syncer process. A rushjob
2471 * value of N tells the filesystem syncer to process the next
2472 * N seconds worth of work on its queue ASAP. Currently rushjob
2473 * is used by the soft update code to speed up the filesystem
2474 * syncer process when the incore state is getting so far
2475 * ahead of the disk that the kernel memory pool is being
2476 * threatened with exhaustion.
2483 * Just sleep for a short period of time between
2484 * iterations when shutting down to allow some I/O
2487 * If it has taken us less than a second to process the
2488 * current work, then wait. Otherwise start right over
2489 * again. We can still lose time if any single round
2490 * takes more than two seconds, but it does not really
2491 * matter as we are just trying to generally pace the
2492 * filesystem activity.
2494 if (syncer_state != SYNCER_RUNNING ||
2495 time_uptime == starttime) {
2497 sched_prio(td, PPAUSE);
2500 if (syncer_state != SYNCER_RUNNING)
2501 cv_timedwait(&sync_wakeup, &sync_mtx,
2502 hz / SYNCER_SHUTDOWN_SPEEDUP);
2503 else if (time_uptime == starttime)
2504 cv_timedwait(&sync_wakeup, &sync_mtx, hz);
2509 * Request the syncer daemon to speed up its work.
2510 * We never push it to speed up more than half of its
2511 * normal turn time, otherwise it could take over the cpu.
2514 speedup_syncer(void)
2518 mtx_lock(&sync_mtx);
2519 if (rushjob < syncdelay / 2) {
2521 stat_rush_requests += 1;
2524 mtx_unlock(&sync_mtx);
2525 cv_broadcast(&sync_wakeup);
2530 * Tell the syncer to speed up its work and run though its work
2531 * list several times, then tell it to shut down.
2534 syncer_shutdown(void *arg, int howto)
2537 if (howto & RB_NOSYNC)
2539 mtx_lock(&sync_mtx);
2540 syncer_state = SYNCER_SHUTTING_DOWN;
2542 mtx_unlock(&sync_mtx);
2543 cv_broadcast(&sync_wakeup);
2544 kproc_shutdown(arg, howto);
2548 syncer_suspend(void)
2551 syncer_shutdown(updateproc, 0);
2558 mtx_lock(&sync_mtx);
2560 syncer_state = SYNCER_RUNNING;
2561 mtx_unlock(&sync_mtx);
2562 cv_broadcast(&sync_wakeup);
2563 kproc_resume(updateproc);
2567 * Reassign a buffer from one vnode to another.
2568 * Used to assign file specific control information
2569 * (indirect blocks) to the vnode to which they belong.
2572 reassignbuf(struct buf *bp)
2585 CTR3(KTR_BUF, "reassignbuf(%p) vp %p flags %X",
2586 bp, bp->b_vp, bp->b_flags);
2588 * B_PAGING flagged buffers cannot be reassigned because their vp
2589 * is not fully linked in.
2591 if (bp->b_flags & B_PAGING)
2592 panic("cannot reassign paging buffer");
2595 * Delete from old vnode list, if on one.
2598 if (bp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN))
2599 buf_vlist_remove(bp);
2601 panic("reassignbuf: Buffer %p not on queue.", bp);
2603 * If dirty, put on list of dirty buffers; otherwise insert onto list
2606 if (bp->b_flags & B_DELWRI) {
2607 if ((bo->bo_flag & BO_ONWORKLST) == 0) {
2608 switch (vp->v_type) {
2618 vn_syncer_add_to_worklist(bo, delay);
2620 buf_vlist_add(bp, bo, BX_VNDIRTY);
2622 buf_vlist_add(bp, bo, BX_VNCLEAN);
2624 if ((bo->bo_flag & BO_ONWORKLST) && bo->bo_dirty.bv_cnt == 0) {
2625 mtx_lock(&sync_mtx);
2626 LIST_REMOVE(bo, bo_synclist);
2627 syncer_worklist_len--;
2628 mtx_unlock(&sync_mtx);
2629 bo->bo_flag &= ~BO_ONWORKLST;
2634 bp = TAILQ_FIRST(&bv->bv_hd);
2635 KASSERT(bp == NULL || bp->b_bufobj == bo,
2636 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2637 bp = TAILQ_LAST(&bv->bv_hd, buflists);
2638 KASSERT(bp == NULL || bp->b_bufobj == bo,
2639 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2641 bp = TAILQ_FIRST(&bv->bv_hd);
2642 KASSERT(bp == NULL || bp->b_bufobj == bo,
2643 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2644 bp = TAILQ_LAST(&bv->bv_hd, buflists);
2645 KASSERT(bp == NULL || bp->b_bufobj == bo,
2646 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2652 v_init_counters(struct vnode *vp)
2655 VNASSERT(vp->v_type == VNON && vp->v_data == NULL && vp->v_iflag == 0,
2656 vp, ("%s called for an initialized vnode", __FUNCTION__));
2657 ASSERT_VI_UNLOCKED(vp, __FUNCTION__);
2659 refcount_init(&vp->v_holdcnt, 1);
2660 refcount_init(&vp->v_usecount, 1);
2664 * Increment si_usecount of the associated device, if any.
2667 v_incr_devcount(struct vnode *vp)
2670 ASSERT_VI_LOCKED(vp, __FUNCTION__);
2671 if (vp->v_type == VCHR && vp->v_rdev != NULL) {
2673 vp->v_rdev->si_usecount++;
2679 * Decrement si_usecount of the associated device, if any.
2682 v_decr_devcount(struct vnode *vp)
2685 ASSERT_VI_LOCKED(vp, __FUNCTION__);
2686 if (vp->v_type == VCHR && vp->v_rdev != NULL) {
2688 vp->v_rdev->si_usecount--;
2694 * Grab a particular vnode from the free list, increment its
2695 * reference count and lock it. VI_DOOMED is set if the vnode
2696 * is being destroyed. Only callers who specify LK_RETRY will
2697 * see doomed vnodes. If inactive processing was delayed in
2698 * vput try to do it here.
2700 * Both holdcnt and usecount can be manipulated using atomics without holding
2701 * any locks except in these cases which require the vnode interlock:
2702 * holdcnt: 1->0 and 0->1
2705 * usecount is permitted to transition 1->0 without the interlock because
2706 * vnode is kept live by holdcnt.
2708 static enum vgetstate
2709 _vget_prep(struct vnode *vp, bool interlock)
2713 if (__predict_true(vp->v_type != VCHR)) {
2714 if (refcount_acquire_if_not_zero(&vp->v_usecount)) {
2717 _vhold(vp, interlock);
2723 if (vp->v_usecount == 0) {
2727 v_incr_devcount(vp);
2728 refcount_acquire(&vp->v_usecount);
2738 vget_prep(struct vnode *vp)
2741 return (_vget_prep(vp, false));
2745 vget(struct vnode *vp, int flags, struct thread *td)
2749 MPASS(td == curthread);
2751 vs = _vget_prep(vp, (flags & LK_INTERLOCK) != 0);
2752 return (vget_finish(vp, flags, vs));
2756 vget_finish(struct vnode *vp, int flags, enum vgetstate vs)
2758 int error, oweinact;
2760 VNASSERT((flags & LK_TYPE_MASK) != 0, vp,
2761 ("%s: invalid lock operation", __func__));
2763 if ((flags & LK_INTERLOCK) != 0)
2764 ASSERT_VI_LOCKED(vp, __func__);
2766 ASSERT_VI_UNLOCKED(vp, __func__);
2767 VNASSERT(vp->v_holdcnt > 0, vp, ("%s: vnode not held", __func__));
2768 if (vs == VGET_USECOUNT) {
2769 VNASSERT(vp->v_usecount > 0, vp,
2770 ("%s: vnode without usecount when VGET_USECOUNT was passed",
2774 if ((error = vn_lock(vp, flags)) != 0) {
2775 if (vs == VGET_USECOUNT)
2779 CTR2(KTR_VFS, "%s: impossible to lock vnode %p", __func__,
2784 if (vs == VGET_USECOUNT) {
2785 VNASSERT((vp->v_iflag & VI_OWEINACT) == 0, vp,
2786 ("%s: vnode with usecount and VI_OWEINACT set", __func__));
2791 * We hold the vnode. If the usecount is 0 it will be utilized to keep
2792 * the vnode around. Otherwise someone else lended their hold count and
2793 * we have to drop ours.
2795 if (vp->v_type != VCHR &&
2796 refcount_acquire_if_not_zero(&vp->v_usecount)) {
2798 int old = atomic_fetchadd_int(&vp->v_holdcnt, -1) - 1;
2799 VNASSERT(old > 0, vp, ("%s: wrong hold count", __func__));
2801 refcount_release(&vp->v_holdcnt);
2803 VNODE_REFCOUNT_FENCE_ACQ();
2804 VNASSERT((vp->v_iflag & VI_OWEINACT) == 0, vp,
2805 ("%s: vnode with usecount and VI_OWEINACT set", __func__));
2810 * We don't guarantee that any particular close will
2811 * trigger inactive processing so just make a best effort
2812 * here at preventing a reference to a removed file. If
2813 * we don't succeed no harm is done.
2815 * Upgrade our holdcnt to a usecount.
2819 * See the previous section. By the time we get here we may find
2820 * ourselves in the same spot.
2822 if (vp->v_type != VCHR) {
2823 if (refcount_acquire_if_not_zero(&vp->v_usecount)) {
2825 int old = atomic_fetchadd_int(&vp->v_holdcnt, -1) - 1;
2826 VNASSERT(old > 0, vp, ("%s: wrong hold count", __func__));
2828 refcount_release(&vp->v_holdcnt);
2830 VNODE_REFCOUNT_FENCE_ACQ();
2831 VNASSERT((vp->v_iflag & VI_OWEINACT) == 0, vp,
2832 ("%s: vnode with usecount and VI_OWEINACT set",
2838 if (vp->v_usecount > 0)
2839 refcount_release(&vp->v_holdcnt);
2841 if ((vp->v_iflag & VI_OWEINACT) == 0) {
2845 vp->v_iflag &= ~VI_OWEINACT;
2846 VNODE_REFCOUNT_FENCE_REL();
2848 v_incr_devcount(vp);
2849 refcount_acquire(&vp->v_usecount);
2850 if (oweinact && VOP_ISLOCKED(vp) == LK_EXCLUSIVE &&
2851 (flags & LK_NOWAIT) == 0)
2852 vinactive(vp, curthread);
2858 * Increase the reference (use) and hold count of a vnode.
2859 * This will also remove the vnode from the free list if it is presently free.
2862 vref(struct vnode *vp)
2865 ASSERT_VI_UNLOCKED(vp, __func__);
2866 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2867 if (vp->v_type != VCHR &&
2868 refcount_acquire_if_not_zero(&vp->v_usecount)) {
2869 VNODE_REFCOUNT_FENCE_ACQ();
2870 VNASSERT(vp->v_holdcnt > 0, vp,
2871 ("%s: active vnode not held", __func__));
2872 VNASSERT((vp->v_iflag & VI_OWEINACT) == 0, vp,
2873 ("%s: vnode with usecount and VI_OWEINACT set", __func__));
2882 vrefl(struct vnode *vp)
2885 ASSERT_VI_LOCKED(vp, __func__);
2886 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2887 if (vp->v_type != VCHR &&
2888 refcount_acquire_if_not_zero(&vp->v_usecount)) {
2889 VNODE_REFCOUNT_FENCE_ACQ();
2890 VNASSERT(vp->v_holdcnt > 0, vp,
2891 ("%s: active vnode not held", __func__));
2892 VNASSERT((vp->v_iflag & VI_OWEINACT) == 0, vp,
2893 ("%s: vnode with usecount and VI_OWEINACT set", __func__));
2896 if (vp->v_usecount == 0)
2898 if ((vp->v_iflag & VI_OWEINACT) != 0) {
2899 vp->v_iflag &= ~VI_OWEINACT;
2900 VNODE_REFCOUNT_FENCE_REL();
2902 v_incr_devcount(vp);
2903 refcount_acquire(&vp->v_usecount);
2907 vrefact(struct vnode *vp)
2910 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2911 if (__predict_false(vp->v_type == VCHR)) {
2912 VNASSERT(vp->v_holdcnt > 0 && vp->v_usecount > 0, vp,
2913 ("%s: wrong ref counts", __func__));
2918 int old = atomic_fetchadd_int(&vp->v_usecount, 1);
2919 VNASSERT(old > 0, vp, ("%s: wrong use count", __func__));
2921 refcount_acquire(&vp->v_usecount);
2926 * Return reference count of a vnode.
2928 * The results of this call are only guaranteed when some mechanism is used to
2929 * stop other processes from gaining references to the vnode. This may be the
2930 * case if the caller holds the only reference. This is also useful when stale
2931 * data is acceptable as race conditions may be accounted for by some other
2935 vrefcnt(struct vnode *vp)
2938 return (vp->v_usecount);
2941 #define VPUTX_VRELE 1
2942 #define VPUTX_VPUT 2
2943 #define VPUTX_VUNREF 3
2946 * Decrement the use and hold counts for a vnode.
2948 * See an explanation near vget() as to why atomic operation is safe.
2951 vputx(struct vnode *vp, int func)
2955 KASSERT(vp != NULL, ("vputx: null vp"));
2956 if (func == VPUTX_VUNREF)
2957 ASSERT_VOP_LOCKED(vp, "vunref");
2958 else if (func == VPUTX_VPUT)
2959 ASSERT_VOP_LOCKED(vp, "vput");
2961 KASSERT(func == VPUTX_VRELE, ("vputx: wrong func"));
2962 ASSERT_VI_UNLOCKED(vp, __func__);
2963 VNASSERT(vp->v_holdcnt > 0 && vp->v_usecount > 0, vp,
2964 ("%s: wrong ref counts", __func__));
2966 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2969 * It is an invariant that all VOP_* calls operate on a held vnode.
2970 * We may be only having an implicit hold stemming from our usecount,
2971 * which we are about to release. If we unlock the vnode afterwards we
2972 * open a time window where someone else dropped the last usecount and
2973 * proceeded to free the vnode before our unlock finished. For this
2974 * reason we unlock the vnode early. This is a little bit wasteful as
2975 * it may be the vnode is exclusively locked and inactive processing is
2976 * needed, in which case we are adding work.
2978 if (func == VPUTX_VPUT)
2982 * We want to hold the vnode until the inactive finishes to
2983 * prevent vgone() races. We drop the use count here and the
2984 * hold count below when we're done.
2986 if (vp->v_type != VCHR) {
2988 * If we release the last usecount we take ownership of the hold
2989 * count which provides liveness of the vnode, in which case we
2992 if (!refcount_release(&vp->v_usecount))
2996 * By the time we got here someone else might have transitioned
2997 * the count back to > 0.
2999 if (vp->v_usecount > 0) {
3005 v_decr_devcount(vp);
3006 if (!refcount_release(&vp->v_usecount)) {
3011 if (vp->v_iflag & VI_DOINGINACT) {
3018 if (vp->v_usecount != 0) {
3019 vn_printf(vp, "vputx: usecount not zero for vnode ");
3020 panic("vputx: usecount not zero");
3023 CTR2(KTR_VFS, "%s: return vnode %p to the freelist", __func__, vp);
3026 * Check if the fs wants to perform inactive processing. Note we
3027 * may be only holding the interlock, in which case it is possible
3028 * someone else called vgone on the vnode and ->v_data is now NULL.
3029 * Since vgone performs inactive on its own there is nothing to do
3030 * here but to drop our hold count.
3032 if (__predict_false(vp->v_iflag & VI_DOOMED) ||
3033 VOP_NEED_INACTIVE(vp) == 0) {
3039 * We must call VOP_INACTIVE with the node locked. Mark
3040 * as VI_DOINGINACT to avoid recursion.
3042 vp->v_iflag |= VI_OWEINACT;
3045 error = vn_lock(vp, LK_EXCLUSIVE | LK_INTERLOCK);
3049 error = VOP_LOCK(vp, LK_EXCLUSIVE | LK_INTERLOCK | LK_NOWAIT);
3053 if (VOP_ISLOCKED(vp) != LK_EXCLUSIVE) {
3054 error = VOP_LOCK(vp, LK_TRYUPGRADE | LK_INTERLOCK);
3059 VNASSERT(vp->v_usecount == 0 || (vp->v_iflag & VI_OWEINACT) == 0, vp,
3060 ("vnode with usecount and VI_OWEINACT set"));
3062 if (vp->v_iflag & VI_OWEINACT)
3063 vinactive(vp, curthread);
3064 if (func != VPUTX_VUNREF)
3071 * Vnode put/release.
3072 * If count drops to zero, call inactive routine and return to freelist.
3075 vrele(struct vnode *vp)
3078 vputx(vp, VPUTX_VRELE);
3082 * Release an already locked vnode. This give the same effects as
3083 * unlock+vrele(), but takes less time and avoids releasing and
3084 * re-aquiring the lock (as vrele() acquires the lock internally.)
3087 vput(struct vnode *vp)
3090 vputx(vp, VPUTX_VPUT);
3094 * Release an exclusively locked vnode. Do not unlock the vnode lock.
3097 vunref(struct vnode *vp)
3100 vputx(vp, VPUTX_VUNREF);
3104 * Increase the hold count and activate if this is the first reference.
3107 _vhold(struct vnode *vp, bool locked)
3112 ASSERT_VI_LOCKED(vp, __func__);
3114 ASSERT_VI_UNLOCKED(vp, __func__);
3115 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
3117 if (refcount_acquire_if_not_zero(&vp->v_holdcnt)) {
3118 VNODE_REFCOUNT_FENCE_ACQ();
3119 VNASSERT((vp->v_iflag & VI_FREE) == 0, vp,
3120 ("_vhold: vnode with holdcnt is free"));
3125 if ((vp->v_iflag & VI_FREE) == 0) {
3126 refcount_acquire(&vp->v_holdcnt);
3131 VNASSERT(vp->v_holdcnt == 0, vp,
3132 ("%s: wrong hold count", __func__));
3133 VNASSERT(vp->v_op != NULL, vp,
3134 ("%s: vnode already reclaimed.", __func__));
3136 * Remove a vnode from the free list, mark it as in use,
3137 * and put it on the active list.
3139 VNASSERT(vp->v_mount != NULL, vp,
3140 ("_vhold: vnode not on per mount vnode list"));
3142 mtx_lock(&mp->mnt_listmtx);
3143 if ((vp->v_mflag & VMP_TMPMNTFREELIST) != 0) {
3144 TAILQ_REMOVE(&mp->mnt_tmpfreevnodelist, vp, v_actfreelist);
3145 mp->mnt_tmpfreevnodelistsize--;
3146 vp->v_mflag &= ~VMP_TMPMNTFREELIST;
3148 mtx_lock(&vnode_free_list_mtx);
3149 TAILQ_REMOVE(&vnode_free_list, vp, v_actfreelist);
3151 mtx_unlock(&vnode_free_list_mtx);
3153 KASSERT((vp->v_iflag & VI_ACTIVE) == 0,
3154 ("Activating already active vnode"));
3155 vp->v_iflag &= ~VI_FREE;
3156 vp->v_iflag |= VI_ACTIVE;
3157 TAILQ_INSERT_HEAD(&mp->mnt_activevnodelist, vp, v_actfreelist);
3158 mp->mnt_activevnodelistsize++;
3159 mtx_unlock(&mp->mnt_listmtx);
3160 refcount_acquire(&vp->v_holdcnt);
3166 vholdnz(struct vnode *vp)
3169 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
3171 int old = atomic_fetchadd_int(&vp->v_holdcnt, 1);
3172 VNASSERT(old > 0, vp, ("%s: wrong hold count", __func__));
3174 atomic_add_int(&vp->v_holdcnt, 1);
3179 * Drop the hold count of the vnode. If this is the last reference to
3180 * the vnode we place it on the free list unless it has been vgone'd
3181 * (marked VI_DOOMED) in which case we will free it.
3183 * Because the vnode vm object keeps a hold reference on the vnode if
3184 * there is at least one resident non-cached page, the vnode cannot
3185 * leave the active list without the page cleanup done.
3188 _vdrop(struct vnode *vp, bool locked)
3195 ASSERT_VI_LOCKED(vp, __func__);
3197 ASSERT_VI_UNLOCKED(vp, __func__);
3198 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
3199 if (__predict_false((int)vp->v_holdcnt <= 0)) {
3200 vn_printf(vp, "vdrop: holdcnt %d", vp->v_holdcnt);
3201 panic("vdrop: wrong holdcnt");
3204 if (refcount_release_if_not_last(&vp->v_holdcnt))
3208 if (refcount_release(&vp->v_holdcnt) == 0) {
3212 if ((vp->v_iflag & VI_DOOMED) == 0) {
3214 * Mark a vnode as free: remove it from its active list
3215 * and put it up for recycling on the freelist.
3217 VNASSERT(vp->v_op != NULL, vp,
3218 ("vdropl: vnode already reclaimed."));
3219 VNASSERT((vp->v_iflag & VI_FREE) == 0, vp,
3220 ("vnode already free"));
3221 VNASSERT(vp->v_holdcnt == 0, vp,
3222 ("vdropl: freeing when we shouldn't"));
3223 active = vp->v_iflag & VI_ACTIVE;
3224 if ((vp->v_iflag & VI_OWEINACT) == 0) {
3225 vp->v_iflag &= ~VI_ACTIVE;
3228 mtx_lock(&mp->mnt_listmtx);
3230 TAILQ_REMOVE(&mp->mnt_activevnodelist,
3232 mp->mnt_activevnodelistsize--;
3234 TAILQ_INSERT_TAIL(&mp->mnt_tmpfreevnodelist,
3236 mp->mnt_tmpfreevnodelistsize++;
3237 vp->v_iflag |= VI_FREE;
3238 vp->v_mflag |= VMP_TMPMNTFREELIST;
3240 if (mp->mnt_tmpfreevnodelistsize >=
3241 mnt_free_list_batch)
3242 vnlru_return_batch_locked(mp);
3243 mtx_unlock(&mp->mnt_listmtx);
3245 VNASSERT(active == 0, vp,
3246 ("vdropl: active vnode not on per mount "
3248 mtx_lock(&vnode_free_list_mtx);
3249 TAILQ_INSERT_TAIL(&vnode_free_list, vp,
3252 vp->v_iflag |= VI_FREE;
3254 mtx_unlock(&vnode_free_list_mtx);
3258 counter_u64_add(free_owe_inact, 1);
3263 * The vnode has been marked for destruction, so free it.
3265 * The vnode will be returned to the zone where it will
3266 * normally remain until it is needed for another vnode. We
3267 * need to cleanup (or verify that the cleanup has already
3268 * been done) any residual data left from its current use
3269 * so as not to contaminate the freshly allocated vnode.
3271 CTR2(KTR_VFS, "%s: destroying the vnode %p", __func__, vp);
3272 atomic_subtract_long(&numvnodes, 1);
3274 VNASSERT((vp->v_iflag & VI_FREE) == 0, vp,
3275 ("cleaned vnode still on the free list."));
3276 VNASSERT(vp->v_data == NULL, vp, ("cleaned vnode isn't"));
3277 VNASSERT(vp->v_holdcnt == 0, vp, ("Non-zero hold count"));
3278 VNASSERT(vp->v_usecount == 0, vp, ("Non-zero use count"));
3279 VNASSERT(vp->v_writecount == 0, vp, ("Non-zero write count"));
3280 VNASSERT(bo->bo_numoutput == 0, vp, ("Clean vnode has pending I/O's"));
3281 VNASSERT(bo->bo_clean.bv_cnt == 0, vp, ("cleanbufcnt not 0"));
3282 VNASSERT(pctrie_is_empty(&bo->bo_clean.bv_root), vp,
3283 ("clean blk trie not empty"));
3284 VNASSERT(bo->bo_dirty.bv_cnt == 0, vp, ("dirtybufcnt not 0"));
3285 VNASSERT(pctrie_is_empty(&bo->bo_dirty.bv_root), vp,
3286 ("dirty blk trie not empty"));
3287 VNASSERT(TAILQ_EMPTY(&vp->v_cache_dst), vp, ("vp has namecache dst"));
3288 VNASSERT(LIST_EMPTY(&vp->v_cache_src), vp, ("vp has namecache src"));
3289 VNASSERT(vp->v_cache_dd == NULL, vp, ("vp has namecache for .."));
3290 VNASSERT(TAILQ_EMPTY(&vp->v_rl.rl_waiters), vp,
3291 ("Dangling rangelock waiters"));
3294 mac_vnode_destroy(vp);
3296 if (vp->v_pollinfo != NULL) {
3297 destroy_vpollinfo(vp->v_pollinfo);
3298 vp->v_pollinfo = NULL;
3301 /* XXX Elsewhere we detect an already freed vnode via NULL v_op. */
3304 vp->v_mountedhere = NULL;
3307 vp->v_fifoinfo = NULL;
3308 vp->v_lasta = vp->v_clen = vp->v_cstart = vp->v_lastw = 0;
3312 uma_zfree(vnode_zone, vp);
3316 * Call VOP_INACTIVE on the vnode and manage the DOINGINACT and OWEINACT
3317 * flags. DOINGINACT prevents us from recursing in calls to vinactive.
3318 * OWEINACT tracks whether a vnode missed a call to inactive due to a
3319 * failed lock upgrade.
3322 vinactive(struct vnode *vp, struct thread *td)
3324 struct vm_object *obj;
3326 ASSERT_VOP_ELOCKED(vp, "vinactive");
3327 ASSERT_VI_LOCKED(vp, "vinactive");
3328 VNASSERT((vp->v_iflag & VI_DOINGINACT) == 0, vp,
3329 ("vinactive: recursed on VI_DOINGINACT"));
3330 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
3331 vp->v_iflag |= VI_DOINGINACT;
3332 vp->v_iflag &= ~VI_OWEINACT;
3335 * Before moving off the active list, we must be sure that any
3336 * modified pages are converted into the vnode's dirty
3337 * buffers, since these will no longer be checked once the
3338 * vnode is on the inactive list.
3340 * The write-out of the dirty pages is asynchronous. At the
3341 * point that VOP_INACTIVE() is called, there could still be
3342 * pending I/O and dirty pages in the object.
3344 if ((obj = vp->v_object) != NULL && (vp->v_vflag & VV_NOSYNC) == 0 &&
3345 (obj->flags & OBJ_MIGHTBEDIRTY) != 0) {
3346 VM_OBJECT_WLOCK(obj);
3347 vm_object_page_clean(obj, 0, 0, 0);
3348 VM_OBJECT_WUNLOCK(obj);
3350 VOP_INACTIVE(vp, td);
3352 VNASSERT(vp->v_iflag & VI_DOINGINACT, vp,
3353 ("vinactive: lost VI_DOINGINACT"));
3354 vp->v_iflag &= ~VI_DOINGINACT;
3358 * Remove any vnodes in the vnode table belonging to mount point mp.
3360 * If FORCECLOSE is not specified, there should not be any active ones,
3361 * return error if any are found (nb: this is a user error, not a
3362 * system error). If FORCECLOSE is specified, detach any active vnodes
3365 * If WRITECLOSE is set, only flush out regular file vnodes open for
3368 * SKIPSYSTEM causes any vnodes marked VV_SYSTEM to be skipped.
3370 * `rootrefs' specifies the base reference count for the root vnode
3371 * of this filesystem. The root vnode is considered busy if its
3372 * v_usecount exceeds this value. On a successful return, vflush(, td)
3373 * will call vrele() on the root vnode exactly rootrefs times.
3374 * If the SKIPSYSTEM or WRITECLOSE flags are specified, rootrefs must
3378 static int busyprt = 0; /* print out busy vnodes */
3379 SYSCTL_INT(_debug, OID_AUTO, busyprt, CTLFLAG_RW, &busyprt, 0, "Print out busy vnodes");
3383 vflush(struct mount *mp, int rootrefs, int flags, struct thread *td)
3385 struct vnode *vp, *mvp, *rootvp = NULL;
3387 int busy = 0, error;
3389 CTR4(KTR_VFS, "%s: mp %p with rootrefs %d and flags %d", __func__, mp,
3392 KASSERT((flags & (SKIPSYSTEM | WRITECLOSE)) == 0,
3393 ("vflush: bad args"));
3395 * Get the filesystem root vnode. We can vput() it
3396 * immediately, since with rootrefs > 0, it won't go away.
3398 if ((error = VFS_ROOT(mp, LK_EXCLUSIVE, &rootvp)) != 0) {
3399 CTR2(KTR_VFS, "%s: vfs_root lookup failed with %d",
3406 MNT_VNODE_FOREACH_ALL(vp, mp, mvp) {
3408 error = vn_lock(vp, LK_INTERLOCK | LK_EXCLUSIVE);
3411 MNT_VNODE_FOREACH_ALL_ABORT(mp, mvp);
3415 * Skip over a vnodes marked VV_SYSTEM.
3417 if ((flags & SKIPSYSTEM) && (vp->v_vflag & VV_SYSTEM)) {
3423 * If WRITECLOSE is set, flush out unlinked but still open
3424 * files (even if open only for reading) and regular file
3425 * vnodes open for writing.
3427 if (flags & WRITECLOSE) {
3428 if (vp->v_object != NULL) {
3429 VM_OBJECT_WLOCK(vp->v_object);
3430 vm_object_page_clean(vp->v_object, 0, 0, 0);
3431 VM_OBJECT_WUNLOCK(vp->v_object);
3433 error = VOP_FSYNC(vp, MNT_WAIT, td);
3437 MNT_VNODE_FOREACH_ALL_ABORT(mp, mvp);
3440 error = VOP_GETATTR(vp, &vattr, td->td_ucred);
3443 if ((vp->v_type == VNON ||
3444 (error == 0 && vattr.va_nlink > 0)) &&
3445 (vp->v_writecount <= 0 || vp->v_type != VREG)) {
3453 * With v_usecount == 0, all we need to do is clear out the
3454 * vnode data structures and we are done.
3456 * If FORCECLOSE is set, forcibly close the vnode.
3458 if (vp->v_usecount == 0 || (flags & FORCECLOSE)) {
3464 vn_printf(vp, "vflush: busy vnode ");
3470 if (rootrefs > 0 && (flags & FORCECLOSE) == 0) {
3472 * If just the root vnode is busy, and if its refcount
3473 * is equal to `rootrefs', then go ahead and kill it.
3476 KASSERT(busy > 0, ("vflush: not busy"));
3477 VNASSERT(rootvp->v_usecount >= rootrefs, rootvp,
3478 ("vflush: usecount %d < rootrefs %d",
3479 rootvp->v_usecount, rootrefs));
3480 if (busy == 1 && rootvp->v_usecount == rootrefs) {
3481 VOP_LOCK(rootvp, LK_EXCLUSIVE|LK_INTERLOCK);
3483 VOP_UNLOCK(rootvp, 0);
3489 CTR2(KTR_VFS, "%s: failing as %d vnodes are busy", __func__,
3493 for (; rootrefs > 0; rootrefs--)
3499 * Recycle an unused vnode to the front of the free list.
3502 vrecycle(struct vnode *vp)
3507 recycled = vrecyclel(vp);
3513 * vrecycle, with the vp interlock held.
3516 vrecyclel(struct vnode *vp)
3520 ASSERT_VOP_ELOCKED(vp, __func__);
3521 ASSERT_VI_LOCKED(vp, __func__);
3522 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
3524 if (vp->v_usecount == 0) {
3532 * Eliminate all activity associated with a vnode
3533 * in preparation for reuse.
3536 vgone(struct vnode *vp)
3544 notify_lowervp_vfs_dummy(struct mount *mp __unused,
3545 struct vnode *lowervp __unused)
3550 * Notify upper mounts about reclaimed or unlinked vnode.
3553 vfs_notify_upper(struct vnode *vp, int event)
3555 static struct vfsops vgonel_vfsops = {
3556 .vfs_reclaim_lowervp = notify_lowervp_vfs_dummy,
3557 .vfs_unlink_lowervp = notify_lowervp_vfs_dummy,
3559 struct mount *mp, *ump, *mmp;
3566 if (TAILQ_EMPTY(&mp->mnt_uppers))
3569 mmp = malloc(sizeof(struct mount), M_TEMP, M_WAITOK | M_ZERO);
3570 mmp->mnt_op = &vgonel_vfsops;
3571 mmp->mnt_kern_flag |= MNTK_MARKER;
3573 mp->mnt_kern_flag |= MNTK_VGONE_UPPER;
3574 for (ump = TAILQ_FIRST(&mp->mnt_uppers); ump != NULL;) {
3575 if ((ump->mnt_kern_flag & MNTK_MARKER) != 0) {
3576 ump = TAILQ_NEXT(ump, mnt_upper_link);
3579 TAILQ_INSERT_AFTER(&mp->mnt_uppers, ump, mmp, mnt_upper_link);
3582 case VFS_NOTIFY_UPPER_RECLAIM:
3583 VFS_RECLAIM_LOWERVP(ump, vp);
3585 case VFS_NOTIFY_UPPER_UNLINK:
3586 VFS_UNLINK_LOWERVP(ump, vp);
3589 KASSERT(0, ("invalid event %d", event));
3593 ump = TAILQ_NEXT(mmp, mnt_upper_link);
3594 TAILQ_REMOVE(&mp->mnt_uppers, mmp, mnt_upper_link);
3597 mp->mnt_kern_flag &= ~MNTK_VGONE_UPPER;
3598 if ((mp->mnt_kern_flag & MNTK_VGONE_WAITER) != 0) {
3599 mp->mnt_kern_flag &= ~MNTK_VGONE_WAITER;
3600 wakeup(&mp->mnt_uppers);
3607 * vgone, with the vp interlock held.
3610 vgonel(struct vnode *vp)
3615 bool active, oweinact;
3617 ASSERT_VOP_ELOCKED(vp, "vgonel");
3618 ASSERT_VI_LOCKED(vp, "vgonel");
3619 VNASSERT(vp->v_holdcnt, vp,
3620 ("vgonel: vp %p has no reference.", vp));
3621 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
3625 * Don't vgonel if we're already doomed.
3627 if (vp->v_iflag & VI_DOOMED)
3629 vp->v_iflag |= VI_DOOMED;
3632 * Check to see if the vnode is in use. If so, we have to call
3633 * VOP_CLOSE() and VOP_INACTIVE().
3635 active = vp->v_usecount > 0;
3636 oweinact = (vp->v_iflag & VI_OWEINACT) != 0;
3638 vfs_notify_upper(vp, VFS_NOTIFY_UPPER_RECLAIM);
3641 * If purging an active vnode, it must be closed and
3642 * deactivated before being reclaimed.
3645 VOP_CLOSE(vp, FNONBLOCK, NOCRED, td);
3646 if (oweinact || active) {
3648 if ((vp->v_iflag & VI_DOINGINACT) == 0)
3652 if (vp->v_type == VSOCK)
3653 vfs_unp_reclaim(vp);
3656 * Clean out any buffers associated with the vnode.
3657 * If the flush fails, just toss the buffers.
3660 if (!TAILQ_EMPTY(&vp->v_bufobj.bo_dirty.bv_hd))
3661 (void) vn_start_secondary_write(vp, &mp, V_WAIT);
3662 if (vinvalbuf(vp, V_SAVE, 0, 0) != 0) {
3663 while (vinvalbuf(vp, 0, 0, 0) != 0)
3667 BO_LOCK(&vp->v_bufobj);
3668 KASSERT(TAILQ_EMPTY(&vp->v_bufobj.bo_dirty.bv_hd) &&
3669 vp->v_bufobj.bo_dirty.bv_cnt == 0 &&
3670 TAILQ_EMPTY(&vp->v_bufobj.bo_clean.bv_hd) &&
3671 vp->v_bufobj.bo_clean.bv_cnt == 0,
3672 ("vp %p bufobj not invalidated", vp));
3675 * For VMIO bufobj, BO_DEAD is set later, or in
3676 * vm_object_terminate() after the object's page queue is
3679 object = vp->v_bufobj.bo_object;
3681 vp->v_bufobj.bo_flag |= BO_DEAD;
3682 BO_UNLOCK(&vp->v_bufobj);
3685 * Handle the VM part. Tmpfs handles v_object on its own (the
3686 * OBJT_VNODE check). Nullfs or other bypassing filesystems
3687 * should not touch the object borrowed from the lower vnode
3688 * (the handle check).
3690 if (object != NULL && object->type == OBJT_VNODE &&
3691 object->handle == vp)
3692 vnode_destroy_vobject(vp);
3695 * Reclaim the vnode.
3697 if (VOP_RECLAIM(vp, td))
3698 panic("vgone: cannot reclaim");
3700 vn_finished_secondary_write(mp);
3701 VNASSERT(vp->v_object == NULL, vp,
3702 ("vop_reclaim left v_object vp=%p, tag=%s", vp, vp->v_tag));
3704 * Clear the advisory locks and wake up waiting threads.
3706 (void)VOP_ADVLOCKPURGE(vp);
3709 * Delete from old mount point vnode list.
3714 * Done with purge, reset to the standard lock and invalidate
3718 vp->v_vnlock = &vp->v_lock;
3719 vp->v_op = &dead_vnodeops;
3725 * Calculate the total number of references to a special device.
3728 vcount(struct vnode *vp)
3733 count = vp->v_rdev->si_usecount;
3739 * Same as above, but using the struct cdev *as argument
3742 count_dev(struct cdev *dev)
3747 count = dev->si_usecount;
3753 * Print out a description of a vnode.
3755 static char *typename[] =
3756 {"VNON", "VREG", "VDIR", "VBLK", "VCHR", "VLNK", "VSOCK", "VFIFO", "VBAD",
3760 vn_printf(struct vnode *vp, const char *fmt, ...)
3763 char buf[256], buf2[16];
3769 printf("%p: ", (void *)vp);
3770 printf("tag %s, type %s\n", vp->v_tag, typename[vp->v_type]);
3771 printf(" usecount %d, writecount %d, refcount %d",
3772 vp->v_usecount, vp->v_writecount, vp->v_holdcnt);
3773 switch (vp->v_type) {
3775 printf(" mountedhere %p\n", vp->v_mountedhere);
3778 printf(" rdev %p\n", vp->v_rdev);
3781 printf(" socket %p\n", vp->v_unpcb);
3784 printf(" fifoinfo %p\n", vp->v_fifoinfo);
3792 if (vp->v_vflag & VV_ROOT)
3793 strlcat(buf, "|VV_ROOT", sizeof(buf));
3794 if (vp->v_vflag & VV_ISTTY)
3795 strlcat(buf, "|VV_ISTTY", sizeof(buf));
3796 if (vp->v_vflag & VV_NOSYNC)
3797 strlcat(buf, "|VV_NOSYNC", sizeof(buf));
3798 if (vp->v_vflag & VV_ETERNALDEV)
3799 strlcat(buf, "|VV_ETERNALDEV", sizeof(buf));
3800 if (vp->v_vflag & VV_CACHEDLABEL)
3801 strlcat(buf, "|VV_CACHEDLABEL", sizeof(buf));
3802 if (vp->v_vflag & VV_COPYONWRITE)
3803 strlcat(buf, "|VV_COPYONWRITE", sizeof(buf));
3804 if (vp->v_vflag & VV_SYSTEM)
3805 strlcat(buf, "|VV_SYSTEM", sizeof(buf));
3806 if (vp->v_vflag & VV_PROCDEP)
3807 strlcat(buf, "|VV_PROCDEP", sizeof(buf));
3808 if (vp->v_vflag & VV_NOKNOTE)
3809 strlcat(buf, "|VV_NOKNOTE", sizeof(buf));
3810 if (vp->v_vflag & VV_DELETED)
3811 strlcat(buf, "|VV_DELETED", sizeof(buf));
3812 if (vp->v_vflag & VV_MD)
3813 strlcat(buf, "|VV_MD", sizeof(buf));
3814 if (vp->v_vflag & VV_FORCEINSMQ)
3815 strlcat(buf, "|VV_FORCEINSMQ", sizeof(buf));
3816 flags = vp->v_vflag & ~(VV_ROOT | VV_ISTTY | VV_NOSYNC | VV_ETERNALDEV |
3817 VV_CACHEDLABEL | VV_COPYONWRITE | VV_SYSTEM | VV_PROCDEP |
3818 VV_NOKNOTE | VV_DELETED | VV_MD | VV_FORCEINSMQ);
3820 snprintf(buf2, sizeof(buf2), "|VV(0x%lx)", flags);
3821 strlcat(buf, buf2, sizeof(buf));
3823 if (vp->v_iflag & VI_MOUNT)
3824 strlcat(buf, "|VI_MOUNT", sizeof(buf));
3825 if (vp->v_iflag & VI_DOOMED)
3826 strlcat(buf, "|VI_DOOMED", sizeof(buf));
3827 if (vp->v_iflag & VI_FREE)
3828 strlcat(buf, "|VI_FREE", sizeof(buf));
3829 if (vp->v_iflag & VI_ACTIVE)
3830 strlcat(buf, "|VI_ACTIVE", sizeof(buf));
3831 if (vp->v_iflag & VI_DOINGINACT)
3832 strlcat(buf, "|VI_DOINGINACT", sizeof(buf));
3833 if (vp->v_iflag & VI_OWEINACT)
3834 strlcat(buf, "|VI_OWEINACT", sizeof(buf));
3835 flags = vp->v_iflag & ~(VI_MOUNT | VI_DOOMED | VI_FREE |
3836 VI_ACTIVE | VI_DOINGINACT | VI_OWEINACT);
3838 snprintf(buf2, sizeof(buf2), "|VI(0x%lx)", flags);
3839 strlcat(buf, buf2, sizeof(buf));
3841 printf(" flags (%s)\n", buf + 1);
3842 if (mtx_owned(VI_MTX(vp)))
3843 printf(" VI_LOCKed");
3844 if (vp->v_object != NULL)
3845 printf(" v_object %p ref %d pages %d "
3846 "cleanbuf %d dirtybuf %d\n",
3847 vp->v_object, vp->v_object->ref_count,
3848 vp->v_object->resident_page_count,
3849 vp->v_bufobj.bo_clean.bv_cnt,
3850 vp->v_bufobj.bo_dirty.bv_cnt);
3852 lockmgr_printinfo(vp->v_vnlock);
3853 if (vp->v_data != NULL)
3859 * List all of the locked vnodes in the system.
3860 * Called when debugging the kernel.
3862 DB_SHOW_COMMAND(lockedvnods, lockedvnodes)
3868 * Note: because this is DDB, we can't obey the locking semantics
3869 * for these structures, which means we could catch an inconsistent
3870 * state and dereference a nasty pointer. Not much to be done
3873 db_printf("Locked vnodes\n");
3874 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
3875 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
3876 if (vp->v_type != VMARKER && VOP_ISLOCKED(vp))
3877 vn_printf(vp, "vnode ");
3883 * Show details about the given vnode.
3885 DB_SHOW_COMMAND(vnode, db_show_vnode)
3891 vp = (struct vnode *)addr;
3892 vn_printf(vp, "vnode ");
3896 * Show details about the given mount point.
3898 DB_SHOW_COMMAND(mount, db_show_mount)
3909 /* No address given, print short info about all mount points. */
3910 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
3911 db_printf("%p %s on %s (%s)\n", mp,
3912 mp->mnt_stat.f_mntfromname,
3913 mp->mnt_stat.f_mntonname,
3914 mp->mnt_stat.f_fstypename);
3918 db_printf("\nMore info: show mount <addr>\n");
3922 mp = (struct mount *)addr;
3923 db_printf("%p %s on %s (%s)\n", mp, mp->mnt_stat.f_mntfromname,
3924 mp->mnt_stat.f_mntonname, mp->mnt_stat.f_fstypename);
3927 mflags = mp->mnt_flag;
3928 #define MNT_FLAG(flag) do { \
3929 if (mflags & (flag)) { \
3930 if (buf[0] != '\0') \
3931 strlcat(buf, ", ", sizeof(buf)); \
3932 strlcat(buf, (#flag) + 4, sizeof(buf)); \
3933 mflags &= ~(flag); \
3936 MNT_FLAG(MNT_RDONLY);
3937 MNT_FLAG(MNT_SYNCHRONOUS);
3938 MNT_FLAG(MNT_NOEXEC);
3939 MNT_FLAG(MNT_NOSUID);
3940 MNT_FLAG(MNT_NFS4ACLS);
3941 MNT_FLAG(MNT_UNION);
3942 MNT_FLAG(MNT_ASYNC);
3943 MNT_FLAG(MNT_SUIDDIR);
3944 MNT_FLAG(MNT_SOFTDEP);
3945 MNT_FLAG(MNT_NOSYMFOLLOW);
3946 MNT_FLAG(MNT_GJOURNAL);
3947 MNT_FLAG(MNT_MULTILABEL);
3949 MNT_FLAG(MNT_NOATIME);
3950 MNT_FLAG(MNT_NOCLUSTERR);
3951 MNT_FLAG(MNT_NOCLUSTERW);
3953 MNT_FLAG(MNT_EXRDONLY);
3954 MNT_FLAG(MNT_EXPORTED);
3955 MNT_FLAG(MNT_DEFEXPORTED);
3956 MNT_FLAG(MNT_EXPORTANON);
3957 MNT_FLAG(MNT_EXKERB);
3958 MNT_FLAG(MNT_EXPUBLIC);
3959 MNT_FLAG(MNT_LOCAL);
3960 MNT_FLAG(MNT_QUOTA);
3961 MNT_FLAG(MNT_ROOTFS);
3963 MNT_FLAG(MNT_IGNORE);
3964 MNT_FLAG(MNT_UPDATE);
3965 MNT_FLAG(MNT_DELEXPORT);
3966 MNT_FLAG(MNT_RELOAD);
3967 MNT_FLAG(MNT_FORCE);
3968 MNT_FLAG(MNT_SNAPSHOT);
3969 MNT_FLAG(MNT_BYFSID);
3973 strlcat(buf, ", ", sizeof(buf));
3974 snprintf(buf + strlen(buf), sizeof(buf) - strlen(buf),
3975 "0x%016jx", mflags);
3977 db_printf(" mnt_flag = %s\n", buf);
3980 flags = mp->mnt_kern_flag;
3981 #define MNT_KERN_FLAG(flag) do { \
3982 if (flags & (flag)) { \
3983 if (buf[0] != '\0') \
3984 strlcat(buf, ", ", sizeof(buf)); \
3985 strlcat(buf, (#flag) + 5, sizeof(buf)); \
3989 MNT_KERN_FLAG(MNTK_UNMOUNTF);
3990 MNT_KERN_FLAG(MNTK_ASYNC);
3991 MNT_KERN_FLAG(MNTK_SOFTDEP);
3992 MNT_KERN_FLAG(MNTK_DRAINING);
3993 MNT_KERN_FLAG(MNTK_REFEXPIRE);
3994 MNT_KERN_FLAG(MNTK_EXTENDED_SHARED);
3995 MNT_KERN_FLAG(MNTK_SHARED_WRITES);
3996 MNT_KERN_FLAG(MNTK_NO_IOPF);
3997 MNT_KERN_FLAG(MNTK_VGONE_UPPER);
3998 MNT_KERN_FLAG(MNTK_VGONE_WAITER);
3999 MNT_KERN_FLAG(MNTK_LOOKUP_EXCL_DOTDOT);
4000 MNT_KERN_FLAG(MNTK_MARKER);
4001 MNT_KERN_FLAG(MNTK_USES_BCACHE);
4002 MNT_KERN_FLAG(MNTK_NOASYNC);
4003 MNT_KERN_FLAG(MNTK_UNMOUNT);
4004 MNT_KERN_FLAG(MNTK_MWAIT);
4005 MNT_KERN_FLAG(MNTK_SUSPEND);
4006 MNT_KERN_FLAG(MNTK_SUSPEND2);
4007 MNT_KERN_FLAG(MNTK_SUSPENDED);
4008 MNT_KERN_FLAG(MNTK_LOOKUP_SHARED);
4009 MNT_KERN_FLAG(MNTK_NOKNOTE);
4010 #undef MNT_KERN_FLAG
4013 strlcat(buf, ", ", sizeof(buf));
4014 snprintf(buf + strlen(buf), sizeof(buf) - strlen(buf),
4017 db_printf(" mnt_kern_flag = %s\n", buf);
4019 db_printf(" mnt_opt = ");
4020 opt = TAILQ_FIRST(mp->mnt_opt);
4022 db_printf("%s", opt->name);
4023 opt = TAILQ_NEXT(opt, link);
4024 while (opt != NULL) {
4025 db_printf(", %s", opt->name);
4026 opt = TAILQ_NEXT(opt, link);
4032 db_printf(" mnt_stat = { version=%u type=%u flags=0x%016jx "
4033 "bsize=%ju iosize=%ju blocks=%ju bfree=%ju bavail=%jd files=%ju "
4034 "ffree=%jd syncwrites=%ju asyncwrites=%ju syncreads=%ju "
4035 "asyncreads=%ju namemax=%u owner=%u fsid=[%d, %d] }\n",
4036 (u_int)sp->f_version, (u_int)sp->f_type, (uintmax_t)sp->f_flags,
4037 (uintmax_t)sp->f_bsize, (uintmax_t)sp->f_iosize,
4038 (uintmax_t)sp->f_blocks, (uintmax_t)sp->f_bfree,
4039 (intmax_t)sp->f_bavail, (uintmax_t)sp->f_files,
4040 (intmax_t)sp->f_ffree, (uintmax_t)sp->f_syncwrites,
4041 (uintmax_t)sp->f_asyncwrites, (uintmax_t)sp->f_syncreads,
4042 (uintmax_t)sp->f_asyncreads, (u_int)sp->f_namemax,
4043 (u_int)sp->f_owner, (int)sp->f_fsid.val[0], (int)sp->f_fsid.val[1]);
4045 db_printf(" mnt_cred = { uid=%u ruid=%u",
4046 (u_int)mp->mnt_cred->cr_uid, (u_int)mp->mnt_cred->cr_ruid);
4047 if (jailed(mp->mnt_cred))
4048 db_printf(", jail=%d", mp->mnt_cred->cr_prison->pr_id);
4050 db_printf(" mnt_ref = %d (with %d in the struct)\n",
4051 vfs_mount_fetch_counter(mp, MNT_COUNT_REF), mp->mnt_ref);
4052 db_printf(" mnt_gen = %d\n", mp->mnt_gen);
4053 db_printf(" mnt_nvnodelistsize = %d\n", mp->mnt_nvnodelistsize);
4054 db_printf(" mnt_activevnodelistsize = %d\n",
4055 mp->mnt_activevnodelistsize);
4056 db_printf(" mnt_writeopcount = %d (with %d in the struct)\n",
4057 vfs_mount_fetch_counter(mp, MNT_COUNT_WRITEOPCOUNT), mp->mnt_writeopcount);
4058 db_printf(" mnt_maxsymlinklen = %d\n", mp->mnt_maxsymlinklen);
4059 db_printf(" mnt_iosize_max = %d\n", mp->mnt_iosize_max);
4060 db_printf(" mnt_hashseed = %u\n", mp->mnt_hashseed);
4061 db_printf(" mnt_lockref = %d (with %d in the struct)\n",
4062 vfs_mount_fetch_counter(mp, MNT_COUNT_LOCKREF), mp->mnt_lockref);
4063 db_printf(" mnt_secondary_writes = %d\n", mp->mnt_secondary_writes);
4064 db_printf(" mnt_secondary_accwrites = %d\n",
4065 mp->mnt_secondary_accwrites);
4066 db_printf(" mnt_gjprovider = %s\n",
4067 mp->mnt_gjprovider != NULL ? mp->mnt_gjprovider : "NULL");
4068 db_printf(" mnt_vfs_ops = %d\n", mp->mnt_vfs_ops);
4070 db_printf("\n\nList of active vnodes\n");
4071 TAILQ_FOREACH(vp, &mp->mnt_activevnodelist, v_actfreelist) {
4072 if (vp->v_type != VMARKER) {
4073 vn_printf(vp, "vnode ");
4078 db_printf("\n\nList of inactive vnodes\n");
4079 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
4080 if (vp->v_type != VMARKER && (vp->v_iflag & VI_ACTIVE) == 0) {
4081 vn_printf(vp, "vnode ");
4090 * Fill in a struct xvfsconf based on a struct vfsconf.
4093 vfsconf2x(struct sysctl_req *req, struct vfsconf *vfsp)
4095 struct xvfsconf xvfsp;
4097 bzero(&xvfsp, sizeof(xvfsp));
4098 strcpy(xvfsp.vfc_name, vfsp->vfc_name);
4099 xvfsp.vfc_typenum = vfsp->vfc_typenum;
4100 xvfsp.vfc_refcount = vfsp->vfc_refcount;
4101 xvfsp.vfc_flags = vfsp->vfc_flags;
4103 * These are unused in userland, we keep them
4104 * to not break binary compatibility.
4106 xvfsp.vfc_vfsops = NULL;
4107 xvfsp.vfc_next = NULL;
4108 return (SYSCTL_OUT(req, &xvfsp, sizeof(xvfsp)));
4111 #ifdef COMPAT_FREEBSD32
4113 uint32_t vfc_vfsops;
4114 char vfc_name[MFSNAMELEN];
4115 int32_t vfc_typenum;
4116 int32_t vfc_refcount;
4122 vfsconf2x32(struct sysctl_req *req, struct vfsconf *vfsp)
4124 struct xvfsconf32 xvfsp;
4126 bzero(&xvfsp, sizeof(xvfsp));
4127 strcpy(xvfsp.vfc_name, vfsp->vfc_name);
4128 xvfsp.vfc_typenum = vfsp->vfc_typenum;
4129 xvfsp.vfc_refcount = vfsp->vfc_refcount;
4130 xvfsp.vfc_flags = vfsp->vfc_flags;
4131 return (SYSCTL_OUT(req, &xvfsp, sizeof(xvfsp)));
4136 * Top level filesystem related information gathering.
4139 sysctl_vfs_conflist(SYSCTL_HANDLER_ARGS)
4141 struct vfsconf *vfsp;
4146 TAILQ_FOREACH(vfsp, &vfsconf, vfc_list) {
4147 #ifdef COMPAT_FREEBSD32
4148 if (req->flags & SCTL_MASK32)
4149 error = vfsconf2x32(req, vfsp);
4152 error = vfsconf2x(req, vfsp);
4160 SYSCTL_PROC(_vfs, OID_AUTO, conflist, CTLTYPE_OPAQUE | CTLFLAG_RD |
4161 CTLFLAG_MPSAFE, NULL, 0, sysctl_vfs_conflist,
4162 "S,xvfsconf", "List of all configured filesystems");
4164 #ifndef BURN_BRIDGES
4165 static int sysctl_ovfs_conf(SYSCTL_HANDLER_ARGS);
4168 vfs_sysctl(SYSCTL_HANDLER_ARGS)
4170 int *name = (int *)arg1 - 1; /* XXX */
4171 u_int namelen = arg2 + 1; /* XXX */
4172 struct vfsconf *vfsp;
4174 log(LOG_WARNING, "userland calling deprecated sysctl, "
4175 "please rebuild world\n");
4177 #if 1 || defined(COMPAT_PRELITE2)
4178 /* Resolve ambiguity between VFS_VFSCONF and VFS_GENERIC. */
4180 return (sysctl_ovfs_conf(oidp, arg1, arg2, req));
4184 case VFS_MAXTYPENUM:
4187 return (SYSCTL_OUT(req, &maxvfsconf, sizeof(int)));
4190 return (ENOTDIR); /* overloaded */
4192 TAILQ_FOREACH(vfsp, &vfsconf, vfc_list) {
4193 if (vfsp->vfc_typenum == name[2])
4198 return (EOPNOTSUPP);
4199 #ifdef COMPAT_FREEBSD32
4200 if (req->flags & SCTL_MASK32)
4201 return (vfsconf2x32(req, vfsp));
4204 return (vfsconf2x(req, vfsp));
4206 return (EOPNOTSUPP);
4209 static SYSCTL_NODE(_vfs, VFS_GENERIC, generic, CTLFLAG_RD | CTLFLAG_SKIP |
4210 CTLFLAG_MPSAFE, vfs_sysctl,
4211 "Generic filesystem");
4213 #if 1 || defined(COMPAT_PRELITE2)
4216 sysctl_ovfs_conf(SYSCTL_HANDLER_ARGS)
4219 struct vfsconf *vfsp;
4220 struct ovfsconf ovfs;
4223 TAILQ_FOREACH(vfsp, &vfsconf, vfc_list) {
4224 bzero(&ovfs, sizeof(ovfs));
4225 ovfs.vfc_vfsops = vfsp->vfc_vfsops; /* XXX used as flag */
4226 strcpy(ovfs.vfc_name, vfsp->vfc_name);
4227 ovfs.vfc_index = vfsp->vfc_typenum;
4228 ovfs.vfc_refcount = vfsp->vfc_refcount;
4229 ovfs.vfc_flags = vfsp->vfc_flags;
4230 error = SYSCTL_OUT(req, &ovfs, sizeof ovfs);
4240 #endif /* 1 || COMPAT_PRELITE2 */
4241 #endif /* !BURN_BRIDGES */
4243 #define KINFO_VNODESLOP 10
4246 * Dump vnode list (via sysctl).
4250 sysctl_vnode(SYSCTL_HANDLER_ARGS)
4258 * Stale numvnodes access is not fatal here.
4261 len = (numvnodes + KINFO_VNODESLOP) * sizeof *xvn;
4263 /* Make an estimate */
4264 return (SYSCTL_OUT(req, 0, len));
4266 error = sysctl_wire_old_buffer(req, 0);
4269 xvn = malloc(len, M_TEMP, M_ZERO | M_WAITOK);
4271 mtx_lock(&mountlist_mtx);
4272 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
4273 if (vfs_busy(mp, MBF_NOWAIT | MBF_MNTLSTLOCK))
4276 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
4280 xvn[n].xv_size = sizeof *xvn;
4281 xvn[n].xv_vnode = vp;
4282 xvn[n].xv_id = 0; /* XXX compat */
4283 #define XV_COPY(field) xvn[n].xv_##field = vp->v_##field
4285 XV_COPY(writecount);
4291 xvn[n].xv_flag = vp->v_vflag;
4293 switch (vp->v_type) {
4300 if (vp->v_rdev == NULL) {
4304 xvn[n].xv_dev = dev2udev(vp->v_rdev);
4307 xvn[n].xv_socket = vp->v_socket;
4310 xvn[n].xv_fifo = vp->v_fifoinfo;
4315 /* shouldn't happen? */
4323 mtx_lock(&mountlist_mtx);
4328 mtx_unlock(&mountlist_mtx);
4330 error = SYSCTL_OUT(req, xvn, n * sizeof *xvn);
4335 SYSCTL_PROC(_kern, KERN_VNODE, vnode, CTLTYPE_OPAQUE | CTLFLAG_RD |
4336 CTLFLAG_MPSAFE, 0, 0, sysctl_vnode, "S,xvnode",
4341 unmount_or_warn(struct mount *mp)
4345 error = dounmount(mp, MNT_FORCE, curthread);
4347 printf("unmount of %s failed (", mp->mnt_stat.f_mntonname);
4351 printf("%d)\n", error);
4356 * Unmount all filesystems. The list is traversed in reverse order
4357 * of mounting to avoid dependencies.
4360 vfs_unmountall(void)
4362 struct mount *mp, *tmp;
4364 CTR1(KTR_VFS, "%s: unmounting all filesystems", __func__);
4367 * Since this only runs when rebooting, it is not interlocked.
4369 TAILQ_FOREACH_REVERSE_SAFE(mp, &mountlist, mntlist, mnt_list, tmp) {
4373 * Forcibly unmounting "/dev" before "/" would prevent clean
4374 * unmount of the latter.
4376 if (mp == rootdevmp)
4379 unmount_or_warn(mp);
4382 if (rootdevmp != NULL)
4383 unmount_or_warn(rootdevmp);
4387 * perform msync on all vnodes under a mount point
4388 * the mount point must be locked.
4391 vfs_msync(struct mount *mp, int flags)
4393 struct vnode *vp, *mvp;
4394 struct vm_object *obj;
4396 CTR2(KTR_VFS, "%s: mp %p", __func__, mp);
4398 vnlru_return_batch(mp);
4400 MNT_VNODE_FOREACH_ACTIVE(vp, mp, mvp) {
4402 if (obj != NULL && (obj->flags & OBJ_MIGHTBEDIRTY) != 0 &&
4403 (flags == MNT_WAIT || VOP_ISLOCKED(vp) == 0)) {
4405 LK_EXCLUSIVE | LK_RETRY | LK_INTERLOCK,
4407 if (vp->v_vflag & VV_NOSYNC) { /* unlinked */
4414 VM_OBJECT_WLOCK(obj);
4415 vm_object_page_clean(obj, 0, 0,
4417 OBJPC_SYNC : OBJPC_NOSYNC);
4418 VM_OBJECT_WUNLOCK(obj);
4428 destroy_vpollinfo_free(struct vpollinfo *vi)
4431 knlist_destroy(&vi->vpi_selinfo.si_note);
4432 mtx_destroy(&vi->vpi_lock);
4433 uma_zfree(vnodepoll_zone, vi);
4437 destroy_vpollinfo(struct vpollinfo *vi)
4440 knlist_clear(&vi->vpi_selinfo.si_note, 1);
4441 seldrain(&vi->vpi_selinfo);
4442 destroy_vpollinfo_free(vi);
4446 * Initialize per-vnode helper structure to hold poll-related state.
4449 v_addpollinfo(struct vnode *vp)
4451 struct vpollinfo *vi;
4453 if (vp->v_pollinfo != NULL)
4455 vi = uma_zalloc(vnodepoll_zone, M_WAITOK | M_ZERO);
4456 mtx_init(&vi->vpi_lock, "vnode pollinfo", NULL, MTX_DEF);
4457 knlist_init(&vi->vpi_selinfo.si_note, vp, vfs_knllock,
4458 vfs_knlunlock, vfs_knl_assert_locked, vfs_knl_assert_unlocked);
4460 if (vp->v_pollinfo != NULL) {
4462 destroy_vpollinfo_free(vi);
4465 vp->v_pollinfo = vi;
4470 * Record a process's interest in events which might happen to
4471 * a vnode. Because poll uses the historic select-style interface
4472 * internally, this routine serves as both the ``check for any
4473 * pending events'' and the ``record my interest in future events''
4474 * functions. (These are done together, while the lock is held,
4475 * to avoid race conditions.)
4478 vn_pollrecord(struct vnode *vp, struct thread *td, int events)
4482 mtx_lock(&vp->v_pollinfo->vpi_lock);
4483 if (vp->v_pollinfo->vpi_revents & events) {
4485 * This leaves events we are not interested
4486 * in available for the other process which
4487 * which presumably had requested them
4488 * (otherwise they would never have been
4491 events &= vp->v_pollinfo->vpi_revents;
4492 vp->v_pollinfo->vpi_revents &= ~events;
4494 mtx_unlock(&vp->v_pollinfo->vpi_lock);
4497 vp->v_pollinfo->vpi_events |= events;
4498 selrecord(td, &vp->v_pollinfo->vpi_selinfo);
4499 mtx_unlock(&vp->v_pollinfo->vpi_lock);
4504 * Routine to create and manage a filesystem syncer vnode.
4506 #define sync_close ((int (*)(struct vop_close_args *))nullop)
4507 static int sync_fsync(struct vop_fsync_args *);
4508 static int sync_inactive(struct vop_inactive_args *);
4509 static int sync_reclaim(struct vop_reclaim_args *);
4511 static struct vop_vector sync_vnodeops = {
4512 .vop_bypass = VOP_EOPNOTSUPP,
4513 .vop_close = sync_close, /* close */
4514 .vop_fsync = sync_fsync, /* fsync */
4515 .vop_inactive = sync_inactive, /* inactive */
4516 .vop_need_inactive = vop_stdneed_inactive, /* need_inactive */
4517 .vop_reclaim = sync_reclaim, /* reclaim */
4518 .vop_lock1 = vop_stdlock, /* lock */
4519 .vop_unlock = vop_stdunlock, /* unlock */
4520 .vop_islocked = vop_stdislocked, /* islocked */
4524 * Create a new filesystem syncer vnode for the specified mount point.
4527 vfs_allocate_syncvnode(struct mount *mp)
4531 static long start, incr, next;
4534 /* Allocate a new vnode */
4535 error = getnewvnode("syncer", mp, &sync_vnodeops, &vp);
4537 panic("vfs_allocate_syncvnode: getnewvnode() failed");
4539 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
4540 vp->v_vflag |= VV_FORCEINSMQ;
4541 error = insmntque(vp, mp);
4543 panic("vfs_allocate_syncvnode: insmntque() failed");
4544 vp->v_vflag &= ~VV_FORCEINSMQ;
4547 * Place the vnode onto the syncer worklist. We attempt to
4548 * scatter them about on the list so that they will go off
4549 * at evenly distributed times even if all the filesystems
4550 * are mounted at once.
4553 if (next == 0 || next > syncer_maxdelay) {
4557 start = syncer_maxdelay / 2;
4558 incr = syncer_maxdelay;
4564 vn_syncer_add_to_worklist(bo, syncdelay > 0 ? next % syncdelay : 0);
4565 /* XXX - vn_syncer_add_to_worklist() also grabs and drops sync_mtx. */
4566 mtx_lock(&sync_mtx);
4568 if (mp->mnt_syncer == NULL) {
4569 mp->mnt_syncer = vp;
4572 mtx_unlock(&sync_mtx);
4575 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
4582 vfs_deallocate_syncvnode(struct mount *mp)
4586 mtx_lock(&sync_mtx);
4587 vp = mp->mnt_syncer;
4589 mp->mnt_syncer = NULL;
4590 mtx_unlock(&sync_mtx);
4596 * Do a lazy sync of the filesystem.
4599 sync_fsync(struct vop_fsync_args *ap)
4601 struct vnode *syncvp = ap->a_vp;
4602 struct mount *mp = syncvp->v_mount;
4607 * We only need to do something if this is a lazy evaluation.
4609 if (ap->a_waitfor != MNT_LAZY)
4613 * Move ourselves to the back of the sync list.
4615 bo = &syncvp->v_bufobj;
4617 vn_syncer_add_to_worklist(bo, syncdelay);
4621 * Walk the list of vnodes pushing all that are dirty and
4622 * not already on the sync list.
4624 if (vfs_busy(mp, MBF_NOWAIT) != 0)
4626 if (vn_start_write(NULL, &mp, V_NOWAIT) != 0) {
4630 save = curthread_pflags_set(TDP_SYNCIO);
4631 vfs_msync(mp, MNT_NOWAIT);
4632 error = VFS_SYNC(mp, MNT_LAZY);
4633 curthread_pflags_restore(save);
4634 vn_finished_write(mp);
4640 * The syncer vnode is no referenced.
4643 sync_inactive(struct vop_inactive_args *ap)
4651 * The syncer vnode is no longer needed and is being decommissioned.
4653 * Modifications to the worklist must be protected by sync_mtx.
4656 sync_reclaim(struct vop_reclaim_args *ap)
4658 struct vnode *vp = ap->a_vp;
4663 mtx_lock(&sync_mtx);
4664 if (vp->v_mount->mnt_syncer == vp)
4665 vp->v_mount->mnt_syncer = NULL;
4666 if (bo->bo_flag & BO_ONWORKLST) {
4667 LIST_REMOVE(bo, bo_synclist);
4668 syncer_worklist_len--;
4670 bo->bo_flag &= ~BO_ONWORKLST;
4672 mtx_unlock(&sync_mtx);
4679 vn_need_pageq_flush(struct vnode *vp)
4681 struct vm_object *obj;
4684 MPASS(mtx_owned(VI_MTX(vp)));
4686 if ((obj = vp->v_object) != NULL && (vp->v_vflag & VV_NOSYNC) == 0 &&
4687 (obj->flags & OBJ_MIGHTBEDIRTY) != 0)
4693 * Check if vnode represents a disk device
4696 vn_isdisk(struct vnode *vp, int *errp)
4700 if (vp->v_type != VCHR) {
4706 if (vp->v_rdev == NULL)
4708 else if (vp->v_rdev->si_devsw == NULL)
4710 else if (!(vp->v_rdev->si_devsw->d_flags & D_DISK))
4716 return (error == 0);
4720 * Common filesystem object access control check routine. Accepts a
4721 * vnode's type, "mode", uid and gid, requested access mode, credentials,
4722 * and optional call-by-reference privused argument allowing vaccess()
4723 * to indicate to the caller whether privilege was used to satisfy the
4724 * request (obsoleted). Returns 0 on success, or an errno on failure.
4727 vaccess(enum vtype type, mode_t file_mode, uid_t file_uid, gid_t file_gid,
4728 accmode_t accmode, struct ucred *cred, int *privused)
4730 accmode_t dac_granted;
4731 accmode_t priv_granted;
4733 KASSERT((accmode & ~(VEXEC | VWRITE | VREAD | VADMIN | VAPPEND)) == 0,
4734 ("invalid bit in accmode"));
4735 KASSERT((accmode & VAPPEND) == 0 || (accmode & VWRITE),
4736 ("VAPPEND without VWRITE"));
4739 * Look for a normal, non-privileged way to access the file/directory
4740 * as requested. If it exists, go with that.
4743 if (privused != NULL)
4748 /* Check the owner. */
4749 if (cred->cr_uid == file_uid) {
4750 dac_granted |= VADMIN;
4751 if (file_mode & S_IXUSR)
4752 dac_granted |= VEXEC;
4753 if (file_mode & S_IRUSR)
4754 dac_granted |= VREAD;
4755 if (file_mode & S_IWUSR)
4756 dac_granted |= (VWRITE | VAPPEND);
4758 if ((accmode & dac_granted) == accmode)
4764 /* Otherwise, check the groups (first match) */
4765 if (groupmember(file_gid, cred)) {
4766 if (file_mode & S_IXGRP)
4767 dac_granted |= VEXEC;
4768 if (file_mode & S_IRGRP)
4769 dac_granted |= VREAD;
4770 if (file_mode & S_IWGRP)
4771 dac_granted |= (VWRITE | VAPPEND);
4773 if ((accmode & dac_granted) == accmode)
4779 /* Otherwise, check everyone else. */
4780 if (file_mode & S_IXOTH)
4781 dac_granted |= VEXEC;
4782 if (file_mode & S_IROTH)
4783 dac_granted |= VREAD;
4784 if (file_mode & S_IWOTH)
4785 dac_granted |= (VWRITE | VAPPEND);
4786 if ((accmode & dac_granted) == accmode)
4791 * Build a privilege mask to determine if the set of privileges
4792 * satisfies the requirements when combined with the granted mask
4793 * from above. For each privilege, if the privilege is required,
4794 * bitwise or the request type onto the priv_granted mask.
4800 * For directories, use PRIV_VFS_LOOKUP to satisfy VEXEC
4801 * requests, instead of PRIV_VFS_EXEC.
4803 if ((accmode & VEXEC) && ((dac_granted & VEXEC) == 0) &&
4804 !priv_check_cred(cred, PRIV_VFS_LOOKUP))
4805 priv_granted |= VEXEC;
4808 * Ensure that at least one execute bit is on. Otherwise,
4809 * a privileged user will always succeed, and we don't want
4810 * this to happen unless the file really is executable.
4812 if ((accmode & VEXEC) && ((dac_granted & VEXEC) == 0) &&
4813 (file_mode & (S_IXUSR | S_IXGRP | S_IXOTH)) != 0 &&
4814 !priv_check_cred(cred, PRIV_VFS_EXEC))
4815 priv_granted |= VEXEC;
4818 if ((accmode & VREAD) && ((dac_granted & VREAD) == 0) &&
4819 !priv_check_cred(cred, PRIV_VFS_READ))
4820 priv_granted |= VREAD;
4822 if ((accmode & VWRITE) && ((dac_granted & VWRITE) == 0) &&
4823 !priv_check_cred(cred, PRIV_VFS_WRITE))
4824 priv_granted |= (VWRITE | VAPPEND);
4826 if ((accmode & VADMIN) && ((dac_granted & VADMIN) == 0) &&
4827 !priv_check_cred(cred, PRIV_VFS_ADMIN))
4828 priv_granted |= VADMIN;
4830 if ((accmode & (priv_granted | dac_granted)) == accmode) {
4831 /* XXX audit: privilege used */
4832 if (privused != NULL)
4837 return ((accmode & VADMIN) ? EPERM : EACCES);
4841 * Credential check based on process requesting service, and per-attribute
4845 extattr_check_cred(struct vnode *vp, int attrnamespace, struct ucred *cred,
4846 struct thread *td, accmode_t accmode)
4850 * Kernel-invoked always succeeds.
4856 * Do not allow privileged processes in jail to directly manipulate
4857 * system attributes.
4859 switch (attrnamespace) {
4860 case EXTATTR_NAMESPACE_SYSTEM:
4861 /* Potentially should be: return (EPERM); */
4862 return (priv_check_cred(cred, PRIV_VFS_EXTATTR_SYSTEM));
4863 case EXTATTR_NAMESPACE_USER:
4864 return (VOP_ACCESS(vp, accmode, cred, td));
4870 #ifdef DEBUG_VFS_LOCKS
4872 * This only exists to suppress warnings from unlocked specfs accesses. It is
4873 * no longer ok to have an unlocked VFS.
4875 #define IGNORE_LOCK(vp) (panicstr != NULL || (vp) == NULL || \
4876 (vp)->v_type == VCHR || (vp)->v_type == VBAD)
4878 int vfs_badlock_ddb = 1; /* Drop into debugger on violation. */
4879 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_ddb, CTLFLAG_RW, &vfs_badlock_ddb, 0,
4880 "Drop into debugger on lock violation");
4882 int vfs_badlock_mutex = 1; /* Check for interlock across VOPs. */
4883 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_mutex, CTLFLAG_RW, &vfs_badlock_mutex,
4884 0, "Check for interlock across VOPs");
4886 int vfs_badlock_print = 1; /* Print lock violations. */
4887 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_print, CTLFLAG_RW, &vfs_badlock_print,
4888 0, "Print lock violations");
4890 int vfs_badlock_vnode = 1; /* Print vnode details on lock violations. */
4891 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_vnode, CTLFLAG_RW, &vfs_badlock_vnode,
4892 0, "Print vnode details on lock violations");
4895 int vfs_badlock_backtrace = 1; /* Print backtrace at lock violations. */
4896 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_backtrace, CTLFLAG_RW,
4897 &vfs_badlock_backtrace, 0, "Print backtrace at lock violations");
4901 vfs_badlock(const char *msg, const char *str, struct vnode *vp)
4905 if (vfs_badlock_backtrace)
4908 if (vfs_badlock_vnode)
4909 vn_printf(vp, "vnode ");
4910 if (vfs_badlock_print)
4911 printf("%s: %p %s\n", str, (void *)vp, msg);
4912 if (vfs_badlock_ddb)
4913 kdb_enter(KDB_WHY_VFSLOCK, "lock violation");
4917 assert_vi_locked(struct vnode *vp, const char *str)
4920 if (vfs_badlock_mutex && !mtx_owned(VI_MTX(vp)))
4921 vfs_badlock("interlock is not locked but should be", str, vp);
4925 assert_vi_unlocked(struct vnode *vp, const char *str)
4928 if (vfs_badlock_mutex && mtx_owned(VI_MTX(vp)))
4929 vfs_badlock("interlock is locked but should not be", str, vp);
4933 assert_vop_locked(struct vnode *vp, const char *str)
4937 if (!IGNORE_LOCK(vp)) {
4938 locked = VOP_ISLOCKED(vp);
4939 if (locked == 0 || locked == LK_EXCLOTHER)
4940 vfs_badlock("is not locked but should be", str, vp);
4945 assert_vop_unlocked(struct vnode *vp, const char *str)
4948 if (!IGNORE_LOCK(vp) && VOP_ISLOCKED(vp) == LK_EXCLUSIVE)
4949 vfs_badlock("is locked but should not be", str, vp);
4953 assert_vop_elocked(struct vnode *vp, const char *str)
4956 if (!IGNORE_LOCK(vp) && VOP_ISLOCKED(vp) != LK_EXCLUSIVE)
4957 vfs_badlock("is not exclusive locked but should be", str, vp);
4959 #endif /* DEBUG_VFS_LOCKS */
4962 vop_rename_fail(struct vop_rename_args *ap)
4965 if (ap->a_tvp != NULL)
4967 if (ap->a_tdvp == ap->a_tvp)
4976 vop_rename_pre(void *ap)
4978 struct vop_rename_args *a = ap;
4980 #ifdef DEBUG_VFS_LOCKS
4982 ASSERT_VI_UNLOCKED(a->a_tvp, "VOP_RENAME");
4983 ASSERT_VI_UNLOCKED(a->a_tdvp, "VOP_RENAME");
4984 ASSERT_VI_UNLOCKED(a->a_fvp, "VOP_RENAME");
4985 ASSERT_VI_UNLOCKED(a->a_fdvp, "VOP_RENAME");
4987 /* Check the source (from). */
4988 if (a->a_tdvp->v_vnlock != a->a_fdvp->v_vnlock &&
4989 (a->a_tvp == NULL || a->a_tvp->v_vnlock != a->a_fdvp->v_vnlock))
4990 ASSERT_VOP_UNLOCKED(a->a_fdvp, "vop_rename: fdvp locked");
4991 if (a->a_tvp == NULL || a->a_tvp->v_vnlock != a->a_fvp->v_vnlock)
4992 ASSERT_VOP_UNLOCKED(a->a_fvp, "vop_rename: fvp locked");
4994 /* Check the target. */
4996 ASSERT_VOP_LOCKED(a->a_tvp, "vop_rename: tvp not locked");
4997 ASSERT_VOP_LOCKED(a->a_tdvp, "vop_rename: tdvp not locked");
4999 if (a->a_tdvp != a->a_fdvp)
5001 if (a->a_tvp != a->a_fvp)
5008 #ifdef DEBUG_VFS_LOCKS
5010 vop_strategy_pre(void *ap)
5012 struct vop_strategy_args *a;
5019 * Cluster ops lock their component buffers but not the IO container.
5021 if ((bp->b_flags & B_CLUSTER) != 0)
5024 if (panicstr == NULL && !BUF_ISLOCKED(bp)) {
5025 if (vfs_badlock_print)
5027 "VOP_STRATEGY: bp is not locked but should be\n");
5028 if (vfs_badlock_ddb)
5029 kdb_enter(KDB_WHY_VFSLOCK, "lock violation");
5034 vop_lock_pre(void *ap)
5036 struct vop_lock1_args *a = ap;
5038 if ((a->a_flags & LK_INTERLOCK) == 0)
5039 ASSERT_VI_UNLOCKED(a->a_vp, "VOP_LOCK");
5041 ASSERT_VI_LOCKED(a->a_vp, "VOP_LOCK");
5045 vop_lock_post(void *ap, int rc)
5047 struct vop_lock1_args *a = ap;
5049 ASSERT_VI_UNLOCKED(a->a_vp, "VOP_LOCK");
5050 if (rc == 0 && (a->a_flags & LK_EXCLOTHER) == 0)
5051 ASSERT_VOP_LOCKED(a->a_vp, "VOP_LOCK");
5055 vop_unlock_pre(void *ap)
5057 struct vop_unlock_args *a = ap;
5059 if (a->a_flags & LK_INTERLOCK)
5060 ASSERT_VI_LOCKED(a->a_vp, "VOP_UNLOCK");
5061 ASSERT_VOP_LOCKED(a->a_vp, "VOP_UNLOCK");
5065 vop_unlock_post(void *ap, int rc)
5067 struct vop_unlock_args *a = ap;
5069 if (a->a_flags & LK_INTERLOCK)
5070 ASSERT_VI_UNLOCKED(a->a_vp, "VOP_UNLOCK");
5074 vop_need_inactive_pre(void *ap)
5076 struct vop_need_inactive_args *a = ap;
5078 ASSERT_VI_LOCKED(a->a_vp, "VOP_NEED_INACTIVE");
5082 vop_need_inactive_post(void *ap, int rc)
5084 struct vop_need_inactive_args *a = ap;
5086 ASSERT_VI_LOCKED(a->a_vp, "VOP_NEED_INACTIVE");
5091 vop_create_post(void *ap, int rc)
5093 struct vop_create_args *a = ap;
5096 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
5100 vop_deleteextattr_post(void *ap, int rc)
5102 struct vop_deleteextattr_args *a = ap;
5105 VFS_KNOTE_LOCKED(a->a_vp, NOTE_ATTRIB);
5109 vop_link_post(void *ap, int rc)
5111 struct vop_link_args *a = ap;
5114 VFS_KNOTE_LOCKED(a->a_vp, NOTE_LINK);
5115 VFS_KNOTE_LOCKED(a->a_tdvp, NOTE_WRITE);
5120 vop_mkdir_post(void *ap, int rc)
5122 struct vop_mkdir_args *a = ap;
5125 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE | NOTE_LINK);
5129 vop_mknod_post(void *ap, int rc)
5131 struct vop_mknod_args *a = ap;
5134 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
5138 vop_reclaim_post(void *ap, int rc)
5140 struct vop_reclaim_args *a = ap;
5143 VFS_KNOTE_LOCKED(a->a_vp, NOTE_REVOKE);
5147 vop_remove_post(void *ap, int rc)
5149 struct vop_remove_args *a = ap;
5152 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
5153 VFS_KNOTE_LOCKED(a->a_vp, NOTE_DELETE);
5158 vop_rename_post(void *ap, int rc)
5160 struct vop_rename_args *a = ap;
5165 if (a->a_fdvp == a->a_tdvp) {
5166 if (a->a_tvp != NULL && a->a_tvp->v_type == VDIR)
5168 VFS_KNOTE_UNLOCKED(a->a_fdvp, hint);
5169 VFS_KNOTE_UNLOCKED(a->a_tdvp, hint);
5171 hint |= NOTE_EXTEND;
5172 if (a->a_fvp->v_type == VDIR)
5174 VFS_KNOTE_UNLOCKED(a->a_fdvp, hint);
5176 if (a->a_fvp->v_type == VDIR && a->a_tvp != NULL &&
5177 a->a_tvp->v_type == VDIR)
5179 VFS_KNOTE_UNLOCKED(a->a_tdvp, hint);
5182 VFS_KNOTE_UNLOCKED(a->a_fvp, NOTE_RENAME);
5184 VFS_KNOTE_UNLOCKED(a->a_tvp, NOTE_DELETE);
5186 if (a->a_tdvp != a->a_fdvp)
5188 if (a->a_tvp != a->a_fvp)
5196 vop_rmdir_post(void *ap, int rc)
5198 struct vop_rmdir_args *a = ap;
5201 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE | NOTE_LINK);
5202 VFS_KNOTE_LOCKED(a->a_vp, NOTE_DELETE);
5207 vop_setattr_post(void *ap, int rc)
5209 struct vop_setattr_args *a = ap;
5212 VFS_KNOTE_LOCKED(a->a_vp, NOTE_ATTRIB);
5216 vop_setextattr_post(void *ap, int rc)
5218 struct vop_setextattr_args *a = ap;
5221 VFS_KNOTE_LOCKED(a->a_vp, NOTE_ATTRIB);
5225 vop_symlink_post(void *ap, int rc)
5227 struct vop_symlink_args *a = ap;
5230 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
5234 vop_open_post(void *ap, int rc)
5236 struct vop_open_args *a = ap;
5239 VFS_KNOTE_LOCKED(a->a_vp, NOTE_OPEN);
5243 vop_close_post(void *ap, int rc)
5245 struct vop_close_args *a = ap;
5247 if (!rc && (a->a_cred != NOCRED || /* filter out revokes */
5248 (a->a_vp->v_iflag & VI_DOOMED) == 0)) {
5249 VFS_KNOTE_LOCKED(a->a_vp, (a->a_fflag & FWRITE) != 0 ?
5250 NOTE_CLOSE_WRITE : NOTE_CLOSE);
5255 vop_read_post(void *ap, int rc)
5257 struct vop_read_args *a = ap;
5260 VFS_KNOTE_LOCKED(a->a_vp, NOTE_READ);
5264 vop_readdir_post(void *ap, int rc)
5266 struct vop_readdir_args *a = ap;
5269 VFS_KNOTE_LOCKED(a->a_vp, NOTE_READ);
5272 static struct knlist fs_knlist;
5275 vfs_event_init(void *arg)
5277 knlist_init_mtx(&fs_knlist, NULL);
5279 /* XXX - correct order? */
5280 SYSINIT(vfs_knlist, SI_SUB_VFS, SI_ORDER_ANY, vfs_event_init, NULL);
5283 vfs_event_signal(fsid_t *fsid, uint32_t event, intptr_t data __unused)
5286 KNOTE_UNLOCKED(&fs_knlist, event);
5289 static int filt_fsattach(struct knote *kn);
5290 static void filt_fsdetach(struct knote *kn);
5291 static int filt_fsevent(struct knote *kn, long hint);
5293 struct filterops fs_filtops = {
5295 .f_attach = filt_fsattach,
5296 .f_detach = filt_fsdetach,
5297 .f_event = filt_fsevent
5301 filt_fsattach(struct knote *kn)
5304 kn->kn_flags |= EV_CLEAR;
5305 knlist_add(&fs_knlist, kn, 0);
5310 filt_fsdetach(struct knote *kn)
5313 knlist_remove(&fs_knlist, kn, 0);
5317 filt_fsevent(struct knote *kn, long hint)
5320 kn->kn_fflags |= hint;
5321 return (kn->kn_fflags != 0);
5325 sysctl_vfs_ctl(SYSCTL_HANDLER_ARGS)
5331 error = SYSCTL_IN(req, &vc, sizeof(vc));
5334 if (vc.vc_vers != VFS_CTL_VERS1)
5336 mp = vfs_getvfs(&vc.vc_fsid);
5339 /* ensure that a specific sysctl goes to the right filesystem. */
5340 if (strcmp(vc.vc_fstypename, "*") != 0 &&
5341 strcmp(vc.vc_fstypename, mp->mnt_vfc->vfc_name) != 0) {
5345 VCTLTOREQ(&vc, req);
5346 error = VFS_SYSCTL(mp, vc.vc_op, req);
5351 SYSCTL_PROC(_vfs, OID_AUTO, ctl, CTLTYPE_OPAQUE | CTLFLAG_WR,
5352 NULL, 0, sysctl_vfs_ctl, "",
5356 * Function to initialize a va_filerev field sensibly.
5357 * XXX: Wouldn't a random number make a lot more sense ??
5360 init_va_filerev(void)
5365 return (((u_quad_t)bt.sec << 32LL) | (bt.frac >> 32LL));
5368 static int filt_vfsread(struct knote *kn, long hint);
5369 static int filt_vfswrite(struct knote *kn, long hint);
5370 static int filt_vfsvnode(struct knote *kn, long hint);
5371 static void filt_vfsdetach(struct knote *kn);
5372 static struct filterops vfsread_filtops = {
5374 .f_detach = filt_vfsdetach,
5375 .f_event = filt_vfsread
5377 static struct filterops vfswrite_filtops = {
5379 .f_detach = filt_vfsdetach,
5380 .f_event = filt_vfswrite
5382 static struct filterops vfsvnode_filtops = {
5384 .f_detach = filt_vfsdetach,
5385 .f_event = filt_vfsvnode
5389 vfs_knllock(void *arg)
5391 struct vnode *vp = arg;
5393 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
5397 vfs_knlunlock(void *arg)
5399 struct vnode *vp = arg;
5405 vfs_knl_assert_locked(void *arg)
5407 #ifdef DEBUG_VFS_LOCKS
5408 struct vnode *vp = arg;
5410 ASSERT_VOP_LOCKED(vp, "vfs_knl_assert_locked");
5415 vfs_knl_assert_unlocked(void *arg)
5417 #ifdef DEBUG_VFS_LOCKS
5418 struct vnode *vp = arg;
5420 ASSERT_VOP_UNLOCKED(vp, "vfs_knl_assert_unlocked");
5425 vfs_kqfilter(struct vop_kqfilter_args *ap)
5427 struct vnode *vp = ap->a_vp;
5428 struct knote *kn = ap->a_kn;
5431 switch (kn->kn_filter) {
5433 kn->kn_fop = &vfsread_filtops;
5436 kn->kn_fop = &vfswrite_filtops;
5439 kn->kn_fop = &vfsvnode_filtops;
5445 kn->kn_hook = (caddr_t)vp;
5448 if (vp->v_pollinfo == NULL)
5450 knl = &vp->v_pollinfo->vpi_selinfo.si_note;
5452 knlist_add(knl, kn, 0);
5458 * Detach knote from vnode
5461 filt_vfsdetach(struct knote *kn)
5463 struct vnode *vp = (struct vnode *)kn->kn_hook;
5465 KASSERT(vp->v_pollinfo != NULL, ("Missing v_pollinfo"));
5466 knlist_remove(&vp->v_pollinfo->vpi_selinfo.si_note, kn, 0);
5472 filt_vfsread(struct knote *kn, long hint)
5474 struct vnode *vp = (struct vnode *)kn->kn_hook;
5479 * filesystem is gone, so set the EOF flag and schedule
5480 * the knote for deletion.
5482 if (hint == NOTE_REVOKE || (hint == 0 && vp->v_type == VBAD)) {
5484 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
5489 if (VOP_GETATTR(vp, &va, curthread->td_ucred))
5493 kn->kn_data = va.va_size - kn->kn_fp->f_offset;
5494 res = (kn->kn_sfflags & NOTE_FILE_POLL) != 0 || kn->kn_data != 0;
5501 filt_vfswrite(struct knote *kn, long hint)
5503 struct vnode *vp = (struct vnode *)kn->kn_hook;
5508 * filesystem is gone, so set the EOF flag and schedule
5509 * the knote for deletion.
5511 if (hint == NOTE_REVOKE || (hint == 0 && vp->v_type == VBAD))
5512 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
5520 filt_vfsvnode(struct knote *kn, long hint)
5522 struct vnode *vp = (struct vnode *)kn->kn_hook;
5526 if (kn->kn_sfflags & hint)
5527 kn->kn_fflags |= hint;
5528 if (hint == NOTE_REVOKE || (hint == 0 && vp->v_type == VBAD)) {
5529 kn->kn_flags |= EV_EOF;
5533 res = (kn->kn_fflags != 0);
5539 * Returns whether the directory is empty or not.
5540 * If it is empty, the return value is 0; otherwise
5541 * the return value is an error value (which may
5545 vfs_emptydir(struct vnode *vp)
5549 struct dirent *dirent, *dp, *endp;
5555 ASSERT_VOP_LOCKED(vp, "vfs_emptydir");
5557 dirent = malloc(sizeof(struct dirent), M_TEMP, M_WAITOK);
5558 iov.iov_base = dirent;
5559 iov.iov_len = sizeof(struct dirent);
5564 uio.uio_resid = sizeof(struct dirent);
5565 uio.uio_segflg = UIO_SYSSPACE;
5566 uio.uio_rw = UIO_READ;
5567 uio.uio_td = curthread;
5569 while (eof == 0 && error == 0) {
5570 error = VOP_READDIR(vp, &uio, curthread->td_ucred, &eof,
5574 endp = (void *)((uint8_t *)dirent +
5575 sizeof(struct dirent) - uio.uio_resid);
5576 for (dp = dirent; dp < endp;
5577 dp = (void *)((uint8_t *)dp + GENERIC_DIRSIZ(dp))) {
5578 if (dp->d_type == DT_WHT)
5580 if (dp->d_namlen == 0)
5582 if (dp->d_type != DT_DIR &&
5583 dp->d_type != DT_UNKNOWN) {
5587 if (dp->d_namlen > 2) {
5591 if (dp->d_namlen == 1 &&
5592 dp->d_name[0] != '.') {
5596 if (dp->d_namlen == 2 &&
5597 dp->d_name[1] != '.') {
5601 uio.uio_resid = sizeof(struct dirent);
5604 free(dirent, M_TEMP);
5609 vfs_read_dirent(struct vop_readdir_args *ap, struct dirent *dp, off_t off)
5613 if (dp->d_reclen > ap->a_uio->uio_resid)
5614 return (ENAMETOOLONG);
5615 error = uiomove(dp, dp->d_reclen, ap->a_uio);
5617 if (ap->a_ncookies != NULL) {
5618 if (ap->a_cookies != NULL)
5619 free(ap->a_cookies, M_TEMP);
5620 ap->a_cookies = NULL;
5621 *ap->a_ncookies = 0;
5625 if (ap->a_ncookies == NULL)
5628 KASSERT(ap->a_cookies,
5629 ("NULL ap->a_cookies value with non-NULL ap->a_ncookies!"));
5631 *ap->a_cookies = realloc(*ap->a_cookies,
5632 (*ap->a_ncookies + 1) * sizeof(u_long), M_TEMP, M_WAITOK | M_ZERO);
5633 (*ap->a_cookies)[*ap->a_ncookies] = off;
5634 *ap->a_ncookies += 1;
5639 * Mark for update the access time of the file if the filesystem
5640 * supports VOP_MARKATIME. This functionality is used by execve and
5641 * mmap, so we want to avoid the I/O implied by directly setting
5642 * va_atime for the sake of efficiency.
5645 vfs_mark_atime(struct vnode *vp, struct ucred *cred)
5650 ASSERT_VOP_LOCKED(vp, "vfs_mark_atime");
5651 if (mp != NULL && (mp->mnt_flag & (MNT_NOATIME | MNT_RDONLY)) == 0)
5652 (void)VOP_MARKATIME(vp);
5656 * The purpose of this routine is to remove granularity from accmode_t,
5657 * reducing it into standard unix access bits - VEXEC, VREAD, VWRITE,
5658 * VADMIN and VAPPEND.
5660 * If it returns 0, the caller is supposed to continue with the usual
5661 * access checks using 'accmode' as modified by this routine. If it
5662 * returns nonzero value, the caller is supposed to return that value
5665 * Note that after this routine runs, accmode may be zero.
5668 vfs_unixify_accmode(accmode_t *accmode)
5671 * There is no way to specify explicit "deny" rule using
5672 * file mode or POSIX.1e ACLs.
5674 if (*accmode & VEXPLICIT_DENY) {
5680 * None of these can be translated into usual access bits.
5681 * Also, the common case for NFSv4 ACLs is to not contain
5682 * either of these bits. Caller should check for VWRITE
5683 * on the containing directory instead.
5685 if (*accmode & (VDELETE_CHILD | VDELETE))
5688 if (*accmode & VADMIN_PERMS) {
5689 *accmode &= ~VADMIN_PERMS;
5694 * There is no way to deny VREAD_ATTRIBUTES, VREAD_ACL
5695 * or VSYNCHRONIZE using file mode or POSIX.1e ACL.
5697 *accmode &= ~(VSTAT_PERMS | VSYNCHRONIZE);
5703 * These are helper functions for filesystems to traverse all
5704 * their vnodes. See MNT_VNODE_FOREACH_ALL() in sys/mount.h.
5706 * This interface replaces MNT_VNODE_FOREACH.
5709 MALLOC_DEFINE(M_VNODE_MARKER, "vnodemarker", "vnode marker");
5712 __mnt_vnode_next_all(struct vnode **mvp, struct mount *mp)
5717 kern_yield(PRI_USER);
5719 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
5720 for (vp = TAILQ_NEXT(*mvp, v_nmntvnodes); vp != NULL;
5721 vp = TAILQ_NEXT(vp, v_nmntvnodes)) {
5722 /* Allow a racy peek at VI_DOOMED to save a lock acquisition. */
5723 if (vp->v_type == VMARKER || (vp->v_iflag & VI_DOOMED) != 0)
5726 if ((vp->v_iflag & VI_DOOMED) != 0) {
5733 __mnt_vnode_markerfree_all(mvp, mp);
5734 /* MNT_IUNLOCK(mp); -- done in above function */
5735 mtx_assert(MNT_MTX(mp), MA_NOTOWNED);
5738 TAILQ_REMOVE(&mp->mnt_nvnodelist, *mvp, v_nmntvnodes);
5739 TAILQ_INSERT_AFTER(&mp->mnt_nvnodelist, vp, *mvp, v_nmntvnodes);
5745 __mnt_vnode_first_all(struct vnode **mvp, struct mount *mp)
5749 *mvp = malloc(sizeof(struct vnode), M_VNODE_MARKER, M_WAITOK | M_ZERO);
5752 (*mvp)->v_mount = mp;
5753 (*mvp)->v_type = VMARKER;
5755 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
5756 /* Allow a racy peek at VI_DOOMED to save a lock acquisition. */
5757 if (vp->v_type == VMARKER || (vp->v_iflag & VI_DOOMED) != 0)
5760 if ((vp->v_iflag & VI_DOOMED) != 0) {
5769 free(*mvp, M_VNODE_MARKER);
5773 TAILQ_INSERT_AFTER(&mp->mnt_nvnodelist, vp, *mvp, v_nmntvnodes);
5779 __mnt_vnode_markerfree_all(struct vnode **mvp, struct mount *mp)
5787 mtx_assert(MNT_MTX(mp), MA_OWNED);
5789 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
5790 TAILQ_REMOVE(&mp->mnt_nvnodelist, *mvp, v_nmntvnodes);
5793 free(*mvp, M_VNODE_MARKER);
5798 * These are helper functions for filesystems to traverse their
5799 * active vnodes. See MNT_VNODE_FOREACH_ACTIVE() in sys/mount.h
5802 mnt_vnode_markerfree_active(struct vnode **mvp, struct mount *mp)
5805 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
5810 free(*mvp, M_VNODE_MARKER);
5815 * Relock the mp mount vnode list lock with the vp vnode interlock in the
5816 * conventional lock order during mnt_vnode_next_active iteration.
5818 * On entry, the mount vnode list lock is held and the vnode interlock is not.
5819 * The list lock is dropped and reacquired. On success, both locks are held.
5820 * On failure, the mount vnode list lock is held but the vnode interlock is
5821 * not, and the procedure may have yielded.
5824 mnt_vnode_next_active_relock(struct vnode *mvp, struct mount *mp,
5827 const struct vnode *tmp;
5830 VNASSERT(mvp->v_mount == mp && mvp->v_type == VMARKER &&
5831 TAILQ_NEXT(mvp, v_actfreelist) != NULL, mvp,
5832 ("%s: bad marker", __func__));
5833 VNASSERT(vp->v_mount == mp && vp->v_type != VMARKER, vp,
5834 ("%s: inappropriate vnode", __func__));
5835 ASSERT_VI_UNLOCKED(vp, __func__);
5836 mtx_assert(&mp->mnt_listmtx, MA_OWNED);
5840 TAILQ_REMOVE(&mp->mnt_activevnodelist, mvp, v_actfreelist);
5841 TAILQ_INSERT_BEFORE(vp, mvp, v_actfreelist);
5844 * Use a hold to prevent vp from disappearing while the mount vnode
5845 * list lock is dropped and reacquired. Normally a hold would be
5846 * acquired with vhold(), but that might try to acquire the vnode
5847 * interlock, which would be a LOR with the mount vnode list lock.
5849 held = refcount_acquire_if_not_zero(&vp->v_holdcnt);
5850 mtx_unlock(&mp->mnt_listmtx);
5854 if (!refcount_release_if_not_last(&vp->v_holdcnt)) {
5858 mtx_lock(&mp->mnt_listmtx);
5861 * Determine whether the vnode is still the next one after the marker,
5862 * excepting any other markers. If the vnode has not been doomed by
5863 * vgone() then the hold should have ensured that it remained on the
5864 * active list. If it has been doomed but is still on the active list,
5865 * don't abort, but rather skip over it (avoid spinning on doomed
5870 tmp = TAILQ_NEXT(tmp, v_actfreelist);
5871 } while (tmp != NULL && tmp->v_type == VMARKER);
5873 mtx_unlock(&mp->mnt_listmtx);
5882 mtx_lock(&mp->mnt_listmtx);
5885 ASSERT_VI_LOCKED(vp, __func__);
5887 ASSERT_VI_UNLOCKED(vp, __func__);
5888 mtx_assert(&mp->mnt_listmtx, MA_OWNED);
5892 static struct vnode *
5893 mnt_vnode_next_active(struct vnode **mvp, struct mount *mp)
5895 struct vnode *vp, *nvp;
5897 mtx_assert(&mp->mnt_listmtx, MA_OWNED);
5898 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
5900 vp = TAILQ_NEXT(*mvp, v_actfreelist);
5901 while (vp != NULL) {
5902 if (vp->v_type == VMARKER) {
5903 vp = TAILQ_NEXT(vp, v_actfreelist);
5907 * Try-lock because this is the wrong lock order. If that does
5908 * not succeed, drop the mount vnode list lock and try to
5909 * reacquire it and the vnode interlock in the right order.
5911 if (!VI_TRYLOCK(vp) &&
5912 !mnt_vnode_next_active_relock(*mvp, mp, vp))
5914 KASSERT(vp->v_type != VMARKER, ("locked marker %p", vp));
5915 KASSERT(vp->v_mount == mp || vp->v_mount == NULL,
5916 ("alien vnode on the active list %p %p", vp, mp));
5917 if (vp->v_mount == mp && (vp->v_iflag & VI_DOOMED) == 0)
5919 nvp = TAILQ_NEXT(vp, v_actfreelist);
5923 TAILQ_REMOVE(&mp->mnt_activevnodelist, *mvp, v_actfreelist);
5925 /* Check if we are done */
5927 mtx_unlock(&mp->mnt_listmtx);
5928 mnt_vnode_markerfree_active(mvp, mp);
5931 TAILQ_INSERT_AFTER(&mp->mnt_activevnodelist, vp, *mvp, v_actfreelist);
5932 mtx_unlock(&mp->mnt_listmtx);
5933 ASSERT_VI_LOCKED(vp, "active iter");
5934 KASSERT((vp->v_iflag & VI_ACTIVE) != 0, ("Non-active vp %p", vp));
5939 __mnt_vnode_next_active(struct vnode **mvp, struct mount *mp)
5943 kern_yield(PRI_USER);
5944 mtx_lock(&mp->mnt_listmtx);
5945 return (mnt_vnode_next_active(mvp, mp));
5949 __mnt_vnode_first_active(struct vnode **mvp, struct mount *mp)
5953 *mvp = malloc(sizeof(struct vnode), M_VNODE_MARKER, M_WAITOK | M_ZERO);
5957 (*mvp)->v_type = VMARKER;
5958 (*mvp)->v_mount = mp;
5960 mtx_lock(&mp->mnt_listmtx);
5961 vp = TAILQ_FIRST(&mp->mnt_activevnodelist);
5963 mtx_unlock(&mp->mnt_listmtx);
5964 mnt_vnode_markerfree_active(mvp, mp);
5967 TAILQ_INSERT_BEFORE(vp, *mvp, v_actfreelist);
5968 return (mnt_vnode_next_active(mvp, mp));
5972 __mnt_vnode_markerfree_active(struct vnode **mvp, struct mount *mp)
5978 mtx_lock(&mp->mnt_listmtx);
5979 TAILQ_REMOVE(&mp->mnt_activevnodelist, *mvp, v_actfreelist);
5980 mtx_unlock(&mp->mnt_listmtx);
5981 mnt_vnode_markerfree_active(mvp, mp);