HAMMER 40B/Many: Inode/link-count sequencer cleanup pass.
[dragonfly.git] / sys / kern / vfs_subr.c
blob904ddb786b48e916d275f50add15d4d06954f250
1 /*
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
12 * are met:
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 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
38 * @(#)vfs_subr.c 8.31 (Berkeley) 5/26/95
39 * $FreeBSD: src/sys/kern/vfs_subr.c,v 1.249.2.30 2003/04/04 20:35:57 tegge Exp $
40 * $DragonFly: src/sys/kern/vfs_subr.c,v 1.112 2008/04/30 17:34:11 dillon Exp $
44 * External virtual filesystem routines
46 #include "opt_ddb.h"
48 #include <sys/param.h>
49 #include <sys/systm.h>
50 #include <sys/buf.h>
51 #include <sys/conf.h>
52 #include <sys/dirent.h>
53 #include <sys/domain.h>
54 #include <sys/eventhandler.h>
55 #include <sys/fcntl.h>
56 #include <sys/kernel.h>
57 #include <sys/kthread.h>
58 #include <sys/malloc.h>
59 #include <sys/mbuf.h>
60 #include <sys/mount.h>
61 #include <sys/proc.h>
62 #include <sys/reboot.h>
63 #include <sys/socket.h>
64 #include <sys/stat.h>
65 #include <sys/sysctl.h>
66 #include <sys/syslog.h>
67 #include <sys/unistd.h>
68 #include <sys/vmmeter.h>
69 #include <sys/vnode.h>
71 #include <machine/limits.h>
73 #include <vm/vm.h>
74 #include <vm/vm_object.h>
75 #include <vm/vm_extern.h>
76 #include <vm/vm_kern.h>
77 #include <vm/pmap.h>
78 #include <vm/vm_map.h>
79 #include <vm/vm_page.h>
80 #include <vm/vm_pager.h>
81 #include <vm/vnode_pager.h>
82 #include <vm/vm_zone.h>
84 #include <sys/buf2.h>
85 #include <sys/thread2.h>
86 #include <sys/sysref2.h>
88 static MALLOC_DEFINE(M_NETADDR, "Export Host", "Export host address structure");
90 int numvnodes;
91 SYSCTL_INT(_debug, OID_AUTO, numvnodes, CTLFLAG_RD, &numvnodes, 0, "");
92 int vfs_fastdev = 1;
93 SYSCTL_INT(_vfs, OID_AUTO, fastdev, CTLFLAG_RW, &vfs_fastdev, 0, "");
95 enum vtype iftovt_tab[16] = {
96 VNON, VFIFO, VCHR, VNON, VDIR, VNON, VBLK, VNON,
97 VREG, VNON, VLNK, VNON, VSOCK, VNON, VNON, VBAD,
99 int vttoif_tab[9] = {
100 0, S_IFREG, S_IFDIR, S_IFBLK, S_IFCHR, S_IFLNK,
101 S_IFSOCK, S_IFIFO, S_IFMT,
104 static int reassignbufcalls;
105 SYSCTL_INT(_vfs, OID_AUTO, reassignbufcalls, CTLFLAG_RW,
106 &reassignbufcalls, 0, "");
107 static int reassignbufloops;
108 SYSCTL_INT(_vfs, OID_AUTO, reassignbufloops, CTLFLAG_RW,
109 &reassignbufloops, 0, "");
110 static int reassignbufsortgood;
111 SYSCTL_INT(_vfs, OID_AUTO, reassignbufsortgood, CTLFLAG_RW,
112 &reassignbufsortgood, 0, "");
113 static int reassignbufsortbad;
114 SYSCTL_INT(_vfs, OID_AUTO, reassignbufsortbad, CTLFLAG_RW,
115 &reassignbufsortbad, 0, "");
116 static int reassignbufmethod = 1;
117 SYSCTL_INT(_vfs, OID_AUTO, reassignbufmethod, CTLFLAG_RW,
118 &reassignbufmethod, 0, "");
120 int nfs_mount_type = -1;
121 static struct lwkt_token spechash_token;
122 struct nfs_public nfs_pub; /* publicly exported FS */
124 int desiredvnodes;
125 SYSCTL_INT(_kern, KERN_MAXVNODES, maxvnodes, CTLFLAG_RW,
126 &desiredvnodes, 0, "Maximum number of vnodes");
128 static void vfs_free_addrlist (struct netexport *nep);
129 static int vfs_free_netcred (struct radix_node *rn, void *w);
130 static int vfs_hang_addrlist (struct mount *mp, struct netexport *nep,
131 const struct export_args *argp);
133 extern int dev_ref_debug;
136 * Red black tree functions
138 static int rb_buf_compare(struct buf *b1, struct buf *b2);
139 RB_GENERATE2(buf_rb_tree, buf, b_rbnode, rb_buf_compare, off_t, b_loffset);
140 RB_GENERATE2(buf_rb_hash, buf, b_rbhash, rb_buf_compare, off_t, b_loffset);
142 static int
143 rb_buf_compare(struct buf *b1, struct buf *b2)
145 if (b1->b_loffset < b2->b_loffset)
146 return(-1);
147 if (b1->b_loffset > b2->b_loffset)
148 return(1);
149 return(0);
153 * Returns non-zero if the vnode is a candidate for lazy msyncing.
155 static __inline int
156 vshouldmsync(struct vnode *vp)
158 if (vp->v_auxrefs != 0 || vp->v_sysref.refcnt > 0)
159 return (0); /* other holders */
160 if (vp->v_object &&
161 (vp->v_object->ref_count || vp->v_object->resident_page_count)) {
162 return (0);
164 return (1);
168 * Initialize the vnode management data structures.
170 * Called from vfsinit()
172 void
173 vfs_subr_init(void)
176 * Desired vnodes is a result of the physical page count
177 * and the size of kernel's heap. It scales in proportion
178 * to the amount of available physical memory. This can
179 * cause trouble on 64-bit and large memory platforms.
181 /* desiredvnodes = maxproc + vmstats.v_page_count / 4; */
182 desiredvnodes =
183 min(maxproc + vmstats.v_page_count / 4,
184 2 * KvaSize /
185 (5 * (sizeof(struct vm_object) + sizeof(struct vnode))));
187 lwkt_token_init(&spechash_token);
191 * Knob to control the precision of file timestamps:
193 * 0 = seconds only; nanoseconds zeroed.
194 * 1 = seconds and nanoseconds, accurate within 1/HZ.
195 * 2 = seconds and nanoseconds, truncated to microseconds.
196 * >=3 = seconds and nanoseconds, maximum precision.
198 enum { TSP_SEC, TSP_HZ, TSP_USEC, TSP_NSEC };
200 static int timestamp_precision = TSP_SEC;
201 SYSCTL_INT(_vfs, OID_AUTO, timestamp_precision, CTLFLAG_RW,
202 &timestamp_precision, 0, "");
205 * Get a current timestamp.
207 void
208 vfs_timestamp(struct timespec *tsp)
210 struct timeval tv;
212 switch (timestamp_precision) {
213 case TSP_SEC:
214 tsp->tv_sec = time_second;
215 tsp->tv_nsec = 0;
216 break;
217 case TSP_HZ:
218 getnanotime(tsp);
219 break;
220 case TSP_USEC:
221 microtime(&tv);
222 TIMEVAL_TO_TIMESPEC(&tv, tsp);
223 break;
224 case TSP_NSEC:
225 default:
226 nanotime(tsp);
227 break;
232 * Set vnode attributes to VNOVAL
234 void
235 vattr_null(struct vattr *vap)
237 vap->va_type = VNON;
238 vap->va_size = VNOVAL;
239 vap->va_bytes = VNOVAL;
240 vap->va_mode = VNOVAL;
241 vap->va_nlink = VNOVAL;
242 vap->va_uid = VNOVAL;
243 vap->va_gid = VNOVAL;
244 vap->va_fsid = VNOVAL;
245 vap->va_fileid = VNOVAL;
246 vap->va_blocksize = VNOVAL;
247 vap->va_rmajor = VNOVAL;
248 vap->va_rminor = VNOVAL;
249 vap->va_atime.tv_sec = VNOVAL;
250 vap->va_atime.tv_nsec = VNOVAL;
251 vap->va_mtime.tv_sec = VNOVAL;
252 vap->va_mtime.tv_nsec = VNOVAL;
253 vap->va_ctime.tv_sec = VNOVAL;
254 vap->va_ctime.tv_nsec = VNOVAL;
255 vap->va_flags = VNOVAL;
256 vap->va_gen = VNOVAL;
257 vap->va_vaflags = 0;
258 vap->va_fsmid = VNOVAL;
259 /* va_*_uuid fields are only valid if related flags are set */
263 * Flush out and invalidate all buffers associated with a vnode.
265 * vp must be locked.
267 static int vinvalbuf_bp(struct buf *bp, void *data);
269 struct vinvalbuf_bp_info {
270 struct vnode *vp;
271 int slptimeo;
272 int lkflags;
273 int flags;
276 void
277 vupdatefsmid(struct vnode *vp)
279 atomic_set_int(&vp->v_flag, VFSMID);
283 vinvalbuf(struct vnode *vp, int flags, int slpflag, int slptimeo)
285 struct vinvalbuf_bp_info info;
286 int error;
287 vm_object_t object;
290 * If we are being asked to save, call fsync to ensure that the inode
291 * is updated.
293 if (flags & V_SAVE) {
294 crit_enter();
295 while (vp->v_track_write.bk_active) {
296 vp->v_track_write.bk_waitflag = 1;
297 error = tsleep(&vp->v_track_write, slpflag,
298 "vinvlbuf", slptimeo);
299 if (error) {
300 crit_exit();
301 return (error);
304 if (!RB_EMPTY(&vp->v_rbdirty_tree)) {
305 crit_exit();
306 if ((error = VOP_FSYNC(vp, MNT_WAIT)) != 0)
307 return (error);
308 crit_enter();
309 if (vp->v_track_write.bk_active > 0 ||
310 !RB_EMPTY(&vp->v_rbdirty_tree))
311 panic("vinvalbuf: dirty bufs");
313 crit_exit();
315 crit_enter();
316 info.slptimeo = slptimeo;
317 info.lkflags = LK_EXCLUSIVE | LK_SLEEPFAIL;
318 if (slpflag & PCATCH)
319 info.lkflags |= LK_PCATCH;
320 info.flags = flags;
321 info.vp = vp;
324 * Flush the buffer cache until nothing is left.
326 while (!RB_EMPTY(&vp->v_rbclean_tree) ||
327 !RB_EMPTY(&vp->v_rbdirty_tree)) {
328 error = RB_SCAN(buf_rb_tree, &vp->v_rbclean_tree, NULL,
329 vinvalbuf_bp, &info);
330 if (error == 0) {
331 error = RB_SCAN(buf_rb_tree, &vp->v_rbdirty_tree, NULL,
332 vinvalbuf_bp, &info);
337 * Wait for I/O to complete. XXX needs cleaning up. The vnode can
338 * have write I/O in-progress but if there is a VM object then the
339 * VM object can also have read-I/O in-progress.
341 do {
342 while (vp->v_track_write.bk_active > 0) {
343 vp->v_track_write.bk_waitflag = 1;
344 tsleep(&vp->v_track_write, 0, "vnvlbv", 0);
346 if ((object = vp->v_object) != NULL) {
347 while (object->paging_in_progress)
348 vm_object_pip_sleep(object, "vnvlbx");
350 } while (vp->v_track_write.bk_active > 0);
352 crit_exit();
355 * Destroy the copy in the VM cache, too.
357 if ((object = vp->v_object) != NULL) {
358 vm_object_page_remove(object, 0, 0,
359 (flags & V_SAVE) ? TRUE : FALSE);
362 if (!RB_EMPTY(&vp->v_rbdirty_tree) || !RB_EMPTY(&vp->v_rbclean_tree))
363 panic("vinvalbuf: flush failed");
364 if (!RB_EMPTY(&vp->v_rbhash_tree))
365 panic("vinvalbuf: flush failed, buffers still present");
366 return (0);
369 static int
370 vinvalbuf_bp(struct buf *bp, void *data)
372 struct vinvalbuf_bp_info *info = data;
373 int error;
375 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT)) {
376 error = BUF_TIMELOCK(bp, info->lkflags,
377 "vinvalbuf", info->slptimeo);
378 if (error == 0) {
379 BUF_UNLOCK(bp);
380 error = ENOLCK;
382 if (error == ENOLCK)
383 return(0);
384 return (-error);
387 KKASSERT(bp->b_vp == info->vp);
390 * XXX Since there are no node locks for NFS, I
391 * believe there is a slight chance that a delayed
392 * write will occur while sleeping just above, so
393 * check for it. Note that vfs_bio_awrite expects
394 * buffers to reside on a queue, while bwrite() and
395 * brelse() do not.
397 * NOTE: NO B_LOCKED CHECK. Also no buf_checkwrite()
398 * check. This code will write out the buffer, period.
400 if (((bp->b_flags & (B_DELWRI | B_INVAL)) == B_DELWRI) &&
401 (info->flags & V_SAVE)) {
402 if (bp->b_vp == info->vp) {
403 if (bp->b_flags & B_CLUSTEROK) {
404 vfs_bio_awrite(bp);
405 } else {
406 bremfree(bp);
407 bp->b_flags |= B_ASYNC;
408 bwrite(bp);
410 } else {
411 bremfree(bp);
412 bwrite(bp);
414 } else if (info->flags & V_SAVE) {
416 * Cannot set B_NOCACHE on a clean buffer as this will
417 * destroy the VM backing store which might actually
418 * be dirty (and unsynchronized).
420 bremfree(bp);
421 bp->b_flags |= (B_INVAL | B_RELBUF);
422 bp->b_flags &= ~B_ASYNC;
423 brelse(bp);
424 } else {
425 bremfree(bp);
426 bp->b_flags |= (B_INVAL | B_NOCACHE | B_RELBUF);
427 bp->b_flags &= ~B_ASYNC;
428 brelse(bp);
430 return(0);
434 * Truncate a file's buffer and pages to a specified length. This
435 * is in lieu of the old vinvalbuf mechanism, which performed unneeded
436 * sync activity.
438 * The vnode must be locked.
440 static int vtruncbuf_bp_trunc_cmp(struct buf *bp, void *data);
441 static int vtruncbuf_bp_trunc(struct buf *bp, void *data);
442 static int vtruncbuf_bp_metasync_cmp(struct buf *bp, void *data);
443 static int vtruncbuf_bp_metasync(struct buf *bp, void *data);
446 vtruncbuf(struct vnode *vp, off_t length, int blksize)
448 off_t truncloffset;
449 int count;
450 const char *filename;
453 * Round up to the *next* block, then destroy the buffers in question.
454 * Since we are only removing some of the buffers we must rely on the
455 * scan count to determine whether a loop is necessary.
457 if ((count = (int)(length % blksize)) != 0)
458 truncloffset = length + (blksize - count);
459 else
460 truncloffset = length;
462 crit_enter();
463 do {
464 count = RB_SCAN(buf_rb_tree, &vp->v_rbclean_tree,
465 vtruncbuf_bp_trunc_cmp,
466 vtruncbuf_bp_trunc, &truncloffset);
467 count += RB_SCAN(buf_rb_tree, &vp->v_rbdirty_tree,
468 vtruncbuf_bp_trunc_cmp,
469 vtruncbuf_bp_trunc, &truncloffset);
470 } while(count);
473 * For safety, fsync any remaining metadata if the file is not being
474 * truncated to 0. Since the metadata does not represent the entire
475 * dirty list we have to rely on the hit count to ensure that we get
476 * all of it.
478 if (length > 0) {
479 do {
480 count = RB_SCAN(buf_rb_tree, &vp->v_rbdirty_tree,
481 vtruncbuf_bp_metasync_cmp,
482 vtruncbuf_bp_metasync, vp);
483 } while (count);
487 * Clean out any left over VM backing store.
489 crit_exit();
491 vnode_pager_setsize(vp, length);
493 crit_enter();
496 * It is possible to have in-progress I/O from buffers that were
497 * not part of the truncation. This should not happen if we
498 * are truncating to 0-length.
500 filename = TAILQ_FIRST(&vp->v_namecache) ?
501 TAILQ_FIRST(&vp->v_namecache)->nc_name : "?";
503 while ((count = vp->v_track_write.bk_active) > 0) {
504 vp->v_track_write.bk_waitflag = 1;
505 tsleep(&vp->v_track_write, 0, "vbtrunc", 0);
506 if (length == 0) {
507 kprintf("Warning: vtruncbuf(): Had to wait for "
508 "%d buffer I/Os to finish in %s\n",
509 count, filename);
514 * Make sure no buffers were instantiated while we were trying
515 * to clean out the remaining VM pages. This could occur due
516 * to busy dirty VM pages being flushed out to disk.
518 do {
519 count = RB_SCAN(buf_rb_tree, &vp->v_rbclean_tree,
520 vtruncbuf_bp_trunc_cmp,
521 vtruncbuf_bp_trunc, &truncloffset);
522 count += RB_SCAN(buf_rb_tree, &vp->v_rbdirty_tree,
523 vtruncbuf_bp_trunc_cmp,
524 vtruncbuf_bp_trunc, &truncloffset);
525 if (count) {
526 kprintf("Warning: vtruncbuf(): Had to re-clean %d "
527 "left over buffers in %s\n", count, filename);
529 } while(count);
531 crit_exit();
533 return (0);
537 * The callback buffer is beyond the new file EOF and must be destroyed.
538 * Note that the compare function must conform to the RB_SCAN's requirements.
540 static
542 vtruncbuf_bp_trunc_cmp(struct buf *bp, void *data)
544 if (bp->b_loffset >= *(off_t *)data)
545 return(0);
546 return(-1);
549 static
550 int
551 vtruncbuf_bp_trunc(struct buf *bp, void *data)
554 * Do not try to use a buffer we cannot immediately lock, but sleep
555 * anyway to prevent a livelock. The code will loop until all buffers
556 * can be acted upon.
558 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT)) {
559 if (BUF_LOCK(bp, LK_EXCLUSIVE|LK_SLEEPFAIL) == 0)
560 BUF_UNLOCK(bp);
561 } else {
562 bremfree(bp);
563 bp->b_flags |= (B_INVAL | B_RELBUF | B_NOCACHE);
564 bp->b_flags &= ~B_ASYNC;
565 brelse(bp);
567 return(1);
571 * Fsync all meta-data after truncating a file to be non-zero. Only metadata
572 * blocks (with a negative loffset) are scanned.
573 * Note that the compare function must conform to the RB_SCAN's requirements.
575 static int
576 vtruncbuf_bp_metasync_cmp(struct buf *bp, void *data)
578 if (bp->b_loffset < 0)
579 return(0);
580 return(1);
583 static int
584 vtruncbuf_bp_metasync(struct buf *bp, void *data)
586 struct vnode *vp = data;
588 if (bp->b_flags & B_DELWRI) {
590 * Do not try to use a buffer we cannot immediately lock,
591 * but sleep anyway to prevent a livelock. The code will
592 * loop until all buffers can be acted upon.
594 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT)) {
595 if (BUF_LOCK(bp, LK_EXCLUSIVE|LK_SLEEPFAIL) == 0)
596 BUF_UNLOCK(bp);
597 } else {
598 bremfree(bp);
599 if (bp->b_vp == vp) {
600 bp->b_flags |= B_ASYNC;
601 } else {
602 bp->b_flags &= ~B_ASYNC;
604 bwrite(bp);
606 return(1);
607 } else {
608 return(0);
613 * vfsync - implements a multipass fsync on a file which understands
614 * dependancies and meta-data. The passed vnode must be locked. The
615 * waitfor argument may be MNT_WAIT or MNT_NOWAIT, or MNT_LAZY.
617 * When fsyncing data asynchronously just do one consolidated pass starting
618 * with the most negative block number. This may not get all the data due
619 * to dependancies.
621 * When fsyncing data synchronously do a data pass, then a metadata pass,
622 * then do additional data+metadata passes to try to get all the data out.
624 static int vfsync_wait_output(struct vnode *vp,
625 int (*waitoutput)(struct vnode *, struct thread *));
626 static int vfsync_data_only_cmp(struct buf *bp, void *data);
627 static int vfsync_meta_only_cmp(struct buf *bp, void *data);
628 static int vfsync_lazy_range_cmp(struct buf *bp, void *data);
629 static int vfsync_bp(struct buf *bp, void *data);
631 struct vfsync_info {
632 struct vnode *vp;
633 int synchronous;
634 int syncdeps;
635 int lazycount;
636 int lazylimit;
637 int skippedbufs;
638 int (*checkdef)(struct buf *);
642 vfsync(struct vnode *vp, int waitfor, int passes,
643 int (*checkdef)(struct buf *),
644 int (*waitoutput)(struct vnode *, struct thread *))
646 struct vfsync_info info;
647 int error;
649 bzero(&info, sizeof(info));
650 info.vp = vp;
651 if ((info.checkdef = checkdef) == NULL)
652 info.syncdeps = 1;
654 crit_enter_id("vfsync");
656 switch(waitfor) {
657 case MNT_LAZY:
659 * Lazy (filesystem syncer typ) Asynchronous plus limit the
660 * number of data (not meta) pages we try to flush to 1MB.
661 * A non-zero return means that lazy limit was reached.
663 info.lazylimit = 1024 * 1024;
664 info.syncdeps = 1;
665 error = RB_SCAN(buf_rb_tree, &vp->v_rbdirty_tree,
666 vfsync_lazy_range_cmp, vfsync_bp, &info);
667 RB_SCAN(buf_rb_tree, &vp->v_rbdirty_tree,
668 vfsync_meta_only_cmp, vfsync_bp, &info);
669 if (error == 0)
670 vp->v_lazyw = 0;
671 else if (!RB_EMPTY(&vp->v_rbdirty_tree))
672 vn_syncer_add_to_worklist(vp, 1);
673 error = 0;
674 break;
675 case MNT_NOWAIT:
677 * Asynchronous. Do a data-only pass and a meta-only pass.
679 info.syncdeps = 1;
680 RB_SCAN(buf_rb_tree, &vp->v_rbdirty_tree, vfsync_data_only_cmp,
681 vfsync_bp, &info);
682 RB_SCAN(buf_rb_tree, &vp->v_rbdirty_tree, vfsync_meta_only_cmp,
683 vfsync_bp, &info);
684 error = 0;
685 break;
686 default:
688 * Synchronous. Do a data-only pass, then a meta-data+data
689 * pass, then additional integrated passes to try to get
690 * all the dependancies flushed.
692 RB_SCAN(buf_rb_tree, &vp->v_rbdirty_tree, vfsync_data_only_cmp,
693 vfsync_bp, &info);
694 error = vfsync_wait_output(vp, waitoutput);
695 if (error == 0) {
696 info.skippedbufs = 0;
697 RB_SCAN(buf_rb_tree, &vp->v_rbdirty_tree, NULL,
698 vfsync_bp, &info);
699 error = vfsync_wait_output(vp, waitoutput);
700 if (info.skippedbufs)
701 kprintf("Warning: vfsync skipped %d dirty bufs in pass2!\n", info.skippedbufs);
703 while (error == 0 && passes > 0 &&
704 !RB_EMPTY(&vp->v_rbdirty_tree)) {
705 if (--passes == 0) {
706 info.synchronous = 1;
707 info.syncdeps = 1;
709 error = RB_SCAN(buf_rb_tree, &vp->v_rbdirty_tree, NULL,
710 vfsync_bp, &info);
711 if (error < 0)
712 error = -error;
713 info.syncdeps = 1;
714 if (error == 0)
715 error = vfsync_wait_output(vp, waitoutput);
717 break;
719 crit_exit_id("vfsync");
720 return(error);
723 static int
724 vfsync_wait_output(struct vnode *vp, int (*waitoutput)(struct vnode *, struct thread *))
726 int error = 0;
728 while (vp->v_track_write.bk_active) {
729 vp->v_track_write.bk_waitflag = 1;
730 tsleep(&vp->v_track_write, 0, "fsfsn", 0);
732 if (waitoutput)
733 error = waitoutput(vp, curthread);
734 return(error);
737 static int
738 vfsync_data_only_cmp(struct buf *bp, void *data)
740 if (bp->b_loffset < 0)
741 return(-1);
742 return(0);
745 static int
746 vfsync_meta_only_cmp(struct buf *bp, void *data)
748 if (bp->b_loffset < 0)
749 return(0);
750 return(1);
753 static int
754 vfsync_lazy_range_cmp(struct buf *bp, void *data)
756 struct vfsync_info *info = data;
757 if (bp->b_loffset < info->vp->v_lazyw)
758 return(-1);
759 return(0);
762 static int
763 vfsync_bp(struct buf *bp, void *data)
765 struct vfsync_info *info = data;
766 struct vnode *vp = info->vp;
767 int error;
770 * if syncdeps is not set we do not try to write buffers which have
771 * dependancies.
773 if (!info->synchronous && info->syncdeps == 0 && info->checkdef(bp))
774 return(0);
777 * Ignore buffers that we cannot immediately lock. XXX
779 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT)) {
780 kprintf("Warning: vfsync_bp skipping dirty buffer %p\n", bp);
781 ++info->skippedbufs;
782 return(0);
784 if ((bp->b_flags & B_DELWRI) == 0)
785 panic("vfsync_bp: buffer not dirty");
786 if (vp != bp->b_vp)
787 panic("vfsync_bp: buffer vp mismatch");
790 * B_NEEDCOMMIT (primarily used by NFS) is a state where the buffer
791 * has been written but an additional handshake with the device
792 * is required before we can dispose of the buffer. We have no idea
793 * how to do this so we have to skip these buffers.
795 if (bp->b_flags & B_NEEDCOMMIT) {
796 BUF_UNLOCK(bp);
797 return(0);
801 * Ask bioops if it is ok to sync
803 if (LIST_FIRST(&bp->b_dep) != NULL && buf_checkwrite(bp)) {
804 bremfree(bp);
805 brelse(bp);
806 return(0);
809 if (info->synchronous) {
811 * Synchronous flushing. An error may be returned.
813 bremfree(bp);
814 crit_exit_id("vfsync");
815 error = bwrite(bp);
816 crit_enter_id("vfsync");
817 } else {
819 * Asynchronous flushing. A negative return value simply
820 * stops the scan and is not considered an error. We use
821 * this to support limited MNT_LAZY flushes.
823 vp->v_lazyw = bp->b_loffset;
824 if ((vp->v_flag & VOBJBUF) && (bp->b_flags & B_CLUSTEROK)) {
825 info->lazycount += vfs_bio_awrite(bp);
826 } else {
827 info->lazycount += bp->b_bufsize;
828 bremfree(bp);
829 crit_exit_id("vfsync");
830 bawrite(bp);
831 crit_enter_id("vfsync");
833 if (info->lazylimit && info->lazycount >= info->lazylimit)
834 error = 1;
835 else
836 error = 0;
838 return(-error);
842 * Associate a buffer with a vnode.
844 void
845 bgetvp(struct vnode *vp, struct buf *bp)
847 KASSERT(bp->b_vp == NULL, ("bgetvp: not free"));
848 KKASSERT((bp->b_flags & (B_HASHED|B_DELWRI|B_VNCLEAN|B_VNDIRTY)) == 0);
850 vhold(vp);
852 * Insert onto list for new vnode.
854 crit_enter();
855 bp->b_vp = vp;
856 bp->b_flags |= B_HASHED;
857 if (buf_rb_hash_RB_INSERT(&vp->v_rbhash_tree, bp))
858 panic("reassignbuf: dup lblk vp %p bp %p", vp, bp);
860 bp->b_flags |= B_VNCLEAN;
861 if (buf_rb_tree_RB_INSERT(&vp->v_rbclean_tree, bp))
862 panic("reassignbuf: dup lblk/clean vp %p bp %p", vp, bp);
863 crit_exit();
867 * Disassociate a buffer from a vnode.
869 void
870 brelvp(struct buf *bp)
872 struct vnode *vp;
874 KASSERT(bp->b_vp != NULL, ("brelvp: NULL"));
877 * Delete from old vnode list, if on one.
879 vp = bp->b_vp;
880 crit_enter();
881 if (bp->b_flags & (B_VNDIRTY | B_VNCLEAN)) {
882 if (bp->b_flags & B_VNDIRTY)
883 buf_rb_tree_RB_REMOVE(&vp->v_rbdirty_tree, bp);
884 else
885 buf_rb_tree_RB_REMOVE(&vp->v_rbclean_tree, bp);
886 bp->b_flags &= ~(B_VNDIRTY | B_VNCLEAN);
888 if (bp->b_flags & B_HASHED) {
889 buf_rb_hash_RB_REMOVE(&vp->v_rbhash_tree, bp);
890 bp->b_flags &= ~B_HASHED;
892 if ((vp->v_flag & VONWORKLST) && RB_EMPTY(&vp->v_rbdirty_tree)) {
893 vp->v_flag &= ~VONWORKLST;
894 LIST_REMOVE(vp, v_synclist);
896 crit_exit();
897 bp->b_vp = NULL;
898 vdrop(vp);
902 * Reassign the buffer to the proper clean/dirty list based on B_DELWRI.
903 * This routine is called when the state of the B_DELWRI bit is changed.
905 void
906 reassignbuf(struct buf *bp)
908 struct vnode *vp = bp->b_vp;
909 int delay;
911 KKASSERT(vp != NULL);
912 ++reassignbufcalls;
915 * B_PAGING flagged buffers cannot be reassigned because their vp
916 * is not fully linked in.
918 if (bp->b_flags & B_PAGING)
919 panic("cannot reassign paging buffer");
921 crit_enter();
922 if (bp->b_flags & B_DELWRI) {
924 * Move to the dirty list, add the vnode to the worklist
926 if (bp->b_flags & B_VNCLEAN) {
927 buf_rb_tree_RB_REMOVE(&vp->v_rbclean_tree, bp);
928 bp->b_flags &= ~B_VNCLEAN;
930 if ((bp->b_flags & B_VNDIRTY) == 0) {
931 if (buf_rb_tree_RB_INSERT(&vp->v_rbdirty_tree, bp)) {
932 panic("reassignbuf: dup lblk vp %p bp %p",
933 vp, bp);
935 bp->b_flags |= B_VNDIRTY;
937 if ((vp->v_flag & VONWORKLST) == 0) {
938 switch (vp->v_type) {
939 case VDIR:
940 delay = dirdelay;
941 break;
942 case VCHR:
943 case VBLK:
944 if (vp->v_rdev &&
945 vp->v_rdev->si_mountpoint != NULL) {
946 delay = metadelay;
947 break;
949 /* fall through */
950 default:
951 delay = filedelay;
953 vn_syncer_add_to_worklist(vp, delay);
955 } else {
957 * Move to the clean list, remove the vnode from the worklist
958 * if no dirty blocks remain.
960 if (bp->b_flags & B_VNDIRTY) {
961 buf_rb_tree_RB_REMOVE(&vp->v_rbdirty_tree, bp);
962 bp->b_flags &= ~B_VNDIRTY;
964 if ((bp->b_flags & B_VNCLEAN) == 0) {
965 if (buf_rb_tree_RB_INSERT(&vp->v_rbclean_tree, bp)) {
966 panic("reassignbuf: dup lblk vp %p bp %p",
967 vp, bp);
969 bp->b_flags |= B_VNCLEAN;
971 if ((vp->v_flag & VONWORKLST) &&
972 RB_EMPTY(&vp->v_rbdirty_tree)) {
973 vp->v_flag &= ~VONWORKLST;
974 LIST_REMOVE(vp, v_synclist);
977 crit_exit();
981 * Create a vnode for a block device.
982 * Used for mounting the root file system.
985 bdevvp(cdev_t dev, struct vnode **vpp)
987 struct vnode *vp;
988 struct vnode *nvp;
989 int error;
991 if (dev == NULL) {
992 *vpp = NULLVP;
993 return (ENXIO);
995 error = getspecialvnode(VT_NON, NULL, &spec_vnode_vops_p, &nvp, 0, 0);
996 if (error) {
997 *vpp = NULLVP;
998 return (error);
1000 vp = nvp;
1001 vp->v_type = VCHR;
1002 vp->v_umajor = dev->si_umajor;
1003 vp->v_uminor = dev->si_uminor;
1004 vx_unlock(vp);
1005 *vpp = vp;
1006 return (0);
1010 v_associate_rdev(struct vnode *vp, cdev_t dev)
1012 lwkt_tokref ilock;
1014 if (dev == NULL)
1015 return(ENXIO);
1016 if (dev_is_good(dev) == 0)
1017 return(ENXIO);
1018 KKASSERT(vp->v_rdev == NULL);
1019 if (dev_ref_debug)
1020 kprintf("Z1");
1021 vp->v_rdev = reference_dev(dev);
1022 lwkt_gettoken(&ilock, &spechash_token);
1023 SLIST_INSERT_HEAD(&dev->si_hlist, vp, v_cdevnext);
1024 lwkt_reltoken(&ilock);
1025 return(0);
1028 void
1029 v_release_rdev(struct vnode *vp)
1031 lwkt_tokref ilock;
1032 cdev_t dev;
1034 if ((dev = vp->v_rdev) != NULL) {
1035 lwkt_gettoken(&ilock, &spechash_token);
1036 SLIST_REMOVE(&dev->si_hlist, vp, vnode, v_cdevnext);
1037 vp->v_rdev = NULL;
1038 release_dev(dev);
1039 lwkt_reltoken(&ilock);
1044 * Add a vnode to the alias list hung off the cdev_t. We only associate
1045 * the device number with the vnode. The actual device is not associated
1046 * until the vnode is opened (usually in spec_open()), and will be
1047 * disassociated on last close.
1049 void
1050 addaliasu(struct vnode *nvp, int x, int y)
1052 if (nvp->v_type != VBLK && nvp->v_type != VCHR)
1053 panic("addaliasu on non-special vnode");
1054 nvp->v_umajor = x;
1055 nvp->v_uminor = y;
1059 * Disassociate a vnode from its underlying filesystem.
1061 * The vnode must be VX locked and referenced. In all normal situations
1062 * there are no active references. If vclean_vxlocked() is called while
1063 * there are active references, the vnode is being ripped out and we have
1064 * to call VOP_CLOSE() as appropriate before we can reclaim it.
1066 void
1067 vclean_vxlocked(struct vnode *vp, int flags)
1069 int active;
1070 int n;
1071 vm_object_t object;
1074 * If the vnode has already been reclaimed we have nothing to do.
1076 if (vp->v_flag & VRECLAIMED)
1077 return;
1078 vp->v_flag |= VRECLAIMED;
1081 * Scrap the vfs cache
1083 while (cache_inval_vp(vp, 0) != 0) {
1084 kprintf("Warning: vnode %p clean/cache_resolution race detected\n", vp);
1085 tsleep(vp, 0, "vclninv", 2);
1089 * Check to see if the vnode is in use. If so we have to reference it
1090 * before we clean it out so that its count cannot fall to zero and
1091 * generate a race against ourselves to recycle it.
1093 active = sysref_isactive(&vp->v_sysref);
1096 * Clean out any buffers associated with the vnode and destroy its
1097 * object, if it has one.
1099 vinvalbuf(vp, V_SAVE, 0, 0);
1102 * If purging an active vnode (typically during a forced unmount
1103 * or reboot), it must be closed and deactivated before being
1104 * reclaimed. This isn't really all that safe, but what can
1105 * we do? XXX.
1107 * Note that neither of these routines unlocks the vnode.
1109 if (active && (flags & DOCLOSE)) {
1110 while ((n = vp->v_opencount) != 0) {
1111 if (vp->v_writecount)
1112 VOP_CLOSE(vp, FWRITE|FNONBLOCK);
1113 else
1114 VOP_CLOSE(vp, FNONBLOCK);
1115 if (vp->v_opencount == n) {
1116 kprintf("Warning: unable to force-close"
1117 " vnode %p\n", vp);
1118 break;
1124 * If the vnode has not been deactivated, deactivated it. Deactivation
1125 * can create new buffers and VM pages so we have to call vinvalbuf()
1126 * again to make sure they all get flushed.
1128 * This can occur if a file with a link count of 0 needs to be
1129 * truncated.
1131 if ((vp->v_flag & VINACTIVE) == 0) {
1132 vp->v_flag |= VINACTIVE;
1133 VOP_INACTIVE(vp);
1134 vinvalbuf(vp, V_SAVE, 0, 0);
1138 * If the vnode has an object, destroy it.
1140 if ((object = vp->v_object) != NULL) {
1141 if (object->ref_count == 0) {
1142 if ((object->flags & OBJ_DEAD) == 0)
1143 vm_object_terminate(object);
1144 } else {
1145 vm_pager_deallocate(object);
1147 vp->v_flag &= ~VOBJBUF;
1149 KKASSERT((vp->v_flag & VOBJBUF) == 0);
1152 * Reclaim the vnode.
1154 if (VOP_RECLAIM(vp))
1155 panic("vclean: cannot reclaim");
1158 * Done with purge, notify sleepers of the grim news.
1160 vp->v_ops = &dead_vnode_vops_p;
1161 vn_pollgone(vp);
1162 vp->v_tag = VT_NON;
1165 * If we are destroying an active vnode, reactivate it now that
1166 * we have reassociated it with deadfs. This prevents the system
1167 * from crashing on the vnode due to it being unexpectedly marked
1168 * as inactive or reclaimed.
1170 if (active && (flags & DOCLOSE)) {
1171 vp->v_flag &= ~(VINACTIVE|VRECLAIMED);
1176 * Eliminate all activity associated with the requested vnode
1177 * and with all vnodes aliased to the requested vnode.
1179 * The vnode must be referenced and vx_lock()'d
1181 * revoke { struct vnode *a_vp, int a_flags }
1184 vop_stdrevoke(struct vop_revoke_args *ap)
1186 struct vnode *vp, *vq;
1187 lwkt_tokref ilock;
1188 cdev_t dev;
1190 KASSERT((ap->a_flags & REVOKEALL) != 0, ("vop_revoke"));
1192 vp = ap->a_vp;
1195 * If the vnode is already dead don't try to revoke it
1197 if (vp->v_flag & VRECLAIMED)
1198 return (0);
1201 * If the vnode has a device association, scrap all vnodes associated
1202 * with the device. Don't let the device disappear on us while we
1203 * are scrapping the vnodes.
1205 * The passed vp will probably show up in the list, do not VX lock
1206 * it twice!
1208 if (vp->v_type != VCHR)
1209 return(0);
1210 if ((dev = vp->v_rdev) == NULL) {
1211 if ((dev = get_dev(vp->v_umajor, vp->v_uminor)) == NULL)
1212 return(0);
1214 reference_dev(dev);
1215 lwkt_gettoken(&ilock, &spechash_token);
1216 while ((vq = SLIST_FIRST(&dev->si_hlist)) != NULL) {
1217 if (vp != vq)
1218 vx_get(vq);
1219 if (vq == SLIST_FIRST(&dev->si_hlist))
1220 vgone_vxlocked(vq);
1221 if (vp != vq)
1222 vx_put(vq);
1224 lwkt_reltoken(&ilock);
1225 release_dev(dev);
1226 return (0);
1230 * This is called when the object underlying a vnode is being destroyed,
1231 * such as in a remove(). Try to recycle the vnode immediately if the
1232 * only active reference is our reference.
1235 vrecycle(struct vnode *vp)
1237 if (vp->v_sysref.refcnt <= 1) {
1238 vgone_vxlocked(vp);
1239 return (1);
1241 return (0);
1245 * Eliminate all activity associated with a vnode in preparation for reuse.
1247 * The vnode must be VX locked and refd and will remain VX locked and refd
1248 * on return. This routine may be called with the vnode in any state, as
1249 * long as it is VX locked. The vnode will be cleaned out and marked
1250 * VRECLAIMED but will not actually be reused until all existing refs and
1251 * holds go away.
1253 * NOTE: This routine may be called on a vnode which has not yet been
1254 * already been deactivated (VOP_INACTIVE), or on a vnode which has
1255 * already been reclaimed.
1257 * This routine is not responsible for placing us back on the freelist.
1258 * Instead, it happens automatically when the caller releases the VX lock
1259 * (assuming there aren't any other references).
1262 void
1263 vgone_vxlocked(struct vnode *vp)
1266 * assert that the VX lock is held. This is an absolute requirement
1267 * now for vgone_vxlocked() to be called.
1269 KKASSERT(vp->v_lock.lk_exclusivecount == 1);
1272 * Clean out the filesystem specific data and set the VRECLAIMED
1273 * bit. Also deactivate the vnode if necessary.
1275 vclean_vxlocked(vp, DOCLOSE);
1278 * Delete from old mount point vnode list, if on one.
1280 if (vp->v_mount != NULL)
1281 insmntque(vp, NULL);
1284 * If special device, remove it from special device alias list
1285 * if it is on one. This should normally only occur if a vnode is
1286 * being revoked as the device should otherwise have been released
1287 * naturally.
1289 if ((vp->v_type == VBLK || vp->v_type == VCHR) && vp->v_rdev != NULL) {
1290 v_release_rdev(vp);
1294 * Set us to VBAD
1296 vp->v_type = VBAD;
1300 * Lookup a vnode by device number.
1303 vfinddev(cdev_t dev, enum vtype type, struct vnode **vpp)
1305 lwkt_tokref ilock;
1306 struct vnode *vp;
1308 lwkt_gettoken(&ilock, &spechash_token);
1309 SLIST_FOREACH(vp, &dev->si_hlist, v_cdevnext) {
1310 if (type == vp->v_type) {
1311 *vpp = vp;
1312 lwkt_reltoken(&ilock);
1313 return (1);
1316 lwkt_reltoken(&ilock);
1317 return (0);
1321 * Calculate the total number of references to a special device. This
1322 * routine may only be called for VBLK and VCHR vnodes since v_rdev is
1323 * an overloaded field. Since udev2dev can now return NULL, we have
1324 * to check for a NULL v_rdev.
1327 count_dev(cdev_t dev)
1329 lwkt_tokref ilock;
1330 struct vnode *vp;
1331 int count = 0;
1333 if (SLIST_FIRST(&dev->si_hlist)) {
1334 lwkt_gettoken(&ilock, &spechash_token);
1335 SLIST_FOREACH(vp, &dev->si_hlist, v_cdevnext) {
1336 if (vp->v_sysref.refcnt > 0)
1337 count += vp->v_sysref.refcnt;
1339 lwkt_reltoken(&ilock);
1341 return(count);
1345 count_udev(int x, int y)
1347 cdev_t dev;
1349 if ((dev = get_dev(x, y)) == NULL)
1350 return(0);
1351 return(count_dev(dev));
1355 vcount(struct vnode *vp)
1357 if (vp->v_rdev == NULL)
1358 return(0);
1359 return(count_dev(vp->v_rdev));
1363 * Initialize VMIO for a vnode. This routine MUST be called before a
1364 * VFS can issue buffer cache ops on a vnode. It is typically called
1365 * when a vnode is initialized from its inode.
1368 vinitvmio(struct vnode *vp, off_t filesize)
1370 vm_object_t object;
1371 int error = 0;
1373 retry:
1374 if ((object = vp->v_object) == NULL) {
1375 object = vnode_pager_alloc(vp, filesize, 0, 0);
1377 * Dereference the reference we just created. This assumes
1378 * that the object is associated with the vp.
1380 object->ref_count--;
1381 vrele(vp);
1382 } else {
1383 if (object->flags & OBJ_DEAD) {
1384 vn_unlock(vp);
1385 vm_object_dead_sleep(object, "vodead");
1386 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
1387 goto retry;
1390 KASSERT(vp->v_object != NULL, ("vinitvmio: NULL object"));
1391 vp->v_flag |= VOBJBUF;
1392 return (error);
1397 * Print out a description of a vnode.
1399 static char *typename[] =
1400 {"VNON", "VREG", "VDIR", "VBLK", "VCHR", "VLNK", "VSOCK", "VFIFO", "VBAD"};
1402 void
1403 vprint(char *label, struct vnode *vp)
1405 char buf[96];
1407 if (label != NULL)
1408 kprintf("%s: %p: ", label, (void *)vp);
1409 else
1410 kprintf("%p: ", (void *)vp);
1411 kprintf("type %s, sysrefs %d, writecount %d, holdcnt %d,",
1412 typename[vp->v_type],
1413 vp->v_sysref.refcnt, vp->v_writecount, vp->v_auxrefs);
1414 buf[0] = '\0';
1415 if (vp->v_flag & VROOT)
1416 strcat(buf, "|VROOT");
1417 if (vp->v_flag & VTEXT)
1418 strcat(buf, "|VTEXT");
1419 if (vp->v_flag & VSYSTEM)
1420 strcat(buf, "|VSYSTEM");
1421 if (vp->v_flag & VFREE)
1422 strcat(buf, "|VFREE");
1423 if (vp->v_flag & VOBJBUF)
1424 strcat(buf, "|VOBJBUF");
1425 if (buf[0] != '\0')
1426 kprintf(" flags (%s)", &buf[1]);
1427 if (vp->v_data == NULL) {
1428 kprintf("\n");
1429 } else {
1430 kprintf("\n\t");
1431 VOP_PRINT(vp);
1435 #ifdef DDB
1436 #include <ddb/ddb.h>
1438 static int db_show_locked_vnodes(struct mount *mp, void *data);
1441 * List all of the locked vnodes in the system.
1442 * Called when debugging the kernel.
1444 DB_SHOW_COMMAND(lockedvnodes, lockedvnodes)
1446 kprintf("Locked vnodes\n");
1447 mountlist_scan(db_show_locked_vnodes, NULL,
1448 MNTSCAN_FORWARD|MNTSCAN_NOBUSY);
1451 static int
1452 db_show_locked_vnodes(struct mount *mp, void *data __unused)
1454 struct vnode *vp;
1456 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
1457 if (vn_islocked(vp))
1458 vprint((char *)0, vp);
1460 return(0);
1462 #endif
1465 * Top level filesystem related information gathering.
1467 static int sysctl_ovfs_conf (SYSCTL_HANDLER_ARGS);
1469 static int
1470 vfs_sysctl(SYSCTL_HANDLER_ARGS)
1472 int *name = (int *)arg1 - 1; /* XXX */
1473 u_int namelen = arg2 + 1; /* XXX */
1474 struct vfsconf *vfsp;
1476 #if 1 || defined(COMPAT_PRELITE2)
1477 /* Resolve ambiguity between VFS_VFSCONF and VFS_GENERIC. */
1478 if (namelen == 1)
1479 return (sysctl_ovfs_conf(oidp, arg1, arg2, req));
1480 #endif
1482 #ifdef notyet
1483 /* all sysctl names at this level are at least name and field */
1484 if (namelen < 2)
1485 return (ENOTDIR); /* overloaded */
1486 if (name[0] != VFS_GENERIC) {
1487 for (vfsp = vfsconf; vfsp; vfsp = vfsp->vfc_next)
1488 if (vfsp->vfc_typenum == name[0])
1489 break;
1490 if (vfsp == NULL)
1491 return (EOPNOTSUPP);
1492 return ((*vfsp->vfc_vfsops->vfs_sysctl)(&name[1], namelen - 1,
1493 oldp, oldlenp, newp, newlen, p));
1495 #endif
1496 switch (name[1]) {
1497 case VFS_MAXTYPENUM:
1498 if (namelen != 2)
1499 return (ENOTDIR);
1500 return (SYSCTL_OUT(req, &maxvfsconf, sizeof(int)));
1501 case VFS_CONF:
1502 if (namelen != 3)
1503 return (ENOTDIR); /* overloaded */
1504 for (vfsp = vfsconf; vfsp; vfsp = vfsp->vfc_next)
1505 if (vfsp->vfc_typenum == name[2])
1506 break;
1507 if (vfsp == NULL)
1508 return (EOPNOTSUPP);
1509 return (SYSCTL_OUT(req, vfsp, sizeof *vfsp));
1511 return (EOPNOTSUPP);
1514 SYSCTL_NODE(_vfs, VFS_GENERIC, generic, CTLFLAG_RD, vfs_sysctl,
1515 "Generic filesystem");
1517 #if 1 || defined(COMPAT_PRELITE2)
1519 static int
1520 sysctl_ovfs_conf(SYSCTL_HANDLER_ARGS)
1522 int error;
1523 struct vfsconf *vfsp;
1524 struct ovfsconf ovfs;
1526 for (vfsp = vfsconf; vfsp; vfsp = vfsp->vfc_next) {
1527 bzero(&ovfs, sizeof(ovfs));
1528 ovfs.vfc_vfsops = vfsp->vfc_vfsops; /* XXX used as flag */
1529 strcpy(ovfs.vfc_name, vfsp->vfc_name);
1530 ovfs.vfc_index = vfsp->vfc_typenum;
1531 ovfs.vfc_refcount = vfsp->vfc_refcount;
1532 ovfs.vfc_flags = vfsp->vfc_flags;
1533 error = SYSCTL_OUT(req, &ovfs, sizeof ovfs);
1534 if (error)
1535 return error;
1537 return 0;
1540 #endif /* 1 || COMPAT_PRELITE2 */
1543 * Check to see if a filesystem is mounted on a block device.
1546 vfs_mountedon(struct vnode *vp)
1548 cdev_t dev;
1550 if ((dev = vp->v_rdev) == NULL) {
1551 if (vp->v_type != VBLK)
1552 dev = get_dev(vp->v_uminor, vp->v_umajor);
1554 if (dev != NULL && dev->si_mountpoint)
1555 return (EBUSY);
1556 return (0);
1560 * Unmount all filesystems. The list is traversed in reverse order
1561 * of mounting to avoid dependencies.
1564 static int vfs_umountall_callback(struct mount *mp, void *data);
1566 void
1567 vfs_unmountall(void)
1569 int count;
1571 do {
1572 count = mountlist_scan(vfs_umountall_callback,
1573 NULL, MNTSCAN_REVERSE|MNTSCAN_NOBUSY);
1574 } while (count);
1577 static
1579 vfs_umountall_callback(struct mount *mp, void *data)
1581 int error;
1583 error = dounmount(mp, MNT_FORCE);
1584 if (error) {
1585 mountlist_remove(mp);
1586 kprintf("unmount of filesystem mounted from %s failed (",
1587 mp->mnt_stat.f_mntfromname);
1588 if (error == EBUSY)
1589 kprintf("BUSY)\n");
1590 else
1591 kprintf("%d)\n", error);
1593 return(1);
1597 * Build hash lists of net addresses and hang them off the mount point.
1598 * Called by ufs_mount() to set up the lists of export addresses.
1600 static int
1601 vfs_hang_addrlist(struct mount *mp, struct netexport *nep,
1602 const struct export_args *argp)
1604 struct netcred *np;
1605 struct radix_node_head *rnh;
1606 int i;
1607 struct radix_node *rn;
1608 struct sockaddr *saddr, *smask = 0;
1609 struct domain *dom;
1610 int error;
1612 if (argp->ex_addrlen == 0) {
1613 if (mp->mnt_flag & MNT_DEFEXPORTED)
1614 return (EPERM);
1615 np = &nep->ne_defexported;
1616 np->netc_exflags = argp->ex_flags;
1617 np->netc_anon = argp->ex_anon;
1618 np->netc_anon.cr_ref = 1;
1619 mp->mnt_flag |= MNT_DEFEXPORTED;
1620 return (0);
1623 if (argp->ex_addrlen < 0 || argp->ex_addrlen > MLEN)
1624 return (EINVAL);
1625 if (argp->ex_masklen < 0 || argp->ex_masklen > MLEN)
1626 return (EINVAL);
1628 i = sizeof(struct netcred) + argp->ex_addrlen + argp->ex_masklen;
1629 np = (struct netcred *) kmalloc(i, M_NETADDR, M_WAITOK | M_ZERO);
1630 saddr = (struct sockaddr *) (np + 1);
1631 if ((error = copyin(argp->ex_addr, (caddr_t) saddr, argp->ex_addrlen)))
1632 goto out;
1633 if (saddr->sa_len > argp->ex_addrlen)
1634 saddr->sa_len = argp->ex_addrlen;
1635 if (argp->ex_masklen) {
1636 smask = (struct sockaddr *)((caddr_t)saddr + argp->ex_addrlen);
1637 error = copyin(argp->ex_mask, (caddr_t)smask, argp->ex_masklen);
1638 if (error)
1639 goto out;
1640 if (smask->sa_len > argp->ex_masklen)
1641 smask->sa_len = argp->ex_masklen;
1643 i = saddr->sa_family;
1644 if ((rnh = nep->ne_rtable[i]) == 0) {
1646 * Seems silly to initialize every AF when most are not used,
1647 * do so on demand here
1649 SLIST_FOREACH(dom, &domains, dom_next)
1650 if (dom->dom_family == i && dom->dom_rtattach) {
1651 dom->dom_rtattach((void **) &nep->ne_rtable[i],
1652 dom->dom_rtoffset);
1653 break;
1655 if ((rnh = nep->ne_rtable[i]) == 0) {
1656 error = ENOBUFS;
1657 goto out;
1660 rn = (*rnh->rnh_addaddr) ((char *) saddr, (char *) smask, rnh,
1661 np->netc_rnodes);
1662 if (rn == 0 || np != (struct netcred *) rn) { /* already exists */
1663 error = EPERM;
1664 goto out;
1666 np->netc_exflags = argp->ex_flags;
1667 np->netc_anon = argp->ex_anon;
1668 np->netc_anon.cr_ref = 1;
1669 return (0);
1670 out:
1671 kfree(np, M_NETADDR);
1672 return (error);
1675 /* ARGSUSED */
1676 static int
1677 vfs_free_netcred(struct radix_node *rn, void *w)
1679 struct radix_node_head *rnh = (struct radix_node_head *) w;
1681 (*rnh->rnh_deladdr) (rn->rn_key, rn->rn_mask, rnh);
1682 kfree((caddr_t) rn, M_NETADDR);
1683 return (0);
1687 * Free the net address hash lists that are hanging off the mount points.
1689 static void
1690 vfs_free_addrlist(struct netexport *nep)
1692 int i;
1693 struct radix_node_head *rnh;
1695 for (i = 0; i <= AF_MAX; i++)
1696 if ((rnh = nep->ne_rtable[i])) {
1697 (*rnh->rnh_walktree) (rnh, vfs_free_netcred,
1698 (caddr_t) rnh);
1699 kfree((caddr_t) rnh, M_RTABLE);
1700 nep->ne_rtable[i] = 0;
1705 vfs_export(struct mount *mp, struct netexport *nep,
1706 const struct export_args *argp)
1708 int error;
1710 if (argp->ex_flags & MNT_DELEXPORT) {
1711 if (mp->mnt_flag & MNT_EXPUBLIC) {
1712 vfs_setpublicfs(NULL, NULL, NULL);
1713 mp->mnt_flag &= ~MNT_EXPUBLIC;
1715 vfs_free_addrlist(nep);
1716 mp->mnt_flag &= ~(MNT_EXPORTED | MNT_DEFEXPORTED);
1718 if (argp->ex_flags & MNT_EXPORTED) {
1719 if (argp->ex_flags & MNT_EXPUBLIC) {
1720 if ((error = vfs_setpublicfs(mp, nep, argp)) != 0)
1721 return (error);
1722 mp->mnt_flag |= MNT_EXPUBLIC;
1724 if ((error = vfs_hang_addrlist(mp, nep, argp)))
1725 return (error);
1726 mp->mnt_flag |= MNT_EXPORTED;
1728 return (0);
1733 * Set the publicly exported filesystem (WebNFS). Currently, only
1734 * one public filesystem is possible in the spec (RFC 2054 and 2055)
1737 vfs_setpublicfs(struct mount *mp, struct netexport *nep,
1738 const struct export_args *argp)
1740 int error;
1741 struct vnode *rvp;
1742 char *cp;
1745 * mp == NULL -> invalidate the current info, the FS is
1746 * no longer exported. May be called from either vfs_export
1747 * or unmount, so check if it hasn't already been done.
1749 if (mp == NULL) {
1750 if (nfs_pub.np_valid) {
1751 nfs_pub.np_valid = 0;
1752 if (nfs_pub.np_index != NULL) {
1753 FREE(nfs_pub.np_index, M_TEMP);
1754 nfs_pub.np_index = NULL;
1757 return (0);
1761 * Only one allowed at a time.
1763 if (nfs_pub.np_valid != 0 && mp != nfs_pub.np_mount)
1764 return (EBUSY);
1767 * Get real filehandle for root of exported FS.
1769 bzero((caddr_t)&nfs_pub.np_handle, sizeof(nfs_pub.np_handle));
1770 nfs_pub.np_handle.fh_fsid = mp->mnt_stat.f_fsid;
1772 if ((error = VFS_ROOT(mp, &rvp)))
1773 return (error);
1775 if ((error = VFS_VPTOFH(rvp, &nfs_pub.np_handle.fh_fid)))
1776 return (error);
1778 vput(rvp);
1781 * If an indexfile was specified, pull it in.
1783 if (argp->ex_indexfile != NULL) {
1784 int namelen;
1786 error = vn_get_namelen(rvp, &namelen);
1787 if (error)
1788 return (error);
1789 MALLOC(nfs_pub.np_index, char *, namelen, M_TEMP,
1790 M_WAITOK);
1791 error = copyinstr(argp->ex_indexfile, nfs_pub.np_index,
1792 namelen, (size_t *)0);
1793 if (!error) {
1795 * Check for illegal filenames.
1797 for (cp = nfs_pub.np_index; *cp; cp++) {
1798 if (*cp == '/') {
1799 error = EINVAL;
1800 break;
1804 if (error) {
1805 FREE(nfs_pub.np_index, M_TEMP);
1806 return (error);
1810 nfs_pub.np_mount = mp;
1811 nfs_pub.np_valid = 1;
1812 return (0);
1815 struct netcred *
1816 vfs_export_lookup(struct mount *mp, struct netexport *nep,
1817 struct sockaddr *nam)
1819 struct netcred *np;
1820 struct radix_node_head *rnh;
1821 struct sockaddr *saddr;
1823 np = NULL;
1824 if (mp->mnt_flag & MNT_EXPORTED) {
1826 * Lookup in the export list first.
1828 if (nam != NULL) {
1829 saddr = nam;
1830 rnh = nep->ne_rtable[saddr->sa_family];
1831 if (rnh != NULL) {
1832 np = (struct netcred *)
1833 (*rnh->rnh_matchaddr)((char *)saddr,
1834 rnh);
1835 if (np && np->netc_rnodes->rn_flags & RNF_ROOT)
1836 np = NULL;
1840 * If no address match, use the default if it exists.
1842 if (np == NULL && mp->mnt_flag & MNT_DEFEXPORTED)
1843 np = &nep->ne_defexported;
1845 return (np);
1849 * perform msync on all vnodes under a mount point. The mount point must
1850 * be locked. This code is also responsible for lazy-freeing unreferenced
1851 * vnodes whos VM objects no longer contain pages.
1853 * NOTE: MNT_WAIT still skips vnodes in the VXLOCK state.
1855 * NOTE: XXX VOP_PUTPAGES and friends requires that the vnode be locked,
1856 * but vnode_pager_putpages() doesn't lock the vnode. We have to do it
1857 * way up in this high level function.
1859 static int vfs_msync_scan1(struct mount *mp, struct vnode *vp, void *data);
1860 static int vfs_msync_scan2(struct mount *mp, struct vnode *vp, void *data);
1862 void
1863 vfs_msync(struct mount *mp, int flags)
1865 int vmsc_flags;
1867 vmsc_flags = VMSC_GETVP;
1868 if (flags != MNT_WAIT)
1869 vmsc_flags |= VMSC_NOWAIT;
1870 vmntvnodescan(mp, vmsc_flags, vfs_msync_scan1, vfs_msync_scan2,
1871 (void *)flags);
1875 * scan1 is a fast pre-check. There could be hundreds of thousands of
1876 * vnodes, we cannot afford to do anything heavy weight until we have a
1877 * fairly good indication that there is work to do.
1879 static
1881 vfs_msync_scan1(struct mount *mp, struct vnode *vp, void *data)
1883 int flags = (int)data;
1885 if ((vp->v_flag & VRECLAIMED) == 0) {
1886 if (vshouldmsync(vp))
1887 return(0); /* call scan2 */
1888 if ((mp->mnt_flag & MNT_RDONLY) == 0 &&
1889 (vp->v_flag & VOBJDIRTY) &&
1890 (flags == MNT_WAIT || vn_islocked(vp) == 0)) {
1891 return(0); /* call scan2 */
1896 * do not call scan2, continue the loop
1898 return(-1);
1902 * This callback is handed a locked vnode.
1904 static
1906 vfs_msync_scan2(struct mount *mp, struct vnode *vp, void *data)
1908 vm_object_t obj;
1909 int flags = (int)data;
1911 if (vp->v_flag & VRECLAIMED)
1912 return(0);
1914 if ((mp->mnt_flag & MNT_RDONLY) == 0 && (vp->v_flag & VOBJDIRTY)) {
1915 if ((obj = vp->v_object) != NULL) {
1916 vm_object_page_clean(obj, 0, 0,
1917 flags == MNT_WAIT ? OBJPC_SYNC : OBJPC_NOSYNC);
1920 return(0);
1924 * Record a process's interest in events which might happen to
1925 * a vnode. Because poll uses the historic select-style interface
1926 * internally, this routine serves as both the ``check for any
1927 * pending events'' and the ``record my interest in future events''
1928 * functions. (These are done together, while the lock is held,
1929 * to avoid race conditions.)
1932 vn_pollrecord(struct vnode *vp, int events)
1934 lwkt_tokref ilock;
1936 KKASSERT(curthread->td_proc != NULL);
1938 lwkt_gettoken(&ilock, &vp->v_pollinfo.vpi_token);
1939 if (vp->v_pollinfo.vpi_revents & events) {
1941 * This leaves events we are not interested
1942 * in available for the other process which
1943 * which presumably had requested them
1944 * (otherwise they would never have been
1945 * recorded).
1947 events &= vp->v_pollinfo.vpi_revents;
1948 vp->v_pollinfo.vpi_revents &= ~events;
1950 lwkt_reltoken(&ilock);
1951 return events;
1953 vp->v_pollinfo.vpi_events |= events;
1954 selrecord(curthread, &vp->v_pollinfo.vpi_selinfo);
1955 lwkt_reltoken(&ilock);
1956 return 0;
1960 * Note the occurrence of an event. If the VN_POLLEVENT macro is used,
1961 * it is possible for us to miss an event due to race conditions, but
1962 * that condition is expected to be rare, so for the moment it is the
1963 * preferred interface.
1965 void
1966 vn_pollevent(struct vnode *vp, int events)
1968 lwkt_tokref ilock;
1970 lwkt_gettoken(&ilock, &vp->v_pollinfo.vpi_token);
1971 if (vp->v_pollinfo.vpi_events & events) {
1973 * We clear vpi_events so that we don't
1974 * call selwakeup() twice if two events are
1975 * posted before the polling process(es) is
1976 * awakened. This also ensures that we take at
1977 * most one selwakeup() if the polling process
1978 * is no longer interested. However, it does
1979 * mean that only one event can be noticed at
1980 * a time. (Perhaps we should only clear those
1981 * event bits which we note?) XXX
1983 vp->v_pollinfo.vpi_events = 0; /* &= ~events ??? */
1984 vp->v_pollinfo.vpi_revents |= events;
1985 selwakeup(&vp->v_pollinfo.vpi_selinfo);
1987 lwkt_reltoken(&ilock);
1991 * Wake up anyone polling on vp because it is being revoked.
1992 * This depends on dead_poll() returning POLLHUP for correct
1993 * behavior.
1995 void
1996 vn_pollgone(struct vnode *vp)
1998 lwkt_tokref ilock;
2000 lwkt_gettoken(&ilock, &vp->v_pollinfo.vpi_token);
2001 if (vp->v_pollinfo.vpi_events) {
2002 vp->v_pollinfo.vpi_events = 0;
2003 selwakeup(&vp->v_pollinfo.vpi_selinfo);
2005 lwkt_reltoken(&ilock);
2009 * extract the cdev_t from a VBLK or VCHR. The vnode must have been opened
2010 * (or v_rdev might be NULL).
2012 cdev_t
2013 vn_todev(struct vnode *vp)
2015 if (vp->v_type != VBLK && vp->v_type != VCHR)
2016 return (NULL);
2017 KKASSERT(vp->v_rdev != NULL);
2018 return (vp->v_rdev);
2022 * Check if vnode represents a disk device. The vnode does not need to be
2023 * opened.
2026 vn_isdisk(struct vnode *vp, int *errp)
2028 cdev_t dev;
2030 if (vp->v_type != VCHR) {
2031 if (errp != NULL)
2032 *errp = ENOTBLK;
2033 return (0);
2036 if ((dev = vp->v_rdev) == NULL)
2037 dev = get_dev(vp->v_umajor, vp->v_uminor);
2039 if (dev == NULL) {
2040 if (errp != NULL)
2041 *errp = ENXIO;
2042 return (0);
2044 if (dev_is_good(dev) == 0) {
2045 if (errp != NULL)
2046 *errp = ENXIO;
2047 return (0);
2049 if ((dev_dflags(dev) & D_DISK) == 0) {
2050 if (errp != NULL)
2051 *errp = ENOTBLK;
2052 return (0);
2054 if (errp != NULL)
2055 *errp = 0;
2056 return (1);
2060 vn_get_namelen(struct vnode *vp, int *namelen)
2062 int error, retval[2];
2064 error = VOP_PATHCONF(vp, _PC_NAME_MAX, retval);
2065 if (error)
2066 return (error);
2067 *namelen = *retval;
2068 return (0);
2072 vop_write_dirent(int *error, struct uio *uio, ino_t d_ino, uint8_t d_type,
2073 uint16_t d_namlen, const char *d_name)
2075 struct dirent *dp;
2076 size_t len;
2078 len = _DIRENT_RECLEN(d_namlen);
2079 if (len > uio->uio_resid)
2080 return(1);
2082 dp = kmalloc(len, M_TEMP, M_WAITOK | M_ZERO);
2084 dp->d_ino = d_ino;
2085 dp->d_namlen = d_namlen;
2086 dp->d_type = d_type;
2087 bcopy(d_name, dp->d_name, d_namlen);
2089 *error = uiomove((caddr_t)dp, len, uio);
2091 kfree(dp, M_TEMP);
2093 return(0);