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
|
|
|
/*
|
2006-10-04 04:01:26 +07:00
|
|
|
* linux/include/linux/sunrpc/msg_prot.h
|
2005-04-17 05:20:36 +07:00
|
|
|
*
|
|
|
|
* Copyright (C) 1996, Olaf Kirch <okir@monad.swb.de>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _LINUX_SUNRPC_MSGPROT_H_
|
|
|
|
#define _LINUX_SUNRPC_MSGPROT_H_
|
|
|
|
|
|
|
|
#ifdef __KERNEL__ /* user programs should get these from the rpc header files */
|
|
|
|
|
|
|
|
#define RPC_VERSION 2
|
|
|
|
|
2006-10-04 16:15:47 +07:00
|
|
|
/* size of an XDR encoding unit in bytes, i.e. 32bit */
|
|
|
|
#define XDR_UNIT (4)
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/* spec defines authentication flavor as an unsigned 32 bit integer */
|
|
|
|
typedef u32 rpc_authflavor_t;
|
|
|
|
|
|
|
|
enum rpc_auth_flavors {
|
|
|
|
RPC_AUTH_NULL = 0,
|
|
|
|
RPC_AUTH_UNIX = 1,
|
|
|
|
RPC_AUTH_SHORT = 2,
|
|
|
|
RPC_AUTH_DES = 3,
|
|
|
|
RPC_AUTH_KRB = 4,
|
|
|
|
RPC_AUTH_GSS = 6,
|
|
|
|
RPC_AUTH_MAXFLAVOR = 8,
|
|
|
|
/* pseudoflavors: */
|
|
|
|
RPC_AUTH_GSS_KRB5 = 390003,
|
|
|
|
RPC_AUTH_GSS_KRB5I = 390004,
|
|
|
|
RPC_AUTH_GSS_KRB5P = 390005,
|
|
|
|
RPC_AUTH_GSS_LKEY = 390006,
|
|
|
|
RPC_AUTH_GSS_LKEYI = 390007,
|
|
|
|
RPC_AUTH_GSS_LKEYP = 390008,
|
|
|
|
RPC_AUTH_GSS_SPKM = 390009,
|
|
|
|
RPC_AUTH_GSS_SPKMI = 390010,
|
|
|
|
RPC_AUTH_GSS_SPKMP = 390011,
|
|
|
|
};
|
|
|
|
|
2006-10-04 16:15:47 +07:00
|
|
|
/* Maximum size (in bytes) of an rpc credential or verifier */
|
|
|
|
#define RPC_MAX_AUTH_SIZE (400)
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
enum rpc_msg_type {
|
|
|
|
RPC_CALL = 0,
|
|
|
|
RPC_REPLY = 1
|
|
|
|
};
|
|
|
|
|
|
|
|
enum rpc_reply_stat {
|
|
|
|
RPC_MSG_ACCEPTED = 0,
|
|
|
|
RPC_MSG_DENIED = 1
|
|
|
|
};
|
|
|
|
|
|
|
|
enum rpc_accept_stat {
|
|
|
|
RPC_SUCCESS = 0,
|
|
|
|
RPC_PROG_UNAVAIL = 1,
|
|
|
|
RPC_PROG_MISMATCH = 2,
|
|
|
|
RPC_PROC_UNAVAIL = 3,
|
|
|
|
RPC_GARBAGE_ARGS = 4,
|
2006-10-17 14:10:18 +07:00
|
|
|
RPC_SYSTEM_ERR = 5,
|
|
|
|
/* internal use only */
|
|
|
|
RPC_DROP_REPLY = 60000,
|
2005-04-17 05:20:36 +07:00
|
|
|
};
|
|
|
|
|
|
|
|
enum rpc_reject_stat {
|
|
|
|
RPC_MISMATCH = 0,
|
|
|
|
RPC_AUTH_ERROR = 1
|
|
|
|
};
|
|
|
|
|
|
|
|
enum rpc_auth_stat {
|
|
|
|
RPC_AUTH_OK = 0,
|
|
|
|
RPC_AUTH_BADCRED = 1,
|
|
|
|
RPC_AUTH_REJECTEDCRED = 2,
|
|
|
|
RPC_AUTH_BADVERF = 3,
|
|
|
|
RPC_AUTH_REJECTEDVERF = 4,
|
|
|
|
RPC_AUTH_TOOWEAK = 5,
|
|
|
|
/* RPCSEC_GSS errors */
|
|
|
|
RPCSEC_GSS_CREDPROBLEM = 13,
|
|
|
|
RPCSEC_GSS_CTXPROBLEM = 14
|
|
|
|
};
|
|
|
|
|
|
|
|
#define RPC_MAXNETNAMELEN 256
|
|
|
|
|
2005-08-26 06:25:49 +07:00
|
|
|
/*
|
|
|
|
* From RFC 1831:
|
|
|
|
*
|
|
|
|
* "A record is composed of one or more record fragments. A record
|
|
|
|
* fragment is a four-byte header followed by 0 to (2**31) - 1 bytes of
|
|
|
|
* fragment data. The bytes encode an unsigned binary number; as with
|
|
|
|
* XDR integers, the byte order is from highest to lowest. The number
|
|
|
|
* encodes two values -- a boolean which indicates whether the fragment
|
|
|
|
* is the last fragment of the record (bit value 1 implies the fragment
|
|
|
|
* is the last fragment) and a 31-bit unsigned binary value which is the
|
|
|
|
* length in bytes of the fragment's data. The boolean value is the
|
|
|
|
* highest-order bit of the header; the length is the 31 low-order bits.
|
|
|
|
* (Note that this record specification is NOT in XDR standard form!)"
|
|
|
|
*
|
|
|
|
* The Linux RPC client always sends its requests in a single record
|
|
|
|
* fragment, limiting the maximum payload size for stream transports to
|
|
|
|
* 2GB.
|
|
|
|
*/
|
|
|
|
|
2006-09-27 12:29:38 +07:00
|
|
|
typedef __be32 rpc_fraghdr;
|
2005-08-26 06:25:49 +07:00
|
|
|
|
|
|
|
#define RPC_LAST_STREAM_FRAGMENT (1U << 31)
|
|
|
|
#define RPC_FRAGMENT_SIZE_MASK (~RPC_LAST_STREAM_FRAGMENT)
|
|
|
|
#define RPC_MAX_FRAGMENT_SIZE ((1U << 31) - 1)
|
|
|
|
|
2006-10-04 16:15:47 +07:00
|
|
|
/*
|
|
|
|
* RPC call and reply header size as number of 32bit words (verifier
|
|
|
|
* size computed separately, see below)
|
|
|
|
*/
|
|
|
|
#define RPC_CALLHDRSIZE (6)
|
|
|
|
#define RPC_REPHDRSIZE (4)
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Maximum RPC header size, including authentication,
|
|
|
|
* as number of 32bit words (see RFCs 1831, 1832).
|
|
|
|
*
|
|
|
|
* xid 1 xdr unit = 4 bytes
|
|
|
|
* mtype 1
|
|
|
|
* rpc_version 1
|
|
|
|
* program 1
|
|
|
|
* prog_version 1
|
|
|
|
* procedure 1
|
|
|
|
* cred {
|
|
|
|
* flavor 1
|
|
|
|
* length 1
|
|
|
|
* body<RPC_MAX_AUTH_SIZE> 100 xdr units = 400 bytes
|
|
|
|
* }
|
|
|
|
* verf {
|
|
|
|
* flavor 1
|
|
|
|
* length 1
|
|
|
|
* body<RPC_MAX_AUTH_SIZE> 100 xdr units = 400 bytes
|
|
|
|
* }
|
|
|
|
* TOTAL 210 xdr units = 840 bytes
|
|
|
|
*/
|
|
|
|
#define RPC_MAX_HEADER_WITH_AUTH \
|
|
|
|
(RPC_CALLHDRSIZE + 2*(2+RPC_MAX_AUTH_SIZE/4))
|
|
|
|
|
2013-04-09 22:34:36 +07:00
|
|
|
#define RPC_MAX_REPHEADER_WITH_AUTH \
|
|
|
|
(RPC_REPHDRSIZE + (2 + RPC_MAX_AUTH_SIZE/4))
|
|
|
|
|
2007-09-11 00:42:38 +07:00
|
|
|
/*
|
2015-03-31 01:33:33 +07:00
|
|
|
* Well-known netids. See:
|
|
|
|
*
|
|
|
|
* http://www.iana.org/assignments/rpc-netids/rpc-netids.xhtml
|
2007-09-11 00:42:38 +07:00
|
|
|
*/
|
|
|
|
#define RPCBIND_NETID_UDP "udp"
|
|
|
|
#define RPCBIND_NETID_TCP "tcp"
|
2015-03-31 01:33:33 +07:00
|
|
|
#define RPCBIND_NETID_RDMA "rdma"
|
|
|
|
#define RPCBIND_NETID_SCTP "sctp"
|
2007-09-11 00:42:38 +07:00
|
|
|
#define RPCBIND_NETID_UDP6 "udp6"
|
|
|
|
#define RPCBIND_NETID_TCP6 "tcp6"
|
2015-03-31 01:33:33 +07:00
|
|
|
#define RPCBIND_NETID_RDMA6 "rdma6"
|
|
|
|
#define RPCBIND_NETID_SCTP6 "sctp6"
|
2011-05-10 02:22:44 +07:00
|
|
|
#define RPCBIND_NETID_LOCAL "local"
|
2007-09-11 00:42:38 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Note that RFC 1833 does not put any size restrictions on the
|
2016-05-03 01:40:31 +07:00
|
|
|
* netid string, but all currently defined netid's fit in 5 bytes.
|
2007-09-11 00:42:38 +07:00
|
|
|
*/
|
2016-05-03 01:40:31 +07:00
|
|
|
#define RPCBIND_MAXNETIDLEN (5u)
|
2006-10-04 16:15:47 +07:00
|
|
|
|
2007-12-11 02:56:46 +07:00
|
|
|
/*
|
|
|
|
* Universal addresses are introduced in RFC 1833 and further spelled
|
|
|
|
* out in RFC 3530. RPCBIND_MAXUADDRLEN defines a maximum byte length
|
|
|
|
* of a universal address for use in allocating buffers and character
|
|
|
|
* arrays.
|
|
|
|
*
|
|
|
|
* Quoting RFC 3530, section 2.2:
|
|
|
|
*
|
|
|
|
* For TCP over IPv4 and for UDP over IPv4, the format of r_addr is the
|
|
|
|
* US-ASCII string:
|
|
|
|
*
|
|
|
|
* h1.h2.h3.h4.p1.p2
|
|
|
|
*
|
|
|
|
* The prefix, "h1.h2.h3.h4", is the standard textual form for
|
|
|
|
* representing an IPv4 address, which is always four octets long.
|
|
|
|
* Assuming big-endian ordering, h1, h2, h3, and h4, are respectively,
|
|
|
|
* the first through fourth octets each converted to ASCII-decimal.
|
|
|
|
* Assuming big-endian ordering, p1 and p2 are, respectively, the first
|
|
|
|
* and second octets each converted to ASCII-decimal. For example, if a
|
|
|
|
* host, in big-endian order, has an address of 0x0A010307 and there is
|
|
|
|
* a service listening on, in big endian order, port 0x020F (decimal
|
|
|
|
* 527), then the complete universal address is "10.1.3.7.2.15".
|
|
|
|
*
|
|
|
|
* ...
|
|
|
|
*
|
|
|
|
* For TCP over IPv6 and for UDP over IPv6, the format of r_addr is the
|
|
|
|
* US-ASCII string:
|
|
|
|
*
|
|
|
|
* x1:x2:x3:x4:x5:x6:x7:x8.p1.p2
|
|
|
|
*
|
|
|
|
* The suffix "p1.p2" is the service port, and is computed the same way
|
|
|
|
* as with universal addresses for TCP and UDP over IPv4. The prefix,
|
|
|
|
* "x1:x2:x3:x4:x5:x6:x7:x8", is the standard textual form for
|
|
|
|
* representing an IPv6 address as defined in Section 2.2 of [RFC2373].
|
|
|
|
* Additionally, the two alternative forms specified in Section 2.2 of
|
|
|
|
* [RFC2373] are also acceptable.
|
|
|
|
*/
|
2009-08-10 02:09:32 +07:00
|
|
|
|
|
|
|
#include <linux/inet.h>
|
|
|
|
|
|
|
|
/* Maximum size of the port number part of a universal address */
|
|
|
|
#define RPCBIND_MAXUADDRPLEN sizeof(".255.255")
|
|
|
|
|
|
|
|
/* Maximum size of an IPv4 universal address */
|
|
|
|
#define RPCBIND_MAXUADDR4LEN \
|
|
|
|
(INET_ADDRSTRLEN + RPCBIND_MAXUADDRPLEN)
|
|
|
|
|
|
|
|
/* Maximum size of an IPv6 universal address */
|
|
|
|
#define RPCBIND_MAXUADDR6LEN \
|
|
|
|
(INET6_ADDRSTRLEN + RPCBIND_MAXUADDRPLEN)
|
|
|
|
|
|
|
|
/* Assume INET6_ADDRSTRLEN will always be larger than INET_ADDRSTRLEN... */
|
|
|
|
#define RPCBIND_MAXUADDRLEN RPCBIND_MAXUADDR6LEN
|
2007-12-11 02:56:46 +07:00
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
#endif /* __KERNEL__ */
|
|
|
|
#endif /* _LINUX_SUNRPC_MSGPROT_H_ */
|