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
|
|
|
#ifndef _LINUX_TIME_H
|
|
|
|
#define _LINUX_TIME_H
|
|
|
|
|
2007-07-21 19:37:37 +08:00
|
|
|
# include <linux/cache.h>
|
2008-06-12 16:47:56 +08:00
|
|
|
# include <linux/math64.h>
|
2014-07-17 05:03:58 +08:00
|
|
|
# include <linux/time64.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-10-16 13:02:06 +08:00
|
|
|
extern struct timezone sys_tz;
|
|
|
|
|
2017-06-25 02:45:02 +08:00
|
|
|
int get_timespec64(struct timespec64 *ts,
|
2018-03-14 12:03:31 +08:00
|
|
|
const struct __kernel_timespec __user *uts);
|
2017-06-25 02:45:02 +08:00
|
|
|
int put_timespec64(const struct timespec64 *ts,
|
2018-03-14 12:03:31 +08:00
|
|
|
struct __kernel_timespec __user *uts);
|
2017-06-25 02:45:03 +08:00
|
|
|
int get_itimerspec64(struct itimerspec64 *it,
|
2018-06-17 13:11:42 +08:00
|
|
|
const struct __kernel_itimerspec __user *uit);
|
2017-06-25 02:45:03 +08:00
|
|
|
int put_itimerspec64(const struct itimerspec64 *it,
|
2018-06-17 13:11:42 +08:00
|
|
|
struct __kernel_itimerspec __user *uit);
|
2017-06-25 02:45:02 +08:00
|
|
|
|
2014-11-18 19:15:18 +08:00
|
|
|
extern time64_t mktime64(const unsigned int year, const unsigned int mon,
|
|
|
|
const unsigned int day, const unsigned int hour,
|
|
|
|
const unsigned int min, const unsigned int sec);
|
|
|
|
|
2019-10-26 03:37:43 +08:00
|
|
|
#ifdef CONFIG_POSIX_TIMERS
|
|
|
|
extern void clear_itimer(void);
|
|
|
|
#else
|
|
|
|
static inline void clear_itimer(void) {}
|
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2017-08-03 10:51:15 +08:00
|
|
|
extern long do_utimes(int dfd, const char __user *filename, struct timespec64 *times, int flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2009-09-24 06:56:10 +08:00
|
|
|
/*
|
|
|
|
* Similar to the struct tm in userspace <time.h>, but it needs to be here so
|
|
|
|
* that the kernel source is self contained.
|
|
|
|
*/
|
|
|
|
struct tm {
|
|
|
|
/*
|
|
|
|
* the number of seconds after the minute, normally in the range
|
|
|
|
* 0 to 59, but can be up to 60 to allow for leap seconds
|
|
|
|
*/
|
|
|
|
int tm_sec;
|
|
|
|
/* the number of minutes after the hour, in the range 0 to 59*/
|
|
|
|
int tm_min;
|
|
|
|
/* the number of hours past midnight, in the range 0 to 23 */
|
|
|
|
int tm_hour;
|
|
|
|
/* the day of the month, in the range 1 to 31 */
|
|
|
|
int tm_mday;
|
|
|
|
/* the number of months since January, in the range 0 to 11 */
|
|
|
|
int tm_mon;
|
|
|
|
/* the number of years since 1900 */
|
|
|
|
long tm_year;
|
|
|
|
/* the number of days since Sunday, in the range 0 to 6 */
|
|
|
|
int tm_wday;
|
|
|
|
/* the number of days since January 1, in the range 0 to 365 */
|
|
|
|
int tm_yday;
|
|
|
|
};
|
|
|
|
|
2016-06-09 13:04:59 +08:00
|
|
|
void time64_to_tm(time64_t totalsecs, int offset, struct tm *result);
|
|
|
|
|
2017-10-19 19:14:47 +08:00
|
|
|
# include <linux/time32.h>
|
2012-02-08 13:09:05 +08:00
|
|
|
|
2017-06-25 02:45:03 +08:00
|
|
|
static inline bool itimerspec64_valid(const struct itimerspec64 *its)
|
|
|
|
{
|
|
|
|
if (!timespec64_valid(&(its->it_interval)) ||
|
|
|
|
!timespec64_valid(&(its->it_value)))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2017-08-31 23:09:45 +08:00
|
|
|
/**
|
|
|
|
* time_after32 - compare two 32-bit relative times
|
|
|
|
* @a: the time which may be after @b
|
|
|
|
* @b: the time which may be before @a
|
|
|
|
*
|
|
|
|
* time_after32(a, b) returns true if the time @a is after time @b.
|
|
|
|
* time_before32(b, a) returns true if the time @b is before time @a.
|
|
|
|
*
|
|
|
|
* Similar to time_after(), compare two 32-bit timestamps for relative
|
|
|
|
* times. This is useful for comparing 32-bit seconds values that can't
|
|
|
|
* be converted to 64-bit values (e.g. due to disk format or wire protocol
|
|
|
|
* issues) when it is known that the times are less than 68 years apart.
|
|
|
|
*/
|
|
|
|
#define time_after32(a, b) ((s32)((u32)(b) - (u32)(a)) < 0)
|
|
|
|
#define time_before32(b, a) time_after32(a, b)
|
tcp: fix rejected syncookies due to stale timestamps
If no synflood happens for a long enough period of time, then the
synflood timestamp isn't refreshed and jiffies can advance so much
that time_after32() can't accurately compare them any more.
Therefore, we can end up in a situation where time_after32(now,
last_overflow + HZ) returns false, just because these two values are
too far apart. In that case, the synflood timestamp isn't updated as
it should be, which can trick tcp_synq_no_recent_overflow() into
rejecting valid syncookies.
For example, let's consider the following scenario on a system
with HZ=1000:
* The synflood timestamp is 0, either because that's the timestamp
of the last synflood or, more commonly, because we're working with
a freshly created socket.
* We receive a new SYN, which triggers synflood protection. Let's say
that this happens when jiffies == 2147484649 (that is,
'synflood timestamp' + HZ + 2^31 + 1).
* Then tcp_synq_overflow() doesn't update the synflood timestamp,
because time_after32(2147484649, 1000) returns false.
With:
- 2147484649: the value of jiffies, aka. 'now'.
- 1000: the value of 'last_overflow' + HZ.
* A bit later, we receive the ACK completing the 3WHS. But
cookie_v[46]_check() rejects it because tcp_synq_no_recent_overflow()
says that we're not under synflood. That's because
time_after32(2147484649, 120000) returns false.
With:
- 2147484649: the value of jiffies, aka. 'now'.
- 120000: the value of 'last_overflow' + TCP_SYNCOOKIE_VALID.
Of course, in reality jiffies would have increased a bit, but this
condition will last for the next 119 seconds, which is far enough
to accommodate for jiffie's growth.
Fix this by updating the overflow timestamp whenever jiffies isn't
within the [last_overflow, last_overflow + HZ] range. That shouldn't
have any performance impact since the update still happens at most once
per second.
Now we're guaranteed to have fresh timestamps while under synflood, so
tcp_synq_no_recent_overflow() can safely use it with time_after32() in
such situations.
Stale timestamps can still make tcp_synq_no_recent_overflow() return
the wrong verdict when not under synflood. This will be handled in the
next patch.
For 64 bits architectures, the problem was introduced with the
conversion of ->tw_ts_recent_stamp to 32 bits integer by commit
cca9bab1b72c ("tcp: use monotonic timestamps for PAWS").
The problem has always been there on 32 bits architectures.
Fixes: cca9bab1b72c ("tcp: use monotonic timestamps for PAWS")
Fixes: 1da177e4c3f4 ("Linux-2.6.12-rc2")
Signed-off-by: Guillaume Nault <gnault@redhat.com>
Signed-off-by: Eric Dumazet <edumazet@google.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2019-12-06 19:38:36 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* time_between32 - check if a 32-bit timestamp is within a given time range
|
|
|
|
* @t: the time which may be within [l,h]
|
|
|
|
* @l: the lower bound of the range
|
|
|
|
* @h: the higher bound of the range
|
|
|
|
*
|
|
|
|
* time_before32(t, l, h) returns true if @l <= @t <= @h. All operands are
|
|
|
|
* treated as 32-bit integers.
|
|
|
|
*
|
|
|
|
* Equivalent to !(time_before32(@t, @l) || time_after32(@t, @h)).
|
|
|
|
*/
|
|
|
|
#define time_between32(t, l, h) ((u32)(h) - (u32)(l) >= (u32)(t) - (u32)(l))
|
2019-11-12 09:27:09 +08:00
|
|
|
|
2020-03-20 22:53:35 +08:00
|
|
|
# include <vdso/time.h>
|
2019-11-12 09:27:09 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif
|