2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 2008 Isilon Inc http://www.isilon.com/
5 * Authors: Doug Rabson <dfr@rabson.org>
6 * Developed with Red Inc: Alfred Perlstein <alfred@freebsd.org>
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * Copyright (c) 1982, 1986, 1989, 1993
31 * The Regents of the University of California. All rights reserved.
33 * This code is derived from software contributed to Berkeley by
34 * Scooter Morris at Genentech Inc.
36 * Redistribution and use in source and binary forms, with or without
37 * modification, are permitted provided that the following conditions
39 * 1. Redistributions of source code must retain the above copyright
40 * notice, this list of conditions and the following disclaimer.
41 * 2. Redistributions in binary form must reproduce the above copyright
42 * notice, this list of conditions and the following disclaimer in the
43 * documentation and/or other materials provided with the distribution.
44 * 3. Neither the name of the University nor the names of its contributors
45 * may be used to endorse or promote products derived from this software
46 * without specific prior written permission.
48 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
49 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
50 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
51 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
52 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
53 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
54 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
55 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
56 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
57 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
60 * @(#)ufs_lockf.c 8.3 (Berkeley) 1/6/94
63 #include <sys/cdefs.h>
64 __FBSDID("$FreeBSD$");
66 #include "opt_debug_lockf.h"
68 #include <sys/param.h>
69 #include <sys/systm.h>
71 #include <sys/kernel.h>
72 #include <sys/limits.h>
74 #include <sys/mount.h>
75 #include <sys/mutex.h>
78 #include <sys/unistd.h>
79 #include <sys/vnode.h>
80 #include <sys/malloc.h>
81 #include <sys/fcntl.h>
82 #include <sys/lockf.h>
83 #include <sys/taskqueue.h>
86 #include <sys/sysctl.h>
88 #include <ufs/ufs/extattr.h>
89 #include <ufs/ufs/quota.h>
90 #include <ufs/ufs/ufsmount.h>
91 #include <ufs/ufs/inode.h>
93 static int lockf_debug = 0; /* control debug output */
94 SYSCTL_INT(_debug, OID_AUTO, lockf_debug, CTLFLAG_RW, &lockf_debug, 0, "");
97 static MALLOC_DEFINE(M_LOCKF, "lockf", "Byte-range locking structures");
101 struct owner_vertex_list;
104 #define NOLOCKF (struct lockf_entry *)0
107 static void lf_init(void *);
108 static int lf_hash_owner(caddr_t, struct flock *, int);
109 static int lf_owner_matches(struct lock_owner *, caddr_t, struct flock *,
111 static struct lockf_entry *
112 lf_alloc_lock(struct lock_owner *);
113 static int lf_free_lock(struct lockf_entry *);
114 static int lf_clearlock(struct lockf *, struct lockf_entry *);
115 static int lf_overlaps(struct lockf_entry *, struct lockf_entry *);
116 static int lf_blocks(struct lockf_entry *, struct lockf_entry *);
117 static void lf_free_edge(struct lockf_edge *);
118 static struct lockf_edge *
120 static void lf_alloc_vertex(struct lockf_entry *);
121 static int lf_add_edge(struct lockf_entry *, struct lockf_entry *);
122 static void lf_remove_edge(struct lockf_edge *);
123 static void lf_remove_outgoing(struct lockf_entry *);
124 static void lf_remove_incoming(struct lockf_entry *);
125 static int lf_add_outgoing(struct lockf *, struct lockf_entry *);
126 static int lf_add_incoming(struct lockf *, struct lockf_entry *);
127 static int lf_findoverlap(struct lockf_entry **, struct lockf_entry *,
129 static struct lockf_entry *
130 lf_getblock(struct lockf *, struct lockf_entry *);
131 static int lf_getlock(struct lockf *, struct lockf_entry *, struct flock *);
132 static void lf_insert_lock(struct lockf *, struct lockf_entry *);
133 static void lf_wakeup_lock(struct lockf *, struct lockf_entry *);
134 static void lf_update_dependancies(struct lockf *, struct lockf_entry *,
135 int all, struct lockf_entry_list *);
136 static void lf_set_start(struct lockf *, struct lockf_entry *, off_t,
137 struct lockf_entry_list*);
138 static void lf_set_end(struct lockf *, struct lockf_entry *, off_t,
139 struct lockf_entry_list*);
140 static int lf_setlock(struct lockf *, struct lockf_entry *,
141 struct vnode *, void **cookiep);
142 static int lf_cancel(struct lockf *, struct lockf_entry *, void *);
143 static void lf_split(struct lockf *, struct lockf_entry *,
144 struct lockf_entry *, struct lockf_entry_list *);
146 static int graph_reaches(struct owner_vertex *x, struct owner_vertex *y,
147 struct owner_vertex_list *path);
148 static void graph_check(struct owner_graph *g, int checkorder);
149 static void graph_print_vertices(struct owner_vertex_list *set);
151 static int graph_delta_forward(struct owner_graph *g,
152 struct owner_vertex *x, struct owner_vertex *y,
153 struct owner_vertex_list *delta);
154 static int graph_delta_backward(struct owner_graph *g,
155 struct owner_vertex *x, struct owner_vertex *y,
156 struct owner_vertex_list *delta);
157 static int graph_add_indices(int *indices, int n,
158 struct owner_vertex_list *set);
159 static int graph_assign_indices(struct owner_graph *g, int *indices,
160 int nextunused, struct owner_vertex_list *set);
161 static int graph_add_edge(struct owner_graph *g,
162 struct owner_vertex *x, struct owner_vertex *y);
163 static void graph_remove_edge(struct owner_graph *g,
164 struct owner_vertex *x, struct owner_vertex *y);
165 static struct owner_vertex *graph_alloc_vertex(struct owner_graph *g,
166 struct lock_owner *lo);
167 static void graph_free_vertex(struct owner_graph *g,
168 struct owner_vertex *v);
169 static struct owner_graph * graph_init(struct owner_graph *g);
171 static void lf_print(char *, struct lockf_entry *);
172 static void lf_printlist(char *, struct lockf_entry *);
173 static void lf_print_owner(struct lock_owner *);
177 * This structure is used to keep track of both local and remote lock
178 * owners. The lf_owner field of the struct lockf_entry points back at
179 * the lock owner structure. Each possible lock owner (local proc for
180 * POSIX fcntl locks, local file for BSD flock locks or <pid,sysid>
181 * pair for remote locks) is represented by a unique instance of
184 * If a lock owner has a lock that blocks some other lock or a lock
185 * that is waiting for some other lock, it also has a vertex in the
189 * (s) locked by state->ls_lock
190 * (S) locked by lf_lock_states_lock
191 * (g) locked by lf_owner_graph_lock
192 * (c) const until freeing
194 #define LOCK_OWNER_HASH_SIZE 256
197 LIST_ENTRY(lock_owner) lo_link; /* (l) hash chain */
198 int lo_refs; /* (l) Number of locks referring to this */
199 int lo_flags; /* (c) Flags passwd to lf_advlock */
200 caddr_t lo_id; /* (c) Id value passed to lf_advlock */
201 pid_t lo_pid; /* (c) Process Id of the lock owner */
202 int lo_sysid; /* (c) System Id of the lock owner */
203 int lo_hash; /* (c) Used to lock the appropriate chain */
204 struct owner_vertex *lo_vertex; /* (g) entry in deadlock graph */
207 LIST_HEAD(lock_owner_list, lock_owner);
209 struct lock_owner_chain {
211 struct lock_owner_list list;
214 static struct sx lf_lock_states_lock;
215 static struct lockf_list lf_lock_states; /* (S) */
216 static struct lock_owner_chain lf_lock_owners[LOCK_OWNER_HASH_SIZE];
219 * Structures for deadlock detection.
221 * We have two types of directed graph, the first is the set of locks,
222 * both active and pending on a vnode. Within this graph, active locks
223 * are terminal nodes in the graph (i.e. have no out-going
224 * edges). Pending locks have out-going edges to each blocking active
225 * lock that prevents the lock from being granted and also to each
226 * older pending lock that would block them if it was active. The
227 * graph for each vnode is naturally acyclic; new edges are only ever
228 * added to or from new nodes (either new pending locks which only add
229 * out-going edges or new active locks which only add in-coming edges)
230 * therefore they cannot create loops in the lock graph.
232 * The second graph is a global graph of lock owners. Each lock owner
233 * is a vertex in that graph and an edge is added to the graph
234 * whenever an edge is added to a vnode graph, with end points
235 * corresponding to owner of the new pending lock and the owner of the
236 * lock upon which it waits. In order to prevent deadlock, we only add
237 * an edge to this graph if the new edge would not create a cycle.
239 * The lock owner graph is topologically sorted, i.e. if a node has
240 * any outgoing edges, then it has an order strictly less than any
241 * node to which it has an outgoing edge. We preserve this ordering
242 * (and detect cycles) on edge insertion using Algorithm PK from the
243 * paper "A Dynamic Topological Sort Algorithm for Directed Acyclic
244 * Graphs" (ACM Journal of Experimental Algorithms, Vol 11, Article
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 */
252 int e_refs; /* (g) number of times added */
253 struct owner_vertex *e_from; /* (c) out-going from here */
254 struct owner_vertex *e_to; /* (c) in-coming to here */
256 LIST_HEAD(owner_edge_list, owner_edge);
258 struct owner_vertex {
259 TAILQ_ENTRY(owner_vertex) v_link; /* (g) workspace for edge insertion */
260 uint32_t v_gen; /* (g) workspace for edge insertion */
261 int v_order; /* (g) order of vertex in graph */
262 struct owner_edge_list v_outedges;/* (g) list of out-edges */
263 struct owner_edge_list v_inedges; /* (g) list of in-edges */
264 struct lock_owner *v_owner; /* (c) corresponding lock owner */
266 TAILQ_HEAD(owner_vertex_list, owner_vertex);
269 struct owner_vertex** g_vertices; /* (g) pointers to vertices */
270 int g_size; /* (g) number of vertices */
271 int g_space; /* (g) space allocated for vertices */
272 int *g_indexbuf; /* (g) workspace for loop detection */
273 uint32_t g_gen; /* (g) increment when re-ordering */
276 static struct sx lf_owner_graph_lock;
277 static struct owner_graph lf_owner_graph;
280 * Initialise various structures and locks.
287 sx_init(&lf_lock_states_lock, "lock states lock");
288 LIST_INIT(&lf_lock_states);
290 for (i = 0; i < LOCK_OWNER_HASH_SIZE; i++) {
291 sx_init(&lf_lock_owners[i].lock, "lock owners lock");
292 LIST_INIT(&lf_lock_owners[i].list);
295 sx_init(&lf_owner_graph_lock, "owner graph lock");
296 graph_init(&lf_owner_graph);
298 SYSINIT(lf_init, SI_SUB_LOCK, SI_ORDER_FIRST, lf_init, NULL);
301 * Generate a hash value for a lock owner.
304 lf_hash_owner(caddr_t id, struct flock *fl, int flags)
308 if (flags & F_REMOTE) {
309 h = HASHSTEP(0, fl->l_pid);
310 h = HASHSTEP(h, fl->l_sysid);
311 } else if (flags & F_FLOCK) {
312 h = ((uintptr_t) id) >> 7;
314 struct proc *p = (struct proc *) id;
315 h = HASHSTEP(0, p->p_pid);
319 return (h % LOCK_OWNER_HASH_SIZE);
323 * Return true if a lock owner matches the details passed to
327 lf_owner_matches(struct lock_owner *lo, caddr_t id, struct flock *fl,
330 if (flags & F_REMOTE) {
331 return lo->lo_pid == fl->l_pid
332 && lo->lo_sysid == fl->l_sysid;
334 return lo->lo_id == id;
338 static struct lockf_entry *
339 lf_alloc_lock(struct lock_owner *lo)
341 struct lockf_entry *lf;
343 lf = malloc(sizeof(struct lockf_entry), M_LOCKF, M_WAITOK|M_ZERO);
347 printf("Allocated lock %p\n", lf);
350 sx_xlock(&lf_lock_owners[lo->lo_hash].lock);
352 sx_xunlock(&lf_lock_owners[lo->lo_hash].lock);
360 lf_free_lock(struct lockf_entry *lock)
362 struct sx *chainlock;
364 KASSERT(lock->lf_refs > 0, ("lockf_entry negative ref count %p", lock));
365 if (--lock->lf_refs > 0)
368 * Adjust the lock_owner reference count and
369 * reclaim the entry if this is the last lock
372 struct lock_owner *lo = lock->lf_owner;
374 KASSERT(LIST_EMPTY(&lock->lf_outedges),
375 ("freeing lock with dependencies"));
376 KASSERT(LIST_EMPTY(&lock->lf_inedges),
377 ("freeing lock with dependants"));
378 chainlock = &lf_lock_owners[lo->lo_hash].lock;
380 KASSERT(lo->lo_refs > 0, ("lock owner refcount"));
382 if (lo->lo_refs == 0) {
385 printf("lf_free_lock: freeing lock owner %p\n",
389 sx_xlock(&lf_owner_graph_lock);
390 graph_free_vertex(&lf_owner_graph,
392 sx_xunlock(&lf_owner_graph_lock);
394 LIST_REMOVE(lo, lo_link);
398 printf("Freed lock owner %p\n", lo);
401 sx_unlock(chainlock);
403 if ((lock->lf_flags & F_REMOTE) && lock->lf_vnode) {
404 vrele(lock->lf_vnode);
405 lock->lf_vnode = NULL;
409 printf("Freed lock %p\n", lock);
416 * Advisory record locking support
419 lf_advlockasync(struct vop_advlockasync_args *ap, struct lockf **statep,
423 struct flock *fl = ap->a_fl;
424 struct lockf_entry *lock;
425 struct vnode *vp = ap->a_vp;
426 caddr_t id = ap->a_id;
427 int flags = ap->a_flags;
429 struct lock_owner *lo;
430 off_t start, end, oadd;
434 * Handle the F_UNLKSYS case first - no need to mess about
435 * creating a lock owner for this one.
437 if (ap->a_op == F_UNLCKSYS) {
438 lf_clearremotesys(fl->l_sysid);
443 * Convert the flock structure into a start and end.
445 switch (fl->l_whence) {
450 * Caller is responsible for adding any necessary offset
451 * when SEEK_CUR is used.
457 if (size > OFF_MAX ||
458 (fl->l_start > 0 && size > OFF_MAX - fl->l_start))
460 start = size + fl->l_start;
475 } else if (fl->l_len == 0) {
478 oadd = fl->l_len - 1;
479 if (oadd > OFF_MAX - start)
487 * Avoid the common case of unlocking when inode has no locks.
489 if (ap->a_op != F_SETLK && (*statep) == NULL) {
491 if ((*statep) == NULL) {
492 fl->l_type = F_UNLCK;
500 * Map our arguments to an existing lock owner or create one
501 * if this is the first time we have seen this owner.
503 hash = lf_hash_owner(id, fl, flags);
504 sx_xlock(&lf_lock_owners[hash].lock);
505 LIST_FOREACH(lo, &lf_lock_owners[hash].list, lo_link)
506 if (lf_owner_matches(lo, id, fl, flags))
510 * We initialise the lock with a reference
511 * count which matches the new lockf_entry
512 * structure created below.
514 lo = malloc(sizeof(struct lock_owner), M_LOCKF,
518 printf("Allocated lock owner %p\n", lo);
522 lo->lo_flags = flags;
525 if (flags & F_REMOTE) {
526 lo->lo_pid = fl->l_pid;
527 lo->lo_sysid = fl->l_sysid;
528 } else if (flags & F_FLOCK) {
532 struct proc *p = (struct proc *) id;
533 lo->lo_pid = p->p_pid;
536 lo->lo_vertex = NULL;
539 if (lockf_debug & 1) {
540 printf("lf_advlockasync: new lock owner %p ", lo);
546 LIST_INSERT_HEAD(&lf_lock_owners[hash].list, lo, lo_link);
549 * We have seen this lock owner before, increase its
550 * reference count to account for the new lockf_entry
551 * structure we create below.
555 sx_xunlock(&lf_lock_owners[hash].lock);
558 * Create the lockf structure. We initialise the lf_owner
559 * field here instead of in lf_alloc_lock() to avoid paying
560 * the lf_lock_owners_lock tax twice.
562 lock = lf_alloc_lock(NULL);
564 lock->lf_start = start;
568 if (flags & F_REMOTE) {
570 * For remote locks, the caller may release its ref to
571 * the vnode at any time - we have to ref it here to
572 * prevent it from being recycled unexpectedly.
578 * XXX The problem is that VTOI is ufs specific, so it will
579 * break LOCKF_DEBUG for all other FS's other than UFS because
580 * it casts the vnode->data ptr to struct inode *.
582 /* lock->lf_inode = VTOI(ap->a_vp); */
583 lock->lf_inode = (struct inode *)0;
584 lock->lf_type = fl->l_type;
585 LIST_INIT(&lock->lf_outedges);
586 LIST_INIT(&lock->lf_inedges);
587 lock->lf_async_task = ap->a_task;
588 lock->lf_flags = ap->a_flags;
591 * Do the requested operation. First find our state structure
592 * and create a new one if necessary - the caller's *statep
593 * variable and the state's ls_threads count is protected by
594 * the vnode interlock.
597 if (vp->v_iflag & VI_DOOMED) {
604 * Allocate a state structure if necessary.
612 ls = malloc(sizeof(struct lockf), M_LOCKF, M_WAITOK|M_ZERO);
613 sx_init(&ls->ls_lock, "ls_lock");
614 LIST_INIT(&ls->ls_active);
615 LIST_INIT(&ls->ls_pending);
618 sx_xlock(&lf_lock_states_lock);
619 LIST_INSERT_HEAD(&lf_lock_states, ls, ls_link);
620 sx_xunlock(&lf_lock_states_lock);
623 * Cope if we lost a race with some other thread while
624 * trying to allocate memory.
627 if (vp->v_iflag & VI_DOOMED) {
629 sx_xlock(&lf_lock_states_lock);
630 LIST_REMOVE(ls, ls_link);
631 sx_xunlock(&lf_lock_states_lock);
632 sx_destroy(&ls->ls_lock);
637 if ((*statep) == NULL) {
638 state = *statep = ls;
645 sx_xlock(&lf_lock_states_lock);
646 LIST_REMOVE(ls, ls_link);
647 sx_xunlock(&lf_lock_states_lock);
648 sx_destroy(&ls->ls_lock);
656 sx_xlock(&state->ls_lock);
658 * Recheck the doomed vnode after state->ls_lock is
659 * locked. lf_purgelocks() requires that no new threads add
660 * pending locks when vnode is marked by VI_DOOMED flag.
663 if (vp->v_iflag & VI_DOOMED) {
667 sx_xunlock(&state->ls_lock);
675 error = lf_setlock(state, lock, vp, ap->a_cookiep);
679 error = lf_clearlock(state, lock);
684 error = lf_getlock(state, lock, fl);
690 error = lf_cancel(state, lock, *ap->a_cookiep);
704 * Check for some can't happen stuff. In this case, the active
705 * lock list becoming disordered or containing mutually
706 * blocking locks. We also check the pending list for locks
707 * which should be active (i.e. have no out-going edges).
709 LIST_FOREACH(lock, &state->ls_active, lf_link) {
710 struct lockf_entry *lf;
711 if (LIST_NEXT(lock, lf_link))
712 KASSERT((lock->lf_start
713 <= LIST_NEXT(lock, lf_link)->lf_start),
714 ("locks disordered"));
715 LIST_FOREACH(lf, &state->ls_active, lf_link) {
718 KASSERT(!lf_blocks(lock, lf),
719 ("two conflicting active locks"));
720 if (lock->lf_owner == lf->lf_owner)
721 KASSERT(!lf_overlaps(lock, lf),
722 ("two overlapping locks from same owner"));
725 LIST_FOREACH(lock, &state->ls_pending, lf_link) {
726 KASSERT(!LIST_EMPTY(&lock->lf_outedges),
727 ("pending lock which should be active"));
730 sx_xunlock(&state->ls_lock);
735 if (LIST_EMPTY(&state->ls_active) && state->ls_threads == 0) {
736 KASSERT(LIST_EMPTY(&state->ls_pending),
737 ("freeable state with pending locks"));
744 if (error == EDOOFUS) {
745 KASSERT(ap->a_op == F_SETLK, ("EDOOFUS"));
752 lf_advlock(struct vop_advlock_args *ap, struct lockf **statep, u_quad_t size)
754 struct vop_advlockasync_args a;
760 a.a_flags = ap->a_flags;
764 return (lf_advlockasync(&a, statep, size));
768 lf_purgelocks(struct vnode *vp, struct lockf **statep)
771 struct lockf_entry *lock, *nlock;
774 * For this to work correctly, the caller must ensure that no
775 * other threads enter the locking system for this vnode,
776 * e.g. by checking VI_DOOMED. We wake up any threads that are
777 * sleeping waiting for locks on this vnode and then free all
778 * the remaining locks.
781 KASSERT(vp->v_iflag & VI_DOOMED,
782 ("lf_purgelocks: vp %p has not vgone yet", vp));
789 if (LIST_EMPTY(&state->ls_active) && state->ls_threads == 0) {
790 KASSERT(LIST_EMPTY(&state->ls_pending),
791 ("freeing state with pending locks"));
798 sx_xlock(&state->ls_lock);
799 sx_xlock(&lf_owner_graph_lock);
800 LIST_FOREACH_SAFE(lock, &state->ls_pending, lf_link, nlock) {
801 LIST_REMOVE(lock, lf_link);
802 lf_remove_outgoing(lock);
803 lf_remove_incoming(lock);
806 * If its an async lock, we can just free it
807 * here, otherwise we let the sleeping thread
810 if (lock->lf_async_task) {
813 lock->lf_flags |= F_INTR;
817 sx_xunlock(&lf_owner_graph_lock);
818 sx_xunlock(&state->ls_lock);
821 * Wait for all other threads, sleeping and otherwise
825 while (state->ls_threads > 1)
826 msleep(state, VI_MTX(vp), 0, "purgelocks", 0);
830 * We can just free all the active locks since they
831 * will have no dependencies (we removed them all
832 * above). We don't need to bother locking since we
833 * are the last thread using this state structure.
835 KASSERT(LIST_EMPTY(&state->ls_pending),
836 ("lock pending for %p", state));
837 LIST_FOREACH_SAFE(lock, &state->ls_active, lf_link, nlock) {
838 LIST_REMOVE(lock, lf_link);
842 sx_xlock(&lf_lock_states_lock);
843 LIST_REMOVE(state, ls_link);
844 sx_xunlock(&lf_lock_states_lock);
845 sx_destroy(&state->ls_lock);
846 free(state, M_LOCKF);
850 * Return non-zero if locks 'x' and 'y' overlap.
853 lf_overlaps(struct lockf_entry *x, struct lockf_entry *y)
856 return (x->lf_start <= y->lf_end && x->lf_end >= y->lf_start);
860 * Return non-zero if lock 'x' is blocked by lock 'y' (or vice versa).
863 lf_blocks(struct lockf_entry *x, struct lockf_entry *y)
866 return x->lf_owner != y->lf_owner
867 && (x->lf_type == F_WRLCK || y->lf_type == F_WRLCK)
868 && lf_overlaps(x, y);
872 * Allocate a lock edge from the free list
874 static struct lockf_edge *
878 return (malloc(sizeof(struct lockf_edge), M_LOCKF, M_WAITOK|M_ZERO));
885 lf_free_edge(struct lockf_edge *e)
893 * Ensure that the lock's owner has a corresponding vertex in the
897 lf_alloc_vertex(struct lockf_entry *lock)
899 struct owner_graph *g = &lf_owner_graph;
901 if (!lock->lf_owner->lo_vertex)
902 lock->lf_owner->lo_vertex =
903 graph_alloc_vertex(g, lock->lf_owner);
907 * Attempt to record an edge from lock x to lock y. Return EDEADLK if
908 * the new edge would cause a cycle in the owner graph.
911 lf_add_edge(struct lockf_entry *x, struct lockf_entry *y)
913 struct owner_graph *g = &lf_owner_graph;
914 struct lockf_edge *e;
918 LIST_FOREACH(e, &x->lf_outedges, le_outlink)
919 KASSERT(e->le_to != y, ("adding lock edge twice"));
923 * Make sure the two owners have entries in the owner graph.
928 error = graph_add_edge(g, x->lf_owner->lo_vertex,
929 y->lf_owner->lo_vertex);
934 LIST_INSERT_HEAD(&x->lf_outedges, e, le_outlink);
935 LIST_INSERT_HEAD(&y->lf_inedges, e, le_inlink);
943 * Remove an edge from the lock graph.
946 lf_remove_edge(struct lockf_edge *e)
948 struct owner_graph *g = &lf_owner_graph;
949 struct lockf_entry *x = e->le_from;
950 struct lockf_entry *y = e->le_to;
952 graph_remove_edge(g, x->lf_owner->lo_vertex, y->lf_owner->lo_vertex);
953 LIST_REMOVE(e, le_outlink);
954 LIST_REMOVE(e, le_inlink);
961 * Remove all out-going edges from lock x.
964 lf_remove_outgoing(struct lockf_entry *x)
966 struct lockf_edge *e;
968 while ((e = LIST_FIRST(&x->lf_outedges)) != NULL) {
974 * Remove all in-coming edges from lock x.
977 lf_remove_incoming(struct lockf_entry *x)
979 struct lockf_edge *e;
981 while ((e = LIST_FIRST(&x->lf_inedges)) != NULL) {
987 * Walk the list of locks for the file and create an out-going edge
988 * from lock to each blocking lock.
991 lf_add_outgoing(struct lockf *state, struct lockf_entry *lock)
993 struct lockf_entry *overlap;
996 LIST_FOREACH(overlap, &state->ls_active, lf_link) {
998 * We may assume that the active list is sorted by
1001 if (overlap->lf_start > lock->lf_end)
1003 if (!lf_blocks(lock, overlap))
1007 * We've found a blocking lock. Add the corresponding
1008 * edge to the graphs and see if it would cause a
1011 error = lf_add_edge(lock, overlap);
1014 * The only error that lf_add_edge returns is EDEADLK.
1015 * Remove any edges we added and return the error.
1018 lf_remove_outgoing(lock);
1024 * We also need to add edges to sleeping locks that block
1025 * us. This ensures that lf_wakeup_lock cannot grant two
1026 * mutually blocking locks simultaneously and also enforces a
1027 * 'first come, first served' fairness model. Note that this
1028 * only happens if we are blocked by at least one active lock
1029 * due to the call to lf_getblock in lf_setlock below.
1031 LIST_FOREACH(overlap, &state->ls_pending, lf_link) {
1032 if (!lf_blocks(lock, overlap))
1035 * We've found a blocking lock. Add the corresponding
1036 * edge to the graphs and see if it would cause a
1039 error = lf_add_edge(lock, overlap);
1042 * The only error that lf_add_edge returns is EDEADLK.
1043 * Remove any edges we added and return the error.
1046 lf_remove_outgoing(lock);
1055 * Walk the list of pending locks for the file and create an in-coming
1056 * edge from lock to each blocking lock.
1059 lf_add_incoming(struct lockf *state, struct lockf_entry *lock)
1061 struct lockf_entry *overlap;
1064 sx_assert(&state->ls_lock, SX_XLOCKED);
1065 if (LIST_EMPTY(&state->ls_pending))
1069 sx_xlock(&lf_owner_graph_lock);
1070 LIST_FOREACH(overlap, &state->ls_pending, lf_link) {
1071 if (!lf_blocks(lock, overlap))
1075 * We've found a blocking lock. Add the corresponding
1076 * edge to the graphs and see if it would cause a
1079 error = lf_add_edge(overlap, lock);
1082 * The only error that lf_add_edge returns is EDEADLK.
1083 * Remove any edges we added and return the error.
1086 lf_remove_incoming(lock);
1090 sx_xunlock(&lf_owner_graph_lock);
1095 * Insert lock into the active list, keeping list entries ordered by
1096 * increasing values of lf_start.
1099 lf_insert_lock(struct lockf *state, struct lockf_entry *lock)
1101 struct lockf_entry *lf, *lfprev;
1103 if (LIST_EMPTY(&state->ls_active)) {
1104 LIST_INSERT_HEAD(&state->ls_active, lock, lf_link);
1109 LIST_FOREACH(lf, &state->ls_active, lf_link) {
1110 if (lf->lf_start > lock->lf_start) {
1111 LIST_INSERT_BEFORE(lf, lock, lf_link);
1116 LIST_INSERT_AFTER(lfprev, lock, lf_link);
1120 * Wake up a sleeping lock and remove it from the pending list now
1121 * that all its dependencies have been resolved. The caller should
1122 * arrange for the lock to be added to the active list, adjusting any
1123 * existing locks for the same owner as needed.
1126 lf_wakeup_lock(struct lockf *state, struct lockf_entry *wakelock)
1130 * Remove from ls_pending list and wake up the caller
1131 * or start the async notification, as appropriate.
1133 LIST_REMOVE(wakelock, lf_link);
1135 if (lockf_debug & 1)
1136 lf_print("lf_wakeup_lock: awakening", wakelock);
1137 #endif /* LOCKF_DEBUG */
1138 if (wakelock->lf_async_task) {
1139 taskqueue_enqueue(taskqueue_thread, wakelock->lf_async_task);
1146 * Re-check all dependent locks and remove edges to locks that we no
1147 * longer block. If 'all' is non-zero, the lock has been removed and
1148 * we must remove all the dependencies, otherwise it has simply been
1149 * reduced but remains active. Any pending locks which have been been
1150 * unblocked are added to 'granted'
1153 lf_update_dependancies(struct lockf *state, struct lockf_entry *lock, int all,
1154 struct lockf_entry_list *granted)
1156 struct lockf_edge *e, *ne;
1157 struct lockf_entry *deplock;
1159 LIST_FOREACH_SAFE(e, &lock->lf_inedges, le_inlink, ne) {
1160 deplock = e->le_from;
1161 if (all || !lf_blocks(lock, deplock)) {
1162 sx_xlock(&lf_owner_graph_lock);
1164 sx_xunlock(&lf_owner_graph_lock);
1165 if (LIST_EMPTY(&deplock->lf_outedges)) {
1166 lf_wakeup_lock(state, deplock);
1167 LIST_INSERT_HEAD(granted, deplock, lf_link);
1174 * Set the start of an existing active lock, updating dependencies and
1175 * adding any newly woken locks to 'granted'.
1178 lf_set_start(struct lockf *state, struct lockf_entry *lock, off_t new_start,
1179 struct lockf_entry_list *granted)
1182 KASSERT(new_start >= lock->lf_start, ("can't increase lock"));
1183 lock->lf_start = new_start;
1184 LIST_REMOVE(lock, lf_link);
1185 lf_insert_lock(state, lock);
1186 lf_update_dependancies(state, lock, FALSE, granted);
1190 * Set the end of an existing active lock, updating dependencies and
1191 * adding any newly woken locks to 'granted'.
1194 lf_set_end(struct lockf *state, struct lockf_entry *lock, off_t new_end,
1195 struct lockf_entry_list *granted)
1198 KASSERT(new_end <= lock->lf_end, ("can't increase lock"));
1199 lock->lf_end = new_end;
1200 lf_update_dependancies(state, lock, FALSE, granted);
1204 * Add a lock to the active list, updating or removing any current
1205 * locks owned by the same owner and processing any pending locks that
1206 * become unblocked as a result. This code is also used for unlock
1207 * since the logic for updating existing locks is identical.
1209 * As a result of processing the new lock, we may unblock existing
1210 * pending locks as a result of downgrading/unlocking. We simply
1211 * activate the newly granted locks by looping.
1213 * Since the new lock already has its dependencies set up, we always
1214 * add it to the list (unless its an unlock request). This may
1215 * fragment the lock list in some pathological cases but its probably
1216 * not a real problem.
1219 lf_activate_lock(struct lockf *state, struct lockf_entry *lock)
1221 struct lockf_entry *overlap, *lf;
1222 struct lockf_entry_list granted;
1225 LIST_INIT(&granted);
1226 LIST_INSERT_HEAD(&granted, lock, lf_link);
1228 while (!LIST_EMPTY(&granted)) {
1229 lock = LIST_FIRST(&granted);
1230 LIST_REMOVE(lock, lf_link);
1233 * Skip over locks owned by other processes. Handle
1234 * any locks that overlap and are owned by ourselves.
1236 overlap = LIST_FIRST(&state->ls_active);
1238 ovcase = lf_findoverlap(&overlap, lock, SELF);
1241 if (ovcase && (lockf_debug & 2)) {
1242 printf("lf_setlock: overlap %d", ovcase);
1243 lf_print("", overlap);
1249 * 1) overlap == lock
1250 * 2) overlap contains lock
1251 * 3) lock contains overlap
1252 * 4) overlap starts before lock
1253 * 5) overlap ends after lock
1256 case 0: /* no overlap */
1259 case 1: /* overlap == lock */
1261 * We have already setup the
1262 * dependants for the new lock, taking
1263 * into account a possible downgrade
1264 * or unlock. Remove the old lock.
1266 LIST_REMOVE(overlap, lf_link);
1267 lf_update_dependancies(state, overlap, TRUE,
1269 lf_free_lock(overlap);
1272 case 2: /* overlap contains lock */
1274 * Just split the existing lock.
1276 lf_split(state, overlap, lock, &granted);
1279 case 3: /* lock contains overlap */
1281 * Delete the overlap and advance to
1282 * the next entry in the list.
1284 lf = LIST_NEXT(overlap, lf_link);
1285 LIST_REMOVE(overlap, lf_link);
1286 lf_update_dependancies(state, overlap, TRUE,
1288 lf_free_lock(overlap);
1292 case 4: /* overlap starts before lock */
1294 * Just update the overlap end and
1297 lf_set_end(state, overlap, lock->lf_start - 1,
1299 overlap = LIST_NEXT(overlap, lf_link);
1302 case 5: /* overlap ends after lock */
1304 * Change the start of overlap and
1307 lf_set_start(state, overlap, lock->lf_end + 1,
1314 if (lockf_debug & 1) {
1315 if (lock->lf_type != F_UNLCK)
1316 lf_print("lf_activate_lock: activated", lock);
1318 lf_print("lf_activate_lock: unlocked", lock);
1319 lf_printlist("lf_activate_lock", lock);
1321 #endif /* LOCKF_DEBUG */
1322 if (lock->lf_type != F_UNLCK)
1323 lf_insert_lock(state, lock);
1328 * Cancel a pending lock request, either as a result of a signal or a
1329 * cancel request for an async lock.
1332 lf_cancel_lock(struct lockf *state, struct lockf_entry *lock)
1334 struct lockf_entry_list granted;
1337 * Note it is theoretically possible that cancelling this lock
1338 * may allow some other pending lock to become
1339 * active. Consider this case:
1341 * Owner Action Result Dependencies
1343 * A: lock [0..0] succeeds
1344 * B: lock [2..2] succeeds
1345 * C: lock [1..2] blocked C->B
1346 * D: lock [0..1] blocked C->B,D->A,D->C
1347 * A: unlock [0..0] C->B,D->C
1351 LIST_REMOVE(lock, lf_link);
1354 * Removing out-going edges is simple.
1356 sx_xlock(&lf_owner_graph_lock);
1357 lf_remove_outgoing(lock);
1358 sx_xunlock(&lf_owner_graph_lock);
1361 * Removing in-coming edges may allow some other lock to
1362 * become active - we use lf_update_dependancies to figure
1365 LIST_INIT(&granted);
1366 lf_update_dependancies(state, lock, TRUE, &granted);
1370 * Feed any newly active locks to lf_activate_lock.
1372 while (!LIST_EMPTY(&granted)) {
1373 lock = LIST_FIRST(&granted);
1374 LIST_REMOVE(lock, lf_link);
1375 lf_activate_lock(state, lock);
1380 * Set a byte-range lock.
1383 lf_setlock(struct lockf *state, struct lockf_entry *lock, struct vnode *vp,
1386 static char lockstr[] = "lockf";
1387 int error, priority, stops_deferred;
1390 if (lockf_debug & 1)
1391 lf_print("lf_setlock", lock);
1392 #endif /* LOCKF_DEBUG */
1398 if (lock->lf_type == F_WRLCK)
1400 if (!(lock->lf_flags & F_NOINTR))
1403 * Scan lock list for this file looking for locks that would block us.
1405 if (lf_getblock(state, lock)) {
1407 * Free the structure and return if nonblocking.
1409 if ((lock->lf_flags & F_WAIT) == 0
1410 && lock->lf_async_task == NULL) {
1417 * For flock type locks, we must first remove
1418 * any shared locks that we hold before we sleep
1419 * waiting for an exclusive lock.
1421 if ((lock->lf_flags & F_FLOCK) &&
1422 lock->lf_type == F_WRLCK) {
1423 lock->lf_type = F_UNLCK;
1424 lf_activate_lock(state, lock);
1425 lock->lf_type = F_WRLCK;
1429 * We are blocked. Create edges to each blocking lock,
1430 * checking for deadlock using the owner graph. For
1431 * simplicity, we run deadlock detection for all
1432 * locks, posix and otherwise.
1434 sx_xlock(&lf_owner_graph_lock);
1435 error = lf_add_outgoing(state, lock);
1436 sx_xunlock(&lf_owner_graph_lock);
1440 if (lockf_debug & 1)
1441 lf_print("lf_setlock: deadlock", lock);
1448 * We have added edges to everything that blocks
1449 * us. Sleep until they all go away.
1451 LIST_INSERT_HEAD(&state->ls_pending, lock, lf_link);
1453 if (lockf_debug & 1) {
1454 struct lockf_edge *e;
1455 LIST_FOREACH(e, &lock->lf_outedges, le_outlink) {
1456 lf_print("lf_setlock: blocking on", e->le_to);
1457 lf_printlist("lf_setlock", e->le_to);
1460 #endif /* LOCKF_DEBUG */
1462 if ((lock->lf_flags & F_WAIT) == 0) {
1464 * The caller requested async notification -
1465 * this callback happens when the blocking
1466 * lock is released, allowing the caller to
1467 * make another attempt to take the lock.
1469 *cookiep = (void *) lock;
1470 error = EINPROGRESS;
1475 stops_deferred = sigdeferstop(SIGDEFERSTOP_ERESTART);
1476 error = sx_sleep(lock, &state->ls_lock, priority, lockstr, 0);
1477 sigallowstop(stops_deferred);
1478 if (lf_free_lock(lock)) {
1484 * We may have been awakened by a signal and/or by a
1485 * debugger continuing us (in which cases we must
1486 * remove our lock graph edges) and/or by another
1487 * process releasing a lock (in which case our edges
1488 * have already been removed and we have been moved to
1489 * the active list). We may also have been woken by
1490 * lf_purgelocks which we report to the caller as
1491 * EINTR. In that case, lf_purgelocks will have
1492 * removed our lock graph edges.
1494 * Note that it is possible to receive a signal after
1495 * we were successfully woken (and moved to the active
1496 * list) but before we resumed execution. In this
1497 * case, our lf_outedges list will be clear. We
1498 * pretend there was no error.
1500 * Note also, if we have been sleeping long enough, we
1501 * may now have incoming edges from some newer lock
1502 * which is waiting behind us in the queue.
1504 if (lock->lf_flags & F_INTR) {
1509 if (LIST_EMPTY(&lock->lf_outedges)) {
1512 lf_cancel_lock(state, lock);
1516 if (lockf_debug & 1) {
1517 lf_print("lf_setlock: granted", lock);
1523 * It looks like we are going to grant the lock. First add
1524 * edges from any currently pending lock that the new lock
1527 error = lf_add_incoming(state, lock);
1530 if (lockf_debug & 1)
1531 lf_print("lf_setlock: deadlock", lock);
1538 * No blocks!! Add the lock. Note that we will
1539 * downgrade or upgrade any overlapping locks this
1540 * process already owns.
1542 lf_activate_lock(state, lock);
1549 * Remove a byte-range lock on an inode.
1551 * Generally, find the lock (or an overlap to that lock)
1552 * and remove it (or shrink it), then wakeup anyone we can.
1555 lf_clearlock(struct lockf *state, struct lockf_entry *unlock)
1557 struct lockf_entry *overlap;
1559 overlap = LIST_FIRST(&state->ls_active);
1561 if (overlap == NOLOCKF)
1564 if (unlock->lf_type != F_UNLCK)
1565 panic("lf_clearlock: bad type");
1566 if (lockf_debug & 1)
1567 lf_print("lf_clearlock", unlock);
1568 #endif /* LOCKF_DEBUG */
1570 lf_activate_lock(state, unlock);
1576 * Check whether there is a blocking lock, and if so return its
1580 lf_getlock(struct lockf *state, struct lockf_entry *lock, struct flock *fl)
1582 struct lockf_entry *block;
1585 if (lockf_debug & 1)
1586 lf_print("lf_getlock", lock);
1587 #endif /* LOCKF_DEBUG */
1589 if ((block = lf_getblock(state, lock))) {
1590 fl->l_type = block->lf_type;
1591 fl->l_whence = SEEK_SET;
1592 fl->l_start = block->lf_start;
1593 if (block->lf_end == OFF_MAX)
1596 fl->l_len = block->lf_end - block->lf_start + 1;
1597 fl->l_pid = block->lf_owner->lo_pid;
1598 fl->l_sysid = block->lf_owner->lo_sysid;
1600 fl->l_type = F_UNLCK;
1606 * Cancel an async lock request.
1609 lf_cancel(struct lockf *state, struct lockf_entry *lock, void *cookie)
1611 struct lockf_entry *reallock;
1614 * We need to match this request with an existing lock
1617 LIST_FOREACH(reallock, &state->ls_pending, lf_link) {
1618 if ((void *) reallock == cookie) {
1620 * Double-check that this lock looks right
1621 * (maybe use a rolling ID for the cancel
1624 if (!(reallock->lf_vnode == lock->lf_vnode
1625 && reallock->lf_start == lock->lf_start
1626 && reallock->lf_end == lock->lf_end)) {
1631 * Make sure this lock was async and then just
1632 * remove it from its wait lists.
1634 if (!reallock->lf_async_task) {
1639 * Note that since any other thread must take
1640 * state->ls_lock before it can possibly
1641 * trigger the async callback, we are safe
1642 * from a race with lf_wakeup_lock, i.e. we
1643 * can free the lock (actually our caller does
1646 lf_cancel_lock(state, reallock);
1652 * We didn't find a matching lock - not much we can do here.
1658 * Walk the list of locks for an inode and
1659 * return the first blocking lock.
1661 static struct lockf_entry *
1662 lf_getblock(struct lockf *state, struct lockf_entry *lock)
1664 struct lockf_entry *overlap;
1666 LIST_FOREACH(overlap, &state->ls_active, lf_link) {
1668 * We may assume that the active list is sorted by
1671 if (overlap->lf_start > lock->lf_end)
1673 if (!lf_blocks(lock, overlap))
1681 * Walk the list of locks for an inode to find an overlapping lock (if
1682 * any) and return a classification of that overlap.
1685 * *overlap The place in the lock list to start looking
1686 * lock The lock which is being tested
1687 * type Pass 'SELF' to test only locks with the same
1688 * owner as lock, or 'OTHER' to test only locks
1689 * with a different owner
1691 * Returns one of six values:
1693 * 1) overlap == lock
1694 * 2) overlap contains lock
1695 * 3) lock contains overlap
1696 * 4) overlap starts before lock
1697 * 5) overlap ends after lock
1699 * If there is an overlapping lock, '*overlap' is set to point at the
1702 * NOTE: this returns only the FIRST overlapping lock. There
1703 * may be more than one.
1706 lf_findoverlap(struct lockf_entry **overlap, struct lockf_entry *lock, int type)
1708 struct lockf_entry *lf;
1712 if ((*overlap) == NOLOCKF) {
1716 if (lockf_debug & 2)
1717 lf_print("lf_findoverlap: looking for overlap in", lock);
1718 #endif /* LOCKF_DEBUG */
1719 start = lock->lf_start;
1724 if (lf->lf_start > end)
1726 if (((type & SELF) && lf->lf_owner != lock->lf_owner) ||
1727 ((type & OTHERS) && lf->lf_owner == lock->lf_owner)) {
1728 *overlap = LIST_NEXT(lf, lf_link);
1732 if (lockf_debug & 2)
1733 lf_print("\tchecking", lf);
1734 #endif /* LOCKF_DEBUG */
1736 * OK, check for overlap
1740 * 1) overlap == lock
1741 * 2) overlap contains lock
1742 * 3) lock contains overlap
1743 * 4) overlap starts before lock
1744 * 5) overlap ends after lock
1746 if (start > lf->lf_end) {
1749 if (lockf_debug & 2)
1750 printf("no overlap\n");
1751 #endif /* LOCKF_DEBUG */
1752 *overlap = LIST_NEXT(lf, lf_link);
1755 if (lf->lf_start == start && lf->lf_end == end) {
1758 if (lockf_debug & 2)
1759 printf("overlap == lock\n");
1760 #endif /* LOCKF_DEBUG */
1764 if (lf->lf_start <= start && lf->lf_end >= end) {
1767 if (lockf_debug & 2)
1768 printf("overlap contains lock\n");
1769 #endif /* LOCKF_DEBUG */
1773 if (start <= lf->lf_start && end >= lf->lf_end) {
1776 if (lockf_debug & 2)
1777 printf("lock contains overlap\n");
1778 #endif /* LOCKF_DEBUG */
1782 if (lf->lf_start < start && lf->lf_end >= start) {
1785 if (lockf_debug & 2)
1786 printf("overlap starts before lock\n");
1787 #endif /* LOCKF_DEBUG */
1791 if (lf->lf_start > start && lf->lf_end > end) {
1794 if (lockf_debug & 2)
1795 printf("overlap ends after lock\n");
1796 #endif /* LOCKF_DEBUG */
1800 panic("lf_findoverlap: default");
1806 * Split an the existing 'lock1', based on the extent of the lock
1807 * described by 'lock2'. The existing lock should cover 'lock2'
1810 * Any pending locks which have been been unblocked are added to
1814 lf_split(struct lockf *state, struct lockf_entry *lock1,
1815 struct lockf_entry *lock2, struct lockf_entry_list *granted)
1817 struct lockf_entry *splitlock;
1820 if (lockf_debug & 2) {
1821 lf_print("lf_split", lock1);
1822 lf_print("splitting from", lock2);
1824 #endif /* LOCKF_DEBUG */
1826 * Check to see if we don't need to split at all.
1828 if (lock1->lf_start == lock2->lf_start) {
1829 lf_set_start(state, lock1, lock2->lf_end + 1, granted);
1832 if (lock1->lf_end == lock2->lf_end) {
1833 lf_set_end(state, lock1, lock2->lf_start - 1, granted);
1837 * Make a new lock consisting of the last part of
1838 * the encompassing lock.
1840 splitlock = lf_alloc_lock(lock1->lf_owner);
1841 memcpy(splitlock, lock1, sizeof *splitlock);
1842 splitlock->lf_refs = 1;
1843 if (splitlock->lf_flags & F_REMOTE)
1844 vref(splitlock->lf_vnode);
1847 * This cannot cause a deadlock since any edges we would add
1848 * to splitlock already exist in lock1. We must be sure to add
1849 * necessary dependencies to splitlock before we reduce lock1
1850 * otherwise we may accidentally grant a pending lock that
1851 * was blocked by the tail end of lock1.
1853 splitlock->lf_start = lock2->lf_end + 1;
1854 LIST_INIT(&splitlock->lf_outedges);
1855 LIST_INIT(&splitlock->lf_inedges);
1856 lf_add_incoming(state, splitlock);
1858 lf_set_end(state, lock1, lock2->lf_start - 1, granted);
1861 * OK, now link it in
1863 lf_insert_lock(state, splitlock);
1867 STAILQ_ENTRY(lockdesc) link;
1871 STAILQ_HEAD(lockdesclist, lockdesc);
1874 lf_iteratelocks_sysid(int sysid, lf_iterator *fn, void *arg)
1877 struct lockf_entry *lf;
1878 struct lockdesc *ldesc;
1879 struct lockdesclist locks;
1883 * In order to keep the locking simple, we iterate over the
1884 * active lock lists to build a list of locks that need
1885 * releasing. We then call the iterator for each one in turn.
1887 * We take an extra reference to the vnode for the duration to
1888 * make sure it doesn't go away before we are finished.
1890 STAILQ_INIT(&locks);
1891 sx_xlock(&lf_lock_states_lock);
1892 LIST_FOREACH(ls, &lf_lock_states, ls_link) {
1893 sx_xlock(&ls->ls_lock);
1894 LIST_FOREACH(lf, &ls->ls_active, lf_link) {
1895 if (lf->lf_owner->lo_sysid != sysid)
1898 ldesc = malloc(sizeof(struct lockdesc), M_LOCKF,
1900 ldesc->vp = lf->lf_vnode;
1902 ldesc->fl.l_start = lf->lf_start;
1903 if (lf->lf_end == OFF_MAX)
1904 ldesc->fl.l_len = 0;
1907 lf->lf_end - lf->lf_start + 1;
1908 ldesc->fl.l_whence = SEEK_SET;
1909 ldesc->fl.l_type = F_UNLCK;
1910 ldesc->fl.l_pid = lf->lf_owner->lo_pid;
1911 ldesc->fl.l_sysid = sysid;
1912 STAILQ_INSERT_TAIL(&locks, ldesc, link);
1914 sx_xunlock(&ls->ls_lock);
1916 sx_xunlock(&lf_lock_states_lock);
1919 * Call the iterator function for each lock in turn. If the
1920 * iterator returns an error code, just free the rest of the
1921 * lockdesc structures.
1924 while ((ldesc = STAILQ_FIRST(&locks)) != NULL) {
1925 STAILQ_REMOVE_HEAD(&locks, link);
1927 error = fn(ldesc->vp, &ldesc->fl, arg);
1929 free(ldesc, M_LOCKF);
1936 lf_iteratelocks_vnode(struct vnode *vp, lf_iterator *fn, void *arg)
1939 struct lockf_entry *lf;
1940 struct lockdesc *ldesc;
1941 struct lockdesclist locks;
1945 * In order to keep the locking simple, we iterate over the
1946 * active lock lists to build a list of locks that need
1947 * releasing. We then call the iterator for each one in turn.
1949 * We take an extra reference to the vnode for the duration to
1950 * make sure it doesn't go away before we are finished.
1952 STAILQ_INIT(&locks);
1962 sx_xlock(&ls->ls_lock);
1963 LIST_FOREACH(lf, &ls->ls_active, lf_link) {
1964 ldesc = malloc(sizeof(struct lockdesc), M_LOCKF,
1966 ldesc->vp = lf->lf_vnode;
1968 ldesc->fl.l_start = lf->lf_start;
1969 if (lf->lf_end == OFF_MAX)
1970 ldesc->fl.l_len = 0;
1973 lf->lf_end - lf->lf_start + 1;
1974 ldesc->fl.l_whence = SEEK_SET;
1975 ldesc->fl.l_type = F_UNLCK;
1976 ldesc->fl.l_pid = lf->lf_owner->lo_pid;
1977 ldesc->fl.l_sysid = lf->lf_owner->lo_sysid;
1978 STAILQ_INSERT_TAIL(&locks, ldesc, link);
1980 sx_xunlock(&ls->ls_lock);
1987 * Call the iterator function for each lock in turn. If the
1988 * iterator returns an error code, just free the rest of the
1989 * lockdesc structures.
1992 while ((ldesc = STAILQ_FIRST(&locks)) != NULL) {
1993 STAILQ_REMOVE_HEAD(&locks, link);
1995 error = fn(ldesc->vp, &ldesc->fl, arg);
1997 free(ldesc, M_LOCKF);
2004 lf_clearremotesys_iterator(struct vnode *vp, struct flock *fl, void *arg)
2007 VOP_ADVLOCK(vp, 0, F_UNLCK, fl, F_REMOTE);
2012 lf_clearremotesys(int sysid)
2015 KASSERT(sysid != 0, ("Can't clear local locks with F_UNLCKSYS"));
2016 lf_iteratelocks_sysid(sysid, lf_clearremotesys_iterator, NULL);
2020 lf_countlocks(int sysid)
2023 struct lock_owner *lo;
2027 for (i = 0; i < LOCK_OWNER_HASH_SIZE; i++) {
2028 sx_xlock(&lf_lock_owners[i].lock);
2029 LIST_FOREACH(lo, &lf_lock_owners[i].list, lo_link)
2030 if (lo->lo_sysid == sysid)
2031 count += lo->lo_refs;
2032 sx_xunlock(&lf_lock_owners[i].lock);
2041 * Return non-zero if y is reachable from x using a brute force
2042 * search. If reachable and path is non-null, return the route taken
2046 graph_reaches(struct owner_vertex *x, struct owner_vertex *y,
2047 struct owner_vertex_list *path)
2049 struct owner_edge *e;
2053 TAILQ_INSERT_HEAD(path, x, v_link);
2057 LIST_FOREACH(e, &x->v_outedges, e_outlink) {
2058 if (graph_reaches(e->e_to, y, path)) {
2060 TAILQ_INSERT_HEAD(path, x, v_link);
2068 * Perform consistency checks on the graph. Make sure the values of
2069 * v_order are correct. If checkorder is non-zero, check no vertex can
2070 * reach any other vertex with a smaller order.
2073 graph_check(struct owner_graph *g, int checkorder)
2077 for (i = 0; i < g->g_size; i++) {
2078 if (!g->g_vertices[i]->v_owner)
2080 KASSERT(g->g_vertices[i]->v_order == i,
2081 ("lock graph vertices disordered"));
2083 for (j = 0; j < i; j++) {
2084 if (!g->g_vertices[j]->v_owner)
2086 KASSERT(!graph_reaches(g->g_vertices[i],
2087 g->g_vertices[j], NULL),
2088 ("lock graph vertices disordered"));
2095 graph_print_vertices(struct owner_vertex_list *set)
2097 struct owner_vertex *v;
2100 TAILQ_FOREACH(v, set, v_link) {
2101 printf("%d:", v->v_order);
2102 lf_print_owner(v->v_owner);
2103 if (TAILQ_NEXT(v, v_link))
2112 * Calculate the sub-set of vertices v from the affected region [y..x]
2113 * where v is reachable from y. Return -1 if a loop was detected
2114 * (i.e. x is reachable from y, otherwise the number of vertices in
2118 graph_delta_forward(struct owner_graph *g, struct owner_vertex *x,
2119 struct owner_vertex *y, struct owner_vertex_list *delta)
2122 struct owner_vertex *v;
2123 struct owner_edge *e;
2127 * We start with a set containing just y. Then for each vertex
2128 * v in the set so far unprocessed, we add each vertex that v
2129 * has an out-edge to and that is within the affected region
2130 * [y..x]. If we see the vertex x on our travels, stop
2134 TAILQ_INSERT_TAIL(delta, y, v_link);
2139 LIST_FOREACH(e, &v->v_outedges, e_outlink) {
2142 if (e->e_to->v_order < x->v_order
2143 && e->e_to->v_gen != gen) {
2144 e->e_to->v_gen = gen;
2145 TAILQ_INSERT_TAIL(delta, e->e_to, v_link);
2149 v = TAILQ_NEXT(v, v_link);
2156 * Calculate the sub-set of vertices v from the affected region [y..x]
2157 * where v reaches x. Return the number of vertices in this subset.
2160 graph_delta_backward(struct owner_graph *g, struct owner_vertex *x,
2161 struct owner_vertex *y, struct owner_vertex_list *delta)
2164 struct owner_vertex *v;
2165 struct owner_edge *e;
2169 * We start with a set containing just x. Then for each vertex
2170 * v in the set so far unprocessed, we add each vertex that v
2171 * has an in-edge from and that is within the affected region
2175 TAILQ_INSERT_TAIL(delta, x, v_link);
2180 LIST_FOREACH(e, &v->v_inedges, e_inlink) {
2181 if (e->e_from->v_order > y->v_order
2182 && e->e_from->v_gen != gen) {
2183 e->e_from->v_gen = gen;
2184 TAILQ_INSERT_HEAD(delta, e->e_from, v_link);
2188 v = TAILQ_PREV(v, owner_vertex_list, v_link);
2195 graph_add_indices(int *indices, int n, struct owner_vertex_list *set)
2197 struct owner_vertex *v;
2200 TAILQ_FOREACH(v, set, v_link) {
2202 i > 0 && indices[i - 1] > v->v_order; i--)
2204 for (j = n - 1; j >= i; j--)
2205 indices[j + 1] = indices[j];
2206 indices[i] = v->v_order;
2214 graph_assign_indices(struct owner_graph *g, int *indices, int nextunused,
2215 struct owner_vertex_list *set)
2217 struct owner_vertex *v, *vlowest;
2219 while (!TAILQ_EMPTY(set)) {
2221 TAILQ_FOREACH(v, set, v_link) {
2222 if (!vlowest || v->v_order < vlowest->v_order)
2225 TAILQ_REMOVE(set, vlowest, v_link);
2226 vlowest->v_order = indices[nextunused];
2227 g->g_vertices[vlowest->v_order] = vlowest;
2231 return (nextunused);
2235 graph_add_edge(struct owner_graph *g, struct owner_vertex *x,
2236 struct owner_vertex *y)
2238 struct owner_edge *e;
2239 struct owner_vertex_list deltaF, deltaB;
2240 int nF, nB, n, vi, i;
2243 sx_assert(&lf_owner_graph_lock, SX_XLOCKED);
2245 LIST_FOREACH(e, &x->v_outedges, e_outlink) {
2253 if (lockf_debug & 8) {
2254 printf("adding edge %d:", x->v_order);
2255 lf_print_owner(x->v_owner);
2256 printf(" -> %d:", y->v_order);
2257 lf_print_owner(y->v_owner);
2261 if (y->v_order < x->v_order) {
2263 * The new edge violates the order. First find the set
2264 * of affected vertices reachable from y (deltaF) and
2265 * the set of affect vertices affected that reach x
2266 * (deltaB), using the graph generation number to
2267 * detect whether we have visited a given vertex
2268 * already. We re-order the graph so that each vertex
2269 * in deltaB appears before each vertex in deltaF.
2271 * If x is a member of deltaF, then the new edge would
2272 * create a cycle. Otherwise, we may assume that
2273 * deltaF and deltaB are disjoint.
2276 if (g->g_gen == 0) {
2280 for (vi = 0; vi < g->g_size; vi++) {
2281 g->g_vertices[vi]->v_gen = 0;
2285 nF = graph_delta_forward(g, x, y, &deltaF);
2288 if (lockf_debug & 8) {
2289 struct owner_vertex_list path;
2290 printf("deadlock: ");
2292 graph_reaches(y, x, &path);
2293 graph_print_vertices(&path);
2300 if (lockf_debug & 8) {
2301 printf("re-ordering graph vertices\n");
2302 printf("deltaF = ");
2303 graph_print_vertices(&deltaF);
2307 nB = graph_delta_backward(g, x, y, &deltaB);
2310 if (lockf_debug & 8) {
2311 printf("deltaB = ");
2312 graph_print_vertices(&deltaB);
2317 * We first build a set of vertex indices (vertex
2318 * order values) that we may use, then we re-assign
2319 * orders first to those vertices in deltaB, then to
2320 * deltaF. Note that the contents of deltaF and deltaB
2321 * may be partially disordered - we perform an
2322 * insertion sort while building our index set.
2324 indices = g->g_indexbuf;
2325 n = graph_add_indices(indices, 0, &deltaF);
2326 graph_add_indices(indices, n, &deltaB);
2329 * We must also be sure to maintain the relative
2330 * ordering of deltaF and deltaB when re-assigning
2331 * vertices. We do this by iteratively removing the
2332 * lowest ordered element from the set and assigning
2333 * it the next value from our new ordering.
2335 i = graph_assign_indices(g, indices, 0, &deltaB);
2336 graph_assign_indices(g, indices, i, &deltaF);
2339 if (lockf_debug & 8) {
2340 struct owner_vertex_list set;
2342 for (i = 0; i < nB + nF; i++)
2343 TAILQ_INSERT_TAIL(&set,
2344 g->g_vertices[indices[i]], v_link);
2345 printf("new ordering = ");
2346 graph_print_vertices(&set);
2351 KASSERT(x->v_order < y->v_order, ("Failed to re-order graph"));
2354 if (lockf_debug & 8) {
2355 graph_check(g, TRUE);
2359 e = malloc(sizeof(struct owner_edge), M_LOCKF, M_WAITOK);
2361 LIST_INSERT_HEAD(&x->v_outedges, e, e_outlink);
2362 LIST_INSERT_HEAD(&y->v_inedges, e, e_inlink);
2371 * Remove an edge x->y from the graph.
2374 graph_remove_edge(struct owner_graph *g, struct owner_vertex *x,
2375 struct owner_vertex *y)
2377 struct owner_edge *e;
2379 sx_assert(&lf_owner_graph_lock, SX_XLOCKED);
2381 LIST_FOREACH(e, &x->v_outedges, e_outlink) {
2385 KASSERT(e, ("Removing non-existent edge from deadlock graph"));
2388 if (e->e_refs == 0) {
2390 if (lockf_debug & 8) {
2391 printf("removing edge %d:", x->v_order);
2392 lf_print_owner(x->v_owner);
2393 printf(" -> %d:", y->v_order);
2394 lf_print_owner(y->v_owner);
2398 LIST_REMOVE(e, e_outlink);
2399 LIST_REMOVE(e, e_inlink);
2405 * Allocate a vertex from the free list. Return ENOMEM if there are
2408 static struct owner_vertex *
2409 graph_alloc_vertex(struct owner_graph *g, struct lock_owner *lo)
2411 struct owner_vertex *v;
2413 sx_assert(&lf_owner_graph_lock, SX_XLOCKED);
2415 v = malloc(sizeof(struct owner_vertex), M_LOCKF, M_WAITOK);
2416 if (g->g_size == g->g_space) {
2417 g->g_vertices = realloc(g->g_vertices,
2418 2 * g->g_space * sizeof(struct owner_vertex *),
2420 free(g->g_indexbuf, M_LOCKF);
2421 g->g_indexbuf = malloc(2 * g->g_space * sizeof(int),
2423 g->g_space = 2 * g->g_space;
2425 v->v_order = g->g_size;
2426 v->v_gen = g->g_gen;
2427 g->g_vertices[g->g_size] = v;
2430 LIST_INIT(&v->v_outedges);
2431 LIST_INIT(&v->v_inedges);
2438 graph_free_vertex(struct owner_graph *g, struct owner_vertex *v)
2440 struct owner_vertex *w;
2443 sx_assert(&lf_owner_graph_lock, SX_XLOCKED);
2445 KASSERT(LIST_EMPTY(&v->v_outedges), ("Freeing vertex with edges"));
2446 KASSERT(LIST_EMPTY(&v->v_inedges), ("Freeing vertex with edges"));
2449 * Remove from the graph's array and close up the gap,
2450 * renumbering the other vertices.
2452 for (i = v->v_order + 1; i < g->g_size; i++) {
2453 w = g->g_vertices[i];
2455 g->g_vertices[i - 1] = w;
2462 static struct owner_graph *
2463 graph_init(struct owner_graph *g)
2466 g->g_vertices = malloc(10 * sizeof(struct owner_vertex *),
2470 g->g_indexbuf = malloc(g->g_space * sizeof(int), M_LOCKF, M_WAITOK);
2478 * Print description of a lock owner
2481 lf_print_owner(struct lock_owner *lo)
2484 if (lo->lo_flags & F_REMOTE) {
2485 printf("remote pid %d, system %d",
2486 lo->lo_pid, lo->lo_sysid);
2487 } else if (lo->lo_flags & F_FLOCK) {
2488 printf("file %p", lo->lo_id);
2490 printf("local pid %d", lo->lo_pid);
2498 lf_print(char *tag, struct lockf_entry *lock)
2501 printf("%s: lock %p for ", tag, (void *)lock);
2502 lf_print_owner(lock->lf_owner);
2503 if (lock->lf_inode != (struct inode *)0)
2504 printf(" in ino %ju on dev <%s>,",
2505 (uintmax_t)lock->lf_inode->i_number,
2506 devtoname(ITODEV(lock->lf_inode)));
2507 printf(" %s, start %jd, end ",
2508 lock->lf_type == F_RDLCK ? "shared" :
2509 lock->lf_type == F_WRLCK ? "exclusive" :
2510 lock->lf_type == F_UNLCK ? "unlock" : "unknown",
2511 (intmax_t)lock->lf_start);
2512 if (lock->lf_end == OFF_MAX)
2515 printf("%jd", (intmax_t)lock->lf_end);
2516 if (!LIST_EMPTY(&lock->lf_outedges))
2517 printf(" block %p\n",
2518 (void *)LIST_FIRST(&lock->lf_outedges)->le_to);
2524 lf_printlist(char *tag, struct lockf_entry *lock)
2526 struct lockf_entry *lf, *blk;
2527 struct lockf_edge *e;
2529 if (lock->lf_inode == (struct inode *)0)
2532 printf("%s: Lock list for ino %ju on dev <%s>:\n",
2533 tag, (uintmax_t)lock->lf_inode->i_number,
2534 devtoname(ITODEV(lock->lf_inode)));
2535 LIST_FOREACH(lf, &lock->lf_vnode->v_lockf->ls_active, lf_link) {
2536 printf("\tlock %p for ",(void *)lf);
2537 lf_print_owner(lock->lf_owner);
2538 printf(", %s, start %jd, end %jd",
2539 lf->lf_type == F_RDLCK ? "shared" :
2540 lf->lf_type == F_WRLCK ? "exclusive" :
2541 lf->lf_type == F_UNLCK ? "unlock" :
2542 "unknown", (intmax_t)lf->lf_start, (intmax_t)lf->lf_end);
2543 LIST_FOREACH(e, &lf->lf_outedges, le_outlink) {
2545 printf("\n\t\tlock request %p for ", (void *)blk);
2546 lf_print_owner(blk->lf_owner);
2547 printf(", %s, start %jd, end %jd",
2548 blk->lf_type == F_RDLCK ? "shared" :
2549 blk->lf_type == F_WRLCK ? "exclusive" :
2550 blk->lf_type == F_UNLCK ? "unlock" :
2551 "unknown", (intmax_t)blk->lf_start,
2552 (intmax_t)blk->lf_end);
2553 if (!LIST_EMPTY(&blk->lf_inedges))
2554 panic("lf_printlist: bad list");
2559 #endif /* LOCKF_DEBUG */