1 /* $NetBSD: lockd_lock.c,v 1.5 2000/11/21 03:47:41 enami Exp $ */
4 * SPDX-License-Identifier: BSD-4-Clause
6 * Copyright (c) 2001 Andrew P. Lentvorski, Jr.
7 * Copyright (c) 2000 Manuel Bouyer.
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
39 #include <sys/cdefs.h>
54 #include <sys/types.h>
56 #include <sys/socket.h>
57 #include <sys/param.h>
58 #include <sys/mount.h>
60 #include <rpcsvc/sm_inter.h>
61 #include <rpcsvc/nlm_prot.h>
62 #include "lockd_lock.h"
65 #define MAXOBJECTSIZE 64
66 #define MAXBUFFERSIZE 1024
69 * A set of utilities for managing file locking
71 * XXX: All locks are in a linked list, a better structure should be used
72 * to improve search/access efficiency.
75 /* struct describing a lock */
77 LIST_ENTRY(file_lock) nfslocklist;
78 fhandle_t filehandle; /* NFS filehandle */
79 struct sockaddr *addr;
80 struct nlm4_holder client; /* lock holder */
81 /* XXX: client_cookie used *only* in send_granted */
82 netobj client_cookie; /* cookie sent by the client */
83 int nsm_status; /* status from the remote lock manager */
84 int status; /* lock status, see below */
85 int flags; /* lock flags, see lockd_lock.h */
86 int blocking; /* blocking lock or not */
87 char client_name[SM_MAXSTRLEN]; /* client_name is really variable
88 length and must be last! */
91 LIST_HEAD(nfslocklist_head, file_lock);
92 struct nfslocklist_head nfslocklist_head = LIST_HEAD_INITIALIZER(nfslocklist_head);
94 LIST_HEAD(blockedlocklist_head, file_lock);
95 struct blockedlocklist_head blockedlocklist_head = LIST_HEAD_INITIALIZER(blockedlocklist_head);
98 #define LKST_LOCKED 1 /* lock is locked */
99 /* XXX: Is this flag file specific or lock specific? */
100 #define LKST_WAITING 2 /* file is already locked by another host */
101 #define LKST_PROCESSING 3 /* child is trying to acquire the lock */
102 #define LKST_DYING 4 /* must dies when we get news from the child */
104 /* struct describing a monitored host */
106 LIST_ENTRY(host) hostlst;
108 char name[SM_MAXSTRLEN]; /* name is really variable length and
111 /* list of hosts we monitor */
112 LIST_HEAD(hostlst_head, host);
113 struct hostlst_head hostlst_head = LIST_HEAD_INITIALIZER(hostlst_head);
116 * File monitoring handlers
117 * XXX: These might be able to be removed when kevent support
118 * is placed into the hardware lock/unlock routines. (ie.
119 * let the kernel do all the file monitoring)
122 /* Struct describing a monitored file */
124 LIST_ENTRY(monfile) monfilelist;
125 fhandle_t filehandle; /* Local access filehandle */
126 int fd; /* file descriptor: remains open until unlock! */
131 /* List of files we monitor */
132 LIST_HEAD(monfilelist_head, monfile);
133 struct monfilelist_head monfilelist_head = LIST_HEAD_INITIALIZER(monfilelist_head);
135 static int debugdelay = 0;
137 enum nfslock_status { NFS_GRANTED = 0, NFS_GRANTED_DUPLICATE,
138 NFS_DENIED, NFS_DENIED_NOLOCK,
141 enum hwlock_status { HW_GRANTED = 0, HW_GRANTED_DUPLICATE,
142 HW_DENIED, HW_DENIED_NOLOCK,
143 HW_STALEFH, HW_READONLY, HW_RESERR };
145 enum partialfilelock_status { PFL_GRANTED=0, PFL_GRANTED_DUPLICATE, PFL_DENIED,
146 PFL_NFSDENIED, PFL_NFSBLOCKED, PFL_NFSDENIED_NOLOCK, PFL_NFSRESERR,
147 PFL_HWDENIED, PFL_HWBLOCKED, PFL_HWDENIED_NOLOCK, PFL_HWRESERR};
149 enum LFLAGS {LEDGE_LEFT, LEDGE_LBOUNDARY, LEDGE_INSIDE, LEDGE_RBOUNDARY, LEDGE_RIGHT};
150 enum RFLAGS {REDGE_LEFT, REDGE_LBOUNDARY, REDGE_INSIDE, REDGE_RBOUNDARY, REDGE_RIGHT};
151 /* XXX: WARNING! I HAVE OVERLOADED THIS STATUS ENUM! SPLIT IT APART INTO TWO */
152 enum split_status {SPL_DISJOINT=0, SPL_LOCK1=1, SPL_LOCK2=2, SPL_CONTAINED=4, SPL_RESERR=8};
154 enum partialfilelock_status lock_partialfilelock(struct file_lock *fl);
156 void send_granted(struct file_lock *fl, int opcode);
158 void sigunlock(void);
159 void monitor_lock_host(const char *hostname);
160 void unmonitor_lock_host(char *hostname);
162 void copy_nlm4_lock_to_nlm4_holder(const struct nlm4_lock *src,
163 const bool_t exclusive, struct nlm4_holder *dest);
164 struct file_lock * allocate_file_lock(const netobj *lockowner,
165 const netobj *matchcookie,
166 const struct sockaddr *addr,
167 const char *caller_name);
168 void deallocate_file_lock(struct file_lock *fl);
169 void fill_file_lock(struct file_lock *fl, const fhandle_t *fh,
170 const bool_t exclusive, const int32_t svid,
171 const u_int64_t offset, const u_int64_t len,
172 const int state, const int status, const int flags, const int blocking);
173 int regions_overlap(const u_int64_t start1, const u_int64_t len1,
174 const u_int64_t start2, const u_int64_t len2);
175 enum split_status region_compare(const u_int64_t starte, const u_int64_t lene,
176 const u_int64_t startu, const u_int64_t lenu,
177 u_int64_t *start1, u_int64_t *len1, u_int64_t *start2, u_int64_t *len2);
178 int same_netobj(const netobj *n0, const netobj *n1);
179 int same_filelock_identity(const struct file_lock *fl0,
180 const struct file_lock *fl2);
182 static void debuglog(char const *fmt, ...);
183 void dump_static_object(const unsigned char* object, const int sizeof_object,
184 unsigned char* hbuff, const int sizeof_hbuff,
185 unsigned char* cbuff, const int sizeof_cbuff);
186 void dump_netobj(const struct netobj *nobj);
187 void dump_filelock(const struct file_lock *fl);
188 struct file_lock * get_lock_matching_unlock(const struct file_lock *fl);
189 enum nfslock_status test_nfslock(const struct file_lock *fl,
190 struct file_lock **conflicting_fl);
191 enum nfslock_status lock_nfslock(struct file_lock *fl);
192 enum nfslock_status delete_nfslock(struct file_lock *fl);
193 enum nfslock_status unlock_nfslock(const struct file_lock *fl,
194 struct file_lock **released_lock, struct file_lock **left_lock,
195 struct file_lock **right_lock);
196 enum hwlock_status lock_hwlock(struct file_lock *fl);
197 enum split_status split_nfslock(const struct file_lock *exist_lock,
198 const struct file_lock *unlock_lock, struct file_lock **left_lock,
199 struct file_lock **right_lock);
200 int duplicate_block(struct file_lock *fl);
201 void add_blockingfilelock(struct file_lock *fl);
202 enum hwlock_status unlock_hwlock(const struct file_lock *fl);
203 enum hwlock_status test_hwlock(const struct file_lock *fl,
204 struct file_lock **conflicting_fl);
205 void remove_blockingfilelock(struct file_lock *fl);
206 void clear_blockingfilelock(const char *hostname);
207 void retry_blockingfilelocklist(void);
208 enum partialfilelock_status unlock_partialfilelock(
209 const struct file_lock *fl);
210 void clear_partialfilelock(const char *hostname);
211 enum partialfilelock_status test_partialfilelock(
212 const struct file_lock *fl, struct file_lock **conflicting_fl);
213 enum nlm_stats do_test(struct file_lock *fl,
214 struct file_lock **conflicting_fl);
215 enum nlm_stats do_unlock(struct file_lock *fl);
216 enum nlm_stats do_lock(struct file_lock *fl);
217 void do_clear(const char *hostname);
220 debuglog(char const *fmt, ...)
224 if (debug_level < 1) {
231 vsyslog(LOG_DEBUG, fmt, ap);
236 dump_static_object(const unsigned char *object, const int size_object,
237 unsigned char *hbuff, const int size_hbuff, unsigned char *cbuff,
238 const int size_cbuff)
242 if (debug_level < 2) {
246 objectsize = size_object;
248 if (objectsize == 0) {
249 debuglog("object is size 0\n");
251 if (objectsize > MAXOBJECTSIZE) {
252 debuglog("Object of size %d being clamped"
253 "to size %d\n", objectsize, MAXOBJECTSIZE);
254 objectsize = MAXOBJECTSIZE;
258 if (size_hbuff < objectsize*2+1) {
259 debuglog("Hbuff not large enough."
262 for(i=0;i<objectsize;i++) {
263 sprintf(hbuff+i*2,"%02x",*(object+i));
270 if (size_cbuff < objectsize+1) {
271 debuglog("Cbuff not large enough."
275 for(i=0;i<objectsize;i++) {
276 if (*(object+i) >= 32 && *(object+i) <= 127) {
277 *(cbuff+i) = *(object+i);
288 dump_netobj(const struct netobj *nobj)
290 char hbuff[MAXBUFFERSIZE*2];
291 char cbuff[MAXBUFFERSIZE];
293 if (debug_level < 2) {
298 debuglog("Null netobj pointer\n");
300 else if (nobj->n_len == 0) {
301 debuglog("Size zero netobj\n");
303 dump_static_object(nobj->n_bytes, nobj->n_len,
304 hbuff, sizeof(hbuff), cbuff, sizeof(cbuff));
305 debuglog("netobj: len: %d data: %s ::: %s\n",
306 nobj->n_len, hbuff, cbuff);
310 /* #define DUMP_FILELOCK_VERBOSE */
312 dump_filelock(const struct file_lock *fl)
314 #ifdef DUMP_FILELOCK_VERBOSE
315 char hbuff[MAXBUFFERSIZE*2];
316 char cbuff[MAXBUFFERSIZE];
319 if (debug_level < 2) {
324 debuglog("Dumping file lock structure @ %p\n", fl);
326 #ifdef DUMP_FILELOCK_VERBOSE
327 dump_static_object((unsigned char *)&fl->filehandle,
328 sizeof(fl->filehandle), hbuff, sizeof(hbuff),
329 cbuff, sizeof(cbuff));
330 debuglog("Filehandle: %8s ::: %8s\n", hbuff, cbuff);
333 debuglog("Dumping nlm4_holder:\n"
334 "exc: %x svid: %x offset:len %llx:%llx\n",
335 fl->client.exclusive, fl->client.svid,
336 fl->client.l_offset, fl->client.l_len);
338 #ifdef DUMP_FILELOCK_VERBOSE
339 debuglog("Dumping client identity:\n");
340 dump_netobj(&fl->client.oh);
342 debuglog("Dumping client cookie:\n");
343 dump_netobj(&fl->client_cookie);
345 debuglog("nsm: %d status: %d flags: %d svid: %x"
346 " client_name: %s\n", fl->nsm_status, fl->status,
347 fl->flags, fl->client.svid, fl->client_name);
350 debuglog("NULL file lock structure\n");
355 copy_nlm4_lock_to_nlm4_holder(const struct nlm4_lock *src,
356 const bool_t exclusive, struct nlm4_holder *dest)
359 dest->exclusive = exclusive;
360 dest->oh.n_len = src->oh.n_len;
361 dest->oh.n_bytes = src->oh.n_bytes;
362 dest->svid = src->svid;
363 dest->l_offset = src->l_offset;
364 dest->l_len = src->l_len;
368 * allocate_file_lock: Create a lock with the given parameters
372 allocate_file_lock(const netobj *lockowner, const netobj *matchcookie,
373 const struct sockaddr *addr, const char *caller_name)
375 struct file_lock *newfl;
378 /* Beware of rubbish input! */
379 n = strnlen(caller_name, SM_MAXSTRLEN);
380 if (n == SM_MAXSTRLEN) {
384 newfl = malloc(sizeof(*newfl) - sizeof(newfl->client_name) + n + 1);
388 bzero(newfl, sizeof(*newfl) - sizeof(newfl->client_name));
389 memcpy(newfl->client_name, caller_name, n);
390 newfl->client_name[n] = 0;
392 newfl->client.oh.n_bytes = malloc(lockowner->n_len);
393 if (newfl->client.oh.n_bytes == NULL) {
397 newfl->client.oh.n_len = lockowner->n_len;
398 bcopy(lockowner->n_bytes, newfl->client.oh.n_bytes, lockowner->n_len);
400 newfl->client_cookie.n_bytes = malloc(matchcookie->n_len);
401 if (newfl->client_cookie.n_bytes == NULL) {
402 free(newfl->client.oh.n_bytes);
406 newfl->client_cookie.n_len = matchcookie->n_len;
407 bcopy(matchcookie->n_bytes, newfl->client_cookie.n_bytes, matchcookie->n_len);
409 newfl->addr = malloc(addr->sa_len);
410 if (newfl->addr == NULL) {
411 free(newfl->client_cookie.n_bytes);
412 free(newfl->client.oh.n_bytes);
416 memcpy(newfl->addr, addr, addr->sa_len);
422 * file_file_lock: Force creation of a valid file lock
425 fill_file_lock(struct file_lock *fl, const fhandle_t *fh,
426 const bool_t exclusive, const int32_t svid,
427 const u_int64_t offset, const u_int64_t len,
428 const int state, const int status, const int flags, const int blocking)
430 bcopy(fh, &fl->filehandle, sizeof(fhandle_t));
432 fl->client.exclusive = exclusive;
433 fl->client.svid = svid;
434 fl->client.l_offset = offset;
435 fl->client.l_len = len;
437 fl->nsm_status = state;
440 fl->blocking = blocking;
444 * deallocate_file_lock: Free all storage associated with a file lock
447 deallocate_file_lock(struct file_lock *fl)
450 free(fl->client.oh.n_bytes);
451 free(fl->client_cookie.n_bytes);
456 * regions_overlap(): This function examines the two provided regions for
460 regions_overlap(const u_int64_t start1, const u_int64_t len1,
461 const u_int64_t start2, const u_int64_t len2)
463 u_int64_t d1,d2,d3,d4;
464 enum split_status result;
466 debuglog("Entering region overlap with vals: %llu:%llu--%llu:%llu\n",
467 start1, len1, start2, len2);
469 result = region_compare(start1, len1, start2, len2,
472 debuglog("Exiting region overlap with val: %d\n",result);
474 if (result == SPL_DISJOINT) {
482 * region_compare(): Examine lock regions and split appropriately
484 * XXX: Fix 64 bit overflow problems
485 * XXX: Check to make sure I got *ALL* the cases.
486 * XXX: This DESPERATELY needs a regression test.
489 region_compare(const u_int64_t starte, const u_int64_t lene,
490 const u_int64_t startu, const u_int64_t lenu, u_int64_t *start1,
491 u_int64_t *len1, u_int64_t *start2, u_int64_t *len2)
494 * Please pay attention to the sequential exclusions
495 * of the if statements!!!
499 enum split_status retval;
501 retval = SPL_DISJOINT;
503 if (lene == 0 && lenu == 0) {
504 /* Examine left edge of locker */
505 lflags = LEDGE_INSIDE;
506 if (startu < starte) {
508 } else if (startu == starte) {
509 lflags = LEDGE_LBOUNDARY;
512 rflags = REDGE_RBOUNDARY; /* Both are infiinite */
514 if (lflags == LEDGE_INSIDE) {
516 *len1 = startu - starte;
519 if (lflags == LEDGE_LEFT || lflags == LEDGE_LBOUNDARY) {
520 retval = SPL_CONTAINED;
524 } else if (lene == 0 && lenu != 0) {
525 /* Established lock is infinite */
526 /* Examine left edge of unlocker */
527 lflags = LEDGE_INSIDE;
528 if (startu < starte) {
530 } else if (startu == starte) {
531 lflags = LEDGE_LBOUNDARY;
534 /* Examine right edge of unlocker */
535 if (startu + lenu < starte) {
536 /* Right edge of unlocker left of established lock */
539 } else if (startu + lenu == starte) {
540 /* Right edge of unlocker on start of established lock */
541 rflags = REDGE_LBOUNDARY;
543 } else { /* Infinifty is right of finity */
544 /* Right edge of unlocker inside established lock */
545 rflags = REDGE_INSIDE;
548 if (lflags == LEDGE_INSIDE) {
550 *len1 = startu - starte;
554 if (rflags == REDGE_INSIDE) {
555 /* Create right lock */
556 *start2 = startu+lenu;
560 } else if (lene != 0 && lenu == 0) {
561 /* Unlocker is infinite */
562 /* Examine left edge of unlocker */
563 lflags = LEDGE_RIGHT;
564 if (startu < starte) {
566 retval = SPL_CONTAINED;
568 } else if (startu == starte) {
569 lflags = LEDGE_LBOUNDARY;
570 retval = SPL_CONTAINED;
572 } else if ((startu > starte) && (startu < starte + lene - 1)) {
573 lflags = LEDGE_INSIDE;
574 } else if (startu == starte + lene - 1) {
575 lflags = LEDGE_RBOUNDARY;
576 } else { /* startu > starte + lene -1 */
577 lflags = LEDGE_RIGHT;
581 rflags = REDGE_RIGHT; /* Infinity is right of finity */
583 if (lflags == LEDGE_INSIDE || lflags == LEDGE_RBOUNDARY) {
585 *len1 = startu - starte;
590 /* Both locks are finite */
592 /* Examine left edge of unlocker */
593 lflags = LEDGE_RIGHT;
594 if (startu < starte) {
596 } else if (startu == starte) {
597 lflags = LEDGE_LBOUNDARY;
598 } else if ((startu > starte) && (startu < starte + lene - 1)) {
599 lflags = LEDGE_INSIDE;
600 } else if (startu == starte + lene - 1) {
601 lflags = LEDGE_RBOUNDARY;
602 } else { /* startu > starte + lene -1 */
603 lflags = LEDGE_RIGHT;
607 /* Examine right edge of unlocker */
608 if (startu + lenu < starte) {
609 /* Right edge of unlocker left of established lock */
612 } else if (startu + lenu == starte) {
613 /* Right edge of unlocker on start of established lock */
614 rflags = REDGE_LBOUNDARY;
616 } else if (startu + lenu < starte + lene) {
617 /* Right edge of unlocker inside established lock */
618 rflags = REDGE_INSIDE;
619 } else if (startu + lenu == starte + lene) {
620 /* Right edge of unlocker on right edge of established lock */
621 rflags = REDGE_RBOUNDARY;
622 } else { /* startu + lenu > starte + lene */
623 /* Right edge of unlocker is right of established lock */
624 rflags = REDGE_RIGHT;
627 if (lflags == LEDGE_INSIDE || lflags == LEDGE_RBOUNDARY) {
628 /* Create left lock */
630 *len1 = (startu - starte);
634 if (rflags == REDGE_INSIDE) {
635 /* Create right lock */
636 *start2 = startu+lenu;
637 *len2 = starte+lene-(startu+lenu);
641 if ((lflags == LEDGE_LEFT || lflags == LEDGE_LBOUNDARY) &&
642 (rflags == REDGE_RBOUNDARY || rflags == REDGE_RIGHT)) {
643 retval = SPL_CONTAINED;
650 * same_netobj: Compares the apprpriate bits of a netobj for identity
653 same_netobj(const netobj *n0, const netobj *n1)
659 debuglog("Entering netobj identity check\n");
661 if (n0->n_len == n1->n_len) {
662 debuglog("Preliminary length check passed\n");
663 retval = !bcmp(n0->n_bytes, n1->n_bytes, n0->n_len);
664 debuglog("netobj %smatch\n", retval ? "" : "mis");
671 * same_filelock_identity: Compares the appropriate bits of a file_lock
674 same_filelock_identity(const struct file_lock *fl0, const struct file_lock *fl1)
680 debuglog("Checking filelock identity\n");
683 * Check process ids and host information.
685 retval = (fl0->client.svid == fl1->client.svid &&
686 same_netobj(&(fl0->client.oh), &(fl1->client.oh)));
688 debuglog("Exiting checking filelock identity: retval: %d\n",retval);
694 * Below here are routines associated with manipulating the NFS
699 * get_lock_matching_unlock: Return a lock which matches the given unlock lock
701 * XXX: It is a shame that this duplicates so much code from test_nfslock.
704 get_lock_matching_unlock(const struct file_lock *fl)
706 struct file_lock *ifl; /* Iterator */
708 debuglog("Entering get_lock_matching_unlock\n");
709 debuglog("********Dump of fl*****************\n");
712 LIST_FOREACH(ifl, &nfslocklist_head, nfslocklist) {
713 debuglog("Pointer to file lock: %p\n",ifl);
715 debuglog("****Dump of ifl****\n");
717 debuglog("*******************\n");
720 * XXX: It is conceivable that someone could use the NLM RPC
721 * system to directly access filehandles. This may be a
722 * security hazard as the filehandle code may bypass normal
723 * file access controls
725 if (bcmp(&fl->filehandle, &ifl->filehandle, sizeof(fhandle_t)))
728 debuglog("get_lock_matching_unlock: Filehandles match, "
729 "checking regions\n");
731 /* Filehandles match, check for region overlap */
732 if (!regions_overlap(fl->client.l_offset, fl->client.l_len,
733 ifl->client.l_offset, ifl->client.l_len))
736 debuglog("get_lock_matching_unlock: Region overlap"
737 " found %llu : %llu -- %llu : %llu\n",
738 fl->client.l_offset,fl->client.l_len,
739 ifl->client.l_offset,ifl->client.l_len);
741 /* Regions overlap, check the identity */
742 if (!same_filelock_identity(fl,ifl))
745 debuglog("get_lock_matching_unlock: Duplicate lock id. Granting\n");
749 debuglog("Exiting bet_lock_matching_unlock\n");
755 * test_nfslock: check for NFS lock in lock list
757 * This routine makes the following assumptions:
758 * 1) Nothing will adjust the lock list during a lookup
760 * This routine has an interesting quirk which bit me hard.
761 * The conflicting_fl is the pointer to the conflicting lock.
762 * However, to modify the "*pointer* to the conflicting lock" rather
763 * that the "conflicting lock itself" one must pass in a "pointer to
764 * the pointer of the conflicting lock". Gross.
768 test_nfslock(const struct file_lock *fl, struct file_lock **conflicting_fl)
770 struct file_lock *ifl; /* Iterator */
771 enum nfslock_status retval;
773 debuglog("Entering test_nfslock\n");
775 retval = NFS_GRANTED;
776 (*conflicting_fl) = NULL;
778 debuglog("Entering lock search loop\n");
780 debuglog("***********************************\n");
781 debuglog("Dumping match filelock\n");
782 debuglog("***********************************\n");
784 debuglog("***********************************\n");
786 LIST_FOREACH(ifl, &nfslocklist_head, nfslocklist) {
787 if (retval == NFS_DENIED)
790 debuglog("Top of lock loop\n");
791 debuglog("Pointer to file lock: %p\n",ifl);
793 debuglog("***********************************\n");
794 debuglog("Dumping test filelock\n");
795 debuglog("***********************************\n");
797 debuglog("***********************************\n");
800 * XXX: It is conceivable that someone could use the NLM RPC
801 * system to directly access filehandles. This may be a
802 * security hazard as the filehandle code may bypass normal
803 * file access controls
805 if (bcmp(&fl->filehandle, &ifl->filehandle, sizeof(fhandle_t)))
808 debuglog("test_nfslock: filehandle match found\n");
810 /* Filehandles match, check for region overlap */
811 if (!regions_overlap(fl->client.l_offset, fl->client.l_len,
812 ifl->client.l_offset, ifl->client.l_len))
815 debuglog("test_nfslock: Region overlap found"
816 " %llu : %llu -- %llu : %llu\n",
817 fl->client.l_offset,fl->client.l_len,
818 ifl->client.l_offset,ifl->client.l_len);
820 /* Regions overlap, check the exclusivity */
821 if (!(fl->client.exclusive || ifl->client.exclusive))
824 debuglog("test_nfslock: Exclusivity failure: %d %d\n",
825 fl->client.exclusive,
826 ifl->client.exclusive);
828 if (same_filelock_identity(fl,ifl)) {
829 debuglog("test_nfslock: Duplicate id. Granting\n");
830 (*conflicting_fl) = ifl;
831 retval = NFS_GRANTED_DUPLICATE;
833 /* locking attempt fails */
834 debuglog("test_nfslock: Lock attempt failed\n");
835 debuglog("Desired lock\n");
837 debuglog("Conflicting lock\n");
839 (*conflicting_fl) = ifl;
844 debuglog("Dumping file locks\n");
845 debuglog("Exiting test_nfslock\n");
851 * lock_nfslock: attempt to create a lock in the NFS lock list
853 * This routine tests whether the lock will be granted and then adds
854 * the entry to the lock list if so.
856 * Argument fl gets modified as its list housekeeping entries get modified
857 * upon insertion into the NFS lock list
859 * This routine makes several assumptions:
860 * 1) It is perfectly happy to grant a duplicate lock from the same pid.
861 * While this seems to be intuitively wrong, it is required for proper
862 * Posix semantics during unlock. It is absolutely imperative to not
863 * unlock the main lock before the two child locks are established. Thus,
864 * one has to be able to create duplicate locks over an existing lock
865 * 2) It currently accepts duplicate locks from the same id,pid
869 lock_nfslock(struct file_lock *fl)
871 enum nfslock_status retval;
872 struct file_lock *dummy_fl;
876 debuglog("Entering lock_nfslock...\n");
878 retval = test_nfslock(fl,&dummy_fl);
880 if (retval == NFS_GRANTED || retval == NFS_GRANTED_DUPLICATE) {
881 debuglog("Inserting lock...\n");
883 LIST_INSERT_HEAD(&nfslocklist_head, fl, nfslocklist);
886 debuglog("Exiting lock_nfslock...\n");
892 * delete_nfslock: delete an NFS lock list entry
894 * This routine is used to delete a lock out of the NFS lock list
895 * without regard to status, underlying locks, regions or anything else
897 * Note that this routine *does not deallocate memory* of the lock.
898 * It just disconnects it from the list. The lock can then be used
899 * by other routines without fear of trashing the list.
903 delete_nfslock(struct file_lock *fl)
906 LIST_REMOVE(fl, nfslocklist);
908 return (NFS_GRANTED);
912 split_nfslock(const struct file_lock *exist_lock,
913 const struct file_lock *unlock_lock, struct file_lock **left_lock,
914 struct file_lock **right_lock)
916 u_int64_t start1, len1, start2, len2;
917 enum split_status spstatus;
919 spstatus = region_compare(exist_lock->client.l_offset, exist_lock->client.l_len,
920 unlock_lock->client.l_offset, unlock_lock->client.l_len,
921 &start1, &len1, &start2, &len2);
923 if ((spstatus & SPL_LOCK1) != 0) {
924 *left_lock = allocate_file_lock(&exist_lock->client.oh, &exist_lock->client_cookie, exist_lock->addr, exist_lock->client_name);
925 if (*left_lock == NULL) {
926 debuglog("Unable to allocate resource for split 1\n");
930 fill_file_lock(*left_lock, &exist_lock->filehandle,
931 exist_lock->client.exclusive, exist_lock->client.svid,
933 exist_lock->nsm_status,
934 exist_lock->status, exist_lock->flags, exist_lock->blocking);
937 if ((spstatus & SPL_LOCK2) != 0) {
938 *right_lock = allocate_file_lock(&exist_lock->client.oh, &exist_lock->client_cookie, exist_lock->addr, exist_lock->client_name);
939 if (*right_lock == NULL) {
940 debuglog("Unable to allocate resource for split 1\n");
941 if (*left_lock != NULL) {
942 deallocate_file_lock(*left_lock);
947 fill_file_lock(*right_lock, &exist_lock->filehandle,
948 exist_lock->client.exclusive, exist_lock->client.svid,
950 exist_lock->nsm_status,
951 exist_lock->status, exist_lock->flags, exist_lock->blocking);
958 unlock_nfslock(const struct file_lock *fl, struct file_lock **released_lock,
959 struct file_lock **left_lock, struct file_lock **right_lock)
961 struct file_lock *mfl; /* Matching file lock */
962 enum nfslock_status retval;
963 enum split_status spstatus;
965 debuglog("Entering unlock_nfslock\n");
967 *released_lock = NULL;
971 retval = NFS_DENIED_NOLOCK;
973 debuglog("Attempting to match lock...\n");
974 mfl = get_lock_matching_unlock(fl);
977 debuglog("Unlock matched. Querying for split\n");
979 spstatus = split_nfslock(mfl, fl, left_lock, right_lock);
981 debuglog("Split returned %d %p %p %p %p\n",spstatus,mfl,fl,*left_lock,*right_lock);
982 debuglog("********Split dumps********");
985 dump_filelock(*left_lock);
986 dump_filelock(*right_lock);
987 debuglog("********End Split dumps********");
989 if (spstatus == SPL_RESERR) {
990 if (*left_lock != NULL) {
991 deallocate_file_lock(*left_lock);
995 if (*right_lock != NULL) {
996 deallocate_file_lock(*right_lock);
1003 /* Insert new locks from split if required */
1004 if (*left_lock != NULL) {
1005 debuglog("Split left activated\n");
1006 LIST_INSERT_HEAD(&nfslocklist_head, *left_lock, nfslocklist);
1009 if (*right_lock != NULL) {
1010 debuglog("Split right activated\n");
1011 LIST_INSERT_HEAD(&nfslocklist_head, *right_lock, nfslocklist);
1014 /* Unlock the lock since it matches identity */
1015 LIST_REMOVE(mfl, nfslocklist);
1016 *released_lock = mfl;
1017 retval = NFS_GRANTED;
1020 debuglog("Exiting unlock_nfslock\n");
1026 * Below here are the routines for manipulating the file lock directly
1027 * on the disk hardware itself
1030 lock_hwlock(struct file_lock *fl)
1032 struct monfile *imf,*nmf;
1033 int lflags, flerror;
1035 /* Scan to see if filehandle already present */
1036 LIST_FOREACH(imf, &monfilelist_head, monfilelist) {
1037 if (bcmp(&fl->filehandle, &imf->filehandle,
1038 sizeof(fl->filehandle)) == 0) {
1039 /* imf is the correct filehandle */
1045 * Filehandle already exists (we control the file)
1046 * *AND* NFS has already cleared the lock for availability
1047 * Grant it and bump the refcount.
1051 return (HW_GRANTED);
1054 /* No filehandle found, create and go */
1055 nmf = malloc(sizeof(struct monfile));
1057 debuglog("hwlock resource allocation failure\n");
1061 /* XXX: Is O_RDWR always the correct mode? */
1062 nmf->fd = fhopen(&fl->filehandle, O_RDWR);
1064 debuglog("fhopen failed (from %16s): %32s\n",
1065 fl->client_name, strerror(errno));
1069 return (HW_STALEFH);
1071 return (HW_READONLY);
1077 /* File opened correctly, fill the monitor struct */
1078 bcopy(&fl->filehandle, &nmf->filehandle, sizeof(fl->filehandle));
1080 nmf->exclusive = fl->client.exclusive;
1082 lflags = (nmf->exclusive == 1) ?
1083 (LOCK_EX | LOCK_NB) : (LOCK_SH | LOCK_NB);
1085 flerror = flock(nmf->fd, lflags);
1088 debuglog("flock failed (from %16s): %32s\n",
1089 fl->client_name, strerror(errno));
1096 return (HW_STALEFH);
1098 return (HW_READONLY);
1105 /* File opened and locked */
1106 LIST_INSERT_HEAD(&monfilelist_head, nmf, monfilelist);
1108 debuglog("flock succeeded (from %16s)\n", fl->client_name);
1109 return (HW_GRANTED);
1113 unlock_hwlock(const struct file_lock *fl)
1115 struct monfile *imf;
1117 debuglog("Entering unlock_hwlock\n");
1118 debuglog("Entering loop interation\n");
1120 /* Scan to see if filehandle already present */
1121 LIST_FOREACH(imf, &monfilelist_head, monfilelist) {
1122 if (bcmp(&fl->filehandle, &imf->filehandle,
1123 sizeof(fl->filehandle)) == 0) {
1124 /* imf is the correct filehandle */
1129 debuglog("Completed iteration. Proceeding\n");
1133 debuglog("Exiting unlock_hwlock (HW_DENIED_NOLOCK)\n");
1134 return (HW_DENIED_NOLOCK);
1140 if (imf->refcount < 0) {
1141 debuglog("Negative hardware reference count\n");
1144 if (imf->refcount <= 0) {
1146 LIST_REMOVE(imf, monfilelist);
1149 debuglog("Exiting unlock_hwlock (HW_GRANTED)\n");
1150 return (HW_GRANTED);
1154 test_hwlock(const struct file_lock *fl __unused,
1155 struct file_lock **conflicting_fl __unused)
1159 * XXX: lock tests on hardware are not required until
1160 * true partial file testing is done on the underlying file
1168 * Below here are routines for manipulating blocked lock requests
1169 * They should only be called from the XXX_partialfilelock routines
1170 * if at all possible
1174 duplicate_block(struct file_lock *fl)
1176 struct file_lock *ifl;
1179 debuglog("Entering duplicate_block");
1182 * Is this lock request already on the blocking list?
1183 * Consider it a dupe if the file handles, offset, length,
1184 * exclusivity and client match.
1186 LIST_FOREACH(ifl, &blockedlocklist_head, nfslocklist) {
1187 if (!bcmp(&fl->filehandle, &ifl->filehandle,
1188 sizeof(fhandle_t)) &&
1189 fl->client.exclusive == ifl->client.exclusive &&
1190 fl->client.l_offset == ifl->client.l_offset &&
1191 fl->client.l_len == ifl->client.l_len &&
1192 same_filelock_identity(fl, ifl)) {
1198 debuglog("Exiting duplicate_block: %s\n", retval ? "already blocked"
1199 : "not already blocked");
1204 add_blockingfilelock(struct file_lock *fl)
1206 debuglog("Entering add_blockingfilelock\n");
1209 * A blocking lock request _should_ never be duplicated as a client
1210 * that is already blocked shouldn't be able to request another
1211 * lock. Alas, there are some buggy clients that do request the same
1212 * lock repeatedly. Make sure only unique locks are on the blocked
1215 if (duplicate_block(fl)) {
1216 debuglog("Exiting add_blockingfilelock: already blocked\n");
1221 * Clear the blocking flag so that it can be reused without
1222 * adding it to the blocking queue a second time
1226 LIST_INSERT_HEAD(&blockedlocklist_head, fl, nfslocklist);
1228 debuglog("Exiting add_blockingfilelock: added blocked lock\n");
1232 remove_blockingfilelock(struct file_lock *fl)
1235 debuglog("Entering remove_blockingfilelock\n");
1237 LIST_REMOVE(fl, nfslocklist);
1239 debuglog("Exiting remove_blockingfilelock\n");
1243 clear_blockingfilelock(const char *hostname)
1245 struct file_lock *ifl,*nfl;
1248 * Normally, LIST_FOREACH is called for, but since
1249 * the current element *is* the iterator, deleting it
1250 * would mess up the iteration. Thus, a next element
1251 * must be used explicitly
1254 ifl = LIST_FIRST(&blockedlocklist_head);
1256 while (ifl != NULL) {
1257 nfl = LIST_NEXT(ifl, nfslocklist);
1259 if (strncmp(hostname, ifl->client_name, SM_MAXSTRLEN) == 0) {
1260 remove_blockingfilelock(ifl);
1261 deallocate_file_lock(ifl);
1269 retry_blockingfilelocklist(void)
1271 /* Retry all locks in the blocked list */
1272 struct file_lock *ifl, *nfl; /* Iterator */
1273 enum partialfilelock_status pflstatus;
1275 debuglog("Entering retry_blockingfilelocklist\n");
1277 LIST_FOREACH_SAFE(ifl, &blockedlocklist_head, nfslocklist, nfl) {
1278 debuglog("Iterator choice %p\n",ifl);
1279 debuglog("Next iterator choice %p\n",nfl);
1282 * SUBTLE BUG: The file_lock must be removed from the
1283 * old list so that it's list pointers get disconnected
1284 * before being allowed to participate in the new list
1285 * which will automatically add it in if necessary.
1288 LIST_REMOVE(ifl, nfslocklist);
1289 pflstatus = lock_partialfilelock(ifl);
1291 if (pflstatus == PFL_GRANTED || pflstatus == PFL_GRANTED_DUPLICATE) {
1292 debuglog("Granted blocked lock\n");
1293 /* lock granted and is now being used */
1294 send_granted(ifl,0);
1296 /* Reinsert lock back into blocked list */
1297 debuglog("Replacing blocked lock\n");
1298 LIST_INSERT_HEAD(&blockedlocklist_head, ifl, nfslocklist);
1302 debuglog("Exiting retry_blockingfilelocklist\n");
1306 * Below here are routines associated with manipulating all
1307 * aspects of the partial file locking system (list, hardware, etc.)
1311 * Please note that lock monitoring must be done at this level which
1312 * keeps track of *individual* lock requests on lock and unlock
1314 * XXX: Split unlocking is going to make the unlock code miserable
1318 * lock_partialfilelock:
1320 * Argument fl gets modified as its list housekeeping entries get modified
1321 * upon insertion into the NFS lock list
1323 * This routine makes several assumptions:
1324 * 1) It (will) pass locks through to flock to lock the entire underlying file
1325 * and then parcel out NFS locks if it gets control of the file.
1326 * This matches the old rpc.lockd file semantics (except where it
1327 * is now more correct). It is the safe solution, but will cause
1328 * overly restrictive blocking if someone is trying to use the
1329 * underlying files without using NFS. This appears to be an
1330 * acceptable tradeoff since most people use standalone NFS servers.
1331 * XXX: The right solution is probably kevent combined with fcntl
1333 * 2) Nothing modifies the lock lists between testing and granting
1334 * I have no idea whether this is a useful assumption or not
1337 enum partialfilelock_status
1338 lock_partialfilelock(struct file_lock *fl)
1340 enum partialfilelock_status retval;
1341 enum nfslock_status lnlstatus;
1342 enum hwlock_status hwstatus;
1344 debuglog("Entering lock_partialfilelock\n");
1346 retval = PFL_DENIED;
1349 * Execute the NFS lock first, if possible, as it is significantly
1350 * easier and less expensive to undo than the filesystem lock
1353 lnlstatus = lock_nfslock(fl);
1355 switch (lnlstatus) {
1357 case NFS_GRANTED_DUPLICATE:
1359 * At this point, the NFS lock is allocated and active.
1360 * Remember to clean it up if the hardware lock fails
1362 hwstatus = lock_hwlock(fl);
1366 case HW_GRANTED_DUPLICATE:
1367 debuglog("HW GRANTED\n");
1369 * XXX: Fixme: Check hwstatus for duplicate when
1370 * true partial file locking and accounting is
1371 * done on the hardware.
1373 if (lnlstatus == NFS_GRANTED_DUPLICATE) {
1374 retval = PFL_GRANTED_DUPLICATE;
1376 retval = PFL_GRANTED;
1378 monitor_lock_host(fl->client_name);
1381 debuglog("HW RESERR\n");
1382 retval = PFL_HWRESERR;
1385 debuglog("HW DENIED\n");
1386 retval = PFL_HWDENIED;
1389 debuglog("Unmatched hwstatus %d\n",hwstatus);
1393 if (retval != PFL_GRANTED &&
1394 retval != PFL_GRANTED_DUPLICATE) {
1395 /* Clean up the NFS lock */
1396 debuglog("Deleting trial NFS lock\n");
1401 retval = PFL_NFSDENIED;
1404 retval = PFL_NFSRESERR;
1407 debuglog("Unmatched lnlstatus %d\n");
1408 retval = PFL_NFSDENIED_NOLOCK;
1413 * By the time fl reaches here, it is completely free again on
1414 * failure. The NFS lock done before attempting the
1415 * hardware lock has been backed out
1418 if (retval == PFL_NFSDENIED || retval == PFL_HWDENIED) {
1419 /* Once last chance to check the lock */
1420 if (fl->blocking == 1) {
1421 if (retval == PFL_NFSDENIED) {
1422 /* Queue the lock */
1423 debuglog("BLOCKING LOCK RECEIVED\n");
1424 retval = PFL_NFSBLOCKED;
1425 add_blockingfilelock(fl);
1428 /* retval is okay as PFL_HWDENIED */
1429 debuglog("BLOCKING LOCK DENIED IN HARDWARE\n");
1433 /* Leave retval alone, it's already correct */
1434 debuglog("Lock denied. Non-blocking failure\n");
1439 debuglog("Exiting lock_partialfilelock\n");
1445 * unlock_partialfilelock:
1447 * Given a file_lock, unlock all locks which match.
1449 * Note that a given lock might have to unlock ITSELF! See
1450 * clear_partialfilelock for example.
1453 enum partialfilelock_status
1454 unlock_partialfilelock(const struct file_lock *fl)
1456 struct file_lock *lfl,*rfl,*releasedfl,*selffl;
1457 enum partialfilelock_status retval;
1458 enum nfslock_status unlstatus;
1459 enum hwlock_status unlhwstatus, lhwstatus;
1461 debuglog("Entering unlock_partialfilelock\n");
1467 retval = PFL_DENIED;
1470 * There are significant overlap and atomicity issues
1471 * with partially releasing a lock. For example, releasing
1472 * part of an NFS shared lock does *not* always release the
1473 * corresponding part of the file since there is only one
1474 * rpc.lockd UID but multiple users could be requesting it
1475 * from NFS. Also, an unlock request should never allow
1476 * another process to gain a lock on the remaining parts.
1477 * ie. Always apply the new locks before releasing the
1482 * Loop is required since multiple little locks
1483 * can be allocated and then deallocated with one
1486 * The loop is required to be here so that the nfs &
1487 * hw subsystems do not need to communicate with one
1492 debuglog("Value of releasedfl: %p\n",releasedfl);
1493 /* lfl&rfl are created *AND* placed into the NFS lock list if required */
1494 unlstatus = unlock_nfslock(fl, &releasedfl, &lfl, &rfl);
1495 debuglog("Value of releasedfl: %p\n",releasedfl);
1498 /* XXX: This is grungy. It should be refactored to be cleaner */
1500 lhwstatus = lock_hwlock(lfl);
1501 if (lhwstatus != HW_GRANTED &&
1502 lhwstatus != HW_GRANTED_DUPLICATE) {
1503 debuglog("HW duplicate lock failure for left split\n");
1505 monitor_lock_host(lfl->client_name);
1509 lhwstatus = lock_hwlock(rfl);
1510 if (lhwstatus != HW_GRANTED &&
1511 lhwstatus != HW_GRANTED_DUPLICATE) {
1512 debuglog("HW duplicate lock failure for right split\n");
1514 monitor_lock_host(rfl->client_name);
1517 switch (unlstatus) {
1519 /* Attempt to unlock on the hardware */
1520 debuglog("NFS unlock granted. Attempting hardware unlock\n");
1522 /* This call *MUST NOT* unlock the two newly allocated locks */
1523 unlhwstatus = unlock_hwlock(fl);
1524 debuglog("HW unlock returned with code %d\n",unlhwstatus);
1526 switch (unlhwstatus) {
1528 debuglog("HW unlock granted\n");
1529 unmonitor_lock_host(releasedfl->client_name);
1530 retval = PFL_GRANTED;
1532 case HW_DENIED_NOLOCK:
1533 /* Huh?!?! This shouldn't happen */
1534 debuglog("HW unlock denied no lock\n");
1535 retval = PFL_HWRESERR;
1536 /* Break out of do-while */
1537 unlstatus = NFS_RESERR;
1540 debuglog("HW unlock failed\n");
1541 retval = PFL_HWRESERR;
1542 /* Break out of do-while */
1543 unlstatus = NFS_RESERR;
1547 debuglog("Exiting with status retval: %d\n",retval);
1549 retry_blockingfilelocklist();
1551 case NFS_DENIED_NOLOCK:
1552 retval = PFL_GRANTED;
1553 debuglog("All locks cleaned out\n");
1556 retval = PFL_NFSRESERR;
1557 debuglog("NFS unlock failure\n");
1562 if (releasedfl != NULL) {
1563 if (fl == releasedfl) {
1565 * XXX: YECHHH!!! Attempt to unlock self succeeded
1566 * but we can't deallocate the space yet. This is what
1567 * happens when you don't write malloc and free together
1569 debuglog("Attempt to unlock self\n");
1570 selffl = releasedfl;
1573 * XXX: this deallocation *still* needs to migrate closer
1574 * to the allocation code way up in get_lock or the allocation
1575 * code needs to migrate down (violation of "When you write
1576 * malloc you must write free")
1579 deallocate_file_lock(releasedfl);
1584 } while (unlstatus == NFS_GRANTED);
1586 if (selffl != NULL) {
1588 * This statement wipes out the incoming file lock (fl)
1589 * in spite of the fact that it is declared const
1591 debuglog("WARNING! Destroying incoming lock pointer\n");
1592 deallocate_file_lock(selffl);
1595 debuglog("Exiting unlock_partialfilelock\n");
1601 * clear_partialfilelock
1603 * Normally called in response to statd state number change.
1604 * Wipe out all locks held by a host. As a bonus, the act of
1605 * doing so should automatically clear their statd entries and
1606 * unmonitor the host.
1610 clear_partialfilelock(const char *hostname)
1612 struct file_lock *ifl, *nfl;
1614 /* Clear blocking file lock list */
1615 clear_blockingfilelock(hostname);
1617 /* do all required unlocks */
1618 /* Note that unlock can smash the current pointer to a lock */
1621 * Normally, LIST_FOREACH is called for, but since
1622 * the current element *is* the iterator, deleting it
1623 * would mess up the iteration. Thus, a next element
1624 * must be used explicitly
1627 ifl = LIST_FIRST(&nfslocklist_head);
1629 while (ifl != NULL) {
1630 nfl = LIST_NEXT(ifl, nfslocklist);
1632 if (strncmp(hostname, ifl->client_name, SM_MAXSTRLEN) == 0) {
1633 /* Unlock destroys ifl out from underneath */
1634 unlock_partialfilelock(ifl);
1635 /* ifl is NO LONGER VALID AT THIS POINT */
1642 * test_partialfilelock:
1644 enum partialfilelock_status
1645 test_partialfilelock(const struct file_lock *fl,
1646 struct file_lock **conflicting_fl)
1648 enum partialfilelock_status retval;
1649 enum nfslock_status teststatus;
1651 debuglog("Entering testpartialfilelock...\n");
1653 retval = PFL_DENIED;
1655 teststatus = test_nfslock(fl, conflicting_fl);
1656 debuglog("test_partialfilelock: teststatus %d\n",teststatus);
1658 if (teststatus == NFS_GRANTED || teststatus == NFS_GRANTED_DUPLICATE) {
1659 /* XXX: Add the underlying filesystem locking code */
1660 retval = (teststatus == NFS_GRANTED) ?
1661 PFL_GRANTED : PFL_GRANTED_DUPLICATE;
1662 debuglog("Dumping locks...\n");
1664 dump_filelock(*conflicting_fl);
1665 debuglog("Done dumping locks...\n");
1667 retval = PFL_NFSDENIED;
1668 debuglog("NFS test denied.\n");
1670 debuglog("Conflicting.\n");
1671 dump_filelock(*conflicting_fl);
1674 debuglog("Exiting testpartialfilelock...\n");
1680 * Below here are routines associated with translating the partial file locking
1681 * codes into useful codes to send back to the NFS RPC messaging system
1685 * These routines translate the (relatively) useful return codes back onto
1686 * the few return codes which the nlm subsystems wishes to trasmit
1690 do_test(struct file_lock *fl, struct file_lock **conflicting_fl)
1692 enum partialfilelock_status pfsret;
1693 enum nlm_stats retval;
1695 debuglog("Entering do_test...\n");
1697 pfsret = test_partialfilelock(fl,conflicting_fl);
1701 debuglog("PFL test lock granted\n");
1703 dump_filelock(*conflicting_fl);
1704 retval = (fl->flags & LOCK_V4) ? nlm4_granted : nlm_granted;
1706 case PFL_GRANTED_DUPLICATE:
1707 debuglog("PFL test lock granted--duplicate id detected\n");
1709 dump_filelock(*conflicting_fl);
1710 debuglog("Clearing conflicting_fl for call semantics\n");
1711 *conflicting_fl = NULL;
1712 retval = (fl->flags & LOCK_V4) ? nlm4_granted : nlm_granted;
1716 debuglog("PFL test lock denied\n");
1718 dump_filelock(*conflicting_fl);
1719 retval = (fl->flags & LOCK_V4) ? nlm4_denied : nlm_denied;
1723 debuglog("PFL test lock resource fail\n");
1725 dump_filelock(*conflicting_fl);
1726 retval = (fl->flags & LOCK_V4) ? nlm4_denied_nolocks : nlm_denied_nolocks;
1729 debuglog("PFL test lock *FAILED*\n");
1731 dump_filelock(*conflicting_fl);
1732 retval = (fl->flags & LOCK_V4) ? nlm4_failed : nlm_denied;
1736 debuglog("Exiting do_test...\n");
1742 * do_lock: Try to acquire a lock
1744 * This routine makes a distinction between NLM versions. I am pretty
1745 * convinced that this should be abstracted out and bounced up a level
1749 do_lock(struct file_lock *fl)
1751 enum partialfilelock_status pfsret;
1752 enum nlm_stats retval;
1754 debuglog("Entering do_lock...\n");
1756 pfsret = lock_partialfilelock(fl);
1760 debuglog("PFL lock granted");
1762 retval = (fl->flags & LOCK_V4) ? nlm4_granted : nlm_granted;
1764 case PFL_GRANTED_DUPLICATE:
1765 debuglog("PFL lock granted--duplicate id detected");
1767 retval = (fl->flags & LOCK_V4) ? nlm4_granted : nlm_granted;
1771 debuglog("PFL_NFS lock denied");
1773 retval = (fl->flags & LOCK_V4) ? nlm4_denied : nlm_denied;
1775 case PFL_NFSBLOCKED:
1777 debuglog("PFL_NFS blocking lock denied. Queued.\n");
1779 retval = (fl->flags & LOCK_V4) ? nlm4_blocked : nlm_blocked;
1783 debuglog("PFL lock resource alocation fail\n");
1785 retval = (fl->flags & LOCK_V4) ? nlm4_denied_nolocks : nlm_denied_nolocks;
1788 debuglog("PFL lock *FAILED*");
1790 retval = (fl->flags & LOCK_V4) ? nlm4_failed : nlm_denied;
1794 debuglog("Exiting do_lock...\n");
1800 do_unlock(struct file_lock *fl)
1802 enum partialfilelock_status pfsret;
1803 enum nlm_stats retval;
1805 debuglog("Entering do_unlock...\n");
1806 pfsret = unlock_partialfilelock(fl);
1810 debuglog("PFL unlock granted");
1812 retval = (fl->flags & LOCK_V4) ? nlm4_granted : nlm_granted;
1816 debuglog("PFL_NFS unlock denied");
1818 retval = (fl->flags & LOCK_V4) ? nlm4_denied : nlm_denied;
1820 case PFL_NFSDENIED_NOLOCK:
1821 case PFL_HWDENIED_NOLOCK:
1822 debuglog("PFL_NFS no lock found\n");
1823 retval = (fl->flags & LOCK_V4) ? nlm4_granted : nlm_granted;
1827 debuglog("PFL unlock resource failure");
1829 retval = (fl->flags & LOCK_V4) ? nlm4_denied_nolocks : nlm_denied_nolocks;
1832 debuglog("PFL unlock *FAILED*");
1834 retval = (fl->flags & LOCK_V4) ? nlm4_failed : nlm_denied;
1838 debuglog("Exiting do_unlock...\n");
1846 * This routine is non-existent because it doesn't have a return code.
1847 * It is here for completeness in case someone *does* need to do return
1848 * codes later. A decent compiler should optimize this away.
1852 do_clear(const char *hostname)
1855 clear_partialfilelock(hostname);
1859 * The following routines are all called from the code which the
1864 * testlock(): inform the caller if the requested lock would be granted
1866 * returns NULL if lock would granted
1867 * returns pointer to a conflicting nlm4_holder if not
1870 struct nlm4_holder *
1871 testlock(struct nlm4_lock *lock, bool_t exclusive, int flags __unused)
1873 struct file_lock test_fl, *conflicting_fl;
1875 bzero(&test_fl, sizeof(test_fl));
1877 bcopy(lock->fh.n_bytes, &(test_fl.filehandle), sizeof(fhandle_t));
1878 copy_nlm4_lock_to_nlm4_holder(lock, exclusive, &test_fl.client);
1881 do_test(&test_fl, &conflicting_fl);
1883 if (conflicting_fl == NULL) {
1884 debuglog("No conflicting lock found\n");
1888 debuglog("Found conflicting lock\n");
1889 dump_filelock(conflicting_fl);
1891 return (&conflicting_fl->client);
1896 * getlock: try to acquire the lock.
1897 * If file is already locked and we can sleep, put the lock in the list with
1898 * status LKST_WAITING; it'll be processed later.
1899 * Otherwise try to lock. If we're allowed to block, fork a child which
1900 * will do the blocking lock.
1904 getlock(nlm4_lockargs *lckarg, struct svc_req *rqstp, const int flags)
1906 struct file_lock *newfl;
1907 enum nlm_stats retval;
1909 debuglog("Entering getlock...\n");
1911 if (grace_expired == 0 && lckarg->reclaim == 0)
1912 return (flags & LOCK_V4) ?
1913 nlm4_denied_grace_period : nlm_denied_grace_period;
1915 /* allocate new file_lock for this request */
1916 newfl = allocate_file_lock(&lckarg->alock.oh, &lckarg->cookie,
1917 (struct sockaddr *)svc_getrpccaller(rqstp->rq_xprt)->buf, lckarg->alock.caller_name);
1918 if (newfl == NULL) {
1919 syslog(LOG_NOTICE, "lock allocate failed: %s", strerror(errno));
1921 return (flags & LOCK_V4) ?
1922 nlm4_denied_nolocks : nlm_denied_nolocks;
1925 if (lckarg->alock.fh.n_len != sizeof(fhandle_t)) {
1926 debuglog("received fhandle size %d, local size %d",
1927 lckarg->alock.fh.n_len, (int)sizeof(fhandle_t));
1930 fill_file_lock(newfl, (fhandle_t *)lckarg->alock.fh.n_bytes,
1931 lckarg->exclusive, lckarg->alock.svid, lckarg->alock.l_offset,
1932 lckarg->alock.l_len,
1933 lckarg->state, 0, flags, lckarg->block);
1936 * newfl is now fully constructed and deallocate_file_lock
1937 * can now be used to delete it
1941 debuglog("Pointer to new lock is %p\n",newfl);
1943 retval = do_lock(newfl);
1945 debuglog("Pointer to new lock is %p\n",newfl);
1951 /* case nlm_granted: is the same as nlm4_granted */
1952 /* do_mon(lckarg->alock.caller_name); */
1955 /* case nlm_blocked: is the same as nlm4_blocked */
1956 /* do_mon(lckarg->alock.caller_name); */
1959 deallocate_file_lock(newfl);
1963 debuglog("Exiting getlock...\n");
1969 /* unlock a filehandle */
1971 unlock(nlm4_lock *lock, const int flags __unused)
1973 struct file_lock fl;
1978 debuglog("Entering unlock...\n");
1980 bzero(&fl,sizeof(struct file_lock));
1981 bcopy(lock->fh.n_bytes, &fl.filehandle, sizeof(fhandle_t));
1983 copy_nlm4_lock_to_nlm4_holder(lock, 0, &fl.client);
1985 err = do_unlock(&fl);
1989 debuglog("Exiting unlock...\n");
1995 * XXX: The following monitor/unmonitor routines
1996 * have not been extensively tested (ie. no regression
1997 * script exists like for the locking sections
2001 * monitor_lock_host: monitor lock hosts locally with a ref count and
2005 monitor_lock_host(const char *hostname)
2007 struct host *ihp, *nhp;
2009 struct sm_stat_res sres;
2010 int rpcret, statflag;
2016 LIST_FOREACH(ihp, &hostlst_head, hostlst) {
2017 if (strncmp(hostname, ihp->name, SM_MAXSTRLEN) == 0) {
2018 /* Host is already monitored, bump refcount */
2020 /* Host should only be in the monitor list once */
2025 /* Host is not yet monitored, add it */
2026 n = strnlen(hostname, SM_MAXSTRLEN);
2027 if (n == SM_MAXSTRLEN) {
2030 nhp = malloc(sizeof(*nhp) - sizeof(nhp->name) + n + 1);
2032 debuglog("Unable to allocate entry for statd mon\n");
2036 /* Allocated new host entry, now fill the fields */
2037 memcpy(nhp->name, hostname, n);
2040 debuglog("Locally Monitoring host %16s\n",hostname);
2042 debuglog("Attempting to tell statd\n");
2044 bzero(&smon,sizeof(smon));
2046 smon.mon_id.mon_name = nhp->name;
2047 smon.mon_id.my_id.my_name = "localhost";
2048 smon.mon_id.my_id.my_prog = NLM_PROG;
2049 smon.mon_id.my_id.my_vers = NLM_SM;
2050 smon.mon_id.my_id.my_proc = NLM_SM_NOTIFY;
2052 rpcret = callrpc("localhost", SM_PROG, SM_VERS, SM_MON,
2053 (xdrproc_t)xdr_mon, &smon,
2054 (xdrproc_t)xdr_sm_stat_res, &sres);
2057 if (sres.res_stat == stat_fail) {
2058 debuglog("Statd call failed\n");
2064 debuglog("Rpc call to statd failed with return value: %d\n",
2069 if (statflag == 1) {
2070 LIST_INSERT_HEAD(&hostlst_head, nhp, hostlst);
2078 * unmonitor_lock_host: clear monitor ref counts and inform statd when gone
2081 unmonitor_lock_host(char *hostname)
2084 struct mon_id smon_id;
2085 struct sm_stat smstat;
2090 for( ihp=LIST_FIRST(&hostlst_head); ihp != NULL;
2091 ihp=LIST_NEXT(ihp, hostlst)) {
2092 if (strncmp(hostname, ihp->name, SM_MAXSTRLEN) == 0) {
2093 /* Host is monitored, bump refcount */
2095 /* Host should only be in the monitor list once */
2101 debuglog("Could not find host %16s in mon list\n", hostname);
2105 if (ihp->refcnt > 0)
2108 if (ihp->refcnt < 0) {
2109 debuglog("Negative refcount!: %d\n",
2113 debuglog("Attempting to unmonitor host %16s\n", hostname);
2115 bzero(&smon_id,sizeof(smon_id));
2117 smon_id.mon_name = hostname;
2118 smon_id.my_id.my_name = "localhost";
2119 smon_id.my_id.my_prog = NLM_PROG;
2120 smon_id.my_id.my_vers = NLM_SM;
2121 smon_id.my_id.my_proc = NLM_SM_NOTIFY;
2123 rpcret = callrpc("localhost", SM_PROG, SM_VERS, SM_UNMON,
2124 (xdrproc_t)xdr_mon_id, &smon_id,
2125 (xdrproc_t)xdr_sm_stat, &smstat);
2128 debuglog("Rpc call to unmonitor statd failed with "
2129 " return value: %d\n", rpcret);
2132 LIST_REMOVE(ihp, hostlst);
2137 * notify: Clear all locks from a host if statd complains
2139 * XXX: This routine has not been thoroughly tested. However, neither
2140 * had the old one been. It used to compare the statd crash state counter
2141 * to the current lock state. The upshot of this was that it basically
2142 * cleared all locks from the specified host 99% of the time (with the
2143 * other 1% being a bug). Consequently, the assumption is that clearing
2144 * all locks from a host when notified by statd is acceptable.
2146 * Please note that this routine skips the usual level of redirection
2147 * through a do_* type routine. This introduces a possible level of
2148 * error and might better be written as do_notify and take this one out.
2153 notify(const char *hostname, const int state)
2155 debuglog("notify from %s, new state %d", hostname, state);
2161 debuglog("Leaving notify\n");
2165 send_granted(struct file_lock *fl, int opcode __unused)
2169 struct timeval timeo;
2171 static struct nlm_res retval;
2172 static struct nlm4_res retval4;
2174 debuglog("About to send granted on blocked lock\n");
2176 cli = get_client(fl->addr,
2177 (fl->flags & LOCK_V4) ? NLM_VERS4 : NLM_VERS);
2179 syslog(LOG_NOTICE, "failed to get CLIENT for %s",
2182 * We fail to notify remote that the lock has been granted.
2183 * The client will timeout and retry, the lock will be
2184 * granted at this time.
2189 timeo.tv_usec = (fl->flags & LOCK_ASYNC) ? 0 : 500000; /* 0.5s */
2191 if (fl->flags & LOCK_V4) {
2192 static nlm4_testargs res;
2193 res.cookie = fl->client_cookie;
2194 res.exclusive = fl->client.exclusive;
2195 res.alock.caller_name = fl->client_name;
2196 res.alock.fh.n_len = sizeof(fhandle_t);
2197 res.alock.fh.n_bytes = (char*)&fl->filehandle;
2198 res.alock.oh = fl->client.oh;
2199 res.alock.svid = fl->client.svid;
2200 res.alock.l_offset = fl->client.l_offset;
2201 res.alock.l_len = fl->client.l_len;
2202 debuglog("sending v4 reply%s",
2203 (fl->flags & LOCK_ASYNC) ? " (async)":"");
2204 if (fl->flags & LOCK_ASYNC) {
2205 success = clnt_call(cli, NLM4_GRANTED_MSG,
2206 (xdrproc_t)xdr_nlm4_testargs, &res,
2207 (xdrproc_t)xdr_void, &dummy, timeo);
2209 success = clnt_call(cli, NLM4_GRANTED,
2210 (xdrproc_t)xdr_nlm4_testargs, &res,
2211 (xdrproc_t)xdr_nlm4_res, &retval4, timeo);
2214 static nlm_testargs res;
2216 res.cookie = fl->client_cookie;
2217 res.exclusive = fl->client.exclusive;
2218 res.alock.caller_name = fl->client_name;
2219 res.alock.fh.n_len = sizeof(fhandle_t);
2220 res.alock.fh.n_bytes = (char*)&fl->filehandle;
2221 res.alock.oh = fl->client.oh;
2222 res.alock.svid = fl->client.svid;
2223 res.alock.l_offset = fl->client.l_offset;
2224 res.alock.l_len = fl->client.l_len;
2225 debuglog("sending v1 reply%s",
2226 (fl->flags & LOCK_ASYNC) ? " (async)":"");
2227 if (fl->flags & LOCK_ASYNC) {
2228 success = clnt_call(cli, NLM_GRANTED_MSG,
2229 (xdrproc_t)xdr_nlm_testargs, &res,
2230 (xdrproc_t)xdr_void, &dummy, timeo);
2232 success = clnt_call(cli, NLM_GRANTED,
2233 (xdrproc_t)xdr_nlm_testargs, &res,
2234 (xdrproc_t)xdr_nlm_res, &retval, timeo);
2237 if (debug_level > 2)
2238 debuglog("clnt_call returns %d(%s) for granted",
2239 success, clnt_sperrno(success));
2244 * Routines below here have not been modified in the overhaul
2248 * Are these two routines still required since lockd is not spawning off
2249 * children to service locks anymore? Presumably they were originally
2250 * put in place to prevent a one child from changing the lock list out
2251 * from under another one.
2259 sigemptyset(&block);
2260 sigaddset(&block, SIGCHLD);
2262 if (sigprocmask(SIG_BLOCK, &block, NULL) < 0) {
2263 syslog(LOG_WARNING, "siglock failed: %s", strerror(errno));
2272 sigemptyset(&block);
2273 sigaddset(&block, SIGCHLD);
2275 if (sigprocmask(SIG_UNBLOCK, &block, NULL) < 0) {
2276 syslog(LOG_WARNING, "sigunlock failed: %s", strerror(errno));