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 M32R
|
|
|
|
|
bool
|
|
|
|
|
default y
|
2008-02-09 09:46:40 +00:00
|
|
|
select HAVE_IDE
|
2008-02-02 20:10:34 +00:00
|
|
|
select HAVE_OPROFILE
|
2008-12-13 10:49:41 +00:00
|
|
|
select INIT_ALL_POSSIBLE
|
2009-10-15 00:21:56 +00:00
|
|
|
select HAVE_KERNEL_GZIP
|
|
|
|
|
select HAVE_KERNEL_BZIP2
|
|
|
|
|
select HAVE_KERNEL_LZMA
|
2012-07-30 21:42:46 +00:00
|
|
|
select ARCH_WANT_IPC_PARSE_VERSION
|
2012-10-08 23:28:13 +00:00
|
|
|
select HAVE_DEBUG_BUGVERBOSE
|
2013-03-07 04:48:16 +00:00
|
|
|
select VIRT_TO_BUS
|
2011-01-19 18:17:10 +00:00
|
|
|
select GENERIC_IRQ_PROBE
|
2011-03-24 18:24:55 +00:00
|
|
|
select GENERIC_IRQ_SHOW
|
2011-10-13 14:40:16 +00:00
|
|
|
select GENERIC_ATOMIC64
|
2015-11-20 02:19:29 +00:00
|
|
|
select ARCH_HAS_DEVMEM_IS_ALLOWED
|
2012-05-18 16:45:48 +00:00
|
|
|
select ARCH_USES_GETTIMEOFFSET
|
2012-09-28 05:01:03 +00:00
|
|
|
select MODULES_USE_ELF_RELA
|
2013-07-01 20:04:42 +00:00
|
|
|
select HAVE_DEBUG_STACKOVERFLOW
|
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
|
2018-01-09 15:30:23 +00:00
|
|
|
select DMA_DIRECT_OPS
|
2017-06-28 09:16:57 +00:00
|
|
|
select ARCH_NO_COHERENT_DMA_MMAP if !MMU
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
config SBUS
|
|
|
|
|
bool
|
|
|
|
|
|
|
|
|
|
config GENERIC_ISA_DMA
|
|
|
|
|
bool
|
|
|
|
|
default y
|
|
|
|
|
|
2007-02-10 09:43:14 +00:00
|
|
|
config ZONE_DMA
|
|
|
|
|
bool
|
|
|
|
|
default y
|
|
|
|
|
|
2014-04-07 22:39:19 +00:00
|
|
|
config NO_IOPORT_MAP
|
2007-02-11 15:41:31 +00:00
|
|
|
def_bool y
|
|
|
|
|
|
2007-07-16 06:40:26 +00:00
|
|
|
config NO_DMA
|
2016-12-13 00:40:54 +00:00
|
|
|
def_bool n
|
2007-07-16 06:40:26 +00:00
|
|
|
|
avoid overflows in kernel/time.c
When the conversion factor between jiffies and milli- or microseconds is
not a single multiply or divide, as for the case of HZ == 300, we currently
do a multiply followed by a divide. The intervening result, however, is
subject to overflows, especially since the fraction is not simplified (for
HZ == 300, we multiply by 300 and divide by 1000).
This is exposed to the user when passing a large timeout to poll(), for
example.
This patch replaces the multiply-divide with a reciprocal multiplication on
32-bit platforms. When the input is an unsigned long, there is no portable
way to do this on 64-bit platforms there is no portable way to do this
since it requires a 128-bit intermediate result (which gcc does support on
64-bit platforms but may generate libgcc calls, e.g. on 64-bit s390), but
since the output is a 32-bit integer in the cases affected, just simplify
the multiply-divide (*3/10 instead of *300/1000).
The reciprocal multiply used can have off-by-one errors in the upper half
of the valid output range. This could be avoided at the expense of having
to deal with a potential 65-bit intermediate result. Since the intent is
to avoid overflow problems and most of the other time conversions are only
semiexact, the off-by-one errors were considered an acceptable tradeoff.
At Ralf Baechle's suggestion, this version uses a Perl script to compute
the necessary constants. We already have dependencies on Perl for kernel
compiles. This does, however, require the Perl module Math::BigInt, which
is included in the standard Perl distribution starting with version 5.8.0.
In order to support older versions of Perl, include a table of canned
constants in the script itself, and structure the script so that
Math::BigInt isn't required if pulling values from said table.
Running the script requires that the HZ value is available from the
Makefile. Thus, this patch also adds the Kconfig variable CONFIG_HZ to the
architectures which didn't already have it (alpha, cris, frv, h8300, m32r,
m68k, m68knommu, sparc, v850, and xtensa.) It does *not* touch the sh or
sh64 architectures, since Paul Mundt has dealt with those separately in the
sh tree.
Signed-off-by: H. Peter Anvin <hpa@zytor.com>
Cc: Ralf Baechle <ralf@linux-mips.org>,
Cc: Sam Ravnborg <sam@ravnborg.org>,
Cc: Paul Mundt <lethal@linux-sh.org>,
Cc: Richard Henderson <rth@twiddle.net>,
Cc: Michael Starvik <starvik@axis.com>,
Cc: David Howells <dhowells@redhat.com>,
Cc: Yoshinori Sato <ysato@users.sourceforge.jp>,
Cc: Hirokazu Takata <takata@linux-m32r.org>,
Cc: Geert Uytterhoeven <geert@linux-m68k.org>,
Cc: Roman Zippel <zippel@linux-m68k.org>,
Cc: William L. Irwin <sparclinux@vger.kernel.org>,
Cc: Chris Zankel <chris@zankel.net>,
Cc: H. Peter Anvin <hpa@zytor.com>,
Cc: Jan Engelhardt <jengelh@computergmbh.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-02-08 12:21:26 +00:00
|
|
|
config HZ
|
|
|
|
|
int
|
|
|
|
|
default 100
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
source "init/Kconfig"
|
|
|
|
|
|
2008-10-19 03:27:21 +00:00
|
|
|
source "kernel/Kconfig.freezer"
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
menu "Processor type and features"
|
|
|
|
|
|
|
|
|
|
choice
|
|
|
|
|
prompt "Platform Type"
|
|
|
|
|
default PLAT_MAPPI
|
|
|
|
|
|
|
|
|
|
config PLAT_MAPPI
|
|
|
|
|
bool "Mappi-I"
|
|
|
|
|
help
|
|
|
|
|
The Mappi-I is an FPGA board for SOC (System-On-a-Chip) prototyping.
|
|
|
|
|
You can operate a Linux system on this board by using an M32R
|
|
|
|
|
softmacro core, which is a fully-synthesizable functional model
|
|
|
|
|
described in Verilog-HDL.
|
|
|
|
|
|
|
|
|
|
The Mappi-I board was the first platform, which had been used
|
|
|
|
|
to port and develop a Linux system for the M32R processor.
|
|
|
|
|
Currently, the Mappi-II, an heir to the Mappi-I, is available.
|
|
|
|
|
|
|
|
|
|
config PLAT_USRV
|
|
|
|
|
bool "uServer"
|
2007-08-17 08:22:15 +00:00
|
|
|
select PLAT_HAS_INT1ICU
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
config PLAT_M32700UT
|
|
|
|
|
bool "M32700UT"
|
2007-08-17 08:22:15 +00:00
|
|
|
select PLAT_HAS_INT0ICU
|
|
|
|
|
select PLAT_HAS_INT1ICU
|
|
|
|
|
select PLAT_HAS_INT2ICU
|
2005-04-16 22:20:36 +00:00
|
|
|
help
|
|
|
|
|
The M3T-M32700UT is an evaluation board based on uT-Engine
|
|
|
|
|
specification. This board has an M32700 (Chaos) evaluation chip.
|
|
|
|
|
You can say Y for SMP, because the M32700 is a single chip
|
|
|
|
|
multiprocessor.
|
|
|
|
|
|
|
|
|
|
config PLAT_OPSPUT
|
|
|
|
|
bool "OPSPUT"
|
2007-08-17 08:22:15 +00:00
|
|
|
select PLAT_HAS_INT0ICU
|
|
|
|
|
select PLAT_HAS_INT1ICU
|
|
|
|
|
select PLAT_HAS_INT2ICU
|
2005-04-16 22:20:36 +00:00
|
|
|
help
|
|
|
|
|
The OPSPUT is an evaluation board based on uT-Engine
|
|
|
|
|
specification. This board has a OPSP-REP chip.
|
|
|
|
|
|
|
|
|
|
config PLAT_OAKS32R
|
|
|
|
|
bool "OAKS32R"
|
|
|
|
|
help
|
|
|
|
|
The OAKS32R is a tiny, inexpensive evaluation board.
|
|
|
|
|
Please note that if you say Y here and choose chip "M32102",
|
|
|
|
|
say N for MMU and select a no-MMU version kernel, otherwise
|
|
|
|
|
a kernel with MMU support will not work, because the M32102
|
|
|
|
|
is a microcontroller for embedded systems and it has no MMU.
|
|
|
|
|
|
|
|
|
|
config PLAT_MAPPI2
|
|
|
|
|
bool "Mappi-II(M3A-ZA36/M3A-ZA52)"
|
|
|
|
|
|
2005-06-22 00:16:10 +00:00
|
|
|
config PLAT_MAPPI3
|
|
|
|
|
bool "Mappi-III(M3A-2170)"
|
|
|
|
|
|
2006-01-06 08:18:41 +00:00
|
|
|
config PLAT_M32104UT
|
|
|
|
|
bool "M32104UT"
|
2007-08-17 08:22:15 +00:00
|
|
|
select PLAT_HAS_INT1ICU
|
2006-01-06 08:18:41 +00:00
|
|
|
help
|
|
|
|
|
The M3T-M32104UT is an reference board based on uT-Engine
|
|
|
|
|
specification. This board has a M32104 chip.
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
endchoice
|
|
|
|
|
|
|
|
|
|
choice
|
|
|
|
|
prompt "Processor family"
|
|
|
|
|
default CHIP_M32700
|
|
|
|
|
|
|
|
|
|
config CHIP_M32700
|
|
|
|
|
bool "M32700 (Chaos)"
|
|
|
|
|
|
|
|
|
|
config CHIP_M32102
|
|
|
|
|
bool "M32102"
|
|
|
|
|
|
2006-01-06 08:18:41 +00:00
|
|
|
config CHIP_M32104
|
|
|
|
|
bool "M32104"
|
|
|
|
|
depends on PLAT_M32104UT
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config CHIP_VDEC2
|
|
|
|
|
bool "VDEC2"
|
|
|
|
|
|
|
|
|
|
config CHIP_OPSP
|
|
|
|
|
bool "OPSP"
|
|
|
|
|
|
|
|
|
|
endchoice
|
|
|
|
|
|
|
|
|
|
config MMU
|
|
|
|
|
bool "Support for memory management hardware"
|
|
|
|
|
depends on CHIP_M32700 || CHIP_VDEC2 || CHIP_OPSP
|
|
|
|
|
default y
|
|
|
|
|
|
|
|
|
|
config TLB_ENTRIES
|
|
|
|
|
int "TLB Entries"
|
|
|
|
|
depends on CHIP_M32700 || CHIP_VDEC2 || CHIP_OPSP
|
|
|
|
|
default 32 if CHIP_M32700 || CHIP_OPSP
|
|
|
|
|
default 16 if CHIP_VDEC2
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
config ISA_M32R
|
|
|
|
|
bool
|
2006-01-06 08:18:41 +00:00
|
|
|
depends on CHIP_M32102 || CHIP_M32104
|
2005-04-16 22:20:36 +00:00
|
|
|
default y
|
|
|
|
|
|
|
|
|
|
config ISA_M32R2
|
|
|
|
|
bool
|
|
|
|
|
depends on CHIP_M32700 || CHIP_VDEC2 || CHIP_OPSP
|
|
|
|
|
default y
|
|
|
|
|
|
|
|
|
|
config ISA_DSP_LEVEL2
|
|
|
|
|
bool
|
|
|
|
|
depends on CHIP_M32700 || CHIP_OPSP
|
|
|
|
|
default y
|
|
|
|
|
|
|
|
|
|
config ISA_DUAL_ISSUE
|
|
|
|
|
bool
|
|
|
|
|
depends on CHIP_M32700 || CHIP_OPSP
|
|
|
|
|
default y
|
|
|
|
|
|
2007-08-17 08:22:15 +00:00
|
|
|
config PLAT_HAS_INT0ICU
|
|
|
|
|
bool
|
|
|
|
|
default n
|
|
|
|
|
|
|
|
|
|
config PLAT_HAS_INT1ICU
|
|
|
|
|
bool
|
|
|
|
|
default n
|
|
|
|
|
|
|
|
|
|
config PLAT_HAS_INT2ICU
|
|
|
|
|
bool
|
|
|
|
|
default n
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config BUS_CLOCK
|
|
|
|
|
int "Bus Clock [Hz] (integer)"
|
|
|
|
|
default "70000000" if PLAT_MAPPI
|
|
|
|
|
default "25000000" if PLAT_USRV
|
2005-06-22 00:16:10 +00:00
|
|
|
default "50000000" if PLAT_MAPPI3
|
2005-04-16 22:20:36 +00:00
|
|
|
default "50000000" if PLAT_M32700UT
|
|
|
|
|
default "50000000" if PLAT_OPSPUT
|
2006-01-06 08:18:41 +00:00
|
|
|
default "54000000" if PLAT_M32104UT
|
2005-04-16 22:20:36 +00:00
|
|
|
default "33333333" if PLAT_OAKS32R
|
|
|
|
|
default "20000000" if PLAT_MAPPI2
|
|
|
|
|
|
|
|
|
|
config TIMER_DIVIDE
|
|
|
|
|
int "Timer divider (integer)"
|
|
|
|
|
default "128"
|
|
|
|
|
|
2017-10-03 23:15:23 +00:00
|
|
|
config CPU_BIG_ENDIAN
|
2017-11-16 01:31:18 +00:00
|
|
|
bool
|
|
|
|
|
default !CPU_LITTLE_ENDIAN
|
2017-10-03 23:15:23 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config CPU_LITTLE_ENDIAN
|
|
|
|
|
bool "Generate little endian code"
|
|
|
|
|
default n
|
|
|
|
|
|
|
|
|
|
config MEMORY_START
|
|
|
|
|
hex "Physical memory start address (hex)"
|
2005-06-22 00:16:10 +00:00
|
|
|
default "08000000" if PLAT_MAPPI || PLAT_MAPPI2 || PLAT_MAPPI3
|
2005-04-16 22:20:36 +00:00
|
|
|
default "08000000" if PLAT_USRV
|
|
|
|
|
default "08000000" if PLAT_M32700UT
|
|
|
|
|
default "08000000" if PLAT_OPSPUT
|
2006-01-06 08:18:41 +00:00
|
|
|
default "04000000" if PLAT_M32104UT
|
2005-04-16 22:20:36 +00:00
|
|
|
default "01000000" if PLAT_OAKS32R
|
|
|
|
|
|
|
|
|
|
config MEMORY_SIZE
|
|
|
|
|
hex "Physical memory size (hex)"
|
2005-06-22 00:16:10 +00:00
|
|
|
default "08000000" if PLAT_MAPPI3
|
2005-04-16 22:20:36 +00:00
|
|
|
default "04000000" if PLAT_MAPPI || PLAT_MAPPI2
|
|
|
|
|
default "02000000" if PLAT_USRV
|
|
|
|
|
default "01000000" if PLAT_M32700UT
|
|
|
|
|
default "01000000" if PLAT_OPSPUT
|
2006-01-06 08:18:41 +00:00
|
|
|
default "01000000" if PLAT_M32104UT
|
2005-04-16 22:20:36 +00:00
|
|
|
default "00800000" if PLAT_OAKS32R
|
|
|
|
|
|
2005-06-23 07:07:43 +00:00
|
|
|
config ARCH_DISCONTIGMEM_ENABLE
|
2005-04-16 22:20:36 +00:00
|
|
|
bool "Internal RAM Support"
|
2006-01-06 08:18:41 +00:00
|
|
|
depends on CHIP_M32700 || CHIP_M32102 || CHIP_VDEC2 || CHIP_OPSP || CHIP_M32104
|
2005-04-16 22:20:36 +00:00
|
|
|
default y
|
|
|
|
|
|
2005-06-23 07:07:43 +00:00
|
|
|
source "mm/Kconfig"
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config IRAM_START
|
|
|
|
|
hex "Internal memory start address (hex)"
|
2006-01-06 08:18:41 +00:00
|
|
|
default "00f00000" if !CHIP_M32104
|
|
|
|
|
default "00700000" if CHIP_M32104
|
|
|
|
|
depends on (CHIP_M32700 || CHIP_M32102 || CHIP_VDEC2 || CHIP_OPSP || CHIP_M32104) && DISCONTIGMEM
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
config IRAM_SIZE
|
|
|
|
|
hex "Internal memory size (hex)"
|
2006-01-06 08:18:41 +00:00
|
|
|
depends on (CHIP_M32700 || CHIP_M32102 || CHIP_VDEC2 || CHIP_OPSP || CHIP_M32104) && DISCONTIGMEM
|
2005-04-16 22:20:36 +00:00
|
|
|
default "00080000" if CHIP_M32700
|
2006-01-06 08:18:41 +00:00
|
|
|
default "00010000" if CHIP_M32102 || CHIP_OPSP || CHIP_M32104
|
2005-04-16 22:20:36 +00:00
|
|
|
default "00008000" if CHIP_VDEC2
|
|
|
|
|
|
|
|
|
|
#
|
|
|
|
|
# Define implied options from the CPU selection here
|
|
|
|
|
#
|
|
|
|
|
|
2008-01-30 12:31:20 +00:00
|
|
|
config GENERIC_LOCKBREAK
|
|
|
|
|
bool
|
|
|
|
|
default y
|
|
|
|
|
depends on SMP && PREEMPT
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config RWSEM_GENERIC_SPINLOCK
|
|
|
|
|
bool
|
|
|
|
|
depends on M32R
|
|
|
|
|
default y
|
|
|
|
|
|
|
|
|
|
config RWSEM_XCHGADD_ALGORITHM
|
|
|
|
|
bool
|
|
|
|
|
default n
|
|
|
|
|
|
2006-12-08 10:37:49 +00:00
|
|
|
config ARCH_HAS_ILOG2_U32
|
|
|
|
|
bool
|
|
|
|
|
default n
|
|
|
|
|
|
|
|
|
|
config ARCH_HAS_ILOG2_U64
|
|
|
|
|
bool
|
|
|
|
|
default n
|
|
|
|
|
|
[PATCH] bitops: m32r: use generic bitops
- remove __{,test_and_}{set,clear,change}_bit() and test_bit()
- remove ffz()
- remove find_{next,first}{,_zero}_bit()
- remove __ffs()
- remove generic_fls()
- remove generic_fls64()
- remove sched_find_first_bit()
- remove generic_ffs()
- remove generic_hweight{32,16,8}()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove ext2_{set,clear}_bit_atomic()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: Hirokazu Takata <takata@linux-m32r.org>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 09:39:26 +00:00
|
|
|
config GENERIC_HWEIGHT
|
|
|
|
|
bool
|
|
|
|
|
default y
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
config GENERIC_CALIBRATE_DELAY
|
|
|
|
|
bool
|
|
|
|
|
default y
|
|
|
|
|
|
2008-11-11 08:05:16 +00:00
|
|
|
config SCHED_OMIT_FRAME_POINTER
|
m32r: fix switch_to macro to push/pop frame pointer if needed
This patch fixes a rarely-happened but severe scheduling problem of
the recent m32r kernel of 2.6.17-rc3 or later.
In the following previous m32r patch, the switch_to macro was
modified not to do unnecessary push/pop operations for tuning.
> [PATCH] m32r: update switch_to macro for tuning
> 4127272c38619c56f0c1aa01d01c7bd757db70a1
In this modification, only 'lr' and 'sp' registers are push/pop'ed,
assuming that the m32r kernel is always compiled with
-fomit-frame-pointer option.
However, in 2.6 kernel, kernel/sched.c is irregularly compiled
with -fno-omit-frame-pointer if CONFIG_SCHED_NO_NO_OMIT_FRAME_POINTER
is not defined.
-- kernel/Makefile --
:
ifneq ($(CONFIG_SCHED_NO_NO_OMIT_FRAME_POINTER),y)
# According to Alan Modra <alan@linuxcare.com.au>, the -fno-omit-frame-pointer is
# needed for x86 only. Why this used to be enabled for all architectures is beyond
# me. I suspect most platforms don't need this, but until we know that for sure
# I turn this off for IA-64 only. Andreas Schwab says it's also needed on m68k
# to get a correct value for the wait-channel (WCHAN in ps). --davidm
CFLAGS_sched.o := $(PROFILING) -fno-omit-frame-pointer
endif
:
---
Therefore, for the recent m32r kernel, we have to push/pop 'fp'
(frame pointer) if CONFIG_FRAME_POINTER is defined or
CONFIG_SCHED_NO_NO_OMIT_FRAME_POINTER is not defined.
Signed-off-by: Hitoshi Yamamoto <hitoshiy@linux-m32r.org>
Signed-off-by: Hirokazu Takata <takata@linux-m32r.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-05-11 05:22:25 +00:00
|
|
|
bool
|
|
|
|
|
default y
|
|
|
|
|
|
2011-07-05 14:29:40 +00:00
|
|
|
source "kernel/Kconfig.preempt"
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
config SMP
|
|
|
|
|
bool "Symmetric multi-processing support"
|
2016-02-05 23:36:10 +00:00
|
|
|
depends on MMU
|
2005-04-16 22:20:36 +00:00
|
|
|
---help---
|
|
|
|
|
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
|
2005-04-16 22:20:36 +00:00
|
|
|
machines, but will use only one CPU of a multiprocessor machine. If
|
|
|
|
|
you say Y here, the kernel will run on many, but not all,
|
2014-01-23 23:55:29 +00:00
|
|
|
uniprocessor machines. On a uniprocessor machine, the kernel
|
2005-04-16 22:20:36 +00:00
|
|
|
will run faster if you say N here.
|
|
|
|
|
|
|
|
|
|
People using multiprocessor machines who say Y here should also say
|
|
|
|
|
Y to "Enhanced Real Time Clock Support", below. The "Advanced Power
|
|
|
|
|
Management" code will be disabled if you say Y here.
|
|
|
|
|
|
2008-02-03 13:50:21 +00:00
|
|
|
See also the SMP-HOWTO available at
|
2010-10-16 17:36:23 +00:00
|
|
|
<http://tldp.org/HOWTO/SMP-HOWTO.html>.
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
If you don't know what to do here, say N.
|
|
|
|
|
|
|
|
|
|
config CHIP_M32700_TS1
|
|
|
|
|
bool "Workaround code for the M32700 TS1 chip's bug"
|
|
|
|
|
depends on (CHIP_M32700 && SMP)
|
|
|
|
|
default n
|
|
|
|
|
|
|
|
|
|
config NR_CPUS
|
|
|
|
|
int "Maximum number of CPUs (2-32)"
|
|
|
|
|
range 2 32
|
|
|
|
|
depends on SMP
|
|
|
|
|
default "2"
|
|
|
|
|
help
|
|
|
|
|
This allows you to specify the maximum number of CPUs which this
|
|
|
|
|
kernel will support. The maximum supported value is 32 and the
|
|
|
|
|
minimum value which makes sense is 2.
|
|
|
|
|
|
|
|
|
|
This is purely to save memory - each supported CPU adds
|
|
|
|
|
approximately eight kilobytes to the kernel image.
|
|
|
|
|
|
|
|
|
|
# Common NUMA Features
|
|
|
|
|
config NUMA
|
|
|
|
|
bool "Numa Memory Allocation Support"
|
2005-08-23 21:45:11 +00:00
|
|
|
depends on SMP && BROKEN
|
2005-04-16 22:20:36 +00:00
|
|
|
default n
|
|
|
|
|
|
2006-04-11 05:53:53 +00:00
|
|
|
config NODES_SHIFT
|
|
|
|
|
int
|
|
|
|
|
default "1"
|
|
|
|
|
depends on NEED_MULTIPLE_NODES
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
endmenu
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
menu "Bus options (PCI, PCMCIA, EISA, MCA, ISA)"
|
|
|
|
|
|
|
|
|
|
config PCI
|
|
|
|
|
bool "PCI support"
|
2005-08-23 21:45:31 +00:00
|
|
|
depends on BROKEN
|
2005-04-16 22:20:36 +00:00
|
|
|
default n
|
|
|
|
|
help
|
|
|
|
|
Find out whether you have a PCI motherboard. PCI is the name of a
|
|
|
|
|
bus system, i.e. the way the CPU talks to the other stuff inside
|
|
|
|
|
your box. Other bus systems are ISA, EISA, MicroChannel (MCA) or
|
|
|
|
|
VESA. If you have PCI, say Y, otherwise N.
|
|
|
|
|
|
|
|
|
|
choice
|
|
|
|
|
prompt "PCI access mode"
|
|
|
|
|
depends on PCI
|
|
|
|
|
default PCI_GOANY
|
|
|
|
|
|
|
|
|
|
config PCI_GOBIOS
|
|
|
|
|
bool "BIOS"
|
|
|
|
|
---help---
|
|
|
|
|
On PCI systems, the BIOS can be used to detect the PCI devices and
|
|
|
|
|
determine their configuration. However, some old PCI motherboards
|
|
|
|
|
have BIOS bugs and may crash if this is done. Also, some embedded
|
|
|
|
|
PCI-based systems don't have any BIOS at all. Linux can also try to
|
|
|
|
|
detect the PCI hardware directly without using the BIOS.
|
|
|
|
|
|
|
|
|
|
With this option, you can specify how Linux should detect the PCI
|
|
|
|
|
devices. If you choose "BIOS", the BIOS will be used, if you choose
|
|
|
|
|
"Direct", the BIOS won't be used, and if you choose "Any", the
|
|
|
|
|
kernel will try the direct access method and falls back to the BIOS
|
|
|
|
|
if that doesn't work. If unsure, go with the default, which is
|
|
|
|
|
"Any".
|
|
|
|
|
|
|
|
|
|
config PCI_GODIRECT
|
|
|
|
|
bool "Direct"
|
|
|
|
|
|
|
|
|
|
config PCI_GOANY
|
|
|
|
|
bool "Any"
|
|
|
|
|
|
|
|
|
|
endchoice
|
|
|
|
|
|
|
|
|
|
config PCI_BIOS
|
|
|
|
|
bool
|
|
|
|
|
depends on PCI && (PCI_GOBIOS || PCI_GOANY)
|
|
|
|
|
default y
|
|
|
|
|
|
|
|
|
|
config PCI_DIRECT
|
|
|
|
|
bool
|
|
|
|
|
depends on PCI && (PCI_GODIRECT || PCI_GOANY)
|
|
|
|
|
default y
|
|
|
|
|
|
|
|
|
|
source "drivers/pci/Kconfig"
|
|
|
|
|
|
|
|
|
|
config ISA
|
2008-09-24 05:58:54 +00:00
|
|
|
bool
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
source "drivers/pcmcia/Kconfig"
|
|
|
|
|
|
|
|
|
|
endmenu
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
menu "Executable file formats"
|
|
|
|
|
|
|
|
|
|
source "fs/Kconfig.binfmt"
|
|
|
|
|
|
|
|
|
|
endmenu
|
|
|
|
|
|
2005-07-12 04:03:49 +00:00
|
|
|
source "net/Kconfig"
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
source "drivers/Kconfig"
|
|
|
|
|
|
|
|
|
|
source "fs/Kconfig"
|
|
|
|
|
|
|
|
|
|
source "arch/m32r/Kconfig.debug"
|
|
|
|
|
|
|
|
|
|
source "security/Kconfig"
|
|
|
|
|
|
|
|
|
|
source "crypto/Kconfig"
|
|
|
|
|
|
|
|
|
|
source "lib/Kconfig"
|
