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 14:07:57 +00:00
|
|
|
# SPDX-License-Identifier: GPL-2.0
|
2005-04-16 22:20:36 +00:00
|
|
|
config PARISC
|
|
|
|
|
def_bool y
|
uaccess: generalize access_ok()
There are many different ways that access_ok() is defined across
architectures, but in the end, they all just compare against the
user_addr_max() value or they accept anything.
Provide one definition that works for most architectures, checking
against TASK_SIZE_MAX for user processes or skipping the check inside
of uaccess_kernel() sections.
For architectures without CONFIG_SET_FS(), this should be the fastest
check, as it comes down to a single comparison of a pointer against a
compile-time constant, while the architecture specific versions tend to
do something more complex for historic reasons or get something wrong.
Type checking for __user annotations is handled inconsistently across
architectures, but this is easily simplified as well by using an inline
function that takes a 'const void __user *' argument. A handful of
callers need an extra __user annotation for this.
Some architectures had trick to use 33-bit or 65-bit arithmetic on the
addresses to calculate the overflow, however this simpler version uses
fewer registers, which means it can produce better object code in the
end despite needing a second (statically predicted) branch.
Reviewed-by: Christoph Hellwig <hch@lst.de>
Acked-by: Mark Rutland <mark.rutland@arm.com> [arm64, asm-generic]
Acked-by: Geert Uytterhoeven <geert@linux-m68k.org>
Acked-by: Stafford Horne <shorne@gmail.com>
Acked-by: Dinh Nguyen <dinguyen@kernel.org>
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
2022-02-15 16:55:04 +00:00
|
|
|
select ALTERNATE_USER_ADDRESS_SPACE
|
32-bit userspace ABI: introduce ARCH_32BIT_OFF_T config option
All new 32-bit architectures should have 64-bit userspace off_t type, but
existing architectures has 32-bit ones.
To enforce the rule, new config option is added to arch/Kconfig that defaults
ARCH_32BIT_OFF_T to be disabled for new 32-bit architectures. All existing
32-bit architectures enable it explicitly.
New option affects force_o_largefile() behaviour. Namely, if userspace
off_t is 64-bits long, we have no reason to reject user to open big files.
Note that even if architectures has only 64-bit off_t in the kernel
(arc, c6x, h8300, hexagon, nios2, openrisc, and unicore32),
a libc may use 32-bit off_t, and therefore want to limit the file size
to 4GB unless specified differently in the open flags.
Signed-off-by: Yury Norov <ynorov@caviumnetworks.com>
Acked-by: Arnd Bergmann <arnd@arndb.de>
Signed-off-by: Yury Norov <ynorov@marvell.com>
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
2018-05-16 08:18:49 +00:00
|
|
|
select ARCH_32BIT_OFF_T if !64BIT
|
2013-10-08 02:14:01 +00:00
|
|
|
select ARCH_MIGHT_HAVE_PC_PARPORT
|
2016-04-13 20:27:22 +00:00
|
|
|
select HAVE_FUNCTION_TRACER
|
|
|
|
|
select HAVE_FUNCTION_GRAPH_TRACER
|
2016-04-13 20:44:54 +00:00
|
|
|
select HAVE_SYSCALL_TRACEPOINTS
|
2013-02-26 23:37:12 +00:00
|
|
|
select ARCH_WANT_FRAME_POINTERS
|
2016-10-15 22:02:27 +00:00
|
|
|
select ARCH_HAS_ELF_RANDOMIZE
|
2017-02-07 00:31:57 +00:00
|
|
|
select ARCH_HAS_STRICT_KERNEL_RWX
|
2022-06-26 09:50:43 +00:00
|
|
|
select ARCH_HAS_STRICT_MODULE_RWX
|
2017-08-04 21:46:16 +00:00
|
|
|
select ARCH_HAS_UBSAN_SANITIZE_ALL
|
2021-12-08 10:06:52 +00:00
|
|
|
select ARCH_HAS_PTE_SPECIAL
|
2018-11-09 08:51:00 +00:00
|
|
|
select ARCH_NO_SG_CHAIN
|
2021-05-05 01:38:13 +00:00
|
|
|
select ARCH_SUPPORTS_HUGETLBFS if PA20
|
2017-08-04 17:23:53 +00:00
|
|
|
select ARCH_SUPPORTS_MEMORY_FAILURE
|
2021-05-04 12:49:14 +00:00
|
|
|
select ARCH_STACKWALK
|
2022-03-17 21:36:30 +00:00
|
|
|
select ARCH_HAS_DEBUG_VM_PGTABLE
|
2021-05-04 12:49:14 +00:00
|
|
|
select HAVE_RELIABLE_STACKTRACE
|
2020-07-08 07:30:00 +00:00
|
|
|
select DMA_OPS
|
2008-09-10 14:24:07 +00:00
|
|
|
select RTC_CLASS
|
2009-02-19 15:46:49 +00:00
|
|
|
select RTC_DRV_GENERIC
|
2008-12-13 10:49:41 +00:00
|
|
|
select INIT_ALL_POSSIBLE
|
2009-03-25 14:09:10 +00:00
|
|
|
select BUG
|
2019-12-04 00:46:31 +00:00
|
|
|
select BUILDTIME_TABLE_SORT
|
2018-11-15 19:05:32 +00:00
|
|
|
select HAVE_PCI
|
perf: Do the big rename: Performance Counters -> Performance Events
Bye-bye Performance Counters, welcome Performance Events!
In the past few months the perfcounters subsystem has grown out its
initial role of counting hardware events, and has become (and is
becoming) a much broader generic event enumeration, reporting, logging,
monitoring, analysis facility.
Naming its core object 'perf_counter' and naming the subsystem
'perfcounters' has become more and more of a misnomer. With pending
code like hw-breakpoints support the 'counter' name is less and
less appropriate.
All in one, we've decided to rename the subsystem to 'performance
events' and to propagate this rename through all fields, variables
and API names. (in an ABI compatible fashion)
The word 'event' is also a bit shorter than 'counter' - which makes
it slightly more convenient to write/handle as well.
Thanks goes to Stephane Eranian who first observed this misnomer and
suggested a rename.
User-space tooling and ABI compatibility is not affected - this patch
should be function-invariant. (Also, defconfigs were not touched to
keep the size down.)
This patch has been generated via the following script:
FILES=$(find * -type f | grep -vE 'oprofile|[^K]config')
sed -i \
-e 's/PERF_EVENT_/PERF_RECORD_/g' \
-e 's/PERF_COUNTER/PERF_EVENT/g' \
-e 's/perf_counter/perf_event/g' \
-e 's/nb_counters/nb_events/g' \
-e 's/swcounter/swevent/g' \
-e 's/tpcounter_event/tp_event/g' \
$FILES
for N in $(find . -name perf_counter.[ch]); do
M=$(echo $N | sed 's/perf_counter/perf_event/g')
mv $N $M
done
FILES=$(find . -name perf_event.*)
sed -i \
-e 's/COUNTER_MASK/REG_MASK/g' \
-e 's/COUNTER/EVENT/g' \
-e 's/\<event\>/event_id/g' \
-e 's/counter/event/g' \
-e 's/Counter/Event/g' \
$FILES
... to keep it as correct as possible. This script can also be
used by anyone who has pending perfcounters patches - it converts
a Linux kernel tree over to the new naming. We tried to time this
change to the point in time where the amount of pending patches
is the smallest: the end of the merge window.
Namespace clashes were fixed up in a preparatory patch - and some
stylistic fallout will be fixed up in a subsequent patch.
( NOTE: 'counters' are still the proper terminology when we deal
with hardware registers - and these sed scripts are a bit
over-eager in renaming them. I've undone some of that, but
in case there's something left where 'counter' would be
better than 'event' we can undo that on an individual basis
instead of touching an otherwise nicely automated patch. )
Suggested-by: Stephane Eranian <eranian@google.com>
Acked-by: Peter Zijlstra <a.p.zijlstra@chello.nl>
Acked-by: Paul Mackerras <paulus@samba.org>
Reviewed-by: Arjan van de Ven <arjan@linux.intel.com>
Cc: Mike Galbraith <efault@gmx.de>
Cc: Arnaldo Carvalho de Melo <acme@redhat.com>
Cc: Frederic Weisbecker <fweisbec@gmail.com>
Cc: Steven Rostedt <rostedt@goodmis.org>
Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Cc: David Howells <dhowells@redhat.com>
Cc: Kyle McMartin <kyle@mcmartin.ca>
Cc: Martin Schwidefsky <schwidefsky@de.ibm.com>
Cc: "David S. Miller" <davem@davemloft.net>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: <linux-arch@vger.kernel.org>
LKML-Reference: <new-submission>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-09-21 10:02:48 +00:00
|
|
|
select HAVE_PERF_EVENTS
|
2017-08-20 08:52:22 +00:00
|
|
|
select HAVE_KERNEL_BZIP2
|
|
|
|
|
select HAVE_KERNEL_GZIP
|
|
|
|
|
select HAVE_KERNEL_LZ4
|
|
|
|
|
select HAVE_KERNEL_LZMA
|
|
|
|
|
select HAVE_KERNEL_LZO
|
|
|
|
|
select HAVE_KERNEL_XZ
|
2009-07-02 17:10:29 +00:00
|
|
|
select GENERIC_ATOMIC64 if !64BIT
|
2011-01-19 19:38:30 +00:00
|
|
|
select GENERIC_IRQ_PROBE
|
2011-11-24 19:11:16 +00:00
|
|
|
select GENERIC_PCI_IOMAP
|
2011-07-13 05:14:22 +00:00
|
|
|
select ARCH_HAVE_NMI_SAFE_CMPXCHG
|
2012-04-20 13:05:56 +00:00
|
|
|
select GENERIC_SMP_IDLE_THREAD
|
2022-03-24 18:46:50 +00:00
|
|
|
select GENERIC_ARCH_TOPOLOGY if SMP
|
2022-04-01 20:24:20 +00:00
|
|
|
select GENERIC_CPU_DEVICES if !SMP
|
2020-12-19 11:45:40 +00:00
|
|
|
select GENERIC_LIB_DEVMEM_IS_ALLOWED
|
2013-01-18 09:42:24 +00:00
|
|
|
select SYSCTL_ARCH_UNALIGN_ALLOW
|
2014-05-05 16:07:12 +00:00
|
|
|
select SYSCTL_EXCEPTION_TRACE
|
2012-09-28 05:01:03 +00:00
|
|
|
select HAVE_MOD_ARCH_SPECIFIC
|
2013-03-07 04:48:16 +00:00
|
|
|
select VIRT_TO_BUS
|
2012-09-28 05:01:03 +00:00
|
|
|
select MODULES_USE_ELF_RELA
|
2012-10-26 23:59:16 +00:00
|
|
|
select CLONE_BACKWARDS
|
2013-01-18 06:44:22 +00:00
|
|
|
select TTY # Needed for pdc_cons.c
|
2013-07-01 20:04:42 +00:00
|
|
|
select HAVE_DEBUG_STACKOVERFLOW
|
2014-02-25 09:16:24 +00:00
|
|
|
select HAVE_ARCH_AUDITSYSCALL
|
parisc: Add <asm/hash.h>
PA-RISC is interesting; integer multiplies are implemented in the
FPU, so are painful in the kernel. But it tries to be friendly to
shift-and-add sequences for constant multiplies.
__hash_32 is implemented using the same shift-and-add sequence as
Microblaze, just scheduled for the PA7100. (It's 2-way superscalar
but in-order, like the Pentium.)
hash_64 was tricky, but a suggestion from Jason Thong allowed a
good solution by breaking up the multiplier. After a lot of manual
optimization, I found a 19-instruction sequence for the multiply that
can be executed in 10 cycles using only 4 temporaries.
(The PA8xxx can issue 4 instructions per cycle, but 2 must be ALU ops
and 2 must be loads/stores. And the final add can't be paired.)
An alternative considered, but ultimately not used, was Thomas Wang's
64-to-32-bit integer hash. At 12 instructions, it's smaller, but they're
all sequentially dependent, so it has longer latency.
https://web.archive.org/web/2011/http://www.concentric.net/~Ttwang/tech/inthash.htm
http://burtleburtle.net/bob/hash/integer.html
Signed-off-by: George Spelvin <linux@sciencehorizons.net>
Cc: Helge Deller <deller@gmx.de>
Cc: linux-parisc@vger.kernel.org
Signed-off-by: Helge Deller <deller@gmx.de>
2016-06-07 23:45:06 +00:00
|
|
|
select HAVE_ARCH_HASH
|
2019-05-03 21:51:00 +00:00
|
|
|
select HAVE_ARCH_JUMP_LABEL
|
|
|
|
|
select HAVE_ARCH_JUMP_LABEL_RELATIVE
|
2021-10-09 20:21:49 +00:00
|
|
|
select HAVE_ARCH_KFENCE
|
2016-03-30 12:14:31 +00:00
|
|
|
select HAVE_ARCH_SECCOMP_FILTER
|
2016-04-01 20:40:53 +00:00
|
|
|
select HAVE_ARCH_TRACEHOOK
|
2018-06-28 20:47:11 +00:00
|
|
|
select HAVE_REGS_AND_STACK_ACCESS_API
|
2016-11-22 17:08:30 +00:00
|
|
|
select GENERIC_SCHED_CLOCK
|
2022-03-25 13:31:08 +00:00
|
|
|
select GENERIC_IRQ_MIGRATION if SMP
|
2016-11-22 17:08:30 +00:00
|
|
|
select HAVE_UNSTABLE_SCHED_CLOCK if SMP
|
2020-09-24 13:30:34 +00:00
|
|
|
select LEGACY_TIMER_TICK
|
lib/GCD.c: use binary GCD algorithm instead of Euclidean
The binary GCD algorithm is based on the following facts:
1. If a and b are all evens, then gcd(a,b) = 2 * gcd(a/2, b/2)
2. If a is even and b is odd, then gcd(a,b) = gcd(a/2, b)
3. If a and b are all odds, then gcd(a,b) = gcd((a-b)/2, b) = gcd((a+b)/2, b)
Even on x86 machines with reasonable division hardware, the binary
algorithm runs about 25% faster (80% the execution time) than the
division-based Euclidian algorithm.
On platforms like Alpha and ARMv6 where division is a function call to
emulation code, it's even more significant.
There are two variants of the code here, depending on whether a fast
__ffs (find least significant set bit) instruction is available. This
allows the unpredictable branches in the bit-at-a-time shifting loop to
be eliminated.
If fast __ffs is not available, the "even/odd" GCD variant is used.
I use the following code to benchmark:
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
#define swap(a, b) \
do { \
a ^= b; \
b ^= a; \
a ^= b; \
} while (0)
unsigned long gcd0(unsigned long a, unsigned long b)
{
unsigned long r;
if (a < b) {
swap(a, b);
}
if (b == 0)
return a;
while ((r = a % b) != 0) {
a = b;
b = r;
}
return b;
}
unsigned long gcd1(unsigned long a, unsigned long b)
{
unsigned long r = a | b;
if (!a || !b)
return r;
b >>= __builtin_ctzl(b);
for (;;) {
a >>= __builtin_ctzl(a);
if (a == b)
return a << __builtin_ctzl(r);
if (a < b)
swap(a, b);
a -= b;
}
}
unsigned long gcd2(unsigned long a, unsigned long b)
{
unsigned long r = a | b;
if (!a || !b)
return r;
r &= -r;
while (!(b & r))
b >>= 1;
for (;;) {
while (!(a & r))
a >>= 1;
if (a == b)
return a;
if (a < b)
swap(a, b);
a -= b;
a >>= 1;
if (a & r)
a += b;
a >>= 1;
}
}
unsigned long gcd3(unsigned long a, unsigned long b)
{
unsigned long r = a | b;
if (!a || !b)
return r;
b >>= __builtin_ctzl(b);
if (b == 1)
return r & -r;
for (;;) {
a >>= __builtin_ctzl(a);
if (a == 1)
return r & -r;
if (a == b)
return a << __builtin_ctzl(r);
if (a < b)
swap(a, b);
a -= b;
}
}
unsigned long gcd4(unsigned long a, unsigned long b)
{
unsigned long r = a | b;
if (!a || !b)
return r;
r &= -r;
while (!(b & r))
b >>= 1;
if (b == r)
return r;
for (;;) {
while (!(a & r))
a >>= 1;
if (a == r)
return r;
if (a == b)
return a;
if (a < b)
swap(a, b);
a -= b;
a >>= 1;
if (a & r)
a += b;
a >>= 1;
}
}
static unsigned long (*gcd_func[])(unsigned long a, unsigned long b) = {
gcd0, gcd1, gcd2, gcd3, gcd4,
};
#define TEST_ENTRIES (sizeof(gcd_func) / sizeof(gcd_func[0]))
#if defined(__x86_64__)
#define rdtscll(val) do { \
unsigned long __a,__d; \
__asm__ __volatile__("rdtsc" : "=a" (__a), "=d" (__d)); \
(val) = ((unsigned long long)__a) | (((unsigned long long)__d)<<32); \
} while(0)
static unsigned long long benchmark_gcd_func(unsigned long (*gcd)(unsigned long, unsigned long),
unsigned long a, unsigned long b, unsigned long *res)
{
unsigned long long start, end;
unsigned long long ret;
unsigned long gcd_res;
rdtscll(start);
gcd_res = gcd(a, b);
rdtscll(end);
if (end >= start)
ret = end - start;
else
ret = ~0ULL - start + 1 + end;
*res = gcd_res;
return ret;
}
#else
static inline struct timespec read_time(void)
{
struct timespec time;
clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &time);
return time;
}
static inline unsigned long long diff_time(struct timespec start, struct timespec end)
{
struct timespec temp;
if ((end.tv_nsec - start.tv_nsec) < 0) {
temp.tv_sec = end.tv_sec - start.tv_sec - 1;
temp.tv_nsec = 1000000000ULL + end.tv_nsec - start.tv_nsec;
} else {
temp.tv_sec = end.tv_sec - start.tv_sec;
temp.tv_nsec = end.tv_nsec - start.tv_nsec;
}
return temp.tv_sec * 1000000000ULL + temp.tv_nsec;
}
static unsigned long long benchmark_gcd_func(unsigned long (*gcd)(unsigned long, unsigned long),
unsigned long a, unsigned long b, unsigned long *res)
{
struct timespec start, end;
unsigned long gcd_res;
start = read_time();
gcd_res = gcd(a, b);
end = read_time();
*res = gcd_res;
return diff_time(start, end);
}
#endif
static inline unsigned long get_rand()
{
if (sizeof(long) == 8)
return (unsigned long)rand() << 32 | rand();
else
return rand();
}
int main(int argc, char **argv)
{
unsigned int seed = time(0);
int loops = 100;
int repeats = 1000;
unsigned long (*res)[TEST_ENTRIES];
unsigned long long elapsed[TEST_ENTRIES];
int i, j, k;
for (;;) {
int opt = getopt(argc, argv, "n:r:s:");
/* End condition always first */
if (opt == -1)
break;
switch (opt) {
case 'n':
loops = atoi(optarg);
break;
case 'r':
repeats = atoi(optarg);
break;
case 's':
seed = strtoul(optarg, NULL, 10);
break;
default:
/* You won't actually get here. */
break;
}
}
res = malloc(sizeof(unsigned long) * TEST_ENTRIES * loops);
memset(elapsed, 0, sizeof(elapsed));
srand(seed);
for (j = 0; j < loops; j++) {
unsigned long a = get_rand();
/* Do we have args? */
unsigned long b = argc > optind ? strtoul(argv[optind], NULL, 10) : get_rand();
unsigned long long min_elapsed[TEST_ENTRIES];
for (k = 0; k < repeats; k++) {
for (i = 0; i < TEST_ENTRIES; i++) {
unsigned long long tmp = benchmark_gcd_func(gcd_func[i], a, b, &res[j][i]);
if (k == 0 || min_elapsed[i] > tmp)
min_elapsed[i] = tmp;
}
}
for (i = 0; i < TEST_ENTRIES; i++)
elapsed[i] += min_elapsed[i];
}
for (i = 0; i < TEST_ENTRIES; i++)
printf("gcd%d: elapsed %llu\n", i, elapsed[i]);
k = 0;
srand(seed);
for (j = 0; j < loops; j++) {
unsigned long a = get_rand();
unsigned long b = argc > optind ? strtoul(argv[optind], NULL, 10) : get_rand();
for (i = 1; i < TEST_ENTRIES; i++) {
if (res[j][i] != res[j][0])
break;
}
if (i < TEST_ENTRIES) {
if (k == 0) {
k = 1;
fprintf(stderr, "Error:\n");
}
fprintf(stderr, "gcd(%lu, %lu): ", a, b);
for (i = 0; i < TEST_ENTRIES; i++)
fprintf(stderr, "%ld%s", res[j][i], i < TEST_ENTRIES - 1 ? ", " : "\n");
}
}
if (k == 0)
fprintf(stderr, "PASS\n");
free(res);
return 0;
}
Compiled with "-O2", on "VirtualBox 4.4.0-22-generic #38-Ubuntu x86_64" got:
zhaoxiuzeng@zhaoxiuzeng-VirtualBox:~/develop$ ./gcd -r 500000 -n 10
gcd0: elapsed 10174
gcd1: elapsed 2120
gcd2: elapsed 2902
gcd3: elapsed 2039
gcd4: elapsed 2812
PASS
zhaoxiuzeng@zhaoxiuzeng-VirtualBox:~/develop$ ./gcd -r 500000 -n 10
gcd0: elapsed 9309
gcd1: elapsed 2280
gcd2: elapsed 2822
gcd3: elapsed 2217
gcd4: elapsed 2710
PASS
zhaoxiuzeng@zhaoxiuzeng-VirtualBox:~/develop$ ./gcd -r 500000 -n 10
gcd0: elapsed 9589
gcd1: elapsed 2098
gcd2: elapsed 2815
gcd3: elapsed 2030
gcd4: elapsed 2718
PASS
zhaoxiuzeng@zhaoxiuzeng-VirtualBox:~/develop$ ./gcd -r 500000 -n 10
gcd0: elapsed 9914
gcd1: elapsed 2309
gcd2: elapsed 2779
gcd3: elapsed 2228
gcd4: elapsed 2709
PASS
[akpm@linux-foundation.org: avoid #defining a CONFIG_ variable]
Signed-off-by: Zhaoxiu Zeng <zhaoxiu.zeng@gmail.com>
Signed-off-by: George Spelvin <linux@horizon.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2016-05-21 00:03:57 +00:00
|
|
|
select CPU_NO_EFFICIENT_FFS
|
2021-10-15 08:41:03 +00:00
|
|
|
select THREAD_INFO_IN_TASK
|
2018-05-09 04:53:49 +00:00
|
|
|
select NEED_DMA_MAP_STATE
|
2018-04-05 07:44:52 +00:00
|
|
|
select NEED_SG_DMA_LENGTH
|
2019-04-04 19:14:10 +00:00
|
|
|
select HAVE_ARCH_KGDB
|
2019-04-07 18:10:58 +00:00
|
|
|
select HAVE_KPROBES
|
2019-04-09 17:30:28 +00:00
|
|
|
select HAVE_KRETPROBES
|
parisc: add dynamic ftrace
This patch implements dynamic ftrace for PA-RISC. The required mcount
call sequences can get pretty long, so instead of patching the
whole call sequence out of the functions, we are using
-fpatchable-function-entry from gcc. This puts a configurable amount of
NOPS before/at the start of the function. Taking do_sys_open() as example,
which would look like this when the call is patched out:
1036b248: 08 00 02 40 nop
1036b24c: 08 00 02 40 nop
1036b250: 08 00 02 40 nop
1036b254: 08 00 02 40 nop
1036b258 <do_sys_open>:
1036b258: 08 00 02 40 nop
1036b25c: 08 03 02 41 copy r3,r1
1036b260: 6b c2 3f d9 stw rp,-14(sp)
1036b264: 08 1e 02 43 copy sp,r3
1036b268: 6f c1 01 00 stw,ma r1,80(sp)
When ftrace gets enabled for this function the kernel will patch these
NOPs to:
1036b248: 10 19 57 20 <address of ftrace>
1036b24c: 6f c1 00 80 stw,ma r1,40(sp)
1036b250: 48 21 3f d1 ldw -18(r1),r1
1036b254: e8 20 c0 02 bv,n r0(r1)
1036b258 <do_sys_open>:
1036b258: e8 3f 1f df b,l,n .-c,r1
1036b25c: 08 03 02 41 copy r3,r1
1036b260: 6b c2 3f d9 stw rp,-14(sp)
1036b264: 08 1e 02 43 copy sp,r3
1036b268: 6f c1 01 00 stw,ma r1,80(sp)
So the first NOP in do_sys_open() will be patched to jump backwards into
some minimal trampoline code which pushes a stackframe, saves r1 which
holds the return address, loads the address of the real ftrace function,
and branches to that location. For 64 Bit things are getting a bit more
complicated (and longer) because we must make sure that the address of
ftrace location is 8 byte aligned, and the offset passed to ldd for
fetching the address is 8 byte aligned as well.
Note that gcc has a bug which misplaces the function label, and needs a
patch to make dynamic ftrace work. See
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90751 for details.
Signed-off-by: Sven Schnelle <svens@stackframe.org>
Signed-off-by: Helge Deller <deller@gmx.de>
2019-06-05 20:32:22 +00:00
|
|
|
select HAVE_DYNAMIC_FTRACE if $(cc-option,-fpatchable-function-entry=1,1)
|
|
|
|
|
select HAVE_FTRACE_MCOUNT_RECORD if HAVE_DYNAMIC_FTRACE
|
2021-02-24 22:57:06 +00:00
|
|
|
select FTRACE_MCOUNT_USE_PATCHABLE_FUNCTION_ENTRY if DYNAMIC_FTRACE
|
2019-07-23 20:37:52 +00:00
|
|
|
select HAVE_KPROBES_ON_FTRACE
|
|
|
|
|
select HAVE_DYNAMIC_FTRACE_WITH_REGS
|
2021-02-09 23:40:52 +00:00
|
|
|
select HAVE_SOFTIRQ_ON_OWN_STACK if IRQSTACKS
|
2021-07-31 05:22:32 +00:00
|
|
|
select TRACE_IRQFLAGS_SUPPORT
|
2022-02-15 12:41:02 +00:00
|
|
|
select HAVE_FUNCTION_DESCRIPTORS if 64BIT
|
2011-01-19 19:38:30 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
help
|
|
|
|
|
The PA-RISC microprocessor is designed by Hewlett-Packard and used
|
|
|
|
|
in many of their workstations & servers (HP9000 700 and 800 series,
|
|
|
|
|
and later HP3000 series). The PA-RISC Linux project home page is
|
2020-06-01 21:00:52 +00:00
|
|
|
at <https://parisc.wiki.kernel.org>.
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2017-07-06 16:34:19 +00:00
|
|
|
config CPU_BIG_ENDIAN
|
|
|
|
|
def_bool y
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config MMU
|
|
|
|
|
def_bool y
|
|
|
|
|
|
|
|
|
|
config STACK_GROWSUP
|
|
|
|
|
def_bool y
|
|
|
|
|
|
2008-01-30 12:31:20 +00:00
|
|
|
config GENERIC_LOCKBREAK
|
|
|
|
|
bool
|
|
|
|
|
default y
|
2019-10-15 19:18:02 +00:00
|
|
|
depends on SMP && PREEMPTION
|
2008-01-30 12:31:20 +00:00
|
|
|
|
2006-12-08 10:37:49 +00:00
|
|
|
config ARCH_HAS_ILOG2_U32
|
|
|
|
|
bool
|
|
|
|
|
default n
|
|
|
|
|
|
|
|
|
|
config ARCH_HAS_ILOG2_U64
|
|
|
|
|
bool
|
|
|
|
|
default n
|
|
|
|
|
|
2006-12-16 15:16:50 +00:00
|
|
|
config GENERIC_BUG
|
|
|
|
|
bool
|
|
|
|
|
default y
|
|
|
|
|
depends on BUG
|
|
|
|
|
|
[PATCH] bitops: parisc: use generic bitops
- remove __{,test_and_}{set,clear,change}_bit() and test_bit()
- remove ffz()
- remove generic_fls64()
- remove generic_hweight{32,16,8}()
- remove generic_hweight64()
- remove sched_find_first_bit()
- remove find_{next,first}{,_zero}_bit()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: Kyle McMartin <kyle@mcmartin.ca>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 09:39:31 +00:00
|
|
|
config GENERIC_HWEIGHT
|
|
|
|
|
bool
|
|
|
|
|
default y
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config GENERIC_CALIBRATE_DELAY
|
|
|
|
|
bool
|
|
|
|
|
default y
|
|
|
|
|
|
2006-02-14 21:53:15 +00:00
|
|
|
config TIME_LOW_RES
|
|
|
|
|
bool
|
|
|
|
|
depends on SMP
|
|
|
|
|
default y
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
# unless you want to implement ACPI on PA-RISC ... ;-)
|
|
|
|
|
config PM
|
|
|
|
|
bool
|
|
|
|
|
|
2009-02-06 20:50:39 +00:00
|
|
|
config STACKTRACE_SUPPORT
|
|
|
|
|
def_bool y
|
|
|
|
|
|
2005-05-04 04:39:22 +00:00
|
|
|
config ISA_DMA_API
|
|
|
|
|
bool
|
|
|
|
|
|
2005-09-06 00:48:42 +00:00
|
|
|
config ARCH_MAY_HAVE_PC_FDC
|
|
|
|
|
bool
|
2005-10-22 02:52:46 +00:00
|
|
|
depends on BROKEN
|
2005-09-06 00:48:42 +00:00
|
|
|
default y
|
|
|
|
|
|
2015-04-14 22:45:54 +00:00
|
|
|
config PGTABLE_LEVELS
|
|
|
|
|
int
|
|
|
|
|
default 3 if 64BIT && PARISC_PAGE_SIZE_4KB
|
|
|
|
|
default 2
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
menu "Processor type and features"
|
|
|
|
|
|
|
|
|
|
choice
|
|
|
|
|
prompt "Processor type"
|
|
|
|
|
default PA7000
|
|
|
|
|
|
|
|
|
|
config PA7000
|
|
|
|
|
bool "PA7000/PA7100"
|
2020-06-13 16:50:22 +00:00
|
|
|
help
|
2005-04-16 22:20:36 +00:00
|
|
|
This is the processor type of your CPU. This information is
|
|
|
|
|
used for optimizing purposes. In order to compile a kernel
|
|
|
|
|
that can run on all 32-bit PA CPUs (albeit not optimally fast),
|
|
|
|
|
you can specify "PA7000" here.
|
|
|
|
|
|
|
|
|
|
Specifying "PA8000" here will allow you to select a 64-bit kernel
|
|
|
|
|
which is required on some machines.
|
|
|
|
|
|
|
|
|
|
config PA7100LC
|
|
|
|
|
bool "PA7100LC"
|
|
|
|
|
help
|
|
|
|
|
Select this option for the PCX-L processor, as used in the
|
|
|
|
|
712, 715/64, 715/80, 715/100, 715/100XC, 725/100, 743, 748,
|
|
|
|
|
D200, D210, D300, D310 and E-class
|
|
|
|
|
|
|
|
|
|
config PA7200
|
|
|
|
|
bool "PA7200"
|
|
|
|
|
help
|
|
|
|
|
Select this option for the PCX-T' processor, as used in the
|
|
|
|
|
C100, C110, J100, J110, J210XC, D250, D260, D350, D360,
|
|
|
|
|
K100, K200, K210, K220, K400, K410 and K420
|
|
|
|
|
|
|
|
|
|
config PA7300LC
|
|
|
|
|
bool "PA7300LC"
|
|
|
|
|
help
|
|
|
|
|
Select this option for the PCX-L2 processor, as used in the
|
|
|
|
|
744, A180, B132L, B160L, B180L, C132L, C160L, C180L,
|
|
|
|
|
D220, D230, D320 and D330.
|
|
|
|
|
|
|
|
|
|
config PA8X00
|
|
|
|
|
bool "PA8000 and up"
|
|
|
|
|
help
|
|
|
|
|
Select this option for PCX-U to PCX-W2 processors.
|
|
|
|
|
|
|
|
|
|
endchoice
|
|
|
|
|
|
|
|
|
|
# Define implied options from the CPU selection here
|
|
|
|
|
|
|
|
|
|
config PA20
|
|
|
|
|
def_bool y
|
|
|
|
|
depends on PA8X00
|
|
|
|
|
|
|
|
|
|
config PA11
|
|
|
|
|
def_bool y
|
|
|
|
|
depends on PA7000 || PA7100LC || PA7200 || PA7300LC
|
2018-06-19 07:04:55 +00:00
|
|
|
select ARCH_HAS_SYNC_DMA_FOR_CPU
|
|
|
|
|
select ARCH_HAS_SYNC_DMA_FOR_DEVICE
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
config PREFETCH
|
|
|
|
|
def_bool y
|
2006-08-14 00:37:26 +00:00
|
|
|
depends on PA8X00 || PA7200
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2021-03-02 20:07:07 +00:00
|
|
|
config PARISC_HUGE_KERNEL
|
|
|
|
|
def_bool y if !MODULES || UBSAN || FTRACE || COMPILE_TEST
|
|
|
|
|
|
2013-01-31 21:44:28 +00:00
|
|
|
config MLONGCALLS
|
2021-03-02 20:07:07 +00:00
|
|
|
def_bool y if PARISC_HUGE_KERNEL
|
|
|
|
|
bool "Enable the -mlong-calls compiler option for big kernels" if !PARISC_HUGE_KERNEL
|
2013-01-31 21:44:28 +00:00
|
|
|
depends on PA8X00
|
|
|
|
|
help
|
|
|
|
|
If you configure the kernel to include many drivers built-in instead
|
|
|
|
|
as modules, the kernel executable may become too big, so that the
|
|
|
|
|
linker will not be able to resolve some long branches and fails to link
|
|
|
|
|
your vmlinux kernel. In that case enabling this option will help you
|
|
|
|
|
to overcome this limit by using the -mlong-calls compiler option.
|
|
|
|
|
|
|
|
|
|
Usually you want to say N here, unless you e.g. want to build
|
|
|
|
|
a kernel which includes all necessary drivers built-in and which can
|
|
|
|
|
be used for TFTP booting without the need to have an initrd ramdisk.
|
|
|
|
|
|
|
|
|
|
Enabling this option will probably slow down your kernel.
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config 64BIT
|
|
|
|
|
bool "64-bit kernel"
|
|
|
|
|
depends on PA8X00
|
|
|
|
|
help
|
|
|
|
|
Enable this if you want to support 64bit kernel on PA-RISC platform.
|
|
|
|
|
|
|
|
|
|
At the moment, only people willing to use more than 2GB of RAM,
|
|
|
|
|
or having a 64bit-only capable PA-RISC machine should say Y here.
|
|
|
|
|
|
|
|
|
|
Since there is no 64bit userland on PA-RISC, there is no point to
|
|
|
|
|
enable this option otherwise. The 64bit kernel is significantly bigger
|
|
|
|
|
and slower than the 32bit one.
|
|
|
|
|
|
2006-04-20 20:40:23 +00:00
|
|
|
choice
|
|
|
|
|
prompt "Kernel page size"
|
2011-10-12 12:51:12 +00:00
|
|
|
default PARISC_PAGE_SIZE_4KB
|
2006-04-20 20:40:23 +00:00
|
|
|
|
|
|
|
|
config PARISC_PAGE_SIZE_4KB
|
|
|
|
|
bool "4KB"
|
|
|
|
|
help
|
|
|
|
|
This lets you select the page size of the kernel. For best
|
|
|
|
|
performance, a page size of 16KB is recommended. For best
|
|
|
|
|
compatibility with 32bit applications, a page size of 4KB should be
|
|
|
|
|
selected (the vast majority of 32bit binaries work perfectly fine
|
|
|
|
|
with a larger page size).
|
|
|
|
|
|
|
|
|
|
4KB For best 32bit compatibility
|
|
|
|
|
16KB For best performance
|
|
|
|
|
64KB For best performance, might give more overhead.
|
|
|
|
|
|
|
|
|
|
If you don't know what to do, choose 4KB.
|
|
|
|
|
|
|
|
|
|
config PARISC_PAGE_SIZE_16KB
|
2013-01-17 02:53:21 +00:00
|
|
|
bool "16KB"
|
2021-10-09 20:21:49 +00:00
|
|
|
depends on PA8X00 && BROKEN && !KFENCE
|
2006-04-20 20:40:23 +00:00
|
|
|
|
|
|
|
|
config PARISC_PAGE_SIZE_64KB
|
2013-01-17 02:53:21 +00:00
|
|
|
bool "64KB"
|
2021-10-09 20:21:49 +00:00
|
|
|
depends on PA8X00 && BROKEN && !KFENCE
|
2006-04-20 20:40:23 +00:00
|
|
|
|
|
|
|
|
endchoice
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config SMP
|
|
|
|
|
bool "Symmetric multi-processing support"
|
2020-06-13 16:50:22 +00:00
|
|
|
help
|
2005-04-16 22:20:36 +00:00
|
|
|
This enables support for systems with more than one CPU. If you have
|
2014-01-23 23:55:29 +00:00
|
|
|
a system with only one CPU, say N. If you have a system with more
|
|
|
|
|
than one CPU, say Y.
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2014-01-23 23:55:29 +00:00
|
|
|
If you say N here, the kernel will run on uni- and multiprocessor
|
2018-03-13 19:56:16 +00:00
|
|
|
machines, but will use only one CPU of a multiprocessor machine.
|
|
|
|
|
On a uniprocessor machine, the kernel will run faster if you say N.
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2019-06-27 17:56:51 +00:00
|
|
|
See also <file:Documentation/admin-guide/lockup-watchdogs.rst> and the SMP-HOWTO
|
2020-07-13 18:15:25 +00:00
|
|
|
available at <https://www.tldp.org/docs.html#howto>.
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
If you don't know what to do here, say N.
|
2013-05-07 20:25:42 +00:00
|
|
|
|
2017-09-21 19:55:01 +00:00
|
|
|
config SCHED_MC
|
|
|
|
|
bool "Multi-core scheduler support"
|
2022-03-24 18:46:50 +00:00
|
|
|
depends on GENERIC_ARCH_TOPOLOGY && PA8X00
|
2017-09-21 19:55:01 +00:00
|
|
|
help
|
|
|
|
|
Multi-core scheduler support improves the CPU scheduler's decision
|
|
|
|
|
making when dealing with multi-core CPU chips at a cost of slightly
|
|
|
|
|
increased overhead in some places. If unsure say N here.
|
|
|
|
|
|
2013-05-07 20:25:42 +00:00
|
|
|
config IRQSTACKS
|
|
|
|
|
bool "Use separate kernel stacks when processing interrupts"
|
2013-05-10 21:24:01 +00:00
|
|
|
default y
|
2013-05-07 20:25:42 +00:00
|
|
|
help
|
|
|
|
|
If you say Y here the kernel will use separate kernel stacks
|
|
|
|
|
for handling hard and soft interrupts. This can help avoid
|
|
|
|
|
overflowing the process kernel stacks.
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2021-02-12 15:38:52 +00:00
|
|
|
config TLB_PTLOCK
|
|
|
|
|
bool "Use page table locks in TLB fault handler"
|
|
|
|
|
depends on SMP
|
|
|
|
|
default n
|
|
|
|
|
help
|
|
|
|
|
Select this option to enable page table locking in the TLB
|
|
|
|
|
fault handler. This ensures that page table entries are
|
|
|
|
|
updated consistently on SMP machines at the expense of some
|
|
|
|
|
loss in performance.
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config HOTPLUG_CPU
|
|
|
|
|
bool
|
|
|
|
|
default y if SMP
|
|
|
|
|
|
2006-01-28 06:59:36 +00:00
|
|
|
config ARCH_SELECT_MEMORY_MODEL
|
|
|
|
|
def_bool y
|
|
|
|
|
depends on 64BIT
|
|
|
|
|
|
2019-04-09 19:52:35 +00:00
|
|
|
config ARCH_SPARSEMEM_ENABLE
|
2006-01-28 06:59:36 +00:00
|
|
|
def_bool y
|
|
|
|
|
depends on 64BIT
|
|
|
|
|
|
|
|
|
|
config ARCH_FLATMEM_ENABLE
|
|
|
|
|
def_bool y
|
|
|
|
|
|
2019-04-09 19:52:35 +00:00
|
|
|
config ARCH_SPARSEMEM_DEFAULT
|
2006-01-28 06:59:36 +00:00
|
|
|
def_bool y
|
2019-04-09 19:52:35 +00:00
|
|
|
depends on ARCH_SPARSEMEM_ENABLE
|
2006-04-11 05:53:53 +00:00
|
|
|
|
2005-10-22 02:52:46 +00:00
|
|
|
source "kernel/Kconfig.hz"
|
2005-06-23 07:07:43 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config COMPAT
|
|
|
|
|
def_bool y
|
|
|
|
|
depends on 64BIT
|
|
|
|
|
|
2013-10-15 17:25:46 +00:00
|
|
|
config AUDIT_ARCH
|
|
|
|
|
def_bool y
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config NR_CPUS
|
|
|
|
|
int "Maximum number of CPUs (2-32)"
|
|
|
|
|
range 2 32
|
|
|
|
|
depends on SMP
|
2022-01-11 10:54:48 +00:00
|
|
|
default "4" if 64BIT
|
|
|
|
|
default "16"
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2019-09-08 09:33:04 +00:00
|
|
|
config KEXEC
|
|
|
|
|
bool "Kexec system call"
|
|
|
|
|
select KEXEC_CORE
|
|
|
|
|
help
|
|
|
|
|
kexec is a system call that implements the ability to shutdown your
|
|
|
|
|
current kernel, and to start another kernel. It is like a reboot
|
|
|
|
|
but it is independent of the system firmware. And like a reboot
|
|
|
|
|
you can start any kernel with it, not just Linux.
|
|
|
|
|
|
|
|
|
|
It is an ongoing process to be certain the hardware in a machine
|
|
|
|
|
shutdown, so do not be surprised if this code does not
|
|
|
|
|
initially work for you.
|
|
|
|
|
|
2019-09-08 09:33:06 +00:00
|
|
|
config KEXEC_FILE
|
|
|
|
|
bool "kexec file based system call"
|
|
|
|
|
select KEXEC_CORE
|
|
|
|
|
select KEXEC_ELF
|
|
|
|
|
help
|
|
|
|
|
This enables the kexec_file_load() System call. This is
|
|
|
|
|
file based and takes file descriptors as system call argument
|
|
|
|
|
for kernel and initramfs as opposed to list of segments as
|
|
|
|
|
accepted by previous system call.
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
endmenu
|
|
|
|
|
|
|
|
|
|
source "drivers/parisc/Kconfig"
|
