1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1994 Jan-Simon Pendry 5 * Copyright (c) 1994 6 * The Regents of the University of California. All rights reserved. 7 * Copyright (c) 2005, 2006, 2012 Masanori Ozawa <ozawa@ongs.co.jp>, ONGS Inc. 8 * Copyright (c) 2006, 2012 Daichi Goto <daichi@freebsd.org> 9 * 10 * This code is derived from software contributed to Berkeley by 11 * Jan-Simon Pendry. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 3. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 * 37 * @(#)union_subr.c 8.20 (Berkeley) 5/20/95 38 * $FreeBSD$ 39 */ 40 41 #include <sys/param.h> 42 #include <sys/systm.h> 43 #include <sys/kernel.h> 44 #include <sys/ktr.h> 45 #include <sys/lock.h> 46 #include <sys/mutex.h> 47 #include <sys/malloc.h> 48 #include <sys/mount.h> 49 #include <sys/namei.h> 50 #include <sys/proc.h> 51 #include <sys/vnode.h> 52 #include <sys/dirent.h> 53 #include <sys/fcntl.h> 54 #include <sys/filedesc.h> 55 #include <sys/stat.h> 56 #include <sys/sysctl.h> 57 #include <sys/taskqueue.h> 58 #include <sys/resourcevar.h> 59 60 #include <machine/atomic.h> 61 62 #include <security/mac/mac_framework.h> 63 64 #include <vm/uma.h> 65 66 #include <fs/unionfs/union.h> 67 68 #define NUNIONFSNODECACHE 16 69 #define UNIONFSHASHMASK (NUNIONFSNODECACHE - 1) 70 71 static MALLOC_DEFINE(M_UNIONFSHASH, "UNIONFS hash", "UNIONFS hash table"); 72 MALLOC_DEFINE(M_UNIONFSNODE, "UNIONFS node", "UNIONFS vnode private part"); 73 MALLOC_DEFINE(M_UNIONFSPATH, "UNIONFS path", "UNIONFS path private part"); 74 75 static struct task unionfs_deferred_rele_task; 76 static struct mtx unionfs_deferred_rele_lock; 77 static STAILQ_HEAD(, unionfs_node) unionfs_deferred_rele_list = 78 STAILQ_HEAD_INITIALIZER(unionfs_deferred_rele_list); 79 static TASKQUEUE_DEFINE_THREAD(unionfs_rele); 80 81 unsigned int unionfs_ndeferred = 0; 82 SYSCTL_UINT(_vfs, OID_AUTO, unionfs_ndeferred, CTLFLAG_RD, 83 &unionfs_ndeferred, 0, "unionfs deferred vnode release"); 84 85 static void unionfs_deferred_rele(void *, int); 86 87 /* 88 * Initialize 89 */ 90 int 91 unionfs_init(struct vfsconf *vfsp) 92 { 93 UNIONFSDEBUG("unionfs_init\n"); /* printed during system boot */ 94 TASK_INIT(&unionfs_deferred_rele_task, 0, unionfs_deferred_rele, NULL); 95 mtx_init(&unionfs_deferred_rele_lock, "uniondefr", NULL, MTX_DEF); 96 return (0); 97 } 98 99 /* 100 * Uninitialize 101 */ 102 int 103 unionfs_uninit(struct vfsconf *vfsp) 104 { 105 taskqueue_quiesce(taskqueue_unionfs_rele); 106 taskqueue_free(taskqueue_unionfs_rele); 107 mtx_destroy(&unionfs_deferred_rele_lock); 108 return (0); 109 } 110 111 static void 112 unionfs_deferred_rele(void *arg __unused, int pending __unused) 113 { 114 STAILQ_HEAD(, unionfs_node) local_rele_list; 115 struct unionfs_node *unp, *tunp; 116 unsigned int ndeferred; 117 118 ndeferred = 0; 119 STAILQ_INIT(&local_rele_list); 120 mtx_lock(&unionfs_deferred_rele_lock); 121 STAILQ_CONCAT(&local_rele_list, &unionfs_deferred_rele_list); 122 mtx_unlock(&unionfs_deferred_rele_lock); 123 STAILQ_FOREACH_SAFE(unp, &local_rele_list, un_rele, tunp) { 124 ++ndeferred; 125 MPASS(unp->un_dvp != NULL); 126 vrele(unp->un_dvp); 127 free(unp, M_UNIONFSNODE); 128 } 129 130 /* We expect this function to be single-threaded, thus no atomic */ 131 unionfs_ndeferred += ndeferred; 132 } 133 134 static struct unionfs_node_hashhead * 135 unionfs_get_hashhead(struct vnode *dvp, struct vnode *lookup) 136 { 137 struct unionfs_node *unp; 138 139 unp = VTOUNIONFS(dvp); 140 141 return (&(unp->un_hashtbl[vfs_hash_index(lookup) & UNIONFSHASHMASK])); 142 } 143 144 /* 145 * Attempt to lookup a cached unionfs vnode by upper/lower vp 146 * from dvp, with dvp's interlock held. 147 */ 148 static struct vnode * 149 unionfs_get_cached_vnode_locked(struct vnode *lookup, struct vnode *dvp) 150 { 151 struct unionfs_node *unp; 152 struct unionfs_node_hashhead *hd; 153 struct vnode *vp; 154 155 hd = unionfs_get_hashhead(dvp, lookup); 156 157 LIST_FOREACH(unp, hd, un_hash) { 158 if (unp->un_uppervp == lookup || 159 unp->un_lowervp == lookup) { 160 vp = UNIONFSTOV(unp); 161 VI_LOCK_FLAGS(vp, MTX_DUPOK); 162 vp->v_iflag &= ~VI_OWEINACT; 163 if (VN_IS_DOOMED(vp) || 164 ((vp->v_iflag & VI_DOINGINACT) != 0)) { 165 VI_UNLOCK(vp); 166 vp = NULLVP; 167 } else { 168 vrefl(vp); 169 VI_UNLOCK(vp); 170 } 171 return (vp); 172 } 173 } 174 175 return (NULLVP); 176 } 177 178 179 /* 180 * Get the cached vnode. 181 */ 182 static struct vnode * 183 unionfs_get_cached_vnode(struct vnode *uvp, struct vnode *lvp, 184 struct vnode *dvp) 185 { 186 struct vnode *vp; 187 188 vp = NULLVP; 189 VI_LOCK(dvp); 190 if (uvp != NULLVP) 191 vp = unionfs_get_cached_vnode_locked(uvp, dvp); 192 else if (lvp != NULLVP) 193 vp = unionfs_get_cached_vnode_locked(lvp, dvp); 194 VI_UNLOCK(dvp); 195 196 return (vp); 197 } 198 199 /* 200 * Add the new vnode into cache. 201 */ 202 static struct vnode * 203 unionfs_ins_cached_vnode(struct unionfs_node *uncp, 204 struct vnode *dvp) 205 { 206 struct unionfs_node_hashhead *hd; 207 struct vnode *vp; 208 209 ASSERT_VOP_ELOCKED(uncp->un_uppervp, __func__); 210 ASSERT_VOP_ELOCKED(uncp->un_lowervp, __func__); 211 KASSERT(uncp->un_uppervp == NULLVP || uncp->un_uppervp->v_type == VDIR, 212 ("%s: v_type != VDIR", __func__)); 213 KASSERT(uncp->un_lowervp == NULLVP || uncp->un_lowervp->v_type == VDIR, 214 ("%s: v_type != VDIR", __func__)); 215 216 vp = NULLVP; 217 VI_LOCK(dvp); 218 if (uncp->un_uppervp != NULL) 219 vp = unionfs_get_cached_vnode_locked(uncp->un_uppervp, dvp); 220 else if (uncp->un_lowervp != NULL) 221 vp = unionfs_get_cached_vnode_locked(uncp->un_lowervp, dvp); 222 if (vp == NULLVP) { 223 hd = unionfs_get_hashhead(dvp, (uncp->un_uppervp != NULLVP ? 224 uncp->un_uppervp : uncp->un_lowervp)); 225 LIST_INSERT_HEAD(hd, uncp, un_hash); 226 } 227 VI_UNLOCK(dvp); 228 229 return (vp); 230 } 231 232 /* 233 * Remove the vnode. 234 */ 235 static void 236 unionfs_rem_cached_vnode(struct unionfs_node *unp, struct vnode *dvp) 237 { 238 KASSERT(unp != NULL, ("%s: null node", __func__)); 239 KASSERT(dvp != NULLVP, 240 ("%s: null parent vnode", __func__)); 241 242 VI_LOCK(dvp); 243 if (unp->un_hash.le_prev != NULL) { 244 LIST_REMOVE(unp, un_hash); 245 unp->un_hash.le_next = NULL; 246 unp->un_hash.le_prev = NULL; 247 } 248 VI_UNLOCK(dvp); 249 } 250 251 /* 252 * Common cleanup handling for unionfs_nodeget 253 * Upper, lower, and parent directory vnodes are expected to be referenced by 254 * the caller. Upper and lower vnodes, if non-NULL, are also expected to be 255 * exclusively locked by the caller. 256 * This function will return with the caller's locks and references undone. 257 */ 258 static void 259 unionfs_nodeget_cleanup(struct vnode *vp, struct unionfs_node *unp) 260 { 261 262 /* 263 * Lock and reset the default vnode lock; vgone() expects a locked 264 * vnode, and we're going to reset the vnode ops. 265 */ 266 lockmgr(&vp->v_lock, LK_EXCLUSIVE, NULL); 267 268 /* 269 * Clear out private data and reset the vnode ops to avoid use of 270 * unionfs vnode ops on a partially constructed vnode. 271 */ 272 VI_LOCK(vp); 273 vp->v_data = NULL; 274 vp->v_vnlock = &vp->v_lock; 275 vp->v_op = &dead_vnodeops; 276 VI_UNLOCK(vp); 277 vgone(vp); 278 vput(vp); 279 280 if (unp->un_dvp != NULLVP) 281 vrele(unp->un_dvp); 282 if (unp->un_uppervp != NULLVP) 283 vput(unp->un_uppervp); 284 if (unp->un_lowervp != NULLVP) 285 vput(unp->un_lowervp); 286 if (unp->un_hashtbl != NULL) 287 hashdestroy(unp->un_hashtbl, M_UNIONFSHASH, UNIONFSHASHMASK); 288 free(unp->un_path, M_UNIONFSPATH); 289 free(unp, M_UNIONFSNODE); 290 } 291 292 /* 293 * Make a new or get existing unionfs node. 294 * 295 * uppervp and lowervp should be unlocked. Because if new unionfs vnode is 296 * locked, uppervp or lowervp is locked too. In order to prevent dead lock, 297 * you should not lock plurality simultaneously. 298 */ 299 int 300 unionfs_nodeget(struct mount *mp, struct vnode *uppervp, 301 struct vnode *lowervp, struct vnode *dvp, struct vnode **vpp, 302 struct componentname *cnp) 303 { 304 char *path; 305 struct unionfs_mount *ump; 306 struct unionfs_node *unp; 307 struct vnode *vp; 308 u_long hashmask; 309 int error; 310 int lkflags; 311 enum vtype vt; 312 313 error = 0; 314 ump = MOUNTTOUNIONFSMOUNT(mp); 315 lkflags = (cnp ? cnp->cn_lkflags : 0); 316 path = (cnp ? cnp->cn_nameptr : NULL); 317 *vpp = NULLVP; 318 319 if (uppervp == NULLVP && lowervp == NULLVP) 320 panic("%s: upper and lower is null", __func__); 321 322 vt = (uppervp != NULLVP ? uppervp->v_type : lowervp->v_type); 323 324 /* If it has no ISLASTCN flag, path check is skipped. */ 325 if (cnp && !(cnp->cn_flags & ISLASTCN)) 326 path = NULL; 327 328 /* check the cache */ 329 if (dvp != NULLVP && vt == VDIR) { 330 vp = unionfs_get_cached_vnode(uppervp, lowervp, dvp); 331 if (vp != NULLVP) { 332 *vpp = vp; 333 goto unionfs_nodeget_out; 334 } 335 } 336 337 unp = malloc(sizeof(struct unionfs_node), 338 M_UNIONFSNODE, M_WAITOK | M_ZERO); 339 340 error = getnewvnode("unionfs", mp, &unionfs_vnodeops, &vp); 341 if (error != 0) { 342 free(unp, M_UNIONFSNODE); 343 return (error); 344 } 345 if (dvp != NULLVP) 346 vref(dvp); 347 if (uppervp != NULLVP) 348 vref(uppervp); 349 if (lowervp != NULLVP) 350 vref(lowervp); 351 352 if (vt == VDIR) { 353 unp->un_hashtbl = hashinit(NUNIONFSNODECACHE, M_UNIONFSHASH, 354 &hashmask); 355 KASSERT(hashmask == UNIONFSHASHMASK, 356 ("unexpected unionfs hash mask 0x%lx", hashmask)); 357 } 358 359 unp->un_vnode = vp; 360 unp->un_uppervp = uppervp; 361 unp->un_lowervp = lowervp; 362 unp->un_dvp = dvp; 363 if (uppervp != NULLVP) 364 vp->v_vnlock = uppervp->v_vnlock; 365 else 366 vp->v_vnlock = lowervp->v_vnlock; 367 368 if (path != NULL) { 369 unp->un_path = malloc(cnp->cn_namelen + 1, 370 M_UNIONFSPATH, M_WAITOK | M_ZERO); 371 bcopy(cnp->cn_nameptr, unp->un_path, cnp->cn_namelen); 372 unp->un_path[cnp->cn_namelen] = '\0'; 373 unp->un_pathlen = cnp->cn_namelen; 374 } 375 vp->v_type = vt; 376 vp->v_data = unp; 377 378 /* 379 * TODO: This is an imperfect check, as there's no guarantee that 380 * the underlying filesystems will always return vnode pointers 381 * for the root inodes that match our cached values. To reduce 382 * the likelihood of failure, for example in the case where either 383 * vnode has been forcibly doomed, we check both pointers and set 384 * VV_ROOT if either matches. 385 */ 386 if (ump->um_uppervp == uppervp || ump->um_lowervp == lowervp) 387 vp->v_vflag |= VV_ROOT; 388 KASSERT(dvp != NULL || (vp->v_vflag & VV_ROOT) != 0, 389 ("%s: NULL dvp for non-root vp %p", __func__, vp)); 390 391 vn_lock_pair(lowervp, false, uppervp, false); 392 error = insmntque1(vp, mp); 393 if (error != 0) { 394 unionfs_nodeget_cleanup(vp, unp); 395 return (error); 396 } 397 if (lowervp != NULL && VN_IS_DOOMED(lowervp)) { 398 vput(lowervp); 399 unp->un_lowervp = NULL; 400 } 401 if (uppervp != NULL && VN_IS_DOOMED(uppervp)) { 402 vput(uppervp); 403 unp->un_uppervp = NULL; 404 } 405 if (unp->un_lowervp == NULL && unp->un_uppervp == NULL) { 406 unionfs_nodeget_cleanup(vp, unp); 407 return (ENOENT); 408 } 409 410 if (dvp != NULLVP && vt == VDIR) 411 *vpp = unionfs_ins_cached_vnode(unp, dvp); 412 if (*vpp != NULLVP) { 413 unionfs_nodeget_cleanup(vp, unp); 414 vp = *vpp; 415 } else { 416 if (uppervp != NULL) 417 VOP_UNLOCK(uppervp); 418 if (lowervp != NULL) 419 VOP_UNLOCK(lowervp); 420 *vpp = vp; 421 } 422 423 unionfs_nodeget_out: 424 if (lkflags & LK_TYPE_MASK) 425 vn_lock(vp, lkflags | LK_RETRY); 426 427 return (0); 428 } 429 430 /* 431 * Clean up the unionfs node. 432 */ 433 void 434 unionfs_noderem(struct vnode *vp) 435 { 436 struct unionfs_node *unp, *unp_t1, *unp_t2; 437 struct unionfs_node_hashhead *hd; 438 struct unionfs_node_status *unsp, *unsp_tmp; 439 struct vnode *lvp; 440 struct vnode *uvp; 441 struct vnode *dvp; 442 int count; 443 int writerefs; 444 445 KASSERT(vp->v_vnlock->lk_recurse == 0, 446 ("%s: vnode %p locked recursively", __func__, vp)); 447 if (lockmgr(&vp->v_lock, LK_EXCLUSIVE | LK_NOWAIT, NULL) != 0) 448 panic("%s: failed to acquire lock for vnode lock", __func__); 449 450 /* 451 * Use the interlock to protect the clearing of v_data to 452 * prevent faults in unionfs_lock(). 453 */ 454 VI_LOCK(vp); 455 unp = VTOUNIONFS(vp); 456 lvp = unp->un_lowervp; 457 uvp = unp->un_uppervp; 458 dvp = unp->un_dvp; 459 unp->un_lowervp = unp->un_uppervp = NULLVP; 460 vp->v_vnlock = &(vp->v_lock); 461 vp->v_data = NULL; 462 vp->v_object = NULL; 463 if (unp->un_hashtbl != NULL) { 464 /* 465 * Clear out any cached child vnodes. This should only 466 * be necessary during forced unmount, when the vnode may 467 * be reclaimed with a non-zero use count. Otherwise the 468 * reference held by each child should prevent reclamation. 469 */ 470 for (count = 0; count <= UNIONFSHASHMASK; count++) { 471 hd = unp->un_hashtbl + count; 472 LIST_FOREACH_SAFE(unp_t1, hd, un_hash, unp_t2) { 473 LIST_REMOVE(unp_t1, un_hash); 474 unp_t1->un_hash.le_next = NULL; 475 unp_t1->un_hash.le_prev = NULL; 476 } 477 } 478 } 479 VI_UNLOCK(vp); 480 481 writerefs = atomic_load_int(&vp->v_writecount); 482 VNASSERT(writerefs >= 0, vp, 483 ("%s: write count %d, unexpected text ref", __func__, writerefs)); 484 /* 485 * If we were opened for write, we leased the write reference 486 * to the lower vnode. If this is a reclamation due to the 487 * forced unmount, undo the reference now. 488 */ 489 if (writerefs > 0) { 490 VNASSERT(uvp != NULL, vp, 491 ("%s: write reference without upper vnode", __func__)); 492 VOP_ADD_WRITECOUNT(uvp, -writerefs); 493 } 494 if (lvp != NULLVP) 495 VOP_UNLOCK(lvp); 496 if (uvp != NULLVP) 497 VOP_UNLOCK(uvp); 498 499 if (dvp != NULLVP) 500 unionfs_rem_cached_vnode(unp, dvp); 501 502 if (lvp != NULLVP) 503 vrele(lvp); 504 if (uvp != NULLVP) 505 vrele(uvp); 506 if (unp->un_path != NULL) { 507 free(unp->un_path, M_UNIONFSPATH); 508 unp->un_path = NULL; 509 unp->un_pathlen = 0; 510 } 511 512 if (unp->un_hashtbl != NULL) { 513 hashdestroy(unp->un_hashtbl, M_UNIONFSHASH, UNIONFSHASHMASK); 514 } 515 516 LIST_FOREACH_SAFE(unsp, &(unp->un_unshead), uns_list, unsp_tmp) { 517 LIST_REMOVE(unsp, uns_list); 518 free(unsp, M_TEMP); 519 } 520 if (dvp != NULLVP) { 521 mtx_lock(&unionfs_deferred_rele_lock); 522 STAILQ_INSERT_TAIL(&unionfs_deferred_rele_list, unp, un_rele); 523 mtx_unlock(&unionfs_deferred_rele_lock); 524 taskqueue_enqueue(taskqueue_unionfs_rele, 525 &unionfs_deferred_rele_task); 526 } else 527 free(unp, M_UNIONFSNODE); 528 } 529 530 /* 531 * Get the unionfs node status object for the vnode corresponding to unp, 532 * for the process that owns td. Allocate a new status object if one 533 * does not already exist. 534 */ 535 void 536 unionfs_get_node_status(struct unionfs_node *unp, struct thread *td, 537 struct unionfs_node_status **unspp) 538 { 539 struct unionfs_node_status *unsp; 540 pid_t pid; 541 542 pid = td->td_proc->p_pid; 543 544 KASSERT(NULL != unspp, ("%s: NULL status", __func__)); 545 ASSERT_VOP_ELOCKED(UNIONFSTOV(unp), __func__); 546 547 LIST_FOREACH(unsp, &(unp->un_unshead), uns_list) { 548 if (unsp->uns_pid == pid) { 549 *unspp = unsp; 550 return; 551 } 552 } 553 554 /* create a new unionfs node status */ 555 unsp = malloc(sizeof(struct unionfs_node_status), 556 M_TEMP, M_WAITOK | M_ZERO); 557 558 unsp->uns_pid = pid; 559 LIST_INSERT_HEAD(&(unp->un_unshead), unsp, uns_list); 560 561 *unspp = unsp; 562 } 563 564 /* 565 * Remove the unionfs node status, if you can. 566 * You need exclusive lock this vnode. 567 */ 568 void 569 unionfs_tryrem_node_status(struct unionfs_node *unp, 570 struct unionfs_node_status *unsp) 571 { 572 KASSERT(NULL != unsp, ("%s: NULL status", __func__)); 573 ASSERT_VOP_ELOCKED(UNIONFSTOV(unp), __func__); 574 575 if (0 < unsp->uns_lower_opencnt || 0 < unsp->uns_upper_opencnt) 576 return; 577 578 LIST_REMOVE(unsp, uns_list); 579 free(unsp, M_TEMP); 580 } 581 582 /* 583 * Create upper node attr. 584 */ 585 void 586 unionfs_create_uppervattr_core(struct unionfs_mount *ump, struct vattr *lva, 587 struct vattr *uva, struct thread *td) 588 { 589 VATTR_NULL(uva); 590 uva->va_type = lva->va_type; 591 uva->va_atime = lva->va_atime; 592 uva->va_mtime = lva->va_mtime; 593 uva->va_ctime = lva->va_ctime; 594 595 switch (ump->um_copymode) { 596 case UNIONFS_TRANSPARENT: 597 uva->va_mode = lva->va_mode; 598 uva->va_uid = lva->va_uid; 599 uva->va_gid = lva->va_gid; 600 break; 601 case UNIONFS_MASQUERADE: 602 if (ump->um_uid == lva->va_uid) { 603 uva->va_mode = lva->va_mode & 077077; 604 uva->va_mode |= (lva->va_type == VDIR ? 605 ump->um_udir : ump->um_ufile) & 0700; 606 uva->va_uid = lva->va_uid; 607 uva->va_gid = lva->va_gid; 608 } else { 609 uva->va_mode = (lva->va_type == VDIR ? 610 ump->um_udir : ump->um_ufile); 611 uva->va_uid = ump->um_uid; 612 uva->va_gid = ump->um_gid; 613 } 614 break; 615 default: /* UNIONFS_TRADITIONAL */ 616 uva->va_mode = 0777 & ~td->td_proc->p_pd->pd_cmask; 617 uva->va_uid = ump->um_uid; 618 uva->va_gid = ump->um_gid; 619 break; 620 } 621 } 622 623 /* 624 * Create upper node attr. 625 */ 626 int 627 unionfs_create_uppervattr(struct unionfs_mount *ump, struct vnode *lvp, 628 struct vattr *uva, struct ucred *cred, struct thread *td) 629 { 630 struct vattr lva; 631 int error; 632 633 if ((error = VOP_GETATTR(lvp, &lva, cred))) 634 return (error); 635 636 unionfs_create_uppervattr_core(ump, &lva, uva, td); 637 638 return (error); 639 } 640 641 /* 642 * relookup 643 * 644 * dvp should be locked on entry and will be locked on return. 645 * 646 * If an error is returned, *vpp will be invalid, otherwise it will hold a 647 * locked, referenced vnode. If *vpp == dvp then remember that only one 648 * LK_EXCLUSIVE lock is held. 649 */ 650 int 651 unionfs_relookup(struct vnode *dvp, struct vnode **vpp, 652 struct componentname *cnp, struct componentname *cn, struct thread *td, 653 char *path, int pathlen, u_long nameiop) 654 { 655 int error; 656 657 cn->cn_namelen = pathlen; 658 cn->cn_pnbuf = path; 659 cn->cn_nameiop = nameiop; 660 cn->cn_flags = (LOCKPARENT | LOCKLEAF | HASBUF | SAVENAME | ISLASTCN); 661 cn->cn_lkflags = LK_EXCLUSIVE; 662 cn->cn_cred = cnp->cn_cred; 663 cn->cn_nameptr = cn->cn_pnbuf; 664 665 if (nameiop == DELETE) 666 cn->cn_flags |= (cnp->cn_flags & (DOWHITEOUT | SAVESTART)); 667 else if (RENAME == nameiop) 668 cn->cn_flags |= (cnp->cn_flags & SAVESTART); 669 else if (nameiop == CREATE) 670 cn->cn_flags |= NOCACHE; 671 672 vref(dvp); 673 VOP_UNLOCK(dvp); 674 675 if ((error = relookup(dvp, vpp, cn))) { 676 vn_lock(dvp, LK_EXCLUSIVE | LK_RETRY); 677 } else 678 vrele(dvp); 679 680 KASSERT((cn->cn_flags & HASBUF) != 0, 681 ("%s: HASBUF cleared", __func__)); 682 KASSERT((cn->cn_flags & SAVENAME) != 0, 683 ("%s: SAVENAME cleared", __func__)); 684 KASSERT(cn->cn_pnbuf == path, ("%s: cn_pnbuf changed", __func__)); 685 686 return (error); 687 } 688 689 /* 690 * relookup for CREATE namei operation. 691 * 692 * dvp is unionfs vnode. dvp should be locked. 693 * 694 * If it called 'unionfs_copyfile' function by unionfs_link etc, 695 * VOP_LOOKUP information is broken. 696 * So it need relookup in order to create link etc. 697 */ 698 int 699 unionfs_relookup_for_create(struct vnode *dvp, struct componentname *cnp, 700 struct thread *td) 701 { 702 struct vnode *udvp; 703 struct vnode *vp; 704 struct componentname cn; 705 int error; 706 707 udvp = UNIONFSVPTOUPPERVP(dvp); 708 vp = NULLVP; 709 710 KASSERT((cnp->cn_flags & HASBUF) != 0, 711 ("%s called without HASBUF", __func__)); 712 error = unionfs_relookup(udvp, &vp, cnp, &cn, td, cnp->cn_nameptr, 713 cnp->cn_namelen, CREATE); 714 if (error) 715 return (error); 716 717 if (vp != NULLVP) { 718 if (udvp == vp) 719 vrele(vp); 720 else 721 vput(vp); 722 723 error = EEXIST; 724 } 725 726 return (error); 727 } 728 729 /* 730 * relookup for DELETE namei operation. 731 * 732 * dvp is unionfs vnode. dvp should be locked. 733 */ 734 int 735 unionfs_relookup_for_delete(struct vnode *dvp, struct componentname *cnp, 736 struct thread *td) 737 { 738 struct vnode *udvp; 739 struct vnode *vp; 740 struct componentname cn; 741 int error; 742 743 udvp = UNIONFSVPTOUPPERVP(dvp); 744 vp = NULLVP; 745 746 KASSERT((cnp->cn_flags & HASBUF) != 0, 747 ("%s called without HASBUF", __func__)); 748 error = unionfs_relookup(udvp, &vp, cnp, &cn, td, cnp->cn_nameptr, 749 cnp->cn_namelen, DELETE); 750 if (error) 751 return (error); 752 753 if (vp == NULLVP) 754 error = ENOENT; 755 else { 756 if (udvp == vp) 757 vrele(vp); 758 else 759 vput(vp); 760 } 761 762 return (error); 763 } 764 765 /* 766 * relookup for RENAME namei operation. 767 * 768 * dvp is unionfs vnode. dvp should be locked. 769 */ 770 int 771 unionfs_relookup_for_rename(struct vnode *dvp, struct componentname *cnp, 772 struct thread *td) 773 { 774 struct vnode *udvp; 775 struct vnode *vp; 776 struct componentname cn; 777 int error; 778 779 udvp = UNIONFSVPTOUPPERVP(dvp); 780 vp = NULLVP; 781 782 KASSERT((cnp->cn_flags & HASBUF) != 0, 783 ("%s called without HASBUF", __func__)); 784 error = unionfs_relookup(udvp, &vp, cnp, &cn, td, cnp->cn_nameptr, 785 cnp->cn_namelen, RENAME); 786 if (error) 787 return (error); 788 789 if (vp != NULLVP) { 790 if (udvp == vp) 791 vrele(vp); 792 else 793 vput(vp); 794 } 795 796 return (error); 797 } 798 799 /* 800 * Update the unionfs_node. 801 * 802 * uvp is new locked upper vnode. unionfs vnode's lock will be exchanged to the 803 * uvp's lock and lower's lock will be unlocked. 804 */ 805 static void 806 unionfs_node_update(struct unionfs_node *unp, struct vnode *uvp, 807 struct thread *td) 808 { 809 struct unionfs_node_hashhead *hd; 810 struct vnode *vp; 811 struct vnode *lvp; 812 struct vnode *dvp; 813 unsigned count, lockrec; 814 815 vp = UNIONFSTOV(unp); 816 lvp = unp->un_lowervp; 817 ASSERT_VOP_ELOCKED(lvp, __func__); 818 ASSERT_VOP_ELOCKED(uvp, __func__); 819 dvp = unp->un_dvp; 820 821 VNASSERT(vp->v_writecount == 0, vp, 822 ("%s: non-zero writecount", __func__)); 823 /* 824 * Uppdate the upper vnode's lock state to match the lower vnode, 825 * and then switch the unionfs vnode's lock to the upper vnode. 826 */ 827 lockrec = lvp->v_vnlock->lk_recurse; 828 for (count = 0; count < lockrec; count++) 829 vn_lock(uvp, LK_EXCLUSIVE | LK_CANRECURSE | LK_RETRY); 830 VI_LOCK(vp); 831 unp->un_uppervp = uvp; 832 vp->v_vnlock = uvp->v_vnlock; 833 VI_UNLOCK(vp); 834 835 /* 836 * Re-cache the unionfs vnode against the upper vnode 837 */ 838 if (dvp != NULLVP && vp->v_type == VDIR) { 839 VI_LOCK(dvp); 840 if (unp->un_hash.le_prev != NULL) { 841 LIST_REMOVE(unp, un_hash); 842 hd = unionfs_get_hashhead(dvp, uvp); 843 LIST_INSERT_HEAD(hd, unp, un_hash); 844 } 845 VI_UNLOCK(unp->un_dvp); 846 } 847 } 848 849 /* 850 * Create a new shadow dir. 851 * 852 * udvp should be locked on entry and will be locked on return. 853 * 854 * If no error returned, unp will be updated. 855 */ 856 int 857 unionfs_mkshadowdir(struct unionfs_mount *ump, struct vnode *udvp, 858 struct unionfs_node *unp, struct componentname *cnp, struct thread *td) 859 { 860 struct vnode *lvp; 861 struct vnode *uvp; 862 struct vattr va; 863 struct vattr lva; 864 struct nameidata nd; 865 struct mount *mp; 866 struct ucred *cred; 867 struct ucred *credbk; 868 struct uidinfo *rootinfo; 869 int error; 870 871 if (unp->un_uppervp != NULLVP) 872 return (EEXIST); 873 874 lvp = unp->un_lowervp; 875 uvp = NULLVP; 876 credbk = cnp->cn_cred; 877 878 /* Authority change to root */ 879 rootinfo = uifind((uid_t)0); 880 cred = crdup(cnp->cn_cred); 881 /* 882 * The calls to chgproccnt() are needed to compensate for change_ruid() 883 * calling chgproccnt(). 884 */ 885 chgproccnt(cred->cr_ruidinfo, 1, 0); 886 change_euid(cred, rootinfo); 887 change_ruid(cred, rootinfo); 888 change_svuid(cred, (uid_t)0); 889 uifree(rootinfo); 890 cnp->cn_cred = cred; 891 892 memset(&nd.ni_cnd, 0, sizeof(struct componentname)); 893 NDPREINIT(&nd); 894 895 if ((error = VOP_GETATTR(lvp, &lva, cnp->cn_cred))) 896 goto unionfs_mkshadowdir_abort; 897 898 if ((error = unionfs_relookup(udvp, &uvp, cnp, &nd.ni_cnd, td, 899 cnp->cn_nameptr, cnp->cn_namelen, CREATE))) 900 goto unionfs_mkshadowdir_abort; 901 if (uvp != NULLVP) { 902 if (udvp == uvp) 903 vrele(uvp); 904 else 905 vput(uvp); 906 907 error = EEXIST; 908 goto unionfs_mkshadowdir_abort; 909 } 910 911 if ((error = vn_start_write(udvp, &mp, V_WAIT | PCATCH))) 912 goto unionfs_mkshadowdir_abort; 913 unionfs_create_uppervattr_core(ump, &lva, &va, td); 914 915 error = VOP_MKDIR(udvp, &uvp, &nd.ni_cnd, &va); 916 917 if (!error) { 918 unionfs_node_update(unp, uvp, td); 919 920 /* 921 * XXX The bug which cannot set uid/gid was corrected. 922 * Ignore errors. 923 */ 924 va.va_type = VNON; 925 VOP_SETATTR(uvp, &va, nd.ni_cnd.cn_cred); 926 } 927 vn_finished_write(mp); 928 929 unionfs_mkshadowdir_abort: 930 cnp->cn_cred = credbk; 931 chgproccnt(cred->cr_ruidinfo, -1, 0); 932 crfree(cred); 933 934 return (error); 935 } 936 937 /* 938 * Create a new whiteout. 939 * 940 * dvp should be locked on entry and will be locked on return. 941 */ 942 int 943 unionfs_mkwhiteout(struct vnode *dvp, struct componentname *cnp, 944 struct thread *td, char *path, int pathlen) 945 { 946 struct vnode *wvp; 947 struct nameidata nd; 948 struct mount *mp; 949 int error; 950 951 wvp = NULLVP; 952 NDPREINIT(&nd); 953 if ((error = unionfs_relookup(dvp, &wvp, cnp, &nd.ni_cnd, td, path, 954 pathlen, CREATE))) { 955 return (error); 956 } 957 if (wvp != NULLVP) { 958 if (dvp == wvp) 959 vrele(wvp); 960 else 961 vput(wvp); 962 963 return (EEXIST); 964 } 965 966 if ((error = vn_start_write(dvp, &mp, V_WAIT | PCATCH))) 967 goto unionfs_mkwhiteout_free_out; 968 error = VOP_WHITEOUT(dvp, &nd.ni_cnd, CREATE); 969 970 vn_finished_write(mp); 971 972 unionfs_mkwhiteout_free_out: 973 return (error); 974 } 975 976 /* 977 * Create a new vnode for create a new shadow file. 978 * 979 * If an error is returned, *vpp will be invalid, otherwise it will hold a 980 * locked, referenced and opened vnode. 981 * 982 * unp is never updated. 983 */ 984 static int 985 unionfs_vn_create_on_upper(struct vnode **vpp, struct vnode *udvp, 986 struct unionfs_node *unp, struct vattr *uvap, struct thread *td) 987 { 988 struct unionfs_mount *ump; 989 struct vnode *vp; 990 struct vnode *lvp; 991 struct ucred *cred; 992 struct vattr lva; 993 struct nameidata nd; 994 int fmode; 995 int error; 996 997 ump = MOUNTTOUNIONFSMOUNT(UNIONFSTOV(unp)->v_mount); 998 vp = NULLVP; 999 lvp = unp->un_lowervp; 1000 cred = td->td_ucred; 1001 fmode = FFLAGS(O_WRONLY | O_CREAT | O_TRUNC | O_EXCL); 1002 error = 0; 1003 1004 if ((error = VOP_GETATTR(lvp, &lva, cred)) != 0) 1005 return (error); 1006 unionfs_create_uppervattr_core(ump, &lva, uvap, td); 1007 1008 if (unp->un_path == NULL) 1009 panic("%s: NULL un_path", __func__); 1010 1011 nd.ni_cnd.cn_namelen = unp->un_pathlen; 1012 nd.ni_cnd.cn_pnbuf = unp->un_path; 1013 nd.ni_cnd.cn_nameiop = CREATE; 1014 nd.ni_cnd.cn_flags = LOCKPARENT | LOCKLEAF | HASBUF | SAVENAME | 1015 ISLASTCN; 1016 nd.ni_cnd.cn_lkflags = LK_EXCLUSIVE; 1017 nd.ni_cnd.cn_cred = cred; 1018 nd.ni_cnd.cn_nameptr = nd.ni_cnd.cn_pnbuf; 1019 NDPREINIT(&nd); 1020 1021 vref(udvp); 1022 if ((error = relookup(udvp, &vp, &nd.ni_cnd)) != 0) 1023 goto unionfs_vn_create_on_upper_free_out2; 1024 vrele(udvp); 1025 1026 if (vp != NULLVP) { 1027 if (vp == udvp) 1028 vrele(vp); 1029 else 1030 vput(vp); 1031 error = EEXIST; 1032 goto unionfs_vn_create_on_upper_free_out1; 1033 } 1034 1035 if ((error = VOP_CREATE(udvp, &vp, &nd.ni_cnd, uvap)) != 0) 1036 goto unionfs_vn_create_on_upper_free_out1; 1037 1038 if ((error = VOP_OPEN(vp, fmode, cred, td, NULL)) != 0) { 1039 vput(vp); 1040 goto unionfs_vn_create_on_upper_free_out1; 1041 } 1042 error = VOP_ADD_WRITECOUNT(vp, 1); 1043 CTR3(KTR_VFS, "%s: vp %p v_writecount increased to %d", 1044 __func__, vp, vp->v_writecount); 1045 if (error == 0) { 1046 *vpp = vp; 1047 } else { 1048 VOP_CLOSE(vp, fmode, cred, td); 1049 } 1050 1051 unionfs_vn_create_on_upper_free_out1: 1052 VOP_UNLOCK(udvp); 1053 1054 unionfs_vn_create_on_upper_free_out2: 1055 KASSERT((nd.ni_cnd.cn_flags & HASBUF) != 0, 1056 ("%s: HASBUF cleared", __func__)); 1057 KASSERT((nd.ni_cnd.cn_flags & SAVENAME) != 0, 1058 ("%s: SAVENAME cleared", __func__)); 1059 KASSERT(nd.ni_cnd.cn_pnbuf == unp->un_path, 1060 ("%s: cn_pnbuf changed", __func__)); 1061 1062 return (error); 1063 } 1064 1065 /* 1066 * Copy from lvp to uvp. 1067 * 1068 * lvp and uvp should be locked and opened on entry and will be locked and 1069 * opened on return. 1070 */ 1071 static int 1072 unionfs_copyfile_core(struct vnode *lvp, struct vnode *uvp, 1073 struct ucred *cred, struct thread *td) 1074 { 1075 char *buf; 1076 struct uio uio; 1077 struct iovec iov; 1078 off_t offset; 1079 int count; 1080 int error; 1081 int bufoffset; 1082 1083 error = 0; 1084 memset(&uio, 0, sizeof(uio)); 1085 1086 uio.uio_td = td; 1087 uio.uio_segflg = UIO_SYSSPACE; 1088 uio.uio_offset = 0; 1089 1090 buf = malloc(MAXBSIZE, M_TEMP, M_WAITOK); 1091 1092 while (error == 0) { 1093 offset = uio.uio_offset; 1094 1095 uio.uio_iov = &iov; 1096 uio.uio_iovcnt = 1; 1097 iov.iov_base = buf; 1098 iov.iov_len = MAXBSIZE; 1099 uio.uio_resid = iov.iov_len; 1100 uio.uio_rw = UIO_READ; 1101 1102 if ((error = VOP_READ(lvp, &uio, 0, cred)) != 0) 1103 break; 1104 if ((count = MAXBSIZE - uio.uio_resid) == 0) 1105 break; 1106 1107 bufoffset = 0; 1108 while (bufoffset < count) { 1109 uio.uio_iov = &iov; 1110 uio.uio_iovcnt = 1; 1111 iov.iov_base = buf + bufoffset; 1112 iov.iov_len = count - bufoffset; 1113 uio.uio_offset = offset + bufoffset; 1114 uio.uio_resid = iov.iov_len; 1115 uio.uio_rw = UIO_WRITE; 1116 1117 if ((error = VOP_WRITE(uvp, &uio, 0, cred)) != 0) 1118 break; 1119 1120 bufoffset += (count - bufoffset) - uio.uio_resid; 1121 } 1122 1123 uio.uio_offset = offset + bufoffset; 1124 } 1125 1126 free(buf, M_TEMP); 1127 1128 return (error); 1129 } 1130 1131 /* 1132 * Copy file from lower to upper. 1133 * 1134 * If you need copy of the contents, set 1 to docopy. Otherwise, set 0 to 1135 * docopy. 1136 * 1137 * If no error returned, unp will be updated. 1138 */ 1139 int 1140 unionfs_copyfile(struct unionfs_node *unp, int docopy, struct ucred *cred, 1141 struct thread *td) 1142 { 1143 struct mount *mp; 1144 struct vnode *udvp; 1145 struct vnode *lvp; 1146 struct vnode *uvp; 1147 struct vattr uva; 1148 int error; 1149 1150 lvp = unp->un_lowervp; 1151 uvp = NULLVP; 1152 1153 if ((UNIONFSTOV(unp)->v_mount->mnt_flag & MNT_RDONLY)) 1154 return (EROFS); 1155 if (unp->un_dvp == NULLVP) 1156 return (EINVAL); 1157 if (unp->un_uppervp != NULLVP) 1158 return (EEXIST); 1159 udvp = VTOUNIONFS(unp->un_dvp)->un_uppervp; 1160 if (udvp == NULLVP) 1161 return (EROFS); 1162 if ((udvp->v_mount->mnt_flag & MNT_RDONLY)) 1163 return (EROFS); 1164 1165 error = VOP_ACCESS(lvp, VREAD, cred, td); 1166 if (error != 0) 1167 return (error); 1168 1169 if ((error = vn_start_write(udvp, &mp, V_WAIT | PCATCH)) != 0) 1170 return (error); 1171 error = unionfs_vn_create_on_upper(&uvp, udvp, unp, &uva, td); 1172 if (error != 0) { 1173 vn_finished_write(mp); 1174 return (error); 1175 } 1176 1177 if (docopy != 0) { 1178 error = VOP_OPEN(lvp, FREAD, cred, td, NULL); 1179 if (error == 0) { 1180 error = unionfs_copyfile_core(lvp, uvp, cred, td); 1181 VOP_CLOSE(lvp, FREAD, cred, td); 1182 } 1183 } 1184 VOP_CLOSE(uvp, FWRITE, cred, td); 1185 VOP_ADD_WRITECOUNT_CHECKED(uvp, -1); 1186 CTR3(KTR_VFS, "%s: vp %p v_writecount decreased to %d", 1187 __func__, uvp, uvp->v_writecount); 1188 1189 vn_finished_write(mp); 1190 1191 if (error == 0) { 1192 /* Reset the attributes. Ignore errors. */ 1193 uva.va_type = VNON; 1194 VOP_SETATTR(uvp, &uva, cred); 1195 } 1196 1197 unionfs_node_update(unp, uvp, td); 1198 1199 return (error); 1200 } 1201 1202 /* 1203 * It checks whether vp can rmdir. (check empty) 1204 * 1205 * vp is unionfs vnode. 1206 * vp should be locked. 1207 */ 1208 int 1209 unionfs_check_rmdir(struct vnode *vp, struct ucred *cred, struct thread *td) 1210 { 1211 struct vnode *uvp; 1212 struct vnode *lvp; 1213 struct vnode *tvp; 1214 struct dirent *dp; 1215 struct dirent *edp; 1216 struct componentname cn; 1217 struct iovec iov; 1218 struct uio uio; 1219 struct vattr va; 1220 int error; 1221 int eofflag; 1222 int lookuperr; 1223 1224 /* 1225 * The size of buf needs to be larger than DIRBLKSIZ. 1226 */ 1227 char buf[256 * 6]; 1228 1229 ASSERT_VOP_ELOCKED(vp, __func__); 1230 1231 eofflag = 0; 1232 uvp = UNIONFSVPTOUPPERVP(vp); 1233 lvp = UNIONFSVPTOLOWERVP(vp); 1234 1235 /* check opaque */ 1236 if ((error = VOP_GETATTR(uvp, &va, cred)) != 0) 1237 return (error); 1238 if (va.va_flags & OPAQUE) 1239 return (0); 1240 1241 /* open vnode */ 1242 #ifdef MAC 1243 if ((error = mac_vnode_check_open(cred, vp, VEXEC|VREAD)) != 0) 1244 return (error); 1245 #endif 1246 if ((error = VOP_ACCESS(vp, VEXEC|VREAD, cred, td)) != 0) 1247 return (error); 1248 if ((error = VOP_OPEN(vp, FREAD, cred, td, NULL)) != 0) 1249 return (error); 1250 1251 uio.uio_rw = UIO_READ; 1252 uio.uio_segflg = UIO_SYSSPACE; 1253 uio.uio_td = td; 1254 uio.uio_offset = 0; 1255 1256 #ifdef MAC 1257 error = mac_vnode_check_readdir(td->td_ucred, lvp); 1258 #endif 1259 while (!error && !eofflag) { 1260 iov.iov_base = buf; 1261 iov.iov_len = sizeof(buf); 1262 uio.uio_iov = &iov; 1263 uio.uio_iovcnt = 1; 1264 uio.uio_resid = iov.iov_len; 1265 1266 error = VOP_READDIR(lvp, &uio, cred, &eofflag, NULL, NULL); 1267 if (error != 0) 1268 break; 1269 KASSERT(eofflag != 0 || uio.uio_resid < sizeof(buf), 1270 ("%s: empty read from lower FS", __func__)); 1271 1272 edp = (struct dirent*)&buf[sizeof(buf) - uio.uio_resid]; 1273 for (dp = (struct dirent*)buf; !error && dp < edp; 1274 dp = (struct dirent*)((caddr_t)dp + dp->d_reclen)) { 1275 if (dp->d_type == DT_WHT || dp->d_fileno == 0 || 1276 (dp->d_namlen == 1 && dp->d_name[0] == '.') || 1277 (dp->d_namlen == 2 && !bcmp(dp->d_name, "..", 2))) 1278 continue; 1279 1280 cn.cn_namelen = dp->d_namlen; 1281 cn.cn_pnbuf = NULL; 1282 cn.cn_nameptr = dp->d_name; 1283 cn.cn_nameiop = LOOKUP; 1284 cn.cn_flags = LOCKPARENT | LOCKLEAF | SAVENAME | 1285 RDONLY | ISLASTCN; 1286 cn.cn_lkflags = LK_EXCLUSIVE; 1287 cn.cn_cred = cred; 1288 1289 /* 1290 * check entry in lower. 1291 * Sometimes, readdir function returns 1292 * wrong entry. 1293 */ 1294 lookuperr = VOP_LOOKUP(lvp, &tvp, &cn); 1295 1296 if (!lookuperr) 1297 vput(tvp); 1298 else 1299 continue; /* skip entry */ 1300 1301 /* 1302 * check entry 1303 * If it has no exist/whiteout entry in upper, 1304 * directory is not empty. 1305 */ 1306 cn.cn_flags = LOCKPARENT | LOCKLEAF | SAVENAME | 1307 RDONLY | ISLASTCN; 1308 lookuperr = VOP_LOOKUP(uvp, &tvp, &cn); 1309 1310 if (!lookuperr) 1311 vput(tvp); 1312 1313 /* ignore exist or whiteout entry */ 1314 if (!lookuperr || 1315 (lookuperr == ENOENT && (cn.cn_flags & ISWHITEOUT))) 1316 continue; 1317 1318 error = ENOTEMPTY; 1319 } 1320 } 1321 1322 /* close vnode */ 1323 VOP_CLOSE(vp, FREAD, cred, td); 1324 1325 return (error); 1326 } 1327 1328