func() -> func(void) style.
[dragonfly.git] / sys / kern / vfs_subr.c
CommitLineData
984263bc
MD
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.
9 *
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.
25 *
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.
37 *
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 $
6ef943a3 40 * $DragonFly: src/sys/kern/vfs_subr.c,v 1.23 2003/11/03 17:11:21 dillon Exp $
984263bc
MD
41 */
42
43/*
44 * External virtual filesystem routines
45 */
46#include "opt_ddb.h"
47
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>
984263bc 61#include <sys/proc.h>
dadab5e9 62#include <sys/namei.h>
984263bc
MD
63#include <sys/reboot.h>
64#include <sys/socket.h>
65#include <sys/stat.h>
66#include <sys/sysctl.h>
67#include <sys/syslog.h>
68#include <sys/vmmeter.h>
69#include <sys/vnode.h>
70
71#include <machine/limits.h>
72
73#include <vm/vm.h>
74#include <vm/vm_object.h>
75#include <vm/vm_extern.h>
6ef943a3 76#include <vm/vm_kern.h>
984263bc
MD
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>
83
3020e3be 84#include <sys/buf2.h>
f5865223 85#include <sys/thread2.h>
3020e3be 86
984263bc
MD
87static MALLOC_DEFINE(M_NETADDR, "Export Host", "Export host address structure");
88
402ed7e1
RG
89static void insmntque (struct vnode *vp, struct mount *mp);
90static void vclean (struct vnode *vp, int flags, struct thread *td);
984263bc
MD
91static unsigned long numvnodes;
92static void vlruvp(struct vnode *vp);
93SYSCTL_INT(_debug, OID_AUTO, numvnodes, CTLFLAG_RD, &numvnodes, 0, "");
94
95enum vtype iftovt_tab[16] = {
96 VNON, VFIFO, VCHR, VNON, VDIR, VNON, VBLK, VNON,
97 VREG, VNON, VLNK, VNON, VSOCK, VNON, VNON, VBAD,
98};
99int vttoif_tab[9] = {
100 0, S_IFREG, S_IFDIR, S_IFBLK, S_IFCHR, S_IFLNK,
101 S_IFSOCK, S_IFIFO, S_IFMT,
102};
103
104static TAILQ_HEAD(freelst, vnode) vnode_free_list; /* vnode free list */
105
106static u_long wantfreevnodes = 25;
107SYSCTL_INT(_debug, OID_AUTO, wantfreevnodes, CTLFLAG_RW, &wantfreevnodes, 0, "");
108static u_long freevnodes = 0;
109SYSCTL_INT(_debug, OID_AUTO, freevnodes, CTLFLAG_RD, &freevnodes, 0, "");
110
111static int reassignbufcalls;
112SYSCTL_INT(_vfs, OID_AUTO, reassignbufcalls, CTLFLAG_RW, &reassignbufcalls, 0, "");
113static int reassignbufloops;
114SYSCTL_INT(_vfs, OID_AUTO, reassignbufloops, CTLFLAG_RW, &reassignbufloops, 0, "");
115static int reassignbufsortgood;
116SYSCTL_INT(_vfs, OID_AUTO, reassignbufsortgood, CTLFLAG_RW, &reassignbufsortgood, 0, "");
117static int reassignbufsortbad;
118SYSCTL_INT(_vfs, OID_AUTO, reassignbufsortbad, CTLFLAG_RW, &reassignbufsortbad, 0, "");
119static int reassignbufmethod = 1;
120SYSCTL_INT(_vfs, OID_AUTO, reassignbufmethod, CTLFLAG_RW, &reassignbufmethod, 0, "");
984263bc
MD
121
122#ifdef ENABLE_VFS_IOOPT
123int vfs_ioopt = 0;
124SYSCTL_INT(_vfs, OID_AUTO, ioopt, CTLFLAG_RW, &vfs_ioopt, 0, "");
125#endif
126
127struct mntlist mountlist = TAILQ_HEAD_INITIALIZER(mountlist); /* mounted fs */
8a8d5d85
MD
128struct lwkt_token mountlist_token;
129struct lwkt_token mntvnode_token;
984263bc 130int nfs_mount_type = -1;
8a8d5d85
MD
131static struct lwkt_token mntid_token;
132static struct lwkt_token vnode_free_list_token;
133static struct lwkt_token spechash_token;
984263bc
MD
134struct nfs_public nfs_pub; /* publicly exported FS */
135static vm_zone_t vnode_zone;
136
137/*
138 * The workitem queue.
139 */
140#define SYNCER_MAXDELAY 32
141static int syncer_maxdelay = SYNCER_MAXDELAY; /* maximum delay time */
142time_t syncdelay = 30; /* max time to delay syncing data */
99138c2f
HP
143SYSCTL_INT(_kern, OID_AUTO, syncdelay, CTLFLAG_RW, &syncdelay, 0,
144 "VFS data synchronization delay");
984263bc 145time_t filedelay = 30; /* time to delay syncing files */
99138c2f
HP
146SYSCTL_INT(_kern, OID_AUTO, filedelay, CTLFLAG_RW, &filedelay, 0,
147 "File synchronization delay");
984263bc 148time_t dirdelay = 29; /* time to delay syncing directories */
99138c2f
HP
149SYSCTL_INT(_kern, OID_AUTO, dirdelay, CTLFLAG_RW, &dirdelay, 0,
150 "Directory synchronization delay");
984263bc 151time_t metadelay = 28; /* time to delay syncing metadata */
99138c2f
HP
152SYSCTL_INT(_kern, OID_AUTO, metadelay, CTLFLAG_RW, &metadelay, 0,
153 "VFS metadata synchronization delay");
984263bc
MD
154static int rushjob; /* number of slots to run ASAP */
155static int stat_rush_requests; /* number of times I/O speeded up */
156SYSCTL_INT(_debug, OID_AUTO, rush_requests, CTLFLAG_RW, &stat_rush_requests, 0, "");
157
158static int syncer_delayno = 0;
159static long syncer_mask;
160LIST_HEAD(synclist, vnode);
161static struct synclist *syncer_workitem_pending;
162
163int desiredvnodes;
164SYSCTL_INT(_kern, KERN_MAXVNODES, maxvnodes, CTLFLAG_RW,
165 &desiredvnodes, 0, "Maximum number of vnodes");
166static int minvnodes;
167SYSCTL_INT(_kern, OID_AUTO, minvnodes, CTLFLAG_RW,
168 &minvnodes, 0, "Minimum number of vnodes");
169static int vnlru_nowhere = 0;
170SYSCTL_INT(_debug, OID_AUTO, vnlru_nowhere, CTLFLAG_RW, &vnlru_nowhere, 0,
171 "Number of times the vnlru process ran without success");
172
402ed7e1
RG
173static void vfs_free_addrlist (struct netexport *nep);
174static int vfs_free_netcred (struct radix_node *rn, void *w);
175static int vfs_hang_addrlist (struct mount *mp, struct netexport *nep,
176 struct export_args *argp);
984263bc
MD
177
178/*
179 * Initialize the vnode management data structures.
180 */
181void
182vntblinit()
183{
184
6ef943a3
MD
185 /*
186 * Desired vnodes is a result of the physical page count
187 * and the size of kernel's heap. It scales in proportion
188 * to the amount of available physical memory. This can
189 * cause trouble on 64-bit and large memory platforms.
190 */
191 /* desiredvnodes = maxproc + vmstats.v_page_count / 4; */
192 desiredvnodes =
193 min(maxproc + vmstats.v_page_count /4,
194 2 * (VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS) /
195 (5 * (sizeof(struct vm_object) + sizeof(struct vnode))));
196
984263bc 197 minvnodes = desiredvnodes / 4;
8a8d5d85
MD
198 lwkt_inittoken(&mntvnode_token);
199 lwkt_inittoken(&mntid_token);
200 lwkt_inittoken(&spechash_token);
984263bc 201 TAILQ_INIT(&vnode_free_list);
8a8d5d85 202 lwkt_inittoken(&vnode_free_list_token);
984263bc
MD
203 vnode_zone = zinit("VNODE", sizeof (struct vnode), 0, 0, 5);
204 /*
205 * Initialize the filesystem syncer.
206 */
207 syncer_workitem_pending = hashinit(syncer_maxdelay, M_VNODE,
208 &syncer_mask);
209 syncer_maxdelay = syncer_mask + 1;
210}
211
212/*
213 * Mark a mount point as busy. Used to synchronize access and to delay
214 * unmounting. Interlock is not released on failure.
215 */
216int
8a8d5d85 217vfs_busy(struct mount *mp, int flags, struct lwkt_token *interlkp,
dadab5e9 218 struct thread *td)
984263bc
MD
219{
220 int lkflags;
221
222 if (mp->mnt_kern_flag & MNTK_UNMOUNT) {
223 if (flags & LK_NOWAIT)
224 return (ENOENT);
225 mp->mnt_kern_flag |= MNTK_MWAIT;
226 if (interlkp) {
8a8d5d85 227 lwkt_reltoken(interlkp);
984263bc
MD
228 }
229 /*
230 * Since all busy locks are shared except the exclusive
231 * lock granted when unmounting, the only place that a
232 * wakeup needs to be done is at the release of the
233 * exclusive lock at the end of dounmount.
234 */
377d4740 235 tsleep((caddr_t)mp, 0, "vfs_busy", 0);
984263bc 236 if (interlkp) {
8a8d5d85 237 lwkt_gettoken(interlkp);
984263bc
MD
238 }
239 return (ENOENT);
240 }
241 lkflags = LK_SHARED | LK_NOPAUSE;
242 if (interlkp)
243 lkflags |= LK_INTERLOCK;
dadab5e9 244 if (lockmgr(&mp->mnt_lock, lkflags, interlkp, td))
984263bc
MD
245 panic("vfs_busy: unexpected lock failure");
246 return (0);
247}
248
249/*
250 * Free a busy filesystem.
251 */
252void
dadab5e9 253vfs_unbusy(struct mount *mp, struct thread *td)
984263bc 254{
dadab5e9 255 lockmgr(&mp->mnt_lock, LK_RELEASE, NULL, td);
984263bc
MD
256}
257
258/*
259 * Lookup a filesystem type, and if found allocate and initialize
260 * a mount structure for it.
261 *
262 * Devname is usually updated by mount(8) after booting.
263 */
264int
dadab5e9 265vfs_rootmountalloc(char *fstypename, char *devname, struct mount **mpp)
984263bc 266{
dadab5e9 267 struct thread *td = curthread; /* XXX */
984263bc
MD
268 struct vfsconf *vfsp;
269 struct mount *mp;
270
271 if (fstypename == NULL)
272 return (ENODEV);
273 for (vfsp = vfsconf; vfsp; vfsp = vfsp->vfc_next)
274 if (!strcmp(vfsp->vfc_name, fstypename))
275 break;
276 if (vfsp == NULL)
277 return (ENODEV);
278 mp = malloc((u_long)sizeof(struct mount), M_MOUNT, M_WAITOK);
279 bzero((char *)mp, (u_long)sizeof(struct mount));
377d4740 280 lockinit(&mp->mnt_lock, 0, "vfslock", VLKTIMEOUT, LK_NOPAUSE);
dadab5e9 281 (void)vfs_busy(mp, LK_NOWAIT, 0, td);
984263bc
MD
282 TAILQ_INIT(&mp->mnt_nvnodelist);
283 TAILQ_INIT(&mp->mnt_reservedvnlist);
284 mp->mnt_nvnodelistsize = 0;
285 mp->mnt_vfc = vfsp;
286 mp->mnt_op = vfsp->vfc_vfsops;
287 mp->mnt_flag = MNT_RDONLY;
288 mp->mnt_vnodecovered = NULLVP;
289 vfsp->vfc_refcount++;
290 mp->mnt_iosize_max = DFLTPHYS;
291 mp->mnt_stat.f_type = vfsp->vfc_typenum;
292 mp->mnt_flag |= vfsp->vfc_flags & MNT_VISFLAGMASK;
293 strncpy(mp->mnt_stat.f_fstypename, vfsp->vfc_name, MFSNAMELEN);
294 mp->mnt_stat.f_mntonname[0] = '/';
295 mp->mnt_stat.f_mntonname[1] = 0;
296 (void) copystr(devname, mp->mnt_stat.f_mntfromname, MNAMELEN - 1, 0);
297 *mpp = mp;
298 return (0);
299}
300
301/*
302 * Find an appropriate filesystem to use for the root. If a filesystem
303 * has not been preselected, walk through the list of known filesystems
304 * trying those that have mountroot routines, and try them until one
305 * works or we have tried them all.
306 */
307#ifdef notdef /* XXX JH */
308int
309lite2_vfs_mountroot()
310{
311 struct vfsconf *vfsp;
402ed7e1 312 extern int (*lite2_mountroot) (void);
984263bc
MD
313 int error;
314
315 if (lite2_mountroot != NULL)
316 return ((*lite2_mountroot)());
317 for (vfsp = vfsconf; vfsp; vfsp = vfsp->vfc_next) {
318 if (vfsp->vfc_mountroot == NULL)
319 continue;
320 if ((error = (*vfsp->vfc_mountroot)()) == 0)
321 return (0);
322 printf("%s_mountroot failed: %d\n", vfsp->vfc_name, error);
323 }
324 return (ENODEV);
325}
326#endif
327
328/*
329 * Lookup a mount point by filesystem identifier.
330 */
331struct mount *
332vfs_getvfs(fsid)
333 fsid_t *fsid;
334{
1fd87d54 335 struct mount *mp;
984263bc 336
8a8d5d85 337 lwkt_gettoken(&mountlist_token);
984263bc
MD
338 TAILQ_FOREACH(mp, &mountlist, mnt_list) {
339 if (mp->mnt_stat.f_fsid.val[0] == fsid->val[0] &&
340 mp->mnt_stat.f_fsid.val[1] == fsid->val[1]) {
8a8d5d85 341 lwkt_reltoken(&mountlist_token);
984263bc
MD
342 return (mp);
343 }
344 }
8a8d5d85 345 lwkt_reltoken(&mountlist_token);
984263bc
MD
346 return ((struct mount *) 0);
347}
348
349/*
350 * Get a new unique fsid. Try to make its val[0] unique, since this value
351 * will be used to create fake device numbers for stat(). Also try (but
352 * not so hard) make its val[0] unique mod 2^16, since some emulators only
353 * support 16-bit device numbers. We end up with unique val[0]'s for the
354 * first 2^16 calls and unique val[0]'s mod 2^16 for the first 2^8 calls.
355 *
356 * Keep in mind that several mounts may be running in parallel. Starting
357 * the search one past where the previous search terminated is both a
358 * micro-optimization and a defense against returning the same fsid to
359 * different mounts.
360 */
361void
362vfs_getnewfsid(mp)
363 struct mount *mp;
364{
365 static u_int16_t mntid_base;
366 fsid_t tfsid;
367 int mtype;
368
8a8d5d85 369 lwkt_gettoken(&mntid_token);
984263bc
MD
370 mtype = mp->mnt_vfc->vfc_typenum;
371 tfsid.val[1] = mtype;
372 mtype = (mtype & 0xFF) << 24;
373 for (;;) {
374 tfsid.val[0] = makeudev(255,
375 mtype | ((mntid_base & 0xFF00) << 8) | (mntid_base & 0xFF));
376 mntid_base++;
377 if (vfs_getvfs(&tfsid) == NULL)
378 break;
379 }
380 mp->mnt_stat.f_fsid.val[0] = tfsid.val[0];
381 mp->mnt_stat.f_fsid.val[1] = tfsid.val[1];
8a8d5d85 382 lwkt_reltoken(&mntid_token);
984263bc
MD
383}
384
385/*
386 * Knob to control the precision of file timestamps:
387 *
388 * 0 = seconds only; nanoseconds zeroed.
389 * 1 = seconds and nanoseconds, accurate within 1/HZ.
390 * 2 = seconds and nanoseconds, truncated to microseconds.
391 * >=3 = seconds and nanoseconds, maximum precision.
392 */
393enum { TSP_SEC, TSP_HZ, TSP_USEC, TSP_NSEC };
394
395static int timestamp_precision = TSP_SEC;
396SYSCTL_INT(_vfs, OID_AUTO, timestamp_precision, CTLFLAG_RW,
397 &timestamp_precision, 0, "");
398
399/*
400 * Get a current timestamp.
401 */
402void
403vfs_timestamp(tsp)
404 struct timespec *tsp;
405{
406 struct timeval tv;
407
408 switch (timestamp_precision) {
409 case TSP_SEC:
410 tsp->tv_sec = time_second;
411 tsp->tv_nsec = 0;
412 break;
413 case TSP_HZ:
414 getnanotime(tsp);
415 break;
416 case TSP_USEC:
417 microtime(&tv);
418 TIMEVAL_TO_TIMESPEC(&tv, tsp);
419 break;
420 case TSP_NSEC:
421 default:
422 nanotime(tsp);
423 break;
424 }
425}
426
427/*
428 * Set vnode attributes to VNOVAL
429 */
430void
431vattr_null(vap)
1fd87d54 432 struct vattr *vap;
984263bc
MD
433{
434
435 vap->va_type = VNON;
436 vap->va_size = VNOVAL;
437 vap->va_bytes = VNOVAL;
438 vap->va_mode = VNOVAL;
439 vap->va_nlink = VNOVAL;
440 vap->va_uid = VNOVAL;
441 vap->va_gid = VNOVAL;
442 vap->va_fsid = VNOVAL;
443 vap->va_fileid = VNOVAL;
444 vap->va_blocksize = VNOVAL;
445 vap->va_rdev = VNOVAL;
446 vap->va_atime.tv_sec = VNOVAL;
447 vap->va_atime.tv_nsec = VNOVAL;
448 vap->va_mtime.tv_sec = VNOVAL;
449 vap->va_mtime.tv_nsec = VNOVAL;
450 vap->va_ctime.tv_sec = VNOVAL;
451 vap->va_ctime.tv_nsec = VNOVAL;
452 vap->va_flags = VNOVAL;
453 vap->va_gen = VNOVAL;
454 vap->va_vaflags = 0;
455}
456
457/*
458 * This routine is called when we have too many vnodes. It attempts
459 * to free <count> vnodes and will potentially free vnodes that still
460 * have VM backing store (VM backing store is typically the cause
461 * of a vnode blowout so we want to do this). Therefore, this operation
462 * is not considered cheap.
463 *
464 * A number of conditions may prevent a vnode from being reclaimed.
465 * the buffer cache may have references on the vnode, a directory
466 * vnode may still have references due to the namei cache representing
467 * underlying files, or the vnode may be in active use. It is not
468 * desireable to reuse such vnodes. These conditions may cause the
469 * number of vnodes to reach some minimum value regardless of what
470 * you set kern.maxvnodes to. Do not set kern.maxvnodes too low.
471 */
472static int
473vlrureclaim(struct mount *mp)
474{
475 struct vnode *vp;
476 int done;
477 int trigger;
478 int usevnodes;
479 int count;
8a8d5d85 480 int gen;
984263bc
MD
481
482 /*
483 * Calculate the trigger point, don't allow user
484 * screwups to blow us up. This prevents us from
485 * recycling vnodes with lots of resident pages. We
486 * aren't trying to free memory, we are trying to
487 * free vnodes.
488 */
489 usevnodes = desiredvnodes;
490 if (usevnodes <= 0)
491 usevnodes = 1;
12e4aaff 492 trigger = vmstats.v_page_count * 2 / usevnodes;
984263bc
MD
493
494 done = 0;
8a8d5d85 495 gen = lwkt_gettoken(&mntvnode_token);
984263bc
MD
496 count = mp->mnt_nvnodelistsize / 10 + 1;
497 while (count && (vp = TAILQ_FIRST(&mp->mnt_nvnodelist)) != NULL) {
498 TAILQ_REMOVE(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
499 TAILQ_INSERT_TAIL(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
500
501 if (vp->v_type != VNON &&
502 vp->v_type != VBAD &&
503 VMIGHTFREE(vp) && /* critical path opt */
8a8d5d85 504 (vp->v_object == NULL || vp->v_object->resident_page_count < trigger)
984263bc 505 ) {
8a8d5d85
MD
506 lwkt_gettoken(&vp->v_interlock);
507 if (lwkt_gentoken(&mntvnode_token, &gen) == 0) {
508 if (VMIGHTFREE(vp)) {
509 vgonel(vp, curthread);
510 done++;
511 } else {
512 lwkt_reltoken(&vp->v_interlock);
513 }
984263bc 514 } else {
8a8d5d85 515 lwkt_reltoken(&vp->v_interlock);
984263bc 516 }
984263bc
MD
517 }
518 --count;
519 }
8a8d5d85 520 lwkt_reltoken(&mntvnode_token);
984263bc
MD
521 return done;
522}
523
524/*
525 * Attempt to recycle vnodes in a context that is always safe to block.
526 * Calling vlrurecycle() from the bowels of file system code has some
527 * interesting deadlock problems.
528 */
bc6dffab 529static struct thread *vnlruthread;
984263bc
MD
530static int vnlruproc_sig;
531
532static void
533vnlru_proc(void)
534{
535 struct mount *mp, *nmp;
536 int s;
537 int done;
0cfcada1 538 struct thread *td = curthread;
984263bc 539
bc6dffab 540 EVENTHANDLER_REGISTER(shutdown_pre_sync, shutdown_kproc, td,
984263bc
MD
541 SHUTDOWN_PRI_FIRST);
542
543 s = splbio();
544 for (;;) {
0cfcada1 545 kproc_suspend_loop();
984263bc
MD
546 if (numvnodes - freevnodes <= desiredvnodes * 9 / 10) {
547 vnlruproc_sig = 0;
548 wakeup(&vnlruproc_sig);
377d4740 549 tsleep(td, 0, "vlruwt", hz);
984263bc
MD
550 continue;
551 }
552 done = 0;
8a8d5d85 553 lwkt_gettoken(&mountlist_token);
984263bc 554 for (mp = TAILQ_FIRST(&mountlist); mp != NULL; mp = nmp) {
8a8d5d85 555 if (vfs_busy(mp, LK_NOWAIT, &mountlist_token, td)) {
984263bc
MD
556 nmp = TAILQ_NEXT(mp, mnt_list);
557 continue;
558 }
559 done += vlrureclaim(mp);
8a8d5d85 560 lwkt_gettoken(&mountlist_token);
984263bc 561 nmp = TAILQ_NEXT(mp, mnt_list);
dadab5e9 562 vfs_unbusy(mp, td);
984263bc 563 }
8a8d5d85 564 lwkt_reltoken(&mountlist_token);
984263bc
MD
565 if (done == 0) {
566 vnlru_nowhere++;
377d4740 567 tsleep(td, 0, "vlrup", hz * 3);
984263bc
MD
568 }
569 }
570 splx(s);
571}
572
573static struct kproc_desc vnlru_kp = {
574 "vnlru",
575 vnlru_proc,
bc6dffab 576 &vnlruthread
984263bc
MD
577};
578SYSINIT(vnlru, SI_SUB_KTHREAD_UPDATE, SI_ORDER_FIRST, kproc_start, &vnlru_kp)
579
580/*
581 * Routines having to do with the management of the vnode table.
582 */
583extern vop_t **dead_vnodeop_p;
584
585/*
586 * Return the next vnode from the free list.
587 */
588int
589getnewvnode(tag, mp, vops, vpp)
590 enum vtagtype tag;
591 struct mount *mp;
592 vop_t **vops;
593 struct vnode **vpp;
594{
595 int s;
8a8d5d85
MD
596 int gen;
597 int vgen;
dadab5e9 598 struct thread *td = curthread; /* XXX */
984263bc
MD
599 struct vnode *vp = NULL;
600 vm_object_t object;
601
602 s = splbio();
603
604 /*
605 * Try to reuse vnodes if we hit the max. This situation only
606 * occurs in certain large-memory (2G+) situations. We cannot
607 * attempt to directly reclaim vnodes due to nasty recursion
608 * problems.
609 */
610 while (numvnodes - freevnodes > desiredvnodes) {
611 if (vnlruproc_sig == 0) {
612 vnlruproc_sig = 1; /* avoid unnecessary wakeups */
bc6dffab 613 wakeup(vnlruthread);
984263bc 614 }
377d4740 615 tsleep(&vnlruproc_sig, 0, "vlruwk", hz);
984263bc
MD
616 }
617
618
619 /*
620 * Attempt to reuse a vnode already on the free list, allocating
621 * a new vnode if we can't find one or if we have not reached a
622 * good minimum for good LRU performance.
623 */
8a8d5d85 624 gen = lwkt_gettoken(&vnode_free_list_token);
984263bc
MD
625 if (freevnodes >= wantfreevnodes && numvnodes >= minvnodes) {
626 int count;
627
628 for (count = 0; count < freevnodes; count++) {
629 vp = TAILQ_FIRST(&vnode_free_list);
630 if (vp == NULL || vp->v_usecount)
631 panic("getnewvnode: free vnode isn't");
632
8a8d5d85
MD
633 /*
634 * Get the vnode's interlock, then re-obtain
635 * vnode_free_list_token in case we lost it. If we
636 * did lose it while getting the vnode interlock,
637 * even if we got it back again, then retry.
638 */
639 vgen = lwkt_gettoken(&vp->v_interlock);
640 if (lwkt_gentoken(&vnode_free_list_token, &gen) != 0) {
641 --count;
642 lwkt_reltoken(&vp->v_interlock);
643 vp = NULL;
644 continue;
645 }
646
647 /*
648 * Whew! We have both tokens. Since we didn't lose
649 * the free list VFREE had better still be set. But
650 * we aren't out of the woods yet. We have to get
651 * the object (may block). If the vnode is not
652 * suitable then move it to the end of the list
653 * if we can. If we can't move it to the end of the
654 * list retry again.
655 */
984263bc 656 if ((VOP_GETVOBJECT(vp, &object) == 0 &&
8a8d5d85
MD
657 (object->resident_page_count || object->ref_count))
658 ) {
659 if (lwkt_gentoken(&vp->v_interlock, &vgen) == 0 &&
660 lwkt_gentoken(&vnode_free_list_token, &gen) == 0
661 ) {
662 TAILQ_REMOVE(&vnode_free_list, vp, v_freelist);
663 TAILQ_INSERT_TAIL(&vnode_free_list, vp, v_freelist);
664 } else {
665 --count;
666 }
667 lwkt_reltoken(&vp->v_interlock);
668 vp = NULL;
669 continue;
670 }
671
672 /*
673 * Still not out of the woods. VOBJECT might have
674 * blocked, if we did not retain our tokens we have
675 * to retry.
676 */
677 if (lwkt_gentoken(&vp->v_interlock, &vgen) != 0 ||
678 lwkt_gentoken(&vnode_free_list_token, &gen) != 0) {
679 --count;
984263bc
MD
680 vp = NULL;
681 continue;
682 }
8a8d5d85
MD
683 TAILQ_REMOVE(&vnode_free_list, vp, v_freelist);
684 KKASSERT(vp->v_flag & VFREE);
685
7ea21ed1
MD
686 /*
687 * If we have children in the namecache we cannot
688 * reuse the vnode yet because it will break the
689 * namecache chain (YYY use nc_refs for the check?)
690 */
691 if (TAILQ_FIRST(&vp->v_namecache)) {
692 if (cache_leaf_test(vp) < 0) {
8a8d5d85 693 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
694 TAILQ_INSERT_TAIL(&vnode_free_list, vp, v_freelist);
695 vp = NULL;
696 continue;
697 }
698 }
699 break;
700 }
701 }
702
703 if (vp) {
704 vp->v_flag |= VDOOMED;
705 vp->v_flag &= ~VFREE;
706 freevnodes--;
8a8d5d85
MD
707 lwkt_reltoken(&vnode_free_list_token);
708 cache_purge(vp); /* YYY may block */
984263bc
MD
709 vp->v_lease = NULL;
710 if (vp->v_type != VBAD) {
dadab5e9 711 vgonel(vp, td);
984263bc 712 } else {
8a8d5d85 713 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
714 }
715
716#ifdef INVARIANTS
717 {
718 int s;
719
720 if (vp->v_data)
721 panic("cleaned vnode isn't");
722 s = splbio();
723 if (vp->v_numoutput)
724 panic("Clean vnode has pending I/O's");
725 splx(s);
726 }
727#endif
728 vp->v_flag = 0;
729 vp->v_lastw = 0;
730 vp->v_lasta = 0;
731 vp->v_cstart = 0;
732 vp->v_clen = 0;
733 vp->v_socket = 0;
734 vp->v_writecount = 0; /* XXX */
735 } else {
8a8d5d85 736 lwkt_reltoken(&vnode_free_list_token);
984263bc
MD
737 vp = (struct vnode *) zalloc(vnode_zone);
738 bzero((char *) vp, sizeof *vp);
8a8d5d85 739 lwkt_inittoken(&vp->v_interlock);
984263bc
MD
740 vp->v_dd = vp;
741 cache_purge(vp);
7ea21ed1 742 TAILQ_INIT(&vp->v_namecache);
984263bc
MD
743 numvnodes++;
744 }
745
746 TAILQ_INIT(&vp->v_cleanblkhd);
747 TAILQ_INIT(&vp->v_dirtyblkhd);
748 vp->v_type = VNON;
749 vp->v_tag = tag;
750 vp->v_op = vops;
751 insmntque(vp, mp);
752 *vpp = vp;
753 vp->v_usecount = 1;
754 vp->v_data = 0;
755 splx(s);
756
3b568787 757 vfs_object_create(vp, td);
984263bc
MD
758 return (0);
759}
760
761/*
762 * Move a vnode from one mount queue to another.
763 */
764static void
765insmntque(vp, mp)
1fd87d54
RG
766 struct vnode *vp;
767 struct mount *mp;
984263bc
MD
768{
769
8a8d5d85 770 lwkt_gettoken(&mntvnode_token);
984263bc
MD
771 /*
772 * Delete from old mount point vnode list, if on one.
773 */
774 if (vp->v_mount != NULL) {
775 KASSERT(vp->v_mount->mnt_nvnodelistsize > 0,
776 ("bad mount point vnode list size"));
777 TAILQ_REMOVE(&vp->v_mount->mnt_nvnodelist, vp, v_nmntvnodes);
778 vp->v_mount->mnt_nvnodelistsize--;
779 }
780 /*
781 * Insert into list of vnodes for the new mount point, if available.
782 */
783 if ((vp->v_mount = mp) == NULL) {
8a8d5d85 784 lwkt_reltoken(&mntvnode_token);
984263bc
MD
785 return;
786 }
787 TAILQ_INSERT_TAIL(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
788 mp->mnt_nvnodelistsize++;
8a8d5d85 789 lwkt_reltoken(&mntvnode_token);
984263bc
MD
790}
791
792/*
793 * Update outstanding I/O count and do wakeup if requested.
794 */
795void
796vwakeup(bp)
1fd87d54 797 struct buf *bp;
984263bc 798{
1fd87d54 799 struct vnode *vp;
984263bc
MD
800
801 bp->b_flags &= ~B_WRITEINPROG;
802 if ((vp = bp->b_vp)) {
803 vp->v_numoutput--;
804 if (vp->v_numoutput < 0)
805 panic("vwakeup: neg numoutput");
806 if ((vp->v_numoutput == 0) && (vp->v_flag & VBWAIT)) {
807 vp->v_flag &= ~VBWAIT;
808 wakeup((caddr_t) &vp->v_numoutput);
809 }
810 }
811}
812
813/*
814 * Flush out and invalidate all buffers associated with a vnode.
815 * Called with the underlying object locked.
816 */
817int
3b568787
MD
818vinvalbuf(struct vnode *vp, int flags, struct thread *td,
819 int slpflag, int slptimeo)
984263bc 820{
1fd87d54 821 struct buf *bp;
984263bc
MD
822 struct buf *nbp, *blist;
823 int s, error;
824 vm_object_t object;
825
826 if (flags & V_SAVE) {
827 s = splbio();
828 while (vp->v_numoutput) {
829 vp->v_flag |= VBWAIT;
830 error = tsleep((caddr_t)&vp->v_numoutput,
377d4740 831 slpflag, "vinvlbuf", slptimeo);
984263bc
MD
832 if (error) {
833 splx(s);
834 return (error);
835 }
836 }
837 if (!TAILQ_EMPTY(&vp->v_dirtyblkhd)) {
838 splx(s);
3b568787 839 if ((error = VOP_FSYNC(vp, MNT_WAIT, td)) != 0)
984263bc
MD
840 return (error);
841 s = splbio();
842 if (vp->v_numoutput > 0 ||
843 !TAILQ_EMPTY(&vp->v_dirtyblkhd))
844 panic("vinvalbuf: dirty bufs");
845 }
846 splx(s);
847 }
848 s = splbio();
849 for (;;) {
850 blist = TAILQ_FIRST(&vp->v_cleanblkhd);
851 if (!blist)
852 blist = TAILQ_FIRST(&vp->v_dirtyblkhd);
853 if (!blist)
854 break;
855
856 for (bp = blist; bp; bp = nbp) {
857 nbp = TAILQ_NEXT(bp, b_vnbufs);
858 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT)) {
859 error = BUF_TIMELOCK(bp,
860 LK_EXCLUSIVE | LK_SLEEPFAIL,
861 "vinvalbuf", slpflag, slptimeo);
862 if (error == ENOLCK)
863 break;
864 splx(s);
865 return (error);
866 }
867 /*
868 * XXX Since there are no node locks for NFS, I
869 * believe there is a slight chance that a delayed
870 * write will occur while sleeping just above, so
871 * check for it. Note that vfs_bio_awrite expects
872 * buffers to reside on a queue, while VOP_BWRITE and
873 * brelse do not.
874 */
875 if (((bp->b_flags & (B_DELWRI | B_INVAL)) == B_DELWRI) &&
876 (flags & V_SAVE)) {
877
878 if (bp->b_vp == vp) {
879 if (bp->b_flags & B_CLUSTEROK) {
880 BUF_UNLOCK(bp);
881 vfs_bio_awrite(bp);
882 } else {
883 bremfree(bp);
884 bp->b_flags |= B_ASYNC;
885 VOP_BWRITE(bp->b_vp, bp);
886 }
887 } else {
888 bremfree(bp);
889 (void) VOP_BWRITE(bp->b_vp, bp);
890 }
891 break;
892 }
893 bremfree(bp);
894 bp->b_flags |= (B_INVAL | B_NOCACHE | B_RELBUF);
895 bp->b_flags &= ~B_ASYNC;
896 brelse(bp);
897 }
898 }
899
900 /*
901 * Wait for I/O to complete. XXX needs cleaning up. The vnode can
902 * have write I/O in-progress but if there is a VM object then the
903 * VM object can also have read-I/O in-progress.
904 */
905 do {
906 while (vp->v_numoutput > 0) {
907 vp->v_flag |= VBWAIT;
377d4740 908 tsleep(&vp->v_numoutput, 0, "vnvlbv", 0);
984263bc
MD
909 }
910 if (VOP_GETVOBJECT(vp, &object) == 0) {
911 while (object->paging_in_progress)
912 vm_object_pip_sleep(object, "vnvlbx");
913 }
914 } while (vp->v_numoutput > 0);
915
916 splx(s);
917
918 /*
919 * Destroy the copy in the VM cache, too.
920 */
8a8d5d85 921 lwkt_gettoken(&vp->v_interlock);
984263bc
MD
922 if (VOP_GETVOBJECT(vp, &object) == 0) {
923 vm_object_page_remove(object, 0, 0,
924 (flags & V_SAVE) ? TRUE : FALSE);
925 }
8a8d5d85 926 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
927
928 if (!TAILQ_EMPTY(&vp->v_dirtyblkhd) || !TAILQ_EMPTY(&vp->v_cleanblkhd))
929 panic("vinvalbuf: flush failed");
930 return (0);
931}
932
933/*
934 * Truncate a file's buffer and pages to a specified length. This
935 * is in lieu of the old vinvalbuf mechanism, which performed unneeded
936 * sync activity.
937 */
938int
3b568787 939vtruncbuf(struct vnode *vp, struct thread *td, off_t length, int blksize)
984263bc 940{
dadab5e9 941 struct buf *bp;
984263bc
MD
942 struct buf *nbp;
943 int s, anyfreed;
944 int trunclbn;
945
946 /*
947 * Round up to the *next* lbn.
948 */
949 trunclbn = (length + blksize - 1) / blksize;
950
951 s = splbio();
952restart:
953 anyfreed = 1;
954 for (;anyfreed;) {
955 anyfreed = 0;
956 for (bp = TAILQ_FIRST(&vp->v_cleanblkhd); bp; bp = nbp) {
957 nbp = TAILQ_NEXT(bp, b_vnbufs);
958 if (bp->b_lblkno >= trunclbn) {
959 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT)) {
960 BUF_LOCK(bp, LK_EXCLUSIVE|LK_SLEEPFAIL);
961 goto restart;
962 } else {
963 bremfree(bp);
964 bp->b_flags |= (B_INVAL | B_RELBUF);
965 bp->b_flags &= ~B_ASYNC;
966 brelse(bp);
967 anyfreed = 1;
968 }
969 if (nbp &&
970 (((nbp->b_xflags & BX_VNCLEAN) == 0) ||
971 (nbp->b_vp != vp) ||
972 (nbp->b_flags & B_DELWRI))) {
973 goto restart;
974 }
975 }
976 }
977
978 for (bp = TAILQ_FIRST(&vp->v_dirtyblkhd); bp; bp = nbp) {
979 nbp = TAILQ_NEXT(bp, b_vnbufs);
980 if (bp->b_lblkno >= trunclbn) {
981 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT)) {
982 BUF_LOCK(bp, LK_EXCLUSIVE|LK_SLEEPFAIL);
983 goto restart;
984 } else {
985 bremfree(bp);
986 bp->b_flags |= (B_INVAL | B_RELBUF);
987 bp->b_flags &= ~B_ASYNC;
988 brelse(bp);
989 anyfreed = 1;
990 }
991 if (nbp &&
992 (((nbp->b_xflags & BX_VNDIRTY) == 0) ||
993 (nbp->b_vp != vp) ||
994 (nbp->b_flags & B_DELWRI) == 0)) {
995 goto restart;
996 }
997 }
998 }
999 }
1000
1001 if (length > 0) {
1002restartsync:
1003 for (bp = TAILQ_FIRST(&vp->v_dirtyblkhd); bp; bp = nbp) {
1004 nbp = TAILQ_NEXT(bp, b_vnbufs);
1005 if ((bp->b_flags & B_DELWRI) && (bp->b_lblkno < 0)) {
1006 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT)) {
1007 BUF_LOCK(bp, LK_EXCLUSIVE|LK_SLEEPFAIL);
1008 goto restart;
1009 } else {
1010 bremfree(bp);
1011 if (bp->b_vp == vp) {
1012 bp->b_flags |= B_ASYNC;
1013 } else {
1014 bp->b_flags &= ~B_ASYNC;
1015 }
1016 VOP_BWRITE(bp->b_vp, bp);
1017 }
1018 goto restartsync;
1019 }
1020
1021 }
1022 }
1023
1024 while (vp->v_numoutput > 0) {
1025 vp->v_flag |= VBWAIT;
377d4740 1026 tsleep(&vp->v_numoutput, 0, "vbtrunc", 0);
984263bc
MD
1027 }
1028
1029 splx(s);
1030
1031 vnode_pager_setsize(vp, length);
1032
1033 return (0);
1034}
1035
1036/*
1037 * Associate a buffer with a vnode.
1038 */
1039void
1040bgetvp(vp, bp)
1fd87d54
RG
1041 struct vnode *vp;
1042 struct buf *bp;
984263bc
MD
1043{
1044 int s;
1045
1046 KASSERT(bp->b_vp == NULL, ("bgetvp: not free"));
1047
1048 vhold(vp);
1049 bp->b_vp = vp;
1050 bp->b_dev = vn_todev(vp);
1051 /*
1052 * Insert onto list for new vnode.
1053 */
1054 s = splbio();
1055 bp->b_xflags |= BX_VNCLEAN;
1056 bp->b_xflags &= ~BX_VNDIRTY;
1057 TAILQ_INSERT_TAIL(&vp->v_cleanblkhd, bp, b_vnbufs);
1058 splx(s);
1059}
1060
1061/*
1062 * Disassociate a buffer from a vnode.
1063 */
1064void
1065brelvp(bp)
1fd87d54 1066 struct buf *bp;
984263bc
MD
1067{
1068 struct vnode *vp;
1069 struct buflists *listheadp;
1070 int s;
1071
1072 KASSERT(bp->b_vp != NULL, ("brelvp: NULL"));
1073
1074 /*
1075 * Delete from old vnode list, if on one.
1076 */
1077 vp = bp->b_vp;
1078 s = splbio();
1079 if (bp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN)) {
1080 if (bp->b_xflags & BX_VNDIRTY)
1081 listheadp = &vp->v_dirtyblkhd;
1082 else
1083 listheadp = &vp->v_cleanblkhd;
1084 TAILQ_REMOVE(listheadp, bp, b_vnbufs);
1085 bp->b_xflags &= ~(BX_VNDIRTY | BX_VNCLEAN);
1086 }
1087 if ((vp->v_flag & VONWORKLST) && TAILQ_EMPTY(&vp->v_dirtyblkhd)) {
1088 vp->v_flag &= ~VONWORKLST;
1089 LIST_REMOVE(vp, v_synclist);
1090 }
1091 splx(s);
1092 bp->b_vp = (struct vnode *) 0;
1093 vdrop(vp);
1094}
1095
1096/*
1097 * The workitem queue.
1098 *
1099 * It is useful to delay writes of file data and filesystem metadata
1100 * for tens of seconds so that quickly created and deleted files need
1101 * not waste disk bandwidth being created and removed. To realize this,
1102 * we append vnodes to a "workitem" queue. When running with a soft
1103 * updates implementation, most pending metadata dependencies should
1104 * not wait for more than a few seconds. Thus, mounted on block devices
1105 * are delayed only about a half the time that file data is delayed.
1106 * Similarly, directory updates are more critical, so are only delayed
1107 * about a third the time that file data is delayed. Thus, there are
1108 * SYNCER_MAXDELAY queues that are processed round-robin at a rate of
1109 * one each second (driven off the filesystem syncer process). The
1110 * syncer_delayno variable indicates the next queue that is to be processed.
1111 * Items that need to be processed soon are placed in this queue:
1112 *
1113 * syncer_workitem_pending[syncer_delayno]
1114 *
1115 * A delay of fifteen seconds is done by placing the request fifteen
1116 * entries later in the queue:
1117 *
1118 * syncer_workitem_pending[(syncer_delayno + 15) & syncer_mask]
1119 *
1120 */
1121
1122/*
1123 * Add an item to the syncer work queue.
1124 */
1125static void
1126vn_syncer_add_to_worklist(struct vnode *vp, int delay)
1127{
1128 int s, slot;
1129
1130 s = splbio();
1131
1132 if (vp->v_flag & VONWORKLST) {
1133 LIST_REMOVE(vp, v_synclist);
1134 }
1135
1136 if (delay > syncer_maxdelay - 2)
1137 delay = syncer_maxdelay - 2;
1138 slot = (syncer_delayno + delay) & syncer_mask;
1139
1140 LIST_INSERT_HEAD(&syncer_workitem_pending[slot], vp, v_synclist);
1141 vp->v_flag |= VONWORKLST;
1142 splx(s);
1143}
1144
bc6dffab 1145struct thread *updatethread;
402ed7e1 1146static void sched_sync (void);
984263bc
MD
1147static struct kproc_desc up_kp = {
1148 "syncer",
1149 sched_sync,
bc6dffab 1150 &updatethread
984263bc
MD
1151};
1152SYSINIT(syncer, SI_SUB_KTHREAD_UPDATE, SI_ORDER_FIRST, kproc_start, &up_kp)
1153
1154/*
1155 * System filesystem synchronizer daemon.
1156 */
1157void
1158sched_sync(void)
1159{
1160 struct synclist *slp;
1161 struct vnode *vp;
1162 long starttime;
1163 int s;
0cfcada1 1164 struct thread *td = curthread;
984263bc 1165
bc6dffab 1166 EVENTHANDLER_REGISTER(shutdown_pre_sync, shutdown_kproc, td,
984263bc
MD
1167 SHUTDOWN_PRI_LAST);
1168
1169 for (;;) {
0cfcada1 1170 kproc_suspend_loop();
984263bc
MD
1171
1172 starttime = time_second;
1173
1174 /*
1175 * Push files whose dirty time has expired. Be careful
1176 * of interrupt race on slp queue.
1177 */
1178 s = splbio();
1179 slp = &syncer_workitem_pending[syncer_delayno];
1180 syncer_delayno += 1;
1181 if (syncer_delayno == syncer_maxdelay)
1182 syncer_delayno = 0;
1183 splx(s);
1184
1185 while ((vp = LIST_FIRST(slp)) != NULL) {
1186 if (VOP_ISLOCKED(vp, NULL) == 0) {
dadab5e9 1187 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY, td);
3b568787 1188 (void) VOP_FSYNC(vp, MNT_LAZY, td);
dadab5e9 1189 VOP_UNLOCK(vp, 0, td);
984263bc
MD
1190 }
1191 s = splbio();
1192 if (LIST_FIRST(slp) == vp) {
1193 /*
1194 * Note: v_tag VT_VFS vps can remain on the
1195 * worklist too with no dirty blocks, but
1196 * since sync_fsync() moves it to a different
1197 * slot we are safe.
1198 */
1199 if (TAILQ_EMPTY(&vp->v_dirtyblkhd) &&
1200 !vn_isdisk(vp, NULL))
1201 panic("sched_sync: fsync failed vp %p tag %d", vp, vp->v_tag);
1202 /*
1203 * Put us back on the worklist. The worklist
1204 * routine will remove us from our current
1205 * position and then add us back in at a later
1206 * position.
1207 */
1208 vn_syncer_add_to_worklist(vp, syncdelay);
1209 }
1210 splx(s);
1211 }
1212
1213 /*
1214 * Do soft update processing.
1215 */
1216 if (bioops.io_sync)
1217 (*bioops.io_sync)(NULL);
1218
1219 /*
1220 * The variable rushjob allows the kernel to speed up the
1221 * processing of the filesystem syncer process. A rushjob
1222 * value of N tells the filesystem syncer to process the next
1223 * N seconds worth of work on its queue ASAP. Currently rushjob
1224 * is used by the soft update code to speed up the filesystem
1225 * syncer process when the incore state is getting so far
1226 * ahead of the disk that the kernel memory pool is being
1227 * threatened with exhaustion.
1228 */
1229 if (rushjob > 0) {
1230 rushjob -= 1;
1231 continue;
1232 }
1233 /*
1234 * If it has taken us less than a second to process the
1235 * current work, then wait. Otherwise start right over
1236 * again. We can still lose time if any single round
1237 * takes more than two seconds, but it does not really
1238 * matter as we are just trying to generally pace the
1239 * filesystem activity.
1240 */
1241 if (time_second == starttime)
377d4740 1242 tsleep(&lbolt, 0, "syncer", 0);
984263bc
MD
1243 }
1244}
1245
1246/*
1247 * Request the syncer daemon to speed up its work.
1248 * We never push it to speed up more than half of its
1249 * normal turn time, otherwise it could take over the cpu.
f5865223
MD
1250 *
1251 * YYY wchan field protected by the BGL.
984263bc
MD
1252 */
1253int
1254speedup_syncer()
1255{
f5865223
MD
1256 crit_enter();
1257 if (updatethread->td_wchan == &lbolt) { /* YYY */
1258 unsleep(updatethread);
1259 lwkt_schedule(updatethread);
1260 }
1261 crit_exit();
984263bc
MD
1262 if (rushjob < syncdelay / 2) {
1263 rushjob += 1;
1264 stat_rush_requests += 1;
1265 return (1);
1266 }
1267 return(0);
1268}
1269
1270/*
1271 * Associate a p-buffer with a vnode.
1272 *
1273 * Also sets B_PAGING flag to indicate that vnode is not fully associated
1274 * with the buffer. i.e. the bp has not been linked into the vnode or
1275 * ref-counted.
1276 */
1277void
1278pbgetvp(vp, bp)
1fd87d54
RG
1279 struct vnode *vp;
1280 struct buf *bp;
984263bc
MD
1281{
1282
1283 KASSERT(bp->b_vp == NULL, ("pbgetvp: not free"));
1284
1285 bp->b_vp = vp;
1286 bp->b_flags |= B_PAGING;
1287 bp->b_dev = vn_todev(vp);
1288}
1289
1290/*
1291 * Disassociate a p-buffer from a vnode.
1292 */
1293void
1294pbrelvp(bp)
1fd87d54 1295 struct buf *bp;
984263bc
MD
1296{
1297
1298 KASSERT(bp->b_vp != NULL, ("pbrelvp: NULL"));
1299
1300 /* XXX REMOVE ME */
1301 if (TAILQ_NEXT(bp, b_vnbufs) != NULL) {
1302 panic(
1303 "relpbuf(): b_vp was probably reassignbuf()d %p %x",
1304 bp,
1305 (int)bp->b_flags
1306 );
1307 }
1308 bp->b_vp = (struct vnode *) 0;
1309 bp->b_flags &= ~B_PAGING;
1310}
1311
1312void
1313pbreassignbuf(bp, newvp)
1314 struct buf *bp;
1315 struct vnode *newvp;
1316{
1317 if ((bp->b_flags & B_PAGING) == 0) {
1318 panic(
1319 "pbreassignbuf() on non phys bp %p",
1320 bp
1321 );
1322 }
1323 bp->b_vp = newvp;
1324}
1325
1326/*
1327 * Reassign a buffer from one vnode to another.
1328 * Used to assign file specific control information
1329 * (indirect blocks) to the vnode to which they belong.
1330 */
1331void
1332reassignbuf(bp, newvp)
1fd87d54
RG
1333 struct buf *bp;
1334 struct vnode *newvp;
984263bc
MD
1335{
1336 struct buflists *listheadp;
1337 int delay;
1338 int s;
1339
1340 if (newvp == NULL) {
1341 printf("reassignbuf: NULL");
1342 return;
1343 }
1344 ++reassignbufcalls;
1345
1346 /*
1347 * B_PAGING flagged buffers cannot be reassigned because their vp
1348 * is not fully linked in.
1349 */
1350 if (bp->b_flags & B_PAGING)
1351 panic("cannot reassign paging buffer");
1352
1353 s = splbio();
1354 /*
1355 * Delete from old vnode list, if on one.
1356 */
1357 if (bp->b_xflags & (BX_VNDIRTY | BX_VNCLEAN)) {
1358 if (bp->b_xflags & BX_VNDIRTY)
1359 listheadp = &bp->b_vp->v_dirtyblkhd;
1360 else
1361 listheadp = &bp->b_vp->v_cleanblkhd;
1362 TAILQ_REMOVE(listheadp, bp, b_vnbufs);
1363 bp->b_xflags &= ~(BX_VNDIRTY | BX_VNCLEAN);
1364 if (bp->b_vp != newvp) {
1365 vdrop(bp->b_vp);
1366 bp->b_vp = NULL; /* for clarification */
1367 }
1368 }
1369 /*
1370 * If dirty, put on list of dirty buffers; otherwise insert onto list
1371 * of clean buffers.
1372 */
1373 if (bp->b_flags & B_DELWRI) {
1374 struct buf *tbp;
1375
1376 listheadp = &newvp->v_dirtyblkhd;
1377 if ((newvp->v_flag & VONWORKLST) == 0) {
1378 switch (newvp->v_type) {
1379 case VDIR:
1380 delay = dirdelay;
1381 break;
1382 case VCHR:
1383 case VBLK:
1384 if (newvp->v_specmountpoint != NULL) {
1385 delay = metadelay;
1386 break;
1387 }
1388 /* fall through */
1389 default:
1390 delay = filedelay;
1391 }
1392 vn_syncer_add_to_worklist(newvp, delay);
1393 }
1394 bp->b_xflags |= BX_VNDIRTY;
1395 tbp = TAILQ_FIRST(listheadp);
1396 if (tbp == NULL ||
1397 bp->b_lblkno == 0 ||
1398 (bp->b_lblkno > 0 && tbp->b_lblkno < 0) ||
1399 (bp->b_lblkno > 0 && bp->b_lblkno < tbp->b_lblkno)) {
1400 TAILQ_INSERT_HEAD(listheadp, bp, b_vnbufs);
1401 ++reassignbufsortgood;
1402 } else if (bp->b_lblkno < 0) {
1403 TAILQ_INSERT_TAIL(listheadp, bp, b_vnbufs);
1404 ++reassignbufsortgood;
1405 } else if (reassignbufmethod == 1) {
1406 /*
1407 * New sorting algorithm, only handle sequential case,
1408 * otherwise append to end (but before metadata)
1409 */
1410 if ((tbp = gbincore(newvp, bp->b_lblkno - 1)) != NULL &&
1411 (tbp->b_xflags & BX_VNDIRTY)) {
1412 /*
1413 * Found the best place to insert the buffer
1414 */
1415 TAILQ_INSERT_AFTER(listheadp, tbp, bp, b_vnbufs);
1416 ++reassignbufsortgood;
1417 } else {
1418 /*
1419 * Missed, append to end, but before meta-data.
1420 * We know that the head buffer in the list is
1421 * not meta-data due to prior conditionals.
1422 *
1423 * Indirect effects: NFS second stage write
1424 * tends to wind up here, giving maximum
1425 * distance between the unstable write and the
1426 * commit rpc.
1427 */
1428 tbp = TAILQ_LAST(listheadp, buflists);
1429 while (tbp && tbp->b_lblkno < 0)
1430 tbp = TAILQ_PREV(tbp, buflists, b_vnbufs);
1431 TAILQ_INSERT_AFTER(listheadp, tbp, bp, b_vnbufs);
1432 ++reassignbufsortbad;
1433 }
1434 } else {
1435 /*
1436 * Old sorting algorithm, scan queue and insert
1437 */
1438 struct buf *ttbp;
1439 while ((ttbp = TAILQ_NEXT(tbp, b_vnbufs)) &&
1440 (ttbp->b_lblkno < bp->b_lblkno)) {
1441 ++reassignbufloops;
1442 tbp = ttbp;
1443 }
1444 TAILQ_INSERT_AFTER(listheadp, tbp, bp, b_vnbufs);
1445 }
1446 } else {
1447 bp->b_xflags |= BX_VNCLEAN;
1448 TAILQ_INSERT_TAIL(&newvp->v_cleanblkhd, bp, b_vnbufs);
1449 if ((newvp->v_flag & VONWORKLST) &&
1450 TAILQ_EMPTY(&newvp->v_dirtyblkhd)) {
1451 newvp->v_flag &= ~VONWORKLST;
1452 LIST_REMOVE(newvp, v_synclist);
1453 }
1454 }
1455 if (bp->b_vp != newvp) {
1456 bp->b_vp = newvp;
1457 vhold(bp->b_vp);
1458 }
1459 splx(s);
1460}
1461
1462/*
1463 * Create a vnode for a block device.
1464 * Used for mounting the root file system.
1465 */
1466int
1467bdevvp(dev, vpp)
1468 dev_t dev;
1469 struct vnode **vpp;
1470{
1fd87d54 1471 struct vnode *vp;
984263bc
MD
1472 struct vnode *nvp;
1473 int error;
1474
1475 if (dev == NODEV) {
1476 *vpp = NULLVP;
1477 return (ENXIO);
1478 }
1479 error = getnewvnode(VT_NON, (struct mount *)0, spec_vnodeop_p, &nvp);
1480 if (error) {
1481 *vpp = NULLVP;
1482 return (error);
1483 }
1484 vp = nvp;
1485 vp->v_type = VBLK;
1486 addalias(vp, dev);
1487 *vpp = vp;
1488 return (0);
1489}
1490
1491/*
7732c8cd 1492 * Add a vnode to the alias list hung off the dev_t.
984263bc
MD
1493 *
1494 * The reason for this gunk is that multiple vnodes can reference
1495 * the same physical device, so checking vp->v_usecount to see
1496 * how many users there are is inadequate; the v_usecount for
1497 * the vnodes need to be accumulated. vcount() does that.
1498 */
1499void
7732c8cd 1500addaliasu(struct vnode *nvp, udev_t nvp_rdev)
984263bc 1501{
7732c8cd 1502 dev_t dev;
984263bc
MD
1503
1504 if (nvp->v_type != VBLK && nvp->v_type != VCHR)
1505 panic("addaliasu on non-special vnode");
7732c8cd 1506 dev = udev2dev(nvp_rdev, nvp->v_type == VBLK ? 1 : 0);
4908c260
JH
1507 if (dev != NODEV) {
1508 nvp->v_rdev = dev;
7732c8cd 1509 addalias(nvp, dev);
4908c260
JH
1510 } else
1511 nvp->v_rdev = NULL;
984263bc
MD
1512}
1513
1514void
7732c8cd 1515addalias(struct vnode *nvp, dev_t dev)
984263bc
MD
1516{
1517
1518 if (nvp->v_type != VBLK && nvp->v_type != VCHR)
1519 panic("addalias on non-special vnode");
1520
1521 nvp->v_rdev = dev;
8a8d5d85 1522 lwkt_gettoken(&spechash_token);
984263bc 1523 SLIST_INSERT_HEAD(&dev->si_hlist, nvp, v_specnext);
8a8d5d85 1524 lwkt_reltoken(&spechash_token);
984263bc
MD
1525}
1526
1527/*
1528 * Grab a particular vnode from the free list, increment its
1529 * reference count and lock it. The vnode lock bit is set if the
1530 * vnode is being eliminated in vgone. The process is awakened
1531 * when the transition is completed, and an error returned to
1532 * indicate that the vnode is no longer usable (possibly having
1533 * been changed to a new file system type).
1534 */
1535int
dadab5e9
MD
1536vget(vp, flags, td)
1537 struct vnode *vp;
984263bc 1538 int flags;
dadab5e9 1539 struct thread *td;
984263bc
MD
1540{
1541 int error;
1542
1543 /*
1544 * If the vnode is in the process of being cleaned out for
1545 * another use, we wait for the cleaning to finish and then
1546 * return failure. Cleaning is determined by checking that
1547 * the VXLOCK flag is set.
1548 */
1549 if ((flags & LK_INTERLOCK) == 0) {
8a8d5d85 1550 lwkt_gettoken(&vp->v_interlock);
984263bc
MD
1551 }
1552 if (vp->v_flag & VXLOCK) {
1553 if (vp->v_vxproc == curproc) {
1554#if 0
1555 /* this can now occur in normal operation */
1556 log(LOG_INFO, "VXLOCK interlock avoided\n");
1557#endif
1558 } else {
1559 vp->v_flag |= VXWANT;
8a8d5d85 1560 lwkt_reltoken(&vp->v_interlock);
377d4740 1561 tsleep((caddr_t)vp, 0, "vget", 0);
984263bc
MD
1562 return (ENOENT);
1563 }
1564 }
1565
1566 vp->v_usecount++;
1567
1568 if (VSHOULDBUSY(vp))
1569 vbusy(vp);
1570 if (flags & LK_TYPE_MASK) {
dadab5e9 1571 if ((error = vn_lock(vp, flags | LK_INTERLOCK, td)) != 0) {
984263bc
MD
1572 /*
1573 * must expand vrele here because we do not want
1574 * to call VOP_INACTIVE if the reference count
1575 * drops back to zero since it was never really
1576 * active. We must remove it from the free list
1577 * before sleeping so that multiple processes do
1578 * not try to recycle it.
1579 */
8a8d5d85 1580 lwkt_gettoken(&vp->v_interlock);
984263bc
MD
1581 vp->v_usecount--;
1582 if (VSHOULDFREE(vp))
1583 vfree(vp);
1584 else
1585 vlruvp(vp);
8a8d5d85 1586 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
1587 }
1588 return (error);
1589 }
8a8d5d85 1590 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
1591 return (0);
1592}
1593
1594void
1595vref(struct vnode *vp)
1596{
8a8d5d85 1597 lwkt_gettoken(&vp->v_interlock);
984263bc 1598 vp->v_usecount++;
8a8d5d85 1599 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
1600}
1601
1602/*
1603 * Vnode put/release.
1604 * If count drops to zero, call inactive routine and return to freelist.
1605 */
1606void
dadab5e9 1607vrele(struct vnode *vp)
984263bc 1608{
dadab5e9 1609 struct thread *td = curthread; /* XXX */
984263bc
MD
1610
1611 KASSERT(vp != NULL, ("vrele: null vp"));
1612
8a8d5d85 1613 lwkt_gettoken(&vp->v_interlock);
984263bc
MD
1614
1615 if (vp->v_usecount > 1) {
1616
1617 vp->v_usecount--;
8a8d5d85 1618 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
1619
1620 return;
1621 }
1622
1623 if (vp->v_usecount == 1) {
1624 vp->v_usecount--;
1625 /*
1626 * We must call VOP_INACTIVE with the node locked.
1627 * If we are doing a vpu, the node is already locked,
1628 * but, in the case of vrele, we must explicitly lock
1629 * the vnode before calling VOP_INACTIVE
1630 */
1631
dadab5e9
MD
1632 if (vn_lock(vp, LK_EXCLUSIVE | LK_INTERLOCK, td) == 0)
1633 VOP_INACTIVE(vp, td);
984263bc
MD
1634 if (VSHOULDFREE(vp))
1635 vfree(vp);
1636 else
1637 vlruvp(vp);
1638 } else {
1639#ifdef DIAGNOSTIC
1640 vprint("vrele: negative ref count", vp);
8a8d5d85 1641 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
1642#endif
1643 panic("vrele: negative ref cnt");
1644 }
1645}
1646
1647void
dadab5e9 1648vput(struct vnode *vp)
984263bc 1649{
dadab5e9 1650 struct thread *td = curthread; /* XXX */
984263bc
MD
1651
1652 KASSERT(vp != NULL, ("vput: null vp"));
1653
8a8d5d85 1654 lwkt_gettoken(&vp->v_interlock);
984263bc
MD
1655
1656 if (vp->v_usecount > 1) {
1657 vp->v_usecount--;
dadab5e9 1658 VOP_UNLOCK(vp, LK_INTERLOCK, td);
984263bc
MD
1659 return;
1660 }
1661
1662 if (vp->v_usecount == 1) {
1663 vp->v_usecount--;
1664 /*
1665 * We must call VOP_INACTIVE with the node locked.
1666 * If we are doing a vpu, the node is already locked,
1667 * so we just need to release the vnode mutex.
1668 */
8a8d5d85 1669 lwkt_reltoken(&vp->v_interlock);
dadab5e9 1670 VOP_INACTIVE(vp, td);
984263bc
MD
1671 if (VSHOULDFREE(vp))
1672 vfree(vp);
1673 else
1674 vlruvp(vp);
1675 } else {
1676#ifdef DIAGNOSTIC
1677 vprint("vput: negative ref count", vp);
1678#endif
1679 panic("vput: negative ref cnt");
1680 }
1681}
1682
1683/*
1684 * Somebody doesn't want the vnode recycled.
1685 */
1686void
1687vhold(vp)
1fd87d54 1688 struct vnode *vp;
984263bc
MD
1689{
1690 int s;
1691
1692 s = splbio();
1693 vp->v_holdcnt++;
1694 if (VSHOULDBUSY(vp))
1695 vbusy(vp);
1696 splx(s);
1697}
1698
1699/*
1700 * One less who cares about this vnode.
1701 */
1702void
1703vdrop(vp)
1fd87d54 1704 struct vnode *vp;
984263bc
MD
1705{
1706 int s;
1707
1708 s = splbio();
1709 if (vp->v_holdcnt <= 0)
1710 panic("vdrop: holdcnt");
1711 vp->v_holdcnt--;
1712 if (VSHOULDFREE(vp))
1713 vfree(vp);
1714 splx(s);
1715}
1716
1717/*
1718 * Remove any vnodes in the vnode table belonging to mount point mp.
1719 *
1720 * If FORCECLOSE is not specified, there should not be any active ones,
1721 * return error if any are found (nb: this is a user error, not a
1722 * system error). If FORCECLOSE is specified, detach any active vnodes
1723 * that are found.
1724 *
1725 * If WRITECLOSE is set, only flush out regular file vnodes open for
1726 * writing.
1727 *
1728 * SKIPSYSTEM causes any vnodes marked VSYSTEM to be skipped.
1729 *
1730 * `rootrefs' specifies the base reference count for the root vnode
1731 * of this filesystem. The root vnode is considered busy if its
1732 * v_usecount exceeds this value. On a successful return, vflush()
1733 * will call vrele() on the root vnode exactly rootrefs times.
1734 * If the SKIPSYSTEM or WRITECLOSE flags are specified, rootrefs must
1735 * be zero.
1736 */
1737#ifdef DIAGNOSTIC
1738static int busyprt = 0; /* print out busy vnodes */
1739SYSCTL_INT(_debug, OID_AUTO, busyprt, CTLFLAG_RW, &busyprt, 0, "");
1740#endif
1741
1742int
1743vflush(mp, rootrefs, flags)
1744 struct mount *mp;
1745 int rootrefs;
1746 int flags;
1747{
dadab5e9 1748 struct thread *td = curthread; /* XXX */
984263bc
MD
1749 struct vnode *vp, *nvp, *rootvp = NULL;
1750 struct vattr vattr;
1751 int busy = 0, error;
1752
1753 if (rootrefs > 0) {
1754 KASSERT((flags & (SKIPSYSTEM | WRITECLOSE)) == 0,
1755 ("vflush: bad args"));
1756 /*
1757 * Get the filesystem root vnode. We can vput() it
1758 * immediately, since with rootrefs > 0, it won't go away.
1759 */
1760 if ((error = VFS_ROOT(mp, &rootvp)) != 0)
1761 return (error);
1762 vput(rootvp);
1763 }
8a8d5d85 1764 lwkt_gettoken(&mntvnode_token);
984263bc
MD
1765loop:
1766 for (vp = TAILQ_FIRST(&mp->mnt_nvnodelist); vp; vp = nvp) {
1767 /*
1768 * Make sure this vnode wasn't reclaimed in getnewvnode().
1769 * Start over if it has (it won't be on the list anymore).
1770 */
1771 if (vp->v_mount != mp)
1772 goto loop;
1773 nvp = TAILQ_NEXT(vp, v_nmntvnodes);
1774
8a8d5d85 1775 lwkt_gettoken(&vp->v_interlock);
984263bc
MD
1776 /*
1777 * Skip over a vnodes marked VSYSTEM.
1778 */
1779 if ((flags & SKIPSYSTEM) && (vp->v_flag & VSYSTEM)) {
8a8d5d85 1780 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
1781 continue;
1782 }
1783 /*
1784 * If WRITECLOSE is set, flush out unlinked but still open
1785 * files (even if open only for reading) and regular file
1786 * vnodes open for writing.
1787 */
1788 if ((flags & WRITECLOSE) &&
1789 (vp->v_type == VNON ||
3b568787 1790 (VOP_GETATTR(vp, &vattr, td) == 0 &&
984263bc
MD
1791 vattr.va_nlink > 0)) &&
1792 (vp->v_writecount == 0 || vp->v_type != VREG)) {
8a8d5d85 1793 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
1794 continue;
1795 }
1796
1797 /*
1798 * With v_usecount == 0, all we need to do is clear out the
1799 * vnode data structures and we are done.
1800 */
1801 if (vp->v_usecount == 0) {
8a8d5d85 1802 lwkt_reltoken(&mntvnode_token);
dadab5e9 1803 vgonel(vp, td);
8a8d5d85 1804 lwkt_gettoken(&mntvnode_token);
984263bc
MD
1805 continue;
1806 }
1807
1808 /*
1809 * If FORCECLOSE is set, forcibly close the vnode. For block
1810 * or character devices, revert to an anonymous device. For
1811 * all other files, just kill them.
1812 */
1813 if (flags & FORCECLOSE) {
8a8d5d85 1814 lwkt_reltoken(&mntvnode_token);
984263bc 1815 if (vp->v_type != VBLK && vp->v_type != VCHR) {
dadab5e9 1816 vgonel(vp, td);
984263bc 1817 } else {
dadab5e9 1818 vclean(vp, 0, td);
984263bc
MD
1819 vp->v_op = spec_vnodeop_p;
1820 insmntque(vp, (struct mount *) 0);
1821 }
8a8d5d85 1822 lwkt_gettoken(&mntvnode_token);
984263bc
MD
1823 continue;
1824 }
1825#ifdef DIAGNOSTIC
1826 if (busyprt)
1827 vprint("vflush: busy vnode", vp);
1828#endif
8a8d5d85 1829 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
1830 busy++;
1831 }
8a8d5d85 1832 lwkt_reltoken(&mntvnode_token);
984263bc
MD
1833 if (rootrefs > 0 && (flags & FORCECLOSE) == 0) {
1834 /*
1835 * If just the root vnode is busy, and if its refcount
1836 * is equal to `rootrefs', then go ahead and kill it.
1837 */
8a8d5d85 1838 lwkt_gettoken(&rootvp->v_interlock);
984263bc
MD
1839 KASSERT(busy > 0, ("vflush: not busy"));
1840 KASSERT(rootvp->v_usecount >= rootrefs, ("vflush: rootrefs"));
1841 if (busy == 1 && rootvp->v_usecount == rootrefs) {
dadab5e9 1842 vgonel(rootvp, td);
984263bc
MD
1843 busy = 0;
1844 } else
8a8d5d85 1845 lwkt_reltoken(&rootvp->v_interlock);
984263bc
MD
1846 }
1847 if (busy)
1848 return (EBUSY);
1849 for (; rootrefs > 0; rootrefs--)
1850 vrele(rootvp);
1851 return (0);
1852}
1853
1854/*
1855 * We do not want to recycle the vnode too quickly.
1856 *
1857 * XXX we can't move vp's around the nvnodelist without really screwing
1858 * up the efficiency of filesystem SYNC and friends. This code is
1859 * disabled until we fix the syncing code's scanning algorithm.
1860 */
1861static void
1862vlruvp(struct vnode *vp)
1863{
1864#if 0
1865 struct mount *mp;
1866
1867 if ((mp = vp->v_mount) != NULL) {
8a8d5d85 1868 lwkt_gettoken(&mntvnode_token);
984263bc
MD
1869 TAILQ_REMOVE(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
1870 TAILQ_INSERT_TAIL(&mp->mnt_nvnodelist, vp, v_nmntvnodes);
8a8d5d85 1871 lwkt_reltoken(&mntvnode_token);
984263bc
MD
1872 }
1873#endif
1874}
1875
1876/*
1877 * Disassociate the underlying file system from a vnode.
1878 */
1879static void
dadab5e9 1880vclean(struct vnode *vp, int flags, struct thread *td)
984263bc
MD
1881{
1882 int active;
1883
1884 /*
1885 * Check to see if the vnode is in use. If so we have to reference it
1886 * before we clean it out so that its count cannot fall to zero and
1887 * generate a race against ourselves to recycle it.
1888 */
1889 if ((active = vp->v_usecount))
1890 vp->v_usecount++;
1891
1892 /*
1893 * Prevent the vnode from being recycled or brought into use while we
1894 * clean it out.
1895 */
1896 if (vp->v_flag & VXLOCK)
1897 panic("vclean: deadlock");
1898 vp->v_flag |= VXLOCK;
1899 vp->v_vxproc = curproc;
1900 /*
1901 * Even if the count is zero, the VOP_INACTIVE routine may still
1902 * have the object locked while it cleans it out. The VOP_LOCK
1903 * ensures that the VOP_INACTIVE routine is done with its work.
1904 * For active vnodes, it ensures that no other activity can
1905 * occur while the underlying object is being cleaned out.
1906 */
dadab5e9 1907 VOP_LOCK(vp, LK_DRAIN | LK_INTERLOCK, td);
984263bc
MD
1908
1909 /*
1910 * Clean out any buffers associated with the vnode.
1911 */
3b568787 1912 vinvalbuf(vp, V_SAVE, td, 0, 0);
984263bc
MD
1913
1914 VOP_DESTROYVOBJECT(vp);
1915
1916 /*
1917 * If purging an active vnode, it must be closed and
1918 * deactivated before being reclaimed. Note that the
1919 * VOP_INACTIVE will unlock the vnode.
1920 */
1921 if (active) {
1922 if (flags & DOCLOSE)
3b568787 1923 VOP_CLOSE(vp, FNONBLOCK, td);
dadab5e9 1924 VOP_INACTIVE(vp, td);
984263bc
MD
1925 } else {
1926 /*
1927 * Any other processes trying to obtain this lock must first
1928 * wait for VXLOCK to clear, then call the new lock operation.
1929 */
dadab5e9 1930 VOP_UNLOCK(vp, 0, td);
984263bc
MD
1931 }
1932 /*
1933 * Reclaim the vnode.
1934 */
dadab5e9 1935 if (VOP_RECLAIM(vp, td))
984263bc
MD
1936 panic("vclean: cannot reclaim");
1937
1938 if (active) {
1939 /*
1940 * Inline copy of vrele() since VOP_INACTIVE
1941 * has already been called.
1942 */
8a8d5d85 1943 lwkt_gettoken(&vp->v_interlock);
984263bc
MD
1944 if (--vp->v_usecount <= 0) {
1945#ifdef DIAGNOSTIC
1946 if (vp->v_usecount < 0 || vp->v_writecount != 0) {
1947 vprint("vclean: bad ref count", vp);
1948 panic("vclean: ref cnt");
1949 }
1950#endif
1951 vfree(vp);
1952 }
8a8d5d85 1953 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
1954 }
1955
1956 cache_purge(vp);
1957 vp->v_vnlock = NULL;
1958
1959 if (VSHOULDFREE(vp))
1960 vfree(vp);
1961
1962 /*
1963 * Done with purge, notify sleepers of the grim news.
1964 */
1965 vp->v_op = dead_vnodeop_p;
1966 vn_pollgone(vp);
1967 vp->v_tag = VT_NON;
1968 vp->v_flag &= ~VXLOCK;
1969 vp->v_vxproc = NULL;
1970 if (vp->v_flag & VXWANT) {
1971 vp->v_flag &= ~VXWANT;
1972 wakeup((caddr_t) vp);
1973 }
1974}
1975
1976/*
1977 * Eliminate all activity associated with the requested vnode
1978 * and with all vnodes aliased to the requested vnode.
1979 */
1980int
1981vop_revoke(ap)
1982 struct vop_revoke_args /* {
1983 struct vnode *a_vp;
1984 int a_flags;
1985 } */ *ap;
1986{
1987 struct vnode *vp, *vq;
1988 dev_t dev;
1989
1990 KASSERT((ap->a_flags & REVOKEALL) != 0, ("vop_revoke"));
1991
1992 vp = ap->a_vp;
1993 /*
1994 * If a vgone (or vclean) is already in progress,
1995 * wait until it is done and return.
1996 */
1997 if (vp->v_flag & VXLOCK) {
1998 vp->v_flag |= VXWANT;
8a8d5d85 1999 lwkt_reltoken(&vp->v_interlock);
377d4740 2000 tsleep((caddr_t)vp, 0, "vop_revokeall", 0);
984263bc
MD
2001 return (0);
2002 }
2003 dev = vp->v_rdev;
2004 for (;;) {
8a8d5d85 2005 lwkt_gettoken(&spechash_token);
984263bc 2006 vq = SLIST_FIRST(&dev->si_hlist);
8a8d5d85 2007 lwkt_reltoken(&spechash_token);
984263bc
MD
2008 if (!vq)
2009 break;
2010 vgone(vq);
2011 }
2012 return (0);
2013}
2014
2015/*
2016 * Recycle an unused vnode to the front of the free list.
2017 * Release the passed interlock if the vnode will be recycled.
2018 */
2019int
8a8d5d85 2020vrecycle(struct vnode *vp, struct lwkt_token *inter_lkp, struct thread *td)
984263bc 2021{
8a8d5d85 2022 lwkt_gettoken(&vp->v_interlock);
984263bc
MD
2023 if (vp->v_usecount == 0) {
2024 if (inter_lkp) {
8a8d5d85 2025 lwkt_reltoken(inter_lkp);
984263bc 2026 }
dadab5e9 2027 vgonel(vp, td);
984263bc
MD
2028 return (1);
2029 }
8a8d5d85 2030 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
2031 return (0);
2032}
2033
2034/*
2035 * Eliminate all activity associated with a vnode
2036 * in preparation for reuse.
2037 */
2038void
dadab5e9 2039vgone(struct vnode *vp)
984263bc 2040{
dadab5e9 2041 struct thread *td = curthread; /* XXX */
984263bc 2042
8a8d5d85 2043 lwkt_gettoken(&vp->v_interlock);
dadab5e9 2044 vgonel(vp, td);
984263bc
MD
2045}
2046
2047/*
2048 * vgone, with the vp interlock held.
2049 */
2050void
dadab5e9 2051vgonel(struct vnode *vp, struct thread *td)
984263bc
MD
2052{
2053 int s;
2054
2055 /*
2056 * If a vgone (or vclean) is already in progress,
2057 * wait until it is done and return.
2058 */
2059 if (vp->v_flag & VXLOCK) {
2060 vp->v_flag |= VXWANT;
8a8d5d85 2061 lwkt_reltoken(&vp->v_interlock);
377d4740 2062 tsleep((caddr_t)vp, 0, "vgone", 0);
984263bc
MD
2063 return;
2064 }
2065
2066 /*
2067 * Clean out the filesystem specific data.
2068 */
dadab5e9 2069 vclean(vp, DOCLOSE, td);
8a8d5d85 2070 lwkt_gettoken(&vp->v_interlock);
984263bc
MD
2071
2072 /*
2073 * Delete from old mount point vnode list, if on one.
2074 */
2075 if (vp->v_mount != NULL)
2076 insmntque(vp, (struct mount *)0);
2077 /*
2078 * If special device, remove it from special device alias list
2079 * if it is on one.
2080 */
2081 if ((vp->v_type == VBLK || vp->v_type == VCHR) && vp->v_rdev != NULL) {
8a8d5d85 2082 lwkt_gettoken(&spechash_token);
984263bc
MD
2083 SLIST_REMOVE(&vp->v_hashchain, vp, vnode, v_specnext);
2084 freedev(vp->v_rdev);
8a8d5d85 2085 lwkt_reltoken(&spechash_token);
984263bc
MD
2086 vp->v_rdev = NULL;
2087 }
2088
2089 /*
2090 * If it is on the freelist and not already at the head,
2091 * move it to the head of the list. The test of the
2092 * VDOOMED flag and the reference count of zero is because
2093 * it will be removed from the free list by getnewvnode,
2094 * but will not have its reference count incremented until
2095 * after calling vgone. If the reference count were
2096 * incremented first, vgone would (incorrectly) try to
2097 * close the previous instance of the underlying object.
2098 */
2099 if (vp->v_usecount == 0 && !(vp->v_flag & VDOOMED)) {
2100 s = splbio();
8a8d5d85 2101 lwkt_gettoken(&vnode_free_list_token);
984263bc
MD
2102 if (vp->v_flag & VFREE)
2103 TAILQ_REMOVE(&vnode_free_list, vp, v_freelist);
2104 else
2105 freevnodes++;
2106 vp->v_flag |= VFREE;
2107 TAILQ_INSERT_HEAD(&vnode_free_list, vp, v_freelist);
8a8d5d85 2108 lwkt_reltoken(&vnode_free_list_token);
984263bc
MD
2109 splx(s);
2110 }
2111
2112 vp->v_type = VBAD;
8a8d5d85 2113 lwkt_reltoken(&vp->v_interlock);
984263bc
MD
2114}
2115
2116/*
2117 * Lookup a vnode by device number.
2118 */
2119int
2120vfinddev(dev, type, vpp)
2121 dev_t dev;
2122 enum vtype type;
2123 struct vnode **vpp;
2124{
2125 struct vnode *vp;
2126
8a8d5d85 2127 lwkt_gettoken(&spechash_token);
984263bc
MD
2128 SLIST_FOREACH(vp, &dev->si_hlist, v_specnext) {
2129 if (type == vp->v_type) {
2130 *vpp = vp;
8a8d5d85 2131 lwkt_reltoken(&spechash_token);
984263bc
MD
2132 return (1);
2133 }
2134 }
8a8d5d85 2135 lwkt_reltoken(&spechash_token);
984263bc
MD
2136 return (0);
2137}
2138
2139/*
2140 * Calculate the total number of references to a special device.
2141 */
2142int
2143vcount(vp)
2144 struct vnode *vp;
2145{
2146 struct vnode *vq;
2147 int count;
2148
2149 count = 0;
8a8d5d85 2150 lwkt_gettoken(&spechash_token);
984263bc
MD
2151 SLIST_FOREACH(vq, &vp->v_hashchain, v_specnext)
2152 count += vq->v_usecount;
8a8d5d85 2153 lwkt_reltoken(&spechash_token);
984263bc
MD
2154 return (count);
2155}
2156
2157/*
2158 * Same as above, but using the dev_t as argument
2159 */
2160
2161int
2162count_dev(dev)
2163 dev_t dev;
2164{
2165 struct vnode *vp;
2166
2167 vp = SLIST_FIRST(&dev->si_hlist);
2168 if (vp == NULL)
2169 return (0);
2170 return(vcount(vp));
2171}
2172
2173/*
2174 * Print out a description of a vnode.
2175 */
2176static char *typename[] =
2177{"VNON", "VREG", "VDIR", "VBLK", "VCHR", "VLNK", "VSOCK", "VFIFO", "VBAD"};
2178
2179void
2180vprint(label, vp)
2181 char *label;
2182 struct vnode *vp;
2183{
2184 char buf[96];
2185
2186 if (label != NULL)
2187 printf("%s: %p: ", label, (void *)vp);
2188 else
2189 printf("%p: ", (void *)vp);
2190 printf("type %s, usecount %d, writecount %d, refcount %d,",
2191 typename[vp->v_type], vp->v_usecount, vp->v_writecount,
2192 vp->v_holdcnt);
2193 buf[0] = '\0';
2194 if (vp->v_flag & VROOT)
2195 strcat(buf, "|VROOT");
2196 if (vp->v_flag & VTEXT)
2197 strcat(buf, "|VTEXT");
2198 if (vp->v_flag & VSYSTEM)
2199 strcat(buf, "|VSYSTEM");
2200 if (vp->v_flag & VXLOCK)
2201 strcat(buf, "|VXLOCK");
2202 if (vp->v_flag & VXWANT)
2203 strcat(buf, "|VXWANT");
2204 if (vp->v_flag & VBWAIT)
2205 strcat(buf, "|VBWAIT");
2206 if (vp->v_flag & VDOOMED)
2207 strcat(buf, "|VDOOMED");
2208 if (vp->v_flag & VFREE)
2209 strcat(buf, "|VFREE");
2210 if (vp->v_flag & VOBJBUF)
2211 strcat(buf, "|VOBJBUF");
2212 if (buf[0] != '\0')
2213 printf(" flags (%s)", &buf[1]);
2214 if (vp->v_data == NULL) {
2215 printf("\n");
2216 } else {
2217 printf("\n\t");
2218 VOP_PRINT(vp);
2219 }
2220}
2221
2222#ifdef DDB
2223#include <ddb/ddb.h>
2224/*
2225 * List all of the locked vnodes in the system.
2226 * Called when debugging the kernel.
2227 */
2228DB_SHOW_COMMAND(lockedvnodes, lockedvnodes)
2229{
dadab5e9 2230 struct thread *td = curthread; /* XXX */
984263bc
MD
2231 struct mount *mp, *nmp;
2232 struct vnode *vp;
2233
2234 printf("Locked vnodes\n");
8a8d5d85 2235 lwkt_gettoken(&mountlist_token);
984263bc 2236 for (mp = TAILQ_FIRST(&mountlist); mp != NULL; mp = nmp) {
8a8d5d85 2237 if (vfs_busy(mp, LK_NOWAIT, &mountlist_token, td)) {
984263bc
MD
2238 nmp = TAILQ_NEXT(mp, mnt_list);
2239 continue;
2240 }
2241 TAILQ_FOREACH(vp, &mp->mnt_nvnodelist, v_nmntvnodes) {
2242 if (VOP_ISLOCKED(vp, NULL))
2243 vprint((char *)0, vp);
2244 }
8a8d5d85 2245 lwkt_gettoken(&mountlist_token);
984263bc 2246 nmp = TAILQ_NEXT(mp, mnt_list);
dadab5e9 2247 vfs_unbusy(mp, td);
984263bc 2248 }
8a8d5d85 2249 lwkt_reltoken(&mountlist_token);
984263bc
MD
2250}
2251#endif
2252
2253/*
2254 * Top level filesystem related information gathering.
2255 */
402ed7e1 2256static int sysctl_ovfs_conf (SYSCTL_HANDLER_ARGS);
984263bc
MD
2257
2258static int
2259vfs_sysctl(SYSCTL_HANDLER_ARGS)
2260{
2261 int *name = (int *)arg1 - 1; /* XXX */
2262 u_int namelen = arg2 + 1; /* XXX */
2263 struct vfsconf *vfsp;
2264
2265#if 1 || defined(COMPAT_PRELITE2)
2266 /* Resolve ambiguity between VFS_VFSCONF and VFS_GENERIC. */
2267 if (namelen == 1)
2268 return (sysctl_ovfs_conf(oidp, arg1, arg2, req));
2269#endif
2270
2271#ifdef notyet
2272 /* all sysctl names at this level are at least name and field */
2273 if (namelen < 2)
2274 return (ENOTDIR); /* overloaded */
2275 if (name[0] != VFS_GENERIC) {
2276 for (vfsp = vfsconf; vfsp; vfsp = vfsp->vfc_next)
2277 if (vfsp->vfc_typenum == name[0])
2278 break;
2279 if (vfsp == NULL)
2280 return (EOPNOTSUPP);
2281 return ((*vfsp->vfc_vfsops->vfs_sysctl)(&name[1], namelen - 1,
2282 oldp, oldlenp, newp, newlen, p));
2283 }
2284#endif
2285 switch (name[1]) {
2286 case VFS_MAXTYPENUM:
2287 if (namelen != 2)
2288 return (ENOTDIR);
2289 return (SYSCTL_OUT(req, &maxvfsconf, sizeof(int)));
2290 case VFS_CONF:
2291 if (namelen != 3)
2292 return (ENOTDIR); /* overloaded */
2293 for (vfsp = vfsconf; vfsp; vfsp = vfsp->vfc_next)
2294 if (vfsp->vfc_typenum == name[2])
2295 break;
2296 if (vfsp == NULL)
2297 return (EOPNOTSUPP);
2298 return (SYSCTL_OUT(req, vfsp, sizeof *vfsp));
2299 }
2300 return (EOPNOTSUPP);
2301}
2302
2303SYSCTL_NODE(_vfs, VFS_GENERIC, generic, CTLFLAG_RD, vfs_sysctl,
2304 "Generic filesystem");
2305
2306#if 1 || defined(COMPAT_PRELITE2)
2307
2308static int
2309sysctl_ovfs_conf(SYSCTL_HANDLER_ARGS)
2310{
2311 int error;
2312 struct vfsconf *vfsp;
2313 struct ovfsconf ovfs;
2314
2315 for (vfsp = vfsconf; vfsp; vfsp = vfsp->vfc_next) {
2316 ovfs.vfc_vfsops = vfsp->vfc_vfsops; /* XXX used as flag */
2317 strcpy(ovfs.vfc_name, vfsp->vfc_name);
2318 ovfs.vfc_index = vfsp->vfc_typenum;
2319 ovfs.vfc_refcount = vfsp->vfc_refcount;
2320 ovfs.vfc_flags = vfsp->vfc_flags;
2321 error = SYSCTL_OUT(req, &ovfs, sizeof ovfs);
2322 if (error)
2323 return error;
2324 }
2325 return 0;
2326}
2327
2328#endif /* 1 || COMPAT_PRELITE2 */
2329
2330#if 0
2331#define KINFO_VNODESLOP 10
2332/*
2333 * Dump vnode list (via sysctl).
2334 * Copyout address of vnode followed by vnode.
2335 */
2336/* ARGSUSED */
2337static int
2338sysctl_vnode(SYSCTL_HANDLER_ARGS)
2339{
2340 struct proc *p = curproc; /* XXX */
2341 struct mount *mp, *nmp;
2342 struct vnode *nvp, *vp;
2343 int error;
2344
2345#define VPTRSZ sizeof (struct vnode *)
2346#define VNODESZ sizeof (struct vnode)
2347
2348 req->lock = 0;
2349 if (!req->oldptr) /* Make an estimate */
2350 return (SYSCTL_OUT(req, 0,
2351 (numvnodes + KINFO_VNODESLOP) * (VPTRSZ + VNODESZ)));
2352
8a8d5d85 2353 lwkt_gettoken(&mountlist_token);
984263bc 2354 for (mp = TAILQ_FIRST(&mountlist); mp != NULL; mp = nmp) {
8a8d5d85 2355 if (vfs_busy(mp, LK_NOWAIT, &mountlist_token, p)) {
984263bc
MD
2356 nmp = TAILQ_NEXT(mp, mnt_list);
2357 continue;
2358 }
2359again:
8a8d5d85 2360 lwkt_gettoken(&mntvnode_token);
984263bc
MD
2361 for (vp = TAILQ_FIRST(&mp->mnt_nvnodelist);
2362 vp != NULL;
2363 vp = nvp) {
2364 /*
2365 * Check that the vp is still associated with
2366 * this filesystem. RACE: could have been
2367 * recycled onto the same filesystem.
2368 */
2369 if (vp->v_mount != mp) {
8a8d5d85 2370 lwkt_reltoken(&mntvnode_token);
984263bc
MD
2371 goto again;
2372 }
2373 nvp = TAILQ_NEXT(vp, v_nmntvnodes);
8a8d5d85 2374 lwkt_reltoken(&mntvnode_token);
984263bc
MD
2375 if ((error = SYSCTL_OUT(req, &vp, VPTRSZ)) ||
2376 (error = SYSCTL_OUT(req, vp, VNODESZ)))
2377 return (error);
8a8d5d85 2378 lwkt_gettoken(&mntvnode_token);
984263bc 2379 }
8a8d5d85
MD
2380 lwkt_reltoken(&mntvnode_token);
2381 lwkt_gettoken(&mountlist_token);
984263bc
MD
2382 nmp = TAILQ_NEXT(mp, mnt_list);
2383 vfs_unbusy(mp, p);
2384 }
8a8d5d85 2385 lwkt_reltoken(&mountlist_token);
984263bc
MD
2386
2387 return (0);
2388}
2389#endif
2390
2391/*
2392 * XXX
2393 * Exporting the vnode list on large systems causes them to crash.
2394 * Exporting the vnode list on medium systems causes sysctl to coredump.
2395 */
2396#if 0
2397SYSCTL_PROC(_kern, KERN_VNODE, vnode, CTLTYPE_OPAQUE|CTLFLAG_RD,
2398 0, 0, sysctl_vnode, "S,vnode", "");
2399#endif
2400
2401/*
2402 * Check to see if a filesystem is mounted on a block device.
2403 */
2404int
2405vfs_mountedon(vp)
2406 struct vnode *vp;
2407{
2408
2409 if (vp->v_specmountpoint != NULL)
2410 return (EBUSY);
2411 return (0);
2412}
2413
2414/*
2415 * Unmount all filesystems. The list is traversed in reverse order
2416 * of mounting to avoid dependencies.
2417 */
2418void
2419vfs_unmountall()
2420{
2421 struct mount *mp;
dadab5e9 2422 struct thread *td = curthread;
984263bc
MD
2423 int error;
2424
dadab5e9
MD
2425 if (td->td_proc == NULL)
2426 td = initproc->p_thread; /* XXX XXX use proc0 instead? */
2427
984263bc
MD
2428 /*
2429 * Since this only runs when rebooting, it is not interlocked.
2430 */
2431 while(!TAILQ_EMPTY(&mountlist)) {
2432 mp = TAILQ_LAST(&mountlist, mntlist);
dadab5e9 2433 error = dounmount(mp, MNT_FORCE, td);
984263bc
MD
2434 if (error) {
2435 TAILQ_REMOVE(&mountlist, mp, mnt_list);
2436 printf("unmount of %s failed (",
2437 mp->mnt_stat.f_mntonname);
2438 if (error == EBUSY)
2439 printf("BUSY)\n");
2440 else
2441 printf("%d)\n", error);
2442 } else {
2443 /* The unmount has removed mp from the mountlist */
2444 }
2445 }
2446}
2447
2448/*
2449 * Build hash lists of net addresses and hang them off the mount point.
2450 * Called by ufs_mount() to set up the lists of export addresses.
2451 */
2452static int
2453vfs_hang_addrlist(mp, nep, argp)
2454 struct mount *mp;
2455 struct netexport *nep;
2456 struct export_args *argp;
2457{
1fd87d54
RG
2458 struct netcred *np;
2459 struct radix_node_head *rnh;
2460 int i;
984263bc
MD
2461 struct radix_node *rn;
2462 struct sockaddr *saddr, *smask = 0;
2463 struct domain *dom;
2464 int error;
2465
2466 if (argp->ex_addrlen == 0) {
2467 if (mp->mnt_flag & MNT_DEFEXPORTED)
2468 return (EPERM);
2469 np = &nep->ne_defexported;
2470 np->netc_exflags = argp->ex_flags;
2471 np->netc_anon = argp->ex_anon;
2472 np->netc_anon.cr_ref = 1;
2473 mp->mnt_flag |= MNT_DEFEXPORTED;
2474 return (0);
2475 }
2476
0260ddf9
MD
2477 if (argp->ex_addrlen < 0 || argp->ex_addrlen > MLEN)
2478 return (EINVAL);
2479 if (argp->ex_masklen < 0 || argp->ex_masklen > MLEN)
984263bc
MD
2480 return (EINVAL);
2481
2482 i = sizeof(struct netcred) + argp->ex_addrlen + argp->ex_masklen;
2483 np = (struct netcred *) malloc(i, M_NETADDR, M_WAITOK);
2484 bzero((caddr_t) np, i);
2485 saddr = (struct sockaddr *) (np + 1);
2486 if ((error = copyin(argp->ex_addr, (caddr_t) saddr, argp->ex_addrlen)))
2487 goto out;
2488 if (saddr->sa_len > argp->ex_addrlen)
2489 saddr->sa_len = argp->ex_addrlen;
2490 if (argp->ex_masklen) {
2491 smask = (struct sockaddr *) ((caddr_t) saddr + argp->ex_addrlen);
2492 error = copyin(argp->ex_mask, (caddr_t) smask, argp->ex_masklen);
2493 if (error)
2494 goto out;
2495 if (smask->sa_len > argp->ex_masklen)
2496 smask->sa_len = argp->ex_masklen;
2497 }
2498 i = saddr->sa_family;
2499 if ((rnh = nep->ne_rtable[i]) == 0) {
2500 /*
2501 * Seems silly to initialize every AF when most are not used,
2502 * do so on demand here
2503 */
2504 for (dom = domains; dom; dom = dom->dom_next)
2505 if (dom->dom_family == i && dom->dom_rtattach) {
2506 dom->dom_rtattach((void **) &nep->ne_rtable[i],
2507 dom->dom_rtoffset);
2508 break;
2509 }
2510 if ((rnh = nep->ne_rtable[i]) == 0) {
2511 error = ENOBUFS;
2512 goto out;
2513 }
2514 }
2515 rn = (*rnh->rnh_addaddr) ((caddr_t) saddr, (caddr_t) smask, rnh,
2516 np->netc_rnodes);
2517 if (rn == 0 || np != (struct netcred *) rn) { /* already exists */
2518 error = EPERM;
2519 goto out;
2520 }
2521 np->netc_exflags = argp->ex_flags;
2522 np->netc_anon = argp->ex_anon;
2523 np->netc_anon.cr_ref = 1;
2524 return (0);
2525out:
2526 free(np, M_NETADDR);
2527 return (error);
2528}
2529
2530/* ARGSUSED */
2531static int
2532vfs_free_netcred(rn, w)
2533 struct radix_node *rn;
2534 void *w;
2535{
1fd87d54 2536 struct radix_node_head *rnh = (struct radix_node_head *) w;
984263bc
MD
2537
2538 (*rnh->rnh_deladdr) (rn->rn_key, rn->rn_mask, rnh);
2539 free((caddr_t) rn, M_NETADDR);
2540 return (0);
2541}
2542
2543/*
2544 * Free the net address hash lists that are hanging off the mount points.
2545 */
2546static void
2547vfs_free_addrlist(nep)
2548 struct netexport *nep;
2549{
1fd87d54
RG
2550 int i;
2551 struct radix_node_head *rnh;
984263bc
MD
2552
2553 for (i = 0; i <= AF_MAX; i++)
2554 if ((rnh = nep->ne_rtable[i])) {
2555 (*rnh->rnh_walktree) (rnh, vfs_free_netcred,
2556 (caddr_t) rnh);
2557 free((caddr_t) rnh, M_RTABLE);
2558 nep->ne_rtable[i] = 0;
2559 }
2560}
2561
2562int
2563vfs_export(mp, nep, argp)
2564 struct mount *mp;
2565 struct netexport *nep;
2566 struct export_args *argp;
2567{
2568 int error;
2569
2570 if (argp->ex_flags & MNT_DELEXPORT) {
2571 if (mp->mnt_flag & MNT_EXPUBLIC) {
2572 vfs_setpublicfs(NULL, NULL, NULL);
2573 mp->mnt_flag &= ~MNT_EXPUBLIC;
2574 }
2575 vfs_free_addrlist(nep);
2576 mp->mnt_flag &= ~(MNT_EXPORTED | MNT_DEFEXPORTED);
2577 }
2578 if (argp->ex_flags & MNT_EXPORTED) {
2579 if (argp->ex_flags & MNT_EXPUBLIC) {
2580 if ((error = vfs_setpublicfs(mp, nep, argp)) != 0)
2581 return (error);
2582 mp->mnt_flag |= MNT_EXPUBLIC;
2583 }
2584 if ((error = vfs_hang_addrlist(mp, nep, argp)))
2585 return (error);
2586 mp->mnt_flag |= MNT_EXPORTED;
2587 }
2588 return (0);
2589}
2590
2591
2592/*
2593 * Set the publicly exported filesystem (WebNFS). Currently, only
2594 * one public filesystem is possible in the spec (RFC 2054 and 2055)
2595 */
2596int
2597vfs_setpublicfs(mp, nep, argp)
2598 struct mount *mp;
2599 struct netexport *nep;
2600 struct export_args *argp;
2601{
2602 int error;
2603 struct vnode *rvp;
2604 char *cp;
2605
2606 /*
2607 * mp == NULL -> invalidate the current info, the FS is
2608 * no longer exported. May be called from either vfs_export
2609 * or unmount, so check if it hasn't already been done.
2610 */
2611 if (mp == NULL) {
2612 if (nfs_pub.np_valid) {
2613 nfs_pub.np_valid = 0;
2614 if (nfs_pub.np_index != NULL) {
2615 FREE(nfs_pub.np_index, M_TEMP);
2616 nfs_pub.np_index = NULL;
2617 }
2618 }
2619 return (0);
2620 }
2621
2622 /*
2623 * Only one allowed at a time.
2624 */
2625 if (nfs_pub.np_valid != 0 && mp != nfs_pub.np_mount)
2626 return (EBUSY);
2627
2628 /*
2629 * Get real filehandle for root of exported FS.
2630 */
2631 bzero((caddr_t)&nfs_pub.np_handle, sizeof(nfs_pub.np_handle));
2632 nfs_pub.np_handle.fh_fsid = mp->mnt_stat.f_fsid;
2633
2634 if ((error = VFS_ROOT(mp, &rvp)))
2635 return (error);
2636
2637 if ((error = VFS_VPTOFH(rvp, &nfs_pub.np_handle.fh_fid)))
2638 return (error);
2639
2640 vput(rvp);
2641
2642 /*
2643 * If an indexfile was specified, pull it in.
2644 */
2645 if (argp->ex_indexfile != NULL) {
2646 MALLOC(nfs_pub.np_index, char *, MAXNAMLEN + 1, M_TEMP,
2647 M_WAITOK);
2648 error = copyinstr(argp->ex_indexfile, nfs_pub.np_index,
2649 MAXNAMLEN, (size_t *)0);
2650 if (!error) {
2651 /*
2652 * Check for illegal filenames.
2653 */
2654 for (cp = nfs_pub.np_index; *cp; cp++) {
2655 if (*cp == '/') {
2656 error = EINVAL;
2657 break;
2658 }
2659 }
2660 }
2661 if (error) {
2662 FREE(nfs_pub.np_index, M_TEMP);
2663 return (error);
2664 }
2665 }
2666
2667 nfs_pub.np_mount = mp;
2668 nfs_pub.np_valid = 1;
2669 return (0);
2670}
2671
2672struct netcred *
2673vfs_export_lookup(mp, nep, nam)
1fd87d54 2674 struct mount *mp;
984263bc
MD
2675 struct netexport *nep;
2676 struct sockaddr *nam;
2677{
1fd87d54
RG
2678 struct netcred *np;
2679 struct radix_node_head *rnh;
984263bc
MD
2680 struct sockaddr *saddr;
2681
2682 np = NULL;
2683 if (mp->mnt_flag & MNT_EXPORTED) {
2684 /*
2685 * Lookup in the export list first.
2686 */
2687 if (nam != NULL) {
2688 saddr = nam;
2689 rnh = nep->ne_rtable[saddr->sa_family];
2690 if (rnh != NULL) {
2691 np = (struct netcred *)
2692 (*rnh->rnh_matchaddr)((caddr_t)saddr,
2693 rnh);
2694 if (np && np->netc_rnodes->rn_flags & RNF_ROOT)
2695 np = NULL;
2696 }
2697 }
2698 /*
2699 * If no address match, use the default if it exists.
2700 */
2701 if (np == NULL && mp->mnt_flag & MNT_DEFEXPORTED)
2702 np = &nep->ne_defexported;
2703 }
2704 return (np);
2705}
2706
2707/*
2708 * perform msync on all vnodes under a mount point
2709 * the mount point must be locked.
2710 */
2711void
2712vfs_msync(struct mount *mp, int flags)
2713{
dadab5e9 2714 struct thread *td = curthread; /* XXX */
984263bc
MD
2715 struct vnode *vp, *nvp;
2716 struct vm_object *obj;
2717 int tries;
2718
2719 tries = 5;
8a8d5d85 2720 lwkt_gettoken(&mntvnode_token);
984263bc
MD
2721loop:
2722 for (vp = TAILQ_FIRST(&mp->mnt_nvnodelist); vp != NULL; vp = nvp) {
2723 if (vp->v_mount != mp) {
2724 if (--tries > 0)
2725 goto loop;
2726 break;
2727 }
2728 nvp = TAILQ_NEXT(vp, v_nmntvnodes);
2729
2730 if (vp->v_flag & VXLOCK) /* XXX: what if MNT_WAIT? */
2731 continue;
2732
2733 /*
2734 * There could be hundreds of thousands of vnodes, we cannot
2735 * afford to do anything heavy-weight until we have a fairly
2736 * good indication that there is something to do.
2737 */
2738 if ((vp->v_flag & VOBJDIRTY) &&
2739 (flags == MNT_WAIT || VOP_ISLOCKED(vp, NULL) == 0)) {
8a8d5d85 2740 lwkt_reltoken(&mntvnode_token);
984263bc 2741 if (!vget(vp,
dadab5e9 2742 LK_EXCLUSIVE | LK_RETRY | LK_NOOBJ, td)) {
984263bc
MD
2743 if (VOP_GETVOBJECT(vp, &obj) == 0) {
2744 vm_object_page_clean(obj, 0, 0, flags == MNT_WAIT ? OBJPC_SYNC : OBJPC_NOSYNC);
2745 }
2746 vput(vp);
2747 }
8a8d5d85 2748 lwkt_gettoken(&mntvnode_token);
984263bc
MD
2749 if (TAILQ_NEXT(vp, v_nmntvnodes) != nvp) {
2750 if (--tries > 0)
2751 goto loop;
2752 break;
2753 }
2754 }
2755 }
8a8d5d85 2756 lwkt_reltoken(&mntvnode_token);
984263bc
MD
2757}
2758
2759/*
2760 * Create the VM object needed for VMIO and mmap support. This
2761 * is done for all VREG files in the system. Some filesystems might
2762 * afford the additional metadata buffering capability of the
2763 * VMIO code by making the device node be VMIO mode also.
2764 *
2765 * vp must be locked when vfs_object_create is called.
2766 */
2767int
3b568787 2768vfs_object_create(struct vnode *vp, struct thread *td)
984263bc 2769{
3b568787 2770 return (VOP_CREATEVOBJECT(vp, td));
984263bc
MD
2771}
2772
2773void
2774vfree(vp)
2775 struct vnode *vp;
2776{
2777 int s;
2778
2779 s = splbio();
8a8d5d85 2780 lwkt_gettoken(&vnode_free_list_token);
984263bc
MD
2781 KASSERT((vp->v_flag & VFREE) == 0, ("vnode already free"));
2782 if (vp->v_flag & VAGE) {
2783 TAILQ_INSERT_HEAD(&vnode_free_list, vp, v_freelist);
2784 } else {
2785 TAILQ_INSERT_TAIL(&vnode_free_list, vp, v_freelist);
2786 }
2787 freevnodes++;
8a8d5d85 2788 lwkt_reltoken(&vnode_free_list_token);
984263bc
MD
2789 vp->v_flag &= ~VAGE;
2790 vp->v_flag |= VFREE;
2791 splx(s);
2792}
2793
2794void
2795vbusy(vp)
2796 struct vnode *vp;
2797{
2798 int s;
2799
2800 s = splbio();
8a8d5d85 2801 lwkt_gettoken(&vnode_free_list_token);
984263bc
MD
2802 KASSERT((vp->v_flag & VFREE) != 0, ("vnode not free"));
2803 TAILQ_REMOVE(&vnode_free_list, vp, v_freelist);
2804 freevnodes--;
8a8d5d85 2805 lwkt_reltoken(&vnode_free_list_token);
984263bc
MD
2806 vp->v_flag &= ~(VFREE|VAGE);
2807 splx(s);
2808}
2809
2810/*
2811 * Record a process's interest in events which might happen to
2812 * a vnode. Because poll uses the historic select-style interface
2813 * internally, this routine serves as both the ``check for any
2814 * pending events'' and the ``record my interest in future events''
2815 * functions. (These are done together, while the lock is held,
2816 * to avoid race conditions.)
2817 */
2818int
dadab5e9 2819vn_pollrecord(struct vnode *vp, struct thread *td, int events)
984263bc 2820{
8a8d5d85 2821 lwkt_gettoken(&vp->v_pollinfo.vpi_token);
984263bc
MD
2822 if (vp->v_pollinfo.vpi_revents & events) {
2823 /*
2824 * This leaves events we are not interested
2825 * in available for the other process which
2826 * which presumably had requested them
2827 * (otherwise they would never have been
2828 * recorded).
2829 */
2830 events &= vp->v_pollinfo.vpi_revents;
2831 vp->v_pollinfo.vpi_revents &= ~events;
2832
8a8d5d85 2833 lwkt_reltoken(&vp->v_pollinfo.vpi_token);
984263bc
MD
2834 return events;
2835 }
2836 vp->v_pollinfo.vpi_events |= events;
dadab5e9 2837 selrecord(td, &vp->v_pollinfo.vpi_selinfo);
8a8d5d85 2838 lwkt_reltoken(&vp->v_pollinfo.vpi_token);
984263bc
MD
2839 return 0;
2840}
2841
2842/*
2843 * Note the occurrence of an event. If the VN_POLLEVENT macro is used,
2844 * it is possible for us to miss an event due to race conditions, but
2845 * that condition is expected to be rare, so for the moment it is the
2846 * preferred interface.
2847 */
2848void
2849vn_pollevent(vp, events)
2850 struct vnode *vp;
2851 short events;
2852{
8a8d5d85 2853 lwkt_gettoken(&vp->v_pollinfo.vpi_token);
984263bc
MD
2854 if (vp->v_pollinfo.vpi_events & events) {
2855 /*
2856 * We clear vpi_events so that we don't
2857 * call selwakeup() twice if two events are
2858 * posted before the polling process(es) is
2859 * awakened. This also ensures that we take at
2860 * most one selwakeup() if the polling process
2861 * is no longer interested. However, it does
2862 * mean that only one event can be noticed at
2863 * a time. (Perhaps we should only clear those
2864 * event bits which we note?) XXX
2865 */
2866 vp->v_pollinfo.vpi_events = 0; /* &= ~events ??? */
2867 vp->v_pollinfo.vpi_revents |= events;
2868 selwakeup(&vp->v_pollinfo.vpi_selinfo);
2869 }
8a8d5d85 2870 lwkt_reltoken(&vp->v_pollinfo.vpi_token);
984263bc
MD
2871}
2872
2873/*
2874 * Wake up anyone polling on vp because it is being revoked.
2875 * This depends on dead_poll() returning POLLHUP for correct
2876 * behavior.
2877 */
2878void
2879vn_pollgone(vp)
2880 struct vnode *vp;
2881{
8a8d5d85 2882 lwkt_gettoken(&vp->v_pollinfo.vpi_token);
984263bc
MD
2883 if (vp->v_pollinfo.vpi_events) {
2884 vp->v_pollinfo.vpi_events = 0;
2885 selwakeup(&vp->v_pollinfo.vpi_selinfo);
2886 }
8a8d5d85 2887 lwkt_reltoken(&vp->v_pollinfo.vpi_token);
984263bc
MD
2888}
2889
2890
2891
2892/*
2893 * Routine to create and manage a filesystem syncer vnode.
2894 */
402ed7e1
RG
2895#define sync_close ((int (*) (struct vop_close_args *))nullop)
2896static int sync_fsync (struct vop_fsync_args *);
2897static int sync_inactive (struct vop_inactive_args *);
2898static int sync_reclaim (struct vop_reclaim_args *);
2899#define sync_lock ((int (*) (struct vop_lock_args *))vop_nolock)
2900#define sync_unlock ((int (*) (struct vop_unlock_args *))vop_nounlock)
2901static int sync_print (struct vop_print_args *);
2902#define sync_islocked ((int(*) (struct vop_islocked_args *))vop_noislocked)
984263bc
MD
2903
2904static vop_t **sync_vnodeop_p;
2905static struct vnodeopv_entry_desc sync_vnodeop_entries[] = {
2906 { &vop_default_desc, (vop_t *) vop_eopnotsupp },
2907 { &vop_close_desc, (vop_t *) sync_close }, /* close */
2908 { &vop_fsync_desc, (vop_t *) sync_fsync }, /* fsync */
2909 { &vop_inactive_desc, (vop_t *) sync_inactive }, /* inactive */
2910 { &vop_reclaim_desc, (vop_t *) sync_reclaim }, /* reclaim */
2911 { &vop_lock_desc, (vop_t *) sync_lock }, /* lock */
2912 { &vop_unlock_desc, (vop_t *) sync_unlock }, /* unlock */
2913 { &vop_print_desc, (vop_t *) sync_print }, /* print */
2914 { &vop_islocked_desc, (vop_t *) sync_islocked }, /* islocked */
2915 { NULL, NULL }
2916};
2917static struct vnodeopv_desc sync_vnodeop_opv_desc =
2918 { &sync_vnodeop_p, sync_vnodeop_entries };
2919
2920VNODEOP_SET(sync_vnodeop_opv_desc);
2921
2922/*
2923 * Create a new filesystem syncer vnode for the specified mount point.
2924 */
2925int
2926vfs_allocate_syncvnode(mp)
2927 struct mount *mp;
2928{
2929 struct vnode *vp;
2930 static long start, incr, next;
2931 int error;
2932
2933 /* Allocate a new vnode */
2934 if ((error = getnewvnode(VT_VFS, mp, sync_vnodeop_p, &vp)) != 0) {
2935 mp->mnt_syncer = NULL;
2936 return (error);
2937 }
2938 vp->v_type = VNON;
2939 /*
2940 * Place the vnode onto the syncer worklist. We attempt to
2941 * scatter them about on the list so that they will go off
2942 * at evenly distributed times even if all the filesystems
2943 * are mounted at once.
2944 */
2945 next += incr;
2946 if (next == 0 || next > syncer_maxdelay) {
2947 start /= 2;
2948 incr /= 2;
2949 if (start == 0) {
2950 start = syncer_maxdelay / 2;
2951 incr = syncer_maxdelay;
2952 }
2953 next = start;
2954 }
2955 vn_syncer_add_to_worklist(vp, syncdelay > 0 ? next % syncdelay : 0);
2956 mp->mnt_syncer = vp;
2957 return (0);
2958}
2959
2960/*
2961 * Do a lazy sync of the filesystem.
2962 */
2963static int
2964sync_fsync(ap)
2965 struct vop_fsync_args /* {
2966 struct vnode *a_vp;
2967 struct ucred *a_cred;
2968 int a_waitfor;
dadab5e9 2969 struct thread *a_td;
984263bc
MD
2970 } */ *ap;
2971{
2972 struct vnode *syncvp = ap->a_vp;
2973 struct mount *mp = syncvp->v_mount;
dadab5e9 2974 struct thread *td = ap->a_td;
984263bc
MD
2975 int asyncflag;
2976
2977 /*
2978 * We only need to do something if this is a lazy evaluation.
2979 */
2980 if (ap->a_waitfor != MNT_LAZY)
2981 return (0);
2982
2983 /*
2984 * Move ourselves to the back of the sync list.
2985 */
2986 vn_syncer_add_to_worklist(syncvp, syncdelay);
2987
2988 /*
2989 * Walk the list of vnodes pushing all that are dirty and
2990 * not already on the sync list.
2991 */
8a8d5d85
MD
2992 lwkt_gettoken(&mountlist_token);
2993 if (vfs_busy(mp, LK_EXCLUSIVE | LK_NOWAIT, &mountlist_token, td) != 0) {
2994 lwkt_reltoken(&mountlist_token);
984263bc
MD
2995 return (0);
2996 }
2997 asyncflag = mp->mnt_flag & MNT_ASYNC;
2998 mp->mnt_flag &= ~MNT_ASYNC;
2999 vfs_msync(mp, MNT_NOWAIT);
3b568787 3000 VFS_SYNC(mp, MNT_LAZY, td);
984263bc
MD
3001 if (asyncflag)
3002 mp->mnt_flag |= MNT_ASYNC;
dadab5e9 3003 vfs_unbusy(mp, td);
984263bc
MD
3004 return (0);
3005}
3006
3007/*
3008 * The syncer vnode is no referenced.
3009 */
3010static int
3011sync_inactive(ap)
3012 struct vop_inactive_args /* {
3013 struct vnode *a_vp;
3014 struct proc *a_p;
3015 } */ *ap;
3016{
3017
3018 vgone(ap->a_vp);
3019 return (0);
3020}
3021
3022/*
3023 * The syncer vnode is no longer needed and is being decommissioned.
3024 *
3025 * Modifications to the worklist must be protected at splbio().
3026 */
3027static int
3028sync_reclaim(ap)
3029 struct vop_reclaim_args /* {
3030 struct vnode *a_vp;
3031 } */ *ap;
3032{
3033 struct vnode *vp = ap->a_vp;
3034 int s;
3035
3036 s = splbio();
3037 vp->v_mount->mnt_syncer = NULL;
3038 if (vp->v_flag & VONWORKLST) {
3039 LIST_REMOVE(vp, v_synclist);
3040 vp->v_flag &= ~VONWORKLST;
3041 }
3042 splx(s);
3043
3044 return (0);
3045}
3046
3047/*
3048 * Print out a syncer vnode.
3049 */
3050static int
3051sync_print(ap)
3052 struct vop_print_args /* {
3053 struct vnode *a_vp;
3054 } */ *ap;
3055{
3056 struct vnode *vp = ap->a_vp;
3057
3058 printf("syncer vnode");
3059 if (vp->v_vnlock != NULL)
3060 lockmgr_printinfo(vp->v_vnlock);
3061 printf("\n");
3062 return (0);
3063}
3064
3065/*
3066 * extract the dev_t from a VBLK or VCHR
3067 */
3068dev_t
3069vn_todev(vp)
3070 struct vnode *vp;
3071{
3072 if (vp->v_type != VBLK && vp->v_type != VCHR)
3073 return (NODEV);
3074 return (vp->v_rdev);
3075}
3076
3077/*
3078 * Check if vnode represents a disk device
3079 */
3080int
3081vn_isdisk(vp, errp)
3082 struct vnode *vp;
3083 int *errp;
3084{
3085 if (vp->v_type != VBLK && vp->v_type != VCHR) {
3086 if (errp != NULL)
3087 *errp = ENOTBLK;
3088 return (0);
3089 }
3090 if (vp->v_rdev == NULL) {
3091 if (errp != NULL)
3092 *errp = ENXIO;
3093 return (0);
3094 }
335dda38 3095 if (!dev_dport(vp->v_rdev)) {
984263bc
MD
3096 if (errp != NULL)
3097 *errp = ENXIO;
3098 return (0);
3099 }
335dda38 3100 if (!(dev_dflags(vp->v_rdev) & D_DISK)) {
984263bc
MD
3101 if (errp != NULL)
3102 *errp = ENOTBLK;
3103 return (0);
3104 }
3105 if (errp != NULL)
3106 *errp = 0;
3107 return (1);
3108}
3109
3110void
3111NDFREE(ndp, flags)
3112 struct nameidata *ndp;
3113 const uint flags;
3114{
3115 if (!(flags & NDF_NO_FREE_PNBUF) &&
2b69e610 3116 (ndp->ni_cnd.cn_flags & CNP_HASBUF)) {
984263bc 3117 zfree(namei_zone, ndp->ni_cnd.cn_pnbuf);
2b69e610 3118 ndp->ni_cnd.cn_flags &= ~CNP_HASBUF;
984263bc 3119 }
bc0c094e
MD
3120 if (!(flags & NDF_NO_DNCP_RELE) &&
3121 (ndp->ni_cnd.cn_flags & CNP_WANTDNCP) &&
3122 ndp->ni_dncp) {
3123 cache_drop(ndp->ni_dncp);
3124 ndp->ni_dncp = NULL;
3125 }
3126 if (!(flags & NDF_NO_NCP_RELE) &&
3127 (ndp->ni_cnd.cn_flags & CNP_WANTNCP) &&
3128 ndp->ni_ncp) {
3129 cache_drop(ndp->ni_ncp);
3130 ndp->ni_ncp = NULL;
3131 }
984263bc 3132 if (!(flags & NDF_NO_DVP_UNLOCK) &&
2b69e610 3133 (ndp->ni_cnd.cn_flags & CNP_LOCKPARENT) &&
bc0c094e 3134 ndp->ni_dvp != ndp->ni_vp) {
dadab5e9 3135 VOP_UNLOCK(ndp->ni_dvp, 0, ndp->ni_cnd.cn_td);
bc0c094e 3136 }
984263bc 3137 if (!(flags & NDF_NO_DVP_RELE) &&
2b69e610 3138 (ndp->ni_cnd.cn_flags & (CNP_LOCKPARENT|CNP_WANTPARENT))) {
984263bc
MD
3139 vrele(ndp->ni_dvp);
3140 ndp->ni_dvp = NULL;
3141 }
3142 if (!(flags & NDF_NO_VP_UNLOCK) &&
bc0c094e 3143 (ndp->ni_cnd.cn_flags & CNP_LOCKLEAF) && ndp->ni_vp) {
dadab5e9 3144 VOP_UNLOCK(ndp->ni_vp, 0, ndp->ni_cnd.cn_td);
bc0c094e 3145 }
984263bc
MD
3146 if (!(flags & NDF_NO_VP_RELE) &&
3147 ndp->ni_vp) {
3148 vrele(ndp->ni_vp);
3149 ndp->ni_vp = NULL;
3150 }
3151 if (!(flags & NDF_NO_STARTDIR_RELE) &&
2b69e610 3152 (ndp->ni_cnd.cn_flags & CNP_SAVESTART)) {
984263bc
MD
3153 vrele(ndp->ni_startdir);
3154 ndp->ni_startdir = NULL;
3155 }
3156}
bc0c094e 3157