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 10:07:57 -04:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2010-09-22 07:53:15 -04:00
|
|
|
/*
|
|
|
|
* stop-task scheduling class.
|
|
|
|
*
|
|
|
|
* The stop task is the highest priority task in the system, it preempts
|
|
|
|
* everything and will be preempted by nothing.
|
|
|
|
*
|
|
|
|
* See kernel/stop_machine.c
|
|
|
|
*/
|
sched: Clean up and harmonize the coding style of the scheduler code base
A good number of small style inconsistencies have accumulated
in the scheduler core, so do a pass over them to harmonize
all these details:
- fix speling in comments,
- use curly braces for multi-line statements,
- remove unnecessary parentheses from integer literals,
- capitalize consistently,
- remove stray newlines,
- add comments where necessary,
- remove invalid/unnecessary comments,
- align structure definitions and other data types vertically,
- add missing newlines for increased readability,
- fix vertical tabulation where it's misaligned,
- harmonize preprocessor conditional block labeling
and vertical alignment,
- remove line-breaks where they uglify the code,
- add newline after local variable definitions,
No change in functionality:
md5:
1191fa0a890cfa8132156d2959d7e9e2 built-in.o.before.asm
1191fa0a890cfa8132156d2959d7e9e2 built-in.o.after.asm
Cc: Linus Torvalds <torvalds@linux-foundation.org>
Cc: Mike Galbraith <efault@gmx.de>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: linux-kernel@vger.kernel.org
Signed-off-by: Ingo Molnar <mingo@kernel.org>
2018-03-03 08:01:12 -05:00
|
|
|
#include "sched.h"
|
2020-09-24 01:49:20 -04:00
|
|
|
#include "walt/walt.h"
|
2010-09-22 07:53:15 -04:00
|
|
|
|
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
static int
|
2020-06-17 22:48:51 -04:00
|
|
|
#ifdef CONFIG_SCHED_WALT
|
FROMLIST: sched/fair: Use wake_q length as a hint for wake_wide
This patch adds a parameter to select_task_rq, sibling_count_hint
allowing the caller, where it has this information, to inform the
sched_class the number of tasks that are being woken up as part of
the same event.
The wake_q mechanism is one case where this information is available.
select_task_rq_fair can then use the information to detect that it
needs to widen the search space for task placement in order to avoid
overloading the last-level cache domain's CPUs.
* * *
The reason I am investigating this change is the following use case
on ARM big.LITTLE (asymmetrical CPU capacity): 1 task per CPU, which
all repeatedly do X amount of work then
pthread_barrier_wait (i.e. sleep until the last task finishes its X
and hits the barrier). On big.LITTLE, the tasks which get a "big" CPU
finish faster, and then those CPUs pull over the tasks that are still
running:
v CPU v ->time->
-------------
0 (big) 11111 /333
-------------
1 (big) 22222 /444|
-------------
2 (LITTLE) 333333/
-------------
3 (LITTLE) 444444/
-------------
Now when task 4 hits the barrier (at |) and wakes the others up,
there are 4 tasks with prev_cpu=<big> and 0 tasks with
prev_cpu=<little>. want_affine therefore means that we'll only look
in CPUs 0 and 1 (sd_llc), so tasks will be unnecessarily coscheduled
on the bigs until the next load balance, something like this:
v CPU v ->time->
------------------------
0 (big) 11111 /333 31313\33333
------------------------
1 (big) 22222 /444|424\4444444
------------------------
2 (LITTLE) 333333/ \222222
------------------------
3 (LITTLE) 444444/ \1111
------------------------
^^^
underutilization
So, I'm trying to get want_affine = 0 for these tasks.
I don't _think_ any incarnation of the wakee_flips mechanism can help
us here because which task is waker and which tasks are wakees
generally changes with each iteration.
However pthread_barrier_wait (or more accurately FUTEX_WAKE) has the
nice property that we know exactly how many tasks are being woken, so
we can cheat.
It might be a disadvantage that we "widen" _every_ task that's woken in
an event, while select_idle_sibling would work fine for the first
sd_llc_size - 1 tasks.
IIUC, if wake_affine() behaves correctly this trick wouldn't be
necessary on SMP systems, so it might be best guarded by the presence
of SD_ASYM_CPUCAPACITY?
* * *
Final note..
In order to observe "perfect" behaviour for this use case, I also had
to disable the TTWU_QUEUE sched feature. Suppose during the wakeup
above we are working through the work queue and have placed tasks 3
and 2, and are about to place task 1:
v CPU v ->time->
--------------
0 (big) 11111 /333 3
--------------
1 (big) 22222 /444|4
--------------
2 (LITTLE) 333333/ 2
--------------
3 (LITTLE) 444444/ <- Task 1 should go here
--------------
If TTWU_QUEUE is enabled, we will not yet have enqueued task
2 (having instead sent a reschedule IPI) or attached its load to CPU
2. So we are likely to also place task 1 on cpu 2. Disabling
TTWU_QUEUE means that we enqueue task 2 before placing task 1,
solving this issue. TTWU_QUEUE is there to minimise rq lock
contention, and I guess that this contention is less of an issue on
big.LITTLE systems since they have relatively few CPUs, which
suggests the trade-off makes sense here.
Signed-off-by: Brendan Jackman <brendan.jackman@arm.com>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Josef Bacik <josef@toxicpanda.com>
Cc: Joel Fernandes <joelaf@google.com>
Cc: Mike Galbraith <efault@gmx.de>
Cc: Matt Fleming <matt@codeblueprint.co.uk>
( - Applied from https://patchwork.kernel.org/patch/9895261/
- Fixed trivial conflict in kernel/sched/core.c
- Fixed select_task_rq_idle, now in kernel/sched/idle.c
- Fixed trivial conflict in select_task_rq_fair )
Signed-off-by: Quentin Perret <quentin.perret@arm.com>
Change-Id: I3cfc4bf48c3d7feef969db4d22449f4fbb4f795d
[satyap@codeaurora.org: port to 5.4 and fix trivial merge conflicts]
Signed-off-by: Satya Durga Srinivasu Prabhala <satyap@codeaurora.org>
2017-08-11 05:45:58 -04:00
|
|
|
select_task_rq_stop(struct task_struct *p, int cpu, int sd_flag, int flags,
|
|
|
|
int sibling_count_hint)
|
2020-06-17 22:48:51 -04:00
|
|
|
#else
|
|
|
|
select_task_rq_stop(struct task_struct *p, int cpu, int sd_flag, int flags)
|
|
|
|
#endif
|
2010-09-22 07:53:15 -04:00
|
|
|
{
|
|
|
|
return task_cpu(p); /* stop tasks as never migrate */
|
|
|
|
}
|
2019-11-08 05:11:52 -05:00
|
|
|
|
|
|
|
static int
|
|
|
|
balance_stop(struct rq *rq, struct task_struct *prev, struct rq_flags *rf)
|
|
|
|
{
|
|
|
|
return sched_stop_runnable(rq);
|
|
|
|
}
|
2010-09-22 07:53:15 -04:00
|
|
|
#endif /* CONFIG_SMP */
|
|
|
|
|
|
|
|
static void
|
|
|
|
check_preempt_curr_stop(struct rq *rq, struct task_struct *p, int flags)
|
|
|
|
{
|
2010-10-31 07:37:04 -04:00
|
|
|
/* we're never preempted */
|
2010-09-22 07:53:15 -04:00
|
|
|
}
|
|
|
|
|
2019-11-08 08:16:00 -05:00
|
|
|
static void set_next_task_stop(struct rq *rq, struct task_struct *stop, bool first)
|
2019-05-29 16:36:41 -04:00
|
|
|
{
|
|
|
|
stop->se.exec_start = rq_clock_task(rq);
|
|
|
|
}
|
|
|
|
|
2012-02-11 00:05:00 -05:00
|
|
|
static struct task_struct *
|
2016-09-21 09:38:10 -04:00
|
|
|
pick_next_task_stop(struct rq *rq, struct task_struct *prev, struct rq_flags *rf)
|
2010-09-22 07:53:15 -04:00
|
|
|
{
|
2019-05-29 16:36:44 -04:00
|
|
|
WARN_ON_ONCE(prev || rf);
|
|
|
|
|
2019-11-08 05:11:52 -05:00
|
|
|
if (!sched_stop_runnable(rq))
|
2012-02-11 00:05:00 -05:00
|
|
|
return NULL;
|
2010-09-22 07:53:15 -04:00
|
|
|
|
2019-11-08 08:16:00 -05:00
|
|
|
set_next_task_stop(rq, rq->stop, true);
|
2019-11-08 05:11:52 -05:00
|
|
|
return rq->stop;
|
2010-09-22 07:53:15 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
enqueue_task_stop(struct rq *rq, struct task_struct *p, int flags)
|
|
|
|
{
|
2014-05-08 19:00:14 -04:00
|
|
|
add_nr_running(rq, 1);
|
2019-09-09 18:32:44 -04:00
|
|
|
walt_inc_cumulative_runnable_avg(rq, p);
|
2010-09-22 07:53:15 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
dequeue_task_stop(struct rq *rq, struct task_struct *p, int flags)
|
|
|
|
{
|
2014-05-08 19:00:14 -04:00
|
|
|
sub_nr_running(rq, 1);
|
2019-09-09 18:32:44 -04:00
|
|
|
walt_dec_cumulative_runnable_avg(rq, p);
|
2010-09-22 07:53:15 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static void yield_task_stop(struct rq *rq)
|
|
|
|
{
|
|
|
|
BUG(); /* the stop task should never yield, its pointless. */
|
|
|
|
}
|
|
|
|
|
2019-11-08 05:11:52 -05:00
|
|
|
static void put_prev_task_stop(struct rq *rq, struct task_struct *prev)
|
2010-09-22 07:53:15 -04:00
|
|
|
{
|
2012-08-03 23:44:14 -04:00
|
|
|
struct task_struct *curr = rq->curr;
|
|
|
|
u64 delta_exec;
|
|
|
|
|
2013-04-11 19:51:02 -04:00
|
|
|
delta_exec = rq_clock_task(rq) - curr->se.exec_start;
|
2012-08-03 23:44:14 -04:00
|
|
|
if (unlikely((s64)delta_exec < 0))
|
|
|
|
delta_exec = 0;
|
|
|
|
|
|
|
|
schedstat_set(curr->se.statistics.exec_max,
|
|
|
|
max(curr->se.statistics.exec_max, delta_exec));
|
|
|
|
|
|
|
|
curr->se.sum_exec_runtime += delta_exec;
|
|
|
|
account_group_exec_runtime(curr, delta_exec);
|
|
|
|
|
2013-04-11 19:51:02 -04:00
|
|
|
curr->se.exec_start = rq_clock_task(rq);
|
2017-09-25 11:12:04 -04:00
|
|
|
cgroup_account_cputime(curr, delta_exec);
|
2010-09-22 07:53:15 -04:00
|
|
|
}
|
|
|
|
|
2018-02-20 23:17:27 -05:00
|
|
|
/*
|
|
|
|
* scheduler tick hitting a task of our scheduling class.
|
|
|
|
*
|
|
|
|
* NOTE: This function can be called remotely by the tick offload that
|
|
|
|
* goes along full dynticks. Therefore no local assumption can be made
|
|
|
|
* and everything must be accessed through the @rq and @curr passed in
|
|
|
|
* parameters.
|
|
|
|
*/
|
2010-09-22 07:53:15 -04:00
|
|
|
static void task_tick_stop(struct rq *rq, struct task_struct *curr, int queued)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2011-01-17 11:03:27 -05:00
|
|
|
static void switched_to_stop(struct rq *rq, struct task_struct *p)
|
2010-09-22 07:53:15 -04:00
|
|
|
{
|
|
|
|
BUG(); /* its impossible to change to this class */
|
|
|
|
}
|
|
|
|
|
2011-01-17 11:03:27 -05:00
|
|
|
static void
|
|
|
|
prio_changed_stop(struct rq *rq, struct task_struct *p, int oldprio)
|
2010-09-22 07:53:15 -04:00
|
|
|
{
|
|
|
|
BUG(); /* how!?, what priority? */
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int
|
|
|
|
get_rr_interval_stop(struct rq *rq, struct task_struct *task)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-11-23 17:04:52 -05:00
|
|
|
static void update_curr_stop(struct rq *rq)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2010-09-22 07:53:15 -04:00
|
|
|
/*
|
|
|
|
* Simple, special scheduling class for the per-CPU stop tasks:
|
|
|
|
*/
|
2011-10-25 04:00:11 -04:00
|
|
|
const struct sched_class stop_sched_class = {
|
sched/deadline: Add SCHED_DEADLINE structures & implementation
Introduces the data structures, constants and symbols needed for
SCHED_DEADLINE implementation.
Core data structure of SCHED_DEADLINE are defined, along with their
initializers. Hooks for checking if a task belong to the new policy
are also added where they are needed.
Adds a scheduling class, in sched/dl.c and a new policy called
SCHED_DEADLINE. It is an implementation of the Earliest Deadline
First (EDF) scheduling algorithm, augmented with a mechanism (called
Constant Bandwidth Server, CBS) that makes it possible to isolate
the behaviour of tasks between each other.
The typical -deadline task will be made up of a computation phase
(instance) which is activated on a periodic or sporadic fashion. The
expected (maximum) duration of such computation is called the task's
runtime; the time interval by which each instance need to be completed
is called the task's relative deadline. The task's absolute deadline
is dynamically calculated as the time instant a task (better, an
instance) activates plus the relative deadline.
The EDF algorithms selects the task with the smallest absolute
deadline as the one to be executed first, while the CBS ensures each
task to run for at most its runtime every (relative) deadline
length time interval, avoiding any interference between different
tasks (bandwidth isolation).
Thanks to this feature, also tasks that do not strictly comply with
the computational model sketched above can effectively use the new
policy.
To summarize, this patch:
- introduces the data structures, constants and symbols needed;
- implements the core logic of the scheduling algorithm in the new
scheduling class file;
- provides all the glue code between the new scheduling class and
the core scheduler and refines the interactions between sched/dl
and the other existing scheduling classes.
Signed-off-by: Dario Faggioli <raistlin@linux.it>
Signed-off-by: Michael Trimarchi <michael@amarulasolutions.com>
Signed-off-by: Fabio Checconi <fchecconi@gmail.com>
Signed-off-by: Juri Lelli <juri.lelli@gmail.com>
Signed-off-by: Peter Zijlstra <peterz@infradead.org>
Link: http://lkml.kernel.org/r/1383831828-15501-4-git-send-email-juri.lelli@gmail.com
Signed-off-by: Ingo Molnar <mingo@kernel.org>
2013-11-28 05:14:43 -05:00
|
|
|
.next = &dl_sched_class,
|
2010-09-22 07:53:15 -04:00
|
|
|
|
|
|
|
.enqueue_task = enqueue_task_stop,
|
|
|
|
.dequeue_task = dequeue_task_stop,
|
|
|
|
.yield_task = yield_task_stop,
|
|
|
|
|
|
|
|
.check_preempt_curr = check_preempt_curr_stop,
|
|
|
|
|
|
|
|
.pick_next_task = pick_next_task_stop,
|
|
|
|
.put_prev_task = put_prev_task_stop,
|
2019-05-29 16:36:41 -04:00
|
|
|
.set_next_task = set_next_task_stop,
|
2010-09-22 07:53:15 -04:00
|
|
|
|
|
|
|
#ifdef CONFIG_SMP
|
2019-11-08 05:11:52 -05:00
|
|
|
.balance = balance_stop,
|
2010-09-22 07:53:15 -04:00
|
|
|
.select_task_rq = select_task_rq_stop,
|
2015-05-15 11:43:35 -04:00
|
|
|
.set_cpus_allowed = set_cpus_allowed_common,
|
2010-09-22 07:53:15 -04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
.task_tick = task_tick_stop,
|
|
|
|
|
|
|
|
.get_rr_interval = get_rr_interval_stop,
|
|
|
|
|
|
|
|
.prio_changed = prio_changed_stop,
|
|
|
|
.switched_to = switched_to_stop,
|
2014-11-23 17:04:52 -05:00
|
|
|
.update_curr = update_curr_stop,
|
2010-09-22 07:53:15 -04:00
|
|
|
};
|