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 15:07:57 +01:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2005-04-17 00:20:36 +02:00
|
|
|
#ifndef __LINUX_NET_AFUNIX_H
|
|
|
|
|
#define __LINUX_NET_AFUNIX_H
|
2005-08-16 07:18:02 +02:00
|
|
|
|
|
|
|
|
#include <linux/socket.h>
|
|
|
|
|
#include <linux/un.h>
|
2006-03-21 07:35:41 +01:00
|
|
|
#include <linux/mutex.h>
|
2017-06-30 12:08:05 +02:00
|
|
|
#include <linux/refcount.h>
|
2005-08-16 07:18:02 +02:00
|
|
|
#include <net/sock.h>
|
|
|
|
|
|
2016-02-03 02:11:03 +01:00
|
|
|
void unix_inflight(struct user_struct *user, struct file *fp);
|
|
|
|
|
void unix_notinflight(struct user_struct *user, struct file *fp);
|
2019-02-08 17:01:44 +01:00
|
|
|
void unix_destruct_scm(struct sk_buff *skb);
|
2013-08-01 02:31:33 +02:00
|
|
|
void unix_gc(void);
|
|
|
|
|
void wait_for_unix_gc(void);
|
|
|
|
|
struct sock *unix_get_socket(struct file *filp);
|
2018-10-30 04:42:09 +01:00
|
|
|
struct sock *unix_peer_get(struct sock *sk);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
|
#define UNIX_HASH_SIZE 256
|
2012-06-08 07:03:21 +02:00
|
|
|
#define UNIX_HASH_BITS 8
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-11-11 07:06:01 +01:00
|
|
|
extern unsigned int unix_tot_inflight;
|
2011-12-15 03:44:03 +01:00
|
|
|
extern spinlock_t unix_table_lock;
|
2012-06-08 07:03:21 +02:00
|
|
|
extern struct hlist_head unix_socket_table[2 * UNIX_HASH_SIZE];
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
|
struct unix_address {
|
2017-06-30 12:08:05 +02:00
|
|
|
refcount_t refcnt;
|
2005-04-17 00:20:36 +02:00
|
|
|
int len;
|
2012-04-15 07:58:06 +02:00
|
|
|
unsigned int hash;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct sockaddr_un name[0];
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct unix_skb_parms {
|
2010-06-13 05:34:33 +02:00
|
|
|
struct pid *pid; /* Skb credentials */
|
2013-04-03 19:28:16 +02:00
|
|
|
kuid_t uid;
|
|
|
|
|
kgid_t gid;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct scm_fp_list *fp; /* Passed files */
|
[AF_UNIX]: Datagram getpeersec
This patch implements an API whereby an application can determine the
label of its peer's Unix datagram sockets via the auxiliary data mechanism of
recvmsg.
Patch purpose:
This patch enables a security-aware application to retrieve the
security context of the peer of a Unix datagram socket. The application
can then use this security context to determine the security context for
processing on behalf of the peer who sent the packet.
Patch design and implementation:
The design and implementation is very similar to the UDP case for INET
sockets. Basically we build upon the existing Unix domain socket API for
retrieving user credentials. Linux offers the API for obtaining user
credentials via ancillary messages (i.e., out of band/control messages
that are bundled together with a normal message). To retrieve the security
context, the application first indicates to the kernel such desire by
setting the SO_PASSSEC option via getsockopt. Then the application
retrieves the security context using the auxiliary data mechanism.
An example server application for Unix datagram socket should look like this:
toggle = 1;
toggle_len = sizeof(toggle);
setsockopt(sockfd, SOL_SOCKET, SO_PASSSEC, &toggle, &toggle_len);
recvmsg(sockfd, &msg_hdr, 0);
if (msg_hdr.msg_controllen > sizeof(struct cmsghdr)) {
cmsg_hdr = CMSG_FIRSTHDR(&msg_hdr);
if (cmsg_hdr->cmsg_len <= CMSG_LEN(sizeof(scontext)) &&
cmsg_hdr->cmsg_level == SOL_SOCKET &&
cmsg_hdr->cmsg_type == SCM_SECURITY) {
memcpy(&scontext, CMSG_DATA(cmsg_hdr), sizeof(scontext));
}
}
sock_setsockopt is enhanced with a new socket option SOCK_PASSSEC to allow
a server socket to receive security context of the peer.
Testing:
We have tested the patch by setting up Unix datagram client and server
applications. We verified that the server can retrieve the security context
using the auxiliary data mechanism of recvmsg.
Signed-off-by: Catherine Zhang <cxzhang@watson.ibm.com>
Acked-by: Acked-by: James Morris <jmorris@namei.org>
Signed-off-by: David S. Miller <davem@davemloft.net>
2006-06-29 21:27:47 +02:00
|
|
|
#ifdef CONFIG_SECURITY_NETWORK
|
2006-08-02 23:12:06 +02:00
|
|
|
u32 secid; /* Security ID */
|
[AF_UNIX]: Datagram getpeersec
This patch implements an API whereby an application can determine the
label of its peer's Unix datagram sockets via the auxiliary data mechanism of
recvmsg.
Patch purpose:
This patch enables a security-aware application to retrieve the
security context of the peer of a Unix datagram socket. The application
can then use this security context to determine the security context for
processing on behalf of the peer who sent the packet.
Patch design and implementation:
The design and implementation is very similar to the UDP case for INET
sockets. Basically we build upon the existing Unix domain socket API for
retrieving user credentials. Linux offers the API for obtaining user
credentials via ancillary messages (i.e., out of band/control messages
that are bundled together with a normal message). To retrieve the security
context, the application first indicates to the kernel such desire by
setting the SO_PASSSEC option via getsockopt. Then the application
retrieves the security context using the auxiliary data mechanism.
An example server application for Unix datagram socket should look like this:
toggle = 1;
toggle_len = sizeof(toggle);
setsockopt(sockfd, SOL_SOCKET, SO_PASSSEC, &toggle, &toggle_len);
recvmsg(sockfd, &msg_hdr, 0);
if (msg_hdr.msg_controllen > sizeof(struct cmsghdr)) {
cmsg_hdr = CMSG_FIRSTHDR(&msg_hdr);
if (cmsg_hdr->cmsg_len <= CMSG_LEN(sizeof(scontext)) &&
cmsg_hdr->cmsg_level == SOL_SOCKET &&
cmsg_hdr->cmsg_type == SCM_SECURITY) {
memcpy(&scontext, CMSG_DATA(cmsg_hdr), sizeof(scontext));
}
}
sock_setsockopt is enhanced with a new socket option SOCK_PASSSEC to allow
a server socket to receive security context of the peer.
Testing:
We have tested the patch by setting up Unix datagram client and server
applications. We verified that the server can retrieve the security context
using the auxiliary data mechanism of recvmsg.
Signed-off-by: Catherine Zhang <cxzhang@watson.ibm.com>
Acked-by: Acked-by: James Morris <jmorris@namei.org>
Signed-off-by: David S. Miller <davem@davemloft.net>
2006-06-29 21:27:47 +02:00
|
|
|
#endif
|
2013-08-08 23:37:32 +02:00
|
|
|
u32 consumed;
|
2016-10-28 10:22:25 +02:00
|
|
|
} __randomize_layout;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2018-10-30 04:42:10 +01:00
|
|
|
#define UNIXCB(skb) (*(struct unix_skb_parms *)&((skb)->cb))
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-05-31 22:24:26 +02:00
|
|
|
#define unix_state_lock(s) spin_lock(&unix_sk(s)->lock)
|
|
|
|
|
#define unix_state_unlock(s) spin_unlock(&unix_sk(s)->lock)
|
|
|
|
|
#define unix_state_lock_nested(s) \
|
2006-07-03 09:25:12 +02:00
|
|
|
spin_lock_nested(&unix_sk(s)->lock, \
|
|
|
|
|
SINGLE_DEPTH_NESTING)
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
|
/* The AF_UNIX socket */
|
|
|
|
|
struct unix_sock {
|
|
|
|
|
/* WARNING: sk has to be the first member */
|
|
|
|
|
struct sock sk;
|
2018-10-21 13:33:03 +02:00
|
|
|
struct unix_address *addr;
|
2012-03-15 02:54:32 +01:00
|
|
|
struct path path;
|
2016-09-01 23:43:53 +02:00
|
|
|
struct mutex iolock, bindlock;
|
2010-04-29 13:01:49 +02:00
|
|
|
struct sock *peer;
|
2007-07-11 23:22:39 +02:00
|
|
|
struct list_head link;
|
2010-04-29 13:01:49 +02:00
|
|
|
atomic_long_t inflight;
|
|
|
|
|
spinlock_t lock;
|
2013-05-01 07:24:03 +02:00
|
|
|
unsigned long gc_flags;
|
|
|
|
|
#define UNIX_GC_CANDIDATE 0
|
|
|
|
|
#define UNIX_GC_MAYBE_CYCLE 1
|
2010-04-29 13:01:49 +02:00
|
|
|
struct socket_wq peer_wq;
|
2018-10-21 13:33:03 +02:00
|
|
|
wait_queue_entry_t peer_wake;
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
2015-09-27 00:50:42 +02:00
|
|
|
|
2015-10-06 21:03:53 +02:00
|
|
|
static inline struct unix_sock *unix_sk(const struct sock *sk)
|
2015-09-27 00:50:42 +02:00
|
|
|
{
|
|
|
|
|
return (struct unix_sock *)sk;
|
|
|
|
|
}
|
2005-08-16 07:18:02 +02:00
|
|
|
|
2010-04-29 13:01:49 +02:00
|
|
|
#define peer_wait peer_wq.wait
|
|
|
|
|
|
2011-12-30 01:54:11 +01:00
|
|
|
long unix_inq_len(struct sock *sk);
|
|
|
|
|
long unix_outq_len(struct sock *sk);
|
|
|
|
|
|
2005-08-16 07:18:02 +02:00
|
|
|
#ifdef CONFIG_SYSCTL
|
2013-08-01 02:31:33 +02:00
|
|
|
int unix_sysctl_register(struct net *net);
|
|
|
|
|
void unix_sysctl_unregister(struct net *net);
|
2005-08-16 07:18:02 +02:00
|
|
|
#else
|
2007-12-01 13:40:40 +01:00
|
|
|
static inline int unix_sysctl_register(struct net *net) { return 0; }
|
|
|
|
|
static inline void unix_sysctl_unregister(struct net *net) {}
|
2005-08-16 07:18:02 +02:00
|
|
|
#endif
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|