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 22:07:57 +08:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2017-01-09 23:55:17 +08:00
|
|
|
/*
|
|
|
|
* Shared Memory Communications over RDMA (SMC-R) and RoCE
|
|
|
|
*
|
|
|
|
* Definitions for SMC Connections, Link Groups and Links
|
|
|
|
*
|
|
|
|
* Copyright IBM Corp. 2016
|
|
|
|
*
|
|
|
|
* Author(s): Ursula Braun <ubraun@linux.vnet.ibm.com>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _SMC_CORE_H
|
|
|
|
#define _SMC_CORE_H
|
|
|
|
|
2017-01-09 23:55:19 +08:00
|
|
|
#include <linux/atomic.h>
|
2017-01-09 23:55:17 +08:00
|
|
|
#include <rdma/ib_verbs.h>
|
|
|
|
|
|
|
|
#include "smc.h"
|
|
|
|
#include "smc_ib.h"
|
|
|
|
|
2017-01-09 23:55:18 +08:00
|
|
|
#define SMC_RMBS_PER_LGR_MAX 255 /* max. # of RMBs per link group */
|
|
|
|
|
2017-01-09 23:55:17 +08:00
|
|
|
struct smc_lgr_list { /* list of link group definition */
|
|
|
|
struct list_head list;
|
|
|
|
spinlock_t lock; /* protects list of link groups */
|
|
|
|
};
|
|
|
|
|
|
|
|
extern struct smc_lgr_list smc_lgr_list; /* list of link groups */
|
|
|
|
|
|
|
|
enum smc_lgr_role { /* possible roles of a link group */
|
|
|
|
SMC_CLNT, /* client */
|
|
|
|
SMC_SERV /* server */
|
|
|
|
};
|
|
|
|
|
2017-01-09 23:55:19 +08:00
|
|
|
#define SMC_WR_BUF_SIZE 48 /* size of work request buffer */
|
|
|
|
|
|
|
|
struct smc_wr_buf {
|
|
|
|
u8 raw[SMC_WR_BUF_SIZE];
|
|
|
|
};
|
|
|
|
|
2017-07-28 19:56:17 +08:00
|
|
|
#define SMC_WR_REG_MR_WAIT_TIME (5 * HZ)/* wait time for ib_wr_reg_mr result */
|
|
|
|
|
|
|
|
enum smc_wr_reg_state {
|
|
|
|
POSTED, /* ib_wr_reg_mr request posted */
|
|
|
|
CONFIRMED, /* ib_wr_reg_mr response: successful */
|
|
|
|
FAILED /* ib_wr_reg_mr response: failure */
|
|
|
|
};
|
|
|
|
|
2017-01-09 23:55:17 +08:00
|
|
|
struct smc_link {
|
|
|
|
struct smc_ib_device *smcibdev; /* ib-device */
|
|
|
|
u8 ibport; /* port - values 1 | 2 */
|
2017-01-09 23:55:19 +08:00
|
|
|
struct ib_pd *roce_pd; /* IB protection domain,
|
|
|
|
* unique for every RoCE QP
|
|
|
|
*/
|
2017-01-09 23:55:17 +08:00
|
|
|
struct ib_qp *roce_qp; /* IB queue pair */
|
|
|
|
struct ib_qp_attr qp_attr; /* IB queue pair attributes */
|
2017-01-09 23:55:19 +08:00
|
|
|
|
|
|
|
struct smc_wr_buf *wr_tx_bufs; /* WR send payload buffers */
|
|
|
|
struct ib_send_wr *wr_tx_ibs; /* WR send meta data */
|
|
|
|
struct ib_sge *wr_tx_sges; /* WR send gather meta data */
|
|
|
|
struct smc_wr_tx_pend *wr_tx_pends; /* WR send waiting for CQE */
|
|
|
|
/* above four vectors have wr_tx_cnt elements and use the same index */
|
|
|
|
dma_addr_t wr_tx_dma_addr; /* DMA address of wr_tx_bufs */
|
|
|
|
atomic_long_t wr_tx_id; /* seq # of last sent WR */
|
|
|
|
unsigned long *wr_tx_mask; /* bit mask of used indexes */
|
|
|
|
u32 wr_tx_cnt; /* number of WR send buffers */
|
|
|
|
wait_queue_head_t wr_tx_wait; /* wait for free WR send buf */
|
|
|
|
|
|
|
|
struct smc_wr_buf *wr_rx_bufs; /* WR recv payload buffers */
|
|
|
|
struct ib_recv_wr *wr_rx_ibs; /* WR recv meta data */
|
|
|
|
struct ib_sge *wr_rx_sges; /* WR recv scatter meta data */
|
|
|
|
/* above three vectors have wr_rx_cnt elements and use the same index */
|
|
|
|
dma_addr_t wr_rx_dma_addr; /* DMA address of wr_rx_bufs */
|
|
|
|
u64 wr_rx_id; /* seq # of last recv WR */
|
|
|
|
u32 wr_rx_cnt; /* number of WR recv buffers */
|
|
|
|
|
2017-07-28 19:56:17 +08:00
|
|
|
struct ib_reg_wr wr_reg; /* WR register memory region */
|
|
|
|
wait_queue_head_t wr_reg_wait; /* wait for wr_reg result */
|
|
|
|
enum smc_wr_reg_state wr_reg_state; /* state of wr_reg request */
|
|
|
|
|
2017-01-09 23:55:17 +08:00
|
|
|
union ib_gid gid; /* gid matching used vlan id */
|
|
|
|
u32 peer_qpn; /* QP number of peer */
|
|
|
|
enum ib_mtu path_mtu; /* used mtu */
|
|
|
|
enum ib_mtu peer_mtu; /* mtu size of peer */
|
|
|
|
u32 psn_initial; /* QP tx initial packet seqno */
|
|
|
|
u32 peer_psn; /* QP rx initial packet seqno */
|
|
|
|
u8 peer_mac[ETH_ALEN]; /* = gid[8:10||13:15] */
|
|
|
|
u8 peer_gid[sizeof(union ib_gid)]; /* gid of peer*/
|
2017-01-09 23:55:21 +08:00
|
|
|
u8 link_id; /* unique # within link group */
|
|
|
|
struct completion llc_confirm; /* wait for rx of conf link */
|
|
|
|
struct completion llc_confirm_resp; /* wait 4 rx of cnf lnk rsp */
|
2017-01-09 23:55:17 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
/* For now we just allow one parallel link per link group. The SMC protocol
|
|
|
|
* allows more (up to 8).
|
|
|
|
*/
|
|
|
|
#define SMC_LINKS_PER_LGR_MAX 1
|
|
|
|
#define SMC_SINGLE_LINK 0
|
|
|
|
|
|
|
|
#define SMC_FIRST_CONTACT 1 /* first contact to a peer */
|
|
|
|
#define SMC_REUSE_CONTACT 0 /* follow-on contact to a peer*/
|
|
|
|
|
2017-01-09 23:55:18 +08:00
|
|
|
/* tx/rx buffer list element for sndbufs list and rmbs list of a lgr */
|
|
|
|
struct smc_buf_desc {
|
|
|
|
struct list_head list;
|
|
|
|
void *cpu_addr; /* virtual address of buffer */
|
2017-07-28 19:56:15 +08:00
|
|
|
struct sg_table sgt[SMC_LINKS_PER_LGR_MAX];/* virtual buffer */
|
2017-07-28 19:56:16 +08:00
|
|
|
struct ib_mr *mr_rx[SMC_LINKS_PER_LGR_MAX];
|
|
|
|
/* for rmb only: memory region
|
|
|
|
* incl. rkey provided to peer
|
|
|
|
*/
|
2017-07-28 19:56:15 +08:00
|
|
|
u32 order; /* allocation order */
|
2017-01-09 23:55:18 +08:00
|
|
|
u32 used; /* currently used / unused */
|
2017-07-28 19:56:16 +08:00
|
|
|
bool reused; /* new created / reused */
|
2017-01-09 23:55:18 +08:00
|
|
|
};
|
|
|
|
|
2017-01-09 23:55:20 +08:00
|
|
|
struct smc_rtoken { /* address/key of remote RMB */
|
|
|
|
u64 dma_addr;
|
|
|
|
u32 rkey;
|
|
|
|
};
|
|
|
|
|
2017-01-09 23:55:21 +08:00
|
|
|
#define SMC_LGR_ID_SIZE 4
|
|
|
|
|
2017-01-09 23:55:17 +08:00
|
|
|
struct smc_link_group {
|
|
|
|
struct list_head list;
|
|
|
|
enum smc_lgr_role role; /* client or server */
|
|
|
|
struct smc_link lnk[SMC_LINKS_PER_LGR_MAX]; /* smc link */
|
|
|
|
char peer_systemid[SMC_SYSTEMID_LEN];
|
|
|
|
/* unique system_id of peer */
|
|
|
|
struct rb_root conns_all; /* connection tree */
|
|
|
|
rwlock_t conns_lock; /* protects conns_all */
|
|
|
|
unsigned int conns_num; /* current # of connections */
|
|
|
|
unsigned short vlan_id; /* vlan id of link group */
|
2017-01-09 23:55:18 +08:00
|
|
|
|
|
|
|
struct list_head sndbufs[SMC_RMBE_SIZES];/* tx buffers */
|
|
|
|
rwlock_t sndbufs_lock; /* protects tx buffers */
|
|
|
|
struct list_head rmbs[SMC_RMBE_SIZES]; /* rx buffers */
|
|
|
|
rwlock_t rmbs_lock; /* protects rx buffers */
|
2017-01-09 23:55:20 +08:00
|
|
|
struct smc_rtoken rtokens[SMC_RMBS_PER_LGR_MAX]
|
|
|
|
[SMC_LINKS_PER_LGR_MAX];
|
|
|
|
/* remote addr/key pairs */
|
|
|
|
unsigned long rtokens_used_mask[BITS_TO_LONGS(
|
|
|
|
SMC_RMBS_PER_LGR_MAX)];
|
|
|
|
/* used rtoken elements */
|
|
|
|
|
2017-01-09 23:55:21 +08:00
|
|
|
u8 id[SMC_LGR_ID_SIZE]; /* unique lgr id */
|
2017-01-09 23:55:17 +08:00
|
|
|
struct delayed_work free_work; /* delayed freeing of an lgr */
|
|
|
|
bool sync_err; /* lgr no longer fits to peer */
|
|
|
|
};
|
|
|
|
|
|
|
|
/* Find the connection associated with the given alert token in the link group.
|
|
|
|
* To use rbtrees we have to implement our own search core.
|
|
|
|
* Requires @conns_lock
|
|
|
|
* @token alert token to search for
|
|
|
|
* @lgr link group to search in
|
|
|
|
* Returns connection associated with token if found, NULL otherwise.
|
|
|
|
*/
|
|
|
|
static inline struct smc_connection *smc_lgr_find_conn(
|
|
|
|
u32 token, struct smc_link_group *lgr)
|
|
|
|
{
|
|
|
|
struct smc_connection *res = NULL;
|
|
|
|
struct rb_node *node;
|
|
|
|
|
|
|
|
node = lgr->conns_all.rb_node;
|
|
|
|
while (node) {
|
|
|
|
struct smc_connection *cur = rb_entry(node,
|
|
|
|
struct smc_connection, alert_node);
|
|
|
|
|
|
|
|
if (cur->alert_token_local > token) {
|
|
|
|
node = node->rb_left;
|
|
|
|
} else {
|
|
|
|
if (cur->alert_token_local < token) {
|
|
|
|
node = node->rb_right;
|
|
|
|
} else {
|
|
|
|
res = cur;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2017-01-09 23:55:18 +08:00
|
|
|
struct smc_sock;
|
|
|
|
struct smc_clc_msg_accept_confirm;
|
|
|
|
|
2017-01-09 23:55:17 +08:00
|
|
|
void smc_lgr_free(struct smc_link_group *lgr);
|
|
|
|
void smc_lgr_terminate(struct smc_link_group *lgr);
|
2017-07-28 19:56:20 +08:00
|
|
|
int smc_buf_create(struct smc_sock *smc);
|
2017-01-09 23:55:20 +08:00
|
|
|
int smc_rmb_rtoken_handling(struct smc_connection *conn,
|
|
|
|
struct smc_clc_msg_accept_confirm *clc);
|
2018-03-01 20:51:30 +08:00
|
|
|
int smc_rtoken_add(struct smc_link_group *lgr, __be64 nw_vaddr, __be32 nw_rkey);
|
|
|
|
int smc_rtoken_delete(struct smc_link_group *lgr, __be32 nw_rkey);
|
2017-07-28 19:56:22 +08:00
|
|
|
void smc_sndbuf_sync_sg_for_cpu(struct smc_connection *conn);
|
|
|
|
void smc_sndbuf_sync_sg_for_device(struct smc_connection *conn);
|
|
|
|
void smc_rmb_sync_sg_for_cpu(struct smc_connection *conn);
|
|
|
|
void smc_rmb_sync_sg_for_device(struct smc_connection *conn);
|
2017-01-09 23:55:17 +08:00
|
|
|
#endif
|