Lines Matching refs:lowervp
189 * The lowervp, if not NULL, must be referenced.
191 * If uppervp and lowervp match pointers already installed, then
201 struct vnode *lowervp)
204 int nhash = UNION_HASH(uppervp, lowervp);
205 int docache = (lowervp != NULLVP || uppervp != NULLVP);
241 if (un->un_lowervp != lowervp) {
246 un->un_lowervp = lowervp;
264 un->un_lowervp = lowervp;
265 if (lowervp != NULLVP)
266 un->un_lowervid = vnode_vid(lowervp);
294 * Set a new lowervp. The passed lowervp must be referenced and will be
300 union_newlower(un, lowervp)
302 struct vnode *lowervp;
304 union_updatevp(un, un->un_uppervp, lowervp);
377 * XXX may only be used to traverse an uncopied lowervp-based
385 * lowervp when uppervp does not exist.
394 * lowervp Holds the new lowervp vnode to be stored in the
395 * union_node we are allocating. lowervp is referenced but
399 * lowervp and upperdvp to allow unionfs to create an uppervp
400 * later on. Only used if lowervp is valid. The contents
433 struct vnode *lowervp,
447 if (uppervp == NULLVP && lowervp == NULLVP)
452 * consider lowervp as NULL
454 if (uppervp && lowervp && (uppervp->v_type != lowervp->v_type)) {
455 xlowervp = lowervp;
456 lowervp = NULLVP;
462 ((lowervp == NULLVP) || lowervp == um->um_lowervp)) {
463 if (lowervp == NULLVP) {
464 lowervp = um->um_lowervp;
465 if (lowervp != NULLVP) {
467 vnode_get(lowervp);
480 if (lowervp == NULLVP)
482 hash = UNION_HASH(uppervp, lowervp);
492 if (lowervp == NULLVP)
495 hash = UNION_HASH(NULLVP, lowervp);
504 if ((un->un_lowervp == lowervp ||
573 if (lowervp != un->un_lowervp) {
574 union_newlower(un, lowervp);
575 if (cnp && (lowervp != NULLVP)) {
587 } else if (lowervp) {
589 vnode_put(lowervp);
606 hash = UNION_HASH(uppervp, lowervp);
622 un->un_lowervp = lowervp;
623 if (lowervp != NULLVP)
624 un->un_lowervid = vnode_vid(lowervp);
650 vtype = lowervp->v_type;
672 if (lowervp)
673 vnode_put(lowervp);
688 if (cnp && (lowervp != NULLVP)) {