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 17:07:57 +03:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2011-11-24 04:26:23 +04:00
|
|
|
#include <linux/mount.h>
|
2011-12-06 21:21:54 +04:00
|
|
|
#include <linux/seq_file.h>
|
|
|
|
#include <linux/poll.h>
|
2014-11-01 05:56:04 +03:00
|
|
|
#include <linux/ns_common.h>
|
2015-01-11 03:01:08 +03:00
|
|
|
#include <linux/fs_pin.h>
|
2011-12-06 21:21:54 +04:00
|
|
|
|
|
|
|
struct mnt_namespace {
|
2014-11-01 05:56:04 +03:00
|
|
|
struct ns_common ns;
|
2011-12-06 22:32:36 +04:00
|
|
|
struct mount * root;
|
2020-05-14 17:44:24 +03:00
|
|
|
/*
|
|
|
|
* Traversal and modification of .list is protected by either
|
|
|
|
* - taking namespace_sem for write, OR
|
|
|
|
* - taking namespace_sem for read AND taking .ns_lock.
|
|
|
|
*/
|
2011-12-06 21:21:54 +04:00
|
|
|
struct list_head list;
|
2020-05-14 17:44:24 +03:00
|
|
|
spinlock_t ns_lock;
|
2012-07-27 08:08:32 +04:00
|
|
|
struct user_namespace *user_ns;
|
2016-08-08 22:37:37 +03:00
|
|
|
struct ucounts *ucounts;
|
2010-03-08 05:49:36 +03:00
|
|
|
u64 seq; /* Sequence number to prevent loops */
|
2011-12-06 21:21:54 +04:00
|
|
|
wait_queue_head_t poll;
|
2014-02-27 23:40:10 +04:00
|
|
|
u64 event;
|
2016-09-28 08:27:17 +03:00
|
|
|
unsigned int mounts; /* # of mounts in the namespace */
|
|
|
|
unsigned int pending_mounts;
|
2016-10-28 11:22:25 +03:00
|
|
|
} __randomize_layout;
|
2011-11-24 04:26:23 +04:00
|
|
|
|
2011-11-25 07:53:09 +04:00
|
|
|
struct mnt_pcp {
|
|
|
|
int mnt_count;
|
|
|
|
int mnt_writers;
|
|
|
|
};
|
|
|
|
|
2013-03-15 18:53:28 +04:00
|
|
|
struct mountpoint {
|
2014-02-28 22:46:44 +04:00
|
|
|
struct hlist_node m_hash;
|
2013-03-15 18:53:28 +04:00
|
|
|
struct dentry *m_dentry;
|
2013-09-23 06:37:01 +04:00
|
|
|
struct hlist_head m_list;
|
2013-03-15 18:53:28 +04:00
|
|
|
int m_count;
|
|
|
|
};
|
|
|
|
|
2011-11-23 21:14:10 +04:00
|
|
|
struct mount {
|
2014-03-21 05:10:51 +04:00
|
|
|
struct hlist_node mnt_hash;
|
2011-11-25 07:19:58 +04:00
|
|
|
struct mount *mnt_parent;
|
2011-11-25 07:25:07 +04:00
|
|
|
struct dentry *mnt_mountpoint;
|
2011-11-23 21:14:10 +04:00
|
|
|
struct vfsmount mnt;
|
2014-08-08 21:08:20 +04:00
|
|
|
union {
|
|
|
|
struct rcu_head mnt_rcu;
|
|
|
|
struct llist_node mnt_llist;
|
|
|
|
};
|
2011-11-25 07:53:09 +04:00
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
struct mnt_pcp __percpu *mnt_pcp;
|
|
|
|
#else
|
|
|
|
int mnt_count;
|
|
|
|
int mnt_writers;
|
|
|
|
#endif
|
2011-11-25 08:24:33 +04:00
|
|
|
struct list_head mnt_mounts; /* list of children, anchored here */
|
|
|
|
struct list_head mnt_child; /* and going through their mnt_child */
|
2011-11-21 15:11:30 +04:00
|
|
|
struct list_head mnt_instance; /* mount instance on sb->s_mounts */
|
2011-11-25 11:25:17 +04:00
|
|
|
const char *mnt_devname; /* Name of device e.g. /dev/dsk/hda1 */
|
2011-11-25 11:19:55 +04:00
|
|
|
struct list_head mnt_list;
|
2011-11-25 09:22:05 +04:00
|
|
|
struct list_head mnt_expire; /* link in fs-specific expiry list */
|
|
|
|
struct list_head mnt_share; /* circular list of shared mounts */
|
|
|
|
struct list_head mnt_slave_list;/* list of slave mounts */
|
|
|
|
struct list_head mnt_slave; /* slave list entry */
|
2011-11-25 09:10:28 +04:00
|
|
|
struct mount *mnt_master; /* slave is on master->mnt_slave_list */
|
2011-11-25 09:46:35 +04:00
|
|
|
struct mnt_namespace *mnt_ns; /* containing namespace */
|
2013-03-15 18:53:28 +04:00
|
|
|
struct mountpoint *mnt_mp; /* where is it mounted */
|
2019-07-04 23:57:51 +03:00
|
|
|
union {
|
|
|
|
struct hlist_node mnt_mp_list; /* list mounts with the same mountpoint */
|
|
|
|
struct hlist_node mnt_umount;
|
|
|
|
};
|
2016-10-25 00:16:13 +03:00
|
|
|
struct list_head mnt_umounting; /* list entry for umount propagation */
|
2011-11-25 11:35:16 +04:00
|
|
|
#ifdef CONFIG_FSNOTIFY
|
2017-02-01 11:21:58 +03:00
|
|
|
struct fsnotify_mark_connector __rcu *mnt_fsnotify_marks;
|
2011-11-25 11:35:16 +04:00
|
|
|
__u32 mnt_fsnotify_mask;
|
|
|
|
#endif
|
2011-11-25 09:50:41 +04:00
|
|
|
int mnt_id; /* mount identifier */
|
|
|
|
int mnt_group_id; /* peer group identifier */
|
2011-11-25 09:57:42 +04:00
|
|
|
int mnt_expiry_mark; /* true if marked for expiry */
|
2014-08-07 14:23:41 +04:00
|
|
|
struct hlist_head mnt_pins;
|
2019-07-04 23:57:51 +03:00
|
|
|
struct hlist_head mnt_stuck_children;
|
2016-10-28 11:22:25 +03:00
|
|
|
} __randomize_layout;
|
2011-11-23 21:14:10 +04:00
|
|
|
|
2012-06-09 08:59:08 +04:00
|
|
|
#define MNT_NS_INTERNAL ERR_PTR(-EINVAL) /* distinct from any mnt_namespace */
|
|
|
|
|
2011-11-23 21:14:10 +04:00
|
|
|
static inline struct mount *real_mount(struct vfsmount *mnt)
|
|
|
|
{
|
|
|
|
return container_of(mnt, struct mount, mnt);
|
|
|
|
}
|
|
|
|
|
2011-11-25 06:47:05 +04:00
|
|
|
static inline int mnt_has_parent(struct mount *mnt)
|
2011-11-24 04:26:23 +04:00
|
|
|
{
|
2011-11-25 07:19:58 +04:00
|
|
|
return mnt != mnt->mnt_parent;
|
2011-11-24 04:26:23 +04:00
|
|
|
}
|
2011-11-25 03:22:03 +04:00
|
|
|
|
2012-06-09 08:59:08 +04:00
|
|
|
static inline int is_mounted(struct vfsmount *mnt)
|
|
|
|
{
|
|
|
|
/* neither detached nor internal? */
|
2014-01-21 03:26:15 +04:00
|
|
|
return !IS_ERR_OR_NULL(real_mount(mnt)->mnt_ns);
|
2012-06-09 08:59:08 +04:00
|
|
|
}
|
|
|
|
|
2013-10-02 00:11:26 +04:00
|
|
|
extern struct mount *__lookup_mnt(struct vfsmount *, struct dentry *);
|
2011-12-06 21:21:54 +04:00
|
|
|
|
2015-05-08 18:43:53 +03:00
|
|
|
extern int __legitimize_mnt(struct vfsmount *, unsigned);
|
2013-09-30 06:06:07 +04:00
|
|
|
|
2016-11-24 00:03:41 +03:00
|
|
|
static inline bool __path_is_mountpoint(const struct path *path)
|
|
|
|
{
|
|
|
|
struct mount *m = __lookup_mnt(path->mnt, path->dentry);
|
|
|
|
return m && likely(!(m->mnt.mnt_flags & MNT_SYNC_UMOUNT));
|
|
|
|
}
|
|
|
|
|
2013-10-03 12:31:18 +04:00
|
|
|
extern void __detach_mounts(struct dentry *dentry);
|
|
|
|
|
|
|
|
static inline void detach_mounts(struct dentry *dentry)
|
|
|
|
{
|
|
|
|
if (!d_mountpoint(dentry))
|
|
|
|
return;
|
|
|
|
__detach_mounts(dentry);
|
|
|
|
}
|
|
|
|
|
2011-12-06 21:21:54 +04:00
|
|
|
static inline void get_mnt_ns(struct mnt_namespace *ns)
|
|
|
|
{
|
2020-08-03 13:16:42 +03:00
|
|
|
refcount_inc(&ns->ns.count);
|
2011-12-06 21:21:54 +04:00
|
|
|
}
|
|
|
|
|
2013-09-30 06:06:07 +04:00
|
|
|
extern seqlock_t mount_lock;
|
2013-09-29 19:24:49 +04:00
|
|
|
|
2011-12-06 21:21:54 +04:00
|
|
|
struct proc_mounts {
|
|
|
|
struct mnt_namespace *ns;
|
|
|
|
struct path root;
|
|
|
|
int (*show)(struct seq_file *, struct vfsmount *);
|
2020-05-14 17:44:24 +03:00
|
|
|
struct mount cursor;
|
2011-12-06 21:21:54 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
extern const struct seq_operations mounts_op;
|
2013-10-05 06:15:13 +04:00
|
|
|
|
|
|
|
extern bool __is_local_mountpoint(struct dentry *dentry);
|
|
|
|
static inline bool is_local_mountpoint(struct dentry *dentry)
|
|
|
|
{
|
|
|
|
if (!d_mountpoint(dentry))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return __is_local_mountpoint(dentry);
|
|
|
|
}
|
2019-01-30 21:30:21 +03:00
|
|
|
|
|
|
|
static inline bool is_anon_ns(struct mnt_namespace *ns)
|
|
|
|
{
|
|
|
|
return ns->seq == 0;
|
|
|
|
}
|
2020-05-14 17:44:24 +03:00
|
|
|
|
|
|
|
extern void mnt_cursor_del(struct mnt_namespace *ns, struct mount *cursor);
|