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 14:07:57 +00:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* linux/include/linux/sunrpc/svc.h
|
|
|
|
*
|
|
|
|
* RPC server declarations.
|
|
|
|
*
|
|
|
|
* Copyright (C) 1995, 1996 Olaf Kirch <okir@monad.swb.de>
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef SUNRPC_SVC_H
|
|
|
|
#define SUNRPC_SVC_H
|
|
|
|
|
|
|
|
#include <linux/in.h>
|
2007-02-12 08:53:35 +00:00
|
|
|
#include <linux/in6.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/sunrpc/types.h>
|
|
|
|
#include <linux/sunrpc/xdr.h>
|
2006-10-04 09:15:47 +00:00
|
|
|
#include <linux/sunrpc/auth.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/sunrpc/svcauth.h>
|
|
|
|
#include <linux/wait.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
|
2009-01-13 10:26:36 +00:00
|
|
|
/* statistics for svc_pool structures */
|
|
|
|
struct svc_pool_stats {
|
2014-11-21 19:19:29 +00:00
|
|
|
atomic_long_t packets;
|
2009-01-13 10:26:36 +00:00
|
|
|
unsigned long sockets_queued;
|
2014-11-21 19:19:29 +00:00
|
|
|
atomic_long_t threads_woken;
|
|
|
|
atomic_long_t threads_timedout;
|
2009-01-13 10:26:36 +00:00
|
|
|
};
|
|
|
|
|
2006-10-02 09:17:58 +00:00
|
|
|
/*
|
|
|
|
*
|
|
|
|
* RPC service thread pool.
|
|
|
|
*
|
|
|
|
* Pool of threads and temporary sockets. Generally there is only
|
|
|
|
* a single one of these per RPC service, but on NUMA machines those
|
|
|
|
* services that can benefit from it (i.e. nfs but not lockd) will
|
|
|
|
* have one pool per NUMA node. This optimisation reduces cross-
|
|
|
|
* node traffic on multi-node NUMA NFS servers.
|
|
|
|
*/
|
|
|
|
struct svc_pool {
|
|
|
|
unsigned int sp_id; /* pool id; also node id on NUMA */
|
|
|
|
spinlock_t sp_lock; /* protects all fields */
|
|
|
|
struct list_head sp_sockets; /* pending sockets */
|
|
|
|
unsigned int sp_nrthreads; /* # of threads in pool */
|
2006-10-02 09:17:59 +00:00
|
|
|
struct list_head sp_all_threads; /* all server threads */
|
2009-01-13 10:26:36 +00:00
|
|
|
struct svc_pool_stats sp_stats; /* statistics on pool operation */
|
2014-11-19 12:51:20 +00:00
|
|
|
#define SP_TASK_PENDING (0) /* still work to do even if no
|
|
|
|
* xprt is queued. */
|
2017-10-10 21:31:43 +00:00
|
|
|
#define SP_CONGESTED (1)
|
2014-11-19 12:51:20 +00:00
|
|
|
unsigned long sp_flags;
|
2006-10-02 09:17:58 +00:00
|
|
|
} ____cacheline_aligned_in_smp;
|
|
|
|
|
2015-06-08 19:03:32 +00:00
|
|
|
struct svc_serv;
|
|
|
|
|
|
|
|
struct svc_serv_ops {
|
|
|
|
/* Callback to use when last thread exits. */
|
2015-06-08 19:04:46 +00:00
|
|
|
void (*svo_shutdown)(struct svc_serv *, struct net *);
|
2015-06-08 19:05:56 +00:00
|
|
|
|
|
|
|
/* function for service threads to run */
|
2015-06-08 19:04:46 +00:00
|
|
|
int (*svo_function)(void *);
|
2015-06-08 19:05:56 +00:00
|
|
|
|
2015-06-08 19:06:51 +00:00
|
|
|
/* queue up a transport for servicing */
|
|
|
|
void (*svo_enqueue_xprt)(struct svc_xprt *);
|
|
|
|
|
2015-06-08 19:08:33 +00:00
|
|
|
/* set up thread (or whatever) execution context */
|
|
|
|
int (*svo_setup)(struct svc_serv *, struct svc_pool *, int);
|
|
|
|
|
2015-06-08 19:05:56 +00:00
|
|
|
/* optional module to count when adding threads (pooled svcs only) */
|
|
|
|
struct module *svo_module;
|
2015-06-08 19:03:32 +00:00
|
|
|
};
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* RPC service.
|
|
|
|
*
|
|
|
|
* An RPC service is a ``daemon,'' possibly multithreaded, which
|
|
|
|
* receives and processes incoming RPC messages.
|
|
|
|
* It has one or more transport sockets associated with it, and maintains
|
|
|
|
* a list of idle threads waiting for input.
|
|
|
|
*
|
|
|
|
* We currently do not support more than one RPC program per daemon.
|
|
|
|
*/
|
|
|
|
struct svc_serv {
|
|
|
|
struct svc_program * sv_program; /* RPC program */
|
|
|
|
struct svc_stat * sv_stats; /* RPC statistics */
|
|
|
|
spinlock_t sv_lock;
|
|
|
|
unsigned int sv_nrthreads; /* # of server threads */
|
2008-10-20 15:51:57 +00:00
|
|
|
unsigned int sv_maxconn; /* max connections allowed or
|
|
|
|
* '0' causing max to be based
|
|
|
|
* on number of threads. */
|
|
|
|
|
2006-10-06 07:44:05 +00:00
|
|
|
unsigned int sv_max_payload; /* datagram payload size */
|
|
|
|
unsigned int sv_max_mesg; /* max_payload + 1 page for overheads */
|
2005-04-16 22:20:36 +00:00
|
|
|
unsigned int sv_xdrsize; /* XDR buffer size */
|
|
|
|
struct list_head sv_permsocks; /* all permanent sockets */
|
|
|
|
struct list_head sv_tempsocks; /* all temporary sockets */
|
|
|
|
int sv_tmpcnt; /* count of temporary sockets */
|
2006-10-02 09:17:54 +00:00
|
|
|
struct timer_list sv_temptimer; /* timer for aging temporary sockets */
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
char * sv_name; /* service name */
|
2006-10-02 09:17:44 +00:00
|
|
|
|
2006-10-02 09:17:58 +00:00
|
|
|
unsigned int sv_nrpools; /* number of thread pools */
|
|
|
|
struct svc_pool * sv_pools; /* array of thread pools */
|
2017-08-01 16:00:06 +00:00
|
|
|
const struct svc_serv_ops *sv_ops; /* server operations */
|
2011-07-13 23:20:49 +00:00
|
|
|
#if defined(CONFIG_SUNRPC_BACKCHANNEL)
|
2009-04-01 13:22:58 +00:00
|
|
|
struct list_head sv_cb_list; /* queue for callback requests
|
|
|
|
* that arrive over the same
|
|
|
|
* connection */
|
|
|
|
spinlock_t sv_cb_lock; /* protects the svc_cb_list */
|
|
|
|
wait_queue_head_t sv_cb_waitq; /* sleep here if there are no
|
|
|
|
* entries in the svc_cb_list */
|
2018-12-24 11:45:04 +00:00
|
|
|
bool sv_bc_enabled; /* service uses backchannel */
|
2011-07-13 23:20:49 +00:00
|
|
|
#endif /* CONFIG_SUNRPC_BACKCHANNEL */
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
2006-10-02 09:17:58 +00:00
|
|
|
/*
|
|
|
|
* We use sv_nrthreads as a reference count. svc_destroy() drops
|
|
|
|
* this refcount, so we need to bump it up around operations that
|
|
|
|
* change the number of threads. Horrible, but there it is.
|
2015-01-22 13:19:32 +00:00
|
|
|
* Should be called with the "service mutex" held.
|
2006-10-02 09:17:58 +00:00
|
|
|
*/
|
|
|
|
static inline void svc_get(struct svc_serv *serv)
|
|
|
|
{
|
|
|
|
serv->sv_nrthreads++;
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Maximum payload size supported by a kernel RPC server.
|
|
|
|
* This is use to determine the max number of pages nfsd is
|
|
|
|
* willing to return in a single READ operation.
|
2006-10-04 09:15:47 +00:00
|
|
|
*
|
|
|
|
* These happen to all be powers of 2, which is not strictly
|
|
|
|
* necessary but helps enforce the real limitation, which is
|
2016-04-01 12:29:48 +00:00
|
|
|
* that they should be multiples of PAGE_SIZE.
|
2006-10-04 09:15:47 +00:00
|
|
|
*
|
|
|
|
* For UDP transports, a block plus NFS,RPC, and UDP headers
|
|
|
|
* has to fit into the IP datagram limit of 64K. The largest
|
|
|
|
* feasible number for all known page sizes is probably 48K,
|
|
|
|
* but we choose 32K here. This is the same as the historical
|
|
|
|
* Linux limit; someone who cares more about NFS/UDP performance
|
|
|
|
* can test a larger number.
|
|
|
|
*
|
|
|
|
* For TCP transports we have more freedom. A size of 1MB is
|
|
|
|
* chosen to match the client limit. Other OSes are known to
|
|
|
|
* have larger limits, but those numbers are probably beyond
|
|
|
|
* the point of diminishing returns.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2006-10-04 09:15:47 +00:00
|
|
|
#define RPCSVC_MAXPAYLOAD (1*1024*1024u)
|
|
|
|
#define RPCSVC_MAXPAYLOAD_TCP RPCSVC_MAXPAYLOAD
|
|
|
|
#define RPCSVC_MAXPAYLOAD_UDP (32*1024u)
|
|
|
|
|
|
|
|
extern u32 svc_max_payload(const struct svc_rqst *rqstp);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* RPC Requsts and replies are stored in one or more pages.
|
|
|
|
* We maintain an array of pages for each server thread.
|
|
|
|
* Requests are copied into these pages as they arrive. Remaining
|
|
|
|
* pages are available to write the reply into.
|
|
|
|
*
|
|
|
|
* Pages are sent using ->sendpage so each server thread needs to
|
|
|
|
* allocate more to replace those used in sending. To help keep track
|
|
|
|
* of these pages we have a receive list where all pages initialy live,
|
|
|
|
* and a send list where pages are moved to when there are to be part
|
|
|
|
* of a reply.
|
|
|
|
*
|
|
|
|
* We use xdr_buf for holding responses as it fits well with NFS
|
|
|
|
* read responses (that have a header, and some data pages, and possibly
|
|
|
|
* a tail) and means we can share some client side routines.
|
|
|
|
*
|
|
|
|
* The xdr_buf.head kvec always points to the first page in the rq_*pages
|
|
|
|
* list. The xdr_buf.pages pointer points to the second page on that
|
|
|
|
* list. xdr_buf.tail points to the end of the first page.
|
|
|
|
* This assumes that the non-page part of an rpc reply will fit
|
|
|
|
* in a page - NFSd ensures this. lockd also has no trouble.
|
|
|
|
*
|
|
|
|
* Each request/reply pair can have at most one "payload", plus two pages,
|
|
|
|
* one for the request, and one for the reply.
|
2007-01-26 08:56:59 +00:00
|
|
|
* We using ->sendfile to return read data, we might need one extra page
|
|
|
|
* if the request is not page-aligned. So add another '1'.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2007-01-26 08:56:59 +00:00
|
|
|
#define RPCSVC_MAXPAGES ((RPCSVC_MAXPAYLOAD+PAGE_SIZE-1)/PAGE_SIZE \
|
|
|
|
+ 2 + 1)
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2006-09-27 05:28:46 +00:00
|
|
|
static inline u32 svc_getnl(struct kvec *iov)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2006-09-27 05:28:46 +00:00
|
|
|
__be32 val, *vp;
|
2005-04-16 22:20:36 +00:00
|
|
|
vp = iov->iov_base;
|
|
|
|
val = *vp++;
|
|
|
|
iov->iov_base = (void*)vp;
|
2006-09-27 05:28:46 +00:00
|
|
|
iov->iov_len -= sizeof(__be32);
|
|
|
|
return ntohl(val);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void svc_putnl(struct kvec *iov, u32 val)
|
|
|
|
{
|
|
|
|
__be32 *vp = iov->iov_base + iov->iov_len;
|
|
|
|
*vp = htonl(val);
|
|
|
|
iov->iov_len += sizeof(__be32);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline __be32 svc_getu32(struct kvec *iov)
|
|
|
|
{
|
|
|
|
__be32 val, *vp;
|
|
|
|
vp = iov->iov_base;
|
|
|
|
val = *vp++;
|
|
|
|
iov->iov_base = (void*)vp;
|
|
|
|
iov->iov_len -= sizeof(__be32);
|
2005-04-16 22:20:36 +00:00
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void svc_ungetu32(struct kvec *iov)
|
|
|
|
{
|
2006-09-27 05:28:46 +00:00
|
|
|
__be32 *vp = (__be32 *)iov->iov_base;
|
2005-04-16 22:20:36 +00:00
|
|
|
iov->iov_base = (void *)(vp - 1);
|
|
|
|
iov->iov_len += sizeof(*vp);
|
|
|
|
}
|
|
|
|
|
2006-09-27 05:28:46 +00:00
|
|
|
static inline void svc_putu32(struct kvec *iov, __be32 val)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2006-09-27 05:28:46 +00:00
|
|
|
__be32 *vp = iov->iov_base + iov->iov_len;
|
2005-04-16 22:20:36 +00:00
|
|
|
*vp = val;
|
2006-09-27 05:28:46 +00:00
|
|
|
iov->iov_len += sizeof(__be32);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The context of a single thread, including the request currently being
|
|
|
|
* processed.
|
|
|
|
*/
|
|
|
|
struct svc_rqst {
|
2006-10-02 09:17:59 +00:00
|
|
|
struct list_head rq_all; /* all threads list */
|
2014-11-21 19:19:28 +00:00
|
|
|
struct rcu_head rq_rcu_head; /* for RCU deferred kfree */
|
2007-12-31 03:08:22 +00:00
|
|
|
struct svc_xprt * rq_xprt; /* transport ptr */
|
2011-08-30 09:18:41 +00:00
|
|
|
|
2007-02-12 08:53:34 +00:00
|
|
|
struct sockaddr_storage rq_addr; /* peer address */
|
|
|
|
size_t rq_addrlen;
|
2011-08-30 09:18:41 +00:00
|
|
|
struct sockaddr_storage rq_daddr; /* dest addr of request
|
|
|
|
* - reply from here */
|
|
|
|
size_t rq_daddrlen;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
struct svc_serv * rq_server; /* RPC service definition */
|
2006-10-02 09:17:58 +00:00
|
|
|
struct svc_pool * rq_pool; /* thread pool */
|
2017-05-12 14:11:49 +00:00
|
|
|
const struct svc_procedure *rq_procinfo;/* procedure info */
|
2005-04-16 22:20:36 +00:00
|
|
|
struct auth_ops * rq_authop; /* authentication flavour */
|
|
|
|
struct svc_cred rq_cred; /* auth info */
|
2007-12-31 03:07:25 +00:00
|
|
|
void * rq_xprt_ctxt; /* transport specific context ptr */
|
2005-04-16 22:20:36 +00:00
|
|
|
struct svc_deferred_req*rq_deferred; /* deferred request we are replaying */
|
|
|
|
|
2007-12-31 03:08:29 +00:00
|
|
|
size_t rq_xprt_hlen; /* xprt header len */
|
2005-04-16 22:20:36 +00:00
|
|
|
struct xdr_buf rq_arg;
|
|
|
|
struct xdr_buf rq_res;
|
2017-06-30 16:03:54 +00:00
|
|
|
struct page *rq_pages[RPCSVC_MAXPAGES + 1];
|
2006-10-04 09:15:46 +00:00
|
|
|
struct page * *rq_respages; /* points into rq_pages */
|
2012-12-10 23:01:37 +00:00
|
|
|
struct page * *rq_next_page; /* next reply page to use */
|
2013-08-26 20:04:46 +00:00
|
|
|
struct page * *rq_page_end; /* one past the last page */
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2006-10-04 09:15:47 +00:00
|
|
|
struct kvec rq_vec[RPCSVC_MAXPAGES]; /* generally useful.. */
|
2020-05-20 21:30:12 +00:00
|
|
|
struct bio_vec rq_bvec[RPCSVC_MAXPAGES];
|
2006-10-04 09:15:47 +00:00
|
|
|
|
2006-09-27 05:29:38 +00:00
|
|
|
__be32 rq_xid; /* transmission id */
|
2005-04-16 22:20:36 +00:00
|
|
|
u32 rq_prog; /* program number */
|
|
|
|
u32 rq_vers; /* program version */
|
|
|
|
u32 rq_proc; /* procedure number */
|
|
|
|
u32 rq_prot; /* IP protocol */
|
2014-11-19 12:51:19 +00:00
|
|
|
int rq_cachetype; /* catering to nfsd */
|
2014-11-19 12:51:14 +00:00
|
|
|
#define RQ_SECURE (0) /* secure port */
|
2014-11-19 12:51:15 +00:00
|
|
|
#define RQ_LOCAL (1) /* local request */
|
2014-11-19 12:51:16 +00:00
|
|
|
#define RQ_USEDEFERRAL (2) /* use deferral */
|
2014-11-19 12:51:17 +00:00
|
|
|
#define RQ_DROPME (3) /* drop current reply */
|
2014-11-19 12:51:18 +00:00
|
|
|
#define RQ_SPLICE_OK (4) /* turned off in gss privacy
|
|
|
|
* to prevent encrypting page
|
|
|
|
* cache pages */
|
2014-11-21 19:19:28 +00:00
|
|
|
#define RQ_VICTIM (5) /* about to be shut down */
|
sunrpc: convert to lockless lookup of queued server threads
Testing has shown that the pool->sp_lock can be a bottleneck on a busy
server. Every time data is received on a socket, the server must take
that lock in order to dequeue a thread from the sp_threads list.
Address this problem by eliminating the sp_threads list (which contains
threads that are currently idle) and replacing it with a RQ_BUSY flag in
svc_rqst. This allows us to walk the sp_all_threads list under the
rcu_read_lock and find a suitable thread for the xprt by doing a
test_and_set_bit.
Note that we do still have a potential atomicity problem however with
this approach. We don't want svc_xprt_do_enqueue to set the
rqst->rq_xprt pointer unless a test_and_set_bit of RQ_BUSY returned
zero (which indicates that the thread was idle). But, by the time we
check that, the bit could be flipped by a waking thread.
To address this, we acquire a new per-rqst spinlock (rq_lock) and take
that before doing the test_and_set_bit. If that returns false, then we
can set rq_xprt and drop the spinlock. Then, when the thread wakes up,
it must set the bit under the same spinlock and can trust that if it was
already set then the rq_xprt is also properly set.
With this scheme, the case where we have an idle thread no longer needs
to take the highly contended pool->sp_lock at all, and that removes the
bottleneck.
That still leaves one issue: What of the case where we walk the whole
sp_all_threads list and don't find an idle thread? Because the search is
lockess, it's possible for the queueing to race with a thread that is
going to sleep. To address that, we queue the xprt and then search again.
If we find an idle thread at that point, we can't attach the xprt to it
directly since that might race with a different thread waking up and
finding it. All we can do is wake the idle thread back up and let it
attempt to find the now-queued xprt.
Signed-off-by: Jeff Layton <jlayton@primarydata.com>
Tested-by: Chris Worley <chris.worley@primarydata.com>
Signed-off-by: J. Bruce Fields <bfields@redhat.com>
2014-11-21 19:19:30 +00:00
|
|
|
#define RQ_BUSY (6) /* request is busy */
|
2016-06-24 14:55:50 +00:00
|
|
|
#define RQ_DATA (7) /* request has data */
|
2019-04-09 15:46:14 +00:00
|
|
|
#define RQ_AUTHERR (8) /* Request status is auth error */
|
2014-11-19 12:51:14 +00:00
|
|
|
unsigned long rq_flags; /* flags field */
|
2018-03-27 14:52:27 +00:00
|
|
|
ktime_t rq_qtime; /* enqueue time */
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
void * rq_argp; /* decoded arguments */
|
|
|
|
void * rq_resp; /* xdr'd results */
|
|
|
|
void * rq_auth_data; /* flavor-specific data */
|
2014-05-12 22:10:58 +00:00
|
|
|
int rq_auth_slack; /* extra space xdr code
|
|
|
|
* should leave in head
|
|
|
|
* for krb5i, krb5p.
|
|
|
|
*/
|
2005-04-16 22:20:36 +00:00
|
|
|
int rq_reserved; /* space on socket outq
|
|
|
|
* reserved for this request
|
|
|
|
*/
|
2018-03-27 14:51:39 +00:00
|
|
|
ktime_t rq_stime; /* start time */
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
struct cache_req rq_chandle; /* handle passed to caches for
|
|
|
|
* request delaying
|
|
|
|
*/
|
|
|
|
/* Catering to nfsd */
|
|
|
|
struct auth_domain * rq_client; /* RPC peer info */
|
knfsd: nfsd: set rq_client to ip-address-determined-domain
We want it to be possible for users to restrict exports both by IP address and
by pseudoflavor. The pseudoflavor information has previously been passed
using special auth_domains stored in the rq_client field. After the preceding
patch that stored the pseudoflavor in rq_pflavor, that's now superfluous; so
now we use rq_client for the ip information, as auth_null and auth_unix do.
However, we keep around the special auth_domain in the rq_gssclient field for
backwards compatibility purposes, so we can still do upcalls using the old
"gss/pseudoflavor" auth_domain if upcalls using the unix domain to give us an
appropriate export. This allows us to continue supporting old mountd.
In fact, for this first patch, we always use the "gss/pseudoflavor"
auth_domain (and only it) if it is available; thus rq_client is ignored in the
auth_gss case, and this patch on its own makes no change in behavior; that
will be left to later patches.
Note on idmap: I'm almost tempted to just replace the auth_domain in the idmap
upcall by a dummy value--no version of idmapd has ever used it, and it's
unlikely anyone really wants to perform idmapping differently depending on the
where the client is (they may want to perform *credential* mapping
differently, but that's a different matter--the idmapper just handles id's
used in getattr and setattr). But I'm updating the idmapd code anyway, just
out of general backwards-compatibility paranoia.
Signed-off-by: "J. Bruce Fields" <bfields@citi.umich.edu>
Signed-off-by: Neil Brown <neilb@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-07-17 11:04:46 +00:00
|
|
|
struct auth_domain * rq_gssclient; /* "gss/"-style peer info */
|
2005-04-16 22:20:36 +00:00
|
|
|
struct svc_cacherep * rq_cacherep; /* cache info */
|
2006-10-02 09:17:59 +00:00
|
|
|
struct task_struct *rq_task; /* service thread */
|
sunrpc: convert to lockless lookup of queued server threads
Testing has shown that the pool->sp_lock can be a bottleneck on a busy
server. Every time data is received on a socket, the server must take
that lock in order to dequeue a thread from the sp_threads list.
Address this problem by eliminating the sp_threads list (which contains
threads that are currently idle) and replacing it with a RQ_BUSY flag in
svc_rqst. This allows us to walk the sp_all_threads list under the
rcu_read_lock and find a suitable thread for the xprt by doing a
test_and_set_bit.
Note that we do still have a potential atomicity problem however with
this approach. We don't want svc_xprt_do_enqueue to set the
rqst->rq_xprt pointer unless a test_and_set_bit of RQ_BUSY returned
zero (which indicates that the thread was idle). But, by the time we
check that, the bit could be flipped by a waking thread.
To address this, we acquire a new per-rqst spinlock (rq_lock) and take
that before doing the test_and_set_bit. If that returns false, then we
can set rq_xprt and drop the spinlock. Then, when the thread wakes up,
it must set the bit under the same spinlock and can trust that if it was
already set then the rq_xprt is also properly set.
With this scheme, the case where we have an idle thread no longer needs
to take the highly contended pool->sp_lock at all, and that removes the
bottleneck.
That still leaves one issue: What of the case where we walk the whole
sp_all_threads list and don't find an idle thread? Because the search is
lockess, it's possible for the queueing to race with a thread that is
going to sleep. To address that, we queue the xprt and then search again.
If we find an idle thread at that point, we can't attach the xprt to it
directly since that might race with a different thread waking up and
finding it. All we can do is wake the idle thread back up and let it
attempt to find the now-queued xprt.
Signed-off-by: Jeff Layton <jlayton@primarydata.com>
Tested-by: Chris Worley <chris.worley@primarydata.com>
Signed-off-by: J. Bruce Fields <bfields@redhat.com>
2014-11-21 19:19:30 +00:00
|
|
|
spinlock_t rq_lock; /* per-request lock */
|
2018-12-24 11:44:52 +00:00
|
|
|
struct net *rq_bc_net; /* pointer to backchannel's
|
|
|
|
* net namespace
|
|
|
|
*/
|
2017-07-28 20:35:15 +00:00
|
|
|
void ** rq_lease_breaker; /* The v4 client breaking a lease */
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
2018-12-24 11:44:52 +00:00
|
|
|
#define SVC_NET(rqst) (rqst->rq_xprt ? rqst->rq_xprt->xpt_net : rqst->rq_bc_net)
|
2012-07-25 12:57:06 +00:00
|
|
|
|
2007-02-12 08:53:34 +00:00
|
|
|
/*
|
|
|
|
* Rigorous type checking on sockaddr type conversions
|
|
|
|
*/
|
2008-08-27 20:57:46 +00:00
|
|
|
static inline struct sockaddr_in *svc_addr_in(const struct svc_rqst *rqst)
|
2007-02-12 08:53:34 +00:00
|
|
|
{
|
|
|
|
return (struct sockaddr_in *) &rqst->rq_addr;
|
|
|
|
}
|
|
|
|
|
2008-08-27 20:57:46 +00:00
|
|
|
static inline struct sockaddr_in6 *svc_addr_in6(const struct svc_rqst *rqst)
|
2007-02-12 08:53:38 +00:00
|
|
|
{
|
|
|
|
return (struct sockaddr_in6 *) &rqst->rq_addr;
|
|
|
|
}
|
|
|
|
|
2008-08-27 20:57:46 +00:00
|
|
|
static inline struct sockaddr *svc_addr(const struct svc_rqst *rqst)
|
2007-02-12 08:53:34 +00:00
|
|
|
{
|
|
|
|
return (struct sockaddr *) &rqst->rq_addr;
|
|
|
|
}
|
|
|
|
|
2011-08-30 09:18:41 +00:00
|
|
|
static inline struct sockaddr_in *svc_daddr_in(const struct svc_rqst *rqst)
|
|
|
|
{
|
|
|
|
return (struct sockaddr_in *) &rqst->rq_daddr;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline struct sockaddr_in6 *svc_daddr_in6(const struct svc_rqst *rqst)
|
|
|
|
{
|
|
|
|
return (struct sockaddr_in6 *) &rqst->rq_daddr;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline struct sockaddr *svc_daddr(const struct svc_rqst *rqst)
|
|
|
|
{
|
|
|
|
return (struct sockaddr *) &rqst->rq_daddr;
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Check buffer bounds after decoding arguments
|
|
|
|
*/
|
|
|
|
static inline int
|
2006-09-27 05:29:38 +00:00
|
|
|
xdr_argsize_check(struct svc_rqst *rqstp, __be32 *p)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
char *cp = (char *)p;
|
|
|
|
struct kvec *vec = &rqstp->rq_arg.head[0];
|
2017-05-16 19:57:42 +00:00
|
|
|
return cp >= (char*)vec->iov_base
|
|
|
|
&& cp <= (char*)vec->iov_base + vec->iov_len;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline int
|
2006-09-27 05:29:38 +00:00
|
|
|
xdr_ressize_check(struct svc_rqst *rqstp, __be32 *p)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct kvec *vec = &rqstp->rq_res.head[0];
|
|
|
|
char *cp = (char*)p;
|
|
|
|
|
|
|
|
vec->iov_len = cp - (char*)vec->iov_base;
|
|
|
|
|
|
|
|
return vec->iov_len <= PAGE_SIZE;
|
|
|
|
}
|
|
|
|
|
2006-10-04 09:15:46 +00:00
|
|
|
static inline void svc_free_res_pages(struct svc_rqst *rqstp)
|
2005-06-22 17:16:26 +00:00
|
|
|
{
|
2012-12-10 23:01:37 +00:00
|
|
|
while (rqstp->rq_next_page != rqstp->rq_respages) {
|
|
|
|
struct page **pp = --rqstp->rq_next_page;
|
2006-10-04 09:15:46 +00:00
|
|
|
if (*pp) {
|
|
|
|
put_page(*pp);
|
|
|
|
*pp = NULL;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
struct svc_deferred_req {
|
|
|
|
u32 prot; /* protocol (UDP or TCP) */
|
2007-12-31 03:08:10 +00:00
|
|
|
struct svc_xprt *xprt;
|
2007-02-12 08:53:33 +00:00
|
|
|
struct sockaddr_storage addr; /* where reply must go */
|
|
|
|
size_t addrlen;
|
2011-08-30 09:18:41 +00:00
|
|
|
struct sockaddr_storage daddr; /* where reply must come from */
|
|
|
|
size_t daddrlen;
|
2005-04-16 22:20:36 +00:00
|
|
|
struct cache_deferred_req handle;
|
2007-12-31 03:08:29 +00:00
|
|
|
size_t xprt_hlen;
|
2005-04-16 22:20:36 +00:00
|
|
|
int argslen;
|
2020-02-28 13:23:23 +00:00
|
|
|
__be32 args[];
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
2019-04-09 15:46:15 +00:00
|
|
|
struct svc_process_info {
|
|
|
|
union {
|
|
|
|
int (*dispatch)(struct svc_rqst *, __be32 *);
|
|
|
|
struct {
|
|
|
|
unsigned int lovers;
|
|
|
|
unsigned int hivers;
|
|
|
|
} mismatch;
|
|
|
|
};
|
|
|
|
};
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
2005-06-22 17:16:24 +00:00
|
|
|
* List of RPC programs on the same transport endpoint
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
|
|
|
struct svc_program {
|
2005-06-22 17:16:24 +00:00
|
|
|
struct svc_program * pg_next; /* other programs (same xprt) */
|
2005-04-16 22:20:36 +00:00
|
|
|
u32 pg_prog; /* program number */
|
|
|
|
unsigned int pg_lovers; /* lowest version */
|
2013-11-30 09:56:44 +00:00
|
|
|
unsigned int pg_hivers; /* highest version */
|
2005-04-16 22:20:36 +00:00
|
|
|
unsigned int pg_nvers; /* number of versions */
|
2017-05-12 14:21:37 +00:00
|
|
|
const struct svc_version **pg_vers; /* version array */
|
2005-04-16 22:20:36 +00:00
|
|
|
char * pg_name; /* service name */
|
|
|
|
char * pg_class; /* class name: services sharing authentication */
|
|
|
|
struct svc_stat * pg_stats; /* rpc statistics */
|
|
|
|
int (*pg_authenticate)(struct svc_rqst *);
|
2019-04-09 15:46:15 +00:00
|
|
|
__be32 (*pg_init_request)(struct svc_rqst *,
|
|
|
|
const struct svc_program *,
|
|
|
|
struct svc_process_info *);
|
2019-04-09 15:46:17 +00:00
|
|
|
int (*pg_rpcbind_set)(struct net *net,
|
|
|
|
const struct svc_program *,
|
|
|
|
u32 version, int family,
|
|
|
|
unsigned short proto,
|
|
|
|
unsigned short port);
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* RPC program version
|
|
|
|
*/
|
|
|
|
struct svc_version {
|
|
|
|
u32 vs_vers; /* version number */
|
|
|
|
u32 vs_nproc; /* number of procedures */
|
2017-05-12 14:11:49 +00:00
|
|
|
const struct svc_procedure *vs_proc; /* per-procedure info */
|
2017-05-08 21:40:27 +00:00
|
|
|
unsigned int *vs_count; /* call counts */
|
2005-04-16 22:20:36 +00:00
|
|
|
u32 vs_xdrsize; /* xdrsize needed for this version */
|
|
|
|
|
2017-02-24 18:25:22 +00:00
|
|
|
/* Don't register with rpcbind */
|
|
|
|
bool vs_hidden;
|
|
|
|
|
|
|
|
/* Don't care if the rpcbind registration fails */
|
|
|
|
bool vs_rpcb_optnl;
|
2006-10-04 09:16:05 +00:00
|
|
|
|
2017-02-24 18:25:24 +00:00
|
|
|
/* Need xprt with congestion control */
|
|
|
|
bool vs_need_cong_ctrl;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/* Override dispatch function (e.g. when caching replies).
|
|
|
|
* A return value of 0 means drop the request.
|
|
|
|
* vs_dispatch == NULL means use default dispatcher.
|
|
|
|
*/
|
2006-09-27 05:29:38 +00:00
|
|
|
int (*vs_dispatch)(struct svc_rqst *, __be32 *);
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* RPC procedure info
|
|
|
|
*/
|
|
|
|
struct svc_procedure {
|
2017-05-08 15:35:49 +00:00
|
|
|
/* process the request: */
|
|
|
|
__be32 (*pc_func)(struct svc_rqst *);
|
2017-05-08 17:01:48 +00:00
|
|
|
/* XDR decode args: */
|
|
|
|
int (*pc_decode)(struct svc_rqst *, __be32 *data);
|
2017-05-08 17:42:02 +00:00
|
|
|
/* XDR encode result: */
|
|
|
|
int (*pc_encode)(struct svc_rqst *, __be32 *data);
|
2017-05-08 16:48:24 +00:00
|
|
|
/* XDR free result: */
|
|
|
|
void (*pc_release)(struct svc_rqst *);
|
2005-04-16 22:20:36 +00:00
|
|
|
unsigned int pc_argsize; /* argument struct size */
|
|
|
|
unsigned int pc_ressize; /* result struct size */
|
|
|
|
unsigned int pc_cachetype; /* cache info (NFS) */
|
|
|
|
unsigned int pc_xdrressize; /* maximum size of XDR reply */
|
|
|
|
};
|
|
|
|
|
2015-06-08 19:09:54 +00:00
|
|
|
/*
|
|
|
|
* Mode for mapping cpus to pools.
|
|
|
|
*/
|
|
|
|
enum {
|
|
|
|
SVC_POOL_AUTO = -1, /* choose one of the others */
|
|
|
|
SVC_POOL_GLOBAL, /* no mapping, just a single global pool
|
|
|
|
* (legacy & UP mode) */
|
|
|
|
SVC_POOL_PERCPU, /* one pool per cpu */
|
|
|
|
SVC_POOL_PERNODE /* one pool per numa node */
|
|
|
|
};
|
|
|
|
|
|
|
|
struct svc_pool_map {
|
|
|
|
int count; /* How many svc_servs use us */
|
|
|
|
int mode; /* Note: int not enum to avoid
|
|
|
|
* warnings about "enumeration value
|
|
|
|
* not handled in switch" */
|
|
|
|
unsigned int npools;
|
|
|
|
unsigned int *pool_to; /* maps pool id to cpu or node */
|
|
|
|
unsigned int *to_pool; /* maps cpu or node to pool id */
|
|
|
|
};
|
|
|
|
|
|
|
|
extern struct svc_pool_map svc_pool_map;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Function prototypes.
|
|
|
|
*/
|
2012-01-31 11:08:05 +00:00
|
|
|
int svc_rpcb_setup(struct svc_serv *serv, struct net *net);
|
2012-01-13 10:03:04 +00:00
|
|
|
void svc_rpcb_cleanup(struct svc_serv *serv, struct net *net);
|
2012-05-02 12:08:38 +00:00
|
|
|
int svc_bind(struct svc_serv *serv, struct net *net);
|
2009-03-19 00:46:29 +00:00
|
|
|
struct svc_serv *svc_create(struct svc_program *, unsigned int,
|
2017-08-01 16:00:06 +00:00
|
|
|
const struct svc_serv_ops *);
|
2015-06-08 19:11:10 +00:00
|
|
|
struct svc_rqst *svc_rqst_alloc(struct svc_serv *serv,
|
|
|
|
struct svc_pool *pool, int node);
|
2008-01-29 15:30:54 +00:00
|
|
|
struct svc_rqst *svc_prepare_thread(struct svc_serv *serv,
|
2011-07-28 18:04:09 +00:00
|
|
|
struct svc_pool *pool, int node);
|
2015-06-08 19:11:10 +00:00
|
|
|
void svc_rqst_free(struct svc_rqst *);
|
2005-04-16 22:20:36 +00:00
|
|
|
void svc_exit_thread(struct svc_rqst *);
|
2015-06-08 19:09:54 +00:00
|
|
|
unsigned int svc_pool_map_get(void);
|
|
|
|
void svc_pool_map_put(void);
|
2006-10-02 09:17:59 +00:00
|
|
|
struct svc_serv * svc_create_pooled(struct svc_program *, unsigned int,
|
2017-08-01 16:00:06 +00:00
|
|
|
const struct svc_serv_ops *);
|
2006-10-02 09:17:59 +00:00
|
|
|
int svc_set_num_threads(struct svc_serv *, struct svc_pool *, int);
|
2017-04-26 15:55:27 +00:00
|
|
|
int svc_set_num_threads_sync(struct svc_serv *, struct svc_pool *, int);
|
2009-01-13 10:26:36 +00:00
|
|
|
int svc_pool_stats_open(struct svc_serv *serv, struct file *file);
|
2005-04-16 22:20:36 +00:00
|
|
|
void svc_destroy(struct svc_serv *);
|
2012-01-31 11:08:05 +00:00
|
|
|
void svc_shutdown_net(struct svc_serv *, struct net *);
|
2006-10-02 09:17:50 +00:00
|
|
|
int svc_process(struct svc_rqst *);
|
2009-04-01 13:23:07 +00:00
|
|
|
int bc_svc_process(struct svc_serv *, struct rpc_rqst *,
|
|
|
|
struct svc_rqst *);
|
2012-01-13 10:02:48 +00:00
|
|
|
int svc_register(const struct svc_serv *, struct net *, const int,
|
2009-03-19 00:46:06 +00:00
|
|
|
const unsigned short, const unsigned short);
|
2008-08-18 23:34:16 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
void svc_wake_up(struct svc_serv *);
|
|
|
|
void svc_reserve(struct svc_rqst *rqstp, int space);
|
2006-10-02 09:18:01 +00:00
|
|
|
struct svc_pool * svc_pool_for_cpu(struct svc_serv *serv, int cpu);
|
2007-02-12 08:53:32 +00:00
|
|
|
char * svc_print_addr(struct svc_rqst *, char *, size_t);
|
2020-03-02 19:45:53 +00:00
|
|
|
int svc_encode_read_payload(struct svc_rqst *rqstp,
|
|
|
|
unsigned int offset,
|
|
|
|
unsigned int length);
|
2018-03-27 14:54:07 +00:00
|
|
|
unsigned int svc_fill_write_vector(struct svc_rqst *rqstp,
|
2018-07-27 15:19:05 +00:00
|
|
|
struct page **pages,
|
2018-03-27 14:54:07 +00:00
|
|
|
struct kvec *first, size_t total);
|
2018-03-27 14:54:21 +00:00
|
|
|
char *svc_fill_symlink_pathname(struct svc_rqst *rqstp,
|
2018-07-27 15:19:10 +00:00
|
|
|
struct kvec *first, void *p,
|
|
|
|
size_t total);
|
2019-04-09 15:46:14 +00:00
|
|
|
__be32 svc_return_autherr(struct svc_rqst *rqstp, __be32 auth_err);
|
2019-04-09 15:46:15 +00:00
|
|
|
__be32 svc_generic_init_request(struct svc_rqst *rqstp,
|
|
|
|
const struct svc_program *progp,
|
|
|
|
struct svc_process_info *procinfo);
|
2019-04-09 15:46:17 +00:00
|
|
|
int svc_generic_rpcbind_set(struct net *net,
|
|
|
|
const struct svc_program *progp,
|
|
|
|
u32 version, int family,
|
|
|
|
unsigned short proto,
|
|
|
|
unsigned short port);
|
|
|
|
int svc_rpcbind_set_version(struct net *net,
|
|
|
|
const struct svc_program *progp,
|
|
|
|
u32 version, int family,
|
|
|
|
unsigned short proto,
|
|
|
|
unsigned short port);
|
2007-02-12 08:53:32 +00:00
|
|
|
|
|
|
|
#define RPC_MAX_ADDRBUFLEN (63U)
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2007-05-09 09:34:50 +00:00
|
|
|
/*
|
|
|
|
* When we want to reduce the size of the reserved space in the response
|
|
|
|
* buffer, we need to take into account the size of any checksum data that
|
|
|
|
* may be at the end of the packet. This is difficult to determine exactly
|
|
|
|
* for all cases without actually generating the checksum, so we just use a
|
|
|
|
* static value.
|
|
|
|
*/
|
2008-02-08 04:10:21 +00:00
|
|
|
static inline void svc_reserve_auth(struct svc_rqst *rqstp, int space)
|
2007-05-09 09:34:50 +00:00
|
|
|
{
|
2014-05-12 22:10:58 +00:00
|
|
|
svc_reserve(rqstp, space + rqstp->rq_auth_slack);
|
2007-05-09 09:34:50 +00:00
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif /* SUNRPC_SVC_H */
|