mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-28 02:45:26 +07:00
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>
210 lines
5.5 KiB
C
210 lines
5.5 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _PARISC_CHECKSUM_H
|
|
#define _PARISC_CHECKSUM_H
|
|
|
|
#include <linux/in6.h>
|
|
|
|
/*
|
|
* computes the checksum of a memory block at buff, length len,
|
|
* and adds in "sum" (32-bit)
|
|
*
|
|
* returns a 32-bit number suitable for feeding into itself
|
|
* or csum_tcpudp_magic
|
|
*
|
|
* this function must be called with even lengths, except
|
|
* for the last fragment, which may be odd
|
|
*
|
|
* it's best to have buff aligned on a 32-bit boundary
|
|
*/
|
|
extern __wsum csum_partial(const void *, int, __wsum);
|
|
|
|
/*
|
|
* The same as csum_partial, but copies from src while it checksums.
|
|
*
|
|
* Here even more important to align src and dst on a 32-bit (or even
|
|
* better 64-bit) boundary
|
|
*/
|
|
extern __wsum csum_partial_copy_nocheck(const void *, void *, int, __wsum);
|
|
|
|
/*
|
|
* this is a new version of the above that records errors it finds in *errp,
|
|
* but continues and zeros the rest of the buffer.
|
|
*/
|
|
extern __wsum csum_partial_copy_from_user(const void __user *src,
|
|
void *dst, int len, __wsum sum, int *errp);
|
|
|
|
/*
|
|
* Optimized for IP headers, which always checksum on 4 octet boundaries.
|
|
*
|
|
* Written by Randolph Chung <tausq@debian.org>, and then mucked with by
|
|
* LaMont Jones <lamont@debian.org>
|
|
*/
|
|
static inline __sum16 ip_fast_csum(const void *iph, unsigned int ihl)
|
|
{
|
|
unsigned int sum;
|
|
|
|
__asm__ __volatile__ (
|
|
" ldws,ma 4(%1), %0\n"
|
|
" addib,<= -4, %2, 2f\n"
|
|
"\n"
|
|
" ldws 4(%1), %%r20\n"
|
|
" ldws 8(%1), %%r21\n"
|
|
" add %0, %%r20, %0\n"
|
|
" ldws,ma 12(%1), %%r19\n"
|
|
" addc %0, %%r21, %0\n"
|
|
" addc %0, %%r19, %0\n"
|
|
"1: ldws,ma 4(%1), %%r19\n"
|
|
" addib,< 0, %2, 1b\n"
|
|
" addc %0, %%r19, %0\n"
|
|
"\n"
|
|
" extru %0, 31, 16, %%r20\n"
|
|
" extru %0, 15, 16, %%r21\n"
|
|
" addc %%r20, %%r21, %0\n"
|
|
" extru %0, 15, 16, %%r21\n"
|
|
" add %0, %%r21, %0\n"
|
|
" subi -1, %0, %0\n"
|
|
"2:\n"
|
|
: "=r" (sum), "=r" (iph), "=r" (ihl)
|
|
: "1" (iph), "2" (ihl)
|
|
: "r19", "r20", "r21", "memory");
|
|
|
|
return (__force __sum16)sum;
|
|
}
|
|
|
|
/*
|
|
* Fold a partial checksum
|
|
*/
|
|
static inline __sum16 csum_fold(__wsum csum)
|
|
{
|
|
u32 sum = (__force u32)csum;
|
|
/* add the swapped two 16-bit halves of sum,
|
|
a possible carry from adding the two 16-bit halves,
|
|
will carry from the lower half into the upper half,
|
|
giving us the correct sum in the upper half. */
|
|
sum += (sum << 16) + (sum >> 16);
|
|
return (__force __sum16)(~sum >> 16);
|
|
}
|
|
|
|
static inline __wsum csum_tcpudp_nofold(__be32 saddr, __be32 daddr,
|
|
__u32 len, __u8 proto,
|
|
__wsum sum)
|
|
{
|
|
__asm__(
|
|
" add %1, %0, %0\n"
|
|
" addc %2, %0, %0\n"
|
|
" addc %3, %0, %0\n"
|
|
" addc %%r0, %0, %0\n"
|
|
: "=r" (sum)
|
|
: "r" (daddr), "r"(saddr), "r"(proto+len), "0"(sum));
|
|
return sum;
|
|
}
|
|
|
|
/*
|
|
* computes the checksum of the TCP/UDP pseudo-header
|
|
* returns a 16-bit checksum, already complemented
|
|
*/
|
|
static inline __sum16 csum_tcpudp_magic(__be32 saddr, __be32 daddr,
|
|
__u32 len, __u8 proto,
|
|
__wsum sum)
|
|
{
|
|
return csum_fold(csum_tcpudp_nofold(saddr,daddr,len,proto,sum));
|
|
}
|
|
|
|
/*
|
|
* this routine is used for miscellaneous IP-like checksums, mainly
|
|
* in icmp.c
|
|
*/
|
|
static inline __sum16 ip_compute_csum(const void *buf, int len)
|
|
{
|
|
return csum_fold (csum_partial(buf, len, 0));
|
|
}
|
|
|
|
|
|
#define _HAVE_ARCH_IPV6_CSUM
|
|
static __inline__ __sum16 csum_ipv6_magic(const struct in6_addr *saddr,
|
|
const struct in6_addr *daddr,
|
|
__u32 len, __u8 proto,
|
|
__wsum sum)
|
|
{
|
|
__asm__ __volatile__ (
|
|
|
|
#if BITS_PER_LONG > 32
|
|
|
|
/*
|
|
** We can execute two loads and two adds per cycle on PA 8000.
|
|
** But add insn's get serialized waiting for the carry bit.
|
|
** Try to keep 4 registers with "live" values ahead of the ALU.
|
|
*/
|
|
|
|
" ldd,ma 8(%1), %%r19\n" /* get 1st saddr word */
|
|
" ldd,ma 8(%2), %%r20\n" /* get 1st daddr word */
|
|
" add %8, %3, %3\n"/* add 16-bit proto + len */
|
|
" add %%r19, %0, %0\n"
|
|
" ldd,ma 8(%1), %%r21\n" /* 2cd saddr */
|
|
" ldd,ma 8(%2), %%r22\n" /* 2cd daddr */
|
|
" add,dc %%r20, %0, %0\n"
|
|
" add,dc %%r21, %0, %0\n"
|
|
" add,dc %%r22, %0, %0\n"
|
|
" add,dc %3, %0, %0\n" /* fold in proto+len | carry bit */
|
|
" extrd,u %0, 31, 32, %%r19\n" /* copy upper half down */
|
|
" depdi 0, 31, 32, %0\n" /* clear upper half */
|
|
" add %%r19, %0, %0\n" /* fold into 32-bits */
|
|
" addc 0, %0, %0\n" /* add carry */
|
|
|
|
#else
|
|
|
|
/*
|
|
** For PA 1.x, the insn order doesn't matter as much.
|
|
** Insn stream is serialized on the carry bit here too.
|
|
** result from the previous operation (eg r0 + x)
|
|
*/
|
|
|
|
" ldw,ma 4(%1), %%r19\n" /* get 1st saddr word */
|
|
" ldw,ma 4(%2), %%r20\n" /* get 1st daddr word */
|
|
" add %8, %3, %3\n" /* add 16-bit proto + len */
|
|
" add %%r19, %0, %0\n"
|
|
" ldw,ma 4(%1), %%r21\n" /* 2cd saddr */
|
|
" addc %%r20, %0, %0\n"
|
|
" ldw,ma 4(%2), %%r22\n" /* 2cd daddr */
|
|
" addc %%r21, %0, %0\n"
|
|
" ldw,ma 4(%1), %%r19\n" /* 3rd saddr */
|
|
" addc %%r22, %0, %0\n"
|
|
" ldw,ma 4(%2), %%r20\n" /* 3rd daddr */
|
|
" addc %%r19, %0, %0\n"
|
|
" ldw,ma 4(%1), %%r21\n" /* 4th saddr */
|
|
" addc %%r20, %0, %0\n"
|
|
" ldw,ma 4(%2), %%r22\n" /* 4th daddr */
|
|
" addc %%r21, %0, %0\n"
|
|
" addc %%r22, %0, %0\n"
|
|
" addc %3, %0, %0\n" /* fold in proto+len, catch carry */
|
|
|
|
#endif
|
|
: "=r" (sum), "=r" (saddr), "=r" (daddr), "=r" (len)
|
|
: "0" (sum), "1" (saddr), "2" (daddr), "3" (len), "r" (proto)
|
|
: "r19", "r20", "r21", "r22", "memory");
|
|
return csum_fold(sum);
|
|
}
|
|
|
|
/*
|
|
* Copy and checksum to user
|
|
*/
|
|
#define HAVE_CSUM_COPY_USER
|
|
static __inline__ __wsum csum_and_copy_to_user(const void *src,
|
|
void __user *dst,
|
|
int len, __wsum sum,
|
|
int *err_ptr)
|
|
{
|
|
/* code stolen from include/asm-mips64 */
|
|
sum = csum_partial(src, len, sum);
|
|
|
|
if (copy_to_user(dst, src, len)) {
|
|
*err_ptr = -EFAULT;
|
|
return (__force __wsum)-1;
|
|
}
|
|
|
|
return sum;
|
|
}
|
|
|
|
#endif
|
|
|