mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-08-27 11:19:37 +00:00
![Greg Kroah-Hartman](/assets/img/avatar_default.png)
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>
152 lines
3.8 KiB
C
152 lines
3.8 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _FS_CEPH_MON_CLIENT_H
|
|
#define _FS_CEPH_MON_CLIENT_H
|
|
|
|
#include <linux/completion.h>
|
|
#include <linux/kref.h>
|
|
#include <linux/rbtree.h>
|
|
|
|
#include <linux/ceph/messenger.h>
|
|
|
|
struct ceph_client;
|
|
struct ceph_mount_args;
|
|
struct ceph_auth_client;
|
|
|
|
/*
|
|
* The monitor map enumerates the set of all monitors.
|
|
*/
|
|
struct ceph_monmap {
|
|
struct ceph_fsid fsid;
|
|
u32 epoch;
|
|
u32 num_mon;
|
|
struct ceph_entity_inst mon_inst[0];
|
|
};
|
|
|
|
struct ceph_mon_client;
|
|
struct ceph_mon_generic_request;
|
|
|
|
|
|
/*
|
|
* Generic mechanism for resending monitor requests.
|
|
*/
|
|
typedef void (*ceph_monc_request_func_t)(struct ceph_mon_client *monc,
|
|
int newmon);
|
|
|
|
/* a pending monitor request */
|
|
struct ceph_mon_request {
|
|
struct ceph_mon_client *monc;
|
|
struct delayed_work delayed_work;
|
|
unsigned long delay;
|
|
ceph_monc_request_func_t do_request;
|
|
};
|
|
|
|
typedef void (*ceph_monc_callback_t)(struct ceph_mon_generic_request *);
|
|
|
|
/*
|
|
* ceph_mon_generic_request is being used for the statfs and
|
|
* mon_get_version requests which are being done a bit differently
|
|
* because we need to get data back to the caller
|
|
*/
|
|
struct ceph_mon_generic_request {
|
|
struct ceph_mon_client *monc;
|
|
struct kref kref;
|
|
u64 tid;
|
|
struct rb_node node;
|
|
int result;
|
|
|
|
struct completion completion;
|
|
ceph_monc_callback_t complete_cb;
|
|
u64 private_data; /* r_tid/linger_id */
|
|
|
|
struct ceph_msg *request; /* original request */
|
|
struct ceph_msg *reply; /* and reply */
|
|
|
|
union {
|
|
struct ceph_statfs *st;
|
|
u64 newest;
|
|
} u;
|
|
};
|
|
|
|
struct ceph_mon_client {
|
|
struct ceph_client *client;
|
|
struct ceph_monmap *monmap;
|
|
|
|
struct mutex mutex;
|
|
struct delayed_work delayed_work;
|
|
|
|
struct ceph_auth_client *auth;
|
|
struct ceph_msg *m_auth, *m_auth_reply, *m_subscribe, *m_subscribe_ack;
|
|
int pending_auth;
|
|
|
|
bool hunting;
|
|
int cur_mon; /* last monitor i contacted */
|
|
unsigned long sub_renew_after;
|
|
unsigned long sub_renew_sent;
|
|
struct ceph_connection con;
|
|
|
|
bool had_a_connection;
|
|
int hunt_mult; /* [1..CEPH_MONC_HUNT_MAX_MULT] */
|
|
|
|
/* pending generic requests */
|
|
struct rb_root generic_request_tree;
|
|
u64 last_tid;
|
|
|
|
/* subs, indexed with CEPH_SUB_* */
|
|
struct {
|
|
struct ceph_mon_subscribe_item item;
|
|
bool want;
|
|
u32 have; /* epoch */
|
|
} subs[4];
|
|
int fs_cluster_id; /* "mdsmap.<id>" sub */
|
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
struct dentry *debugfs_file;
|
|
#endif
|
|
};
|
|
|
|
extern struct ceph_monmap *ceph_monmap_decode(void *p, void *end);
|
|
extern int ceph_monmap_contains(struct ceph_monmap *m,
|
|
struct ceph_entity_addr *addr);
|
|
|
|
extern int ceph_monc_init(struct ceph_mon_client *monc, struct ceph_client *cl);
|
|
extern void ceph_monc_stop(struct ceph_mon_client *monc);
|
|
|
|
enum {
|
|
CEPH_SUB_MONMAP = 0,
|
|
CEPH_SUB_OSDMAP,
|
|
CEPH_SUB_FSMAP,
|
|
CEPH_SUB_MDSMAP,
|
|
};
|
|
|
|
extern const char *ceph_sub_str[];
|
|
|
|
/*
|
|
* The model here is to indicate that we need a new map of at least
|
|
* epoch @epoch, and also call in when we receive a map. We will
|
|
* periodically rerequest the map from the monitor cluster until we
|
|
* get what we want.
|
|
*/
|
|
bool ceph_monc_want_map(struct ceph_mon_client *monc, int sub, u32 epoch,
|
|
bool continuous);
|
|
void ceph_monc_got_map(struct ceph_mon_client *monc, int sub, u32 epoch);
|
|
void ceph_monc_renew_subs(struct ceph_mon_client *monc);
|
|
|
|
extern int ceph_monc_wait_osdmap(struct ceph_mon_client *monc, u32 epoch,
|
|
unsigned long timeout);
|
|
|
|
int ceph_monc_do_statfs(struct ceph_mon_client *monc, u64 data_pool,
|
|
struct ceph_statfs *buf);
|
|
|
|
int ceph_monc_get_version(struct ceph_mon_client *monc, const char *what,
|
|
u64 *newest);
|
|
int ceph_monc_get_version_async(struct ceph_mon_client *monc, const char *what,
|
|
ceph_monc_callback_t cb, u64 private_data);
|
|
|
|
int ceph_monc_blacklist_add(struct ceph_mon_client *monc,
|
|
struct ceph_entity_addr *client_addr);
|
|
|
|
extern int ceph_monc_open_session(struct ceph_mon_client *monc);
|
|
|
|
extern int ceph_monc_validate_auth(struct ceph_mon_client *monc);
|
|
|
|
#endif
|