License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 21:07:57 +07:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* linux/fs/lockd/svclock.c
|
|
|
|
*
|
|
|
|
* Handling of server-side locks, mostly of the blocked variety.
|
|
|
|
* This is the ugliest part of lockd because we tread on very thin ice.
|
|
|
|
* GRANT and CANCEL calls may get stuck, meet in mid-flight, etc.
|
|
|
|
* IMNSHO introducing the grant callback into the NLM protocol was one
|
|
|
|
* of the worst ideas Sun ever had. Except maybe for the idea of doing
|
|
|
|
* NFS file locking at all.
|
|
|
|
*
|
|
|
|
* I'm trying hard to avoid race conditions by protecting most accesses
|
|
|
|
* to a file's list of blocked locks through a semaphore. The global
|
|
|
|
* list of blocked locks is not protected in this fashion however.
|
|
|
|
* Therefore, some functions (such as the RPC callback for the async grant
|
|
|
|
* call) move blocked locks towards the head of the list *while some other
|
|
|
|
* process might be traversing it*. This should not be a problem in
|
|
|
|
* practice, because this will only cause functions traversing the list
|
|
|
|
* to visit some blocks twice.
|
|
|
|
*
|
|
|
|
* Copyright (C) 1996, Olaf Kirch <okir@monad.swb.de>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 15:04:11 +07:00
|
|
|
#include <linux/slab.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/sunrpc/clnt.h>
|
2012-07-25 19:57:22 +07:00
|
|
|
#include <linux/sunrpc/svc_xprt.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include <linux/lockd/nlm.h>
|
|
|
|
#include <linux/lockd/lockd.h>
|
2008-02-08 04:34:55 +07:00
|
|
|
#include <linux/kthread.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
#define NLMDBG_FACILITY NLMDBG_SVCLOCK
|
|
|
|
|
|
|
|
#ifdef CONFIG_LOCKD_V4
|
|
|
|
#define nlm_deadlock nlm4_deadlock
|
|
|
|
#else
|
|
|
|
#define nlm_deadlock nlm_lck_denied
|
|
|
|
#endif
|
|
|
|
|
2006-03-21 01:44:39 +07:00
|
|
|
static void nlmsvc_release_block(struct nlm_block *block);
|
2005-04-17 05:20:36 +07:00
|
|
|
static void nlmsvc_insert_block(struct nlm_block *block, unsigned long);
|
2006-10-04 16:15:57 +07:00
|
|
|
static void nlmsvc_remove_block(struct nlm_block *block);
|
2006-01-03 15:55:04 +07:00
|
|
|
|
2006-03-21 01:44:39 +07:00
|
|
|
static int nlmsvc_setgrantargs(struct nlm_rqst *call, struct nlm_lock *lock);
|
|
|
|
static void nlmsvc_freegrantargs(struct nlm_rqst *call);
|
2006-01-03 15:55:04 +07:00
|
|
|
static const struct rpc_call_ops nlmsvc_grant_ops;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* The list of blocked locks to retry
|
|
|
|
*/
|
2006-10-04 16:15:57 +07:00
|
|
|
static LIST_HEAD(nlm_blocked);
|
2010-09-22 03:38:12 +07:00
|
|
|
static DEFINE_SPINLOCK(nlm_blocked_lock);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2014-11-18 04:58:03 +07:00
|
|
|
#if IS_ENABLED(CONFIG_SUNRPC_DEBUG)
|
2012-03-20 20:22:00 +07:00
|
|
|
static const char *nlmdbg_cookie2a(const struct nlm_cookie *cookie)
|
|
|
|
{
|
|
|
|
/*
|
2015-01-22 20:19:32 +07:00
|
|
|
* We can get away with a static buffer because this is only called
|
|
|
|
* from lockd, which is single-threaded.
|
2012-03-20 20:22:00 +07:00
|
|
|
*/
|
|
|
|
static char buf[2*NLM_MAXCOOKIELEN+1];
|
|
|
|
unsigned int i, len = sizeof(buf);
|
|
|
|
char *p = buf;
|
|
|
|
|
|
|
|
len--; /* allow for trailing \0 */
|
|
|
|
if (len < 3)
|
|
|
|
return "???";
|
|
|
|
for (i = 0 ; i < cookie->len ; i++) {
|
|
|
|
if (len < 2) {
|
|
|
|
strcpy(p-3, "...");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
sprintf(p, "%02x", cookie->data[i]);
|
|
|
|
p += 2;
|
|
|
|
len -= 2;
|
|
|
|
}
|
|
|
|
*p = '\0';
|
|
|
|
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* Insert a blocked lock into the global list
|
|
|
|
*/
|
|
|
|
static void
|
2010-09-22 03:38:12 +07:00
|
|
|
nlmsvc_insert_block_locked(struct nlm_block *block, unsigned long when)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2006-10-04 16:15:57 +07:00
|
|
|
struct nlm_block *b;
|
|
|
|
struct list_head *pos;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
dprintk("lockd: nlmsvc_insert_block(%p, %ld)\n", block, when);
|
2006-10-04 16:15:57 +07:00
|
|
|
if (list_empty(&block->b_list)) {
|
|
|
|
kref_get(&block->b_count);
|
|
|
|
} else {
|
|
|
|
list_del_init(&block->b_list);
|
|
|
|
}
|
|
|
|
|
|
|
|
pos = &nlm_blocked;
|
2005-04-17 05:20:36 +07:00
|
|
|
if (when != NLM_NEVER) {
|
|
|
|
if ((when += jiffies) == NLM_NEVER)
|
|
|
|
when ++;
|
2006-10-04 16:15:57 +07:00
|
|
|
list_for_each(pos, &nlm_blocked) {
|
|
|
|
b = list_entry(pos, struct nlm_block, b_list);
|
|
|
|
if (time_after(b->b_when,when) || b->b_when == NLM_NEVER)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* On normal exit from the loop, pos == &nlm_blocked,
|
|
|
|
* so we will be adding to the end of the list - good
|
|
|
|
*/
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2006-10-04 16:15:57 +07:00
|
|
|
list_add_tail(&block->b_list, pos);
|
2005-04-17 05:20:36 +07:00
|
|
|
block->b_when = when;
|
|
|
|
}
|
|
|
|
|
2010-09-22 03:38:12 +07:00
|
|
|
static void nlmsvc_insert_block(struct nlm_block *block, unsigned long when)
|
|
|
|
{
|
|
|
|
spin_lock(&nlm_blocked_lock);
|
|
|
|
nlmsvc_insert_block_locked(block, when);
|
|
|
|
spin_unlock(&nlm_blocked_lock);
|
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* Remove a block from the global list
|
|
|
|
*/
|
2006-10-04 16:15:57 +07:00
|
|
|
static inline void
|
2005-04-17 05:20:36 +07:00
|
|
|
nlmsvc_remove_block(struct nlm_block *block)
|
|
|
|
{
|
2006-10-04 16:15:57 +07:00
|
|
|
if (!list_empty(&block->b_list)) {
|
2010-09-22 03:38:12 +07:00
|
|
|
spin_lock(&nlm_blocked_lock);
|
2006-10-04 16:15:57 +07:00
|
|
|
list_del_init(&block->b_list);
|
2010-09-22 03:38:12 +07:00
|
|
|
spin_unlock(&nlm_blocked_lock);
|
2006-10-04 16:15:57 +07:00
|
|
|
nlmsvc_release_block(block);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2006-03-21 01:44:47 +07:00
|
|
|
* Find a block for a given lock
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
|
|
|
static struct nlm_block *
|
2006-03-21 01:44:47 +07:00
|
|
|
nlmsvc_lookup_block(struct nlm_file *file, struct nlm_lock *lock)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2006-10-04 16:15:57 +07:00
|
|
|
struct nlm_block *block;
|
2005-04-17 05:20:36 +07:00
|
|
|
struct file_lock *fl;
|
|
|
|
|
|
|
|
dprintk("lockd: nlmsvc_lookup_block f=%p pd=%d %Ld-%Ld ty=%d\n",
|
|
|
|
file, lock->fl.fl_pid,
|
|
|
|
(long long)lock->fl.fl_start,
|
|
|
|
(long long)lock->fl.fl_end, lock->fl.fl_type);
|
2006-10-04 16:15:57 +07:00
|
|
|
list_for_each_entry(block, &nlm_blocked, b_list) {
|
2006-03-21 01:44:45 +07:00
|
|
|
fl = &block->b_call->a_args.lock.fl;
|
2005-04-17 05:20:36 +07:00
|
|
|
dprintk("lockd: check f=%p pd=%d %Ld-%Ld ty=%d cookie=%s\n",
|
|
|
|
block->b_file, fl->fl_pid,
|
|
|
|
(long long)fl->fl_start,
|
|
|
|
(long long)fl->fl_end, fl->fl_type,
|
2006-03-21 01:44:45 +07:00
|
|
|
nlmdbg_cookie2a(&block->b_call->a_args.cookie));
|
2005-04-17 05:20:36 +07:00
|
|
|
if (block->b_file == file && nlm_compare_locks(fl, &lock->fl)) {
|
2006-03-21 01:44:39 +07:00
|
|
|
kref_get(&block->b_count);
|
2005-04-17 05:20:36 +07:00
|
|
|
return block;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int nlm_cookie_match(struct nlm_cookie *a, struct nlm_cookie *b)
|
|
|
|
{
|
2008-07-16 01:38:32 +07:00
|
|
|
if (a->len != b->len)
|
2005-04-17 05:20:36 +07:00
|
|
|
return 0;
|
2008-07-16 01:38:32 +07:00
|
|
|
if (memcmp(a->data, b->data, a->len))
|
2005-04-17 05:20:36 +07:00
|
|
|
return 0;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Find a block with a given NLM cookie.
|
|
|
|
*/
|
|
|
|
static inline struct nlm_block *
|
2006-10-04 16:16:03 +07:00
|
|
|
nlmsvc_find_block(struct nlm_cookie *cookie)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
|
|
|
struct nlm_block *block;
|
|
|
|
|
2006-10-04 16:15:57 +07:00
|
|
|
list_for_each_entry(block, &nlm_blocked, b_list) {
|
2006-10-04 16:16:03 +07:00
|
|
|
if (nlm_cookie_match(&block->b_call->a_args.cookie,cookie))
|
2006-10-04 16:15:57 +07:00
|
|
|
goto found;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2006-10-04 16:15:57 +07:00
|
|
|
return NULL;
|
|
|
|
|
|
|
|
found:
|
2006-10-04 16:16:03 +07:00
|
|
|
dprintk("nlmsvc_find_block(%s): block=%p\n", nlmdbg_cookie2a(cookie), block);
|
2006-10-04 16:15:57 +07:00
|
|
|
kref_get(&block->b_count);
|
2005-04-17 05:20:36 +07:00
|
|
|
return block;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Create a block and initialize it.
|
|
|
|
*
|
|
|
|
* Note: we explicitly set the cookie of the grant reply to that of
|
|
|
|
* the blocked lock request. The spec explicitly mentions that the client
|
|
|
|
* should _not_ rely on the callback containing the same cookie as the
|
|
|
|
* request, but (as I found out later) that's because some implementations
|
|
|
|
* do just this. Never mind the standards comittees, they support our
|
|
|
|
* logging industries.
|
2006-10-04 16:16:03 +07:00
|
|
|
*
|
|
|
|
* 10 years later: I hope we can safely ignore these old and broken
|
|
|
|
* clients by now. Let's fix this so we can uniquely identify an incoming
|
|
|
|
* GRANTED_RES message by cookie, without having to rely on the client's IP
|
|
|
|
* address. --okir
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
2007-09-26 02:55:03 +07:00
|
|
|
static struct nlm_block *
|
|
|
|
nlmsvc_create_block(struct svc_rqst *rqstp, struct nlm_host *host,
|
|
|
|
struct nlm_file *file, struct nlm_lock *lock,
|
|
|
|
struct nlm_cookie *cookie)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
|
|
|
struct nlm_block *block;
|
2006-03-21 01:44:45 +07:00
|
|
|
struct nlm_rqst *call = NULL;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2006-03-21 01:44:45 +07:00
|
|
|
call = nlm_alloc_call(host);
|
|
|
|
if (call == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/* Allocate memory for block, and initialize arguments */
|
2006-03-21 01:44:45 +07:00
|
|
|
block = kzalloc(sizeof(*block), GFP_KERNEL);
|
|
|
|
if (block == NULL)
|
2005-04-17 05:20:36 +07:00
|
|
|
goto failed;
|
2006-03-21 01:44:39 +07:00
|
|
|
kref_init(&block->b_count);
|
2006-10-04 16:15:57 +07:00
|
|
|
INIT_LIST_HEAD(&block->b_list);
|
|
|
|
INIT_LIST_HEAD(&block->b_flist);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2006-03-21 01:44:45 +07:00
|
|
|
if (!nlmsvc_setgrantargs(call, lock))
|
2005-04-17 05:20:36 +07:00
|
|
|
goto failed_free;
|
|
|
|
|
|
|
|
/* Set notifier function for VFS, and init args */
|
2006-03-21 01:44:45 +07:00
|
|
|
call->a_args.lock.fl.fl_flags |= FL_SLEEP;
|
|
|
|
call->a_args.lock.fl.fl_lmops = &nlmsvc_lock_operations;
|
2006-10-04 16:16:03 +07:00
|
|
|
nlmclnt_next_cookie(&call->a_args.cookie);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
dprintk("lockd: created block %p...\n", block);
|
|
|
|
|
|
|
|
/* Create and initialize the block */
|
|
|
|
block->b_daemon = rqstp->rq_server;
|
|
|
|
block->b_host = host;
|
|
|
|
block->b_file = file;
|
2006-03-21 01:44:47 +07:00
|
|
|
file->f_count++;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/* Add to file's list of blocks */
|
2006-10-04 16:15:57 +07:00
|
|
|
list_add(&block->b_flist, &file->f_blocks);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/* Set up RPC arguments for callback */
|
2006-03-21 01:44:45 +07:00
|
|
|
block->b_call = call;
|
2005-04-17 05:20:36 +07:00
|
|
|
call->a_flags = RPC_TASK_ASYNC;
|
2006-03-21 01:44:45 +07:00
|
|
|
call->a_block = block;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
return block;
|
|
|
|
|
|
|
|
failed_free:
|
|
|
|
kfree(block);
|
|
|
|
failed:
|
2010-12-14 22:05:42 +07:00
|
|
|
nlmsvc_release_call(call);
|
2005-04-17 05:20:36 +07:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2008-04-08 00:05:27 +07:00
|
|
|
* Delete a block.
|
2005-04-17 05:20:36 +07:00
|
|
|
* It is the caller's responsibility to check whether the file
|
|
|
|
* can be closed hereafter.
|
|
|
|
*/
|
2006-03-21 01:44:39 +07:00
|
|
|
static int nlmsvc_unlink_block(struct nlm_block *block)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2006-03-21 01:44:38 +07:00
|
|
|
int status;
|
2006-03-21 01:44:39 +07:00
|
|
|
dprintk("lockd: unlinking block %p...\n", block);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/* Remove block from list */
|
2013-06-21 19:58:09 +07:00
|
|
|
status = posix_unblock_lock(&block->b_call->a_args.lock.fl);
|
2005-04-17 05:20:36 +07:00
|
|
|
nlmsvc_remove_block(block);
|
2006-03-21 01:44:39 +07:00
|
|
|
return status;
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2006-03-21 01:44:39 +07:00
|
|
|
static void nlmsvc_free_block(struct kref *kref)
|
|
|
|
{
|
|
|
|
struct nlm_block *block = container_of(kref, struct nlm_block, b_count);
|
|
|
|
struct nlm_file *file = block->b_file;
|
|
|
|
|
|
|
|
dprintk("lockd: freeing block %p...\n", block);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/* Remove block from file's list of blocks */
|
2006-10-04 16:15:57 +07:00
|
|
|
list_del_init(&block->b_flist);
|
2006-10-04 16:16:06 +07:00
|
|
|
mutex_unlock(&file->f_mutex);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2006-03-21 01:44:45 +07:00
|
|
|
nlmsvc_freegrantargs(block->b_call);
|
2010-12-14 22:05:42 +07:00
|
|
|
nlmsvc_release_call(block->b_call);
|
2006-03-21 01:44:47 +07:00
|
|
|
nlm_release_file(block->b_file);
|
2005-04-17 05:20:36 +07:00
|
|
|
kfree(block);
|
2006-03-21 01:44:39 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
static void nlmsvc_release_block(struct nlm_block *block)
|
|
|
|
{
|
|
|
|
if (block != NULL)
|
2012-08-29 20:00:01 +07:00
|
|
|
kref_put_mutex(&block->b_count, nlmsvc_free_block, &block->b_file->f_mutex);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2006-10-04 16:15:59 +07:00
|
|
|
/*
|
|
|
|
* Loop over all blocks and delete blocks held by
|
|
|
|
* a matching host.
|
|
|
|
*/
|
|
|
|
void nlmsvc_traverse_blocks(struct nlm_host *host,
|
|
|
|
struct nlm_file *file,
|
|
|
|
nlm_host_match_fn_t match)
|
2006-03-21 01:44:47 +07:00
|
|
|
{
|
2006-10-04 16:15:57 +07:00
|
|
|
struct nlm_block *block, *next;
|
2006-03-21 01:44:47 +07:00
|
|
|
|
|
|
|
restart:
|
2006-10-04 16:16:06 +07:00
|
|
|
mutex_lock(&file->f_mutex);
|
2006-10-04 16:15:57 +07:00
|
|
|
list_for_each_entry_safe(block, next, &file->f_blocks, b_flist) {
|
2006-10-04 16:15:59 +07:00
|
|
|
if (!match(block->b_host, host))
|
2006-03-21 01:44:47 +07:00
|
|
|
continue;
|
2006-10-04 16:15:57 +07:00
|
|
|
/* Do not destroy blocks that are not on
|
|
|
|
* the global retry list - why? */
|
|
|
|
if (list_empty(&block->b_list))
|
2006-03-21 01:44:47 +07:00
|
|
|
continue;
|
|
|
|
kref_get(&block->b_count);
|
2006-10-04 16:16:06 +07:00
|
|
|
mutex_unlock(&file->f_mutex);
|
2006-03-21 01:44:47 +07:00
|
|
|
nlmsvc_unlink_block(block);
|
|
|
|
nlmsvc_release_block(block);
|
|
|
|
goto restart;
|
|
|
|
}
|
2006-10-04 16:16:06 +07:00
|
|
|
mutex_unlock(&file->f_mutex);
|
2006-03-21 01:44:47 +07:00
|
|
|
}
|
|
|
|
|
2006-03-21 01:44:39 +07:00
|
|
|
/*
|
|
|
|
* Initialize arguments for GRANTED call. The nlm_rqst structure
|
|
|
|
* has been cleared already.
|
|
|
|
*/
|
|
|
|
static int nlmsvc_setgrantargs(struct nlm_rqst *call, struct nlm_lock *lock)
|
|
|
|
{
|
|
|
|
locks_copy_lock(&call->a_args.lock.fl, &lock->fl);
|
|
|
|
memcpy(&call->a_args.lock.fh, &lock->fh, sizeof(call->a_args.lock.fh));
|
2006-10-02 16:18:11 +07:00
|
|
|
call->a_args.lock.caller = utsname()->nodename;
|
2006-03-21 01:44:39 +07:00
|
|
|
call->a_args.lock.oh.len = lock->oh.len;
|
|
|
|
|
|
|
|
/* set default data area */
|
|
|
|
call->a_args.lock.oh.data = call->a_owner;
|
|
|
|
call->a_args.lock.svid = lock->fl.fl_pid;
|
|
|
|
|
|
|
|
if (lock->oh.len > NLMCLNT_OHSIZE) {
|
|
|
|
void *data = kmalloc(lock->oh.len, GFP_KERNEL);
|
2006-03-21 01:44:45 +07:00
|
|
|
if (!data)
|
2006-03-21 01:44:39 +07:00
|
|
|
return 0;
|
|
|
|
call->a_args.lock.oh.data = (u8 *) data;
|
|
|
|
}
|
|
|
|
|
|
|
|
memcpy(call->a_args.lock.oh.data, lock->oh.data, lock->oh.len);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void nlmsvc_freegrantargs(struct nlm_rqst *call)
|
|
|
|
{
|
2006-03-21 01:44:45 +07:00
|
|
|
if (call->a_args.lock.oh.data != call->a_owner)
|
2006-03-21 01:44:39 +07:00
|
|
|
kfree(call->a_args.lock.oh.data);
|
2009-04-01 03:12:56 +07:00
|
|
|
|
|
|
|
locks_release_private(&call->a_args.lock.fl);
|
2006-03-21 01:44:39 +07:00
|
|
|
}
|
|
|
|
|
2006-11-29 04:26:47 +07:00
|
|
|
/*
|
|
|
|
* Deferred lock request handling for non-blocking lock
|
|
|
|
*/
|
2007-07-26 23:33:49 +07:00
|
|
|
static __be32
|
2006-11-29 04:26:47 +07:00
|
|
|
nlmsvc_defer_lock_rqst(struct svc_rqst *rqstp, struct nlm_block *block)
|
|
|
|
{
|
2007-07-26 23:33:49 +07:00
|
|
|
__be32 status = nlm_lck_denied_nolocks;
|
2006-11-29 04:26:47 +07:00
|
|
|
|
|
|
|
block->b_flags |= B_QUEUED;
|
|
|
|
|
|
|
|
nlmsvc_insert_block(block, NLM_TIMEOUT);
|
|
|
|
|
|
|
|
block->b_cache_req = &rqstp->rq_chandle;
|
|
|
|
if (rqstp->rq_chandle.defer) {
|
|
|
|
block->b_deferred_req =
|
|
|
|
rqstp->rq_chandle.defer(block->b_cache_req);
|
|
|
|
if (block->b_deferred_req != NULL)
|
|
|
|
status = nlm_drop_reply;
|
|
|
|
}
|
|
|
|
dprintk("lockd: nlmsvc_defer_lock_rqst block %p flags %d status %d\n",
|
2007-07-26 23:33:49 +07:00
|
|
|
block, block->b_flags, ntohl(status));
|
2006-11-29 04:26:47 +07:00
|
|
|
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* Attempt to establish a lock, and if it can't be granted, block it
|
|
|
|
* if required.
|
|
|
|
*/
|
2006-10-20 13:28:46 +07:00
|
|
|
__be32
|
2005-04-17 05:20:36 +07:00
|
|
|
nlmsvc_lock(struct svc_rqst *rqstp, struct nlm_file *file,
|
2008-07-16 01:26:17 +07:00
|
|
|
struct nlm_host *host, struct nlm_lock *lock, int wait,
|
2008-02-07 01:59:23 +07:00
|
|
|
struct nlm_cookie *cookie, int reclaim)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2006-12-06 11:48:10 +07:00
|
|
|
struct nlm_block *block = NULL;
|
2005-04-17 05:20:36 +07:00
|
|
|
int error;
|
2006-10-20 13:28:46 +07:00
|
|
|
__be32 ret;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
dprintk("lockd: nlmsvc_lock(%s/%ld, ty=%d, pi=%d, %Ld-%Ld, bl=%d)\n",
|
2013-01-24 05:07:38 +07:00
|
|
|
file_inode(file->f_file)->i_sb->s_id,
|
|
|
|
file_inode(file->f_file)->i_ino,
|
2005-04-17 05:20:36 +07:00
|
|
|
lock->fl.fl_type, lock->fl.fl_pid,
|
|
|
|
(long long)lock->fl.fl_start,
|
|
|
|
(long long)lock->fl.fl_end,
|
|
|
|
wait);
|
|
|
|
|
|
|
|
/* Lock file against concurrent access */
|
2006-10-04 16:16:06 +07:00
|
|
|
mutex_lock(&file->f_mutex);
|
2006-12-06 11:48:10 +07:00
|
|
|
/* Get existing block (in case client is busy-waiting)
|
|
|
|
* or create new block
|
|
|
|
*/
|
2006-03-21 01:44:47 +07:00
|
|
|
block = nlmsvc_lookup_block(file, lock);
|
2006-03-21 01:44:38 +07:00
|
|
|
if (block == NULL) {
|
2008-07-16 02:05:45 +07:00
|
|
|
block = nlmsvc_create_block(rqstp, host, file, lock, cookie);
|
2006-12-06 11:48:10 +07:00
|
|
|
ret = nlm_lck_denied_nolocks;
|
|
|
|
if (block == NULL)
|
|
|
|
goto out;
|
2006-03-21 01:44:45 +07:00
|
|
|
lock = &block->b_call->a_args.lock;
|
2006-12-06 11:48:10 +07:00
|
|
|
} else
|
|
|
|
lock->fl.fl_flags &= ~FL_SLEEP;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2006-11-29 04:27:06 +07:00
|
|
|
if (block->b_flags & B_QUEUED) {
|
|
|
|
dprintk("lockd: nlmsvc_lock deferred block %p flags %d\n",
|
|
|
|
block, block->b_flags);
|
|
|
|
if (block->b_granted) {
|
|
|
|
nlmsvc_unlink_block(block);
|
|
|
|
ret = nlm_granted;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (block->b_flags & B_TIMED_OUT) {
|
|
|
|
nlmsvc_unlink_block(block);
|
|
|
|
ret = nlm_lck_denied;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
ret = nlm_drop_reply;
|
|
|
|
goto out;
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2012-07-25 19:57:22 +07:00
|
|
|
if (locks_in_grace(SVC_NET(rqstp)) && !reclaim) {
|
2008-02-07 01:59:23 +07:00
|
|
|
ret = nlm_lck_denied_grace_period;
|
|
|
|
goto out;
|
|
|
|
}
|
2012-07-25 19:57:22 +07:00
|
|
|
if (reclaim && !locks_in_grace(SVC_NET(rqstp))) {
|
2008-02-07 03:05:12 +07:00
|
|
|
ret = nlm_lck_denied_grace_period;
|
|
|
|
goto out;
|
|
|
|
}
|
2008-02-07 01:59:23 +07:00
|
|
|
|
2006-11-29 04:27:06 +07:00
|
|
|
if (!wait)
|
|
|
|
lock->fl.fl_flags &= ~FL_SLEEP;
|
|
|
|
error = vfs_lock_file(file->f_file, F_SETLK, &lock->fl, NULL);
|
|
|
|
lock->fl.fl_flags &= ~FL_SLEEP;
|
2006-03-21 01:44:25 +07:00
|
|
|
|
2006-11-29 04:27:06 +07:00
|
|
|
dprintk("lockd: vfs_lock_file returned %d\n", error);
|
2008-07-16 01:38:32 +07:00
|
|
|
switch (error) {
|
2005-04-17 05:20:36 +07:00
|
|
|
case 0:
|
2006-03-21 01:44:24 +07:00
|
|
|
ret = nlm_granted;
|
|
|
|
goto out;
|
2006-03-21 01:44:38 +07:00
|
|
|
case -EAGAIN:
|
2009-02-10 00:30:43 +07:00
|
|
|
/*
|
|
|
|
* If this is a blocking request for an
|
|
|
|
* already pending lock request then we need
|
|
|
|
* to put it back on lockd's block list
|
|
|
|
*/
|
|
|
|
if (wait)
|
|
|
|
break;
|
2006-11-29 04:27:06 +07:00
|
|
|
ret = nlm_lck_denied;
|
2009-02-10 00:30:43 +07:00
|
|
|
goto out;
|
2008-07-25 15:48:57 +07:00
|
|
|
case FILE_LOCK_DEFERRED:
|
2006-11-29 04:27:06 +07:00
|
|
|
if (wait)
|
|
|
|
break;
|
|
|
|
/* Filesystem lock operation is in progress
|
|
|
|
Add it to the queue waiting for callback */
|
|
|
|
ret = nlmsvc_defer_lock_rqst(rqstp, block);
|
|
|
|
goto out;
|
2006-03-21 01:44:38 +07:00
|
|
|
case -EDEADLK:
|
2006-03-21 01:44:24 +07:00
|
|
|
ret = nlm_deadlock;
|
|
|
|
goto out;
|
2005-04-17 05:20:36 +07:00
|
|
|
default: /* includes ENOLCK */
|
2006-03-21 01:44:24 +07:00
|
|
|
ret = nlm_lck_denied_nolocks;
|
|
|
|
goto out;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2006-03-21 01:44:38 +07:00
|
|
|
ret = nlm_lck_blocked;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/* Append to list of blocked */
|
2006-12-06 11:48:10 +07:00
|
|
|
nlmsvc_insert_block(block, NLM_NEVER);
|
2006-03-21 01:44:24 +07:00
|
|
|
out:
|
2006-10-04 16:16:06 +07:00
|
|
|
mutex_unlock(&file->f_mutex);
|
2006-03-21 01:44:39 +07:00
|
|
|
nlmsvc_release_block(block);
|
2006-03-21 01:44:24 +07:00
|
|
|
dprintk("lockd: nlmsvc_lock returned %u\n", ret);
|
|
|
|
return ret;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Test for presence of a conflicting lock.
|
|
|
|
*/
|
2006-10-20 13:28:46 +07:00
|
|
|
__be32
|
2006-11-29 04:27:06 +07:00
|
|
|
nlmsvc_testlock(struct svc_rqst *rqstp, struct nlm_file *file,
|
2008-07-16 01:06:48 +07:00
|
|
|
struct nlm_host *host, struct nlm_lock *lock,
|
|
|
|
struct nlm_lock *conflock, struct nlm_cookie *cookie)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2006-11-29 04:27:06 +07:00
|
|
|
int error;
|
|
|
|
__be32 ret;
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
dprintk("lockd: nlmsvc_testlock(%s/%ld, ty=%d, %Ld-%Ld)\n",
|
2013-01-24 05:07:38 +07:00
|
|
|
file_inode(file->f_file)->i_sb->s_id,
|
|
|
|
file_inode(file->f_file)->i_ino,
|
2005-04-17 05:20:36 +07:00
|
|
|
lock->fl.fl_type,
|
|
|
|
(long long)lock->fl.fl_start,
|
|
|
|
(long long)lock->fl.fl_end);
|
|
|
|
|
2012-07-25 19:57:22 +07:00
|
|
|
if (locks_in_grace(SVC_NET(rqstp))) {
|
2008-02-07 01:59:23 +07:00
|
|
|
ret = nlm_lck_denied_grace_period;
|
|
|
|
goto out;
|
|
|
|
}
|
2014-08-22 21:18:44 +07:00
|
|
|
|
2006-11-29 04:27:06 +07:00
|
|
|
error = vfs_test_lock(file->f_file, &lock->fl);
|
|
|
|
if (error) {
|
2014-08-22 21:18:44 +07:00
|
|
|
/* We can't currently deal with deferred test requests */
|
|
|
|
if (error == FILE_LOCK_DEFERRED)
|
|
|
|
WARN_ON_ONCE(1);
|
|
|
|
|
2006-11-29 04:27:06 +07:00
|
|
|
ret = nlm_lck_denied_nolocks;
|
|
|
|
goto out;
|
|
|
|
}
|
2014-08-22 21:18:44 +07:00
|
|
|
|
2006-11-29 04:27:06 +07:00
|
|
|
if (lock->fl.fl_type == F_UNLCK) {
|
|
|
|
ret = nlm_granted;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
dprintk("lockd: conflicting lock(ty=%d, %Ld-%Ld)\n",
|
|
|
|
lock->fl.fl_type, (long long)lock->fl.fl_start,
|
|
|
|
(long long)lock->fl.fl_end);
|
|
|
|
conflock->caller = "somehost"; /* FIXME */
|
|
|
|
conflock->len = strlen(conflock->caller);
|
|
|
|
conflock->oh.len = 0; /* don't return OH info */
|
|
|
|
conflock->svid = lock->fl.fl_pid;
|
|
|
|
conflock->fl.fl_type = lock->fl.fl_type;
|
|
|
|
conflock->fl.fl_start = lock->fl.fl_start;
|
|
|
|
conflock->fl.fl_end = lock->fl.fl_end;
|
2014-08-22 21:18:43 +07:00
|
|
|
locks_release_private(&lock->fl);
|
2006-11-29 04:27:06 +07:00
|
|
|
ret = nlm_lck_denied;
|
|
|
|
out:
|
|
|
|
return ret;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Remove a lock.
|
|
|
|
* This implies a CANCEL call: We send a GRANT_MSG, the client replies
|
|
|
|
* with a GRANT_RES call which gets lost, and calls UNLOCK immediately
|
|
|
|
* afterwards. In this case the block will still be there, and hence
|
|
|
|
* must be removed.
|
|
|
|
*/
|
2006-10-20 13:28:46 +07:00
|
|
|
__be32
|
2012-07-25 19:57:22 +07:00
|
|
|
nlmsvc_unlock(struct net *net, struct nlm_file *file, struct nlm_lock *lock)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
|
|
|
int error;
|
|
|
|
|
|
|
|
dprintk("lockd: nlmsvc_unlock(%s/%ld, pi=%d, %Ld-%Ld)\n",
|
2013-01-24 05:07:38 +07:00
|
|
|
file_inode(file->f_file)->i_sb->s_id,
|
|
|
|
file_inode(file->f_file)->i_ino,
|
2005-04-17 05:20:36 +07:00
|
|
|
lock->fl.fl_pid,
|
|
|
|
(long long)lock->fl.fl_start,
|
|
|
|
(long long)lock->fl.fl_end);
|
|
|
|
|
|
|
|
/* First, cancel any lock that might be there */
|
2012-07-25 19:57:22 +07:00
|
|
|
nlmsvc_cancel_blocked(net, file, lock);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
lock->fl.fl_type = F_UNLCK;
|
2006-11-29 04:27:06 +07:00
|
|
|
error = vfs_lock_file(file->f_file, F_SETLK, &lock->fl, NULL);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
return (error < 0)? nlm_lck_denied_nolocks : nlm_granted;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Cancel a previously blocked request.
|
|
|
|
*
|
|
|
|
* A cancel request always overrides any grant that may currently
|
|
|
|
* be in progress.
|
|
|
|
* The calling procedure must check whether the file can be closed.
|
|
|
|
*/
|
2006-10-20 13:28:46 +07:00
|
|
|
__be32
|
2012-07-25 19:57:22 +07:00
|
|
|
nlmsvc_cancel_blocked(struct net *net, struct nlm_file *file, struct nlm_lock *lock)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
|
|
|
struct nlm_block *block;
|
2006-01-03 15:55:46 +07:00
|
|
|
int status = 0;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
dprintk("lockd: nlmsvc_cancel(%s/%ld, pi=%d, %Ld-%Ld)\n",
|
2013-01-24 05:07:38 +07:00
|
|
|
file_inode(file->f_file)->i_sb->s_id,
|
|
|
|
file_inode(file->f_file)->i_ino,
|
2005-04-17 05:20:36 +07:00
|
|
|
lock->fl.fl_pid,
|
|
|
|
(long long)lock->fl.fl_start,
|
|
|
|
(long long)lock->fl.fl_end);
|
|
|
|
|
2012-07-25 19:57:22 +07:00
|
|
|
if (locks_in_grace(net))
|
2008-02-07 01:59:23 +07:00
|
|
|
return nlm_lck_denied_grace_period;
|
|
|
|
|
2006-10-04 16:16:06 +07:00
|
|
|
mutex_lock(&file->f_mutex);
|
2006-03-21 01:44:47 +07:00
|
|
|
block = nlmsvc_lookup_block(file, lock);
|
2006-10-04 16:16:06 +07:00
|
|
|
mutex_unlock(&file->f_mutex);
|
2006-03-21 01:44:47 +07:00
|
|
|
if (block != NULL) {
|
2006-11-29 04:27:06 +07:00
|
|
|
vfs_cancel_lock(block->b_file->f_file,
|
|
|
|
&block->b_call->a_args.lock.fl);
|
2006-03-21 01:44:39 +07:00
|
|
|
status = nlmsvc_unlink_block(block);
|
|
|
|
nlmsvc_release_block(block);
|
|
|
|
}
|
2006-01-03 15:55:46 +07:00
|
|
|
return status ? nlm_lck_denied : nlm_granted;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2006-11-29 04:26:51 +07:00
|
|
|
/*
|
|
|
|
* This is a callback from the filesystem for VFS file lock requests.
|
2011-07-21 07:21:59 +07:00
|
|
|
* It will be used if lm_grant is defined and the filesystem can not
|
2006-11-29 04:26:51 +07:00
|
|
|
* respond to the request immediately.
|
|
|
|
* For SETLK or SETLKW request it will get the local posix lock.
|
|
|
|
* In all cases it will move the block to the head of nlm_blocked q where
|
|
|
|
* nlmsvc_retry_blocked() can send back a reply for SETLKW or revisit the
|
|
|
|
* deferred rpc for GETLK and SETLK.
|
|
|
|
*/
|
|
|
|
static void
|
2014-08-22 21:18:42 +07:00
|
|
|
nlmsvc_update_deferred_block(struct nlm_block *block, int result)
|
2006-11-29 04:26:51 +07:00
|
|
|
{
|
|
|
|
block->b_flags |= B_GOT_CALLBACK;
|
|
|
|
if (result == 0)
|
|
|
|
block->b_granted = 1;
|
|
|
|
else
|
|
|
|
block->b_flags |= B_TIMED_OUT;
|
|
|
|
}
|
|
|
|
|
2014-08-22 21:18:42 +07:00
|
|
|
static int nlmsvc_grant_deferred(struct file_lock *fl, int result)
|
2006-11-29 04:26:51 +07:00
|
|
|
{
|
|
|
|
struct nlm_block *block;
|
|
|
|
int rc = -ENOENT;
|
|
|
|
|
2010-09-22 03:38:12 +07:00
|
|
|
spin_lock(&nlm_blocked_lock);
|
2006-11-29 04:26:51 +07:00
|
|
|
list_for_each_entry(block, &nlm_blocked, b_list) {
|
|
|
|
if (nlm_compare_locks(&block->b_call->a_args.lock.fl, fl)) {
|
|
|
|
dprintk("lockd: nlmsvc_notify_blocked block %p flags %d\n",
|
|
|
|
block, block->b_flags);
|
|
|
|
if (block->b_flags & B_QUEUED) {
|
|
|
|
if (block->b_flags & B_TIMED_OUT) {
|
|
|
|
rc = -ENOLCK;
|
|
|
|
break;
|
|
|
|
}
|
2014-08-22 21:18:42 +07:00
|
|
|
nlmsvc_update_deferred_block(block, result);
|
2006-11-29 04:26:51 +07:00
|
|
|
} else if (result == 0)
|
|
|
|
block->b_granted = 1;
|
|
|
|
|
2010-09-22 03:38:12 +07:00
|
|
|
nlmsvc_insert_block_locked(block, 0);
|
2006-11-29 04:26:51 +07:00
|
|
|
svc_wake_up(block->b_daemon);
|
|
|
|
rc = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2010-09-22 03:38:12 +07:00
|
|
|
spin_unlock(&nlm_blocked_lock);
|
2006-11-29 04:26:51 +07:00
|
|
|
if (rc == -ENOENT)
|
|
|
|
printk(KERN_WARNING "lockd: grant for unknown block\n");
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* Unblock a blocked lock request. This is a callback invoked from the
|
|
|
|
* VFS layer when a lock on which we blocked is removed.
|
|
|
|
*
|
|
|
|
* This function doesn't grant the blocked lock instantly, but rather moves
|
|
|
|
* the block to the head of nlm_blocked where it can be picked up by lockd.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
nlmsvc_notify_blocked(struct file_lock *fl)
|
|
|
|
{
|
2006-10-04 16:15:57 +07:00
|
|
|
struct nlm_block *block;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
dprintk("lockd: VFS unblock notification for block %p\n", fl);
|
2010-10-27 05:25:30 +07:00
|
|
|
spin_lock(&nlm_blocked_lock);
|
2006-10-04 16:15:57 +07:00
|
|
|
list_for_each_entry(block, &nlm_blocked, b_list) {
|
2006-03-21 01:44:45 +07:00
|
|
|
if (nlm_compare_locks(&block->b_call->a_args.lock.fl, fl)) {
|
2010-10-27 05:25:30 +07:00
|
|
|
nlmsvc_insert_block_locked(block, 0);
|
|
|
|
spin_unlock(&nlm_blocked_lock);
|
2005-04-17 05:20:36 +07:00
|
|
|
svc_wake_up(block->b_daemon);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2010-10-27 05:25:30 +07:00
|
|
|
spin_unlock(&nlm_blocked_lock);
|
2005-04-17 05:20:36 +07:00
|
|
|
printk(KERN_WARNING "lockd: notification for unknown block!\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
static int nlmsvc_same_owner(struct file_lock *fl1, struct file_lock *fl2)
|
|
|
|
{
|
|
|
|
return fl1->fl_owner == fl2->fl_owner && fl1->fl_pid == fl2->fl_pid;
|
|
|
|
}
|
|
|
|
|
2013-06-21 19:58:19 +07:00
|
|
|
/*
|
|
|
|
* Since NLM uses two "keys" for tracking locks, we need to hash them down
|
|
|
|
* to one for the blocked_hash. Here, we're just xor'ing the host address
|
|
|
|
* with the pid in order to create a key value for picking a hash bucket.
|
|
|
|
*/
|
|
|
|
static unsigned long
|
|
|
|
nlmsvc_owner_key(struct file_lock *fl)
|
|
|
|
{
|
|
|
|
return (unsigned long)fl->fl_owner ^ (unsigned long)fl->fl_pid;
|
|
|
|
}
|
|
|
|
|
2009-09-22 07:01:12 +07:00
|
|
|
const struct lock_manager_operations nlmsvc_lock_operations = {
|
2011-07-21 07:21:59 +07:00
|
|
|
.lm_compare_owner = nlmsvc_same_owner,
|
2013-06-21 19:58:19 +07:00
|
|
|
.lm_owner_key = nlmsvc_owner_key,
|
2011-07-21 07:21:59 +07:00
|
|
|
.lm_notify = nlmsvc_notify_blocked,
|
|
|
|
.lm_grant = nlmsvc_grant_deferred,
|
2005-04-17 05:20:36 +07:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Try to claim a lock that was previously blocked.
|
|
|
|
*
|
|
|
|
* Note that we use both the RPC_GRANTED_MSG call _and_ an async
|
|
|
|
* RPC thread when notifying the client. This seems like overkill...
|
|
|
|
* Here's why:
|
|
|
|
* - we don't want to use a synchronous RPC thread, otherwise
|
|
|
|
* we might find ourselves hanging on a dead portmapper.
|
|
|
|
* - Some lockd implementations (e.g. HP) don't react to
|
|
|
|
* RPC_GRANTED calls; they seem to insist on RPC_GRANTED_MSG calls.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
nlmsvc_grant_blocked(struct nlm_block *block)
|
|
|
|
{
|
|
|
|
struct nlm_file *file = block->b_file;
|
2006-03-21 01:44:45 +07:00
|
|
|
struct nlm_lock *lock = &block->b_call->a_args.lock;
|
2005-04-17 05:20:36 +07:00
|
|
|
int error;
|
2014-02-07 13:10:26 +07:00
|
|
|
loff_t fl_start, fl_end;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
dprintk("lockd: grant blocked lock %p\n", block);
|
|
|
|
|
2006-11-29 04:26:51 +07:00
|
|
|
kref_get(&block->b_count);
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/* Unlink block request from list */
|
2006-03-21 01:44:39 +07:00
|
|
|
nlmsvc_unlink_block(block);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/* If b_granted is true this means we've been here before.
|
|
|
|
* Just retry the grant callback, possibly refreshing the RPC
|
|
|
|
* binding */
|
|
|
|
if (block->b_granted) {
|
|
|
|
nlm_rebind_host(block->b_host);
|
|
|
|
goto callback;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Try the lock operation again */
|
2014-02-07 13:10:26 +07:00
|
|
|
/* vfs_lock_file() can mangle fl_start and fl_end, but we need
|
|
|
|
* them unchanged for the GRANT_MSG
|
|
|
|
*/
|
2006-03-21 01:44:38 +07:00
|
|
|
lock->fl.fl_flags |= FL_SLEEP;
|
2014-02-07 13:10:26 +07:00
|
|
|
fl_start = lock->fl.fl_start;
|
|
|
|
fl_end = lock->fl.fl_end;
|
2006-11-29 04:27:06 +07:00
|
|
|
error = vfs_lock_file(file->f_file, F_SETLK, &lock->fl, NULL);
|
2006-03-21 01:44:38 +07:00
|
|
|
lock->fl.fl_flags &= ~FL_SLEEP;
|
2014-02-07 13:10:26 +07:00
|
|
|
lock->fl.fl_start = fl_start;
|
|
|
|
lock->fl.fl_end = fl_end;
|
2006-03-21 01:44:38 +07:00
|
|
|
|
2006-03-21 01:44:25 +07:00
|
|
|
switch (error) {
|
|
|
|
case 0:
|
|
|
|
break;
|
2008-07-25 15:48:57 +07:00
|
|
|
case FILE_LOCK_DEFERRED:
|
2006-11-29 04:27:06 +07:00
|
|
|
dprintk("lockd: lock still blocked error %d\n", error);
|
2005-04-17 05:20:36 +07:00
|
|
|
nlmsvc_insert_block(block, NLM_NEVER);
|
2006-11-29 04:26:51 +07:00
|
|
|
nlmsvc_release_block(block);
|
2006-03-21 01:44:47 +07:00
|
|
|
return;
|
2006-03-21 01:44:25 +07:00
|
|
|
default:
|
2005-04-17 05:20:36 +07:00
|
|
|
printk(KERN_WARNING "lockd: unexpected error %d in %s!\n",
|
2008-04-30 14:55:09 +07:00
|
|
|
-error, __func__);
|
2005-04-17 05:20:36 +07:00
|
|
|
nlmsvc_insert_block(block, 10 * HZ);
|
2006-11-29 04:26:51 +07:00
|
|
|
nlmsvc_release_block(block);
|
2006-03-21 01:44:47 +07:00
|
|
|
return;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
callback:
|
|
|
|
/* Lock was granted by VFS. */
|
|
|
|
dprintk("lockd: GRANTing blocked lock.\n");
|
|
|
|
block->b_granted = 1;
|
|
|
|
|
2008-02-06 23:34:12 +07:00
|
|
|
/* keep block on the list, but don't reattempt until the RPC
|
|
|
|
* completes or the submission fails
|
|
|
|
*/
|
|
|
|
nlmsvc_insert_block(block, NLM_NEVER);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2008-02-06 23:34:12 +07:00
|
|
|
/* Call the client -- use a soft RPC task since nlmsvc_retry_blocked
|
|
|
|
* will queue up a new one if this one times out
|
|
|
|
*/
|
|
|
|
error = nlm_async_call(block->b_call, NLMPROC_GRANTED_MSG,
|
|
|
|
&nlmsvc_grant_ops);
|
|
|
|
|
|
|
|
/* RPC submission failed, wait a bit and retry */
|
|
|
|
if (error < 0)
|
|
|
|
nlmsvc_insert_block(block, 10 * HZ);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is the callback from the RPC layer when the NLM_GRANTED_MSG
|
|
|
|
* RPC call has succeeded or timed out.
|
|
|
|
* Like all RPC callbacks, it is invoked by the rpciod process, so it
|
|
|
|
* better not sleep. Therefore, we put the blocked lock on the nlm_blocked
|
|
|
|
* chain once more in order to have it removed by lockd itself (which can
|
|
|
|
* then sleep on the file semaphore without disrupting e.g. the nfs client).
|
|
|
|
*/
|
2006-01-03 15:55:04 +07:00
|
|
|
static void nlmsvc_grant_callback(struct rpc_task *task, void *data)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2006-01-03 15:55:04 +07:00
|
|
|
struct nlm_rqst *call = data;
|
2006-03-21 01:44:45 +07:00
|
|
|
struct nlm_block *block = call->a_block;
|
2005-04-17 05:20:36 +07:00
|
|
|
unsigned long timeout;
|
|
|
|
|
|
|
|
dprintk("lockd: GRANT_MSG RPC callback\n");
|
|
|
|
|
2010-09-22 03:38:12 +07:00
|
|
|
spin_lock(&nlm_blocked_lock);
|
2008-02-06 23:34:13 +07:00
|
|
|
/* if the block is not on a list at this point then it has
|
|
|
|
* been invalidated. Don't try to requeue it.
|
|
|
|
*
|
|
|
|
* FIXME: it's possible that the block is removed from the list
|
|
|
|
* after this check but before the nlmsvc_insert_block. In that
|
|
|
|
* case it will be added back. Perhaps we need better locking
|
|
|
|
* for nlm_blocked?
|
|
|
|
*/
|
|
|
|
if (list_empty(&block->b_list))
|
2008-06-12 00:37:09 +07:00
|
|
|
goto out;
|
2008-02-06 23:34:13 +07:00
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/* Technically, we should down the file semaphore here. Since we
|
|
|
|
* move the block towards the head of the queue only, no harm
|
|
|
|
* can be done, though. */
|
|
|
|
if (task->tk_status < 0) {
|
|
|
|
/* RPC error: Re-insert for retransmission */
|
|
|
|
timeout = 10 * HZ;
|
|
|
|
} else {
|
|
|
|
/* Call was successful, now wait for client callback */
|
|
|
|
timeout = 60 * HZ;
|
|
|
|
}
|
2010-09-22 03:38:12 +07:00
|
|
|
nlmsvc_insert_block_locked(block, timeout);
|
2005-04-17 05:20:36 +07:00
|
|
|
svc_wake_up(block->b_daemon);
|
2008-06-12 00:37:09 +07:00
|
|
|
out:
|
2010-09-22 03:38:12 +07:00
|
|
|
spin_unlock(&nlm_blocked_lock);
|
2006-03-21 01:44:39 +07:00
|
|
|
}
|
|
|
|
|
2010-09-22 03:38:12 +07:00
|
|
|
/*
|
|
|
|
* FIXME: nlmsvc_release_block() grabs a mutex. This is not allowed for an
|
|
|
|
* .rpc_release rpc_call_op
|
|
|
|
*/
|
2006-04-19 00:21:50 +07:00
|
|
|
static void nlmsvc_grant_release(void *data)
|
2006-03-21 01:44:39 +07:00
|
|
|
{
|
2006-03-21 01:44:45 +07:00
|
|
|
struct nlm_rqst *call = data;
|
|
|
|
nlmsvc_release_block(call->a_block);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2006-01-03 15:55:04 +07:00
|
|
|
static const struct rpc_call_ops nlmsvc_grant_ops = {
|
|
|
|
.rpc_call_done = nlmsvc_grant_callback,
|
2006-03-21 01:44:39 +07:00
|
|
|
.rpc_release = nlmsvc_grant_release,
|
2006-01-03 15:55:04 +07:00
|
|
|
};
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* We received a GRANT_RES callback. Try to find the corresponding
|
|
|
|
* block.
|
|
|
|
*/
|
|
|
|
void
|
2006-12-13 15:35:03 +07:00
|
|
|
nlmsvc_grant_reply(struct nlm_cookie *cookie, __be32 status)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
|
|
|
struct nlm_block *block;
|
|
|
|
|
2006-10-04 16:16:03 +07:00
|
|
|
dprintk("grant_reply: looking for cookie %x, s=%d \n",
|
|
|
|
*(unsigned int *)(cookie->data), status);
|
|
|
|
if (!(block = nlmsvc_find_block(cookie)))
|
2005-04-17 05:20:36 +07:00
|
|
|
return;
|
|
|
|
|
2017-04-09 00:09:59 +07:00
|
|
|
if (status == nlm_lck_denied_grace_period) {
|
|
|
|
/* Try again in a couple of seconds */
|
|
|
|
nlmsvc_insert_block(block, 10 * HZ);
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Lock is now held by client, or has been rejected.
|
|
|
|
* In both cases, the block should be removed.
|
|
|
|
*/
|
|
|
|
nlmsvc_unlink_block(block);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
2006-03-21 01:44:39 +07:00
|
|
|
nlmsvc_release_block(block);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2006-11-29 04:26:51 +07:00
|
|
|
/* Helper function to handle retry of a deferred block.
|
|
|
|
* If it is a blocking lock, call grant_blocked.
|
|
|
|
* For a non-blocking lock or test lock, revisit the request.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
retry_deferred_block(struct nlm_block *block)
|
|
|
|
{
|
|
|
|
if (!(block->b_flags & B_GOT_CALLBACK))
|
|
|
|
block->b_flags |= B_TIMED_OUT;
|
|
|
|
nlmsvc_insert_block(block, NLM_TIMEOUT);
|
|
|
|
dprintk("revisit block %p flags %d\n", block, block->b_flags);
|
|
|
|
if (block->b_deferred_req) {
|
|
|
|
block->b_deferred_req->revisit(block->b_deferred_req, 0);
|
|
|
|
block->b_deferred_req = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* Retry all blocked locks that have been notified. This is where lockd
|
|
|
|
* picks up locks that can be granted, or grant notifications that must
|
|
|
|
* be retransmitted.
|
|
|
|
*/
|
|
|
|
unsigned long
|
|
|
|
nlmsvc_retry_blocked(void)
|
|
|
|
{
|
2006-10-04 16:15:57 +07:00
|
|
|
unsigned long timeout = MAX_SCHEDULE_TIMEOUT;
|
|
|
|
struct nlm_block *block;
|
|
|
|
|
2013-07-11 00:19:50 +07:00
|
|
|
spin_lock(&nlm_blocked_lock);
|
2008-02-08 04:34:55 +07:00
|
|
|
while (!list_empty(&nlm_blocked) && !kthread_should_stop()) {
|
2006-10-04 16:15:57 +07:00
|
|
|
block = list_entry(nlm_blocked.next, struct nlm_block, b_list);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
if (block->b_when == NLM_NEVER)
|
|
|
|
break;
|
2008-07-16 01:38:32 +07:00
|
|
|
if (time_after(block->b_when, jiffies)) {
|
2006-10-04 16:15:57 +07:00
|
|
|
timeout = block->b_when - jiffies;
|
2005-04-17 05:20:36 +07:00
|
|
|
break;
|
2006-10-04 16:15:57 +07:00
|
|
|
}
|
2013-07-11 00:19:50 +07:00
|
|
|
spin_unlock(&nlm_blocked_lock);
|
2006-10-04 16:15:57 +07:00
|
|
|
|
2006-08-04 02:07:47 +07:00
|
|
|
dprintk("nlmsvc_retry_blocked(%p, when=%ld)\n",
|
|
|
|
block, block->b_when);
|
2006-11-29 04:26:51 +07:00
|
|
|
if (block->b_flags & B_QUEUED) {
|
|
|
|
dprintk("nlmsvc_retry_blocked delete block (%p, granted=%d, flags=%d)\n",
|
|
|
|
block, block->b_granted, block->b_flags);
|
|
|
|
retry_deferred_block(block);
|
|
|
|
} else
|
|
|
|
nlmsvc_grant_blocked(block);
|
2013-07-11 00:19:50 +07:00
|
|
|
spin_lock(&nlm_blocked_lock);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
2013-07-11 00:19:50 +07:00
|
|
|
spin_unlock(&nlm_blocked_lock);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2006-10-04 16:15:57 +07:00
|
|
|
return timeout;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|