union_subr.c revision 1.27.10.2
1 1.27.10.2 pooka /* $NetBSD: union_subr.c,v 1.27.10.2 2007/07/23 08:52:48 pooka Exp $ */ 2 1.27.10.2 pooka 3 1.27.10.2 pooka /* 4 1.27.10.2 pooka * Copyright (c) 1994 5 1.27.10.2 pooka * The Regents of the University of California. All rights reserved. 6 1.27.10.2 pooka * 7 1.27.10.2 pooka * This code is derived from software contributed to Berkeley by 8 1.27.10.2 pooka * Jan-Simon Pendry. 9 1.27.10.2 pooka * 10 1.27.10.2 pooka * Redistribution and use in source and binary forms, with or without 11 1.27.10.2 pooka * modification, are permitted provided that the following conditions 12 1.27.10.2 pooka * are met: 13 1.27.10.2 pooka * 1. Redistributions of source code must retain the above copyright 14 1.27.10.2 pooka * notice, this list of conditions and the following disclaimer. 15 1.27.10.2 pooka * 2. Redistributions in binary form must reproduce the above copyright 16 1.27.10.2 pooka * notice, this list of conditions and the following disclaimer in the 17 1.27.10.2 pooka * documentation and/or other materials provided with the distribution. 18 1.27.10.2 pooka * 3. Neither the name of the University nor the names of its contributors 19 1.27.10.2 pooka * may be used to endorse or promote products derived from this software 20 1.27.10.2 pooka * without specific prior written permission. 21 1.27.10.2 pooka * 22 1.27.10.2 pooka * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 1.27.10.2 pooka * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 1.27.10.2 pooka * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 1.27.10.2 pooka * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 1.27.10.2 pooka * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 1.27.10.2 pooka * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 1.27.10.2 pooka * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 1.27.10.2 pooka * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 1.27.10.2 pooka * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 1.27.10.2 pooka * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 1.27.10.2 pooka * SUCH DAMAGE. 33 1.27.10.2 pooka * 34 1.27.10.2 pooka * @(#)union_subr.c 8.20 (Berkeley) 5/20/95 35 1.27.10.2 pooka */ 36 1.27.10.2 pooka 37 1.27.10.2 pooka /* 38 1.27.10.2 pooka * Copyright (c) 1994 Jan-Simon Pendry 39 1.27.10.2 pooka * 40 1.27.10.2 pooka * This code is derived from software contributed to Berkeley by 41 1.27.10.2 pooka * Jan-Simon Pendry. 42 1.27.10.2 pooka * 43 1.27.10.2 pooka * Redistribution and use in source and binary forms, with or without 44 1.27.10.2 pooka * modification, are permitted provided that the following conditions 45 1.27.10.2 pooka * are met: 46 1.27.10.2 pooka * 1. Redistributions of source code must retain the above copyright 47 1.27.10.2 pooka * notice, this list of conditions and the following disclaimer. 48 1.27.10.2 pooka * 2. Redistributions in binary form must reproduce the above copyright 49 1.27.10.2 pooka * notice, this list of conditions and the following disclaimer in the 50 1.27.10.2 pooka * documentation and/or other materials provided with the distribution. 51 1.27.10.2 pooka * 3. All advertising materials mentioning features or use of this software 52 1.27.10.2 pooka * must display the following acknowledgement: 53 1.27.10.2 pooka * This product includes software developed by the University of 54 1.27.10.2 pooka * California, Berkeley and its contributors. 55 1.27.10.2 pooka * 4. Neither the name of the University nor the names of its contributors 56 1.27.10.2 pooka * may be used to endorse or promote products derived from this software 57 1.27.10.2 pooka * without specific prior written permission. 58 1.27.10.2 pooka * 59 1.27.10.2 pooka * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 60 1.27.10.2 pooka * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 61 1.27.10.2 pooka * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 62 1.27.10.2 pooka * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 63 1.27.10.2 pooka * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 64 1.27.10.2 pooka * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 65 1.27.10.2 pooka * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 66 1.27.10.2 pooka * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 67 1.27.10.2 pooka * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 68 1.27.10.2 pooka * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 69 1.27.10.2 pooka * SUCH DAMAGE. 70 1.27.10.2 pooka * 71 1.27.10.2 pooka * @(#)union_subr.c 8.20 (Berkeley) 5/20/95 72 1.27.10.2 pooka */ 73 1.27.10.2 pooka 74 1.27.10.2 pooka #include <sys/cdefs.h> 75 1.27.10.2 pooka __KERNEL_RCSID(0, "$NetBSD: union_subr.c,v 1.27.10.2 2007/07/23 08:52:48 pooka Exp $"); 76 1.27.10.2 pooka 77 1.27.10.2 pooka #include <sys/param.h> 78 1.27.10.2 pooka #include <sys/systm.h> 79 1.27.10.2 pooka #include <sys/proc.h> 80 1.27.10.2 pooka #include <sys/time.h> 81 1.27.10.2 pooka #include <sys/kernel.h> 82 1.27.10.2 pooka #include <sys/vnode.h> 83 1.27.10.2 pooka #include <sys/namei.h> 84 1.27.10.2 pooka #include <sys/malloc.h> 85 1.27.10.2 pooka #include <sys/file.h> 86 1.27.10.2 pooka #include <sys/filedesc.h> 87 1.27.10.2 pooka #include <sys/queue.h> 88 1.27.10.2 pooka #include <sys/mount.h> 89 1.27.10.2 pooka #include <sys/stat.h> 90 1.27.10.2 pooka #include <sys/kauth.h> 91 1.27.10.2 pooka 92 1.27.10.2 pooka #include <uvm/uvm_extern.h> 93 1.27.10.2 pooka 94 1.27.10.2 pooka #include <fs/union/union.h> 95 1.27.10.2 pooka 96 1.27.10.2 pooka /* must be power of two, otherwise change UNION_HASH() */ 97 1.27.10.2 pooka #define NHASH 32 98 1.27.10.2 pooka 99 1.27.10.2 pooka /* unsigned int ... */ 100 1.27.10.2 pooka #define UNION_HASH(u, l) \ 101 1.27.10.2 pooka (((((unsigned long) (u)) + ((unsigned long) l)) >> 8) & (NHASH-1)) 102 1.27.10.2 pooka 103 1.27.10.2 pooka static LIST_HEAD(unhead, union_node) unhead[NHASH]; 104 1.27.10.2 pooka static int unvplock[NHASH]; 105 1.27.10.2 pooka 106 1.27.10.2 pooka static int union_list_lock(int); 107 1.27.10.2 pooka static void union_list_unlock(int); 108 1.27.10.2 pooka void union_updatevp(struct union_node *, struct vnode *, struct vnode *); 109 1.27.10.2 pooka static int union_relookup(struct union_mount *, struct vnode *, 110 1.27.10.2 pooka struct vnode **, struct componentname *, 111 1.27.10.2 pooka struct componentname *, const char *, int); 112 1.27.10.2 pooka int union_vn_close(struct vnode *, int, kauth_cred_t, struct lwp *); 113 1.27.10.2 pooka static void union_dircache_r(struct vnode *, struct vnode ***, int *); 114 1.27.10.2 pooka struct vnode *union_dircache(struct vnode *, struct lwp *); 115 1.27.10.2 pooka 116 1.27.10.2 pooka void 117 1.27.10.2 pooka union_init() 118 1.27.10.2 pooka { 119 1.27.10.2 pooka int i; 120 1.27.10.2 pooka 121 1.27.10.2 pooka for (i = 0; i < NHASH; i++) 122 1.27.10.2 pooka LIST_INIT(&unhead[i]); 123 1.27.10.2 pooka memset(unvplock, 0, sizeof(unvplock)); 124 1.27.10.2 pooka } 125 1.27.10.2 pooka 126 1.27.10.2 pooka /* 127 1.27.10.2 pooka * Free global unionfs resources. 128 1.27.10.2 pooka */ 129 1.27.10.2 pooka void 130 1.27.10.2 pooka union_done() 131 1.27.10.2 pooka { 132 1.27.10.2 pooka 133 1.27.10.2 pooka /* Make sure to unset the readdir hook. */ 134 1.27.10.2 pooka vn_union_readdir_hook = NULL; 135 1.27.10.2 pooka } 136 1.27.10.2 pooka 137 1.27.10.2 pooka static int 138 1.27.10.2 pooka union_list_lock(ix) 139 1.27.10.2 pooka int ix; 140 1.27.10.2 pooka { 141 1.27.10.2 pooka 142 1.27.10.2 pooka if (unvplock[ix] & UN_LOCKED) { 143 1.27.10.2 pooka unvplock[ix] |= UN_WANTED; 144 1.27.10.2 pooka (void) tsleep(&unvplock[ix], PINOD, "unionlk", 0); 145 1.27.10.2 pooka return (1); 146 1.27.10.2 pooka } 147 1.27.10.2 pooka 148 1.27.10.2 pooka unvplock[ix] |= UN_LOCKED; 149 1.27.10.2 pooka 150 1.27.10.2 pooka return (0); 151 1.27.10.2 pooka } 152 1.27.10.2 pooka 153 1.27.10.2 pooka static void 154 1.27.10.2 pooka union_list_unlock(ix) 155 1.27.10.2 pooka int ix; 156 1.27.10.2 pooka { 157 1.27.10.2 pooka 158 1.27.10.2 pooka unvplock[ix] &= ~UN_LOCKED; 159 1.27.10.2 pooka 160 1.27.10.2 pooka if (unvplock[ix] & UN_WANTED) { 161 1.27.10.2 pooka unvplock[ix] &= ~UN_WANTED; 162 1.27.10.2 pooka wakeup(&unvplock[ix]); 163 1.27.10.2 pooka } 164 1.27.10.2 pooka } 165 1.27.10.2 pooka 166 1.27.10.2 pooka void 167 1.27.10.2 pooka union_updatevp(un, uppervp, lowervp) 168 1.27.10.2 pooka struct union_node *un; 169 1.27.10.2 pooka struct vnode *uppervp; 170 1.27.10.2 pooka struct vnode *lowervp; 171 1.27.10.2 pooka { 172 1.27.10.2 pooka int ohash = UNION_HASH(un->un_uppervp, un->un_lowervp); 173 1.27.10.2 pooka int nhash = UNION_HASH(uppervp, lowervp); 174 1.27.10.2 pooka int docache = (lowervp != NULLVP || uppervp != NULLVP); 175 1.27.10.2 pooka int lhash, uhash; 176 1.27.10.2 pooka 177 1.27.10.2 pooka /* 178 1.27.10.2 pooka * Ensure locking is ordered from lower to higher 179 1.27.10.2 pooka * to avoid deadlocks. 180 1.27.10.2 pooka */ 181 1.27.10.2 pooka if (nhash < ohash) { 182 1.27.10.2 pooka lhash = nhash; 183 1.27.10.2 pooka uhash = ohash; 184 1.27.10.2 pooka } else { 185 1.27.10.2 pooka lhash = ohash; 186 1.27.10.2 pooka uhash = nhash; 187 1.27.10.2 pooka } 188 1.27.10.2 pooka 189 1.27.10.2 pooka if (lhash != uhash) 190 1.27.10.2 pooka while (union_list_lock(lhash)) 191 1.27.10.2 pooka continue; 192 1.27.10.2 pooka 193 1.27.10.2 pooka while (union_list_lock(uhash)) 194 1.27.10.2 pooka continue; 195 1.27.10.2 pooka 196 1.27.10.2 pooka if (ohash != nhash || !docache) { 197 1.27.10.2 pooka if (un->un_flags & UN_CACHED) { 198 1.27.10.2 pooka un->un_flags &= ~UN_CACHED; 199 1.27.10.2 pooka LIST_REMOVE(un, un_cache); 200 1.27.10.2 pooka } 201 1.27.10.2 pooka } 202 1.27.10.2 pooka 203 1.27.10.2 pooka if (ohash != nhash) 204 1.27.10.2 pooka union_list_unlock(ohash); 205 1.27.10.2 pooka 206 1.27.10.2 pooka if (un->un_lowervp != lowervp) { 207 1.27.10.2 pooka if (un->un_lowervp) { 208 1.27.10.2 pooka vrele(un->un_lowervp); 209 1.27.10.2 pooka if (un->un_path) { 210 1.27.10.2 pooka free(un->un_path, M_TEMP); 211 1.27.10.2 pooka un->un_path = 0; 212 1.27.10.2 pooka } 213 1.27.10.2 pooka if (un->un_dirvp) { 214 1.27.10.2 pooka vrele(un->un_dirvp); 215 1.27.10.2 pooka un->un_dirvp = NULLVP; 216 1.27.10.2 pooka } 217 1.27.10.2 pooka } 218 1.27.10.2 pooka un->un_lowervp = lowervp; 219 1.27.10.2 pooka un->un_lowersz = VNOVAL; 220 1.27.10.2 pooka } 221 1.27.10.2 pooka 222 1.27.10.2 pooka if (un->un_uppervp != uppervp) { 223 1.27.10.2 pooka if (un->un_uppervp) 224 1.27.10.2 pooka vrele(un->un_uppervp); 225 1.27.10.2 pooka 226 1.27.10.2 pooka un->un_uppervp = uppervp; 227 1.27.10.2 pooka un->un_uppersz = VNOVAL; 228 1.27.10.2 pooka } 229 1.27.10.2 pooka 230 1.27.10.2 pooka if (docache && (ohash != nhash)) { 231 1.27.10.2 pooka LIST_INSERT_HEAD(&unhead[nhash], un, un_cache); 232 1.27.10.2 pooka un->un_flags |= UN_CACHED; 233 1.27.10.2 pooka } 234 1.27.10.2 pooka 235 1.27.10.2 pooka union_list_unlock(nhash); 236 1.27.10.2 pooka } 237 1.27.10.2 pooka 238 1.27.10.2 pooka void 239 1.27.10.2 pooka union_newlower(un, lowervp) 240 1.27.10.2 pooka struct union_node *un; 241 1.27.10.2 pooka struct vnode *lowervp; 242 1.27.10.2 pooka { 243 1.27.10.2 pooka 244 1.27.10.2 pooka union_updatevp(un, un->un_uppervp, lowervp); 245 1.27.10.2 pooka } 246 1.27.10.2 pooka 247 1.27.10.2 pooka void 248 1.27.10.2 pooka union_newupper(un, uppervp) 249 1.27.10.2 pooka struct union_node *un; 250 1.27.10.2 pooka struct vnode *uppervp; 251 1.27.10.2 pooka { 252 1.27.10.2 pooka 253 1.27.10.2 pooka union_updatevp(un, uppervp, un->un_lowervp); 254 1.27.10.2 pooka } 255 1.27.10.2 pooka 256 1.27.10.2 pooka /* 257 1.27.10.2 pooka * Keep track of size changes in the underlying vnodes. 258 1.27.10.2 pooka * If the size changes, then callback to the vm layer 259 1.27.10.2 pooka * giving priority to the upper layer size. 260 1.27.10.2 pooka */ 261 1.27.10.2 pooka void 262 1.27.10.2 pooka union_newsize(vp, uppersz, lowersz) 263 1.27.10.2 pooka struct vnode *vp; 264 1.27.10.2 pooka off_t uppersz, lowersz; 265 1.27.10.2 pooka { 266 1.27.10.2 pooka struct union_node *un; 267 1.27.10.2 pooka off_t sz; 268 1.27.10.2 pooka 269 1.27.10.2 pooka /* only interested in regular files */ 270 1.27.10.2 pooka if (vp->v_type != VREG) { 271 1.27.10.2 pooka uvm_vnp_setsize(vp, 0); 272 1.27.10.2 pooka return; 273 1.27.10.2 pooka } 274 1.27.10.2 pooka 275 1.27.10.2 pooka un = VTOUNION(vp); 276 1.27.10.2 pooka sz = VNOVAL; 277 1.27.10.2 pooka 278 1.27.10.2 pooka if ((uppersz != VNOVAL) && (un->un_uppersz != uppersz)) { 279 1.27.10.2 pooka un->un_uppersz = uppersz; 280 1.27.10.2 pooka if (sz == VNOVAL) 281 1.27.10.2 pooka sz = un->un_uppersz; 282 1.27.10.2 pooka } 283 1.27.10.2 pooka 284 1.27.10.2 pooka if ((lowersz != VNOVAL) && (un->un_lowersz != lowersz)) { 285 1.27.10.2 pooka un->un_lowersz = lowersz; 286 1.27.10.2 pooka if (sz == VNOVAL) 287 1.27.10.2 pooka sz = un->un_lowersz; 288 1.27.10.2 pooka } 289 1.27.10.2 pooka 290 1.27.10.2 pooka if (sz != VNOVAL) { 291 1.27.10.2 pooka #ifdef UNION_DIAGNOSTIC 292 1.27.10.2 pooka printf("union: %s size now %qd\n", 293 1.27.10.2 pooka uppersz != VNOVAL ? "upper" : "lower", sz); 294 1.27.10.2 pooka #endif 295 1.27.10.2 pooka uvm_vnp_setsize(vp, sz); 296 1.27.10.2 pooka } 297 1.27.10.2 pooka } 298 1.27.10.2 pooka 299 1.27.10.2 pooka /* 300 1.27.10.2 pooka * allocate a union_node/vnode pair. the vnode is 301 1.27.10.2 pooka * referenced and locked. the new vnode is returned 302 1.27.10.2 pooka * via (vpp). (mp) is the mountpoint of the union filesystem, 303 1.27.10.2 pooka * (dvp) is the parent directory where the upper layer object 304 1.27.10.2 pooka * should exist (but doesn't) and (cnp) is the componentname 305 1.27.10.2 pooka * information which is partially copied to allow the upper 306 1.27.10.2 pooka * layer object to be created at a later time. (uppervp) 307 1.27.10.2 pooka * and (lowervp) reference the upper and lower layer objects 308 1.27.10.2 pooka * being mapped. either, but not both, can be nil. 309 1.27.10.2 pooka * if supplied, (uppervp) is locked. 310 1.27.10.2 pooka * the reference is either maintained in the new union_node 311 1.27.10.2 pooka * object which is allocated, or they are vrele'd. 312 1.27.10.2 pooka * 313 1.27.10.2 pooka * all union_nodes are maintained on a singly-linked 314 1.27.10.2 pooka * list. new nodes are only allocated when they cannot 315 1.27.10.2 pooka * be found on this list. entries on the list are 316 1.27.10.2 pooka * removed when the vfs reclaim entry is called. 317 1.27.10.2 pooka * 318 1.27.10.2 pooka * a single lock is kept for the entire list. this is 319 1.27.10.2 pooka * needed because the getnewvnode() function can block 320 1.27.10.2 pooka * waiting for a vnode to become free, in which case there 321 1.27.10.2 pooka * may be more than one process trying to get the same 322 1.27.10.2 pooka * vnode. this lock is only taken if we are going to 323 1.27.10.2 pooka * call getnewvnode, since the kernel itself is single-threaded. 324 1.27.10.2 pooka * 325 1.27.10.2 pooka * if an entry is found on the list, then call vget() to 326 1.27.10.2 pooka * take a reference. this is done because there may be 327 1.27.10.2 pooka * zero references to it and so it needs to removed from 328 1.27.10.2 pooka * the vnode free list. 329 1.27.10.2 pooka */ 330 1.27.10.2 pooka int 331 1.27.10.2 pooka union_allocvp(vpp, mp, undvp, dvp, cnp, uppervp, lowervp, docache) 332 1.27.10.2 pooka struct vnode **vpp; 333 1.27.10.2 pooka struct mount *mp; 334 1.27.10.2 pooka struct vnode *undvp; /* parent union vnode */ 335 1.27.10.2 pooka struct vnode *dvp; /* may be null */ 336 1.27.10.2 pooka struct componentname *cnp; /* may be null */ 337 1.27.10.2 pooka struct vnode *uppervp; /* may be null */ 338 1.27.10.2 pooka struct vnode *lowervp; /* may be null */ 339 1.27.10.2 pooka int docache; 340 1.27.10.2 pooka { 341 1.27.10.2 pooka int error; 342 1.27.10.2 pooka struct vattr va; 343 1.27.10.2 pooka struct union_node *un = NULL; 344 1.27.10.2 pooka struct vnode *xlowervp = NULLVP; 345 1.27.10.2 pooka struct union_mount *um = MOUNTTOUNIONMOUNT(mp); 346 1.27.10.2 pooka voff_t uppersz, lowersz; 347 1.27.10.2 pooka int hash = 0; 348 1.27.10.2 pooka int vflag; 349 1.27.10.2 pooka int try; 350 1.27.10.2 pooka 351 1.27.10.2 pooka if (uppervp == NULLVP && lowervp == NULLVP) 352 1.27.10.2 pooka panic("union: unidentifiable allocation"); 353 1.27.10.2 pooka 354 1.27.10.2 pooka if (uppervp && lowervp && (uppervp->v_type != lowervp->v_type)) { 355 1.27.10.2 pooka xlowervp = lowervp; 356 1.27.10.2 pooka lowervp = NULLVP; 357 1.27.10.2 pooka } 358 1.27.10.2 pooka 359 1.27.10.2 pooka /* detect the root vnode (and aliases) */ 360 1.27.10.2 pooka vflag = VLAYER; 361 1.27.10.2 pooka if ((uppervp == um->um_uppervp) && 362 1.27.10.2 pooka ((lowervp == NULLVP) || lowervp == um->um_lowervp)) { 363 1.27.10.2 pooka if (lowervp == NULLVP) { 364 1.27.10.2 pooka lowervp = um->um_lowervp; 365 1.27.10.2 pooka if (lowervp != NULLVP) 366 1.27.10.2 pooka VREF(lowervp); 367 1.27.10.2 pooka } 368 1.27.10.2 pooka vflag = VROOT; 369 1.27.10.2 pooka } 370 1.27.10.2 pooka 371 1.27.10.2 pooka loop: 372 1.27.10.2 pooka if (!docache) { 373 1.27.10.2 pooka un = 0; 374 1.27.10.2 pooka } else for (try = 0; try < 3; try++) { 375 1.27.10.2 pooka switch (try) { 376 1.27.10.2 pooka case 0: 377 1.27.10.2 pooka if (lowervp == NULLVP) 378 1.27.10.2 pooka continue; 379 1.27.10.2 pooka hash = UNION_HASH(uppervp, lowervp); 380 1.27.10.2 pooka break; 381 1.27.10.2 pooka 382 1.27.10.2 pooka case 1: 383 1.27.10.2 pooka if (uppervp == NULLVP) 384 1.27.10.2 pooka continue; 385 1.27.10.2 pooka hash = UNION_HASH(uppervp, NULLVP); 386 1.27.10.2 pooka break; 387 1.27.10.2 pooka 388 1.27.10.2 pooka case 2: 389 1.27.10.2 pooka if (lowervp == NULLVP) 390 1.27.10.2 pooka continue; 391 1.27.10.2 pooka hash = UNION_HASH(NULLVP, lowervp); 392 1.27.10.2 pooka break; 393 1.27.10.2 pooka } 394 1.27.10.2 pooka 395 1.27.10.2 pooka while (union_list_lock(hash)) 396 1.27.10.2 pooka continue; 397 1.27.10.2 pooka 398 1.27.10.2 pooka for (un = unhead[hash].lh_first; un != 0; 399 1.27.10.2 pooka un = un->un_cache.le_next) { 400 1.27.10.2 pooka if ((un->un_lowervp == lowervp || 401 1.27.10.2 pooka un->un_lowervp == NULLVP) && 402 1.27.10.2 pooka (un->un_uppervp == uppervp || 403 1.27.10.2 pooka un->un_uppervp == NULLVP) && 404 1.27.10.2 pooka (UNIONTOV(un)->v_mount == mp)) { 405 1.27.10.2 pooka if (vget(UNIONTOV(un), 0)) { 406 1.27.10.2 pooka union_list_unlock(hash); 407 1.27.10.2 pooka goto loop; 408 1.27.10.2 pooka } 409 1.27.10.2 pooka break; 410 1.27.10.2 pooka } 411 1.27.10.2 pooka } 412 1.27.10.2 pooka 413 1.27.10.2 pooka union_list_unlock(hash); 414 1.27.10.2 pooka 415 1.27.10.2 pooka if (un) 416 1.27.10.2 pooka break; 417 1.27.10.2 pooka } 418 1.27.10.2 pooka 419 1.27.10.2 pooka if (un) { 420 1.27.10.2 pooka /* 421 1.27.10.2 pooka * Obtain a lock on the union_node. 422 1.27.10.2 pooka * uppervp is locked, though un->un_uppervp 423 1.27.10.2 pooka * may not be. this doesn't break the locking 424 1.27.10.2 pooka * hierarchy since in the case that un->un_uppervp 425 1.27.10.2 pooka * is not yet locked it will be vrele'd and replaced 426 1.27.10.2 pooka * with uppervp. 427 1.27.10.2 pooka */ 428 1.27.10.2 pooka 429 1.27.10.2 pooka if ((dvp != NULLVP) && (uppervp == dvp)) { 430 1.27.10.2 pooka /* 431 1.27.10.2 pooka * Access ``.'', so (un) will already 432 1.27.10.2 pooka * be locked. Since this process has 433 1.27.10.2 pooka * the lock on (uppervp) no other 434 1.27.10.2 pooka * process can hold the lock on (un). 435 1.27.10.2 pooka */ 436 1.27.10.2 pooka #ifdef DIAGNOSTIC 437 1.27.10.2 pooka if ((un->un_flags & UN_LOCKED) == 0) 438 1.27.10.2 pooka panic("union: . not locked"); 439 1.27.10.2 pooka else if (curproc && un->un_pid != curproc->p_pid && 440 1.27.10.2 pooka un->un_pid > -1 && curproc->p_pid > -1) 441 1.27.10.2 pooka panic("union: allocvp not lock owner"); 442 1.27.10.2 pooka #endif 443 1.27.10.2 pooka } else { 444 1.27.10.2 pooka if (un->un_flags & UN_LOCKED) { 445 1.27.10.2 pooka vrele(UNIONTOV(un)); 446 1.27.10.2 pooka un->un_flags |= UN_WANTED; 447 1.27.10.2 pooka (void) tsleep(&un->un_flags, PINOD, 448 1.27.10.2 pooka "unionalloc", 0); 449 1.27.10.2 pooka goto loop; 450 1.27.10.2 pooka } 451 1.27.10.2 pooka un->un_flags |= UN_LOCKED; 452 1.27.10.2 pooka 453 1.27.10.2 pooka #ifdef DIAGNOSTIC 454 1.27.10.2 pooka if (curproc) 455 1.27.10.2 pooka un->un_pid = curproc->p_pid; 456 1.27.10.2 pooka else 457 1.27.10.2 pooka un->un_pid = -1; 458 1.27.10.2 pooka #endif 459 1.27.10.2 pooka } 460 1.27.10.2 pooka 461 1.27.10.2 pooka /* 462 1.27.10.2 pooka * At this point, the union_node is locked, 463 1.27.10.2 pooka * un->un_uppervp may not be locked, and uppervp 464 1.27.10.2 pooka * is locked or nil. 465 1.27.10.2 pooka */ 466 1.27.10.2 pooka 467 1.27.10.2 pooka /* 468 1.27.10.2 pooka * Save information about the upper layer. 469 1.27.10.2 pooka */ 470 1.27.10.2 pooka if (uppervp != un->un_uppervp) { 471 1.27.10.2 pooka union_newupper(un, uppervp); 472 1.27.10.2 pooka } else if (uppervp) { 473 1.27.10.2 pooka vrele(uppervp); 474 1.27.10.2 pooka } 475 1.27.10.2 pooka 476 1.27.10.2 pooka if (un->un_uppervp) { 477 1.27.10.2 pooka un->un_flags |= UN_ULOCK; 478 1.27.10.2 pooka un->un_flags &= ~UN_KLOCK; 479 1.27.10.2 pooka } 480 1.27.10.2 pooka 481 1.27.10.2 pooka /* 482 1.27.10.2 pooka * Save information about the lower layer. 483 1.27.10.2 pooka * This needs to keep track of pathname 484 1.27.10.2 pooka * and directory information which union_vn_create 485 1.27.10.2 pooka * might need. 486 1.27.10.2 pooka */ 487 1.27.10.2 pooka if (lowervp != un->un_lowervp) { 488 1.27.10.2 pooka union_newlower(un, lowervp); 489 1.27.10.2 pooka if (cnp && (lowervp != NULLVP)) { 490 1.27.10.2 pooka un->un_hash = cnp->cn_hash; 491 1.27.10.2 pooka un->un_path = malloc(cnp->cn_namelen+1, 492 1.27.10.2 pooka M_TEMP, M_WAITOK); 493 1.27.10.2 pooka memcpy(un->un_path, cnp->cn_nameptr, 494 1.27.10.2 pooka cnp->cn_namelen); 495 1.27.10.2 pooka un->un_path[cnp->cn_namelen] = '\0'; 496 1.27.10.2 pooka VREF(dvp); 497 1.27.10.2 pooka un->un_dirvp = dvp; 498 1.27.10.2 pooka } 499 1.27.10.2 pooka } else if (lowervp) { 500 1.27.10.2 pooka vrele(lowervp); 501 1.27.10.2 pooka } 502 1.27.10.2 pooka *vpp = UNIONTOV(un); 503 1.27.10.2 pooka return (0); 504 1.27.10.2 pooka } 505 1.27.10.2 pooka 506 1.27.10.2 pooka uppersz = lowersz = VNOVAL; 507 1.27.10.2 pooka if (uppervp != NULLVP) 508 1.27.10.2 pooka if (VOP_GETATTR(uppervp, &va, FSCRED, NULL) == 0) 509 1.27.10.2 pooka uppersz = va.va_size; 510 1.27.10.2 pooka if (lowervp != NULLVP) 511 1.27.10.2 pooka if (VOP_GETATTR(lowervp, &va, FSCRED, NULL) == 0) 512 1.27.10.2 pooka lowersz = va.va_size; 513 1.27.10.2 pooka 514 1.27.10.2 pooka if (docache) { 515 1.27.10.2 pooka /* 516 1.27.10.2 pooka * otherwise lock the vp list while we call getnewvnode 517 1.27.10.2 pooka * since that can block. 518 1.27.10.2 pooka */ 519 1.27.10.2 pooka hash = UNION_HASH(uppervp, lowervp); 520 1.27.10.2 pooka 521 1.27.10.2 pooka if (union_list_lock(hash)) 522 1.27.10.2 pooka goto loop; 523 1.27.10.2 pooka } 524 1.27.10.2 pooka 525 1.27.10.2 pooka error = getnewvnode(VT_UNION, mp, union_vnodeop_p, vpp); 526 1.27.10.2 pooka if (error) { 527 1.27.10.2 pooka if (uppervp) { 528 1.27.10.2 pooka if (dvp == uppervp) 529 1.27.10.2 pooka vrele(uppervp); 530 1.27.10.2 pooka else 531 1.27.10.2 pooka vput(uppervp); 532 1.27.10.2 pooka } 533 1.27.10.2 pooka if (lowervp) 534 1.27.10.2 pooka vrele(lowervp); 535 1.27.10.2 pooka 536 1.27.10.2 pooka goto out; 537 1.27.10.2 pooka } 538 1.27.10.2 pooka 539 1.27.10.2 pooka MALLOC((*vpp)->v_data, void *, sizeof(struct union_node), 540 1.27.10.2 pooka M_TEMP, M_WAITOK); 541 1.27.10.2 pooka 542 1.27.10.2 pooka (*vpp)->v_flag |= vflag; 543 1.27.10.2 pooka (*vpp)->v_vnlock = NULL; /* Make upper layers call VOP_LOCK */ 544 1.27.10.2 pooka if (uppervp) 545 1.27.10.2 pooka (*vpp)->v_type = uppervp->v_type; 546 1.27.10.2 pooka else 547 1.27.10.2 pooka (*vpp)->v_type = lowervp->v_type; 548 1.27.10.2 pooka un = VTOUNION(*vpp); 549 1.27.10.2 pooka un->un_vnode = *vpp; 550 1.27.10.2 pooka un->un_uppervp = uppervp; 551 1.27.10.2 pooka un->un_lowervp = lowervp; 552 1.27.10.2 pooka un->un_pvp = undvp; 553 1.27.10.2 pooka if (undvp != NULLVP) 554 1.27.10.2 pooka VREF(undvp); 555 1.27.10.2 pooka un->un_dircache = 0; 556 1.27.10.2 pooka un->un_openl = 0; 557 1.27.10.2 pooka un->un_flags = UN_LOCKED; 558 1.27.10.2 pooka 559 1.27.10.2 pooka un->un_uppersz = VNOVAL; 560 1.27.10.2 pooka un->un_lowersz = VNOVAL; 561 1.27.10.2 pooka union_newsize(*vpp, uppersz, lowersz); 562 1.27.10.2 pooka 563 1.27.10.2 pooka if (un->un_uppervp) 564 1.27.10.2 pooka un->un_flags |= UN_ULOCK; 565 1.27.10.2 pooka #ifdef DIAGNOSTIC 566 1.27.10.2 pooka if (curproc) 567 1.27.10.2 pooka un->un_pid = curproc->p_pid; 568 1.27.10.2 pooka else 569 1.27.10.2 pooka un->un_pid = -1; 570 1.27.10.2 pooka #endif 571 1.27.10.2 pooka if (dvp && cnp && (lowervp != NULLVP)) { 572 1.27.10.2 pooka un->un_hash = cnp->cn_hash; 573 1.27.10.2 pooka un->un_path = malloc(cnp->cn_namelen+1, M_TEMP, M_WAITOK); 574 1.27.10.2 pooka memcpy(un->un_path, cnp->cn_nameptr, cnp->cn_namelen); 575 1.27.10.2 pooka un->un_path[cnp->cn_namelen] = '\0'; 576 1.27.10.2 pooka VREF(dvp); 577 1.27.10.2 pooka un->un_dirvp = dvp; 578 1.27.10.2 pooka } else { 579 1.27.10.2 pooka un->un_hash = 0; 580 1.27.10.2 pooka un->un_path = 0; 581 1.27.10.2 pooka un->un_dirvp = 0; 582 1.27.10.2 pooka } 583 1.27.10.2 pooka 584 1.27.10.2 pooka if (docache) { 585 1.27.10.2 pooka LIST_INSERT_HEAD(&unhead[hash], un, un_cache); 586 1.27.10.2 pooka un->un_flags |= UN_CACHED; 587 1.27.10.2 pooka } 588 1.27.10.2 pooka 589 1.27.10.2 pooka if (xlowervp) 590 1.27.10.2 pooka vrele(xlowervp); 591 1.27.10.2 pooka 592 1.27.10.2 pooka out: 593 1.27.10.2 pooka if (docache) 594 1.27.10.2 pooka union_list_unlock(hash); 595 1.27.10.2 pooka 596 1.27.10.2 pooka return (error); 597 1.27.10.2 pooka } 598 1.27.10.2 pooka 599 1.27.10.2 pooka int 600 1.27.10.2 pooka union_freevp(vp) 601 1.27.10.2 pooka struct vnode *vp; 602 1.27.10.2 pooka { 603 1.27.10.2 pooka struct union_node *un = VTOUNION(vp); 604 1.27.10.2 pooka 605 1.27.10.2 pooka if (un->un_flags & UN_CACHED) { 606 1.27.10.2 pooka un->un_flags &= ~UN_CACHED; 607 1.27.10.2 pooka LIST_REMOVE(un, un_cache); 608 1.27.10.2 pooka } 609 1.27.10.2 pooka 610 1.27.10.2 pooka if (un->un_pvp != NULLVP) 611 1.27.10.2 pooka vrele(un->un_pvp); 612 1.27.10.2 pooka if (un->un_uppervp != NULLVP) 613 1.27.10.2 pooka vrele(un->un_uppervp); 614 1.27.10.2 pooka if (un->un_lowervp != NULLVP) 615 1.27.10.2 pooka vrele(un->un_lowervp); 616 1.27.10.2 pooka if (un->un_dirvp != NULLVP) 617 1.27.10.2 pooka vrele(un->un_dirvp); 618 1.27.10.2 pooka if (un->un_path) 619 1.27.10.2 pooka free(un->un_path, M_TEMP); 620 1.27.10.2 pooka 621 1.27.10.2 pooka FREE(vp->v_data, M_TEMP); 622 1.27.10.2 pooka vp->v_data = 0; 623 1.27.10.2 pooka 624 1.27.10.2 pooka return (0); 625 1.27.10.2 pooka } 626 1.27.10.2 pooka 627 1.27.10.2 pooka /* 628 1.27.10.2 pooka * copyfile. copy the vnode (fvp) to the vnode (tvp) 629 1.27.10.2 pooka * using a sequence of reads and writes. both (fvp) 630 1.27.10.2 pooka * and (tvp) are locked on entry and exit. 631 1.27.10.2 pooka */ 632 1.27.10.2 pooka int 633 1.27.10.2 pooka union_copyfile(fvp, tvp, cred, l) 634 1.27.10.2 pooka struct vnode *fvp; 635 1.27.10.2 pooka struct vnode *tvp; 636 1.27.10.2 pooka kauth_cred_t cred; 637 1.27.10.2 pooka struct lwp *l; 638 1.27.10.2 pooka { 639 1.27.10.2 pooka char *tbuf; 640 1.27.10.2 pooka struct uio uio; 641 1.27.10.2 pooka struct iovec iov; 642 1.27.10.2 pooka int error = 0; 643 1.27.10.2 pooka 644 1.27.10.2 pooka /* 645 1.27.10.2 pooka * strategy: 646 1.27.10.2 pooka * allocate a buffer of size MAXBSIZE. 647 1.27.10.2 pooka * loop doing reads and writes, keeping track 648 1.27.10.2 pooka * of the current uio offset. 649 1.27.10.2 pooka * give up at the first sign of trouble. 650 1.27.10.2 pooka */ 651 1.27.10.2 pooka 652 1.27.10.2 pooka uio.uio_offset = 0; 653 1.27.10.2 pooka UIO_SETUP_SYSSPACE(&uio); 654 1.27.10.2 pooka 655 1.27.10.2 pooka VOP_UNLOCK(fvp, 0); /* XXX */ 656 1.27.10.2 pooka VOP_LEASE(fvp, l, cred, LEASE_READ); 657 1.27.10.2 pooka vn_lock(fvp, LK_EXCLUSIVE | LK_RETRY); /* XXX */ 658 1.27.10.2 pooka VOP_UNLOCK(tvp, 0); /* XXX */ 659 1.27.10.2 pooka VOP_LEASE(tvp, l, cred, LEASE_WRITE); 660 1.27.10.2 pooka vn_lock(tvp, LK_EXCLUSIVE | LK_RETRY); /* XXX */ 661 1.27.10.2 pooka 662 1.27.10.2 pooka tbuf = malloc(MAXBSIZE, M_TEMP, M_WAITOK); 663 1.27.10.2 pooka 664 1.27.10.2 pooka /* ugly loop follows... */ 665 1.27.10.2 pooka do { 666 1.27.10.2 pooka off_t offset = uio.uio_offset; 667 1.27.10.2 pooka 668 1.27.10.2 pooka uio.uio_iov = &iov; 669 1.27.10.2 pooka uio.uio_iovcnt = 1; 670 1.27.10.2 pooka iov.iov_base = tbuf; 671 1.27.10.2 pooka iov.iov_len = MAXBSIZE; 672 1.27.10.2 pooka uio.uio_resid = iov.iov_len; 673 1.27.10.2 pooka uio.uio_rw = UIO_READ; 674 1.27.10.2 pooka error = VOP_READ(fvp, &uio, 0, cred); 675 1.27.10.2 pooka 676 1.27.10.2 pooka if (error == 0) { 677 1.27.10.2 pooka uio.uio_iov = &iov; 678 1.27.10.2 pooka uio.uio_iovcnt = 1; 679 1.27.10.2 pooka iov.iov_base = tbuf; 680 1.27.10.2 pooka iov.iov_len = MAXBSIZE - uio.uio_resid; 681 1.27.10.2 pooka uio.uio_offset = offset; 682 1.27.10.2 pooka uio.uio_rw = UIO_WRITE; 683 1.27.10.2 pooka uio.uio_resid = iov.iov_len; 684 1.27.10.2 pooka 685 1.27.10.2 pooka if (uio.uio_resid == 0) 686 1.27.10.2 pooka break; 687 1.27.10.2 pooka 688 1.27.10.2 pooka do { 689 1.27.10.2 pooka error = VOP_WRITE(tvp, &uio, 0, cred); 690 1.27.10.2 pooka } while ((uio.uio_resid > 0) && (error == 0)); 691 1.27.10.2 pooka } 692 1.27.10.2 pooka 693 1.27.10.2 pooka } while (error == 0); 694 1.27.10.2 pooka 695 1.27.10.2 pooka free(tbuf, M_TEMP); 696 1.27.10.2 pooka return (error); 697 1.27.10.2 pooka } 698 1.27.10.2 pooka 699 1.27.10.2 pooka /* 700 1.27.10.2 pooka * (un) is assumed to be locked on entry and remains 701 1.27.10.2 pooka * locked on exit. 702 1.27.10.2 pooka */ 703 1.27.10.2 pooka int 704 1.27.10.2 pooka union_copyup(un, docopy, cred, l) 705 1.27.10.2 pooka struct union_node *un; 706 1.27.10.2 pooka int docopy; 707 1.27.10.2 pooka kauth_cred_t cred; 708 1.27.10.2 pooka struct lwp *l; 709 1.27.10.2 pooka { 710 1.27.10.2 pooka int error; 711 1.27.10.2 pooka struct vnode *lvp, *uvp; 712 1.27.10.2 pooka struct vattr lvattr, uvattr; 713 1.27.10.2 pooka 714 1.27.10.2 pooka error = union_vn_create(&uvp, un, l); 715 1.27.10.2 pooka if (error) 716 1.27.10.2 pooka return (error); 717 1.27.10.2 pooka 718 1.27.10.2 pooka /* at this point, uppervp is locked */ 719 1.27.10.2 pooka union_newupper(un, uvp); 720 1.27.10.2 pooka un->un_flags |= UN_ULOCK; 721 1.27.10.2 pooka 722 1.27.10.2 pooka lvp = un->un_lowervp; 723 1.27.10.2 pooka 724 1.27.10.2 pooka if (docopy) { 725 1.27.10.2 pooka /* 726 1.27.10.2 pooka * XX - should not ignore errors 727 1.27.10.2 pooka * from VOP_CLOSE 728 1.27.10.2 pooka */ 729 1.27.10.2 pooka vn_lock(lvp, LK_EXCLUSIVE | LK_RETRY); 730 1.27.10.2 pooka 731 1.27.10.2 pooka error = VOP_GETATTR(lvp, &lvattr, cred, l); 732 1.27.10.2 pooka if (error == 0) 733 1.27.10.2 pooka error = VOP_OPEN(lvp, FREAD, cred, l); 734 1.27.10.2 pooka if (error == 0) { 735 1.27.10.2 pooka error = union_copyfile(lvp, uvp, cred, l); 736 1.27.10.2 pooka (void) VOP_CLOSE(lvp, FREAD, cred, l); 737 1.27.10.2 pooka } 738 1.27.10.2 pooka if (error == 0) { 739 1.27.10.2 pooka /* Copy permissions up too */ 740 1.27.10.2 pooka VATTR_NULL(&uvattr); 741 1.27.10.2 pooka uvattr.va_mode = lvattr.va_mode; 742 1.27.10.2 pooka uvattr.va_flags = lvattr.va_flags; 743 1.27.10.2 pooka error = VOP_SETATTR(uvp, &uvattr, cred, l); 744 1.27.10.2 pooka } 745 1.27.10.2 pooka VOP_UNLOCK(lvp, 0); 746 1.27.10.2 pooka #ifdef UNION_DIAGNOSTIC 747 1.27.10.2 pooka if (error == 0) 748 1.27.10.2 pooka uprintf("union: copied up %s\n", un->un_path); 749 1.27.10.2 pooka #endif 750 1.27.10.2 pooka 751 1.27.10.2 pooka } 752 1.27.10.2 pooka union_vn_close(uvp, FWRITE, cred, l); 753 1.27.10.2 pooka 754 1.27.10.2 pooka /* 755 1.27.10.2 pooka * Subsequent IOs will go to the top layer, so 756 1.27.10.2 pooka * call close on the lower vnode and open on the 757 1.27.10.2 pooka * upper vnode to ensure that the filesystem keeps 758 1.27.10.2 pooka * its references counts right. This doesn't do 759 1.27.10.2 pooka * the right thing with (cred) and (FREAD) though. 760 1.27.10.2 pooka * Ignoring error returns is not right, either. 761 1.27.10.2 pooka */ 762 1.27.10.2 pooka if (error == 0) { 763 1.27.10.2 pooka int i; 764 1.27.10.2 pooka 765 1.27.10.2 pooka vn_lock(lvp, LK_EXCLUSIVE | LK_RETRY); 766 1.27.10.2 pooka for (i = 0; i < un->un_openl; i++) { 767 1.27.10.2 pooka (void) VOP_CLOSE(lvp, FREAD, cred, l); 768 1.27.10.2 pooka (void) VOP_OPEN(uvp, FREAD, cred, l); 769 1.27.10.2 pooka } 770 1.27.10.2 pooka un->un_openl = 0; 771 1.27.10.2 pooka VOP_UNLOCK(lvp, 0); 772 1.27.10.2 pooka } 773 1.27.10.2 pooka 774 1.27.10.2 pooka return (error); 775 1.27.10.2 pooka 776 1.27.10.2 pooka } 777 1.27.10.2 pooka 778 1.27.10.2 pooka static int 779 1.27.10.2 pooka union_relookup(um, dvp, vpp, cnp, cn, path, pathlen) 780 1.27.10.2 pooka struct union_mount *um; 781 1.27.10.2 pooka struct vnode *dvp; 782 1.27.10.2 pooka struct vnode **vpp; 783 1.27.10.2 pooka struct componentname *cnp; 784 1.27.10.2 pooka struct componentname *cn; 785 1.27.10.2 pooka const char *path; 786 1.27.10.2 pooka int pathlen; 787 1.27.10.2 pooka { 788 1.27.10.2 pooka int error; 789 1.27.10.2 pooka 790 1.27.10.2 pooka /* 791 1.27.10.2 pooka * A new componentname structure must be faked up because 792 1.27.10.2 pooka * there is no way to know where the upper level cnp came 793 1.27.10.2 pooka * from or what it is being used for. This must duplicate 794 1.27.10.2 pooka * some of the work done by NDINIT, some of the work done 795 1.27.10.2 pooka * by namei, some of the work done by lookup and some of 796 1.27.10.2 pooka * the work done by VOP_LOOKUP when given a CREATE flag. 797 1.27.10.2 pooka * Conclusion: Horrible. 798 1.27.10.2 pooka * 799 1.27.10.2 pooka * The pathname buffer will be PNBUF_PUT'd by VOP_MKDIR. 800 1.27.10.2 pooka */ 801 1.27.10.2 pooka cn->cn_namelen = pathlen; 802 1.27.10.2 pooka if ((cn->cn_namelen + 1) > MAXPATHLEN) 803 1.27.10.2 pooka return (ENAMETOOLONG); 804 1.27.10.2 pooka cn->cn_pnbuf = PNBUF_GET(); 805 1.27.10.2 pooka memcpy(cn->cn_pnbuf, path, cn->cn_namelen); 806 1.27.10.2 pooka cn->cn_pnbuf[cn->cn_namelen] = '\0'; 807 1.27.10.2 pooka 808 1.27.10.2 pooka cn->cn_nameiop = CREATE; 809 1.27.10.2 pooka cn->cn_flags = (LOCKPARENT|HASBUF|SAVENAME|ISLASTCN); 810 1.27.10.2 pooka cn->cn_lwp = cnp->cn_lwp; 811 1.27.10.2 pooka if (um->um_op == UNMNT_ABOVE) 812 1.27.10.2 pooka cn->cn_cred = cnp->cn_cred; 813 1.27.10.2 pooka else 814 1.27.10.2 pooka cn->cn_cred = um->um_cred; 815 1.27.10.2 pooka cn->cn_nameptr = cn->cn_pnbuf; 816 1.27.10.2 pooka cn->cn_hash = cnp->cn_hash; 817 1.27.10.2 pooka cn->cn_consume = cnp->cn_consume; 818 1.27.10.2 pooka 819 1.27.10.2 pooka error = relookup(dvp, vpp, cn); 820 1.27.10.2 pooka if (error) { 821 1.27.10.2 pooka PNBUF_PUT(cn->cn_pnbuf); 822 1.27.10.2 pooka cn->cn_pnbuf = 0; 823 1.27.10.2 pooka } 824 1.27.10.2 pooka 825 1.27.10.2 pooka return (error); 826 1.27.10.2 pooka } 827 1.27.10.2 pooka 828 1.27.10.2 pooka /* 829 1.27.10.2 pooka * Create a shadow directory in the upper layer. 830 1.27.10.2 pooka * The new vnode is returned locked. 831 1.27.10.2 pooka * 832 1.27.10.2 pooka * (um) points to the union mount structure for access to the 833 1.27.10.2 pooka * the mounting process's credentials. 834 1.27.10.2 pooka * (dvp) is the directory in which to create the shadow directory. 835 1.27.10.2 pooka * it is unlocked on entry and exit. 836 1.27.10.2 pooka * (cnp) is the componentname to be created. 837 1.27.10.2 pooka * (vpp) is the returned newly created shadow directory, which 838 1.27.10.2 pooka * is returned locked. 839 1.27.10.2 pooka * 840 1.27.10.2 pooka * N.B. We still attempt to create shadow directories even if the union 841 1.27.10.2 pooka * is mounted read-only, which is a little nonintuitive. 842 1.27.10.2 pooka */ 843 1.27.10.2 pooka int 844 1.27.10.2 pooka union_mkshadow(um, dvp, cnp, vpp) 845 1.27.10.2 pooka struct union_mount *um; 846 1.27.10.2 pooka struct vnode *dvp; 847 1.27.10.2 pooka struct componentname *cnp; 848 1.27.10.2 pooka struct vnode **vpp; 849 1.27.10.2 pooka { 850 1.27.10.2 pooka int error; 851 1.27.10.2 pooka struct vattr va; 852 1.27.10.2 pooka struct lwp *l = cnp->cn_lwp; 853 1.27.10.2 pooka struct componentname cn; 854 1.27.10.2 pooka 855 1.27.10.2 pooka vn_lock(dvp, LK_EXCLUSIVE | LK_RETRY); 856 1.27.10.2 pooka error = union_relookup(um, dvp, vpp, cnp, &cn, 857 1.27.10.2 pooka cnp->cn_nameptr, cnp->cn_namelen); 858 1.27.10.2 pooka if (error) { 859 1.27.10.2 pooka VOP_UNLOCK(dvp, 0); 860 1.27.10.2 pooka return (error); 861 1.27.10.2 pooka } 862 1.27.10.2 pooka 863 1.27.10.2 pooka if (*vpp) { 864 1.27.10.2 pooka VOP_ABORTOP(dvp, &cn); 865 1.27.10.2 pooka if (dvp != *vpp) 866 1.27.10.2 pooka VOP_UNLOCK(dvp, 0); 867 1.27.10.2 pooka vput(*vpp); 868 1.27.10.2 pooka *vpp = NULLVP; 869 1.27.10.2 pooka return (EEXIST); 870 1.27.10.2 pooka } 871 1.27.10.2 pooka 872 1.27.10.2 pooka /* 873 1.27.10.2 pooka * policy: when creating the shadow directory in the 874 1.27.10.2 pooka * upper layer, create it owned by the user who did 875 1.27.10.2 pooka * the mount, group from parent directory, and mode 876 1.27.10.2 pooka * 777 modified by umask (ie mostly identical to the 877 1.27.10.2 pooka * mkdir syscall). (jsp, kb) 878 1.27.10.2 pooka */ 879 1.27.10.2 pooka 880 1.27.10.2 pooka VATTR_NULL(&va); 881 1.27.10.2 pooka va.va_type = VDIR; 882 1.27.10.2 pooka va.va_mode = um->um_cmode; 883 1.27.10.2 pooka 884 1.27.10.2 pooka /* VOP_LEASE: dvp is locked */ 885 1.27.10.2 pooka VOP_LEASE(dvp, l, cn.cn_cred, LEASE_WRITE); 886 1.27.10.2 pooka 887 1.27.10.2 pooka vref(dvp); 888 1.27.10.2 pooka error = VOP_MKDIR(dvp, vpp, &cn, &va); 889 1.27.10.2 pooka return (error); 890 1.27.10.2 pooka } 891 1.27.10.2 pooka 892 1.27.10.2 pooka /* 893 1.27.10.2 pooka * Create a whiteout entry in the upper layer. 894 1.27.10.2 pooka * 895 1.27.10.2 pooka * (um) points to the union mount structure for access to the 896 1.27.10.2 pooka * the mounting process's credentials. 897 1.27.10.2 pooka * (dvp) is the directory in which to create the whiteout. 898 1.27.10.2 pooka * it is locked on entry and exit. 899 1.27.10.2 pooka * (cnp) is the componentname to be created. 900 1.27.10.2 pooka */ 901 1.27.10.2 pooka int 902 1.27.10.2 pooka union_mkwhiteout(um, dvp, cnp, path) 903 1.27.10.2 pooka struct union_mount *um; 904 1.27.10.2 pooka struct vnode *dvp; 905 1.27.10.2 pooka struct componentname *cnp; 906 1.27.10.2 pooka char *path; 907 1.27.10.2 pooka { 908 1.27.10.2 pooka int error; 909 1.27.10.2 pooka struct lwp *l = cnp->cn_lwp; 910 1.27.10.2 pooka struct vnode *wvp; 911 1.27.10.2 pooka struct componentname cn; 912 1.27.10.2 pooka 913 1.27.10.2 pooka VOP_UNLOCK(dvp, 0); 914 1.27.10.2 pooka vn_lock(dvp, LK_EXCLUSIVE | LK_RETRY); 915 1.27.10.2 pooka error = union_relookup(um, dvp, &wvp, cnp, &cn, path, strlen(path)); 916 1.27.10.2 pooka if (error) 917 1.27.10.2 pooka return (error); 918 1.27.10.2 pooka 919 1.27.10.2 pooka if (wvp) { 920 1.27.10.2 pooka VOP_ABORTOP(dvp, &cn); 921 1.27.10.2 pooka if (dvp != wvp) 922 1.27.10.2 pooka VOP_UNLOCK(dvp, 0); 923 1.27.10.2 pooka vput(wvp); 924 1.27.10.2 pooka return (EEXIST); 925 1.27.10.2 pooka } 926 1.27.10.2 pooka 927 1.27.10.2 pooka /* VOP_LEASE: dvp is locked */ 928 1.27.10.2 pooka VOP_LEASE(dvp, l, l->l_cred, LEASE_WRITE); 929 1.27.10.2 pooka 930 1.27.10.2 pooka error = VOP_WHITEOUT(dvp, &cn, CREATE); 931 1.27.10.2 pooka if (error) 932 1.27.10.2 pooka VOP_ABORTOP(dvp, &cn); 933 1.27.10.2 pooka 934 1.27.10.2 pooka return (error); 935 1.27.10.2 pooka } 936 1.27.10.2 pooka 937 1.27.10.2 pooka /* 938 1.27.10.2 pooka * union_vn_create: creates and opens a new shadow file 939 1.27.10.2 pooka * on the upper union layer. this function is similar 940 1.27.10.2 pooka * in spirit to calling vn_open but it avoids calling namei(). 941 1.27.10.2 pooka * the problem with calling namei is that a) it locks too many 942 1.27.10.2 pooka * things, and b) it doesn't start at the "right" directory, 943 1.27.10.2 pooka * whereas relookup is told where to start. 944 1.27.10.2 pooka */ 945 1.27.10.2 pooka int 946 1.27.10.2 pooka union_vn_create(vpp, un, l) 947 1.27.10.2 pooka struct vnode **vpp; 948 1.27.10.2 pooka struct union_node *un; 949 1.27.10.2 pooka struct lwp *l; 950 1.27.10.2 pooka { 951 1.27.10.2 pooka struct vnode *vp; 952 1.27.10.2 pooka kauth_cred_t cred = l->l_cred; 953 1.27.10.2 pooka struct vattr vat; 954 1.27.10.2 pooka struct vattr *vap = &vat; 955 1.27.10.2 pooka int fmode = FFLAGS(O_WRONLY|O_CREAT|O_TRUNC|O_EXCL); 956 1.27.10.2 pooka int error; 957 1.27.10.2 pooka int cmode = UN_FILEMODE & ~l->l_proc->p_cwdi->cwdi_cmask; 958 1.27.10.2 pooka struct componentname cn; 959 1.27.10.2 pooka 960 1.27.10.2 pooka *vpp = NULLVP; 961 1.27.10.2 pooka 962 1.27.10.2 pooka /* 963 1.27.10.2 pooka * Build a new componentname structure (for the same 964 1.27.10.2 pooka * reasons outlines in union_mkshadow). 965 1.27.10.2 pooka * The difference here is that the file is owned by 966 1.27.10.2 pooka * the current user, rather than by the person who 967 1.27.10.2 pooka * did the mount, since the current user needs to be 968 1.27.10.2 pooka * able to write the file (that's why it is being 969 1.27.10.2 pooka * copied in the first place). 970 1.27.10.2 pooka */ 971 1.27.10.2 pooka cn.cn_namelen = strlen(un->un_path); 972 1.27.10.2 pooka if ((cn.cn_namelen + 1) > MAXPATHLEN) 973 1.27.10.2 pooka return (ENAMETOOLONG); 974 1.27.10.2 pooka cn.cn_pnbuf = PNBUF_GET(); 975 1.27.10.2 pooka memcpy(cn.cn_pnbuf, un->un_path, cn.cn_namelen+1); 976 1.27.10.2 pooka cn.cn_nameiop = CREATE; 977 1.27.10.2 pooka cn.cn_flags = (LOCKPARENT|HASBUF|SAVENAME|ISLASTCN); 978 1.27.10.2 pooka cn.cn_lwp = l; 979 1.27.10.2 pooka cn.cn_cred = l->l_cred; 980 1.27.10.2 pooka cn.cn_nameptr = cn.cn_pnbuf; 981 1.27.10.2 pooka cn.cn_hash = un->un_hash; 982 1.27.10.2 pooka cn.cn_consume = 0; 983 1.27.10.2 pooka 984 1.27.10.2 pooka vn_lock(un->un_dirvp, LK_EXCLUSIVE | LK_RETRY); 985 1.27.10.2 pooka error = relookup(un->un_dirvp, &vp, &cn); 986 1.27.10.2 pooka if (error) { 987 1.27.10.2 pooka VOP_UNLOCK(un->un_dirvp, 0); 988 1.27.10.2 pooka return (error); 989 1.27.10.2 pooka } 990 1.27.10.2 pooka 991 1.27.10.2 pooka if (vp) { 992 1.27.10.2 pooka VOP_ABORTOP(un->un_dirvp, &cn); 993 1.27.10.2 pooka if (un->un_dirvp != vp) 994 1.27.10.2 pooka VOP_UNLOCK(un->un_dirvp, 0); 995 1.27.10.2 pooka vput(vp); 996 1.27.10.2 pooka return (EEXIST); 997 1.27.10.2 pooka } 998 1.27.10.2 pooka 999 1.27.10.2 pooka /* 1000 1.27.10.2 pooka * Good - there was no race to create the file 1001 1.27.10.2 pooka * so go ahead and create it. The permissions 1002 1.27.10.2 pooka * on the file will be 0666 modified by the 1003 1.27.10.2 pooka * current user's umask. Access to the file, while 1004 1.27.10.2 pooka * it is unioned, will require access to the top *and* 1005 1.27.10.2 pooka * bottom files. Access when not unioned will simply 1006 1.27.10.2 pooka * require access to the top-level file. 1007 1.27.10.2 pooka * TODO: confirm choice of access permissions. 1008 1.27.10.2 pooka */ 1009 1.27.10.2 pooka VATTR_NULL(vap); 1010 1.27.10.2 pooka vap->va_type = VREG; 1011 1.27.10.2 pooka vap->va_mode = cmode; 1012 1.27.10.2 pooka VOP_LEASE(un->un_dirvp, l, cred, LEASE_WRITE); 1013 1.27.10.2 pooka vref(un->un_dirvp); 1014 1.27.10.2 pooka if ((error = VOP_CREATE(un->un_dirvp, &vp, &cn, vap)) != 0) 1015 1.27.10.2 pooka return (error); 1016 1.27.10.2 pooka 1017 1.27.10.2 pooka if ((error = VOP_OPEN(vp, fmode, cred, l)) != 0) { 1018 1.27.10.2 pooka vput(vp); 1019 1.27.10.2 pooka return (error); 1020 1.27.10.2 pooka } 1021 1.27.10.2 pooka 1022 1.27.10.2 pooka vp->v_writecount++; 1023 1.27.10.2 pooka *vpp = vp; 1024 1.27.10.2 pooka return (0); 1025 1.27.10.2 pooka } 1026 1.27.10.2 pooka 1027 1.27.10.2 pooka int 1028 1.27.10.2 pooka union_vn_close(vp, fmode, cred, l) 1029 1.27.10.2 pooka struct vnode *vp; 1030 1.27.10.2 pooka int fmode; 1031 1.27.10.2 pooka kauth_cred_t cred; 1032 1.27.10.2 pooka struct lwp *l; 1033 1.27.10.2 pooka { 1034 1.27.10.2 pooka 1035 1.27.10.2 pooka if (fmode & FWRITE) 1036 1.27.10.2 pooka --vp->v_writecount; 1037 1.27.10.2 pooka return (VOP_CLOSE(vp, fmode, cred, l)); 1038 1.27.10.2 pooka } 1039 1.27.10.2 pooka 1040 1.27.10.2 pooka void 1041 1.27.10.2 pooka union_removed_upper(un) 1042 1.27.10.2 pooka struct union_node *un; 1043 1.27.10.2 pooka { 1044 1.27.10.2 pooka #if 1 1045 1.27.10.2 pooka /* 1046 1.27.10.2 pooka * We do not set the uppervp to NULLVP here, because lowervp 1047 1.27.10.2 pooka * may also be NULLVP, so this routine would end up creating 1048 1.27.10.2 pooka * a bogus union node with no upper or lower VP (that causes 1049 1.27.10.2 pooka * pain in many places that assume at least one VP exists). 1050 1.27.10.2 pooka * Since we've removed this node from the cache hash chains, 1051 1.27.10.2 pooka * it won't be found again. When all current holders 1052 1.27.10.2 pooka * release it, union_inactive() will vgone() it. 1053 1.27.10.2 pooka */ 1054 1.27.10.2 pooka union_diruncache(un); 1055 1.27.10.2 pooka #else 1056 1.27.10.2 pooka union_newupper(un, NULLVP); 1057 1.27.10.2 pooka #endif 1058 1.27.10.2 pooka 1059 1.27.10.2 pooka if (un->un_flags & UN_CACHED) { 1060 1.27.10.2 pooka un->un_flags &= ~UN_CACHED; 1061 1.27.10.2 pooka LIST_REMOVE(un, un_cache); 1062 1.27.10.2 pooka } 1063 1.27.10.2 pooka 1064 1.27.10.2 pooka if (un->un_flags & UN_ULOCK) { 1065 1.27.10.2 pooka un->un_flags &= ~UN_ULOCK; 1066 1.27.10.2 pooka VOP_UNLOCK(un->un_uppervp, 0); 1067 1.27.10.2 pooka } 1068 1.27.10.2 pooka } 1069 1.27.10.2 pooka 1070 1.27.10.2 pooka #if 0 1071 1.27.10.2 pooka struct vnode * 1072 1.27.10.2 pooka union_lowervp(vp) 1073 1.27.10.2 pooka struct vnode *vp; 1074 1.27.10.2 pooka { 1075 1.27.10.2 pooka struct union_node *un = VTOUNION(vp); 1076 1.27.10.2 pooka 1077 1.27.10.2 pooka if ((un->un_lowervp != NULLVP) && 1078 1.27.10.2 pooka (vp->v_type == un->un_lowervp->v_type)) { 1079 1.27.10.2 pooka if (vget(un->un_lowervp, 0) == 0) 1080 1.27.10.2 pooka return (un->un_lowervp); 1081 1.27.10.2 pooka } 1082 1.27.10.2 pooka 1083 1.27.10.2 pooka return (NULLVP); 1084 1.27.10.2 pooka } 1085 1.27.10.2 pooka #endif 1086 1.27.10.2 pooka 1087 1.27.10.2 pooka /* 1088 1.27.10.2 pooka * determine whether a whiteout is needed 1089 1.27.10.2 pooka * during a remove/rmdir operation. 1090 1.27.10.2 pooka */ 1091 1.27.10.2 pooka int 1092 1.27.10.2 pooka union_dowhiteout(un, cred, l) 1093 1.27.10.2 pooka struct union_node *un; 1094 1.27.10.2 pooka kauth_cred_t cred; 1095 1.27.10.2 pooka struct lwp *l; 1096 1.27.10.2 pooka { 1097 1.27.10.2 pooka struct vattr va; 1098 1.27.10.2 pooka 1099 1.27.10.2 pooka if (un->un_lowervp != NULLVP) 1100 1.27.10.2 pooka return (1); 1101 1.27.10.2 pooka 1102 1.27.10.2 pooka if (VOP_GETATTR(un->un_uppervp, &va, cred, l) == 0 && 1103 1.27.10.2 pooka (va.va_flags & OPAQUE)) 1104 1.27.10.2 pooka return (1); 1105 1.27.10.2 pooka 1106 1.27.10.2 pooka return (0); 1107 1.27.10.2 pooka } 1108 1.27.10.2 pooka 1109 1.27.10.2 pooka static void 1110 1.27.10.2 pooka union_dircache_r(vp, vppp, cntp) 1111 1.27.10.2 pooka struct vnode *vp; 1112 1.27.10.2 pooka struct vnode ***vppp; 1113 1.27.10.2 pooka int *cntp; 1114 1.27.10.2 pooka { 1115 1.27.10.2 pooka struct union_node *un; 1116 1.27.10.2 pooka 1117 1.27.10.2 pooka if (vp->v_op != union_vnodeop_p) { 1118 1.27.10.2 pooka if (vppp) { 1119 1.27.10.2 pooka VREF(vp); 1120 1.27.10.2 pooka *(*vppp)++ = vp; 1121 1.27.10.2 pooka if (--(*cntp) == 0) 1122 1.27.10.2 pooka panic("union: dircache table too small"); 1123 1.27.10.2 pooka } else { 1124 1.27.10.2 pooka (*cntp)++; 1125 1.27.10.2 pooka } 1126 1.27.10.2 pooka 1127 1.27.10.2 pooka return; 1128 1.27.10.2 pooka } 1129 1.27.10.2 pooka 1130 1.27.10.2 pooka un = VTOUNION(vp); 1131 1.27.10.2 pooka if (un->un_uppervp != NULLVP) 1132 1.27.10.2 pooka union_dircache_r(un->un_uppervp, vppp, cntp); 1133 1.27.10.2 pooka if (un->un_lowervp != NULLVP) 1134 1.27.10.2 pooka union_dircache_r(un->un_lowervp, vppp, cntp); 1135 1.27.10.2 pooka } 1136 1.27.10.2 pooka 1137 1.27.10.2 pooka struct vnode * 1138 1.27.10.2 pooka union_dircache(struct vnode *vp, struct lwp *l) 1139 1.27.10.2 pooka { 1140 1.27.10.2 pooka int cnt; 1141 1.27.10.2 pooka struct vnode *nvp = NULLVP; 1142 1.27.10.2 pooka struct vnode **vpp; 1143 1.27.10.2 pooka struct vnode **dircache; 1144 1.27.10.2 pooka int error; 1145 1.27.10.2 pooka 1146 1.27.10.2 pooka vn_lock(vp, LK_EXCLUSIVE | LK_RETRY); 1147 1.27.10.2 pooka dircache = VTOUNION(vp)->un_dircache; 1148 1.27.10.2 pooka 1149 1.27.10.2 pooka nvp = NULLVP; 1150 1.27.10.2 pooka 1151 1.27.10.2 pooka if (dircache == 0) { 1152 1.27.10.2 pooka cnt = 0; 1153 1.27.10.2 pooka union_dircache_r(vp, 0, &cnt); 1154 1.27.10.2 pooka cnt++; 1155 1.27.10.2 pooka dircache = (struct vnode **) 1156 1.27.10.2 pooka malloc(cnt * sizeof(struct vnode *), 1157 1.27.10.2 pooka M_TEMP, M_WAITOK); 1158 1.27.10.2 pooka vpp = dircache; 1159 1.27.10.2 pooka union_dircache_r(vp, &vpp, &cnt); 1160 1.27.10.2 pooka VTOUNION(vp)->un_dircache = dircache; 1161 1.27.10.2 pooka *vpp = NULLVP; 1162 1.27.10.2 pooka vpp = dircache + 1; 1163 1.27.10.2 pooka } else { 1164 1.27.10.2 pooka vpp = dircache; 1165 1.27.10.2 pooka do { 1166 1.27.10.2 pooka if (*vpp++ == VTOUNION(vp)->un_uppervp) 1167 1.27.10.2 pooka break; 1168 1.27.10.2 pooka } while (*vpp != NULLVP); 1169 1.27.10.2 pooka } 1170 1.27.10.2 pooka 1171 1.27.10.2 pooka if (*vpp == NULLVP) 1172 1.27.10.2 pooka goto out; 1173 1.27.10.2 pooka 1174 1.27.10.2 pooka vn_lock(*vpp, LK_EXCLUSIVE | LK_RETRY); 1175 1.27.10.2 pooka VREF(*vpp); 1176 1.27.10.2 pooka error = union_allocvp(&nvp, vp->v_mount, NULLVP, NULLVP, 0, *vpp, NULLVP, 0); 1177 1.27.10.2 pooka if (!error) { 1178 1.27.10.2 pooka VTOUNION(vp)->un_dircache = 0; 1179 1.27.10.2 pooka VTOUNION(nvp)->un_dircache = dircache; 1180 1.27.10.2 pooka } 1181 1.27.10.2 pooka 1182 1.27.10.2 pooka out: 1183 1.27.10.2 pooka VOP_UNLOCK(vp, 0); 1184 1.27.10.2 pooka return (nvp); 1185 1.27.10.2 pooka } 1186 1.27.10.2 pooka 1187 1.27.10.2 pooka void 1188 1.27.10.2 pooka union_diruncache(un) 1189 1.27.10.2 pooka struct union_node *un; 1190 1.27.10.2 pooka { 1191 1.27.10.2 pooka struct vnode **vpp; 1192 1.27.10.2 pooka 1193 1.27.10.2 pooka if (un->un_dircache != 0) { 1194 1.27.10.2 pooka for (vpp = un->un_dircache; *vpp != NULLVP; vpp++) 1195 1.27.10.2 pooka vrele(*vpp); 1196 1.27.10.2 pooka free(un->un_dircache, M_TEMP); 1197 1.27.10.2 pooka un->un_dircache = 0; 1198 1.27.10.2 pooka } 1199 1.27.10.2 pooka } 1200 1.27.10.2 pooka 1201 1.27.10.2 pooka /* 1202 1.27.10.2 pooka * This hook is called from vn_readdir() to switch to lower directory 1203 1.27.10.2 pooka * entry after the upper directory is read. 1204 1.27.10.2 pooka */ 1205 1.27.10.2 pooka int 1206 1.27.10.2 pooka union_readdirhook(struct vnode **vpp, struct file *fp, struct lwp *l) 1207 1.27.10.2 pooka { 1208 1.27.10.2 pooka struct vnode *vp = *vpp, *lvp; 1209 1.27.10.2 pooka struct vattr va; 1210 1.27.10.2 pooka int error; 1211 1.27.10.2 pooka 1212 1.27.10.2 pooka if (vp->v_op != union_vnodeop_p) 1213 1.27.10.2 pooka return (0); 1214 1.27.10.2 pooka 1215 1.27.10.2 pooka if ((lvp = union_dircache(vp, l)) == NULLVP) 1216 1.27.10.2 pooka return (0); 1217 1.27.10.2 pooka 1218 1.27.10.2 pooka /* 1219 1.27.10.2 pooka * If the directory is opaque, 1220 1.27.10.2 pooka * then don't show lower entries 1221 1.27.10.2 pooka */ 1222 1.27.10.2 pooka error = VOP_GETATTR(vp, &va, fp->f_cred, l); 1223 1.27.10.2 pooka if (error || (va.va_flags & OPAQUE)) { 1224 1.27.10.2 pooka vput(lvp); 1225 1.27.10.2 pooka return (error); 1226 1.27.10.2 pooka } 1227 1.27.10.2 pooka 1228 1.27.10.2 pooka error = VOP_OPEN(lvp, FREAD, fp->f_cred, l); 1229 1.27.10.2 pooka if (error) { 1230 1.27.10.2 pooka vput(lvp); 1231 1.27.10.2 pooka return (error); 1232 1.27.10.2 pooka } 1233 1.27.10.2 pooka VOP_UNLOCK(lvp, 0); 1234 1.27.10.2 pooka fp->f_data = lvp; 1235 1.27.10.2 pooka fp->f_offset = 0; 1236 1.27.10.2 pooka error = vn_close(vp, FREAD, fp->f_cred, l); 1237 1.27.10.2 pooka if (error) 1238 1.27.10.2 pooka return (error); 1239 1.27.10.2 pooka *vpp = lvp; 1240 1.27.10.2 pooka return (0); 1241 1.27.10.2 pooka } 1242
Indexes created Fri Oct 03 02:09:57 GMT 2025