mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-24 23:34:40 +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>
317 lines
8.6 KiB
C
317 lines
8.6 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
/* calibrate.c: default delay calibration
|
|
*
|
|
* Excised from init/main.c
|
|
* Copyright (C) 1991, 1992 Linus Torvalds
|
|
*/
|
|
|
|
#include <linux/jiffies.h>
|
|
#include <linux/delay.h>
|
|
#include <linux/init.h>
|
|
#include <linux/timex.h>
|
|
#include <linux/smp.h>
|
|
#include <linux/percpu.h>
|
|
|
|
unsigned long lpj_fine;
|
|
unsigned long preset_lpj;
|
|
static int __init lpj_setup(char *str)
|
|
{
|
|
preset_lpj = simple_strtoul(str,NULL,0);
|
|
return 1;
|
|
}
|
|
|
|
__setup("lpj=", lpj_setup);
|
|
|
|
#ifdef ARCH_HAS_READ_CURRENT_TIMER
|
|
|
|
/* This routine uses the read_current_timer() routine and gets the
|
|
* loops per jiffy directly, instead of guessing it using delay().
|
|
* Also, this code tries to handle non-maskable asynchronous events
|
|
* (like SMIs)
|
|
*/
|
|
#define DELAY_CALIBRATION_TICKS ((HZ < 100) ? 1 : (HZ/100))
|
|
#define MAX_DIRECT_CALIBRATION_RETRIES 5
|
|
|
|
static unsigned long calibrate_delay_direct(void)
|
|
{
|
|
unsigned long pre_start, start, post_start;
|
|
unsigned long pre_end, end, post_end;
|
|
unsigned long start_jiffies;
|
|
unsigned long timer_rate_min, timer_rate_max;
|
|
unsigned long good_timer_sum = 0;
|
|
unsigned long good_timer_count = 0;
|
|
unsigned long measured_times[MAX_DIRECT_CALIBRATION_RETRIES];
|
|
int max = -1; /* index of measured_times with max/min values or not set */
|
|
int min = -1;
|
|
int i;
|
|
|
|
if (read_current_timer(&pre_start) < 0 )
|
|
return 0;
|
|
|
|
/*
|
|
* A simple loop like
|
|
* while ( jiffies < start_jiffies+1)
|
|
* start = read_current_timer();
|
|
* will not do. As we don't really know whether jiffy switch
|
|
* happened first or timer_value was read first. And some asynchronous
|
|
* event can happen between these two events introducing errors in lpj.
|
|
*
|
|
* So, we do
|
|
* 1. pre_start <- When we are sure that jiffy switch hasn't happened
|
|
* 2. check jiffy switch
|
|
* 3. start <- timer value before or after jiffy switch
|
|
* 4. post_start <- When we are sure that jiffy switch has happened
|
|
*
|
|
* Note, we don't know anything about order of 2 and 3.
|
|
* Now, by looking at post_start and pre_start difference, we can
|
|
* check whether any asynchronous event happened or not
|
|
*/
|
|
|
|
for (i = 0; i < MAX_DIRECT_CALIBRATION_RETRIES; i++) {
|
|
pre_start = 0;
|
|
read_current_timer(&start);
|
|
start_jiffies = jiffies;
|
|
while (time_before_eq(jiffies, start_jiffies + 1)) {
|
|
pre_start = start;
|
|
read_current_timer(&start);
|
|
}
|
|
read_current_timer(&post_start);
|
|
|
|
pre_end = 0;
|
|
end = post_start;
|
|
while (time_before_eq(jiffies, start_jiffies + 1 +
|
|
DELAY_CALIBRATION_TICKS)) {
|
|
pre_end = end;
|
|
read_current_timer(&end);
|
|
}
|
|
read_current_timer(&post_end);
|
|
|
|
timer_rate_max = (post_end - pre_start) /
|
|
DELAY_CALIBRATION_TICKS;
|
|
timer_rate_min = (pre_end - post_start) /
|
|
DELAY_CALIBRATION_TICKS;
|
|
|
|
/*
|
|
* If the upper limit and lower limit of the timer_rate is
|
|
* >= 12.5% apart, redo calibration.
|
|
*/
|
|
if (start >= post_end)
|
|
printk(KERN_NOTICE "calibrate_delay_direct() ignoring "
|
|
"timer_rate as we had a TSC wrap around"
|
|
" start=%lu >=post_end=%lu\n",
|
|
start, post_end);
|
|
if (start < post_end && pre_start != 0 && pre_end != 0 &&
|
|
(timer_rate_max - timer_rate_min) < (timer_rate_max >> 3)) {
|
|
good_timer_count++;
|
|
good_timer_sum += timer_rate_max;
|
|
measured_times[i] = timer_rate_max;
|
|
if (max < 0 || timer_rate_max > measured_times[max])
|
|
max = i;
|
|
if (min < 0 || timer_rate_max < measured_times[min])
|
|
min = i;
|
|
} else
|
|
measured_times[i] = 0;
|
|
|
|
}
|
|
|
|
/*
|
|
* Find the maximum & minimum - if they differ too much throw out the
|
|
* one with the largest difference from the mean and try again...
|
|
*/
|
|
while (good_timer_count > 1) {
|
|
unsigned long estimate;
|
|
unsigned long maxdiff;
|
|
|
|
/* compute the estimate */
|
|
estimate = (good_timer_sum/good_timer_count);
|
|
maxdiff = estimate >> 3;
|
|
|
|
/* if range is within 12% let's take it */
|
|
if ((measured_times[max] - measured_times[min]) < maxdiff)
|
|
return estimate;
|
|
|
|
/* ok - drop the worse value and try again... */
|
|
good_timer_sum = 0;
|
|
good_timer_count = 0;
|
|
if ((measured_times[max] - estimate) <
|
|
(estimate - measured_times[min])) {
|
|
printk(KERN_NOTICE "calibrate_delay_direct() dropping "
|
|
"min bogoMips estimate %d = %lu\n",
|
|
min, measured_times[min]);
|
|
measured_times[min] = 0;
|
|
min = max;
|
|
} else {
|
|
printk(KERN_NOTICE "calibrate_delay_direct() dropping "
|
|
"max bogoMips estimate %d = %lu\n",
|
|
max, measured_times[max]);
|
|
measured_times[max] = 0;
|
|
max = min;
|
|
}
|
|
|
|
for (i = 0; i < MAX_DIRECT_CALIBRATION_RETRIES; i++) {
|
|
if (measured_times[i] == 0)
|
|
continue;
|
|
good_timer_count++;
|
|
good_timer_sum += measured_times[i];
|
|
if (measured_times[i] < measured_times[min])
|
|
min = i;
|
|
if (measured_times[i] > measured_times[max])
|
|
max = i;
|
|
}
|
|
|
|
}
|
|
|
|
printk(KERN_NOTICE "calibrate_delay_direct() failed to get a good "
|
|
"estimate for loops_per_jiffy.\nProbably due to long platform "
|
|
"interrupts. Consider using \"lpj=\" boot option.\n");
|
|
return 0;
|
|
}
|
|
#else
|
|
static unsigned long calibrate_delay_direct(void)
|
|
{
|
|
return 0;
|
|
}
|
|
#endif
|
|
|
|
/*
|
|
* This is the number of bits of precision for the loops_per_jiffy. Each
|
|
* time we refine our estimate after the first takes 1.5/HZ seconds, so try
|
|
* to start with a good estimate.
|
|
* For the boot cpu we can skip the delay calibration and assign it a value
|
|
* calculated based on the timer frequency.
|
|
* For the rest of the CPUs we cannot assume that the timer frequency is same as
|
|
* the cpu frequency, hence do the calibration for those.
|
|
*/
|
|
#define LPS_PREC 8
|
|
|
|
static unsigned long calibrate_delay_converge(void)
|
|
{
|
|
/* First stage - slowly accelerate to find initial bounds */
|
|
unsigned long lpj, lpj_base, ticks, loopadd, loopadd_base, chop_limit;
|
|
int trials = 0, band = 0, trial_in_band = 0;
|
|
|
|
lpj = (1<<12);
|
|
|
|
/* wait for "start of" clock tick */
|
|
ticks = jiffies;
|
|
while (ticks == jiffies)
|
|
; /* nothing */
|
|
/* Go .. */
|
|
ticks = jiffies;
|
|
do {
|
|
if (++trial_in_band == (1<<band)) {
|
|
++band;
|
|
trial_in_band = 0;
|
|
}
|
|
__delay(lpj * band);
|
|
trials += band;
|
|
} while (ticks == jiffies);
|
|
/*
|
|
* We overshot, so retreat to a clear underestimate. Then estimate
|
|
* the largest likely undershoot. This defines our chop bounds.
|
|
*/
|
|
trials -= band;
|
|
loopadd_base = lpj * band;
|
|
lpj_base = lpj * trials;
|
|
|
|
recalibrate:
|
|
lpj = lpj_base;
|
|
loopadd = loopadd_base;
|
|
|
|
/*
|
|
* Do a binary approximation to get lpj set to
|
|
* equal one clock (up to LPS_PREC bits)
|
|
*/
|
|
chop_limit = lpj >> LPS_PREC;
|
|
while (loopadd > chop_limit) {
|
|
lpj += loopadd;
|
|
ticks = jiffies;
|
|
while (ticks == jiffies)
|
|
; /* nothing */
|
|
ticks = jiffies;
|
|
__delay(lpj);
|
|
if (jiffies != ticks) /* longer than 1 tick */
|
|
lpj -= loopadd;
|
|
loopadd >>= 1;
|
|
}
|
|
/*
|
|
* If we incremented every single time possible, presume we've
|
|
* massively underestimated initially, and retry with a higher
|
|
* start, and larger range. (Only seen on x86_64, due to SMIs)
|
|
*/
|
|
if (lpj + loopadd * 2 == lpj_base + loopadd_base * 2) {
|
|
lpj_base = lpj;
|
|
loopadd_base <<= 2;
|
|
goto recalibrate;
|
|
}
|
|
|
|
return lpj;
|
|
}
|
|
|
|
static DEFINE_PER_CPU(unsigned long, cpu_loops_per_jiffy) = { 0 };
|
|
|
|
/*
|
|
* Check if cpu calibration delay is already known. For example,
|
|
* some processors with multi-core sockets may have all cores
|
|
* with the same calibration delay.
|
|
*
|
|
* Architectures should override this function if a faster calibration
|
|
* method is available.
|
|
*/
|
|
unsigned long __attribute__((weak)) calibrate_delay_is_known(void)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Indicate the cpu delay calibration is done. This can be used by
|
|
* architectures to stop accepting delay timer registrations after this point.
|
|
*/
|
|
|
|
void __attribute__((weak)) calibration_delay_done(void)
|
|
{
|
|
}
|
|
|
|
void calibrate_delay(void)
|
|
{
|
|
unsigned long lpj;
|
|
static bool printed;
|
|
int this_cpu = smp_processor_id();
|
|
|
|
if (per_cpu(cpu_loops_per_jiffy, this_cpu)) {
|
|
lpj = per_cpu(cpu_loops_per_jiffy, this_cpu);
|
|
if (!printed)
|
|
pr_info("Calibrating delay loop (skipped) "
|
|
"already calibrated this CPU");
|
|
} else if (preset_lpj) {
|
|
lpj = preset_lpj;
|
|
if (!printed)
|
|
pr_info("Calibrating delay loop (skipped) "
|
|
"preset value.. ");
|
|
} else if ((!printed) && lpj_fine) {
|
|
lpj = lpj_fine;
|
|
pr_info("Calibrating delay loop (skipped), "
|
|
"value calculated using timer frequency.. ");
|
|
} else if ((lpj = calibrate_delay_is_known())) {
|
|
;
|
|
} else if ((lpj = calibrate_delay_direct()) != 0) {
|
|
if (!printed)
|
|
pr_info("Calibrating delay using timer "
|
|
"specific routine.. ");
|
|
} else {
|
|
if (!printed)
|
|
pr_info("Calibrating delay loop... ");
|
|
lpj = calibrate_delay_converge();
|
|
}
|
|
per_cpu(cpu_loops_per_jiffy, this_cpu) = lpj;
|
|
if (!printed)
|
|
pr_cont("%lu.%02lu BogoMIPS (lpj=%lu)\n",
|
|
lpj/(500000/HZ),
|
|
(lpj/(5000/HZ)) % 100, lpj);
|
|
|
|
loops_per_jiffy = lpj;
|
|
printed = true;
|
|
|
|
calibration_delay_done();
|
|
}
|