1 /* 2 * Copyright (c) 1982, 1986, 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_lookup.c 8.4 (Berkeley) 2/16/94 39 * $FreeBSD$ 40 */ 41 42 #include "opt_ktrace.h" 43 44 #include <sys/param.h> 45 #include <sys/systm.h> 46 #include <sys/kernel.h> 47 #include <sys/lock.h> 48 #include <sys/mutex.h> 49 #include <sys/namei.h> 50 #include <sys/vnode.h> 51 #include <sys/mount.h> 52 #include <sys/filedesc.h> 53 #include <sys/proc.h> 54 #ifdef KTRACE 55 #include <sys/ktrace.h> 56 #endif 57 58 #include <vm/uma.h> 59 60 /* 61 * Allocation zone for namei 62 */ 63 uma_zone_t namei_zone; 64 65 static void 66 nameiinit(void *dummy __unused) 67 { 68 namei_zone = uma_zcreate("NAMEI", MAXPATHLEN, NULL, NULL, NULL, NULL, 69 UMA_ALIGN_PTR, 0); 70 71 } 72 SYSINIT(vfs, SI_SUB_VFS, SI_ORDER_SECOND, nameiinit, NULL) 73 74 /* 75 * Convert a pathname into a pointer to a locked inode. 76 * 77 * The FOLLOW flag is set when symbolic links are to be followed 78 * when they occur at the end of the name translation process. 79 * Symbolic links are always followed for all other pathname 80 * components other than the last. 81 * 82 * The segflg defines whether the name is to be copied from user 83 * space or kernel space. 84 * 85 * Overall outline of namei: 86 * 87 * copy in name 88 * get starting directory 89 * while (!done && !error) { 90 * call lookup to search path. 91 * if symbolic link, massage name in buffer and continue 92 * } 93 */ 94 int 95 namei(ndp) 96 register struct nameidata *ndp; 97 { 98 register struct filedesc *fdp; /* pointer to file descriptor state */ 99 register char *cp; /* pointer into pathname argument */ 100 register struct vnode *dp; /* the directory we are searching */ 101 struct iovec aiov; /* uio for reading symbolic links */ 102 struct uio auio; 103 int error, linklen; 104 struct componentname *cnp = &ndp->ni_cnd; 105 struct thread *td = cnp->cn_thread; 106 struct proc *p = td->td_proc; 107 108 ndp->ni_cnd.cn_cred = ndp->ni_cnd.cn_thread->td_ucred; 109 KASSERT(cnp->cn_cred && p, ("namei: bad cred/proc")); 110 KASSERT((cnp->cn_nameiop & (~OPMASK)) == 0, 111 ("namei: nameiop contaminated with flags")); 112 KASSERT((cnp->cn_flags & OPMASK) == 0, 113 ("namei: flags contaminated with nameiops")); 114 fdp = p->p_fd; 115 116 /* 117 * Get a buffer for the name to be translated, and copy the 118 * name into the buffer. 119 */ 120 if ((cnp->cn_flags & HASBUF) == 0) 121 cnp->cn_pnbuf = uma_zalloc(namei_zone, M_WAITOK); 122 if (ndp->ni_segflg == UIO_SYSSPACE) 123 error = copystr(ndp->ni_dirp, cnp->cn_pnbuf, 124 MAXPATHLEN, (size_t *)&ndp->ni_pathlen); 125 else 126 error = copyinstr(ndp->ni_dirp, cnp->cn_pnbuf, 127 MAXPATHLEN, (size_t *)&ndp->ni_pathlen); 128 129 /* 130 * Don't allow empty pathnames. 131 */ 132 if (!error && *cnp->cn_pnbuf == '\0') 133 error = ENOENT; 134 135 if (error) { 136 uma_zfree(namei_zone, cnp->cn_pnbuf); 137 ndp->ni_vp = NULL; 138 return (error); 139 } 140 ndp->ni_loopcnt = 0; 141 #ifdef KTRACE 142 if (KTRPOINT(p, KTR_NAMEI)) 143 ktrnamei(p->p_tracep, cnp->cn_pnbuf); 144 #endif 145 146 /* 147 * Get starting point for the translation. 148 */ 149 FILEDESC_LOCK(fdp); 150 ndp->ni_rootdir = fdp->fd_rdir; 151 ndp->ni_topdir = fdp->fd_jdir; 152 153 dp = fdp->fd_cdir; 154 VREF(dp); 155 FILEDESC_UNLOCK(fdp); 156 for (;;) { 157 /* 158 * Check if root directory should replace current directory. 159 * Done at start of translation and after symbolic link. 160 */ 161 cnp->cn_nameptr = cnp->cn_pnbuf; 162 if (*(cnp->cn_nameptr) == '/') { 163 vrele(dp); 164 while (*(cnp->cn_nameptr) == '/') { 165 cnp->cn_nameptr++; 166 ndp->ni_pathlen--; 167 } 168 dp = ndp->ni_rootdir; 169 VREF(dp); 170 } 171 ndp->ni_startdir = dp; 172 error = lookup(ndp); 173 if (error) { 174 uma_zfree(namei_zone, cnp->cn_pnbuf); 175 return (error); 176 } 177 /* 178 * Check for symbolic link 179 */ 180 if ((cnp->cn_flags & ISSYMLINK) == 0) { 181 if ((cnp->cn_flags & (SAVENAME | SAVESTART)) == 0) 182 uma_zfree(namei_zone, cnp->cn_pnbuf); 183 else 184 cnp->cn_flags |= HASBUF; 185 186 if (vn_canvmio(ndp->ni_vp) == TRUE && 187 (cnp->cn_nameiop != DELETE) && 188 ((cnp->cn_flags & (NOOBJ|LOCKLEAF)) == 189 LOCKLEAF)) 190 vfs_object_create(ndp->ni_vp, td, 191 ndp->ni_cnd.cn_cred); 192 193 return (0); 194 } 195 if ((cnp->cn_flags & LOCKPARENT) && ndp->ni_pathlen == 1) 196 VOP_UNLOCK(ndp->ni_dvp, 0, td); 197 if (ndp->ni_loopcnt++ >= MAXSYMLINKS) { 198 error = ELOOP; 199 break; 200 } 201 if (ndp->ni_pathlen > 1) 202 cp = uma_zalloc(namei_zone, M_WAITOK); 203 else 204 cp = cnp->cn_pnbuf; 205 aiov.iov_base = cp; 206 aiov.iov_len = MAXPATHLEN; 207 auio.uio_iov = &aiov; 208 auio.uio_iovcnt = 1; 209 auio.uio_offset = 0; 210 auio.uio_rw = UIO_READ; 211 auio.uio_segflg = UIO_SYSSPACE; 212 auio.uio_td = (struct thread *)0; 213 auio.uio_resid = MAXPATHLEN; 214 error = VOP_READLINK(ndp->ni_vp, &auio, cnp->cn_cred); 215 if (error) { 216 if (ndp->ni_pathlen > 1) 217 uma_zfree(namei_zone, cp); 218 break; 219 } 220 linklen = MAXPATHLEN - auio.uio_resid; 221 if (linklen == 0) { 222 if (ndp->ni_pathlen > 1) 223 uma_zfree(namei_zone, cp); 224 error = ENOENT; 225 break; 226 } 227 if (linklen + ndp->ni_pathlen >= MAXPATHLEN) { 228 if (ndp->ni_pathlen > 1) 229 uma_zfree(namei_zone, cp); 230 error = ENAMETOOLONG; 231 break; 232 } 233 if (ndp->ni_pathlen > 1) { 234 bcopy(ndp->ni_next, cp + linklen, ndp->ni_pathlen); 235 uma_zfree(namei_zone, cnp->cn_pnbuf); 236 cnp->cn_pnbuf = cp; 237 } else 238 cnp->cn_pnbuf[linklen] = '\0'; 239 ndp->ni_pathlen += linklen; 240 vput(ndp->ni_vp); 241 dp = ndp->ni_dvp; 242 } 243 uma_zfree(namei_zone, cnp->cn_pnbuf); 244 vrele(ndp->ni_dvp); 245 vput(ndp->ni_vp); 246 ndp->ni_vp = NULL; 247 return (error); 248 } 249 250 /* 251 * Search a pathname. 252 * This is a very central and rather complicated routine. 253 * 254 * The pathname is pointed to by ni_ptr and is of length ni_pathlen. 255 * The starting directory is taken from ni_startdir. The pathname is 256 * descended until done, or a symbolic link is encountered. The variable 257 * ni_more is clear if the path is completed; it is set to one if a 258 * symbolic link needing interpretation is encountered. 259 * 260 * The flag argument is LOOKUP, CREATE, RENAME, or DELETE depending on 261 * whether the name is to be looked up, created, renamed, or deleted. 262 * When CREATE, RENAME, or DELETE is specified, information usable in 263 * creating, renaming, or deleting a directory entry may be calculated. 264 * If flag has LOCKPARENT or'ed into it, the parent directory is returned 265 * locked. If flag has WANTPARENT or'ed into it, the parent directory is 266 * returned unlocked. Otherwise the parent directory is not returned. If 267 * the target of the pathname exists and LOCKLEAF is or'ed into the flag 268 * the target is returned locked, otherwise it is returned unlocked. 269 * When creating or renaming and LOCKPARENT is specified, the target may not 270 * be ".". When deleting and LOCKPARENT is specified, the target may be ".". 271 * 272 * Overall outline of lookup: 273 * 274 * dirloop: 275 * identify next component of name at ndp->ni_ptr 276 * handle degenerate case where name is null string 277 * if .. and crossing mount points and on mounted filesys, find parent 278 * call VOP_LOOKUP routine for next component name 279 * directory vnode returned in ni_dvp, unlocked unless LOCKPARENT set 280 * component vnode returned in ni_vp (if it exists), locked. 281 * if result vnode is mounted on and crossing mount points, 282 * find mounted on vnode 283 * if more components of name, do next level at dirloop 284 * return the answer in ni_vp, locked if LOCKLEAF set 285 * if LOCKPARENT set, return locked parent in ni_dvp 286 * if WANTPARENT set, return unlocked parent in ni_dvp 287 */ 288 int 289 lookup(ndp) 290 register struct nameidata *ndp; 291 { 292 register char *cp; /* pointer into pathname argument */ 293 register struct vnode *dp = 0; /* the directory we are searching */ 294 struct vnode *tdp; /* saved dp */ 295 struct mount *mp; /* mount table entry */ 296 int docache; /* == 0 do not cache last component */ 297 int wantparent; /* 1 => wantparent or lockparent flag */ 298 int rdonly; /* lookup read-only flag bit */ 299 int trailing_slash; 300 int error = 0; 301 int dpunlocked = 0; /* dp has already been unlocked */ 302 struct componentname *cnp = &ndp->ni_cnd; 303 struct thread *td = cnp->cn_thread; 304 305 /* 306 * Setup: break out flag bits into variables. 307 */ 308 wantparent = cnp->cn_flags & (LOCKPARENT | WANTPARENT); 309 docache = (cnp->cn_flags & NOCACHE) ^ NOCACHE; 310 if (cnp->cn_nameiop == DELETE || 311 (wantparent && cnp->cn_nameiop != CREATE && 312 cnp->cn_nameiop != LOOKUP)) 313 docache = 0; 314 rdonly = cnp->cn_flags & RDONLY; 315 ndp->ni_dvp = NULL; 316 cnp->cn_flags &= ~ISSYMLINK; 317 dp = ndp->ni_startdir; 318 ndp->ni_startdir = NULLVP; 319 vn_lock(dp, LK_EXCLUSIVE | LK_RETRY, td); 320 321 dirloop: 322 /* 323 * Search a new directory. 324 * 325 * The last component of the filename is left accessible via 326 * cnp->cn_nameptr for callers that need the name. Callers needing 327 * the name set the SAVENAME flag. When done, they assume 328 * responsibility for freeing the pathname buffer. 329 */ 330 cnp->cn_consume = 0; 331 for (cp = cnp->cn_nameptr; *cp != 0 && *cp != '/'; cp++) 332 continue; 333 cnp->cn_namelen = cp - cnp->cn_nameptr; 334 if (cnp->cn_namelen > NAME_MAX) { 335 error = ENAMETOOLONG; 336 goto bad; 337 } 338 #ifdef NAMEI_DIAGNOSTIC 339 { char c = *cp; 340 *cp = '\0'; 341 printf("{%s}: ", cnp->cn_nameptr); 342 *cp = c; } 343 #endif 344 ndp->ni_pathlen -= cnp->cn_namelen; 345 ndp->ni_next = cp; 346 347 /* 348 * Replace multiple slashes by a single slash and trailing slashes 349 * by a null. This must be done before VOP_LOOKUP() because some 350 * fs's don't know about trailing slashes. Remember if there were 351 * trailing slashes to handle symlinks, existing non-directories 352 * and non-existing files that won't be directories specially later. 353 */ 354 trailing_slash = 0; 355 while (*cp == '/' && (cp[1] == '/' || cp[1] == '\0')) { 356 cp++; 357 ndp->ni_pathlen--; 358 if (*cp == '\0') { 359 trailing_slash = 1; 360 *ndp->ni_next = '\0'; /* XXX for direnter() ... */ 361 } 362 } 363 ndp->ni_next = cp; 364 365 cnp->cn_flags |= MAKEENTRY; 366 if (*cp == '\0' && docache == 0) 367 cnp->cn_flags &= ~MAKEENTRY; 368 if (cnp->cn_namelen == 2 && 369 cnp->cn_nameptr[1] == '.' && cnp->cn_nameptr[0] == '.') 370 cnp->cn_flags |= ISDOTDOT; 371 else 372 cnp->cn_flags &= ~ISDOTDOT; 373 if (*ndp->ni_next == 0) 374 cnp->cn_flags |= ISLASTCN; 375 else 376 cnp->cn_flags &= ~ISLASTCN; 377 378 379 /* 380 * Check for degenerate name (e.g. / or "") 381 * which is a way of talking about a directory, 382 * e.g. like "/." or ".". 383 */ 384 if (cnp->cn_nameptr[0] == '\0') { 385 if (dp->v_type != VDIR) { 386 error = ENOTDIR; 387 goto bad; 388 } 389 if (cnp->cn_nameiop != LOOKUP) { 390 error = EISDIR; 391 goto bad; 392 } 393 if (wantparent) { 394 ndp->ni_dvp = dp; 395 VREF(dp); 396 } 397 ndp->ni_vp = dp; 398 if (!(cnp->cn_flags & (LOCKPARENT | LOCKLEAF))) 399 VOP_UNLOCK(dp, 0, td); 400 /* XXX This should probably move to the top of function. */ 401 if (cnp->cn_flags & SAVESTART) 402 panic("lookup: SAVESTART"); 403 return (0); 404 } 405 406 /* 407 * Handle "..": two special cases. 408 * 1. If at root directory (e.g. after chroot) 409 * or at absolute root directory 410 * then ignore it so can't get out. 411 * 2. If this vnode is the root of a mounted 412 * filesystem, then replace it with the 413 * vnode which was mounted on so we take the 414 * .. in the other filesystem. 415 * 3. If the vnode is the top directory of 416 * the jail or chroot, don't let them out. 417 */ 418 if (cnp->cn_flags & ISDOTDOT) { 419 for (;;) { 420 if (dp == ndp->ni_rootdir || 421 dp == ndp->ni_topdir || 422 dp == rootvnode) { 423 ndp->ni_dvp = dp; 424 ndp->ni_vp = dp; 425 VREF(dp); 426 goto nextname; 427 } 428 if ((dp->v_flag & VROOT) == 0 || 429 (cnp->cn_flags & NOCROSSMOUNT)) 430 break; 431 if (dp->v_mount == NULL) { /* forced unmount */ 432 error = EBADF; 433 goto bad; 434 } 435 tdp = dp; 436 dp = dp->v_mount->mnt_vnodecovered; 437 vput(tdp); 438 VREF(dp); 439 vn_lock(dp, LK_EXCLUSIVE | LK_RETRY, td); 440 } 441 } 442 443 /* 444 * We now have a segment name to search for, and a directory to search. 445 */ 446 unionlookup: 447 ndp->ni_dvp = dp; 448 ndp->ni_vp = NULL; 449 cnp->cn_flags &= ~PDIRUNLOCK; 450 ASSERT_VOP_LOCKED(dp, "lookup"); 451 if ((error = VOP_LOOKUP(dp, &ndp->ni_vp, cnp)) != 0) { 452 KASSERT(ndp->ni_vp == NULL, ("leaf should be empty")); 453 #ifdef NAMEI_DIAGNOSTIC 454 printf("not found\n"); 455 #endif 456 if ((error == ENOENT) && 457 (dp->v_flag & VROOT) && (dp->v_mount != NULL) && 458 (dp->v_mount->mnt_flag & MNT_UNION)) { 459 tdp = dp; 460 dp = dp->v_mount->mnt_vnodecovered; 461 if (cnp->cn_flags & PDIRUNLOCK) 462 vrele(tdp); 463 else 464 vput(tdp); 465 VREF(dp); 466 vn_lock(dp, LK_EXCLUSIVE | LK_RETRY, td); 467 goto unionlookup; 468 } 469 470 if (error != EJUSTRETURN) 471 goto bad; 472 /* 473 * If creating and at end of pathname, then can consider 474 * allowing file to be created. 475 */ 476 if (rdonly) { 477 error = EROFS; 478 goto bad; 479 } 480 if (*cp == '\0' && trailing_slash && 481 !(cnp->cn_flags & WILLBEDIR)) { 482 error = ENOENT; 483 goto bad; 484 } 485 /* 486 * We return with ni_vp NULL to indicate that the entry 487 * doesn't currently exist, leaving a pointer to the 488 * (possibly locked) directory inode in ndp->ni_dvp. 489 */ 490 if (cnp->cn_flags & SAVESTART) { 491 ndp->ni_startdir = ndp->ni_dvp; 492 VREF(ndp->ni_startdir); 493 } 494 return (0); 495 } 496 #ifdef NAMEI_DIAGNOSTIC 497 printf("found\n"); 498 #endif 499 500 ASSERT_VOP_LOCKED(ndp->ni_vp, "lookup"); 501 502 /* 503 * Take into account any additional components consumed by 504 * the underlying filesystem. 505 */ 506 if (cnp->cn_consume > 0) { 507 cnp->cn_nameptr += cnp->cn_consume; 508 ndp->ni_next += cnp->cn_consume; 509 ndp->ni_pathlen -= cnp->cn_consume; 510 cnp->cn_consume = 0; 511 } 512 513 dp = ndp->ni_vp; 514 515 /* 516 * Check to see if the vnode has been mounted on; 517 * if so find the root of the mounted filesystem. 518 */ 519 while (dp->v_type == VDIR && (mp = dp->v_mountedhere) && 520 (cnp->cn_flags & NOCROSSMOUNT) == 0) { 521 if (vfs_busy(mp, 0, 0, td)) 522 continue; 523 VOP_UNLOCK(dp, 0, td); 524 error = VFS_ROOT(mp, &tdp); 525 vfs_unbusy(mp, td); 526 if (error) { 527 dpunlocked = 1; 528 goto bad2; 529 } 530 vrele(dp); 531 ndp->ni_vp = dp = tdp; 532 } 533 534 /* 535 * Check for symbolic link 536 */ 537 if ((dp->v_type == VLNK) && 538 ((cnp->cn_flags & FOLLOW) || trailing_slash || 539 *ndp->ni_next == '/')) { 540 cnp->cn_flags |= ISSYMLINK; 541 if (dp->v_mount == NULL) { 542 /* We can't know whether the directory was mounted with 543 * NOSYMFOLLOW, so we can't follow safely. */ 544 error = EBADF; 545 goto bad2; 546 } 547 if (dp->v_mount->mnt_flag & MNT_NOSYMFOLLOW) { 548 error = EACCES; 549 goto bad2; 550 } 551 return (0); 552 } 553 554 /* 555 * Check for bogus trailing slashes. 556 */ 557 if (trailing_slash && dp->v_type != VDIR) { 558 error = ENOTDIR; 559 goto bad2; 560 } 561 562 nextname: 563 /* 564 * Not a symbolic link. If more pathname, 565 * continue at next component, else return. 566 */ 567 if (*ndp->ni_next == '/') { 568 cnp->cn_nameptr = ndp->ni_next; 569 while (*cnp->cn_nameptr == '/') { 570 cnp->cn_nameptr++; 571 ndp->ni_pathlen--; 572 } 573 if (ndp->ni_dvp != ndp->ni_vp) 574 ASSERT_VOP_UNLOCKED(ndp->ni_dvp, "lookup"); 575 vrele(ndp->ni_dvp); 576 goto dirloop; 577 } 578 /* 579 * Disallow directory write attempts on read-only filesystems. 580 */ 581 if (rdonly && 582 (cnp->cn_nameiop == DELETE || cnp->cn_nameiop == RENAME)) { 583 error = EROFS; 584 goto bad2; 585 } 586 if (cnp->cn_flags & SAVESTART) { 587 ndp->ni_startdir = ndp->ni_dvp; 588 VREF(ndp->ni_startdir); 589 } 590 if (!wantparent) 591 vrele(ndp->ni_dvp); 592 593 if ((cnp->cn_flags & LOCKLEAF) == 0) 594 VOP_UNLOCK(dp, 0, td); 595 return (0); 596 597 bad2: 598 if ((cnp->cn_flags & (LOCKPARENT | PDIRUNLOCK)) == LOCKPARENT && 599 *ndp->ni_next == '\0') 600 VOP_UNLOCK(ndp->ni_dvp, 0, td); 601 vrele(ndp->ni_dvp); 602 bad: 603 if (dpunlocked) 604 vrele(dp); 605 else 606 vput(dp); 607 ndp->ni_vp = NULL; 608 return (error); 609 } 610 611 /* 612 * relookup - lookup a path name component 613 * Used by lookup to re-aquire things. 614 */ 615 int 616 relookup(dvp, vpp, cnp) 617 struct vnode *dvp, **vpp; 618 struct componentname *cnp; 619 { 620 struct thread *td = cnp->cn_thread; 621 struct vnode *dp = 0; /* the directory we are searching */ 622 int docache; /* == 0 do not cache last component */ 623 int wantparent; /* 1 => wantparent or lockparent flag */ 624 int rdonly; /* lookup read-only flag bit */ 625 int error = 0; 626 #ifdef NAMEI_DIAGNOSTIC 627 int newhash; /* DEBUG: check name hash */ 628 char *cp; /* DEBUG: check name ptr/len */ 629 #endif 630 631 /* 632 * Setup: break out flag bits into variables. 633 */ 634 wantparent = cnp->cn_flags & (LOCKPARENT|WANTPARENT); 635 docache = (cnp->cn_flags & NOCACHE) ^ NOCACHE; 636 if (cnp->cn_nameiop == DELETE || 637 (wantparent && cnp->cn_nameiop != CREATE)) 638 docache = 0; 639 rdonly = cnp->cn_flags & RDONLY; 640 cnp->cn_flags &= ~ISSYMLINK; 641 dp = dvp; 642 vn_lock(dp, LK_EXCLUSIVE | LK_RETRY, td); 643 644 /* dirloop: */ 645 /* 646 * Search a new directory. 647 * 648 * The last component of the filename is left accessible via 649 * cnp->cn_nameptr for callers that need the name. Callers needing 650 * the name set the SAVENAME flag. When done, they assume 651 * responsibility for freeing the pathname buffer. 652 */ 653 #ifdef NAMEI_DIAGNOSTIC 654 if (cnp->cn_namelen != cp - cnp->cn_nameptr) 655 panic ("relookup: bad len"); 656 if (*cp != 0) 657 panic("relookup: not last component"); 658 printf("{%s}: ", cnp->cn_nameptr); 659 #endif 660 661 /* 662 * Check for degenerate name (e.g. / or "") 663 * which is a way of talking about a directory, 664 * e.g. like "/." or ".". 665 */ 666 if (cnp->cn_nameptr[0] == '\0') { 667 if (cnp->cn_nameiop != LOOKUP || wantparent) { 668 error = EISDIR; 669 goto bad; 670 } 671 if (dp->v_type != VDIR) { 672 error = ENOTDIR; 673 goto bad; 674 } 675 if (!(cnp->cn_flags & LOCKLEAF)) 676 VOP_UNLOCK(dp, 0, td); 677 *vpp = dp; 678 /* XXX This should probably move to the top of function. */ 679 if (cnp->cn_flags & SAVESTART) 680 panic("lookup: SAVESTART"); 681 return (0); 682 } 683 684 if (cnp->cn_flags & ISDOTDOT) 685 panic ("relookup: lookup on dot-dot"); 686 687 /* 688 * We now have a segment name to search for, and a directory to search. 689 */ 690 if ((error = VOP_LOOKUP(dp, vpp, cnp)) != 0) { 691 KASSERT(*vpp == NULL, ("leaf should be empty")); 692 if (error != EJUSTRETURN) 693 goto bad; 694 /* 695 * If creating and at end of pathname, then can consider 696 * allowing file to be created. 697 */ 698 if (rdonly) { 699 error = EROFS; 700 goto bad; 701 } 702 /* ASSERT(dvp == ndp->ni_startdir) */ 703 if (cnp->cn_flags & SAVESTART) 704 VREF(dvp); 705 /* 706 * We return with ni_vp NULL to indicate that the entry 707 * doesn't currently exist, leaving a pointer to the 708 * (possibly locked) directory inode in ndp->ni_dvp. 709 */ 710 return (0); 711 } 712 dp = *vpp; 713 714 /* 715 * Check for symbolic link 716 */ 717 KASSERT(dp->v_type != VLNK || !(cnp->cn_flags & FOLLOW), 718 ("relookup: symlink found.\n")); 719 720 /* 721 * Disallow directory write attempts on read-only filesystems. 722 */ 723 if (rdonly && 724 (cnp->cn_nameiop == DELETE || cnp->cn_nameiop == RENAME)) { 725 error = EROFS; 726 goto bad2; 727 } 728 /* ASSERT(dvp == ndp->ni_startdir) */ 729 if (cnp->cn_flags & SAVESTART) 730 VREF(dvp); 731 732 if (!wantparent) 733 vrele(dvp); 734 735 if (vn_canvmio(dp) == TRUE && 736 ((cnp->cn_flags & (NOOBJ|LOCKLEAF)) == LOCKLEAF)) 737 vfs_object_create(dp, td, cnp->cn_cred); 738 739 if ((cnp->cn_flags & LOCKLEAF) == 0) 740 VOP_UNLOCK(dp, 0, td); 741 return (0); 742 743 bad2: 744 if ((cnp->cn_flags & LOCKPARENT) && (cnp->cn_flags & ISLASTCN)) 745 VOP_UNLOCK(dvp, 0, td); 746 vrele(dvp); 747 bad: 748 vput(dp); 749 *vpp = NULL; 750 return (error); 751 } 752