2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 * (c) UNIX System Laboratories, Inc.
5 * All or some portions of this file are derived from material licensed
6 * to the University of California by American Telephone and Telegraph
7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
8 * the permission of UNIX System Laboratories, Inc.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * @(#)vfs_subr.c 8.31 (Berkeley) 5/26/95
38 * External virtual filesystem routines
41 #include <sys/cdefs.h>
42 __FBSDID("$FreeBSD$");
44 #include "opt_compat.h"
46 #include "opt_watchdog.h"
48 #include <sys/param.h>
49 #include <sys/systm.h>
52 #include <sys/condvar.h>
54 #include <sys/dirent.h>
55 #include <sys/event.h>
56 #include <sys/eventhandler.h>
57 #include <sys/extattr.h>
59 #include <sys/fcntl.h>
62 #include <sys/kernel.h>
63 #include <sys/kthread.h>
64 #include <sys/lockf.h>
65 #include <sys/malloc.h>
66 #include <sys/mount.h>
67 #include <sys/namei.h>
69 #include <sys/reboot.h>
70 #include <sys/sched.h>
71 #include <sys/sleepqueue.h>
73 #include <sys/sysctl.h>
74 #include <sys/syslog.h>
75 #include <sys/vmmeter.h>
76 #include <sys/vnode.h>
77 #include <sys/watchdog.h>
79 #include <machine/stdarg.h>
81 #include <security/mac/mac_framework.h>
84 #include <vm/vm_object.h>
85 #include <vm/vm_extern.h>
87 #include <vm/vm_map.h>
88 #include <vm/vm_page.h>
89 #include <vm/vm_kern.h>
99 static void delmntque(struct vnode *vp);
100 static int flushbuflist(struct bufv *bufv, int flags, struct bufobj *bo,
101 int slpflag, int slptimeo);
102 static void syncer_shutdown(void *arg, int howto);
103 static int vtryrecycle(struct vnode *vp);
104 static void v_incr_usecount(struct vnode *);
105 static void v_decr_usecount(struct vnode *);
106 static void v_decr_useonly(struct vnode *);
107 static void v_upgrade_usecount(struct vnode *);
108 static void vnlru_free(int);
109 static void vgonel(struct vnode *);
110 static void vfs_knllock(void *arg);
111 static void vfs_knlunlock(void *arg);
112 static void vfs_knl_assert_locked(void *arg);
113 static void vfs_knl_assert_unlocked(void *arg);
114 static void destroy_vpollinfo(struct vpollinfo *vi);
117 * Number of vnodes in existence. Increased whenever getnewvnode()
118 * allocates a new vnode, decreased in vdropl() for VI_DOOMED vnode.
120 static unsigned long numvnodes;
122 SYSCTL_ULONG(_vfs, OID_AUTO, numvnodes, CTLFLAG_RD, &numvnodes, 0,
123 "Number of vnodes in existence");
126 * Conversion tables for conversion from vnode types to inode formats
129 enum vtype iftovt_tab[16] = {
130 VNON, VFIFO, VCHR, VNON, VDIR, VNON, VBLK, VNON,
131 VREG, VNON, VLNK, VNON, VSOCK, VNON, VNON, VBAD,
133 int vttoif_tab[10] = {
134 0, S_IFREG, S_IFDIR, S_IFBLK, S_IFCHR, S_IFLNK,
135 S_IFSOCK, S_IFIFO, S_IFMT, S_IFMT
139 * List of vnodes that are ready for recycling.
141 static TAILQ_HEAD(freelst, vnode) vnode_free_list;
144 * Free vnode target. Free vnodes may simply be files which have been stat'd
145 * but not read. This is somewhat common, and a small cache of such files
146 * should be kept to avoid recreation costs.
148 static u_long wantfreevnodes;
149 SYSCTL_ULONG(_vfs, OID_AUTO, wantfreevnodes, CTLFLAG_RW, &wantfreevnodes, 0, "");
150 /* Number of vnodes in the free list. */
151 static u_long freevnodes;
152 SYSCTL_ULONG(_vfs, OID_AUTO, freevnodes, CTLFLAG_RD, &freevnodes, 0,
153 "Number of vnodes in the free list");
155 static int vlru_allow_cache_src;
156 SYSCTL_INT(_vfs, OID_AUTO, vlru_allow_cache_src, CTLFLAG_RW,
157 &vlru_allow_cache_src, 0, "Allow vlru to reclaim source vnode");
160 * Various variables used for debugging the new implementation of
162 * XXX these are probably of (very) limited utility now.
164 static int reassignbufcalls;
165 SYSCTL_INT(_vfs, OID_AUTO, reassignbufcalls, CTLFLAG_RW, &reassignbufcalls, 0,
166 "Number of calls to reassignbuf");
169 * Cache for the mount type id assigned to NFS. This is used for
170 * special checks in nfs/nfs_nqlease.c and vm/vnode_pager.c.
172 int nfs_mount_type = -1;
174 /* To keep more than one thread at a time from running vfs_getnewfsid */
175 static struct mtx mntid_mtx;
178 * Lock for any access to the following:
183 static struct mtx vnode_free_list_mtx;
185 /* Publicly exported FS */
186 struct nfs_public nfs_pub;
188 /* Zone for allocation of new vnodes - used exclusively by getnewvnode() */
189 static uma_zone_t vnode_zone;
190 static uma_zone_t vnodepoll_zone;
193 * The workitem queue.
195 * It is useful to delay writes of file data and filesystem metadata
196 * for tens of seconds so that quickly created and deleted files need
197 * not waste disk bandwidth being created and removed. To realize this,
198 * we append vnodes to a "workitem" queue. When running with a soft
199 * updates implementation, most pending metadata dependencies should
200 * not wait for more than a few seconds. Thus, mounted on block devices
201 * are delayed only about a half the time that file data is delayed.
202 * Similarly, directory updates are more critical, so are only delayed
203 * about a third the time that file data is delayed. Thus, there are
204 * SYNCER_MAXDELAY queues that are processed round-robin at a rate of
205 * one each second (driven off the filesystem syncer process). The
206 * syncer_delayno variable indicates the next queue that is to be processed.
207 * Items that need to be processed soon are placed in this queue:
209 * syncer_workitem_pending[syncer_delayno]
211 * A delay of fifteen seconds is done by placing the request fifteen
212 * entries later in the queue:
214 * syncer_workitem_pending[(syncer_delayno + 15) & syncer_mask]
217 static int syncer_delayno;
218 static long syncer_mask;
219 LIST_HEAD(synclist, bufobj);
220 static struct synclist *syncer_workitem_pending[2];
222 * The sync_mtx protects:
227 * syncer_workitem_pending
228 * syncer_worklist_len
231 static struct mtx sync_mtx;
232 static struct cv sync_wakeup;
234 #define SYNCER_MAXDELAY 32
235 static int syncer_maxdelay = SYNCER_MAXDELAY; /* maximum delay time */
236 static int syncdelay = 30; /* max time to delay syncing data */
237 static int filedelay = 30; /* time to delay syncing files */
238 SYSCTL_INT(_kern, OID_AUTO, filedelay, CTLFLAG_RW, &filedelay, 0,
239 "Time to delay syncing files (in seconds)");
240 static int dirdelay = 29; /* time to delay syncing directories */
241 SYSCTL_INT(_kern, OID_AUTO, dirdelay, CTLFLAG_RW, &dirdelay, 0,
242 "Time to delay syncing directories (in seconds)");
243 static int metadelay = 28; /* time to delay syncing metadata */
244 SYSCTL_INT(_kern, OID_AUTO, metadelay, CTLFLAG_RW, &metadelay, 0,
245 "Time to delay syncing metadata (in seconds)");
246 static int rushjob; /* number of slots to run ASAP */
247 static int stat_rush_requests; /* number of times I/O speeded up */
248 SYSCTL_INT(_debug, OID_AUTO, rush_requests, CTLFLAG_RW, &stat_rush_requests, 0,
249 "Number of times I/O speeded up (rush requests)");
252 * When shutting down the syncer, run it at four times normal speed.
254 #define SYNCER_SHUTDOWN_SPEEDUP 4
255 static int sync_vnode_count;
256 static int syncer_worklist_len;
257 static enum { SYNCER_RUNNING, SYNCER_SHUTTING_DOWN, SYNCER_FINAL_DELAY }
261 * Number of vnodes we want to exist at any one time. This is mostly used
262 * to size hash tables in vnode-related code. It is normally not used in
263 * getnewvnode(), as wantfreevnodes is normally nonzero.)
265 * XXX desiredvnodes is historical cruft and should not exist.
268 SYSCTL_INT(_kern, KERN_MAXVNODES, maxvnodes, CTLFLAG_RW,
269 &desiredvnodes, 0, "Maximum number of vnodes");
270 SYSCTL_ULONG(_kern, OID_AUTO, minvnodes, CTLFLAG_RW,
271 &wantfreevnodes, 0, "Minimum number of vnodes (legacy)");
272 static int vnlru_nowhere;
273 SYSCTL_INT(_debug, OID_AUTO, vnlru_nowhere, CTLFLAG_RW,
274 &vnlru_nowhere, 0, "Number of times the vnlru process ran without success");
277 * Macros to control when a vnode is freed and recycled. All require
278 * the vnode interlock.
280 #define VCANRECYCLE(vp) (((vp)->v_iflag & VI_FREE) && !(vp)->v_holdcnt)
281 #define VSHOULDFREE(vp) (!((vp)->v_iflag & VI_FREE) && !(vp)->v_holdcnt)
282 #define VSHOULDBUSY(vp) (((vp)->v_iflag & VI_FREE) && (vp)->v_holdcnt)
286 * Initialize the vnode management data structures.
288 * Reevaluate the following cap on the number of vnodes after the physical
289 * memory size exceeds 512GB. In the limit, as the physical memory size
290 * grows, the ratio of physical pages to vnodes approaches sixteen to one.
292 #ifndef MAXVNODES_MAX
293 #define MAXVNODES_MAX (512 * (1024 * 1024 * 1024 / (int)PAGE_SIZE / 16))
296 vntblinit(void *dummy __unused)
298 int physvnodes, virtvnodes;
301 * Desiredvnodes is a function of the physical memory size and the
302 * kernel's heap size. Generally speaking, it scales with the
303 * physical memory size. The ratio of desiredvnodes to physical pages
304 * is one to four until desiredvnodes exceeds 98,304. Thereafter, the
305 * marginal ratio of desiredvnodes to physical pages is one to
306 * sixteen. However, desiredvnodes is limited by the kernel's heap
307 * size. The memory required by desiredvnodes vnodes and vm objects
308 * may not exceed one seventh of the kernel's heap size.
310 physvnodes = maxproc + cnt.v_page_count / 16 + 3 * min(98304 * 4,
311 cnt.v_page_count) / 16;
312 virtvnodes = vm_kmem_size / (7 * (sizeof(struct vm_object) +
313 sizeof(struct vnode)));
314 desiredvnodes = min(physvnodes, virtvnodes);
315 if (desiredvnodes > MAXVNODES_MAX) {
317 printf("Reducing kern.maxvnodes %d -> %d\n",
318 desiredvnodes, MAXVNODES_MAX);
319 desiredvnodes = MAXVNODES_MAX;
321 wantfreevnodes = desiredvnodes / 4;
322 mtx_init(&mntid_mtx, "mntid", NULL, MTX_DEF);
323 TAILQ_INIT(&vnode_free_list);
324 mtx_init(&vnode_free_list_mtx, "vnode_free_list", NULL, MTX_DEF);
325 vnode_zone = uma_zcreate("VNODE", sizeof (struct vnode), NULL, NULL,
326 NULL, NULL, UMA_ALIGN_PTR, 0);
327 vnodepoll_zone = uma_zcreate("VNODEPOLL", sizeof (struct vpollinfo),
328 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
330 * Initialize the filesystem syncer.
332 syncer_workitem_pending[WI_MPSAFEQ] = hashinit(syncer_maxdelay, M_VNODE,
334 syncer_workitem_pending[WI_GIANTQ] = hashinit(syncer_maxdelay, M_VNODE,
336 syncer_maxdelay = syncer_mask + 1;
337 mtx_init(&sync_mtx, "Syncer mtx", NULL, MTX_DEF);
338 cv_init(&sync_wakeup, "syncer");
340 SYSINIT(vfs, SI_SUB_VFS, SI_ORDER_FIRST, vntblinit, NULL);
344 * Mark a mount point as busy. Used to synchronize access and to delay
345 * unmounting. Eventually, mountlist_mtx is not released on failure.
347 * vfs_busy() is a custom lock, it can block the caller.
348 * vfs_busy() only sleeps if the unmount is active on the mount point.
349 * For a mountpoint mp, vfs_busy-enforced lock is before lock of any
350 * vnode belonging to mp.
352 * Lookup uses vfs_busy() to traverse mount points.
354 * / vnode lock A / vnode lock (/var) D
355 * /var vnode lock B /log vnode lock(/var/log) E
356 * vfs_busy lock C vfs_busy lock F
358 * Within each file system, the lock order is C->A->B and F->D->E.
360 * When traversing across mounts, the system follows that lock order:
366 * The lookup() process for namei("/var") illustrates the process:
367 * VOP_LOOKUP() obtains B while A is held
368 * vfs_busy() obtains a shared lock on F while A and B are held
369 * vput() releases lock on B
370 * vput() releases lock on A
371 * VFS_ROOT() obtains lock on D while shared lock on F is held
372 * vfs_unbusy() releases shared lock on F
373 * vn_lock() obtains lock on deadfs vnode vp_crossmp instead of A.
374 * Attempt to lock A (instead of vp_crossmp) while D is held would
375 * violate the global order, causing deadlocks.
377 * dounmount() locks B while F is drained.
380 vfs_busy(struct mount *mp, int flags)
383 MPASS((flags & ~MBF_MASK) == 0);
384 CTR3(KTR_VFS, "%s: mp %p with flags %d", __func__, mp, flags);
389 * If mount point is currenly being unmounted, sleep until the
390 * mount point fate is decided. If thread doing the unmounting fails,
391 * it will clear MNTK_UNMOUNT flag before waking us up, indicating
392 * that this mount point has survived the unmount attempt and vfs_busy
393 * should retry. Otherwise the unmounter thread will set MNTK_REFEXPIRE
394 * flag in addition to MNTK_UNMOUNT, indicating that mount point is
395 * about to be really destroyed. vfs_busy needs to release its
396 * reference on the mount point in this case and return with ENOENT,
397 * telling the caller that mount mount it tried to busy is no longer
400 while (mp->mnt_kern_flag & MNTK_UNMOUNT) {
401 if (flags & MBF_NOWAIT || mp->mnt_kern_flag & MNTK_REFEXPIRE) {
404 CTR1(KTR_VFS, "%s: failed busying before sleeping",
408 if (flags & MBF_MNTLSTLOCK)
409 mtx_unlock(&mountlist_mtx);
410 mp->mnt_kern_flag |= MNTK_MWAIT;
411 msleep(mp, MNT_MTX(mp), PVFS | PDROP, "vfs_busy", 0);
412 if (flags & MBF_MNTLSTLOCK)
413 mtx_lock(&mountlist_mtx);
416 if (flags & MBF_MNTLSTLOCK)
417 mtx_unlock(&mountlist_mtx);
424 * Free a busy filesystem.
427 vfs_unbusy(struct mount *mp)
430 CTR2(KTR_VFS, "%s: mp %p", __func__, mp);
433 KASSERT(mp->mnt_lockref > 0, ("negative mnt_lockref"));
435 if (mp->mnt_lockref == 0 && (mp->mnt_kern_flag & MNTK_DRAINING) != 0) {
436 MPASS(mp->mnt_kern_flag & MNTK_UNMOUNT);
437 CTR1(KTR_VFS, "%s: waking up waiters", __func__);
438 mp->mnt_kern_flag &= ~MNTK_DRAINING;
439 wakeup(&mp->mnt_lockref);
445 * Lookup a mount point by filesystem identifier.
448 vfs_getvfs(fsid_t *fsid)
452 CTR2(KTR_VFS, "%s: fsid %p", __func__, fsid);
453 mtx_lock(&mountlist_mtx);
454 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
455 if (mp->mnt_stat.f_fsid.val[0] == fsid->val[0] &&
456 mp->mnt_stat.f_fsid.val[1] == fsid->val[1]) {
458 mtx_unlock(&mountlist_mtx);
462 mtx_unlock(&mountlist_mtx);
463 CTR2(KTR_VFS, "%s: lookup failed for %p id", __func__, fsid);
464 return ((struct mount *) 0);
468 * Lookup a mount point by filesystem identifier, busying it before
472 vfs_busyfs(fsid_t *fsid)
477 CTR2(KTR_VFS, "%s: fsid %p", __func__, fsid);
478 mtx_lock(&mountlist_mtx);
479 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
480 if (mp->mnt_stat.f_fsid.val[0] == fsid->val[0] &&
481 mp->mnt_stat.f_fsid.val[1] == fsid->val[1]) {
482 error = vfs_busy(mp, MBF_MNTLSTLOCK);
484 mtx_unlock(&mountlist_mtx);
490 CTR2(KTR_VFS, "%s: lookup failed for %p id", __func__, fsid);
491 mtx_unlock(&mountlist_mtx);
492 return ((struct mount *) 0);
496 * Check if a user can access privileged mount options.
499 vfs_suser(struct mount *mp, struct thread *td)
504 * If the thread is jailed, but this is not a jail-friendly file
505 * system, deny immediately.
507 if (!(mp->mnt_vfc->vfc_flags & VFCF_JAIL) && jailed(td->td_ucred))
511 * If the file system was mounted outside the jail of the calling
512 * thread, deny immediately.
514 if (prison_check(td->td_ucred, mp->mnt_cred) != 0)
518 * If file system supports delegated administration, we don't check
519 * for the PRIV_VFS_MOUNT_OWNER privilege - it will be better verified
520 * by the file system itself.
521 * If this is not the user that did original mount, we check for
522 * the PRIV_VFS_MOUNT_OWNER privilege.
524 if (!(mp->mnt_vfc->vfc_flags & VFCF_DELEGADMIN) &&
525 mp->mnt_cred->cr_uid != td->td_ucred->cr_uid) {
526 if ((error = priv_check(td, PRIV_VFS_MOUNT_OWNER)) != 0)
533 * Get a new unique fsid. Try to make its val[0] unique, since this value
534 * will be used to create fake device numbers for stat(). Also try (but
535 * not so hard) make its val[0] unique mod 2^16, since some emulators only
536 * support 16-bit device numbers. We end up with unique val[0]'s for the
537 * first 2^16 calls and unique val[0]'s mod 2^16 for the first 2^8 calls.
539 * Keep in mind that several mounts may be running in parallel. Starting
540 * the search one past where the previous search terminated is both a
541 * micro-optimization and a defense against returning the same fsid to
545 vfs_getnewfsid(struct mount *mp)
547 static uint16_t mntid_base;
552 CTR2(KTR_VFS, "%s: mp %p", __func__, mp);
553 mtx_lock(&mntid_mtx);
554 mtype = mp->mnt_vfc->vfc_typenum;
555 tfsid.val[1] = mtype;
556 mtype = (mtype & 0xFF) << 24;
558 tfsid.val[0] = makedev(255,
559 mtype | ((mntid_base & 0xFF00) << 8) | (mntid_base & 0xFF));
561 if ((nmp = vfs_getvfs(&tfsid)) == NULL)
565 mp->mnt_stat.f_fsid.val[0] = tfsid.val[0];
566 mp->mnt_stat.f_fsid.val[1] = tfsid.val[1];
567 mtx_unlock(&mntid_mtx);
571 * Knob to control the precision of file timestamps:
573 * 0 = seconds only; nanoseconds zeroed.
574 * 1 = seconds and nanoseconds, accurate within 1/HZ.
575 * 2 = seconds and nanoseconds, truncated to microseconds.
576 * >=3 = seconds and nanoseconds, maximum precision.
578 enum { TSP_SEC, TSP_HZ, TSP_USEC, TSP_NSEC };
580 static int timestamp_precision = TSP_SEC;
581 SYSCTL_INT(_vfs, OID_AUTO, timestamp_precision, CTLFLAG_RW,
582 ×tamp_precision, 0, "File timestamp precision (0: seconds, "
583 "1: sec + ns accurate to 1/HZ, 2: sec + ns truncated to ms, "
584 "3+: sec + ns (max. precision))");
587 * Get a current timestamp.
590 vfs_timestamp(struct timespec *tsp)
594 switch (timestamp_precision) {
596 tsp->tv_sec = time_second;
604 TIMEVAL_TO_TIMESPEC(&tv, tsp);
614 * Set vnode attributes to VNOVAL
617 vattr_null(struct vattr *vap)
621 vap->va_size = VNOVAL;
622 vap->va_bytes = VNOVAL;
623 vap->va_mode = VNOVAL;
624 vap->va_nlink = VNOVAL;
625 vap->va_uid = VNOVAL;
626 vap->va_gid = VNOVAL;
627 vap->va_fsid = VNOVAL;
628 vap->va_fileid = VNOVAL;
629 vap->va_blocksize = VNOVAL;
630 vap->va_rdev = VNOVAL;
631 vap->va_atime.tv_sec = VNOVAL;
632 vap->va_atime.tv_nsec = VNOVAL;
633 vap->va_mtime.tv_sec = VNOVAL;
634 vap->va_mtime.tv_nsec = VNOVAL;
635 vap->va_ctime.tv_sec = VNOVAL;
636 vap->va_ctime.tv_nsec = VNOVAL;
637 vap->va_birthtime.tv_sec = VNOVAL;
638 vap->va_birthtime.tv_nsec = VNOVAL;
639 vap->va_flags = VNOVAL;
640 vap->va_gen = VNOVAL;
645 * This routine is called when we have too many vnodes. It attempts
646 * to free <count> vnodes and will potentially free vnodes that still
647 * have VM backing store (VM backing store is typically the cause
648 * of a vnode blowout so we want to do this). Therefore, this operation
649 * is not considered cheap.
651 * A number of conditions may prevent a vnode from being reclaimed.
652 * the buffer cache may have references on the vnode, a directory
653 * vnode may still have references due to the namei cache representing
654 * underlying files, or the vnode may be in active use. It is not
655 * desireable to reuse such vnodes. These conditions may cause the
656 * number of vnodes to reach some minimum value regardless of what
657 * you set kern.maxvnodes to. Do not set kern.maxvnodes too low.
660 vlrureclaim(struct mount *mp)
669 * Calculate the trigger point, don't allow user
670 * screwups to blow us up. This prevents us from
671 * recycling vnodes with lots of resident pages. We
672 * aren't trying to free memory, we are trying to
675 usevnodes = desiredvnodes;
678 trigger = cnt.v_page_count * 2 / usevnodes;
680 vn_start_write(NULL, &mp, V_WAIT);
682 count = mp->mnt_nvnodelistsize / 10 + 1;
684 vp = TAILQ_FIRST(&mp->mnt_nvnodelist);
685 while (vp != NULL && vp->v_type == VMARKER)
686 vp = TAILQ_NEXT(vp, v_nmntvnodes);
689 TAILQ_REMOVE(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
690 TAILQ_INSERT_TAIL(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
695 * If it's been deconstructed already, it's still
696 * referenced, or it exceeds the trigger, skip it.
698 if (vp->v_usecount ||
699 (!vlru_allow_cache_src &&
700 !LIST_EMPTY(&(vp)->v_cache_src)) ||
701 (vp->v_iflag & VI_DOOMED) != 0 || (vp->v_object != NULL &&
702 vp->v_object->resident_page_count > trigger)) {
708 if (VOP_LOCK(vp, LK_INTERLOCK|LK_EXCLUSIVE|LK_NOWAIT)) {
710 goto next_iter_mntunlocked;
714 * v_usecount may have been bumped after VOP_LOCK() dropped
715 * the vnode interlock and before it was locked again.
717 * It is not necessary to recheck VI_DOOMED because it can
718 * only be set by another thread that holds both the vnode
719 * lock and vnode interlock. If another thread has the
720 * vnode lock before we get to VOP_LOCK() and obtains the
721 * vnode interlock after VOP_LOCK() drops the vnode
722 * interlock, the other thread will be unable to drop the
723 * vnode lock before our VOP_LOCK() call fails.
725 if (vp->v_usecount ||
726 (!vlru_allow_cache_src &&
727 !LIST_EMPTY(&(vp)->v_cache_src)) ||
728 (vp->v_object != NULL &&
729 vp->v_object->resident_page_count > trigger)) {
730 VOP_UNLOCK(vp, LK_INTERLOCK);
731 goto next_iter_mntunlocked;
733 KASSERT((vp->v_iflag & VI_DOOMED) == 0,
734 ("VI_DOOMED unexpectedly detected in vlrureclaim()"));
739 next_iter_mntunlocked:
748 kern_yield(PRI_UNCHANGED);
753 vn_finished_write(mp);
758 * Attempt to keep the free list at wantfreevnodes length.
761 vnlru_free(int count)
766 mtx_assert(&vnode_free_list_mtx, MA_OWNED);
767 for (; count > 0; count--) {
768 vp = TAILQ_FIRST(&vnode_free_list);
770 * The list can be modified while the free_list_mtx
771 * has been dropped and vp could be NULL here.
775 VNASSERT(vp->v_op != NULL, vp,
776 ("vnlru_free: vnode already reclaimed."));
777 KASSERT((vp->v_iflag & VI_FREE) != 0,
778 ("Removing vnode not on freelist"));
779 KASSERT((vp->v_iflag & VI_ACTIVE) == 0,
780 ("Mangling active vnode"));
781 TAILQ_REMOVE(&vnode_free_list, vp, v_actfreelist);
783 * Don't recycle if we can't get the interlock.
785 if (!VI_TRYLOCK(vp)) {
786 TAILQ_INSERT_TAIL(&vnode_free_list, vp, v_actfreelist);
789 VNASSERT(VCANRECYCLE(vp), vp,
790 ("vp inconsistent on freelist"));
792 vp->v_iflag &= ~VI_FREE;
794 mtx_unlock(&vnode_free_list_mtx);
796 vfslocked = VFS_LOCK_GIANT(vp->v_mount);
798 VFS_UNLOCK_GIANT(vfslocked);
800 * If the recycled succeeded this vdrop will actually free
801 * the vnode. If not it will simply place it back on
805 mtx_lock(&vnode_free_list_mtx);
809 * Attempt to recycle vnodes in a context that is always safe to block.
810 * Calling vlrurecycle() from the bowels of filesystem code has some
811 * interesting deadlock problems.
813 static struct proc *vnlruproc;
814 static int vnlruproc_sig;
819 struct mount *mp, *nmp;
821 struct proc *p = vnlruproc;
823 EVENTHANDLER_REGISTER(shutdown_pre_sync, kproc_shutdown, p,
827 kproc_suspend_check(p);
828 mtx_lock(&vnode_free_list_mtx);
829 if (freevnodes > wantfreevnodes)
830 vnlru_free(freevnodes - wantfreevnodes);
831 if (numvnodes <= desiredvnodes * 9 / 10) {
833 wakeup(&vnlruproc_sig);
834 msleep(vnlruproc, &vnode_free_list_mtx,
835 PVFS|PDROP, "vlruwt", hz);
838 mtx_unlock(&vnode_free_list_mtx);
840 mtx_lock(&mountlist_mtx);
841 for (mp = TAILQ_FIRST(&mountlist); mp != NULL; mp = nmp) {
842 if (vfs_busy(mp, MBF_NOWAIT | MBF_MNTLSTLOCK)) {
843 nmp = TAILQ_NEXT(mp, mnt_list);
846 vfslocked = VFS_LOCK_GIANT(mp);
847 done += vlrureclaim(mp);
848 VFS_UNLOCK_GIANT(vfslocked);
849 mtx_lock(&mountlist_mtx);
850 nmp = TAILQ_NEXT(mp, mnt_list);
853 mtx_unlock(&mountlist_mtx);
856 /* These messages are temporary debugging aids */
857 if (vnlru_nowhere < 5)
858 printf("vnlru process getting nowhere..\n");
859 else if (vnlru_nowhere == 5)
860 printf("vnlru process messages stopped.\n");
863 tsleep(vnlruproc, PPAUSE, "vlrup", hz * 3);
865 kern_yield(PRI_UNCHANGED);
869 static struct kproc_desc vnlru_kp = {
874 SYSINIT(vnlru, SI_SUB_KTHREAD_UPDATE, SI_ORDER_FIRST, kproc_start,
878 * Routines having to do with the management of the vnode table.
882 * Try to recycle a freed vnode. We abort if anyone picks up a reference
883 * before we actually vgone(). This function must be called with the vnode
884 * held to prevent the vnode from being returned to the free list midway
888 vtryrecycle(struct vnode *vp)
892 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
893 VNASSERT(vp->v_holdcnt, vp,
894 ("vtryrecycle: Recycling vp %p without a reference.", vp));
896 * This vnode may found and locked via some other list, if so we
897 * can't recycle it yet.
899 if (VOP_LOCK(vp, LK_EXCLUSIVE | LK_NOWAIT) != 0) {
901 "%s: impossible to recycle, vp %p lock is already held",
903 return (EWOULDBLOCK);
906 * Don't recycle if its filesystem is being suspended.
908 if (vn_start_write(vp, &vnmp, V_NOWAIT) != 0) {
911 "%s: impossible to recycle, cannot start the write for %p",
916 * If we got this far, we need to acquire the interlock and see if
917 * anyone picked up this vnode from another list. If not, we will
918 * mark it with DOOMED via vgonel() so that anyone who does find it
922 if (vp->v_usecount) {
923 VOP_UNLOCK(vp, LK_INTERLOCK);
924 vn_finished_write(vnmp);
926 "%s: impossible to recycle, %p is already referenced",
930 if ((vp->v_iflag & VI_DOOMED) == 0)
932 VOP_UNLOCK(vp, LK_INTERLOCK);
933 vn_finished_write(vnmp);
938 * Return the next vnode from the free list.
941 getnewvnode(const char *tag, struct mount *mp, struct vop_vector *vops,
944 struct vnode *vp = NULL;
947 CTR3(KTR_VFS, "%s: mp %p with tag %s", __func__, mp, tag);
948 mtx_lock(&vnode_free_list_mtx);
950 * Lend our context to reclaim vnodes if they've exceeded the max.
952 if (freevnodes > wantfreevnodes)
955 * Wait for available vnodes.
957 if (numvnodes > desiredvnodes) {
958 if (mp != NULL && (mp->mnt_kern_flag & MNTK_SUSPEND)) {
960 * File system is beeing suspended, we cannot risk a
961 * deadlock here, so allocate new vnode anyway.
963 if (freevnodes > wantfreevnodes)
964 vnlru_free(freevnodes - wantfreevnodes);
967 if (vnlruproc_sig == 0) {
968 vnlruproc_sig = 1; /* avoid unnecessary wakeups */
971 msleep(&vnlruproc_sig, &vnode_free_list_mtx, PVFS,
973 #if 0 /* XXX Not all VFS_VGET/ffs_vget callers check returns. */
974 if (numvnodes > desiredvnodes) {
975 mtx_unlock(&vnode_free_list_mtx);
982 mtx_unlock(&vnode_free_list_mtx);
983 vp = (struct vnode *) uma_zalloc(vnode_zone, M_WAITOK|M_ZERO);
987 vp->v_vnlock = &vp->v_lock;
988 mtx_init(&vp->v_interlock, "vnode interlock", NULL, MTX_DEF);
990 * By default, don't allow shared locks unless filesystems
993 lockinit(vp->v_vnlock, PVFS, tag, VLKTIMEOUT, LK_NOSHARE);
999 mtx_init(BO_MTX(bo), "bufobj interlock", NULL, MTX_DEF);
1000 bo->bo_ops = &buf_ops_bio;
1001 bo->bo_private = vp;
1002 TAILQ_INIT(&bo->bo_clean.bv_hd);
1003 TAILQ_INIT(&bo->bo_dirty.bv_hd);
1005 * Initialize namecache.
1007 LIST_INIT(&vp->v_cache_src);
1008 TAILQ_INIT(&vp->v_cache_dst);
1010 * Finalize various vnode identity bits.
1015 v_incr_usecount(vp);
1019 if (mp != NULL && (mp->mnt_flag & MNT_MULTILABEL) == 0)
1020 mac_vnode_associate_singlelabel(mp, vp);
1021 else if (mp == NULL && vops != &dead_vnodeops)
1022 printf("NULL mp in getnewvnode()\n");
1025 bo->bo_bsize = mp->mnt_stat.f_iosize;
1026 if ((mp->mnt_kern_flag & MNTK_NOKNOTE) != 0)
1027 vp->v_vflag |= VV_NOKNOTE;
1029 rangelock_init(&vp->v_rl);
1036 * Delete from old mount point vnode list, if on one.
1039 delmntque(struct vnode *vp)
1049 KASSERT(mp->mnt_activevnodelistsize <= mp->mnt_nvnodelistsize,
1050 ("Active vnode list size %d > Vnode list size %d",
1051 mp->mnt_activevnodelistsize, mp->mnt_nvnodelistsize));
1052 active = vp->v_iflag & VI_ACTIVE;
1053 vp->v_iflag &= ~VI_ACTIVE;
1055 mtx_lock(&vnode_free_list_mtx);
1056 TAILQ_REMOVE(&mp->mnt_activevnodelist, vp, v_actfreelist);
1057 mp->mnt_activevnodelistsize--;
1058 mtx_unlock(&vnode_free_list_mtx);
1062 VNASSERT(mp->mnt_nvnodelistsize > 0, vp,
1063 ("bad mount point vnode list size"));
1064 TAILQ_REMOVE(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
1065 mp->mnt_nvnodelistsize--;
1071 insmntque_stddtr(struct vnode *vp, void *dtr_arg)
1075 vp->v_op = &dead_vnodeops;
1076 /* XXX non mp-safe fs may still call insmntque with vnode
1078 if (!VOP_ISLOCKED(vp))
1079 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
1085 * Insert into list of vnodes for the new mount point, if available.
1088 insmntque1(struct vnode *vp, struct mount *mp,
1089 void (*dtr)(struct vnode *, void *), void *dtr_arg)
1093 KASSERT(vp->v_mount == NULL,
1094 ("insmntque: vnode already on per mount vnode list"));
1095 VNASSERT(mp != NULL, vp, ("Don't call insmntque(foo, NULL)"));
1096 #ifdef DEBUG_VFS_LOCKS
1097 if (!VFS_NEEDSGIANT(mp))
1098 ASSERT_VOP_ELOCKED(vp,
1099 "insmntque: mp-safe fs and non-locked vp");
1102 * We acquire the vnode interlock early to ensure that the
1103 * vnode cannot be recycled by another process releasing a
1104 * holdcnt on it before we get it on both the vnode list
1105 * and the active vnode list. The mount mutex protects only
1106 * manipulation of the vnode list and the vnode freelist
1107 * mutex protects only manipulation of the active vnode list.
1108 * Hence the need to hold the vnode interlock throughout.
1112 if ((mp->mnt_kern_flag & MNTK_NOINSMNTQ) != 0 &&
1113 ((mp->mnt_kern_flag & MNTK_UNMOUNTF) != 0 ||
1114 mp->mnt_nvnodelistsize == 0)) {
1115 locked = VOP_ISLOCKED(vp);
1116 if (!locked || (locked == LK_EXCLUSIVE &&
1117 (vp->v_vflag & VV_FORCEINSMQ) == 0)) {
1127 TAILQ_INSERT_TAIL(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
1128 VNASSERT(mp->mnt_nvnodelistsize >= 0, vp,
1129 ("neg mount point vnode list size"));
1130 mp->mnt_nvnodelistsize++;
1131 KASSERT((vp->v_iflag & VI_ACTIVE) == 0,
1132 ("Activating already active vnode"));
1133 vp->v_iflag |= VI_ACTIVE;
1134 mtx_lock(&vnode_free_list_mtx);
1135 TAILQ_INSERT_HEAD(&mp->mnt_activevnodelist, vp, v_actfreelist);
1136 mp->mnt_activevnodelistsize++;
1137 mtx_unlock(&vnode_free_list_mtx);
1144 insmntque(struct vnode *vp, struct mount *mp)
1147 return (insmntque1(vp, mp, insmntque_stddtr, NULL));
1151 * Flush out and invalidate all buffers associated with a bufobj
1152 * Called with the underlying object locked.
1155 bufobj_invalbuf(struct bufobj *bo, int flags, int slpflag, int slptimeo)
1160 if (flags & V_SAVE) {
1161 error = bufobj_wwait(bo, slpflag, slptimeo);
1166 if (bo->bo_dirty.bv_cnt > 0) {
1168 if ((error = BO_SYNC(bo, MNT_WAIT)) != 0)
1171 * XXX We could save a lock/unlock if this was only
1172 * enabled under INVARIANTS
1175 if (bo->bo_numoutput > 0 || bo->bo_dirty.bv_cnt > 0)
1176 panic("vinvalbuf: dirty bufs");
1180 * If you alter this loop please notice that interlock is dropped and
1181 * reacquired in flushbuflist. Special care is needed to ensure that
1182 * no race conditions occur from this.
1185 error = flushbuflist(&bo->bo_clean,
1186 flags, bo, slpflag, slptimeo);
1187 if (error == 0 && !(flags & V_CLEANONLY))
1188 error = flushbuflist(&bo->bo_dirty,
1189 flags, bo, slpflag, slptimeo);
1190 if (error != 0 && error != EAGAIN) {
1194 } while (error != 0);
1197 * Wait for I/O to complete. XXX needs cleaning up. The vnode can
1198 * have write I/O in-progress but if there is a VM object then the
1199 * VM object can also have read-I/O in-progress.
1202 bufobj_wwait(bo, 0, 0);
1204 if (bo->bo_object != NULL) {
1205 VM_OBJECT_LOCK(bo->bo_object);
1206 vm_object_pip_wait(bo->bo_object, "bovlbx");
1207 VM_OBJECT_UNLOCK(bo->bo_object);
1210 } while (bo->bo_numoutput > 0);
1214 * Destroy the copy in the VM cache, too.
1216 if (bo->bo_object != NULL &&
1217 (flags & (V_ALT | V_NORMAL | V_CLEANONLY)) == 0) {
1218 VM_OBJECT_LOCK(bo->bo_object);
1219 vm_object_page_remove(bo->bo_object, 0, 0, (flags & V_SAVE) ?
1220 OBJPR_CLEANONLY : 0);
1221 VM_OBJECT_UNLOCK(bo->bo_object);
1226 if ((flags & (V_ALT | V_NORMAL | V_CLEANONLY)) == 0 &&
1227 (bo->bo_dirty.bv_cnt > 0 || bo->bo_clean.bv_cnt > 0))
1228 panic("vinvalbuf: flush failed");
1235 * Flush out and invalidate all buffers associated with a vnode.
1236 * Called with the underlying object locked.
1239 vinvalbuf(struct vnode *vp, int flags, int slpflag, int slptimeo)
1242 CTR3(KTR_VFS, "%s: vp %p with flags %d", __func__, vp, flags);
1243 ASSERT_VOP_LOCKED(vp, "vinvalbuf");
1244 return (bufobj_invalbuf(&vp->v_bufobj, flags, slpflag, slptimeo));
1248 * Flush out buffers on the specified list.
1252 flushbuflist( struct bufv *bufv, int flags, struct bufobj *bo, int slpflag,
1255 struct buf *bp, *nbp;
1260 ASSERT_BO_LOCKED(bo);
1263 TAILQ_FOREACH_SAFE(bp, &bufv->bv_hd, b_bobufs, nbp) {
1264 if (((flags & V_NORMAL) && (bp->b_xflags & BX_ALTDATA)) ||
1265 ((flags & V_ALT) && (bp->b_xflags & BX_ALTDATA) == 0)) {
1271 lblkno = nbp->b_lblkno;
1272 xflags = nbp->b_xflags &
1273 (BX_BKGRDMARKER | BX_VNDIRTY | BX_VNCLEAN);
1276 error = BUF_TIMELOCK(bp,
1277 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK, BO_MTX(bo),
1278 "flushbuf", slpflag, slptimeo);
1281 return (error != ENOLCK ? error : EAGAIN);
1283 KASSERT(bp->b_bufobj == bo,
1284 ("bp %p wrong b_bufobj %p should be %p",
1285 bp, bp->b_bufobj, bo));
1286 if (bp->b_bufobj != bo) { /* XXX: necessary ? */
1292 * XXX Since there are no node locks for NFS, I
1293 * believe there is a slight chance that a delayed
1294 * write will occur while sleeping just above, so
1297 if (((bp->b_flags & (B_DELWRI | B_INVAL)) == B_DELWRI) &&
1302 bp->b_flags |= B_ASYNC;
1305 return (EAGAIN); /* XXX: why not loop ? */
1310 bp->b_flags |= (B_INVAL | B_RELBUF);
1311 bp->b_flags &= ~B_ASYNC;
1315 (nbp->b_bufobj != bo ||
1316 nbp->b_lblkno != lblkno ||
1318 (BX_BKGRDMARKER | BX_VNDIRTY | BX_VNCLEAN)) != xflags))
1319 break; /* nbp invalid */
1325 * Truncate a file's buffer and pages to a specified length. This
1326 * is in lieu of the old vinvalbuf mechanism, which performed unneeded
1330 vtruncbuf(struct vnode *vp, struct ucred *cred, struct thread *td,
1331 off_t length, int blksize)
1333 struct buf *bp, *nbp;
1338 CTR5(KTR_VFS, "%s: vp %p with cred %p and block %d:%ju", __func__,
1339 vp, cred, blksize, (uintmax_t)length);
1342 * Round up to the *next* lbn.
1344 trunclbn = (length + blksize - 1) / blksize;
1346 ASSERT_VOP_LOCKED(vp, "vtruncbuf");
1353 TAILQ_FOREACH_SAFE(bp, &bo->bo_clean.bv_hd, b_bobufs, nbp) {
1354 if (bp->b_lblkno < trunclbn)
1357 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK,
1358 BO_MTX(bo)) == ENOLCK)
1364 bp->b_flags |= (B_INVAL | B_RELBUF);
1365 bp->b_flags &= ~B_ASYNC;
1371 (((nbp->b_xflags & BX_VNCLEAN) == 0) ||
1372 (nbp->b_vp != vp) ||
1373 (nbp->b_flags & B_DELWRI))) {
1379 TAILQ_FOREACH_SAFE(bp, &bo->bo_dirty.bv_hd, b_bobufs, nbp) {
1380 if (bp->b_lblkno < trunclbn)
1383 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK,
1384 BO_MTX(bo)) == ENOLCK)
1389 bp->b_flags |= (B_INVAL | B_RELBUF);
1390 bp->b_flags &= ~B_ASYNC;
1396 (((nbp->b_xflags & BX_VNDIRTY) == 0) ||
1397 (nbp->b_vp != vp) ||
1398 (nbp->b_flags & B_DELWRI) == 0)) {
1407 TAILQ_FOREACH_SAFE(bp, &bo->bo_dirty.bv_hd, b_bobufs, nbp) {
1408 if (bp->b_lblkno > 0)
1411 * Since we hold the vnode lock this should only
1412 * fail if we're racing with the buf daemon.
1415 LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK,
1416 BO_MTX(bo)) == ENOLCK) {
1419 VNASSERT((bp->b_flags & B_DELWRI), vp,
1420 ("buf(%p) on dirty queue without DELWRI", bp));
1431 bufobj_wwait(bo, 0, 0);
1433 vnode_pager_setsize(vp, length);
1439 * buf_splay() - splay tree core for the clean/dirty list of buffers in
1442 * NOTE: We have to deal with the special case of a background bitmap
1443 * buffer, a situation where two buffers will have the same logical
1444 * block offset. We want (1) only the foreground buffer to be accessed
1445 * in a lookup and (2) must differentiate between the foreground and
1446 * background buffer in the splay tree algorithm because the splay
1447 * tree cannot normally handle multiple entities with the same 'index'.
1448 * We accomplish this by adding differentiating flags to the splay tree's
1453 buf_splay(daddr_t lblkno, b_xflags_t xflags, struct buf *root)
1456 struct buf *lefttreemax, *righttreemin, *y;
1460 lefttreemax = righttreemin = &dummy;
1462 if (lblkno < root->b_lblkno ||
1463 (lblkno == root->b_lblkno &&
1464 (xflags & BX_BKGRDMARKER) < (root->b_xflags & BX_BKGRDMARKER))) {
1465 if ((y = root->b_left) == NULL)
1467 if (lblkno < y->b_lblkno) {
1469 root->b_left = y->b_right;
1472 if ((y = root->b_left) == NULL)
1475 /* Link into the new root's right tree. */
1476 righttreemin->b_left = root;
1477 righttreemin = root;
1478 } else if (lblkno > root->b_lblkno ||
1479 (lblkno == root->b_lblkno &&
1480 (xflags & BX_BKGRDMARKER) > (root->b_xflags & BX_BKGRDMARKER))) {
1481 if ((y = root->b_right) == NULL)
1483 if (lblkno > y->b_lblkno) {
1485 root->b_right = y->b_left;
1488 if ((y = root->b_right) == NULL)
1491 /* Link into the new root's left tree. */
1492 lefttreemax->b_right = root;
1499 /* Assemble the new root. */
1500 lefttreemax->b_right = root->b_left;
1501 righttreemin->b_left = root->b_right;
1502 root->b_left = dummy.b_right;
1503 root->b_right = dummy.b_left;
1508 buf_vlist_remove(struct buf *bp)
1513 KASSERT(bp->b_bufobj != NULL, ("No b_bufobj %p", bp));
1514 ASSERT_BO_LOCKED(bp->b_bufobj);
1515 KASSERT((bp->b_xflags & (BX_VNDIRTY|BX_VNCLEAN)) !=
1516 (BX_VNDIRTY|BX_VNCLEAN),
1517 ("buf_vlist_remove: Buf %p is on two lists", bp));
1518 if (bp->b_xflags & BX_VNDIRTY)
1519 bv = &bp->b_bufobj->bo_dirty;
1521 bv = &bp->b_bufobj->bo_clean;
1522 if (bp != bv->bv_root) {
1523 root = buf_splay(bp->b_lblkno, bp->b_xflags, bv->bv_root);
1524 KASSERT(root == bp, ("splay lookup failed in remove"));
1526 if (bp->b_left == NULL) {
1529 root = buf_splay(bp->b_lblkno, bp->b_xflags, bp->b_left);
1530 root->b_right = bp->b_right;
1533 TAILQ_REMOVE(&bv->bv_hd, bp, b_bobufs);
1535 bp->b_xflags &= ~(BX_VNDIRTY | BX_VNCLEAN);
1539 * Add the buffer to the sorted clean or dirty block list using a
1540 * splay tree algorithm.
1542 * NOTE: xflags is passed as a constant, optimizing this inline function!
1545 buf_vlist_add(struct buf *bp, struct bufobj *bo, b_xflags_t xflags)
1550 ASSERT_BO_LOCKED(bo);
1551 KASSERT((bp->b_xflags & (BX_VNDIRTY|BX_VNCLEAN)) == 0,
1552 ("buf_vlist_add: Buf %p has existing xflags %d", bp, bp->b_xflags));
1553 bp->b_xflags |= xflags;
1554 if (xflags & BX_VNDIRTY)
1559 root = buf_splay(bp->b_lblkno, bp->b_xflags, bv->bv_root);
1563 TAILQ_INSERT_TAIL(&bv->bv_hd, bp, b_bobufs);
1564 } else if (bp->b_lblkno < root->b_lblkno ||
1565 (bp->b_lblkno == root->b_lblkno &&
1566 (bp->b_xflags & BX_BKGRDMARKER) < (root->b_xflags & BX_BKGRDMARKER))) {
1567 bp->b_left = root->b_left;
1569 root->b_left = NULL;
1570 TAILQ_INSERT_BEFORE(root, bp, b_bobufs);
1572 bp->b_right = root->b_right;
1574 root->b_right = NULL;
1575 TAILQ_INSERT_AFTER(&bv->bv_hd, root, bp, b_bobufs);
1582 * Lookup a buffer using the splay tree. Note that we specifically avoid
1583 * shadow buffers used in background bitmap writes.
1585 * This code isn't quite efficient as it could be because we are maintaining
1586 * two sorted lists and do not know which list the block resides in.
1588 * During a "make buildworld" the desired buffer is found at one of
1589 * the roots more than 60% of the time. Thus, checking both roots
1590 * before performing either splay eliminates unnecessary splays on the
1591 * first tree splayed.
1594 gbincore(struct bufobj *bo, daddr_t lblkno)
1598 ASSERT_BO_LOCKED(bo);
1599 if ((bp = bo->bo_clean.bv_root) != NULL &&
1600 bp->b_lblkno == lblkno && !(bp->b_xflags & BX_BKGRDMARKER))
1602 if ((bp = bo->bo_dirty.bv_root) != NULL &&
1603 bp->b_lblkno == lblkno && !(bp->b_xflags & BX_BKGRDMARKER))
1605 if ((bp = bo->bo_clean.bv_root) != NULL) {
1606 bo->bo_clean.bv_root = bp = buf_splay(lblkno, 0, bp);
1607 if (bp->b_lblkno == lblkno && !(bp->b_xflags & BX_BKGRDMARKER))
1610 if ((bp = bo->bo_dirty.bv_root) != NULL) {
1611 bo->bo_dirty.bv_root = bp = buf_splay(lblkno, 0, bp);
1612 if (bp->b_lblkno == lblkno && !(bp->b_xflags & BX_BKGRDMARKER))
1619 * Associate a buffer with a vnode.
1622 bgetvp(struct vnode *vp, struct buf *bp)
1627 ASSERT_BO_LOCKED(bo);
1628 VNASSERT(bp->b_vp == NULL, bp->b_vp, ("bgetvp: not free"));
1630 CTR3(KTR_BUF, "bgetvp(%p) vp %p flags %X", bp, vp, bp->b_flags);
1631 VNASSERT((bp->b_xflags & (BX_VNDIRTY|BX_VNCLEAN)) == 0, vp,
1632 ("bgetvp: bp already attached! %p", bp));
1635 if (VFS_NEEDSGIANT(vp->v_mount) || bo->bo_flag & BO_NEEDSGIANT)
1636 bp->b_flags |= B_NEEDSGIANT;
1640 * Insert onto list for new vnode.
1642 buf_vlist_add(bp, bo, BX_VNCLEAN);
1646 * Disassociate a buffer from a vnode.
1649 brelvp(struct buf *bp)
1654 CTR3(KTR_BUF, "brelvp(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
1655 KASSERT(bp->b_vp != NULL, ("brelvp: NULL"));
1658 * Delete from old vnode list, if on one.
1660 vp = bp->b_vp; /* XXX */
1663 if (bp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN))
1664 buf_vlist_remove(bp);
1666 panic("brelvp: Buffer %p not on queue.", bp);
1667 if ((bo->bo_flag & BO_ONWORKLST) && bo->bo_dirty.bv_cnt == 0) {
1668 bo->bo_flag &= ~BO_ONWORKLST;
1669 mtx_lock(&sync_mtx);
1670 LIST_REMOVE(bo, bo_synclist);
1671 syncer_worklist_len--;
1672 mtx_unlock(&sync_mtx);
1674 bp->b_flags &= ~B_NEEDSGIANT;
1676 bp->b_bufobj = NULL;
1682 * Add an item to the syncer work queue.
1685 vn_syncer_add_to_worklist(struct bufobj *bo, int delay)
1689 ASSERT_BO_LOCKED(bo);
1691 mtx_lock(&sync_mtx);
1692 if (bo->bo_flag & BO_ONWORKLST)
1693 LIST_REMOVE(bo, bo_synclist);
1695 bo->bo_flag |= BO_ONWORKLST;
1696 syncer_worklist_len++;
1699 if (delay > syncer_maxdelay - 2)
1700 delay = syncer_maxdelay - 2;
1701 slot = (syncer_delayno + delay) & syncer_mask;
1703 queue = VFS_NEEDSGIANT(bo->__bo_vnode->v_mount) ? WI_GIANTQ :
1705 LIST_INSERT_HEAD(&syncer_workitem_pending[queue][slot], bo,
1707 mtx_unlock(&sync_mtx);
1711 sysctl_vfs_worklist_len(SYSCTL_HANDLER_ARGS)
1715 mtx_lock(&sync_mtx);
1716 len = syncer_worklist_len - sync_vnode_count;
1717 mtx_unlock(&sync_mtx);
1718 error = SYSCTL_OUT(req, &len, sizeof(len));
1722 SYSCTL_PROC(_vfs, OID_AUTO, worklist_len, CTLTYPE_INT | CTLFLAG_RD, NULL, 0,
1723 sysctl_vfs_worklist_len, "I", "Syncer thread worklist length");
1725 static struct proc *updateproc;
1726 static void sched_sync(void);
1727 static struct kproc_desc up_kp = {
1732 SYSINIT(syncer, SI_SUB_KTHREAD_UPDATE, SI_ORDER_FIRST, kproc_start, &up_kp);
1735 sync_vnode(struct synclist *slp, struct bufobj **bo, struct thread *td)
1740 *bo = LIST_FIRST(slp);
1743 vp = (*bo)->__bo_vnode; /* XXX */
1744 if (VOP_ISLOCKED(vp) != 0 || VI_TRYLOCK(vp) == 0)
1747 * We use vhold in case the vnode does not
1748 * successfully sync. vhold prevents the vnode from
1749 * going away when we unlock the sync_mtx so that
1750 * we can acquire the vnode interlock.
1753 mtx_unlock(&sync_mtx);
1755 if (vn_start_write(vp, &mp, V_NOWAIT) != 0) {
1757 mtx_lock(&sync_mtx);
1758 return (*bo == LIST_FIRST(slp));
1760 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
1761 (void) VOP_FSYNC(vp, MNT_LAZY, td);
1763 vn_finished_write(mp);
1765 if (((*bo)->bo_flag & BO_ONWORKLST) != 0) {
1767 * Put us back on the worklist. The worklist
1768 * routine will remove us from our current
1769 * position and then add us back in at a later
1772 vn_syncer_add_to_worklist(*bo, syncdelay);
1776 mtx_lock(&sync_mtx);
1781 * System filesystem synchronizer daemon.
1786 struct synclist *gnext, *next;
1787 struct synclist *gslp, *slp;
1790 struct thread *td = curthread;
1792 int net_worklist_len;
1793 int syncer_final_iter;
1798 syncer_final_iter = 0;
1800 syncer_state = SYNCER_RUNNING;
1801 starttime = time_uptime;
1802 td->td_pflags |= TDP_NORUNNINGBUF;
1804 EVENTHANDLER_REGISTER(shutdown_pre_sync, syncer_shutdown, td->td_proc,
1807 mtx_lock(&sync_mtx);
1809 if (syncer_state == SYNCER_FINAL_DELAY &&
1810 syncer_final_iter == 0) {
1811 mtx_unlock(&sync_mtx);
1812 kproc_suspend_check(td->td_proc);
1813 mtx_lock(&sync_mtx);
1815 net_worklist_len = syncer_worklist_len - sync_vnode_count;
1816 if (syncer_state != SYNCER_RUNNING &&
1817 starttime != time_uptime) {
1819 printf("\nSyncing disks, vnodes remaining...");
1822 printf("%d ", net_worklist_len);
1824 starttime = time_uptime;
1827 * Push files whose dirty time has expired. Be careful
1828 * of interrupt race on slp queue.
1830 * Skip over empty worklist slots when shutting down.
1833 slp = &syncer_workitem_pending[WI_MPSAFEQ][syncer_delayno];
1834 gslp = &syncer_workitem_pending[WI_GIANTQ][syncer_delayno];
1835 syncer_delayno += 1;
1836 if (syncer_delayno == syncer_maxdelay)
1838 next = &syncer_workitem_pending[WI_MPSAFEQ][syncer_delayno];
1839 gnext = &syncer_workitem_pending[WI_GIANTQ][syncer_delayno];
1841 * If the worklist has wrapped since the
1842 * it was emptied of all but syncer vnodes,
1843 * switch to the FINAL_DELAY state and run
1844 * for one more second.
1846 if (syncer_state == SYNCER_SHUTTING_DOWN &&
1847 net_worklist_len == 0 &&
1848 last_work_seen == syncer_delayno) {
1849 syncer_state = SYNCER_FINAL_DELAY;
1850 syncer_final_iter = SYNCER_SHUTDOWN_SPEEDUP;
1852 } while (syncer_state != SYNCER_RUNNING && LIST_EMPTY(slp) &&
1853 LIST_EMPTY(gslp) && syncer_worklist_len > 0);
1856 * Keep track of the last time there was anything
1857 * on the worklist other than syncer vnodes.
1858 * Return to the SHUTTING_DOWN state if any
1861 if (net_worklist_len > 0 || syncer_state == SYNCER_RUNNING)
1862 last_work_seen = syncer_delayno;
1863 if (net_worklist_len > 0 && syncer_state == SYNCER_FINAL_DELAY)
1864 syncer_state = SYNCER_SHUTTING_DOWN;
1865 while (!LIST_EMPTY(slp)) {
1866 error = sync_vnode(slp, &bo, td);
1868 LIST_REMOVE(bo, bo_synclist);
1869 LIST_INSERT_HEAD(next, bo, bo_synclist);
1873 if (first_printf == 0)
1874 wdog_kern_pat(WD_LASTVAL);
1877 if (!LIST_EMPTY(gslp)) {
1878 mtx_unlock(&sync_mtx);
1880 mtx_lock(&sync_mtx);
1881 while (!LIST_EMPTY(gslp)) {
1882 error = sync_vnode(gslp, &bo, td);
1884 LIST_REMOVE(bo, bo_synclist);
1885 LIST_INSERT_HEAD(gnext, bo,
1892 if (syncer_state == SYNCER_FINAL_DELAY && syncer_final_iter > 0)
1893 syncer_final_iter--;
1895 * The variable rushjob allows the kernel to speed up the
1896 * processing of the filesystem syncer process. A rushjob
1897 * value of N tells the filesystem syncer to process the next
1898 * N seconds worth of work on its queue ASAP. Currently rushjob
1899 * is used by the soft update code to speed up the filesystem
1900 * syncer process when the incore state is getting so far
1901 * ahead of the disk that the kernel memory pool is being
1902 * threatened with exhaustion.
1909 * Just sleep for a short period of time between
1910 * iterations when shutting down to allow some I/O
1913 * If it has taken us less than a second to process the
1914 * current work, then wait. Otherwise start right over
1915 * again. We can still lose time if any single round
1916 * takes more than two seconds, but it does not really
1917 * matter as we are just trying to generally pace the
1918 * filesystem activity.
1920 if (syncer_state != SYNCER_RUNNING ||
1921 time_uptime == starttime) {
1923 sched_prio(td, PPAUSE);
1926 if (syncer_state != SYNCER_RUNNING)
1927 cv_timedwait(&sync_wakeup, &sync_mtx,
1928 hz / SYNCER_SHUTDOWN_SPEEDUP);
1929 else if (time_uptime == starttime)
1930 cv_timedwait(&sync_wakeup, &sync_mtx, hz);
1935 * Request the syncer daemon to speed up its work.
1936 * We never push it to speed up more than half of its
1937 * normal turn time, otherwise it could take over the cpu.
1940 speedup_syncer(void)
1944 mtx_lock(&sync_mtx);
1945 if (rushjob < syncdelay / 2) {
1947 stat_rush_requests += 1;
1950 mtx_unlock(&sync_mtx);
1951 cv_broadcast(&sync_wakeup);
1956 * Tell the syncer to speed up its work and run though its work
1957 * list several times, then tell it to shut down.
1960 syncer_shutdown(void *arg, int howto)
1963 if (howto & RB_NOSYNC)
1965 mtx_lock(&sync_mtx);
1966 syncer_state = SYNCER_SHUTTING_DOWN;
1968 mtx_unlock(&sync_mtx);
1969 cv_broadcast(&sync_wakeup);
1970 kproc_shutdown(arg, howto);
1974 * Reassign a buffer from one vnode to another.
1975 * Used to assign file specific control information
1976 * (indirect blocks) to the vnode to which they belong.
1979 reassignbuf(struct buf *bp)
1992 CTR3(KTR_BUF, "reassignbuf(%p) vp %p flags %X",
1993 bp, bp->b_vp, bp->b_flags);
1995 * B_PAGING flagged buffers cannot be reassigned because their vp
1996 * is not fully linked in.
1998 if (bp->b_flags & B_PAGING)
1999 panic("cannot reassign paging buffer");
2002 * Delete from old vnode list, if on one.
2005 if (bp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN))
2006 buf_vlist_remove(bp);
2008 panic("reassignbuf: Buffer %p not on queue.", bp);
2010 * If dirty, put on list of dirty buffers; otherwise insert onto list
2013 if (bp->b_flags & B_DELWRI) {
2014 if ((bo->bo_flag & BO_ONWORKLST) == 0) {
2015 switch (vp->v_type) {
2025 vn_syncer_add_to_worklist(bo, delay);
2027 buf_vlist_add(bp, bo, BX_VNDIRTY);
2029 buf_vlist_add(bp, bo, BX_VNCLEAN);
2031 if ((bo->bo_flag & BO_ONWORKLST) && bo->bo_dirty.bv_cnt == 0) {
2032 mtx_lock(&sync_mtx);
2033 LIST_REMOVE(bo, bo_synclist);
2034 syncer_worklist_len--;
2035 mtx_unlock(&sync_mtx);
2036 bo->bo_flag &= ~BO_ONWORKLST;
2041 bp = TAILQ_FIRST(&bv->bv_hd);
2042 KASSERT(bp == NULL || bp->b_bufobj == bo,
2043 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2044 bp = TAILQ_LAST(&bv->bv_hd, buflists);
2045 KASSERT(bp == NULL || bp->b_bufobj == bo,
2046 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2048 bp = TAILQ_FIRST(&bv->bv_hd);
2049 KASSERT(bp == NULL || bp->b_bufobj == bo,
2050 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2051 bp = TAILQ_LAST(&bv->bv_hd, buflists);
2052 KASSERT(bp == NULL || bp->b_bufobj == bo,
2053 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
2059 * Increment the use and hold counts on the vnode, taking care to reference
2060 * the driver's usecount if this is a chardev. The vholdl() will remove
2061 * the vnode from the free list if it is presently free. Requires the
2062 * vnode interlock and returns with it held.
2065 v_incr_usecount(struct vnode *vp)
2068 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2070 if (vp->v_type == VCHR && vp->v_rdev != NULL) {
2072 vp->v_rdev->si_usecount++;
2079 * Turn a holdcnt into a use+holdcnt such that only one call to
2080 * v_decr_usecount is needed.
2083 v_upgrade_usecount(struct vnode *vp)
2086 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2088 if (vp->v_type == VCHR && vp->v_rdev != NULL) {
2090 vp->v_rdev->si_usecount++;
2096 * Decrement the vnode use and hold count along with the driver's usecount
2097 * if this is a chardev. The vdropl() below releases the vnode interlock
2098 * as it may free the vnode.
2101 v_decr_usecount(struct vnode *vp)
2104 ASSERT_VI_LOCKED(vp, __FUNCTION__);
2105 VNASSERT(vp->v_usecount > 0, vp,
2106 ("v_decr_usecount: negative usecount"));
2107 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2109 if (vp->v_type == VCHR && vp->v_rdev != NULL) {
2111 vp->v_rdev->si_usecount--;
2118 * Decrement only the use count and driver use count. This is intended to
2119 * be paired with a follow on vdropl() to release the remaining hold count.
2120 * In this way we may vgone() a vnode with a 0 usecount without risk of
2121 * having it end up on a free list because the hold count is kept above 0.
2124 v_decr_useonly(struct vnode *vp)
2127 ASSERT_VI_LOCKED(vp, __FUNCTION__);
2128 VNASSERT(vp->v_usecount > 0, vp,
2129 ("v_decr_useonly: negative usecount"));
2130 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2132 if (vp->v_type == VCHR && vp->v_rdev != NULL) {
2134 vp->v_rdev->si_usecount--;
2140 * Grab a particular vnode from the free list, increment its
2141 * reference count and lock it. VI_DOOMED is set if the vnode
2142 * is being destroyed. Only callers who specify LK_RETRY will
2143 * see doomed vnodes. If inactive processing was delayed in
2144 * vput try to do it here.
2147 vget(struct vnode *vp, int flags, struct thread *td)
2152 VFS_ASSERT_GIANT(vp->v_mount);
2153 VNASSERT((flags & LK_TYPE_MASK) != 0, vp,
2154 ("vget: invalid lock operation"));
2155 CTR3(KTR_VFS, "%s: vp %p with flags %d", __func__, vp, flags);
2157 if ((flags & LK_INTERLOCK) == 0)
2160 if ((error = vn_lock(vp, flags | LK_INTERLOCK)) != 0) {
2162 CTR2(KTR_VFS, "%s: impossible to lock vnode %p", __func__,
2166 if (vp->v_iflag & VI_DOOMED && (flags & LK_RETRY) == 0)
2167 panic("vget: vn_lock failed to return ENOENT\n");
2169 /* Upgrade our holdcnt to a usecount. */
2170 v_upgrade_usecount(vp);
2172 * We don't guarantee that any particular close will
2173 * trigger inactive processing so just make a best effort
2174 * here at preventing a reference to a removed file. If
2175 * we don't succeed no harm is done.
2177 if (vp->v_iflag & VI_OWEINACT) {
2178 if (VOP_ISLOCKED(vp) == LK_EXCLUSIVE &&
2179 (flags & LK_NOWAIT) == 0)
2181 vp->v_iflag &= ~VI_OWEINACT;
2188 * Increase the reference count of a vnode.
2191 vref(struct vnode *vp)
2194 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2196 v_incr_usecount(vp);
2201 * Return reference count of a vnode.
2203 * The results of this call are only guaranteed when some mechanism other
2204 * than the VI lock is used to stop other processes from gaining references
2205 * to the vnode. This may be the case if the caller holds the only reference.
2206 * This is also useful when stale data is acceptable as race conditions may
2207 * be accounted for by some other means.
2210 vrefcnt(struct vnode *vp)
2215 usecnt = vp->v_usecount;
2221 #define VPUTX_VRELE 1
2222 #define VPUTX_VPUT 2
2223 #define VPUTX_VUNREF 3
2226 vputx(struct vnode *vp, int func)
2230 KASSERT(vp != NULL, ("vputx: null vp"));
2231 if (func == VPUTX_VUNREF)
2232 ASSERT_VOP_LOCKED(vp, "vunref");
2233 else if (func == VPUTX_VPUT)
2234 ASSERT_VOP_LOCKED(vp, "vput");
2236 KASSERT(func == VPUTX_VRELE, ("vputx: wrong func"));
2237 VFS_ASSERT_GIANT(vp->v_mount);
2238 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2241 /* Skip this v_writecount check if we're going to panic below. */
2242 VNASSERT(vp->v_writecount < vp->v_usecount || vp->v_usecount < 1, vp,
2243 ("vputx: missed vn_close"));
2246 if (vp->v_usecount > 1 || ((vp->v_iflag & VI_DOINGINACT) &&
2247 vp->v_usecount == 1)) {
2248 if (func == VPUTX_VPUT)
2250 v_decr_usecount(vp);
2254 if (vp->v_usecount != 1) {
2255 vprint("vputx: negative ref count", vp);
2256 panic("vputx: negative ref cnt");
2258 CTR2(KTR_VFS, "%s: return vnode %p to the freelist", __func__, vp);
2260 * We want to hold the vnode until the inactive finishes to
2261 * prevent vgone() races. We drop the use count here and the
2262 * hold count below when we're done.
2266 * We must call VOP_INACTIVE with the node locked. Mark
2267 * as VI_DOINGINACT to avoid recursion.
2269 vp->v_iflag |= VI_OWEINACT;
2272 error = vn_lock(vp, LK_EXCLUSIVE | LK_INTERLOCK);
2276 if (VOP_ISLOCKED(vp) != LK_EXCLUSIVE) {
2277 error = VOP_LOCK(vp, LK_UPGRADE | LK_INTERLOCK |
2283 if (VOP_ISLOCKED(vp) != LK_EXCLUSIVE)
2287 if (vp->v_usecount > 0)
2288 vp->v_iflag &= ~VI_OWEINACT;
2290 if (vp->v_iflag & VI_OWEINACT)
2291 vinactive(vp, curthread);
2292 if (func != VPUTX_VUNREF)
2299 * Vnode put/release.
2300 * If count drops to zero, call inactive routine and return to freelist.
2303 vrele(struct vnode *vp)
2306 vputx(vp, VPUTX_VRELE);
2310 * Release an already locked vnode. This give the same effects as
2311 * unlock+vrele(), but takes less time and avoids releasing and
2312 * re-aquiring the lock (as vrele() acquires the lock internally.)
2315 vput(struct vnode *vp)
2318 vputx(vp, VPUTX_VPUT);
2322 * Release an exclusively locked vnode. Do not unlock the vnode lock.
2325 vunref(struct vnode *vp)
2328 vputx(vp, VPUTX_VUNREF);
2332 * Somebody doesn't want the vnode recycled.
2335 vhold(struct vnode *vp)
2344 * Increase the hold count and activate if this is the first reference.
2347 vholdl(struct vnode *vp)
2351 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2353 if (!VSHOULDBUSY(vp))
2355 ASSERT_VI_LOCKED(vp, "vholdl");
2356 VNASSERT((vp->v_iflag & VI_FREE) != 0, vp, ("vnode not free"));
2357 VNASSERT(vp->v_op != NULL, vp, ("vholdl: vnode already reclaimed."));
2359 * Remove a vnode from the free list, mark it as in use,
2360 * and put it on the active list.
2362 mtx_lock(&vnode_free_list_mtx);
2363 TAILQ_REMOVE(&vnode_free_list, vp, v_actfreelist);
2365 vp->v_iflag &= ~(VI_FREE|VI_AGE);
2366 KASSERT((vp->v_iflag & VI_ACTIVE) == 0,
2367 ("Activating already active vnode"));
2368 vp->v_iflag |= VI_ACTIVE;
2370 TAILQ_INSERT_HEAD(&mp->mnt_activevnodelist, vp, v_actfreelist);
2371 mp->mnt_activevnodelistsize++;
2372 mtx_unlock(&vnode_free_list_mtx);
2376 * Note that there is one less who cares about this vnode.
2377 * vdrop() is the opposite of vhold().
2380 vdrop(struct vnode *vp)
2388 * Drop the hold count of the vnode. If this is the last reference to
2389 * the vnode we place it on the free list unless it has been vgone'd
2390 * (marked VI_DOOMED) in which case we will free it.
2393 vdropl(struct vnode *vp)
2399 ASSERT_VI_LOCKED(vp, "vdropl");
2400 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2401 if (vp->v_holdcnt <= 0)
2402 panic("vdrop: holdcnt %d", vp->v_holdcnt);
2404 if (vp->v_holdcnt > 0) {
2408 if ((vp->v_iflag & VI_DOOMED) == 0) {
2410 * Mark a vnode as free: remove it from its active list
2411 * and put it up for recycling on the freelist.
2413 VNASSERT(vp->v_op != NULL, vp,
2414 ("vdropl: vnode already reclaimed."));
2415 VNASSERT((vp->v_iflag & VI_FREE) == 0, vp,
2416 ("vnode already free"));
2417 VNASSERT(VSHOULDFREE(vp), vp,
2418 ("vdropl: freeing when we shouldn't"));
2419 active = vp->v_iflag & VI_ACTIVE;
2420 vp->v_iflag &= ~VI_ACTIVE;
2422 mtx_lock(&vnode_free_list_mtx);
2424 TAILQ_REMOVE(&mp->mnt_activevnodelist, vp,
2426 mp->mnt_activevnodelistsize--;
2428 if (vp->v_iflag & VI_AGE) {
2429 TAILQ_INSERT_HEAD(&vnode_free_list, vp, v_actfreelist);
2431 TAILQ_INSERT_TAIL(&vnode_free_list, vp, v_actfreelist);
2434 vp->v_iflag &= ~VI_AGE;
2435 vp->v_iflag |= VI_FREE;
2436 mtx_unlock(&vnode_free_list_mtx);
2441 * The vnode has been marked for destruction, so free it.
2443 CTR2(KTR_VFS, "%s: destroying the vnode %p", __func__, vp);
2444 mtx_lock(&vnode_free_list_mtx);
2446 mtx_unlock(&vnode_free_list_mtx);
2448 VNASSERT((vp->v_iflag & VI_FREE) == 0, vp,
2449 ("cleaned vnode still on the free list."));
2450 VNASSERT(vp->v_data == NULL, vp, ("cleaned vnode isn't"));
2451 VNASSERT(vp->v_holdcnt == 0, vp, ("Non-zero hold count"));
2452 VNASSERT(vp->v_usecount == 0, vp, ("Non-zero use count"));
2453 VNASSERT(vp->v_writecount == 0, vp, ("Non-zero write count"));
2454 VNASSERT(bo->bo_numoutput == 0, vp, ("Clean vnode has pending I/O's"));
2455 VNASSERT(bo->bo_clean.bv_cnt == 0, vp, ("cleanbufcnt not 0"));
2456 VNASSERT(bo->bo_clean.bv_root == NULL, vp, ("cleanblkroot not NULL"));
2457 VNASSERT(bo->bo_dirty.bv_cnt == 0, vp, ("dirtybufcnt not 0"));
2458 VNASSERT(bo->bo_dirty.bv_root == NULL, vp, ("dirtyblkroot not NULL"));
2459 VNASSERT(TAILQ_EMPTY(&vp->v_cache_dst), vp, ("vp has namecache dst"));
2460 VNASSERT(LIST_EMPTY(&vp->v_cache_src), vp, ("vp has namecache src"));
2461 VNASSERT(vp->v_cache_dd == NULL, vp, ("vp has namecache for .."));
2464 mac_vnode_destroy(vp);
2466 if (vp->v_pollinfo != NULL)
2467 destroy_vpollinfo(vp->v_pollinfo);
2469 /* XXX Elsewhere we detect an already freed vnode via NULL v_op. */
2472 rangelock_destroy(&vp->v_rl);
2473 lockdestroy(vp->v_vnlock);
2474 mtx_destroy(&vp->v_interlock);
2475 mtx_destroy(BO_MTX(bo));
2476 uma_zfree(vnode_zone, vp);
2480 * Call VOP_INACTIVE on the vnode and manage the DOINGINACT and OWEINACT
2481 * flags. DOINGINACT prevents us from recursing in calls to vinactive.
2482 * OWEINACT tracks whether a vnode missed a call to inactive due to a
2483 * failed lock upgrade.
2486 vinactive(struct vnode *vp, struct thread *td)
2488 struct vm_object *obj;
2490 ASSERT_VOP_ELOCKED(vp, "vinactive");
2491 ASSERT_VI_LOCKED(vp, "vinactive");
2492 VNASSERT((vp->v_iflag & VI_DOINGINACT) == 0, vp,
2493 ("vinactive: recursed on VI_DOINGINACT"));
2494 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2495 vp->v_iflag |= VI_DOINGINACT;
2496 vp->v_iflag &= ~VI_OWEINACT;
2499 * Before moving off the active list, we must be sure that any
2500 * modified pages are on the vnode's dirty list since these will
2501 * no longer be checked once the vnode is on the inactive list.
2504 if (obj != NULL && (obj->flags & OBJ_MIGHTBEDIRTY) != 0) {
2505 VM_OBJECT_LOCK(obj);
2506 vm_object_page_clean(obj, 0, 0, OBJPC_NOSYNC);
2507 VM_OBJECT_UNLOCK(obj);
2509 VOP_INACTIVE(vp, td);
2511 VNASSERT(vp->v_iflag & VI_DOINGINACT, vp,
2512 ("vinactive: lost VI_DOINGINACT"));
2513 vp->v_iflag &= ~VI_DOINGINACT;
2517 * Remove any vnodes in the vnode table belonging to mount point mp.
2519 * If FORCECLOSE is not specified, there should not be any active ones,
2520 * return error if any are found (nb: this is a user error, not a
2521 * system error). If FORCECLOSE is specified, detach any active vnodes
2524 * If WRITECLOSE is set, only flush out regular file vnodes open for
2527 * SKIPSYSTEM causes any vnodes marked VV_SYSTEM to be skipped.
2529 * `rootrefs' specifies the base reference count for the root vnode
2530 * of this filesystem. The root vnode is considered busy if its
2531 * v_usecount exceeds this value. On a successful return, vflush(, td)
2532 * will call vrele() on the root vnode exactly rootrefs times.
2533 * If the SKIPSYSTEM or WRITECLOSE flags are specified, rootrefs must
2537 static int busyprt = 0; /* print out busy vnodes */
2538 SYSCTL_INT(_debug, OID_AUTO, busyprt, CTLFLAG_RW, &busyprt, 0, "Print out busy vnodes");
2542 vflush(struct mount *mp, int rootrefs, int flags, struct thread *td)
2544 struct vnode *vp, *mvp, *rootvp = NULL;
2546 int busy = 0, error;
2548 CTR4(KTR_VFS, "%s: mp %p with rootrefs %d and flags %d", __func__, mp,
2551 KASSERT((flags & (SKIPSYSTEM | WRITECLOSE)) == 0,
2552 ("vflush: bad args"));
2554 * Get the filesystem root vnode. We can vput() it
2555 * immediately, since with rootrefs > 0, it won't go away.
2557 if ((error = VFS_ROOT(mp, LK_EXCLUSIVE, &rootvp)) != 0) {
2558 CTR2(KTR_VFS, "%s: vfs_root lookup failed with %d",
2565 MNT_VNODE_FOREACH_ALL(vp, mp, mvp) {
2567 error = vn_lock(vp, LK_INTERLOCK | LK_EXCLUSIVE);
2570 MNT_VNODE_FOREACH_ALL_ABORT(mp, mvp);
2574 * Skip over a vnodes marked VV_SYSTEM.
2576 if ((flags & SKIPSYSTEM) && (vp->v_vflag & VV_SYSTEM)) {
2582 * If WRITECLOSE is set, flush out unlinked but still open
2583 * files (even if open only for reading) and regular file
2584 * vnodes open for writing.
2586 if (flags & WRITECLOSE) {
2587 if (vp->v_object != NULL) {
2588 VM_OBJECT_LOCK(vp->v_object);
2589 vm_object_page_clean(vp->v_object, 0, 0, 0);
2590 VM_OBJECT_UNLOCK(vp->v_object);
2592 error = VOP_FSYNC(vp, MNT_WAIT, td);
2596 MNT_VNODE_FOREACH_ALL_ABORT(mp, mvp);
2599 error = VOP_GETATTR(vp, &vattr, td->td_ucred);
2602 if ((vp->v_type == VNON ||
2603 (error == 0 && vattr.va_nlink > 0)) &&
2604 (vp->v_writecount == 0 || vp->v_type != VREG)) {
2612 * With v_usecount == 0, all we need to do is clear out the
2613 * vnode data structures and we are done.
2615 * If FORCECLOSE is set, forcibly close the vnode.
2617 if (vp->v_usecount == 0 || (flags & FORCECLOSE)) {
2618 VNASSERT(vp->v_usecount == 0 ||
2619 (vp->v_type != VCHR && vp->v_type != VBLK), vp,
2620 ("device VNODE %p is FORCECLOSED", vp));
2626 vprint("vflush: busy vnode", vp);
2632 if (rootrefs > 0 && (flags & FORCECLOSE) == 0) {
2634 * If just the root vnode is busy, and if its refcount
2635 * is equal to `rootrefs', then go ahead and kill it.
2638 KASSERT(busy > 0, ("vflush: not busy"));
2639 VNASSERT(rootvp->v_usecount >= rootrefs, rootvp,
2640 ("vflush: usecount %d < rootrefs %d",
2641 rootvp->v_usecount, rootrefs));
2642 if (busy == 1 && rootvp->v_usecount == rootrefs) {
2643 VOP_LOCK(rootvp, LK_EXCLUSIVE|LK_INTERLOCK);
2645 VOP_UNLOCK(rootvp, 0);
2651 CTR2(KTR_VFS, "%s: failing as %d vnodes are busy", __func__,
2655 for (; rootrefs > 0; rootrefs--)
2661 * Recycle an unused vnode to the front of the free list.
2664 vrecycle(struct vnode *vp, struct thread *td)
2668 ASSERT_VOP_ELOCKED(vp, "vrecycle");
2669 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2672 if (vp->v_usecount == 0) {
2681 * Eliminate all activity associated with a vnode
2682 * in preparation for reuse.
2685 vgone(struct vnode *vp)
2693 * vgone, with the vp interlock held.
2696 vgonel(struct vnode *vp)
2703 ASSERT_VOP_ELOCKED(vp, "vgonel");
2704 ASSERT_VI_LOCKED(vp, "vgonel");
2705 VNASSERT(vp->v_holdcnt, vp,
2706 ("vgonel: vp %p has no reference.", vp));
2707 CTR2(KTR_VFS, "%s: vp %p", __func__, vp);
2711 * Don't vgonel if we're already doomed.
2713 if (vp->v_iflag & VI_DOOMED)
2715 vp->v_iflag |= VI_DOOMED;
2717 * Check to see if the vnode is in use. If so, we have to call
2718 * VOP_CLOSE() and VOP_INACTIVE().
2720 active = vp->v_usecount;
2721 oweinact = (vp->v_iflag & VI_OWEINACT);
2724 * Clean out any buffers associated with the vnode.
2725 * If the flush fails, just toss the buffers.
2728 if (!TAILQ_EMPTY(&vp->v_bufobj.bo_dirty.bv_hd))
2729 (void) vn_start_secondary_write(vp, &mp, V_WAIT);
2730 if (vinvalbuf(vp, V_SAVE, 0, 0) != 0)
2731 vinvalbuf(vp, 0, 0, 0);
2734 * If purging an active vnode, it must be closed and
2735 * deactivated before being reclaimed.
2738 VOP_CLOSE(vp, FNONBLOCK, NOCRED, td);
2739 if (oweinact || active) {
2741 if ((vp->v_iflag & VI_DOINGINACT) == 0)
2745 if (vp->v_type == VSOCK)
2746 vfs_unp_reclaim(vp);
2748 * Reclaim the vnode.
2750 if (VOP_RECLAIM(vp, td))
2751 panic("vgone: cannot reclaim");
2753 vn_finished_secondary_write(mp);
2754 VNASSERT(vp->v_object == NULL, vp,
2755 ("vop_reclaim left v_object vp=%p, tag=%s", vp, vp->v_tag));
2757 * Clear the advisory locks and wake up waiting threads.
2759 (void)VOP_ADVLOCKPURGE(vp);
2761 * Delete from old mount point vnode list.
2766 * Done with purge, reset to the standard lock and invalidate
2770 vp->v_vnlock = &vp->v_lock;
2771 vp->v_op = &dead_vnodeops;
2777 * Calculate the total number of references to a special device.
2780 vcount(struct vnode *vp)
2785 count = vp->v_rdev->si_usecount;
2791 * Same as above, but using the struct cdev *as argument
2794 count_dev(struct cdev *dev)
2799 count = dev->si_usecount;
2805 * Print out a description of a vnode.
2807 static char *typename[] =
2808 {"VNON", "VREG", "VDIR", "VBLK", "VCHR", "VLNK", "VSOCK", "VFIFO", "VBAD",
2812 vn_printf(struct vnode *vp, const char *fmt, ...)
2815 char buf[256], buf2[16];
2821 printf("%p: ", (void *)vp);
2822 printf("tag %s, type %s\n", vp->v_tag, typename[vp->v_type]);
2823 printf(" usecount %d, writecount %d, refcount %d mountedhere %p\n",
2824 vp->v_usecount, vp->v_writecount, vp->v_holdcnt, vp->v_mountedhere);
2827 if (vp->v_vflag & VV_ROOT)
2828 strlcat(buf, "|VV_ROOT", sizeof(buf));
2829 if (vp->v_vflag & VV_ISTTY)
2830 strlcat(buf, "|VV_ISTTY", sizeof(buf));
2831 if (vp->v_vflag & VV_NOSYNC)
2832 strlcat(buf, "|VV_NOSYNC", sizeof(buf));
2833 if (vp->v_vflag & VV_CACHEDLABEL)
2834 strlcat(buf, "|VV_CACHEDLABEL", sizeof(buf));
2835 if (vp->v_vflag & VV_TEXT)
2836 strlcat(buf, "|VV_TEXT", sizeof(buf));
2837 if (vp->v_vflag & VV_COPYONWRITE)
2838 strlcat(buf, "|VV_COPYONWRITE", sizeof(buf));
2839 if (vp->v_vflag & VV_SYSTEM)
2840 strlcat(buf, "|VV_SYSTEM", sizeof(buf));
2841 if (vp->v_vflag & VV_PROCDEP)
2842 strlcat(buf, "|VV_PROCDEP", sizeof(buf));
2843 if (vp->v_vflag & VV_NOKNOTE)
2844 strlcat(buf, "|VV_NOKNOTE", sizeof(buf));
2845 if (vp->v_vflag & VV_DELETED)
2846 strlcat(buf, "|VV_DELETED", sizeof(buf));
2847 if (vp->v_vflag & VV_MD)
2848 strlcat(buf, "|VV_MD", sizeof(buf));
2849 flags = vp->v_vflag & ~(VV_ROOT | VV_ISTTY | VV_NOSYNC |
2850 VV_CACHEDLABEL | VV_TEXT | VV_COPYONWRITE | VV_SYSTEM | VV_PROCDEP |
2851 VV_NOKNOTE | VV_DELETED | VV_MD);
2853 snprintf(buf2, sizeof(buf2), "|VV(0x%lx)", flags);
2854 strlcat(buf, buf2, sizeof(buf));
2856 if (vp->v_iflag & VI_MOUNT)
2857 strlcat(buf, "|VI_MOUNT", sizeof(buf));
2858 if (vp->v_iflag & VI_AGE)
2859 strlcat(buf, "|VI_AGE", sizeof(buf));
2860 if (vp->v_iflag & VI_DOOMED)
2861 strlcat(buf, "|VI_DOOMED", sizeof(buf));
2862 if (vp->v_iflag & VI_FREE)
2863 strlcat(buf, "|VI_FREE", sizeof(buf));
2864 if (vp->v_iflag & VI_DOINGINACT)
2865 strlcat(buf, "|VI_DOINGINACT", sizeof(buf));
2866 if (vp->v_iflag & VI_OWEINACT)
2867 strlcat(buf, "|VI_OWEINACT", sizeof(buf));
2868 flags = vp->v_iflag & ~(VI_MOUNT | VI_AGE | VI_DOOMED | VI_FREE |
2869 VI_DOINGINACT | VI_OWEINACT);
2871 snprintf(buf2, sizeof(buf2), "|VI(0x%lx)", flags);
2872 strlcat(buf, buf2, sizeof(buf));
2874 printf(" flags (%s)\n", buf + 1);
2875 if (mtx_owned(VI_MTX(vp)))
2876 printf(" VI_LOCKed");
2877 if (vp->v_object != NULL)
2878 printf(" v_object %p ref %d pages %d\n",
2879 vp->v_object, vp->v_object->ref_count,
2880 vp->v_object->resident_page_count);
2882 lockmgr_printinfo(vp->v_vnlock);
2883 if (vp->v_data != NULL)
2889 * List all of the locked vnodes in the system.
2890 * Called when debugging the kernel.
2892 DB_SHOW_COMMAND(lockedvnods, lockedvnodes)
2894 struct mount *mp, *nmp;
2898 * Note: because this is DDB, we can't obey the locking semantics
2899 * for these structures, which means we could catch an inconsistent
2900 * state and dereference a nasty pointer. Not much to be done
2903 db_printf("Locked vnodes\n");
2904 for (mp = TAILQ_FIRST(&mountlist); mp != NULL; mp = nmp) {
2905 nmp = TAILQ_NEXT(mp, mnt_list);
2906 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
2907 if (vp->v_type != VMARKER &&
2911 nmp = TAILQ_NEXT(mp, mnt_list);
2916 * Show details about the given vnode.
2918 DB_SHOW_COMMAND(vnode, db_show_vnode)
2924 vp = (struct vnode *)addr;
2925 vn_printf(vp, "vnode ");
2929 * Show details about the given mount point.
2931 DB_SHOW_COMMAND(mount, db_show_mount)
2942 /* No address given, print short info about all mount points. */
2943 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
2944 db_printf("%p %s on %s (%s)\n", mp,
2945 mp->mnt_stat.f_mntfromname,
2946 mp->mnt_stat.f_mntonname,
2947 mp->mnt_stat.f_fstypename);
2951 db_printf("\nMore info: show mount <addr>\n");
2955 mp = (struct mount *)addr;
2956 db_printf("%p %s on %s (%s)\n", mp, mp->mnt_stat.f_mntfromname,
2957 mp->mnt_stat.f_mntonname, mp->mnt_stat.f_fstypename);
2960 mflags = mp->mnt_flag;
2961 #define MNT_FLAG(flag) do { \
2962 if (mflags & (flag)) { \
2963 if (buf[0] != '\0') \
2964 strlcat(buf, ", ", sizeof(buf)); \
2965 strlcat(buf, (#flag) + 4, sizeof(buf)); \
2966 mflags &= ~(flag); \
2969 MNT_FLAG(MNT_RDONLY);
2970 MNT_FLAG(MNT_SYNCHRONOUS);
2971 MNT_FLAG(MNT_NOEXEC);
2972 MNT_FLAG(MNT_NOSUID);
2973 MNT_FLAG(MNT_UNION);
2974 MNT_FLAG(MNT_ASYNC);
2975 MNT_FLAG(MNT_SUIDDIR);
2976 MNT_FLAG(MNT_SOFTDEP);
2978 MNT_FLAG(MNT_NOSYMFOLLOW);
2979 MNT_FLAG(MNT_GJOURNAL);
2980 MNT_FLAG(MNT_MULTILABEL);
2982 MNT_FLAG(MNT_NOATIME);
2983 MNT_FLAG(MNT_NOCLUSTERR);
2984 MNT_FLAG(MNT_NOCLUSTERW);
2985 MNT_FLAG(MNT_NFS4ACLS);
2986 MNT_FLAG(MNT_EXRDONLY);
2987 MNT_FLAG(MNT_EXPORTED);
2988 MNT_FLAG(MNT_DEFEXPORTED);
2989 MNT_FLAG(MNT_EXPORTANON);
2990 MNT_FLAG(MNT_EXKERB);
2991 MNT_FLAG(MNT_EXPUBLIC);
2992 MNT_FLAG(MNT_LOCAL);
2993 MNT_FLAG(MNT_QUOTA);
2994 MNT_FLAG(MNT_ROOTFS);
2996 MNT_FLAG(MNT_IGNORE);
2997 MNT_FLAG(MNT_UPDATE);
2998 MNT_FLAG(MNT_DELEXPORT);
2999 MNT_FLAG(MNT_RELOAD);
3000 MNT_FLAG(MNT_FORCE);
3001 MNT_FLAG(MNT_SNAPSHOT);
3002 MNT_FLAG(MNT_BYFSID);
3006 strlcat(buf, ", ", sizeof(buf));
3007 snprintf(buf + strlen(buf), sizeof(buf) - strlen(buf),
3008 "0x%016jx", mflags);
3010 db_printf(" mnt_flag = %s\n", buf);
3013 flags = mp->mnt_kern_flag;
3014 #define MNT_KERN_FLAG(flag) do { \
3015 if (flags & (flag)) { \
3016 if (buf[0] != '\0') \
3017 strlcat(buf, ", ", sizeof(buf)); \
3018 strlcat(buf, (#flag) + 5, sizeof(buf)); \
3022 MNT_KERN_FLAG(MNTK_UNMOUNTF);
3023 MNT_KERN_FLAG(MNTK_ASYNC);
3024 MNT_KERN_FLAG(MNTK_SOFTDEP);
3025 MNT_KERN_FLAG(MNTK_NOINSMNTQ);
3026 MNT_KERN_FLAG(MNTK_DRAINING);
3027 MNT_KERN_FLAG(MNTK_REFEXPIRE);
3028 MNT_KERN_FLAG(MNTK_EXTENDED_SHARED);
3029 MNT_KERN_FLAG(MNTK_SHARED_WRITES);
3030 MNT_KERN_FLAG(MNTK_NOASYNC);
3031 MNT_KERN_FLAG(MNTK_UNMOUNT);
3032 MNT_KERN_FLAG(MNTK_MWAIT);
3033 MNT_KERN_FLAG(MNTK_SUSPEND);
3034 MNT_KERN_FLAG(MNTK_SUSPEND2);
3035 MNT_KERN_FLAG(MNTK_SUSPENDED);
3036 MNT_KERN_FLAG(MNTK_MPSAFE);
3037 MNT_KERN_FLAG(MNTK_LOOKUP_SHARED);
3038 MNT_KERN_FLAG(MNTK_NOKNOTE);
3039 #undef MNT_KERN_FLAG
3042 strlcat(buf, ", ", sizeof(buf));
3043 snprintf(buf + strlen(buf), sizeof(buf) - strlen(buf),
3046 db_printf(" mnt_kern_flag = %s\n", buf);
3048 db_printf(" mnt_opt = ");
3049 opt = TAILQ_FIRST(mp->mnt_opt);
3051 db_printf("%s", opt->name);
3052 opt = TAILQ_NEXT(opt, link);
3053 while (opt != NULL) {
3054 db_printf(", %s", opt->name);
3055 opt = TAILQ_NEXT(opt, link);
3061 db_printf(" mnt_stat = { version=%u type=%u flags=0x%016jx "
3062 "bsize=%ju iosize=%ju blocks=%ju bfree=%ju bavail=%jd files=%ju "
3063 "ffree=%jd syncwrites=%ju asyncwrites=%ju syncreads=%ju "
3064 "asyncreads=%ju namemax=%u owner=%u fsid=[%d, %d] }\n",
3065 (u_int)sp->f_version, (u_int)sp->f_type, (uintmax_t)sp->f_flags,
3066 (uintmax_t)sp->f_bsize, (uintmax_t)sp->f_iosize,
3067 (uintmax_t)sp->f_blocks, (uintmax_t)sp->f_bfree,
3068 (intmax_t)sp->f_bavail, (uintmax_t)sp->f_files,
3069 (intmax_t)sp->f_ffree, (uintmax_t)sp->f_syncwrites,
3070 (uintmax_t)sp->f_asyncwrites, (uintmax_t)sp->f_syncreads,
3071 (uintmax_t)sp->f_asyncreads, (u_int)sp->f_namemax,
3072 (u_int)sp->f_owner, (int)sp->f_fsid.val[0], (int)sp->f_fsid.val[1]);
3074 db_printf(" mnt_cred = { uid=%u ruid=%u",
3075 (u_int)mp->mnt_cred->cr_uid, (u_int)mp->mnt_cred->cr_ruid);
3076 if (jailed(mp->mnt_cred))
3077 db_printf(", jail=%d", mp->mnt_cred->cr_prison->pr_id);
3079 db_printf(" mnt_ref = %d\n", mp->mnt_ref);
3080 db_printf(" mnt_gen = %d\n", mp->mnt_gen);
3081 db_printf(" mnt_nvnodelistsize = %d\n", mp->mnt_nvnodelistsize);
3082 db_printf(" mnt_activevnodelistsize = %d\n",
3083 mp->mnt_activevnodelistsize);
3084 db_printf(" mnt_writeopcount = %d\n", mp->mnt_writeopcount);
3085 db_printf(" mnt_maxsymlinklen = %d\n", mp->mnt_maxsymlinklen);
3086 db_printf(" mnt_iosize_max = %d\n", mp->mnt_iosize_max);
3087 db_printf(" mnt_hashseed = %u\n", mp->mnt_hashseed);
3088 db_printf(" mnt_secondary_writes = %d\n", mp->mnt_secondary_writes);
3089 db_printf(" mnt_secondary_accwrites = %d\n",
3090 mp->mnt_secondary_accwrites);
3091 db_printf(" mnt_gjprovider = %s\n",
3092 mp->mnt_gjprovider != NULL ? mp->mnt_gjprovider : "NULL");
3094 db_printf("\n\nList of active vnodes\n");
3095 TAILQ_FOREACH(vp, &mp->mnt_activevnodelist, v_actfreelist) {
3096 if (vp->v_type != VMARKER) {
3097 vn_printf(vp, "vnode ");
3102 db_printf("\n\nList of inactive vnodes\n");
3103 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
3104 if (vp->v_type != VMARKER && (vp->v_iflag & VI_ACTIVE) == 0) {
3105 vn_printf(vp, "vnode ");
3114 * Fill in a struct xvfsconf based on a struct vfsconf.
3117 vfsconf2x(struct sysctl_req *req, struct vfsconf *vfsp)
3119 struct xvfsconf xvfsp;
3121 bzero(&xvfsp, sizeof(xvfsp));
3122 strcpy(xvfsp.vfc_name, vfsp->vfc_name);
3123 xvfsp.vfc_typenum = vfsp->vfc_typenum;
3124 xvfsp.vfc_refcount = vfsp->vfc_refcount;
3125 xvfsp.vfc_flags = vfsp->vfc_flags;
3127 * These are unused in userland, we keep them
3128 * to not break binary compatibility.
3130 xvfsp.vfc_vfsops = NULL;
3131 xvfsp.vfc_next = NULL;
3132 return (SYSCTL_OUT(req, &xvfsp, sizeof(xvfsp)));
3135 #ifdef COMPAT_FREEBSD32
3137 uint32_t vfc_vfsops;
3138 char vfc_name[MFSNAMELEN];
3139 int32_t vfc_typenum;
3140 int32_t vfc_refcount;
3146 vfsconf2x32(struct sysctl_req *req, struct vfsconf *vfsp)
3148 struct xvfsconf32 xvfsp;
3150 strcpy(xvfsp.vfc_name, vfsp->vfc_name);
3151 xvfsp.vfc_typenum = vfsp->vfc_typenum;
3152 xvfsp.vfc_refcount = vfsp->vfc_refcount;
3153 xvfsp.vfc_flags = vfsp->vfc_flags;
3154 xvfsp.vfc_vfsops = 0;
3156 return (SYSCTL_OUT(req, &xvfsp, sizeof(xvfsp)));
3161 * Top level filesystem related information gathering.
3164 sysctl_vfs_conflist(SYSCTL_HANDLER_ARGS)
3166 struct vfsconf *vfsp;
3170 TAILQ_FOREACH(vfsp, &vfsconf, vfc_list) {
3171 #ifdef COMPAT_FREEBSD32
3172 if (req->flags & SCTL_MASK32)
3173 error = vfsconf2x32(req, vfsp);
3176 error = vfsconf2x(req, vfsp);
3183 SYSCTL_PROC(_vfs, OID_AUTO, conflist, CTLTYPE_OPAQUE | CTLFLAG_RD,
3184 NULL, 0, sysctl_vfs_conflist,
3185 "S,xvfsconf", "List of all configured filesystems");
3187 #ifndef BURN_BRIDGES
3188 static int sysctl_ovfs_conf(SYSCTL_HANDLER_ARGS);
3191 vfs_sysctl(SYSCTL_HANDLER_ARGS)
3193 int *name = (int *)arg1 - 1; /* XXX */
3194 u_int namelen = arg2 + 1; /* XXX */
3195 struct vfsconf *vfsp;
3197 printf("WARNING: userland calling deprecated sysctl, "
3198 "please rebuild world\n");
3200 #if 1 || defined(COMPAT_PRELITE2)
3201 /* Resolve ambiguity between VFS_VFSCONF and VFS_GENERIC. */
3203 return (sysctl_ovfs_conf(oidp, arg1, arg2, req));
3207 case VFS_MAXTYPENUM:
3210 return (SYSCTL_OUT(req, &maxvfsconf, sizeof(int)));
3213 return (ENOTDIR); /* overloaded */
3214 TAILQ_FOREACH(vfsp, &vfsconf, vfc_list)
3215 if (vfsp->vfc_typenum == name[2])
3218 return (EOPNOTSUPP);
3219 #ifdef COMPAT_FREEBSD32
3220 if (req->flags & SCTL_MASK32)
3221 return (vfsconf2x32(req, vfsp));
3224 return (vfsconf2x(req, vfsp));
3226 return (EOPNOTSUPP);
3229 static SYSCTL_NODE(_vfs, VFS_GENERIC, generic, CTLFLAG_RD | CTLFLAG_SKIP,
3230 vfs_sysctl, "Generic filesystem");
3232 #if 1 || defined(COMPAT_PRELITE2)
3235 sysctl_ovfs_conf(SYSCTL_HANDLER_ARGS)
3238 struct vfsconf *vfsp;
3239 struct ovfsconf ovfs;
3241 TAILQ_FOREACH(vfsp, &vfsconf, vfc_list) {
3242 bzero(&ovfs, sizeof(ovfs));
3243 ovfs.vfc_vfsops = vfsp->vfc_vfsops; /* XXX used as flag */
3244 strcpy(ovfs.vfc_name, vfsp->vfc_name);
3245 ovfs.vfc_index = vfsp->vfc_typenum;
3246 ovfs.vfc_refcount = vfsp->vfc_refcount;
3247 ovfs.vfc_flags = vfsp->vfc_flags;
3248 error = SYSCTL_OUT(req, &ovfs, sizeof ovfs);
3255 #endif /* 1 || COMPAT_PRELITE2 */
3256 #endif /* !BURN_BRIDGES */
3258 #define KINFO_VNODESLOP 10
3261 * Dump vnode list (via sysctl).
3265 sysctl_vnode(SYSCTL_HANDLER_ARGS)
3273 * Stale numvnodes access is not fatal here.
3276 len = (numvnodes + KINFO_VNODESLOP) * sizeof *xvn;
3278 /* Make an estimate */
3279 return (SYSCTL_OUT(req, 0, len));
3281 error = sysctl_wire_old_buffer(req, 0);
3284 xvn = malloc(len, M_TEMP, M_ZERO | M_WAITOK);
3286 mtx_lock(&mountlist_mtx);
3287 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
3288 if (vfs_busy(mp, MBF_NOWAIT | MBF_MNTLSTLOCK))
3291 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
3295 xvn[n].xv_size = sizeof *xvn;
3296 xvn[n].xv_vnode = vp;
3297 xvn[n].xv_id = 0; /* XXX compat */
3298 #define XV_COPY(field) xvn[n].xv_##field = vp->v_##field
3300 XV_COPY(writecount);
3306 xvn[n].xv_flag = vp->v_vflag;
3308 switch (vp->v_type) {
3315 if (vp->v_rdev == NULL) {
3319 xvn[n].xv_dev = dev2udev(vp->v_rdev);
3322 xvn[n].xv_socket = vp->v_socket;
3325 xvn[n].xv_fifo = vp->v_fifoinfo;
3330 /* shouldn't happen? */
3338 mtx_lock(&mountlist_mtx);
3343 mtx_unlock(&mountlist_mtx);
3345 error = SYSCTL_OUT(req, xvn, n * sizeof *xvn);
3350 SYSCTL_PROC(_kern, KERN_VNODE, vnode, CTLTYPE_OPAQUE|CTLFLAG_RD,
3351 0, 0, sysctl_vnode, "S,xvnode", "");
3355 * Unmount all filesystems. The list is traversed in reverse order
3356 * of mounting to avoid dependencies.
3359 vfs_unmountall(void)
3365 KASSERT(curthread != NULL, ("vfs_unmountall: NULL curthread"));
3366 CTR1(KTR_VFS, "%s: unmounting all filesystems", __func__);
3370 * Since this only runs when rebooting, it is not interlocked.
3372 while(!TAILQ_EMPTY(&mountlist)) {
3373 mp = TAILQ_LAST(&mountlist, mntlist);
3374 error = dounmount(mp, MNT_FORCE, td);
3376 TAILQ_REMOVE(&mountlist, mp, mnt_list);
3378 * XXX: Due to the way in which we mount the root
3379 * file system off of devfs, devfs will generate a
3380 * "busy" warning when we try to unmount it before
3381 * the root. Don't print a warning as a result in
3382 * order to avoid false positive errors that may
3383 * cause needless upset.
3385 if (strcmp(mp->mnt_vfc->vfc_name, "devfs") != 0) {
3386 printf("unmount of %s failed (",
3387 mp->mnt_stat.f_mntonname);
3391 printf("%d)\n", error);
3394 /* The unmount has removed mp from the mountlist */
3400 * perform msync on all vnodes under a mount point
3401 * the mount point must be locked.
3404 vfs_msync(struct mount *mp, int flags)
3406 struct vnode *vp, *mvp;
3407 struct vm_object *obj;
3409 CTR2(KTR_VFS, "%s: mp %p", __func__, mp);
3410 MNT_VNODE_FOREACH_ACTIVE(vp, mp, mvp) {
3412 if (obj != NULL && (obj->flags & OBJ_MIGHTBEDIRTY) != 0 &&
3413 (flags == MNT_WAIT || VOP_ISLOCKED(vp) == 0)) {
3415 LK_EXCLUSIVE | LK_RETRY | LK_INTERLOCK,
3417 if (vp->v_vflag & VV_NOSYNC) { /* unlinked */
3424 VM_OBJECT_LOCK(obj);
3425 vm_object_page_clean(obj, 0, 0,
3427 OBJPC_SYNC : OBJPC_NOSYNC);
3428 VM_OBJECT_UNLOCK(obj);
3438 destroy_vpollinfo(struct vpollinfo *vi)
3440 seldrain(&vi->vpi_selinfo);
3441 knlist_destroy(&vi->vpi_selinfo.si_note);
3442 mtx_destroy(&vi->vpi_lock);
3443 uma_zfree(vnodepoll_zone, vi);
3447 * Initalize per-vnode helper structure to hold poll-related state.
3450 v_addpollinfo(struct vnode *vp)
3452 struct vpollinfo *vi;
3454 if (vp->v_pollinfo != NULL)
3456 vi = uma_zalloc(vnodepoll_zone, M_WAITOK);
3457 mtx_init(&vi->vpi_lock, "vnode pollinfo", NULL, MTX_DEF);
3458 knlist_init(&vi->vpi_selinfo.si_note, vp, vfs_knllock,
3459 vfs_knlunlock, vfs_knl_assert_locked, vfs_knl_assert_unlocked);
3461 if (vp->v_pollinfo != NULL) {
3463 destroy_vpollinfo(vi);
3466 vp->v_pollinfo = vi;
3471 * Record a process's interest in events which might happen to
3472 * a vnode. Because poll uses the historic select-style interface
3473 * internally, this routine serves as both the ``check for any
3474 * pending events'' and the ``record my interest in future events''
3475 * functions. (These are done together, while the lock is held,
3476 * to avoid race conditions.)
3479 vn_pollrecord(struct vnode *vp, struct thread *td, int events)
3483 mtx_lock(&vp->v_pollinfo->vpi_lock);
3484 if (vp->v_pollinfo->vpi_revents & events) {
3486 * This leaves events we are not interested
3487 * in available for the other process which
3488 * which presumably had requested them
3489 * (otherwise they would never have been
3492 events &= vp->v_pollinfo->vpi_revents;
3493 vp->v_pollinfo->vpi_revents &= ~events;
3495 mtx_unlock(&vp->v_pollinfo->vpi_lock);
3498 vp->v_pollinfo->vpi_events |= events;
3499 selrecord(td, &vp->v_pollinfo->vpi_selinfo);
3500 mtx_unlock(&vp->v_pollinfo->vpi_lock);
3505 * Routine to create and manage a filesystem syncer vnode.
3507 #define sync_close ((int (*)(struct vop_close_args *))nullop)
3508 static int sync_fsync(struct vop_fsync_args *);
3509 static int sync_inactive(struct vop_inactive_args *);
3510 static int sync_reclaim(struct vop_reclaim_args *);
3512 static struct vop_vector sync_vnodeops = {
3513 .vop_bypass = VOP_EOPNOTSUPP,
3514 .vop_close = sync_close, /* close */
3515 .vop_fsync = sync_fsync, /* fsync */
3516 .vop_inactive = sync_inactive, /* inactive */
3517 .vop_reclaim = sync_reclaim, /* reclaim */
3518 .vop_lock1 = vop_stdlock, /* lock */
3519 .vop_unlock = vop_stdunlock, /* unlock */
3520 .vop_islocked = vop_stdislocked, /* islocked */
3524 * Create a new filesystem syncer vnode for the specified mount point.
3527 vfs_allocate_syncvnode(struct mount *mp)
3531 static long start, incr, next;
3534 /* Allocate a new vnode */
3535 error = getnewvnode("syncer", mp, &sync_vnodeops, &vp);
3537 panic("vfs_allocate_syncvnode: getnewvnode() failed");
3539 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
3540 vp->v_vflag |= VV_FORCEINSMQ;
3541 error = insmntque(vp, mp);
3543 panic("vfs_allocate_syncvnode: insmntque() failed");
3544 vp->v_vflag &= ~VV_FORCEINSMQ;
3547 * Place the vnode onto the syncer worklist. We attempt to
3548 * scatter them about on the list so that they will go off
3549 * at evenly distributed times even if all the filesystems
3550 * are mounted at once.
3553 if (next == 0 || next > syncer_maxdelay) {
3557 start = syncer_maxdelay / 2;
3558 incr = syncer_maxdelay;
3564 vn_syncer_add_to_worklist(bo, syncdelay > 0 ? next % syncdelay : 0);
3565 /* XXX - vn_syncer_add_to_worklist() also grabs and drops sync_mtx. */
3566 mtx_lock(&sync_mtx);
3568 if (mp->mnt_syncer == NULL) {
3569 mp->mnt_syncer = vp;
3572 mtx_unlock(&sync_mtx);
3575 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
3582 vfs_deallocate_syncvnode(struct mount *mp)
3586 mtx_lock(&sync_mtx);
3587 vp = mp->mnt_syncer;
3589 mp->mnt_syncer = NULL;
3590 mtx_unlock(&sync_mtx);
3596 * Do a lazy sync of the filesystem.
3599 sync_fsync(struct vop_fsync_args *ap)
3601 struct vnode *syncvp = ap->a_vp;
3602 struct mount *mp = syncvp->v_mount;
3607 * We only need to do something if this is a lazy evaluation.
3609 if (ap->a_waitfor != MNT_LAZY)
3613 * Move ourselves to the back of the sync list.
3615 bo = &syncvp->v_bufobj;
3617 vn_syncer_add_to_worklist(bo, syncdelay);
3621 * Walk the list of vnodes pushing all that are dirty and
3622 * not already on the sync list.
3624 mtx_lock(&mountlist_mtx);
3625 if (vfs_busy(mp, MBF_NOWAIT | MBF_MNTLSTLOCK) != 0) {
3626 mtx_unlock(&mountlist_mtx);
3629 if (vn_start_write(NULL, &mp, V_NOWAIT) != 0) {
3633 save = curthread_pflags_set(TDP_SYNCIO);
3634 vfs_msync(mp, MNT_NOWAIT);
3635 error = VFS_SYNC(mp, MNT_LAZY);
3636 curthread_pflags_restore(save);
3637 vn_finished_write(mp);
3643 * The syncer vnode is no referenced.
3646 sync_inactive(struct vop_inactive_args *ap)
3654 * The syncer vnode is no longer needed and is being decommissioned.
3656 * Modifications to the worklist must be protected by sync_mtx.
3659 sync_reclaim(struct vop_reclaim_args *ap)
3661 struct vnode *vp = ap->a_vp;
3666 mtx_lock(&sync_mtx);
3667 if (vp->v_mount->mnt_syncer == vp)
3668 vp->v_mount->mnt_syncer = NULL;
3669 if (bo->bo_flag & BO_ONWORKLST) {
3670 LIST_REMOVE(bo, bo_synclist);
3671 syncer_worklist_len--;
3673 bo->bo_flag &= ~BO_ONWORKLST;
3675 mtx_unlock(&sync_mtx);
3682 * Check if vnode represents a disk device
3685 vn_isdisk(struct vnode *vp, int *errp)
3691 if (vp->v_type != VCHR)
3693 else if (vp->v_rdev == NULL)
3695 else if (vp->v_rdev->si_devsw == NULL)
3697 else if (!(vp->v_rdev->si_devsw->d_flags & D_DISK))
3702 return (error == 0);
3706 * Common filesystem object access control check routine. Accepts a
3707 * vnode's type, "mode", uid and gid, requested access mode, credentials,
3708 * and optional call-by-reference privused argument allowing vaccess()
3709 * to indicate to the caller whether privilege was used to satisfy the
3710 * request (obsoleted). Returns 0 on success, or an errno on failure.
3713 vaccess(enum vtype type, mode_t file_mode, uid_t file_uid, gid_t file_gid,
3714 accmode_t accmode, struct ucred *cred, int *privused)
3716 accmode_t dac_granted;
3717 accmode_t priv_granted;
3719 KASSERT((accmode & ~(VEXEC | VWRITE | VREAD | VADMIN | VAPPEND)) == 0,
3720 ("invalid bit in accmode"));
3721 KASSERT((accmode & VAPPEND) == 0 || (accmode & VWRITE),
3722 ("VAPPEND without VWRITE"));
3725 * Look for a normal, non-privileged way to access the file/directory
3726 * as requested. If it exists, go with that.
3729 if (privused != NULL)
3734 /* Check the owner. */
3735 if (cred->cr_uid == file_uid) {
3736 dac_granted |= VADMIN;
3737 if (file_mode & S_IXUSR)
3738 dac_granted |= VEXEC;
3739 if (file_mode & S_IRUSR)
3740 dac_granted |= VREAD;
3741 if (file_mode & S_IWUSR)
3742 dac_granted |= (VWRITE | VAPPEND);
3744 if ((accmode & dac_granted) == accmode)
3750 /* Otherwise, check the groups (first match) */
3751 if (groupmember(file_gid, cred)) {
3752 if (file_mode & S_IXGRP)
3753 dac_granted |= VEXEC;
3754 if (file_mode & S_IRGRP)
3755 dac_granted |= VREAD;
3756 if (file_mode & S_IWGRP)
3757 dac_granted |= (VWRITE | VAPPEND);
3759 if ((accmode & dac_granted) == accmode)
3765 /* Otherwise, check everyone else. */
3766 if (file_mode & S_IXOTH)
3767 dac_granted |= VEXEC;
3768 if (file_mode & S_IROTH)
3769 dac_granted |= VREAD;
3770 if (file_mode & S_IWOTH)
3771 dac_granted |= (VWRITE | VAPPEND);
3772 if ((accmode & dac_granted) == accmode)
3777 * Build a privilege mask to determine if the set of privileges
3778 * satisfies the requirements when combined with the granted mask
3779 * from above. For each privilege, if the privilege is required,
3780 * bitwise or the request type onto the priv_granted mask.
3786 * For directories, use PRIV_VFS_LOOKUP to satisfy VEXEC
3787 * requests, instead of PRIV_VFS_EXEC.
3789 if ((accmode & VEXEC) && ((dac_granted & VEXEC) == 0) &&
3790 !priv_check_cred(cred, PRIV_VFS_LOOKUP, 0))
3791 priv_granted |= VEXEC;
3794 * Ensure that at least one execute bit is on. Otherwise,
3795 * a privileged user will always succeed, and we don't want
3796 * this to happen unless the file really is executable.
3798 if ((accmode & VEXEC) && ((dac_granted & VEXEC) == 0) &&
3799 (file_mode & (S_IXUSR | S_IXGRP | S_IXOTH)) != 0 &&
3800 !priv_check_cred(cred, PRIV_VFS_EXEC, 0))
3801 priv_granted |= VEXEC;
3804 if ((accmode & VREAD) && ((dac_granted & VREAD) == 0) &&
3805 !priv_check_cred(cred, PRIV_VFS_READ, 0))
3806 priv_granted |= VREAD;
3808 if ((accmode & VWRITE) && ((dac_granted & VWRITE) == 0) &&
3809 !priv_check_cred(cred, PRIV_VFS_WRITE, 0))
3810 priv_granted |= (VWRITE | VAPPEND);
3812 if ((accmode & VADMIN) && ((dac_granted & VADMIN) == 0) &&
3813 !priv_check_cred(cred, PRIV_VFS_ADMIN, 0))
3814 priv_granted |= VADMIN;
3816 if ((accmode & (priv_granted | dac_granted)) == accmode) {
3817 /* XXX audit: privilege used */
3818 if (privused != NULL)
3823 return ((accmode & VADMIN) ? EPERM : EACCES);
3827 * Credential check based on process requesting service, and per-attribute
3831 extattr_check_cred(struct vnode *vp, int attrnamespace, struct ucred *cred,
3832 struct thread *td, accmode_t accmode)
3836 * Kernel-invoked always succeeds.
3842 * Do not allow privileged processes in jail to directly manipulate
3843 * system attributes.
3845 switch (attrnamespace) {
3846 case EXTATTR_NAMESPACE_SYSTEM:
3847 /* Potentially should be: return (EPERM); */
3848 return (priv_check_cred(cred, PRIV_VFS_EXTATTR_SYSTEM, 0));
3849 case EXTATTR_NAMESPACE_USER:
3850 return (VOP_ACCESS(vp, accmode, cred, td));
3856 #ifdef DEBUG_VFS_LOCKS
3858 * This only exists to supress warnings from unlocked specfs accesses. It is
3859 * no longer ok to have an unlocked VFS.
3861 #define IGNORE_LOCK(vp) (panicstr != NULL || (vp) == NULL || \
3862 (vp)->v_type == VCHR || (vp)->v_type == VBAD)
3864 int vfs_badlock_ddb = 1; /* Drop into debugger on violation. */
3865 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_ddb, CTLFLAG_RW, &vfs_badlock_ddb, 0,
3866 "Drop into debugger on lock violation");
3868 int vfs_badlock_mutex = 1; /* Check for interlock across VOPs. */
3869 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_mutex, CTLFLAG_RW, &vfs_badlock_mutex,
3870 0, "Check for interlock across VOPs");
3872 int vfs_badlock_print = 1; /* Print lock violations. */
3873 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_print, CTLFLAG_RW, &vfs_badlock_print,
3874 0, "Print lock violations");
3877 int vfs_badlock_backtrace = 1; /* Print backtrace at lock violations. */
3878 SYSCTL_INT(_debug, OID_AUTO, vfs_badlock_backtrace, CTLFLAG_RW,
3879 &vfs_badlock_backtrace, 0, "Print backtrace at lock violations");
3883 vfs_badlock(const char *msg, const char *str, struct vnode *vp)
3887 if (vfs_badlock_backtrace)
3890 if (vfs_badlock_print)
3891 printf("%s: %p %s\n", str, (void *)vp, msg);
3892 if (vfs_badlock_ddb)
3893 kdb_enter(KDB_WHY_VFSLOCK, "lock violation");
3897 assert_vi_locked(struct vnode *vp, const char *str)
3900 if (vfs_badlock_mutex && !mtx_owned(VI_MTX(vp)))
3901 vfs_badlock("interlock is not locked but should be", str, vp);
3905 assert_vi_unlocked(struct vnode *vp, const char *str)
3908 if (vfs_badlock_mutex && mtx_owned(VI_MTX(vp)))
3909 vfs_badlock("interlock is locked but should not be", str, vp);
3913 assert_vop_locked(struct vnode *vp, const char *str)
3916 if (!IGNORE_LOCK(vp) && VOP_ISLOCKED(vp) == 0)
3917 vfs_badlock("is not locked but should be", str, vp);
3921 assert_vop_unlocked(struct vnode *vp, const char *str)
3924 if (!IGNORE_LOCK(vp) && VOP_ISLOCKED(vp) == LK_EXCLUSIVE)
3925 vfs_badlock("is locked but should not be", str, vp);
3929 assert_vop_elocked(struct vnode *vp, const char *str)
3932 if (!IGNORE_LOCK(vp) && VOP_ISLOCKED(vp) != LK_EXCLUSIVE)
3933 vfs_badlock("is not exclusive locked but should be", str, vp);
3938 assert_vop_elocked_other(struct vnode *vp, const char *str)
3941 if (!IGNORE_LOCK(vp) && VOP_ISLOCKED(vp) != LK_EXCLOTHER)
3942 vfs_badlock("is not exclusive locked by another thread",
3947 assert_vop_slocked(struct vnode *vp, const char *str)
3950 if (!IGNORE_LOCK(vp) && VOP_ISLOCKED(vp) != LK_SHARED)
3951 vfs_badlock("is not locked shared but should be", str, vp);
3954 #endif /* DEBUG_VFS_LOCKS */
3957 vop_rename_fail(struct vop_rename_args *ap)
3960 if (ap->a_tvp != NULL)
3962 if (ap->a_tdvp == ap->a_tvp)
3971 vop_rename_pre(void *ap)
3973 struct vop_rename_args *a = ap;
3975 #ifdef DEBUG_VFS_LOCKS
3977 ASSERT_VI_UNLOCKED(a->a_tvp, "VOP_RENAME");
3978 ASSERT_VI_UNLOCKED(a->a_tdvp, "VOP_RENAME");
3979 ASSERT_VI_UNLOCKED(a->a_fvp, "VOP_RENAME");
3980 ASSERT_VI_UNLOCKED(a->a_fdvp, "VOP_RENAME");
3982 /* Check the source (from). */
3983 if (a->a_tdvp->v_vnlock != a->a_fdvp->v_vnlock &&
3984 (a->a_tvp == NULL || a->a_tvp->v_vnlock != a->a_fdvp->v_vnlock))
3985 ASSERT_VOP_UNLOCKED(a->a_fdvp, "vop_rename: fdvp locked");
3986 if (a->a_tvp == NULL || a->a_tvp->v_vnlock != a->a_fvp->v_vnlock)
3987 ASSERT_VOP_UNLOCKED(a->a_fvp, "vop_rename: fvp locked");
3989 /* Check the target. */
3991 ASSERT_VOP_LOCKED(a->a_tvp, "vop_rename: tvp not locked");
3992 ASSERT_VOP_LOCKED(a->a_tdvp, "vop_rename: tdvp not locked");
3994 if (a->a_tdvp != a->a_fdvp)
3996 if (a->a_tvp != a->a_fvp)
4004 vop_strategy_pre(void *ap)
4006 #ifdef DEBUG_VFS_LOCKS
4007 struct vop_strategy_args *a;
4014 * Cluster ops lock their component buffers but not the IO container.
4016 if ((bp->b_flags & B_CLUSTER) != 0)
4019 if (panicstr == NULL && !BUF_ISLOCKED(bp)) {
4020 if (vfs_badlock_print)
4022 "VOP_STRATEGY: bp is not locked but should be\n");
4023 if (vfs_badlock_ddb)
4024 kdb_enter(KDB_WHY_VFSLOCK, "lock violation");
4030 vop_lookup_pre(void *ap)
4032 #ifdef DEBUG_VFS_LOCKS
4033 struct vop_lookup_args *a;
4038 ASSERT_VI_UNLOCKED(dvp, "VOP_LOOKUP");
4039 ASSERT_VOP_LOCKED(dvp, "VOP_LOOKUP");
4044 vop_lookup_post(void *ap, int rc)
4046 #ifdef DEBUG_VFS_LOCKS
4047 struct vop_lookup_args *a;
4055 ASSERT_VI_UNLOCKED(dvp, "VOP_LOOKUP");
4056 ASSERT_VOP_LOCKED(dvp, "VOP_LOOKUP");
4059 ASSERT_VOP_LOCKED(vp, "VOP_LOOKUP (child)");
4064 vop_lock_pre(void *ap)
4066 #ifdef DEBUG_VFS_LOCKS
4067 struct vop_lock1_args *a = ap;
4069 if ((a->a_flags & LK_INTERLOCK) == 0)
4070 ASSERT_VI_UNLOCKED(a->a_vp, "VOP_LOCK");
4072 ASSERT_VI_LOCKED(a->a_vp, "VOP_LOCK");
4077 vop_lock_post(void *ap, int rc)
4079 #ifdef DEBUG_VFS_LOCKS
4080 struct vop_lock1_args *a = ap;
4082 ASSERT_VI_UNLOCKED(a->a_vp, "VOP_LOCK");
4084 ASSERT_VOP_LOCKED(a->a_vp, "VOP_LOCK");
4089 vop_unlock_pre(void *ap)
4091 #ifdef DEBUG_VFS_LOCKS
4092 struct vop_unlock_args *a = ap;
4094 if (a->a_flags & LK_INTERLOCK)
4095 ASSERT_VI_LOCKED(a->a_vp, "VOP_UNLOCK");
4096 ASSERT_VOP_LOCKED(a->a_vp, "VOP_UNLOCK");
4101 vop_unlock_post(void *ap, int rc)
4103 #ifdef DEBUG_VFS_LOCKS
4104 struct vop_unlock_args *a = ap;
4106 if (a->a_flags & LK_INTERLOCK)
4107 ASSERT_VI_UNLOCKED(a->a_vp, "VOP_UNLOCK");
4112 vop_create_post(void *ap, int rc)
4114 struct vop_create_args *a = ap;
4117 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
4121 vop_deleteextattr_post(void *ap, int rc)
4123 struct vop_deleteextattr_args *a = ap;
4126 VFS_KNOTE_LOCKED(a->a_vp, NOTE_ATTRIB);
4130 vop_link_post(void *ap, int rc)
4132 struct vop_link_args *a = ap;
4135 VFS_KNOTE_LOCKED(a->a_vp, NOTE_LINK);
4136 VFS_KNOTE_LOCKED(a->a_tdvp, NOTE_WRITE);
4141 vop_mkdir_post(void *ap, int rc)
4143 struct vop_mkdir_args *a = ap;
4146 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE | NOTE_LINK);
4150 vop_mknod_post(void *ap, int rc)
4152 struct vop_mknod_args *a = ap;
4155 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
4159 vop_remove_post(void *ap, int rc)
4161 struct vop_remove_args *a = ap;
4164 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
4165 VFS_KNOTE_LOCKED(a->a_vp, NOTE_DELETE);
4170 vop_rename_post(void *ap, int rc)
4172 struct vop_rename_args *a = ap;
4175 VFS_KNOTE_UNLOCKED(a->a_fdvp, NOTE_WRITE);
4176 VFS_KNOTE_UNLOCKED(a->a_tdvp, NOTE_WRITE);
4177 VFS_KNOTE_UNLOCKED(a->a_fvp, NOTE_RENAME);
4179 VFS_KNOTE_UNLOCKED(a->a_tvp, NOTE_DELETE);
4181 if (a->a_tdvp != a->a_fdvp)
4183 if (a->a_tvp != a->a_fvp)
4191 vop_rmdir_post(void *ap, int rc)
4193 struct vop_rmdir_args *a = ap;
4196 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE | NOTE_LINK);
4197 VFS_KNOTE_LOCKED(a->a_vp, NOTE_DELETE);
4202 vop_setattr_post(void *ap, int rc)
4204 struct vop_setattr_args *a = ap;
4207 VFS_KNOTE_LOCKED(a->a_vp, NOTE_ATTRIB);
4211 vop_setextattr_post(void *ap, int rc)
4213 struct vop_setextattr_args *a = ap;
4216 VFS_KNOTE_LOCKED(a->a_vp, NOTE_ATTRIB);
4220 vop_symlink_post(void *ap, int rc)
4222 struct vop_symlink_args *a = ap;
4225 VFS_KNOTE_LOCKED(a->a_dvp, NOTE_WRITE);
4228 static struct knlist fs_knlist;
4231 vfs_event_init(void *arg)
4233 knlist_init_mtx(&fs_knlist, NULL);
4235 /* XXX - correct order? */
4236 SYSINIT(vfs_knlist, SI_SUB_VFS, SI_ORDER_ANY, vfs_event_init, NULL);
4239 vfs_event_signal(fsid_t *fsid, uint32_t event, intptr_t data __unused)
4242 KNOTE_UNLOCKED(&fs_knlist, event);
4245 static int filt_fsattach(struct knote *kn);
4246 static void filt_fsdetach(struct knote *kn);
4247 static int filt_fsevent(struct knote *kn, long hint);
4249 struct filterops fs_filtops = {
4251 .f_attach = filt_fsattach,
4252 .f_detach = filt_fsdetach,
4253 .f_event = filt_fsevent
4257 filt_fsattach(struct knote *kn)
4260 kn->kn_flags |= EV_CLEAR;
4261 knlist_add(&fs_knlist, kn, 0);
4266 filt_fsdetach(struct knote *kn)
4269 knlist_remove(&fs_knlist, kn, 0);
4273 filt_fsevent(struct knote *kn, long hint)
4276 kn->kn_fflags |= hint;
4277 return (kn->kn_fflags != 0);
4281 sysctl_vfs_ctl(SYSCTL_HANDLER_ARGS)
4287 error = SYSCTL_IN(req, &vc, sizeof(vc));
4290 if (vc.vc_vers != VFS_CTL_VERS1)
4292 mp = vfs_getvfs(&vc.vc_fsid);
4295 /* ensure that a specific sysctl goes to the right filesystem. */
4296 if (strcmp(vc.vc_fstypename, "*") != 0 &&
4297 strcmp(vc.vc_fstypename, mp->mnt_vfc->vfc_name) != 0) {
4301 VCTLTOREQ(&vc, req);
4302 error = VFS_SYSCTL(mp, vc.vc_op, req);
4307 SYSCTL_PROC(_vfs, OID_AUTO, ctl, CTLTYPE_OPAQUE | CTLFLAG_WR,
4308 NULL, 0, sysctl_vfs_ctl, "",
4312 * Function to initialize a va_filerev field sensibly.
4313 * XXX: Wouldn't a random number make a lot more sense ??
4316 init_va_filerev(void)
4321 return (((u_quad_t)bt.sec << 32LL) | (bt.frac >> 32LL));
4324 static int filt_vfsread(struct knote *kn, long hint);
4325 static int filt_vfswrite(struct knote *kn, long hint);
4326 static int filt_vfsvnode(struct knote *kn, long hint);
4327 static void filt_vfsdetach(struct knote *kn);
4328 static struct filterops vfsread_filtops = {
4330 .f_detach = filt_vfsdetach,
4331 .f_event = filt_vfsread
4333 static struct filterops vfswrite_filtops = {
4335 .f_detach = filt_vfsdetach,
4336 .f_event = filt_vfswrite
4338 static struct filterops vfsvnode_filtops = {
4340 .f_detach = filt_vfsdetach,
4341 .f_event = filt_vfsvnode
4345 vfs_knllock(void *arg)
4347 struct vnode *vp = arg;
4349 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
4353 vfs_knlunlock(void *arg)
4355 struct vnode *vp = arg;
4361 vfs_knl_assert_locked(void *arg)
4363 #ifdef DEBUG_VFS_LOCKS
4364 struct vnode *vp = arg;
4366 ASSERT_VOP_LOCKED(vp, "vfs_knl_assert_locked");
4371 vfs_knl_assert_unlocked(void *arg)
4373 #ifdef DEBUG_VFS_LOCKS
4374 struct vnode *vp = arg;
4376 ASSERT_VOP_UNLOCKED(vp, "vfs_knl_assert_unlocked");
4381 vfs_kqfilter(struct vop_kqfilter_args *ap)
4383 struct vnode *vp = ap->a_vp;
4384 struct knote *kn = ap->a_kn;
4387 switch (kn->kn_filter) {
4389 kn->kn_fop = &vfsread_filtops;
4392 kn->kn_fop = &vfswrite_filtops;
4395 kn->kn_fop = &vfsvnode_filtops;
4401 kn->kn_hook = (caddr_t)vp;
4404 if (vp->v_pollinfo == NULL)
4406 knl = &vp->v_pollinfo->vpi_selinfo.si_note;
4407 knlist_add(knl, kn, 0);
4413 * Detach knote from vnode
4416 filt_vfsdetach(struct knote *kn)
4418 struct vnode *vp = (struct vnode *)kn->kn_hook;
4420 KASSERT(vp->v_pollinfo != NULL, ("Missing v_pollinfo"));
4421 knlist_remove(&vp->v_pollinfo->vpi_selinfo.si_note, kn, 0);
4426 filt_vfsread(struct knote *kn, long hint)
4428 struct vnode *vp = (struct vnode *)kn->kn_hook;
4433 * filesystem is gone, so set the EOF flag and schedule
4434 * the knote for deletion.
4436 if (hint == NOTE_REVOKE) {
4438 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
4443 if (VOP_GETATTR(vp, &va, curthread->td_ucred))
4447 kn->kn_data = va.va_size - kn->kn_fp->f_offset;
4448 res = (kn->kn_data != 0);
4455 filt_vfswrite(struct knote *kn, long hint)
4457 struct vnode *vp = (struct vnode *)kn->kn_hook;
4462 * filesystem is gone, so set the EOF flag and schedule
4463 * the knote for deletion.
4465 if (hint == NOTE_REVOKE)
4466 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
4474 filt_vfsvnode(struct knote *kn, long hint)
4476 struct vnode *vp = (struct vnode *)kn->kn_hook;
4480 if (kn->kn_sfflags & hint)
4481 kn->kn_fflags |= hint;
4482 if (hint == NOTE_REVOKE) {
4483 kn->kn_flags |= EV_EOF;
4487 res = (kn->kn_fflags != 0);
4493 vfs_read_dirent(struct vop_readdir_args *ap, struct dirent *dp, off_t off)
4497 if (dp->d_reclen > ap->a_uio->uio_resid)
4498 return (ENAMETOOLONG);
4499 error = uiomove(dp, dp->d_reclen, ap->a_uio);
4501 if (ap->a_ncookies != NULL) {
4502 if (ap->a_cookies != NULL)
4503 free(ap->a_cookies, M_TEMP);
4504 ap->a_cookies = NULL;
4505 *ap->a_ncookies = 0;
4509 if (ap->a_ncookies == NULL)
4512 KASSERT(ap->a_cookies,
4513 ("NULL ap->a_cookies value with non-NULL ap->a_ncookies!"));
4515 *ap->a_cookies = realloc(*ap->a_cookies,
4516 (*ap->a_ncookies + 1) * sizeof(u_long), M_TEMP, M_WAITOK | M_ZERO);
4517 (*ap->a_cookies)[*ap->a_ncookies] = off;
4522 * Mark for update the access time of the file if the filesystem
4523 * supports VOP_MARKATIME. This functionality is used by execve and
4524 * mmap, so we want to avoid the I/O implied by directly setting
4525 * va_atime for the sake of efficiency.
4528 vfs_mark_atime(struct vnode *vp, struct ucred *cred)
4533 VFS_ASSERT_GIANT(mp);
4534 ASSERT_VOP_LOCKED(vp, "vfs_mark_atime");
4535 if (mp != NULL && (mp->mnt_flag & (MNT_NOATIME | MNT_RDONLY)) == 0)
4536 (void)VOP_MARKATIME(vp);
4540 * The purpose of this routine is to remove granularity from accmode_t,
4541 * reducing it into standard unix access bits - VEXEC, VREAD, VWRITE,
4542 * VADMIN and VAPPEND.
4544 * If it returns 0, the caller is supposed to continue with the usual
4545 * access checks using 'accmode' as modified by this routine. If it
4546 * returns nonzero value, the caller is supposed to return that value
4549 * Note that after this routine runs, accmode may be zero.
4552 vfs_unixify_accmode(accmode_t *accmode)
4555 * There is no way to specify explicit "deny" rule using
4556 * file mode or POSIX.1e ACLs.
4558 if (*accmode & VEXPLICIT_DENY) {
4564 * None of these can be translated into usual access bits.
4565 * Also, the common case for NFSv4 ACLs is to not contain
4566 * either of these bits. Caller should check for VWRITE
4567 * on the containing directory instead.
4569 if (*accmode & (VDELETE_CHILD | VDELETE))
4572 if (*accmode & VADMIN_PERMS) {
4573 *accmode &= ~VADMIN_PERMS;
4578 * There is no way to deny VREAD_ATTRIBUTES, VREAD_ACL
4579 * or VSYNCHRONIZE using file mode or POSIX.1e ACL.
4581 *accmode &= ~(VSTAT_PERMS | VSYNCHRONIZE);
4587 * These are helper functions for filesystems to traverse all
4588 * their vnodes. See MNT_VNODE_FOREACH_ALL() in sys/mount.h.
4590 * This interface replaces MNT_VNODE_FOREACH.
4593 MALLOC_DEFINE(M_VNODE_MARKER, "vnodemarker", "vnode marker");
4596 __mnt_vnode_next_all(struct vnode **mvp, struct mount *mp)
4601 kern_yield(PRI_UNCHANGED);
4603 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
4604 vp = TAILQ_NEXT(*mvp, v_nmntvnodes);
4605 while (vp != NULL && (vp->v_type == VMARKER ||
4606 (vp->v_iflag & VI_DOOMED) != 0))
4607 vp = TAILQ_NEXT(vp, v_nmntvnodes);
4609 /* Check if we are done */
4611 __mnt_vnode_markerfree_all(mvp, mp);
4612 /* MNT_IUNLOCK(mp); -- done in above function */
4613 mtx_assert(MNT_MTX(mp), MA_NOTOWNED);
4616 TAILQ_REMOVE(&mp->mnt_nvnodelist, *mvp, v_nmntvnodes);
4617 TAILQ_INSERT_AFTER(&mp->mnt_nvnodelist, vp, *mvp, v_nmntvnodes);
4624 __mnt_vnode_first_all(struct vnode **mvp, struct mount *mp)
4628 *mvp = malloc(sizeof(struct vnode), M_VNODE_MARKER, M_WAITOK | M_ZERO);
4631 (*mvp)->v_type = VMARKER;
4633 vp = TAILQ_FIRST(&mp->mnt_nvnodelist);
4634 while (vp != NULL && (vp->v_type == VMARKER ||
4635 (vp->v_iflag & VI_DOOMED) != 0))
4636 vp = TAILQ_NEXT(vp, v_nmntvnodes);
4638 /* Check if we are done */
4642 free(*mvp, M_VNODE_MARKER);
4646 (*mvp)->v_mount = mp;
4647 TAILQ_INSERT_AFTER(&mp->mnt_nvnodelist, vp, *mvp, v_nmntvnodes);
4655 __mnt_vnode_markerfree_all(struct vnode **mvp, struct mount *mp)
4663 mtx_assert(MNT_MTX(mp), MA_OWNED);
4665 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
4666 TAILQ_REMOVE(&mp->mnt_nvnodelist, *mvp, v_nmntvnodes);
4669 free(*mvp, M_VNODE_MARKER);
4674 * These are helper functions for filesystems to traverse their
4675 * active vnodes. See MNT_VNODE_FOREACH_ACTIVE() in sys/mount.h
4678 __mnt_vnode_next_active(struct vnode **mvp, struct mount *mp)
4680 struct vnode *vp, *nvp;
4683 kern_yield(PRI_UNCHANGED);
4685 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
4686 vp = TAILQ_NEXT(*mvp, v_actfreelist);
4687 while (vp != NULL) {
4689 if (vp->v_mount == mp && vp->v_type != VMARKER &&
4690 (vp->v_iflag & VI_DOOMED) == 0)
4692 nvp = TAILQ_NEXT(vp, v_actfreelist);
4697 /* Check if we are done */
4699 __mnt_vnode_markerfree_active(mvp, mp);
4700 /* MNT_IUNLOCK(mp); -- done in above function */
4701 mtx_assert(MNT_MTX(mp), MA_NOTOWNED);
4704 mtx_lock(&vnode_free_list_mtx);
4705 TAILQ_REMOVE(&mp->mnt_activevnodelist, *mvp, v_actfreelist);
4706 TAILQ_INSERT_AFTER(&mp->mnt_activevnodelist, vp, *mvp, v_actfreelist);
4707 mtx_unlock(&vnode_free_list_mtx);
4713 __mnt_vnode_first_active(struct vnode **mvp, struct mount *mp)
4715 struct vnode *vp, *nvp;
4717 *mvp = malloc(sizeof(struct vnode), M_VNODE_MARKER, M_WAITOK | M_ZERO);
4720 (*mvp)->v_type = VMARKER;
4722 vp = TAILQ_NEXT(*mvp, v_actfreelist);
4723 while (vp != NULL) {
4725 if (vp->v_mount == mp && vp->v_type != VMARKER &&
4726 (vp->v_iflag & VI_DOOMED) == 0)
4728 nvp = TAILQ_NEXT(vp, v_actfreelist);
4733 /* Check if we are done */
4737 free(*mvp, M_VNODE_MARKER);
4741 (*mvp)->v_mount = mp;
4742 mtx_lock(&vnode_free_list_mtx);
4743 TAILQ_INSERT_AFTER(&mp->mnt_activevnodelist, vp, *mvp, v_actfreelist);
4744 mtx_unlock(&vnode_free_list_mtx);
4750 __mnt_vnode_markerfree_active(struct vnode **mvp, struct mount *mp)
4758 mtx_assert(MNT_MTX(mp), MA_OWNED);
4760 KASSERT((*mvp)->v_mount == mp, ("marker vnode mount list mismatch"));
4761 mtx_lock(&vnode_free_list_mtx);
4762 TAILQ_REMOVE(&mp->mnt_activevnodelist, *mvp, v_actfreelist);
4763 mtx_unlock(&vnode_free_list_mtx);
4766 free(*mvp, M_VNODE_MARKER);