Lines Matching defs:lf_next

62  * lf_next is used for two purposes, depending on whether the lock is
65  * For pending locks, if lock->lf_next is non-NULL, then lock->lf_block
66  * must be queued on the lf_blkhd TAILQ of lock->lf_next.
79 	struct	lockf *lf_next;	 /* Next lock on this vnode, or blocking lock */
160 	for (lf = *lock->lf_head; lf; lf = lf->lf_next) {
251 			*prev = &lf->lf_next;
252 			*overlap = lf = lf->lf_next;
279 			*prev = &lf->lf_next;
280 			*overlap = lf = lf->lf_next;
355 		lock2->lf_next = lock1;
360 		lock2->lf_next = lock1->lf_next;
361 		lock1->lf_next = lock2;
380 	splitlock->lf_next = lock1->lf_next;
381 	lock2->lf_next = splitlock;
382 	lock1->lf_next = lock2;
394 		KASSERT(wakelock->lf_next == listhead);
396 		wakelock->lf_next = NULL;
438 			*prev = overlap->lf_next;
448 			overlap->lf_next = unlock->lf_next;
452 			*prev = overlap->lf_next;
453 			lf = overlap->lf_next;
459 			prev = &overlap->lf_next;
460 			lf = overlap->lf_next;
496 		lf = overlap->lf_next;
566 				waitblock = waitblock->lf_next;
600 		lock->lf_next = block;
616 		 * lf_next field set to NULL).
618 		if (lock->lf_next != NULL) {
619 			TAILQ_REMOVE(&lock->lf_next->lf_blkhd, lock, lf_block);
620 			lock->lf_next = NULL;
641 			block = overlap->lf_next;
655 				lock->lf_next = overlap;
683 				lock->lf_next = overlap;
702 					KASSERT(ltmp->lf_next == overlap);
705 					ltmp->lf_next = lock;
716 				lock->lf_next = overlap->lf_next;
717 				prev = &lock->lf_next;
720 				*prev = overlap->lf_next;
728 			lock->lf_next = overlap->lf_next;
729 			overlap->lf_next = lock;
731 			prev = &lock->lf_next;
742 				lock->lf_next = overlap;
921 	lock->lf_next = (struct lockf *)0;