2 * Copyright (c) 1994 Jan-Simon Pendry
4 * The Regents of the University of California. All rights reserved.
6 * This code is derived from software contributed to Berkeley by
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. 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.
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
37 * @(#)union_subr.c 8.20 (Berkeley) 5/20/95
38 * $FreeBSD: src/sys/miscfs/union/union_subr.c,v 1.43.2.2 2001/12/25 01:44:45 dillon Exp $
39 * $DragonFly: src/sys/vfs/union/union_subr.c,v 1.2 2003/06/17 04:28:43 dillon Exp $
42 #include <sys/param.h>
43 #include <sys/systm.h>
44 #include <sys/kernel.h>
45 #include <sys/vnode.h>
46 #include <sys/namei.h>
47 #include <sys/malloc.h>
48 #include <sys/fcntl.h>
50 #include <sys/filedesc.h>
51 #include <sys/module.h>
52 #include <sys/mount.h>
55 #include <vm/vm_extern.h> /* for vnode_pager_setsize */
56 #include <vm/vm_zone.h>
57 #include <vm/vm_object.h> /* for vm cache coherency */
58 #include <miscfs/union/union.h>
62 extern int union_init __P((void));
64 /* must be power of two, otherwise change UNION_HASH() */
67 /* unsigned int ... */
68 #define UNION_HASH(u, l) \
69 (((((uintptr_t) (u)) + ((uintptr_t) l)) >> 8) & (NHASH-1))
71 static LIST_HEAD(unhead, union_node) unhead[NHASH];
72 static int unvplock[NHASH];
74 static void union_dircache_r __P((struct vnode *vp, struct vnode ***vppp,
76 static int union_list_lock __P((int ix));
77 static void union_list_unlock __P((int ix));
78 static int union_relookup __P((struct union_mount *um, struct vnode *dvp,
80 struct componentname *cnp,
81 struct componentname *cn, char *path,
83 static void union_updatevp __P((struct union_node *un,
84 struct vnode *uppervp,
85 struct vnode *lowervp));
86 static void union_newlower __P((struct union_node *, struct vnode *));
87 static void union_newupper __P((struct union_node *, struct vnode *));
88 static int union_copyfile __P((struct vnode *, struct vnode *,
89 struct ucred *, struct proc *));
90 static int union_vn_create __P((struct vnode **, struct union_node *,
92 static int union_vn_close __P((struct vnode *, int, struct ucred *,
100 for (i = 0; i < NHASH; i++)
101 LIST_INIT(&unhead[i]);
102 bzero((caddr_t)unvplock, sizeof(unvplock));
110 if (unvplock[ix] & UNVP_LOCKED) {
111 unvplock[ix] |= UNVP_WANT;
112 (void) tsleep((caddr_t) &unvplock[ix], PINOD, "unllck", 0);
115 unvplock[ix] |= UNVP_LOCKED;
120 union_list_unlock(ix)
123 unvplock[ix] &= ~UNVP_LOCKED;
125 if (unvplock[ix] & UNVP_WANT) {
126 unvplock[ix] &= ~UNVP_WANT;
127 wakeup((caddr_t) &unvplock[ix]);
134 * The uppervp, if not NULL, must be referenced and not locked by us
135 * The lowervp, if not NULL, must be referenced.
137 * if uppervp and lowervp match pointers already installed, nothing
138 * happens. The passed vp's (when matching) are not adjusted. This
139 * routine may only be called by union_newupper() and union_newlower().
143 union_updatevp(un, uppervp, lowervp)
144 struct union_node *un;
145 struct vnode *uppervp;
146 struct vnode *lowervp;
148 int ohash = UNION_HASH(un->un_uppervp, un->un_lowervp);
149 int nhash = UNION_HASH(uppervp, lowervp);
150 int docache = (lowervp != NULLVP || uppervp != NULLVP);
154 * Ensure locking is ordered from lower to higher
155 * to avoid deadlocks.
165 if (lhash != uhash) {
166 while (union_list_lock(lhash))
170 while (union_list_lock(uhash))
173 if (ohash != nhash || !docache) {
174 if (un->un_flags & UN_CACHED) {
175 un->un_flags &= ~UN_CACHED;
176 LIST_REMOVE(un, un_cache);
181 union_list_unlock(ohash);
183 if (un->un_lowervp != lowervp) {
184 if (un->un_lowervp) {
185 vrele(un->un_lowervp);
187 free(un->un_path, M_TEMP);
191 un->un_lowervp = lowervp;
192 un->un_lowersz = VNOVAL;
195 if (un->un_uppervp != uppervp) {
197 vrele(un->un_uppervp);
198 un->un_uppervp = uppervp;
199 un->un_uppersz = VNOVAL;
202 if (docache && (ohash != nhash)) {
203 LIST_INSERT_HEAD(&unhead[nhash], un, un_cache);
204 un->un_flags |= UN_CACHED;
207 union_list_unlock(nhash);
211 * Set a new lowervp. The passed lowervp must be referenced and will be
212 * stored in the vp in a referenced state.
216 union_newlower(un, lowervp)
217 struct union_node *un;
218 struct vnode *lowervp;
220 union_updatevp(un, un->un_uppervp, lowervp);
224 * Set a new uppervp. The passed uppervp must be locked and will be
225 * stored in the vp in a locked state. The caller should not unlock
230 union_newupper(un, uppervp)
231 struct union_node *un;
232 struct vnode *uppervp;
234 union_updatevp(un, uppervp, un->un_lowervp);
238 * Keep track of size changes in the underlying vnodes.
239 * If the size changes, then callback to the vm layer
240 * giving priority to the upper layer size.
243 union_newsize(vp, uppersz, lowersz)
245 off_t uppersz, lowersz;
247 struct union_node *un;
250 /* only interested in regular files */
251 if (vp->v_type != VREG)
257 if ((uppersz != VNOVAL) && (un->un_uppersz != uppersz)) {
258 un->un_uppersz = uppersz;
263 if ((lowersz != VNOVAL) && (un->un_lowersz != lowersz)) {
264 un->un_lowersz = lowersz;
270 UDEBUG(("union: %s size now %ld\n",
271 (uppersz != VNOVAL ? "upper" : "lower"), (long)sz));
272 vnode_pager_setsize(vp, sz);
277 * union_allocvp: allocate a union_node and associate it with a
278 * parent union_node and one or two vnodes.
280 * vpp Holds the returned vnode locked and referenced if no
283 * mp Holds the mount point. mp may or may not be busied.
284 * allocvp makes no changes to mp.
286 * dvp Holds the parent union_node to the one we wish to create.
287 * XXX may only be used to traverse an uncopied lowervp-based
290 * dvp may or may not be locked. allocvp makes no changes
293 * upperdvp Holds the parent vnode to uppervp, generally used along
294 * with path component information to create a shadow of
295 * lowervp when uppervp does not exist.
297 * upperdvp is referenced but unlocked on entry, and will be
298 * dereferenced on return.
300 * uppervp Holds the new uppervp vnode to be stored in the
301 * union_node we are allocating. uppervp is referenced but
302 * not locked, and will be dereferenced on return.
304 * lowervp Holds the new lowervp vnode to be stored in the
305 * union_node we are allocating. lowervp is referenced but
306 * not locked, and will be dereferenced on return.
308 * cnp Holds path component information to be coupled with
309 * lowervp and upperdvp to allow unionfs to create an uppervp
310 * later on. Only used if lowervp is valid. The conents
311 * of cnp is only valid for the duration of the call.
313 * docache Determine whether this node should be entered in the
314 * cache or whether it should be destroyed as soon as possible.
316 * all union_nodes are maintained on a singly-linked
317 * list. new nodes are only allocated when they cannot
318 * be found on this list. entries on the list are
319 * removed when the vfs reclaim entry is called.
321 * a single lock is kept for the entire list. this is
322 * needed because the getnewvnode() function can block
323 * waiting for a vnode to become free, in which case there
324 * may be more than one process trying to get the same
325 * vnode. this lock is only taken if we are going to
326 * call getnewvnode, since the kernel itself is single-threaded.
328 * if an entry is found on the list, then call vget() to
329 * take a reference. this is done because there may be
330 * zero references to it and so it needs to removed from
331 * the vnode free list.
335 union_allocvp(vpp, mp, dvp, upperdvp, cnp, uppervp, lowervp, docache)
338 struct vnode *dvp; /* parent union vnode */
339 struct vnode *upperdvp; /* parent vnode of uppervp */
340 struct componentname *cnp; /* may be null */
341 struct vnode *uppervp; /* may be null */
342 struct vnode *lowervp; /* may be null */
346 struct union_node *un = 0;
347 struct union_mount *um = MOUNTTOUNIONMOUNT(mp);
348 struct proc *p = (cnp) ? cnp->cn_proc : curproc;
353 if (uppervp == NULLVP && lowervp == NULLVP)
354 panic("union: unidentifiable allocation");
356 if (uppervp && lowervp && (uppervp->v_type != lowervp->v_type)) {
361 /* detect the root vnode (and aliases) */
363 if ((uppervp == um->um_uppervp) &&
364 ((lowervp == NULLVP) || lowervp == um->um_lowervp)) {
365 if (lowervp == NULLVP) {
366 lowervp = um->um_lowervp;
367 if (lowervp != NULLVP)
376 } else for (try = 0; try < 3; try++) {
379 if (lowervp == NULLVP)
381 hash = UNION_HASH(uppervp, lowervp);
385 if (uppervp == NULLVP)
387 hash = UNION_HASH(uppervp, NULLVP);
391 if (lowervp == NULLVP)
393 hash = UNION_HASH(NULLVP, lowervp);
397 while (union_list_lock(hash))
400 for (un = unhead[hash].lh_first; un != 0;
401 un = un->un_cache.le_next) {
402 if ((un->un_lowervp == lowervp ||
403 un->un_lowervp == NULLVP) &&
404 (un->un_uppervp == uppervp ||
405 un->un_uppervp == NULLVP) &&
406 (UNIONTOV(un)->v_mount == mp)) {
407 if (vget(UNIONTOV(un), 0,
408 cnp ? cnp->cn_proc : NULL)) {
409 union_list_unlock(hash);
416 union_list_unlock(hash);
424 * Obtain a lock on the union_node. Everything is unlocked
425 * except for dvp, so check that case. If they match, our
426 * new un is already locked. Otherwise we have to lock our
429 * A potential deadlock situation occurs when we are holding
430 * one lock while trying to get another. We must follow
431 * strict ordering rules to avoid it. We try to locate dvp
432 * by scanning up from un_vnode, since the most likely
433 * scenario is un being under dvp.
436 if (dvp && un->un_vnode != dvp) {
437 struct vnode *scan = un->un_vnode;
440 scan = VTOUNION(scan)->un_pvp;
441 } while (scan && scan->v_tag == VT_UNION && scan != dvp);
444 * our new un is above dvp (we never saw dvp
445 * while moving up the tree).
448 VOP_UNLOCK(dvp, 0, p);
449 error = vn_lock(un->un_vnode, LK_EXCLUSIVE, p);
450 vn_lock(dvp, LK_EXCLUSIVE | LK_RETRY, p);
454 * our new un is under dvp
456 error = vn_lock(un->un_vnode, LK_EXCLUSIVE, p);
458 } else if (dvp == NULLVP) {
460 * dvp is NULL, we need to lock un.
462 error = vn_lock(un->un_vnode, LK_EXCLUSIVE, p);
465 * dvp == un->un_vnode, we are already locked.
474 * At this point, the union_node is locked and referenced.
476 * uppervp is locked and referenced or NULL, lowervp is
477 * referenced or NULL.
479 UDEBUG(("Modify existing un %p vn %p upper %p(refs %d) -> %p(refs %d)\n",
480 un, un->un_vnode, un->un_uppervp,
481 (un->un_uppervp ? un->un_uppervp->v_usecount : -99),
483 (uppervp ? uppervp->v_usecount : -99)
486 if (uppervp != un->un_uppervp) {
487 KASSERT(uppervp == NULL || uppervp->v_usecount > 0, ("union_allocvp: too few refs %d (at least 1 required) on uppervp", uppervp->v_usecount));
488 union_newupper(un, uppervp);
489 } else if (uppervp) {
490 KASSERT(uppervp->v_usecount > 1, ("union_allocvp: too few refs %d (at least 2 required) on uppervp", uppervp->v_usecount));
495 * Save information about the lower layer.
496 * This needs to keep track of pathname
497 * and directory information which union_vn_create
500 if (lowervp != un->un_lowervp) {
501 union_newlower(un, lowervp);
502 if (cnp && (lowervp != NULLVP)) {
503 un->un_path = malloc(cnp->cn_namelen+1,
505 bcopy(cnp->cn_nameptr, un->un_path,
507 un->un_path[cnp->cn_namelen] = '\0';
509 } else if (lowervp) {
516 if (upperdvp != un->un_dirvp) {
519 un->un_dirvp = upperdvp;
520 } else if (upperdvp) {
530 * otherwise lock the vp list while we call getnewvnode
531 * since that can block.
533 hash = UNION_HASH(uppervp, lowervp);
535 if (union_list_lock(hash))
540 * Create new node rather then replace old node
543 error = getnewvnode(VT_UNION, mp, union_vnodeop_p, vpp);
546 * If an error occurs clear out vnodes.
558 MALLOC((*vpp)->v_data, void *, sizeof(struct union_node),
561 (*vpp)->v_flag |= vflag;
563 (*vpp)->v_type = uppervp->v_type;
565 (*vpp)->v_type = lowervp->v_type;
568 bzero(un, sizeof(*un));
570 lockinit(&un->un_lock, PVFS, "unlock", VLKTIMEOUT, 0);
571 vn_lock(*vpp, LK_EXCLUSIVE | LK_RETRY, p);
574 un->un_uppervp = uppervp;
575 un->un_uppersz = VNOVAL;
576 un->un_lowervp = lowervp;
577 un->un_lowersz = VNOVAL;
578 un->un_dirvp = upperdvp;
579 un->un_pvp = dvp; /* only parent dir in new allocation */
585 if (cnp && (lowervp != NULLVP)) {
586 un->un_path = malloc(cnp->cn_namelen+1, M_TEMP, M_WAITOK);
587 bcopy(cnp->cn_nameptr, un->un_path, cnp->cn_namelen);
588 un->un_path[cnp->cn_namelen] = '\0';
595 LIST_INSERT_HEAD(&unhead[hash], un, un_cache);
596 un->un_flags |= UN_CACHED;
601 union_list_unlock(hash);
610 struct union_node *un = VTOUNION(vp);
612 if (un->un_flags & UN_CACHED) {
613 un->un_flags &= ~UN_CACHED;
614 LIST_REMOVE(un, un_cache);
617 if (un->un_pvp != NULLVP) {
621 if (un->un_uppervp != NULLVP) {
622 vrele(un->un_uppervp);
623 un->un_uppervp = NULL;
625 if (un->un_lowervp != NULLVP) {
626 vrele(un->un_lowervp);
627 un->un_lowervp = NULL;
629 if (un->un_dirvp != NULLVP) {
634 free(un->un_path, M_TEMP);
638 FREE(vp->v_data, M_TEMP);
645 * copyfile. copy the vnode (fvp) to the vnode (tvp)
646 * using a sequence of reads and writes. both (fvp)
647 * and (tvp) are locked on entry and exit.
649 * fvp and tvp are both exclusive locked on call, but their refcount's
650 * haven't been bumped at all.
653 union_copyfile(fvp, tvp, cred, p)
666 * allocate a buffer of size MAXBSIZE.
667 * loop doing reads and writes, keeping track
668 * of the current uio offset.
669 * give up at the first sign of trouble.
672 bzero(&uio, sizeof(uio));
675 uio.uio_segflg = UIO_SYSSPACE;
678 VOP_LEASE(fvp, p, cred, LEASE_READ);
679 VOP_LEASE(tvp, p, cred, LEASE_WRITE);
681 buf = malloc(MAXBSIZE, M_TEMP, M_WAITOK);
683 /* ugly loop follows... */
685 off_t offset = uio.uio_offset;
695 iov.iov_len = MAXBSIZE;
696 uio.uio_resid = iov.iov_len;
697 uio.uio_rw = UIO_READ;
699 if ((error = VOP_READ(fvp, &uio, 0, cred)) != 0)
703 * Get bytes read, handle read eof case and setup for
706 if ((count = MAXBSIZE - uio.uio_resid) == 0)
711 * Write until an error occurs or our buffer has been
712 * exhausted, then update the offset for the next read.
714 while (bufoffset < count) {
717 iov.iov_base = buf + bufoffset;
718 iov.iov_len = count - bufoffset;
719 uio.uio_offset = offset + bufoffset;
720 uio.uio_rw = UIO_WRITE;
721 uio.uio_resid = iov.iov_len;
723 if ((error = VOP_WRITE(tvp, &uio, 0, cred)) != 0)
725 bufoffset += (count - bufoffset) - uio.uio_resid;
727 uio.uio_offset = offset + bufoffset;
728 } while (error == 0);
736 * un's vnode is assumed to be locked on entry and remains locked on exit.
740 union_copyup(un, docopy, cred, p)
741 struct union_node *un;
747 struct vnode *lvp, *uvp;
750 * If the user does not have read permission, the vnode should not
751 * be copied to upper layer.
753 vn_lock(un->un_lowervp, LK_EXCLUSIVE | LK_RETRY, p);
754 error = VOP_ACCESS(un->un_lowervp, VREAD, cred, p);
755 VOP_UNLOCK(un->un_lowervp, 0, p);
759 error = union_vn_create(&uvp, un, p);
763 lvp = un->un_lowervp;
765 KASSERT(uvp->v_usecount > 0, ("copy: uvp refcount 0: %d", uvp->v_usecount));
768 * XX - should not ignore errors
771 vn_lock(lvp, LK_EXCLUSIVE | LK_RETRY, p);
772 error = VOP_OPEN(lvp, FREAD, cred, p);
773 if (error == 0 && vn_canvmio(lvp) == TRUE)
774 error = vfs_object_create(lvp, p, cred);
776 error = union_copyfile(lvp, uvp, cred, p);
777 VOP_UNLOCK(lvp, 0, p);
778 (void) VOP_CLOSE(lvp, FREAD, cred, p);
781 UDEBUG(("union: copied up %s\n", un->un_path));
784 VOP_UNLOCK(uvp, 0, p);
785 union_newupper(un, uvp);
786 KASSERT(uvp->v_usecount > 0, ("copy: uvp refcount 0: %d", uvp->v_usecount));
787 union_vn_close(uvp, FWRITE, cred, p);
788 KASSERT(uvp->v_usecount > 0, ("copy: uvp refcount 0: %d", uvp->v_usecount));
790 * Subsequent IOs will go to the top layer, so
791 * call close on the lower vnode and open on the
792 * upper vnode to ensure that the filesystem keeps
793 * its references counts right. This doesn't do
794 * the right thing with (cred) and (FREAD) though.
795 * Ignoring error returns is not right, either.
800 for (i = 0; i < un->un_openl; i++) {
801 (void) VOP_CLOSE(lvp, FREAD, cred, p);
802 (void) VOP_OPEN(uvp, FREAD, cred, p);
805 if (vn_canvmio(uvp) == TRUE)
806 error = vfs_object_create(uvp, p, cred);
818 * dvp should be locked on entry and will be locked on return. No
819 * net change in the ref count will occur.
821 * If an error is returned, *vpp will be invalid, otherwise it
822 * will hold a locked, referenced vnode. If *vpp == dvp then
823 * remember that only one exclusive lock is held.
827 union_relookup(um, dvp, vpp, cnp, cn, path, pathlen)
828 struct union_mount *um;
831 struct componentname *cnp;
832 struct componentname *cn;
839 * A new componentname structure must be faked up because
840 * there is no way to know where the upper level cnp came
841 * from or what it is being used for. This must duplicate
842 * some of the work done by NDINIT, some of the work done
843 * by namei, some of the work done by lookup and some of
844 * the work done by VOP_LOOKUP when given a CREATE flag.
845 * Conclusion: Horrible.
847 cn->cn_namelen = pathlen;
848 cn->cn_pnbuf = zalloc(namei_zone);
849 bcopy(path, cn->cn_pnbuf, cn->cn_namelen);
850 cn->cn_pnbuf[cn->cn_namelen] = '\0';
852 cn->cn_nameiop = CREATE;
853 cn->cn_flags = (LOCKPARENT|LOCKLEAF|HASBUF|SAVENAME|ISLASTCN);
854 cn->cn_proc = cnp->cn_proc;
855 if (um->um_op == UNMNT_ABOVE)
856 cn->cn_cred = cnp->cn_cred;
858 cn->cn_cred = um->um_cred;
859 cn->cn_nameptr = cn->cn_pnbuf;
860 cn->cn_consume = cnp->cn_consume;
863 VOP_UNLOCK(dvp, 0, cnp->cn_proc);
866 * Pass dvp unlocked and referenced on call to relookup().
868 * If an error occurs, dvp will be returned unlocked and dereferenced.
871 if ((error = relookup(dvp, vpp, cn)) != 0) {
872 vn_lock(dvp, LK_EXCLUSIVE | LK_RETRY, cnp->cn_proc);
877 * If no error occurs, dvp will be returned locked with the reference
878 * left as before, and vpp will be returned referenced and locked.
880 * We want to return with dvp as it was passed to us, so we get
881 * rid of our reference.
888 * Create a shadow directory in the upper layer.
889 * The new vnode is returned locked.
891 * (um) points to the union mount structure for access to the
892 * the mounting process's credentials.
893 * (dvp) is the directory in which to create the shadow directory,
894 * it is locked (but not ref'd) on entry and return.
895 * (cnp) is the componentname to be created.
896 * (vpp) is the returned newly created shadow directory, which
897 * is returned locked and ref'd
900 union_mkshadow(um, dvp, cnp, vpp)
901 struct union_mount *um;
903 struct componentname *cnp;
908 struct proc *p = cnp->cn_proc;
909 struct componentname cn;
911 error = union_relookup(um, dvp, vpp, cnp, &cn,
912 cnp->cn_nameptr, cnp->cn_namelen);
917 if (cn.cn_flags & HASBUF) {
918 zfree(namei_zone, cn.cn_pnbuf);
919 cn.cn_flags &= ~HASBUF;
930 * policy: when creating the shadow directory in the
931 * upper layer, create it owned by the user who did
932 * the mount, group from parent directory, and mode
933 * 777 modified by umask (ie mostly identical to the
934 * mkdir syscall). (jsp, kb)
939 va.va_mode = um->um_cmode;
941 /* VOP_LEASE: dvp is locked */
942 VOP_LEASE(dvp, p, cn.cn_cred, LEASE_WRITE);
944 error = VOP_MKDIR(dvp, vpp, &cn, &va);
945 if (cn.cn_flags & HASBUF) {
946 zfree(namei_zone, cn.cn_pnbuf);
947 cn.cn_flags &= ~HASBUF;
954 * Create a whiteout entry in the upper layer.
956 * (um) points to the union mount structure for access to the
957 * the mounting process's credentials.
958 * (dvp) is the directory in which to create the whiteout.
959 * it is locked on entry and return.
960 * (cnp) is the componentname to be created.
963 union_mkwhiteout(um, dvp, cnp, path)
964 struct union_mount *um;
966 struct componentname *cnp;
970 struct proc *p = cnp->cn_proc;
972 struct componentname cn;
974 error = union_relookup(um, dvp, &wvp, cnp, &cn, path, strlen(path));
979 if (cn.cn_flags & HASBUF) {
980 zfree(namei_zone, cn.cn_pnbuf);
981 cn.cn_flags &= ~HASBUF;
990 /* VOP_LEASE: dvp is locked */
991 VOP_LEASE(dvp, p, p->p_ucred, LEASE_WRITE);
993 error = VOP_WHITEOUT(dvp, &cn, CREATE);
994 if (cn.cn_flags & HASBUF) {
995 zfree(namei_zone, cn.cn_pnbuf);
996 cn.cn_flags &= ~HASBUF;
1002 * union_vn_create: creates and opens a new shadow file
1003 * on the upper union layer. this function is similar
1004 * in spirit to calling vn_open but it avoids calling namei().
1005 * the problem with calling namei is that a) it locks too many
1006 * things, and b) it doesn't start at the "right" directory,
1007 * whereas relookup is told where to start.
1009 * On entry, the vnode associated with un is locked. It remains locked
1012 * If no error occurs, *vpp contains a locked referenced vnode for your
1013 * use. If an error occurs *vpp iis undefined.
1016 union_vn_create(vpp, un, p)
1018 struct union_node *un;
1022 struct ucred *cred = p->p_ucred;
1024 struct vattr *vap = &vat;
1025 int fmode = FFLAGS(O_WRONLY|O_CREAT|O_TRUNC|O_EXCL);
1027 int cmode = UN_FILEMODE & ~p->p_fd->fd_cmask;
1028 struct componentname cn;
1033 * Build a new componentname structure (for the same
1034 * reasons outlines in union_mkshadow).
1035 * The difference here is that the file is owned by
1036 * the current user, rather than by the person who
1037 * did the mount, since the current user needs to be
1038 * able to write the file (that's why it is being
1039 * copied in the first place).
1041 cn.cn_namelen = strlen(un->un_path);
1042 cn.cn_pnbuf = zalloc(namei_zone);
1043 bcopy(un->un_path, cn.cn_pnbuf, cn.cn_namelen+1);
1044 cn.cn_nameiop = CREATE;
1045 cn.cn_flags = (LOCKPARENT|LOCKLEAF|HASBUF|SAVENAME|ISLASTCN);
1047 cn.cn_cred = p->p_ucred;
1048 cn.cn_nameptr = cn.cn_pnbuf;
1052 * Pass dvp unlocked and referenced on call to relookup().
1054 * If an error occurs, dvp will be returned unlocked and dereferenced.
1057 error = relookup(un->un_dirvp, &vp, &cn);
1062 * If no error occurs, dvp will be returned locked with the reference
1063 * left as before, and vpp will be returned referenced and locked.
1067 if (cn.cn_flags & HASBUF) {
1068 zfree(namei_zone, cn.cn_pnbuf);
1069 cn.cn_flags &= ~HASBUF;
1071 if (vp == un->un_dirvp)
1079 * Good - there was no race to create the file
1080 * so go ahead and create it. The permissions
1081 * on the file will be 0666 modified by the
1082 * current user's umask. Access to the file, while
1083 * it is unioned, will require access to the top *and*
1084 * bottom files. Access when not unioned will simply
1085 * require access to the top-level file.
1086 * TODO: confirm choice of access permissions.
1089 vap->va_type = VREG;
1090 vap->va_mode = cmode;
1091 VOP_LEASE(un->un_dirvp, p, cred, LEASE_WRITE);
1092 error = VOP_CREATE(un->un_dirvp, &vp, &cn, vap);
1093 if (cn.cn_flags & HASBUF) {
1094 zfree(namei_zone, cn.cn_pnbuf);
1095 cn.cn_flags &= ~HASBUF;
1101 error = VOP_OPEN(vp, fmode, cred, p);
1102 if (error == 0 && vn_canvmio(vp) == TRUE)
1103 error = vfs_object_create(vp, p, cred);
1114 union_vn_close(vp, fmode, cred, p)
1123 return (VOP_CLOSE(vp, fmode, cred, p));
1129 * union_removed_upper:
1131 * called with union_node unlocked. XXX
1135 union_removed_upper(un)
1136 struct union_node *un;
1138 struct proc *p = curproc; /* XXX */
1142 * Do not set the uppervp to NULLVP. If lowervp is NULLVP,
1143 * union node will have neither uppervp nor lowervp. We remove
1144 * the union node from cache, so that it will not be referrenced.
1146 union_newupper(un, NULLVP);
1147 if (un->un_dircache != 0) {
1148 for (vpp = un->un_dircache; *vpp != NULLVP; vpp++)
1150 free(un->un_dircache, M_TEMP);
1151 un->un_dircache = 0;
1154 if (un->un_flags & UN_CACHED) {
1155 un->un_flags &= ~UN_CACHED;
1156 LIST_REMOVE(un, un_cache);
1163 * determine whether a whiteout is needed
1164 * during a remove/rmdir operation.
1167 union_dowhiteout(un, cred, p)
1168 struct union_node *un;
1174 if (un->un_lowervp != NULLVP)
1177 if (VOP_GETATTR(un->un_uppervp, &va, cred, p) == 0 &&
1178 (va.va_flags & OPAQUE))
1185 union_dircache_r(vp, vppp, cntp)
1187 struct vnode ***vppp;
1190 struct union_node *un;
1192 if (vp->v_op != union_vnodeop_p) {
1197 panic("union: dircache table too small");
1206 if (un->un_uppervp != NULLVP)
1207 union_dircache_r(un->un_uppervp, vppp, cntp);
1208 if (un->un_lowervp != NULLVP)
1209 union_dircache_r(un->un_lowervp, vppp, cntp);
1213 union_dircache(vp, p)
1220 struct vnode **dircache;
1221 struct union_node *un;
1224 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY, p);
1225 dircache = VTOUNION(vp)->un_dircache;
1229 if (dircache == NULL) {
1231 union_dircache_r(vp, 0, &cnt);
1233 dircache = malloc(cnt * sizeof(struct vnode *),
1236 union_dircache_r(vp, &vpp, &cnt);
1242 if (*vpp++ == VTOUNION(vp)->un_uppervp)
1244 } while (*vpp != NULLVP);
1250 /*vn_lock(*vpp, LK_EXCLUSIVE | LK_RETRY, p);*/
1251 UDEBUG(("ALLOCVP-3 %p ref %d\n", *vpp, (*vpp ? (*vpp)->v_usecount : -99)));
1253 error = union_allocvp(&nvp, vp->v_mount, NULLVP, NULLVP, NULL, *vpp, NULLVP, 0);
1254 UDEBUG(("ALLOCVP-3B %p ref %d\n", nvp, (*vpp ? (*vpp)->v_usecount : -99)));
1258 VTOUNION(vp)->un_dircache = 0;
1260 un->un_dircache = dircache;
1263 VOP_UNLOCK(vp, 0, p);
1268 * Guarentee coherency with the VM cache by invalidating any clean VM pages
1269 * associated with this write and updating any dirty VM pages. Since our
1270 * vnode is locked, other processes will not be able to read the pages in
1271 * again until after our write completes.
1273 * We also have to be coherent with reads, by flushing any pending dirty
1274 * pages prior to issuing the read.
1276 * XXX this is somewhat of a hack at the moment. To support this properly
1277 * we would have to be able to run VOP_READ and VOP_WRITE through the VM
1278 * cache. Then we wouldn't need to worry about coherency.
1282 union_vm_coherency(struct vnode *vp, struct uio *uio, int cleanfls)
1289 if ((object = vp->v_object) == NULL)
1292 pgoff = uio->uio_offset & PAGE_MASK;
1293 pstart = uio->uio_offset / PAGE_SIZE;
1294 pend = pstart + (uio->uio_resid + pgoff + PAGE_MASK) / PAGE_SIZE;
1296 vm_object_page_clean(object, pstart, pend, OBJPC_SYNC);
1298 vm_object_page_remove(object, pstart, pend, TRUE);
1302 * Module glue to remove #ifdef UNION from vfs_syscalls.c
1305 union_dircheck(struct proc *p, struct vnode **vp, struct file *fp)
1309 if ((*vp)->v_op == union_vnodeop_p) {
1312 lvp = union_dircache(*vp, p);
1313 if (lvp != NULLVP) {
1317 * If the directory is opaque,
1318 * then don't show lower entries
1320 error = VOP_GETATTR(*vp, &va, fp->f_cred, p);
1321 if (va.va_flags & OPAQUE) {
1327 if (lvp != NULLVP) {
1328 error = VOP_OPEN(lvp, FREAD, fp->f_cred, p);
1329 if (error == 0 && vn_canvmio(lvp) == TRUE)
1330 error = vfs_object_create(lvp, p, fp->f_cred);
1335 VOP_UNLOCK(lvp, 0, p);
1336 fp->f_data = (caddr_t) lvp;
1338 error = vn_close(*vp, FREAD, fp->f_cred, p);
1342 return -1; /* goto unionread */
1349 union_modevent(module_t mod, int type, void *data)
1353 union_dircheckp = union_dircheck;
1356 union_dircheckp = NULL;
1364 static moduledata_t union_mod = {
1370 DECLARE_MODULE(union_dircheck, union_mod, SI_SUB_VFS, SI_ORDER_ANY);