sys/kern/kern_lockf.c

12  *    notice, this list of conditions and the following disclaimer.
14  *    notice, this list of conditions and the following disclaimer in the
40  *    notice, this list of conditions and the following disclaimer.
42  *    notice, this list of conditions and the following disclaimer in the
211 	struct lock_owner_list	list;
250 	LIST_ENTRY(owner_edge) e_outlink; /* (g) link from's out-edge list */
251 	LIST_ENTRY(owner_edge) e_inlink;  /* (g) link to's in-edge list */
262 	struct owner_edge_list v_outedges;/* (g) list of out-edges */
263 	struct owner_edge_list v_inedges; /* (g) list of in-edges */
292 		LIST_INIT(&lf_lock_owners[i].list);
502 	LIST_FOREACH(lo, &lf_lock_owners[hash].list, lo_link)
543 		LIST_INSERT_HEAD(&lf_lock_owners[hash].list, lo, lo_link);
704 	 * lock list becoming disordered or containing mutually
705 	 * blocking locks. We also check the pending list for locks
868  * Allocate a lock edge from the free list
982  * Walk the list of locks for the file and create an out-going edge
993 		 * We may assume that the active list is sorted by
1050  * Walk the list of pending locks for the file and create an in-coming
1090  * Insert lock into the active list, keeping list entries ordered by
1115  * Wake up a sleeping lock and remove it from the pending list now
1117  * arrange for the lock to be added to the active list, adjusting any
1125 	 * Remove from ls_pending list and wake up the caller
1199  * Add a lock to the active list, updating or removing any current
1209  * add it to the list (unless its an unlock request). This may
1210  * fragment the lock list in some pathological cases but its probably
1277 				 * the next entry in the list.
1398 	 * Scan lock list for this file looking for locks that would block us.
1484 		 * the active list). We may also have been woken by
1491 		 * list) but before we resumed execution. In this
1492 		 * case, our lf_outedges list will be clear. We
1653  * Walk the list of locks for an inode and
1663 		 * We may assume that the active list is sorted by
1676  * Walk the list of locks for an inode to find an overlapping lock (if
1680  *	*overlap	The place in the lock list to start looking
1879 	 * active lock lists to build a list of locks that need
1941 	 * active lock lists to build a list of locks that need
2026 		LIST_FOREACH(lo, &lf_lock_owners[i].list, lo_link)
2403  * Allocate a vertex from the free list. Return ENOMEM if there are
2530 	printf("%s: Lock list for ino %ju on dev <%s>:\n",
2552 				panic("lf_printlist: bad list");