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 */
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
|
* arch/alpha/lib/ev6-clear_user.S
|
|
|
|
|
* 21264 version contributed by Rick Gorton <rick.gorton@alpha-processor.com>
|
|
|
|
|
*
|
|
|
|
|
* Zero user space, handling exceptions as we go.
|
|
|
|
|
*
|
|
|
|
|
* We have to make sure that $0 is always up-to-date and contains the
|
|
|
|
|
* right "bytes left to zero" value (and that it is updated only _after_
|
|
|
|
|
* a successful copy). There is also some rather minor exception setup
|
|
|
|
|
* stuff.
|
|
|
|
|
*
|
|
|
|
|
* Much of the information about 21264 scheduling/coding comes from:
|
|
|
|
|
* Compiler Writer's Guide for the Alpha 21264
|
|
|
|
|
* abbreviated as 'CWG' in other comments here
|
|
|
|
|
* ftp.digital.com/pub/Digital/info/semiconductor/literature/dsc-library.html
|
|
|
|
|
* Scheduling notation:
|
|
|
|
|
* E - either cluster
|
|
|
|
|
* U - upper subcluster; U0 - subcluster U0; U1 - subcluster U1
|
|
|
|
|
* L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1
|
|
|
|
|
* Try not to change the actual algorithm if possible for consistency.
|
|
|
|
|
* Determining actual stalls (other than slotting) doesn't appear to be easy to do.
|
|
|
|
|
* From perusing the source code context where this routine is called, it is
|
|
|
|
|
* a fair assumption that significant fractions of entire pages are zeroed, so
|
|
|
|
|
* it's going to be worth the effort to hand-unroll a big loop, and use wh64.
|
|
|
|
|
* ASSUMPTION:
|
|
|
|
|
* The believed purpose of only updating $0 after a store is that a signal
|
|
|
|
|
* may come along during the execution of this chunk of code, and we don't
|
|
|
|
|
* want to leave a hole (and we also want to avoid repeating lots of work)
|
|
|
|
|
*/
|
|
|
|
|
|
2016-01-11 22:51:29 +08:00
|
|
|
#include <asm/export.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
/* Allow an exception for an insn; exit if we get one. */
|
|
|
|
|
#define EX(x,y...) \
|
|
|
|
|
99: x,##y; \
|
|
|
|
|
.section __ex_table,"a"; \
|
|
|
|
|
.long 99b - .; \
|
|
|
|
|
lda $31, $exception-99b($31); \
|
|
|
|
|
.previous
|
|
|
|
|
|
|
|
|
|
.set noat
|
|
|
|
|
.set noreorder
|
|
|
|
|
.align 4
|
|
|
|
|
|
2016-12-25 09:26:18 +08:00
|
|
|
.globl __clear_user
|
|
|
|
|
.ent __clear_user
|
|
|
|
|
.frame $30, 0, $26
|
2005-04-17 06:20:36 +08:00
|
|
|
.prologue 0
|
|
|
|
|
|
|
|
|
|
# Pipeline info : Slotting & Comments
|
2016-12-25 09:26:18 +08:00
|
|
|
__clear_user:
|
|
|
|
|
and $17, $17, $0
|
|
|
|
|
and $16, 7, $4 # .. E .. .. : find dest head misalignment
|
2005-04-17 06:20:36 +08:00
|
|
|
beq $0, $zerolength # U .. .. .. : U L U L
|
|
|
|
|
|
|
|
|
|
addq $0, $4, $1 # .. .. .. E : bias counter
|
|
|
|
|
and $1, 7, $2 # .. .. E .. : number of misaligned bytes in tail
|
|
|
|
|
# Note - we never actually use $2, so this is a moot computation
|
|
|
|
|
# and we can rewrite this later...
|
|
|
|
|
srl $1, 3, $1 # .. E .. .. : number of quadwords to clear
|
|
|
|
|
beq $4, $headalign # U .. .. .. : U L U L
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Head is not aligned. Write (8 - $4) bytes to head of destination
|
2016-12-25 09:26:18 +08:00
|
|
|
* This means $16 is known to be misaligned
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2016-12-25 09:26:18 +08:00
|
|
|
EX( ldq_u $5, 0($16) ) # .. .. .. L : load dst word to mask back in
|
2005-04-17 06:20:36 +08:00
|
|
|
beq $1, $onebyte # .. .. U .. : sub-word store?
|
2016-12-25 09:26:18 +08:00
|
|
|
mskql $5, $16, $5 # .. U .. .. : take care of misaligned head
|
|
|
|
|
addq $16, 8, $16 # E .. .. .. : L U U L
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2016-12-25 09:26:18 +08:00
|
|
|
EX( stq_u $5, -8($16) ) # .. .. .. L :
|
2005-04-17 06:20:36 +08:00
|
|
|
subq $1, 1, $1 # .. .. E .. :
|
|
|
|
|
addq $0, $4, $0 # .. E .. .. : bytes left -= 8 - misalignment
|
|
|
|
|
subq $0, 8, $0 # E .. .. .. : U L U L
|
|
|
|
|
|
|
|
|
|
.align 4
|
|
|
|
|
/*
|
|
|
|
|
* (The .align directive ought to be a moot point)
|
|
|
|
|
* values upon initial entry to the loop
|
|
|
|
|
* $1 is number of quadwords to clear (zero is a valid value)
|
|
|
|
|
* $2 is number of trailing bytes (0..7) ($2 never used...)
|
2016-12-25 09:26:18 +08:00
|
|
|
* $16 is known to be aligned 0mod8
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
|
$headalign:
|
|
|
|
|
subq $1, 16, $4 # .. .. .. E : If < 16, we can not use the huge loop
|
2016-12-25 09:26:18 +08:00
|
|
|
and $16, 0x3f, $2 # .. .. E .. : Forward work for huge loop
|
2005-04-17 06:20:36 +08:00
|
|
|
subq $2, 0x40, $3 # .. E .. .. : bias counter (huge loop)
|
|
|
|
|
blt $4, $trailquad # U .. .. .. : U L U L
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* We know that we're going to do at least 16 quads, which means we are
|
|
|
|
|
* going to be able to use the large block clear loop at least once.
|
|
|
|
|
* Figure out how many quads we need to clear before we are 0mod64 aligned
|
|
|
|
|
* so we can use the wh64 instruction.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
nop # .. .. .. E
|
|
|
|
|
nop # .. .. E ..
|
|
|
|
|
nop # .. E .. ..
|
|
|
|
|
beq $3, $bigalign # U .. .. .. : U L U L : Aligned 0mod64
|
|
|
|
|
|
|
|
|
|
$alignmod64:
|
2016-12-25 09:26:18 +08:00
|
|
|
EX( stq_u $31, 0($16) ) # .. .. .. L
|
2005-04-17 06:20:36 +08:00
|
|
|
addq $3, 8, $3 # .. .. E ..
|
|
|
|
|
subq $0, 8, $0 # .. E .. ..
|
|
|
|
|
nop # E .. .. .. : U L U L
|
|
|
|
|
|
|
|
|
|
nop # .. .. .. E
|
|
|
|
|
subq $1, 1, $1 # .. .. E ..
|
2016-12-25 09:26:18 +08:00
|
|
|
addq $16, 8, $16 # .. E .. ..
|
2005-04-17 06:20:36 +08:00
|
|
|
blt $3, $alignmod64 # U .. .. .. : U L U L
|
|
|
|
|
|
|
|
|
|
$bigalign:
|
|
|
|
|
/*
|
|
|
|
|
* $0 is the number of bytes left
|
|
|
|
|
* $1 is the number of quads left
|
2016-12-25 09:26:18 +08:00
|
|
|
* $16 is aligned 0mod64
|
2005-04-17 06:20:36 +08:00
|
|
|
* we know that we'll be taking a minimum of one trip through
|
|
|
|
|
* CWG Section 3.7.6: do not expect a sustained store rate of > 1/cycle
|
|
|
|
|
* We are _not_ going to update $0 after every single store. That
|
|
|
|
|
* would be silly, because there will be cross-cluster dependencies
|
|
|
|
|
* no matter how the code is scheduled. By doing it in slightly
|
|
|
|
|
* staggered fashion, we can still do this loop in 5 fetches
|
|
|
|
|
* The worse case will be doing two extra quads in some future execution,
|
|
|
|
|
* in the event of an interrupted clear.
|
|
|
|
|
* Assumes the wh64 needs to be for 2 trips through the loop in the future
|
|
|
|
|
* The wh64 is issued on for the starting destination address for trip +2
|
|
|
|
|
* through the loop, and if there are less than two trips left, the target
|
|
|
|
|
* address will be for the current trip.
|
|
|
|
|
*/
|
|
|
|
|
nop # E :
|
|
|
|
|
nop # E :
|
|
|
|
|
nop # E :
|
2016-12-25 09:26:18 +08:00
|
|
|
bis $16,$16,$3 # E : U L U L : Initial wh64 address is dest
|
2005-04-17 06:20:36 +08:00
|
|
|
/* This might actually help for the current trip... */
|
|
|
|
|
|
|
|
|
|
$do_wh64:
|
|
|
|
|
wh64 ($3) # .. .. .. L1 : memory subsystem hint
|
|
|
|
|
subq $1, 16, $4 # .. .. E .. : Forward calculation - repeat the loop?
|
2016-12-25 09:26:18 +08:00
|
|
|
EX( stq_u $31, 0($16) ) # .. L .. ..
|
2005-04-17 06:20:36 +08:00
|
|
|
subq $0, 8, $0 # E .. .. .. : U L U L
|
|
|
|
|
|
2016-12-25 09:26:18 +08:00
|
|
|
addq $16, 128, $3 # E : Target address of wh64
|
|
|
|
|
EX( stq_u $31, 8($16) ) # L :
|
|
|
|
|
EX( stq_u $31, 16($16) ) # L :
|
2005-04-17 06:20:36 +08:00
|
|
|
subq $0, 16, $0 # E : U L L U
|
|
|
|
|
|
|
|
|
|
nop # E :
|
2016-12-25 09:26:18 +08:00
|
|
|
EX( stq_u $31, 24($16) ) # L :
|
|
|
|
|
EX( stq_u $31, 32($16) ) # L :
|
2005-04-17 06:20:36 +08:00
|
|
|
subq $0, 168, $5 # E : U L L U : two trips through the loop left?
|
|
|
|
|
/* 168 = 192 - 24, since we've already completed some stores */
|
|
|
|
|
|
|
|
|
|
subq $0, 16, $0 # E :
|
2016-12-25 09:26:18 +08:00
|
|
|
EX( stq_u $31, 40($16) ) # L :
|
|
|
|
|
EX( stq_u $31, 48($16) ) # L :
|
|
|
|
|
cmovlt $5, $16, $3 # E : U L L U : Latency 2, extra mapping cycle
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
subq $1, 8, $1 # E :
|
|
|
|
|
subq $0, 16, $0 # E :
|
2016-12-25 09:26:18 +08:00
|
|
|
EX( stq_u $31, 56($16) ) # L :
|
2005-04-17 06:20:36 +08:00
|
|
|
nop # E : U L U L
|
|
|
|
|
|
|
|
|
|
nop # E :
|
|
|
|
|
subq $0, 8, $0 # E :
|
2016-12-25 09:26:18 +08:00
|
|
|
addq $16, 64, $16 # E :
|
2005-04-17 06:20:36 +08:00
|
|
|
bge $4, $do_wh64 # U : U L U L
|
|
|
|
|
|
|
|
|
|
$trailquad:
|
|
|
|
|
# zero to 16 quadwords left to store, plus any trailing bytes
|
|
|
|
|
# $1 is the number of quadwords left to go.
|
|
|
|
|
#
|
|
|
|
|
nop # .. .. .. E
|
|
|
|
|
nop # .. .. E ..
|
|
|
|
|
nop # .. E .. ..
|
|
|
|
|
beq $1, $trailbytes # U .. .. .. : U L U L : Only 0..7 bytes to go
|
|
|
|
|
|
|
|
|
|
$onequad:
|
2016-12-25 09:26:18 +08:00
|
|
|
EX( stq_u $31, 0($16) ) # .. .. .. L
|
2005-04-17 06:20:36 +08:00
|
|
|
subq $1, 1, $1 # .. .. E ..
|
|
|
|
|
subq $0, 8, $0 # .. E .. ..
|
|
|
|
|
nop # E .. .. .. : U L U L
|
|
|
|
|
|
|
|
|
|
nop # .. .. .. E
|
|
|
|
|
nop # .. .. E ..
|
2016-12-25 09:26:18 +08:00
|
|
|
addq $16, 8, $16 # .. E .. ..
|
2005-04-17 06:20:36 +08:00
|
|
|
bgt $1, $onequad # U .. .. .. : U L U L
|
|
|
|
|
|
|
|
|
|
# We have an unknown number of bytes left to go.
|
|
|
|
|
$trailbytes:
|
|
|
|
|
nop # .. .. .. E
|
|
|
|
|
nop # .. .. E ..
|
|
|
|
|
nop # .. E .. ..
|
|
|
|
|
beq $0, $zerolength # U .. .. .. : U L U L
|
|
|
|
|
|
|
|
|
|
# $0 contains the number of bytes left to copy (0..31)
|
|
|
|
|
# so we will use $0 as the loop counter
|
|
|
|
|
# We know for a fact that $0 > 0 zero due to previous context
|
|
|
|
|
$onebyte:
|
2016-12-25 09:26:18 +08:00
|
|
|
EX( stb $31, 0($16) ) # .. .. .. L
|
2005-04-17 06:20:36 +08:00
|
|
|
subq $0, 1, $0 # .. .. E .. :
|
2016-12-25 09:26:18 +08:00
|
|
|
addq $16, 1, $16 # .. E .. .. :
|
2005-04-17 06:20:36 +08:00
|
|
|
bgt $0, $onebyte # U .. .. .. : U L U L
|
|
|
|
|
|
|
|
|
|
$zerolength:
|
|
|
|
|
$exception: # Destination for exception recovery(?)
|
|
|
|
|
nop # .. .. .. E :
|
|
|
|
|
nop # .. .. E .. :
|
|
|
|
|
nop # .. E .. .. :
|
2016-12-25 09:26:18 +08:00
|
|
|
ret $31, ($26), 1 # L0 .. .. .. : L U L U
|
|
|
|
|
.end __clear_user
|
|
|
|
|
EXPORT_SYMBOL(__clear_user)
|