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 07:07:57 -07:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2005-04-16 15:20:36 -07:00
|
|
|
/*
|
|
|
|
* csum_partial_copy - do IP checksumming and copy
|
|
|
|
*
|
|
|
|
* (C) Copyright 1996 Linus Torvalds
|
2007-10-19 16:04:37 -07:00
|
|
|
* accelerated versions (and 21264 assembly versions ) contributed by
|
2005-04-16 15:20:36 -07:00
|
|
|
* Rick Gorton <rick.gorton@alpha-processor.com>
|
|
|
|
*
|
|
|
|
* Don't look at this too closely - you'll go mad. The things
|
|
|
|
* we do for performance..
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/string.h>
|
2016-12-24 12:46:01 -07:00
|
|
|
#include <linux/uaccess.h>
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
#define ldq_u(x,y) \
|
|
|
|
__asm__ __volatile__("ldq_u %0,%1":"=r" (x):"m" (*(const unsigned long *)(y)))
|
|
|
|
|
|
|
|
#define stq_u(x,y) \
|
|
|
|
__asm__ __volatile__("stq_u %1,%0":"=m" (*(unsigned long *)(y)):"r" (x))
|
|
|
|
|
|
|
|
#define extql(x,y,z) \
|
|
|
|
__asm__ __volatile__("extql %1,%2,%0":"=r" (z):"r" (x),"r" (y))
|
|
|
|
|
|
|
|
#define extqh(x,y,z) \
|
|
|
|
__asm__ __volatile__("extqh %1,%2,%0":"=r" (z):"r" (x),"r" (y))
|
|
|
|
|
|
|
|
#define mskql(x,y,z) \
|
|
|
|
__asm__ __volatile__("mskql %1,%2,%0":"=r" (z):"r" (x),"r" (y))
|
|
|
|
|
|
|
|
#define mskqh(x,y,z) \
|
|
|
|
__asm__ __volatile__("mskqh %1,%2,%0":"=r" (z):"r" (x),"r" (y))
|
|
|
|
|
|
|
|
#define insql(x,y,z) \
|
|
|
|
__asm__ __volatile__("insql %1,%2,%0":"=r" (z):"r" (x),"r" (y))
|
|
|
|
|
|
|
|
#define insqh(x,y,z) \
|
|
|
|
__asm__ __volatile__("insqh %1,%2,%0":"=r" (z):"r" (x),"r" (y))
|
|
|
|
|
|
|
|
|
|
|
|
#define __get_user_u(x,ptr) \
|
|
|
|
({ \
|
|
|
|
long __guu_err; \
|
|
|
|
__asm__ __volatile__( \
|
|
|
|
"1: ldq_u %0,%2\n" \
|
|
|
|
"2:\n" \
|
2017-03-07 02:08:46 -07:00
|
|
|
EXC(1b,2b,%0,%1) \
|
2005-04-16 15:20:36 -07:00
|
|
|
: "=r"(x), "=r"(__guu_err) \
|
|
|
|
: "m"(__m(ptr)), "1"(0)); \
|
|
|
|
__guu_err; \
|
|
|
|
})
|
|
|
|
|
|
|
|
#define __put_user_u(x,ptr) \
|
|
|
|
({ \
|
|
|
|
long __puu_err; \
|
|
|
|
__asm__ __volatile__( \
|
|
|
|
"1: stq_u %2,%1\n" \
|
|
|
|
"2:\n" \
|
2017-03-07 02:08:46 -07:00
|
|
|
EXC(1b,2b,$31,%0) \
|
2005-04-16 15:20:36 -07:00
|
|
|
: "=r"(__puu_err) \
|
|
|
|
: "m"(__m(addr)), "rJ"(x), "0"(0)); \
|
|
|
|
__puu_err; \
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
|
|
static inline unsigned short from64to16(unsigned long x)
|
|
|
|
{
|
|
|
|
/* Using extract instructions is a bit more efficient
|
|
|
|
than the original shift/bitmask version. */
|
|
|
|
|
|
|
|
union {
|
|
|
|
unsigned long ul;
|
|
|
|
unsigned int ui[2];
|
|
|
|
unsigned short us[4];
|
|
|
|
} in_v, tmp_v, out_v;
|
|
|
|
|
|
|
|
in_v.ul = x;
|
|
|
|
tmp_v.ul = (unsigned long) in_v.ui[0] + (unsigned long) in_v.ui[1];
|
|
|
|
|
|
|
|
/* Since the bits of tmp_v.sh[3] are going to always be zero,
|
|
|
|
we don't have to bother to add that in. */
|
|
|
|
out_v.ul = (unsigned long) tmp_v.us[0] + (unsigned long) tmp_v.us[1]
|
|
|
|
+ (unsigned long) tmp_v.us[2];
|
|
|
|
|
|
|
|
/* Similarly, out_v.us[2] is always zero for the final add. */
|
|
|
|
return out_v.us[0] + out_v.us[1];
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Ok. This isn't fun, but this is the EASY case.
|
|
|
|
*/
|
|
|
|
static inline unsigned long
|
|
|
|
csum_partial_cfu_aligned(const unsigned long __user *src, unsigned long *dst,
|
|
|
|
long len, unsigned long checksum,
|
|
|
|
int *errp)
|
|
|
|
{
|
|
|
|
unsigned long carry = 0;
|
|
|
|
int err = 0;
|
|
|
|
|
|
|
|
while (len >= 0) {
|
|
|
|
unsigned long word;
|
|
|
|
err |= __get_user(word, src);
|
|
|
|
checksum += carry;
|
|
|
|
src++;
|
|
|
|
checksum += word;
|
|
|
|
len -= 8;
|
|
|
|
carry = checksum < word;
|
|
|
|
*dst = word;
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
len += 8;
|
|
|
|
checksum += carry;
|
|
|
|
if (len) {
|
|
|
|
unsigned long word, tmp;
|
|
|
|
err |= __get_user(word, src);
|
|
|
|
tmp = *dst;
|
|
|
|
mskql(word, len, word);
|
|
|
|
checksum += word;
|
|
|
|
mskqh(tmp, len, tmp);
|
|
|
|
carry = checksum < word;
|
|
|
|
*dst = word | tmp;
|
|
|
|
checksum += carry;
|
|
|
|
}
|
2013-11-16 17:45:31 -07:00
|
|
|
if (err && errp) *errp = err;
|
2005-04-16 15:20:36 -07:00
|
|
|
return checksum;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is even less fun, but this is still reasonably
|
|
|
|
* easy.
|
|
|
|
*/
|
|
|
|
static inline unsigned long
|
|
|
|
csum_partial_cfu_dest_aligned(const unsigned long __user *src,
|
|
|
|
unsigned long *dst,
|
|
|
|
unsigned long soff,
|
|
|
|
long len, unsigned long checksum,
|
|
|
|
int *errp)
|
|
|
|
{
|
|
|
|
unsigned long first;
|
|
|
|
unsigned long word, carry;
|
|
|
|
unsigned long lastsrc = 7+len+(unsigned long)src;
|
|
|
|
int err = 0;
|
|
|
|
|
|
|
|
err |= __get_user_u(first,src);
|
|
|
|
carry = 0;
|
|
|
|
while (len >= 0) {
|
|
|
|
unsigned long second;
|
|
|
|
|
|
|
|
err |= __get_user_u(second, src+1);
|
|
|
|
extql(first, soff, word);
|
|
|
|
len -= 8;
|
|
|
|
src++;
|
|
|
|
extqh(second, soff, first);
|
|
|
|
checksum += carry;
|
|
|
|
word |= first;
|
|
|
|
first = second;
|
|
|
|
checksum += word;
|
|
|
|
*dst = word;
|
|
|
|
dst++;
|
|
|
|
carry = checksum < word;
|
|
|
|
}
|
|
|
|
len += 8;
|
|
|
|
checksum += carry;
|
|
|
|
if (len) {
|
|
|
|
unsigned long tmp;
|
|
|
|
unsigned long second;
|
|
|
|
err |= __get_user_u(second, lastsrc);
|
|
|
|
tmp = *dst;
|
|
|
|
extql(first, soff, word);
|
|
|
|
extqh(second, soff, first);
|
|
|
|
word |= first;
|
|
|
|
mskql(word, len, word);
|
|
|
|
checksum += word;
|
|
|
|
mskqh(tmp, len, tmp);
|
|
|
|
carry = checksum < word;
|
|
|
|
*dst = word | tmp;
|
|
|
|
checksum += carry;
|
|
|
|
}
|
2013-11-16 17:45:31 -07:00
|
|
|
if (err && errp) *errp = err;
|
2005-04-16 15:20:36 -07:00
|
|
|
return checksum;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is slightly less fun than the above..
|
|
|
|
*/
|
|
|
|
static inline unsigned long
|
|
|
|
csum_partial_cfu_src_aligned(const unsigned long __user *src,
|
|
|
|
unsigned long *dst,
|
|
|
|
unsigned long doff,
|
|
|
|
long len, unsigned long checksum,
|
|
|
|
unsigned long partial_dest,
|
|
|
|
int *errp)
|
|
|
|
{
|
|
|
|
unsigned long carry = 0;
|
|
|
|
unsigned long word;
|
|
|
|
unsigned long second_dest;
|
|
|
|
int err = 0;
|
|
|
|
|
|
|
|
mskql(partial_dest, doff, partial_dest);
|
|
|
|
while (len >= 0) {
|
|
|
|
err |= __get_user(word, src);
|
|
|
|
len -= 8;
|
|
|
|
insql(word, doff, second_dest);
|
|
|
|
checksum += carry;
|
|
|
|
stq_u(partial_dest | second_dest, dst);
|
|
|
|
src++;
|
|
|
|
checksum += word;
|
|
|
|
insqh(word, doff, partial_dest);
|
|
|
|
carry = checksum < word;
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
len += 8;
|
|
|
|
if (len) {
|
|
|
|
checksum += carry;
|
|
|
|
err |= __get_user(word, src);
|
|
|
|
mskql(word, len, word);
|
|
|
|
len -= 8;
|
|
|
|
checksum += word;
|
|
|
|
insql(word, doff, second_dest);
|
|
|
|
len += doff;
|
|
|
|
carry = checksum < word;
|
|
|
|
partial_dest |= second_dest;
|
|
|
|
if (len >= 0) {
|
|
|
|
stq_u(partial_dest, dst);
|
|
|
|
if (!len) goto out;
|
|
|
|
dst++;
|
|
|
|
insqh(word, doff, partial_dest);
|
|
|
|
}
|
|
|
|
doff = len;
|
|
|
|
}
|
|
|
|
ldq_u(second_dest, dst);
|
|
|
|
mskqh(second_dest, doff, second_dest);
|
|
|
|
stq_u(partial_dest | second_dest, dst);
|
|
|
|
out:
|
|
|
|
checksum += carry;
|
2013-11-16 17:45:31 -07:00
|
|
|
if (err && errp) *errp = err;
|
2005-04-16 15:20:36 -07:00
|
|
|
return checksum;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is so totally un-fun that it's frightening. Don't
|
|
|
|
* look at this too closely, you'll go blind.
|
|
|
|
*/
|
|
|
|
static inline unsigned long
|
|
|
|
csum_partial_cfu_unaligned(const unsigned long __user * src,
|
|
|
|
unsigned long * dst,
|
|
|
|
unsigned long soff, unsigned long doff,
|
|
|
|
long len, unsigned long checksum,
|
|
|
|
unsigned long partial_dest,
|
|
|
|
int *errp)
|
|
|
|
{
|
|
|
|
unsigned long carry = 0;
|
|
|
|
unsigned long first;
|
|
|
|
unsigned long lastsrc;
|
|
|
|
int err = 0;
|
|
|
|
|
|
|
|
err |= __get_user_u(first, src);
|
|
|
|
lastsrc = 7+len+(unsigned long)src;
|
|
|
|
mskql(partial_dest, doff, partial_dest);
|
|
|
|
while (len >= 0) {
|
|
|
|
unsigned long second, word;
|
|
|
|
unsigned long second_dest;
|
|
|
|
|
|
|
|
err |= __get_user_u(second, src+1);
|
|
|
|
extql(first, soff, word);
|
|
|
|
checksum += carry;
|
|
|
|
len -= 8;
|
|
|
|
extqh(second, soff, first);
|
|
|
|
src++;
|
|
|
|
word |= first;
|
|
|
|
first = second;
|
|
|
|
insql(word, doff, second_dest);
|
|
|
|
checksum += word;
|
|
|
|
stq_u(partial_dest | second_dest, dst);
|
|
|
|
carry = checksum < word;
|
|
|
|
insqh(word, doff, partial_dest);
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
len += doff;
|
|
|
|
checksum += carry;
|
|
|
|
if (len >= 0) {
|
|
|
|
unsigned long second, word;
|
|
|
|
unsigned long second_dest;
|
|
|
|
|
|
|
|
err |= __get_user_u(second, lastsrc);
|
|
|
|
extql(first, soff, word);
|
|
|
|
extqh(second, soff, first);
|
|
|
|
word |= first;
|
|
|
|
first = second;
|
|
|
|
mskql(word, len-doff, word);
|
|
|
|
checksum += word;
|
|
|
|
insql(word, doff, second_dest);
|
|
|
|
carry = checksum < word;
|
|
|
|
stq_u(partial_dest | second_dest, dst);
|
|
|
|
if (len) {
|
|
|
|
ldq_u(second_dest, dst+1);
|
|
|
|
insqh(word, doff, partial_dest);
|
|
|
|
mskqh(second_dest, len, second_dest);
|
|
|
|
stq_u(partial_dest | second_dest, dst+1);
|
|
|
|
}
|
|
|
|
checksum += carry;
|
|
|
|
} else {
|
|
|
|
unsigned long second, word;
|
|
|
|
unsigned long second_dest;
|
|
|
|
|
|
|
|
err |= __get_user_u(second, lastsrc);
|
|
|
|
extql(first, soff, word);
|
|
|
|
extqh(second, soff, first);
|
|
|
|
word |= first;
|
|
|
|
ldq_u(second_dest, dst);
|
|
|
|
mskql(word, len-doff, word);
|
|
|
|
checksum += word;
|
|
|
|
mskqh(second_dest, len, second_dest);
|
|
|
|
carry = checksum < word;
|
|
|
|
insql(word, doff, word);
|
|
|
|
stq_u(partial_dest | word | second_dest, dst);
|
|
|
|
checksum += carry;
|
|
|
|
}
|
2013-11-16 17:45:31 -07:00
|
|
|
if (err && errp) *errp = err;
|
2005-04-16 15:20:36 -07:00
|
|
|
return checksum;
|
|
|
|
}
|
|
|
|
|
2006-11-14 22:14:53 -07:00
|
|
|
__wsum
|
|
|
|
csum_partial_copy_from_user(const void __user *src, void *dst, int len,
|
|
|
|
__wsum sum, int *errp)
|
2005-04-16 15:20:36 -07:00
|
|
|
{
|
2006-11-14 22:14:53 -07:00
|
|
|
unsigned long checksum = (__force u32) sum;
|
2005-04-16 15:20:36 -07:00
|
|
|
unsigned long soff = 7 & (unsigned long) src;
|
|
|
|
unsigned long doff = 7 & (unsigned long) dst;
|
|
|
|
|
|
|
|
if (len) {
|
2013-09-11 14:23:18 -07:00
|
|
|
if (!access_ok(VERIFY_READ, src, len)) {
|
2013-11-16 17:45:31 -07:00
|
|
|
if (errp) *errp = -EFAULT;
|
2013-09-11 14:23:18 -07:00
|
|
|
memset(dst, 0, len);
|
|
|
|
return sum;
|
|
|
|
}
|
2005-04-16 15:20:36 -07:00
|
|
|
if (!doff) {
|
|
|
|
if (!soff)
|
|
|
|
checksum = csum_partial_cfu_aligned(
|
|
|
|
(const unsigned long __user *) src,
|
|
|
|
(unsigned long *) dst,
|
|
|
|
len-8, checksum, errp);
|
|
|
|
else
|
|
|
|
checksum = csum_partial_cfu_dest_aligned(
|
|
|
|
(const unsigned long __user *) src,
|
|
|
|
(unsigned long *) dst,
|
|
|
|
soff, len-8, checksum, errp);
|
|
|
|
} else {
|
|
|
|
unsigned long partial_dest;
|
|
|
|
ldq_u(partial_dest, dst);
|
|
|
|
if (!soff)
|
|
|
|
checksum = csum_partial_cfu_src_aligned(
|
|
|
|
(const unsigned long __user *) src,
|
|
|
|
(unsigned long *) dst,
|
|
|
|
doff, len-8, checksum,
|
|
|
|
partial_dest, errp);
|
|
|
|
else
|
|
|
|
checksum = csum_partial_cfu_unaligned(
|
|
|
|
(const unsigned long __user *) src,
|
|
|
|
(unsigned long *) dst,
|
|
|
|
soff, doff, len-8, checksum,
|
|
|
|
partial_dest, errp);
|
|
|
|
}
|
|
|
|
checksum = from64to16 (checksum);
|
|
|
|
}
|
2006-11-14 22:14:53 -07:00
|
|
|
return (__force __wsum)checksum;
|
2005-04-16 15:20:36 -07:00
|
|
|
}
|
2016-01-11 07:51:29 -07:00
|
|
|
EXPORT_SYMBOL(csum_partial_copy_from_user);
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2006-11-14 22:14:53 -07:00
|
|
|
__wsum
|
|
|
|
csum_partial_copy_nocheck(const void *src, void *dst, int len, __wsum sum)
|
2005-04-16 15:20:36 -07:00
|
|
|
{
|
2014-01-22 21:04:33 -07:00
|
|
|
__wsum checksum;
|
|
|
|
mm_segment_t oldfs = get_fs();
|
|
|
|
set_fs(KERNEL_DS);
|
|
|
|
checksum = csum_partial_copy_from_user((__force const void __user *)src,
|
|
|
|
dst, len, sum, NULL);
|
|
|
|
set_fs(oldfs);
|
|
|
|
return checksum;
|
2005-04-16 15:20:36 -07:00
|
|
|
}
|
2016-01-11 07:51:29 -07:00
|
|
|
EXPORT_SYMBOL(csum_partial_copy_nocheck);
|