b24413180f
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>
257 lines
7.8 KiB
C
257 lines
7.8 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
/*
|
|
* This file is automatically generated --- any changes will be lost.
|
|
*/
|
|
|
|
#ifndef _SGE_DEFS_H
|
|
#define _SGE_DEFS_H
|
|
|
|
#define S_EC_CREDITS 0
|
|
#define M_EC_CREDITS 0x7FFF
|
|
#define V_EC_CREDITS(x) ((x) << S_EC_CREDITS)
|
|
#define G_EC_CREDITS(x) (((x) >> S_EC_CREDITS) & M_EC_CREDITS)
|
|
|
|
#define S_EC_GTS 15
|
|
#define V_EC_GTS(x) ((x) << S_EC_GTS)
|
|
#define F_EC_GTS V_EC_GTS(1U)
|
|
|
|
#define S_EC_INDEX 16
|
|
#define M_EC_INDEX 0xFFFF
|
|
#define V_EC_INDEX(x) ((x) << S_EC_INDEX)
|
|
#define G_EC_INDEX(x) (((x) >> S_EC_INDEX) & M_EC_INDEX)
|
|
|
|
#define S_EC_SIZE 0
|
|
#define M_EC_SIZE 0xFFFF
|
|
#define V_EC_SIZE(x) ((x) << S_EC_SIZE)
|
|
#define G_EC_SIZE(x) (((x) >> S_EC_SIZE) & M_EC_SIZE)
|
|
|
|
#define S_EC_BASE_LO 16
|
|
#define M_EC_BASE_LO 0xFFFF
|
|
#define V_EC_BASE_LO(x) ((x) << S_EC_BASE_LO)
|
|
#define G_EC_BASE_LO(x) (((x) >> S_EC_BASE_LO) & M_EC_BASE_LO)
|
|
|
|
#define S_EC_BASE_HI 0
|
|
#define M_EC_BASE_HI 0xF
|
|
#define V_EC_BASE_HI(x) ((x) << S_EC_BASE_HI)
|
|
#define G_EC_BASE_HI(x) (((x) >> S_EC_BASE_HI) & M_EC_BASE_HI)
|
|
|
|
#define S_EC_RESPQ 4
|
|
#define M_EC_RESPQ 0x7
|
|
#define V_EC_RESPQ(x) ((x) << S_EC_RESPQ)
|
|
#define G_EC_RESPQ(x) (((x) >> S_EC_RESPQ) & M_EC_RESPQ)
|
|
|
|
#define S_EC_TYPE 7
|
|
#define M_EC_TYPE 0x7
|
|
#define V_EC_TYPE(x) ((x) << S_EC_TYPE)
|
|
#define G_EC_TYPE(x) (((x) >> S_EC_TYPE) & M_EC_TYPE)
|
|
|
|
#define S_EC_GEN 10
|
|
#define V_EC_GEN(x) ((x) << S_EC_GEN)
|
|
#define F_EC_GEN V_EC_GEN(1U)
|
|
|
|
#define S_EC_UP_TOKEN 11
|
|
#define M_EC_UP_TOKEN 0xFFFFF
|
|
#define V_EC_UP_TOKEN(x) ((x) << S_EC_UP_TOKEN)
|
|
#define G_EC_UP_TOKEN(x) (((x) >> S_EC_UP_TOKEN) & M_EC_UP_TOKEN)
|
|
|
|
#define S_EC_VALID 31
|
|
#define V_EC_VALID(x) ((x) << S_EC_VALID)
|
|
#define F_EC_VALID V_EC_VALID(1U)
|
|
|
|
#define S_RQ_MSI_VEC 20
|
|
#define M_RQ_MSI_VEC 0x3F
|
|
#define V_RQ_MSI_VEC(x) ((x) << S_RQ_MSI_VEC)
|
|
#define G_RQ_MSI_VEC(x) (((x) >> S_RQ_MSI_VEC) & M_RQ_MSI_VEC)
|
|
|
|
#define S_RQ_INTR_EN 26
|
|
#define V_RQ_INTR_EN(x) ((x) << S_RQ_INTR_EN)
|
|
#define F_RQ_INTR_EN V_RQ_INTR_EN(1U)
|
|
|
|
#define S_RQ_GEN 28
|
|
#define V_RQ_GEN(x) ((x) << S_RQ_GEN)
|
|
#define F_RQ_GEN V_RQ_GEN(1U)
|
|
|
|
#define S_CQ_INDEX 0
|
|
#define M_CQ_INDEX 0xFFFF
|
|
#define V_CQ_INDEX(x) ((x) << S_CQ_INDEX)
|
|
#define G_CQ_INDEX(x) (((x) >> S_CQ_INDEX) & M_CQ_INDEX)
|
|
|
|
#define S_CQ_SIZE 16
|
|
#define M_CQ_SIZE 0xFFFF
|
|
#define V_CQ_SIZE(x) ((x) << S_CQ_SIZE)
|
|
#define G_CQ_SIZE(x) (((x) >> S_CQ_SIZE) & M_CQ_SIZE)
|
|
|
|
#define S_CQ_BASE_HI 0
|
|
#define M_CQ_BASE_HI 0xFFFFF
|
|
#define V_CQ_BASE_HI(x) ((x) << S_CQ_BASE_HI)
|
|
#define G_CQ_BASE_HI(x) (((x) >> S_CQ_BASE_HI) & M_CQ_BASE_HI)
|
|
|
|
#define S_CQ_RSPQ 20
|
|
#define M_CQ_RSPQ 0x3F
|
|
#define V_CQ_RSPQ(x) ((x) << S_CQ_RSPQ)
|
|
#define G_CQ_RSPQ(x) (((x) >> S_CQ_RSPQ) & M_CQ_RSPQ)
|
|
|
|
#define S_CQ_ASYNC_NOTIF 26
|
|
#define V_CQ_ASYNC_NOTIF(x) ((x) << S_CQ_ASYNC_NOTIF)
|
|
#define F_CQ_ASYNC_NOTIF V_CQ_ASYNC_NOTIF(1U)
|
|
|
|
#define S_CQ_ARMED 27
|
|
#define V_CQ_ARMED(x) ((x) << S_CQ_ARMED)
|
|
#define F_CQ_ARMED V_CQ_ARMED(1U)
|
|
|
|
#define S_CQ_ASYNC_NOTIF_SOL 28
|
|
#define V_CQ_ASYNC_NOTIF_SOL(x) ((x) << S_CQ_ASYNC_NOTIF_SOL)
|
|
#define F_CQ_ASYNC_NOTIF_SOL V_CQ_ASYNC_NOTIF_SOL(1U)
|
|
|
|
#define S_CQ_GEN 29
|
|
#define V_CQ_GEN(x) ((x) << S_CQ_GEN)
|
|
#define F_CQ_GEN V_CQ_GEN(1U)
|
|
|
|
#define S_CQ_ERR 30
|
|
#define V_CQ_ERR(x) ((x) << S_CQ_ERR)
|
|
#define F_CQ_ERR V_CQ_ERR(1U)
|
|
|
|
#define S_CQ_OVERFLOW_MODE 31
|
|
#define V_CQ_OVERFLOW_MODE(x) ((x) << S_CQ_OVERFLOW_MODE)
|
|
#define F_CQ_OVERFLOW_MODE V_CQ_OVERFLOW_MODE(1U)
|
|
|
|
#define S_CQ_CREDITS 0
|
|
#define M_CQ_CREDITS 0xFFFF
|
|
#define V_CQ_CREDITS(x) ((x) << S_CQ_CREDITS)
|
|
#define G_CQ_CREDITS(x) (((x) >> S_CQ_CREDITS) & M_CQ_CREDITS)
|
|
|
|
#define S_CQ_CREDIT_THRES 16
|
|
#define M_CQ_CREDIT_THRES 0x1FFF
|
|
#define V_CQ_CREDIT_THRES(x) ((x) << S_CQ_CREDIT_THRES)
|
|
#define G_CQ_CREDIT_THRES(x) (((x) >> S_CQ_CREDIT_THRES) & M_CQ_CREDIT_THRES)
|
|
|
|
#define S_FL_BASE_HI 0
|
|
#define M_FL_BASE_HI 0xFFFFF
|
|
#define V_FL_BASE_HI(x) ((x) << S_FL_BASE_HI)
|
|
#define G_FL_BASE_HI(x) (((x) >> S_FL_BASE_HI) & M_FL_BASE_HI)
|
|
|
|
#define S_FL_INDEX_LO 20
|
|
#define M_FL_INDEX_LO 0xFFF
|
|
#define V_FL_INDEX_LO(x) ((x) << S_FL_INDEX_LO)
|
|
#define G_FL_INDEX_LO(x) (((x) >> S_FL_INDEX_LO) & M_FL_INDEX_LO)
|
|
|
|
#define S_FL_INDEX_HI 0
|
|
#define M_FL_INDEX_HI 0xF
|
|
#define V_FL_INDEX_HI(x) ((x) << S_FL_INDEX_HI)
|
|
#define G_FL_INDEX_HI(x) (((x) >> S_FL_INDEX_HI) & M_FL_INDEX_HI)
|
|
|
|
#define S_FL_SIZE 4
|
|
#define M_FL_SIZE 0xFFFF
|
|
#define V_FL_SIZE(x) ((x) << S_FL_SIZE)
|
|
#define G_FL_SIZE(x) (((x) >> S_FL_SIZE) & M_FL_SIZE)
|
|
|
|
#define S_FL_GEN 20
|
|
#define V_FL_GEN(x) ((x) << S_FL_GEN)
|
|
#define F_FL_GEN V_FL_GEN(1U)
|
|
|
|
#define S_FL_ENTRY_SIZE_LO 21
|
|
#define M_FL_ENTRY_SIZE_LO 0x7FF
|
|
#define V_FL_ENTRY_SIZE_LO(x) ((x) << S_FL_ENTRY_SIZE_LO)
|
|
#define G_FL_ENTRY_SIZE_LO(x) (((x) >> S_FL_ENTRY_SIZE_LO) & M_FL_ENTRY_SIZE_LO)
|
|
|
|
#define S_FL_ENTRY_SIZE_HI 0
|
|
#define M_FL_ENTRY_SIZE_HI 0x1FFFFF
|
|
#define V_FL_ENTRY_SIZE_HI(x) ((x) << S_FL_ENTRY_SIZE_HI)
|
|
#define G_FL_ENTRY_SIZE_HI(x) (((x) >> S_FL_ENTRY_SIZE_HI) & M_FL_ENTRY_SIZE_HI)
|
|
|
|
#define S_FL_CONG_THRES 21
|
|
#define M_FL_CONG_THRES 0x3FF
|
|
#define V_FL_CONG_THRES(x) ((x) << S_FL_CONG_THRES)
|
|
#define G_FL_CONG_THRES(x) (((x) >> S_FL_CONG_THRES) & M_FL_CONG_THRES)
|
|
|
|
#define S_FL_GTS 31
|
|
#define V_FL_GTS(x) ((x) << S_FL_GTS)
|
|
#define F_FL_GTS V_FL_GTS(1U)
|
|
|
|
#define S_FLD_GEN1 31
|
|
#define V_FLD_GEN1(x) ((x) << S_FLD_GEN1)
|
|
#define F_FLD_GEN1 V_FLD_GEN1(1U)
|
|
|
|
#define S_FLD_GEN2 0
|
|
#define V_FLD_GEN2(x) ((x) << S_FLD_GEN2)
|
|
#define F_FLD_GEN2 V_FLD_GEN2(1U)
|
|
|
|
#define S_RSPD_TXQ1_CR 0
|
|
#define M_RSPD_TXQ1_CR 0x7F
|
|
#define V_RSPD_TXQ1_CR(x) ((x) << S_RSPD_TXQ1_CR)
|
|
#define G_RSPD_TXQ1_CR(x) (((x) >> S_RSPD_TXQ1_CR) & M_RSPD_TXQ1_CR)
|
|
|
|
#define S_RSPD_TXQ1_GTS 7
|
|
#define V_RSPD_TXQ1_GTS(x) ((x) << S_RSPD_TXQ1_GTS)
|
|
#define F_RSPD_TXQ1_GTS V_RSPD_TXQ1_GTS(1U)
|
|
|
|
#define S_RSPD_TXQ2_CR 8
|
|
#define M_RSPD_TXQ2_CR 0x7F
|
|
#define V_RSPD_TXQ2_CR(x) ((x) << S_RSPD_TXQ2_CR)
|
|
#define G_RSPD_TXQ2_CR(x) (((x) >> S_RSPD_TXQ2_CR) & M_RSPD_TXQ2_CR)
|
|
|
|
#define S_RSPD_TXQ2_GTS 15
|
|
#define V_RSPD_TXQ2_GTS(x) ((x) << S_RSPD_TXQ2_GTS)
|
|
#define F_RSPD_TXQ2_GTS V_RSPD_TXQ2_GTS(1U)
|
|
|
|
#define S_RSPD_TXQ0_CR 16
|
|
#define M_RSPD_TXQ0_CR 0x7F
|
|
#define V_RSPD_TXQ0_CR(x) ((x) << S_RSPD_TXQ0_CR)
|
|
#define G_RSPD_TXQ0_CR(x) (((x) >> S_RSPD_TXQ0_CR) & M_RSPD_TXQ0_CR)
|
|
|
|
#define S_RSPD_TXQ0_GTS 23
|
|
#define V_RSPD_TXQ0_GTS(x) ((x) << S_RSPD_TXQ0_GTS)
|
|
#define F_RSPD_TXQ0_GTS V_RSPD_TXQ0_GTS(1U)
|
|
|
|
#define S_RSPD_EOP 24
|
|
#define V_RSPD_EOP(x) ((x) << S_RSPD_EOP)
|
|
#define F_RSPD_EOP V_RSPD_EOP(1U)
|
|
|
|
#define S_RSPD_SOP 25
|
|
#define V_RSPD_SOP(x) ((x) << S_RSPD_SOP)
|
|
#define F_RSPD_SOP V_RSPD_SOP(1U)
|
|
|
|
#define S_RSPD_ASYNC_NOTIF 26
|
|
#define V_RSPD_ASYNC_NOTIF(x) ((x) << S_RSPD_ASYNC_NOTIF)
|
|
#define F_RSPD_ASYNC_NOTIF V_RSPD_ASYNC_NOTIF(1U)
|
|
|
|
#define S_RSPD_FL0_GTS 27
|
|
#define V_RSPD_FL0_GTS(x) ((x) << S_RSPD_FL0_GTS)
|
|
#define F_RSPD_FL0_GTS V_RSPD_FL0_GTS(1U)
|
|
|
|
#define S_RSPD_FL1_GTS 28
|
|
#define V_RSPD_FL1_GTS(x) ((x) << S_RSPD_FL1_GTS)
|
|
#define F_RSPD_FL1_GTS V_RSPD_FL1_GTS(1U)
|
|
|
|
#define S_RSPD_IMM_DATA_VALID 29
|
|
#define V_RSPD_IMM_DATA_VALID(x) ((x) << S_RSPD_IMM_DATA_VALID)
|
|
#define F_RSPD_IMM_DATA_VALID V_RSPD_IMM_DATA_VALID(1U)
|
|
|
|
#define S_RSPD_OFFLOAD 30
|
|
#define V_RSPD_OFFLOAD(x) ((x) << S_RSPD_OFFLOAD)
|
|
#define F_RSPD_OFFLOAD V_RSPD_OFFLOAD(1U)
|
|
|
|
#define S_RSPD_GEN1 31
|
|
#define V_RSPD_GEN1(x) ((x) << S_RSPD_GEN1)
|
|
#define F_RSPD_GEN1 V_RSPD_GEN1(1U)
|
|
|
|
#define S_RSPD_LEN 0
|
|
#define M_RSPD_LEN 0x7FFFFFFF
|
|
#define V_RSPD_LEN(x) ((x) << S_RSPD_LEN)
|
|
#define G_RSPD_LEN(x) (((x) >> S_RSPD_LEN) & M_RSPD_LEN)
|
|
|
|
#define S_RSPD_FLQ 31
|
|
#define V_RSPD_FLQ(x) ((x) << S_RSPD_FLQ)
|
|
#define F_RSPD_FLQ V_RSPD_FLQ(1U)
|
|
|
|
#define S_RSPD_GEN2 0
|
|
#define V_RSPD_GEN2(x) ((x) << S_RSPD_GEN2)
|
|
#define F_RSPD_GEN2 V_RSPD_GEN2(1U)
|
|
|
|
#define S_RSPD_INR_VEC 1
|
|
#define M_RSPD_INR_VEC 0x7F
|
|
#define V_RSPD_INR_VEC(x) ((x) << S_RSPD_INR_VEC)
|
|
#define G_RSPD_INR_VEC(x) (((x) >> S_RSPD_INR_VEC) & M_RSPD_INR_VEC)
|
|
|
|
#endif /* _SGE_DEFS_H */
|