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 21:07:57 +07:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2009-12-10 01:45:34 +07:00
|
|
|
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
|
|
|
|
|
2008-03-20 00:25:23 +07:00
|
|
|
#include <linux/kernel.h>
|
2016-11-15 02:04:43 +07:00
|
|
|
#include <linux/export.h>
|
2008-03-20 00:25:23 +07:00
|
|
|
#include <linux/init.h>
|
2018-10-31 05:09:21 +07:00
|
|
|
#include <linux/memblock.h>
|
2008-03-20 00:25:23 +07:00
|
|
|
#include <linux/percpu.h>
|
2008-06-20 20:38:22 +07:00
|
|
|
#include <linux/kexec.h>
|
2008-06-22 11:02:20 +07:00
|
|
|
#include <linux/crash_dump.h>
|
2009-01-04 18:34:26 +07:00
|
|
|
#include <linux/smp.h>
|
|
|
|
#include <linux/topology.h>
|
2009-02-24 09:57:21 +07:00
|
|
|
#include <linux/pfn.h>
|
2008-03-20 00:25:23 +07:00
|
|
|
#include <asm/sections.h>
|
|
|
|
#include <asm/processor.h>
|
2016-11-15 02:04:43 +07:00
|
|
|
#include <asm/desc.h>
|
2008-03-20 00:25:23 +07:00
|
|
|
#include <asm/setup.h>
|
2008-04-05 02:40:48 +07:00
|
|
|
#include <asm/mpspec.h>
|
2008-04-05 02:40:41 +07:00
|
|
|
#include <asm/apicdef.h>
|
2008-06-20 20:38:22 +07:00
|
|
|
#include <asm/highmem.h>
|
2009-01-13 18:41:35 +07:00
|
|
|
#include <asm/proto.h>
|
2009-01-10 13:47:37 +07:00
|
|
|
#include <asm/cpumask.h>
|
2009-01-27 10:56:48 +07:00
|
|
|
#include <asm/cpu.h>
|
2009-02-09 20:17:40 +07:00
|
|
|
#include <asm/stackprotector.h>
|
2008-04-05 02:40:41 +07:00
|
|
|
|
x86: Add read_mostly declaration/definition to variables from smp.h
Add "read-mostly" qualifier to the following variables in
smp.h:
- cpu_sibling_map
- cpu_core_map
- cpu_llc_shared_map
- cpu_llc_id
- cpu_number
- x86_cpu_to_apicid
- x86_bios_cpu_apicid
- x86_cpu_to_logical_apicid
As long as all the variables above are only written during the
initialization, this change is meant to prevent the false
sharing. More specifically, on vSMP Foundation platform
x86_cpu_to_apicid shared the same internode_cache_line with
frequently written lapic_events.
From the analysis of the first 33 per_cpu variables out of 219
(memories they describe, to be more specific) the 8 have read_mostly
nature (tlb_vector_offset, cpu_loops_per_jiffy, xen_debug_irq, etc.)
and 25 are frequently written (irq_stack_union, gdt_page,
exception_stacks, idt_desc, etc.).
Assuming that the spread of the rest of the per_cpu variables is
similar, identifying the read mostly memories will make more sense
in terms of long-term code maintenance comparing to identifying
frequently written memories.
Signed-off-by: Vlad Zolotarov <vlad@scalemp.com>
Acked-by: Shai Fultheim <shai@scalemp.com>
Cc: Shai Fultheim (Shai@ScaleMP.com) <Shai@scalemp.com>
Cc: ido@wizery.com
Cc: Linus Torvalds <torvalds@linux-foundation.org>
Cc: Andrew Morton <akpm@linux-foundation.org>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Link: http://lkml.kernel.org/r/1719258.EYKzE4Zbq5@vlad
Signed-off-by: Ingo Molnar <mingo@kernel.org>
2012-06-11 16:56:52 +07:00
|
|
|
DEFINE_PER_CPU_READ_MOSTLY(int, cpu_number);
|
2009-01-18 22:38:58 +07:00
|
|
|
EXPORT_PER_CPU_SYMBOL(cpu_number);
|
|
|
|
|
2009-01-27 10:56:48 +07:00
|
|
|
#ifdef CONFIG_X86_64
|
|
|
|
#define BOOT_PERCPU_OFFSET ((unsigned long)__per_cpu_load)
|
|
|
|
#else
|
|
|
|
#define BOOT_PERCPU_OFFSET 0
|
|
|
|
#endif
|
|
|
|
|
2014-11-04 15:26:42 +07:00
|
|
|
DEFINE_PER_CPU_READ_MOSTLY(unsigned long, this_cpu_off) = BOOT_PERCPU_OFFSET;
|
2009-01-27 10:56:48 +07:00
|
|
|
EXPORT_PER_CPU_SYMBOL(this_cpu_off);
|
|
|
|
|
2016-08-09 06:29:06 +07:00
|
|
|
unsigned long __per_cpu_offset[NR_CPUS] __ro_after_init = {
|
2009-01-27 10:56:48 +07:00
|
|
|
[0 ... NR_CPUS-1] = BOOT_PERCPU_OFFSET,
|
2009-01-13 18:41:35 +07:00
|
|
|
};
|
|
|
|
EXPORT_SYMBOL(__per_cpu_offset);
|
2008-03-20 00:25:23 +07:00
|
|
|
|
2009-03-06 12:33:59 +07:00
|
|
|
/*
|
|
|
|
* On x86_64 symbols referenced from code should be reachable using
|
|
|
|
* 32bit relocations. Reserve space for static percpu variables in
|
|
|
|
* modules so that they are always served from the first chunk which
|
|
|
|
* is located at the percpu segment base. On x86_32, anything can
|
|
|
|
* address anywhere. No need to reserve space in the first chunk.
|
|
|
|
*/
|
|
|
|
#ifdef CONFIG_X86_64
|
|
|
|
#define PERCPU_FIRST_CHUNK_RESERVE PERCPU_MODULE_RESERVE
|
|
|
|
#else
|
|
|
|
#define PERCPU_FIRST_CHUNK_RESERVE 0
|
|
|
|
#endif
|
|
|
|
|
2009-08-14 13:00:52 +07:00
|
|
|
#ifdef CONFIG_X86_32
|
2009-02-24 09:57:21 +07:00
|
|
|
/**
|
|
|
|
* pcpu_need_numa - determine percpu allocation needs to consider NUMA
|
|
|
|
*
|
|
|
|
* If NUMA is not configured or there is only one NUMA node available,
|
|
|
|
* there is no reason to consider NUMA. This function determines
|
|
|
|
* whether percpu allocation should consider NUMA or not.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* true if NUMA should be considered; otherwise, false.
|
|
|
|
*/
|
|
|
|
static bool __init pcpu_need_numa(void)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_NEED_MULTIPLE_NODES
|
|
|
|
pg_data_t *last = NULL;
|
|
|
|
unsigned int cpu;
|
|
|
|
|
|
|
|
for_each_possible_cpu(cpu) {
|
|
|
|
int node = early_cpu_to_node(cpu);
|
|
|
|
|
|
|
|
if (node_online(node) && NODE_DATA(node) &&
|
|
|
|
last && last != NODE_DATA(node))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
last = NODE_DATA(node);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
return false;
|
|
|
|
}
|
2009-08-14 13:00:52 +07:00
|
|
|
#endif
|
2009-02-24 09:57:21 +07:00
|
|
|
|
2009-02-24 09:57:21 +07:00
|
|
|
/**
|
|
|
|
* pcpu_alloc_bootmem - NUMA friendly alloc_bootmem wrapper for percpu
|
|
|
|
* @cpu: cpu to allocate for
|
|
|
|
* @size: size allocation in bytes
|
|
|
|
* @align: alignment
|
|
|
|
*
|
|
|
|
* Allocate @size bytes aligned at @align for cpu @cpu. This wrapper
|
|
|
|
* does the right thing for NUMA regardless of the current
|
|
|
|
* configuration.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* Pointer to the allocated area on success, NULL on failure.
|
|
|
|
*/
|
|
|
|
static void * __init pcpu_alloc_bootmem(unsigned int cpu, unsigned long size,
|
|
|
|
unsigned long align)
|
|
|
|
{
|
|
|
|
const unsigned long goal = __pa(MAX_DMA_ADDRESS);
|
|
|
|
#ifdef CONFIG_NEED_MULTIPLE_NODES
|
|
|
|
int node = early_cpu_to_node(cpu);
|
|
|
|
void *ptr;
|
|
|
|
|
|
|
|
if (!node_online(node) || !NODE_DATA(node)) {
|
2019-03-12 13:30:42 +07:00
|
|
|
ptr = memblock_alloc_from(size, align, goal);
|
2009-02-24 09:57:21 +07:00
|
|
|
pr_info("cpu %d has no node %d or node-local memory\n",
|
|
|
|
cpu, node);
|
|
|
|
pr_debug("per cpu data for cpu%d %lu bytes at %016lx\n",
|
|
|
|
cpu, size, __pa(ptr));
|
|
|
|
} else {
|
2019-03-12 13:30:42 +07:00
|
|
|
ptr = memblock_alloc_try_nid(size, align, goal,
|
|
|
|
MEMBLOCK_ALLOC_ACCESSIBLE,
|
|
|
|
node);
|
2018-10-31 05:08:18 +07:00
|
|
|
|
2009-12-10 01:45:34 +07:00
|
|
|
pr_debug("per cpu data for cpu%d %lu bytes on node%d at %016lx\n",
|
|
|
|
cpu, size, node, __pa(ptr));
|
2009-02-24 09:57:21 +07:00
|
|
|
}
|
|
|
|
return ptr;
|
|
|
|
#else
|
2019-03-12 13:30:42 +07:00
|
|
|
return memblock_alloc_from(size, align, goal);
|
2009-02-24 09:57:21 +07:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2009-07-04 06:10:59 +07:00
|
|
|
/*
|
|
|
|
* Helpers for first chunk memory allocation
|
|
|
|
*/
|
2009-08-14 13:00:50 +07:00
|
|
|
static void * __init pcpu_fc_alloc(unsigned int cpu, size_t size, size_t align)
|
2009-07-04 06:10:59 +07:00
|
|
|
{
|
2009-08-14 13:00:50 +07:00
|
|
|
return pcpu_alloc_bootmem(cpu, size, align);
|
2009-07-04 06:10:59 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
static void __init pcpu_fc_free(void *ptr, size_t size)
|
|
|
|
{
|
2018-10-31 05:09:21 +07:00
|
|
|
memblock_free(__pa(ptr), size);
|
2009-07-04 06:10:59 +07:00
|
|
|
}
|
|
|
|
|
2009-08-14 13:00:52 +07:00
|
|
|
static int __init pcpu_cpu_distance(unsigned int from, unsigned int to)
|
2009-07-04 06:11:00 +07:00
|
|
|
{
|
2009-08-14 13:00:52 +07:00
|
|
|
#ifdef CONFIG_NEED_MULTIPLE_NODES
|
2009-07-04 06:11:00 +07:00
|
|
|
if (early_cpu_to_node(from) == early_cpu_to_node(to))
|
|
|
|
return LOCAL_DISTANCE;
|
|
|
|
else
|
|
|
|
return REMOTE_DISTANCE;
|
2009-02-24 09:57:22 +07:00
|
|
|
#else
|
2009-08-14 13:00:52 +07:00
|
|
|
return LOCAL_DISTANCE;
|
2009-02-24 09:57:22 +07:00
|
|
|
#endif
|
2009-02-24 09:57:21 +07:00
|
|
|
}
|
|
|
|
|
2009-08-14 13:00:49 +07:00
|
|
|
static void __init pcpup_populate_pte(unsigned long addr)
|
2009-02-24 09:57:21 +07:00
|
|
|
{
|
|
|
|
populate_extra_pte(addr);
|
|
|
|
}
|
|
|
|
|
2009-01-27 10:56:48 +07:00
|
|
|
static inline void setup_percpu_segment(int cpu)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_X86_32
|
2017-08-28 13:47:38 +07:00
|
|
|
struct desc_struct d = GDT_ENTRY_INIT(0x8092, per_cpu_offset(cpu),
|
|
|
|
0xFFFFF);
|
2009-01-27 10:56:48 +07:00
|
|
|
|
2017-08-28 13:47:38 +07:00
|
|
|
write_gdt_entry(get_cpu_gdt_rw(cpu), GDT_ENTRY_PERCPU, &d, DESCTYPE_S);
|
2009-01-27 10:56:48 +07:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2008-03-20 00:25:23 +07:00
|
|
|
void __init setup_per_cpu_areas(void)
|
|
|
|
{
|
2009-02-24 09:57:21 +07:00
|
|
|
unsigned int cpu;
|
2009-02-20 14:29:09 +07:00
|
|
|
unsigned long delta;
|
2009-08-14 13:00:51 +07:00
|
|
|
int rc;
|
2008-12-17 08:33:53 +07:00
|
|
|
|
2019-03-06 06:48:26 +07:00
|
|
|
pr_info("NR_CPUS:%d nr_cpumask_bits:%d nr_cpu_ids:%u nr_node_ids:%u\n",
|
2008-12-17 08:33:53 +07:00
|
|
|
NR_CPUS, nr_cpumask_bits, nr_cpu_ids, nr_node_ids);
|
2009-02-20 14:29:09 +07:00
|
|
|
|
2009-02-24 09:57:22 +07:00
|
|
|
/*
|
2009-08-14 13:00:52 +07:00
|
|
|
* Allocate percpu area. Embedding allocator is our favorite;
|
|
|
|
* however, on NUMA configurations, it can result in very
|
|
|
|
* sparse unit mapping and vmalloc area isn't spacious enough
|
|
|
|
* on 32bit. Use page in that case.
|
2009-02-24 09:57:22 +07:00
|
|
|
*/
|
2009-08-14 13:00:52 +07:00
|
|
|
#ifdef CONFIG_X86_32
|
|
|
|
if (pcpu_chosen_fc == PCPU_FC_AUTO && pcpu_need_numa())
|
|
|
|
pcpu_chosen_fc = PCPU_FC_PAGE;
|
|
|
|
#endif
|
2009-08-14 13:00:51 +07:00
|
|
|
rc = -EINVAL;
|
2009-08-14 13:00:52 +07:00
|
|
|
if (pcpu_chosen_fc != PCPU_FC_PAGE) {
|
|
|
|
const size_t dyn_size = PERCPU_MODULE_RESERVE +
|
|
|
|
PERCPU_DYNAMIC_RESERVE - PERCPU_FIRST_CHUNK_RESERVE;
|
2012-04-28 00:54:35 +07:00
|
|
|
size_t atom_size;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* On 64bit, use PMD_SIZE for atom_size so that embedded
|
|
|
|
* percpu areas are aligned to PMD. This, in the future,
|
|
|
|
* can also allow using PMD mappings in vmalloc area. Use
|
|
|
|
* PAGE_SIZE on 32bit as vmalloc space is highly contended
|
|
|
|
* and large vmalloc area allocs can easily fail.
|
|
|
|
*/
|
|
|
|
#ifdef CONFIG_X86_64
|
|
|
|
atom_size = PMD_SIZE;
|
|
|
|
#else
|
|
|
|
atom_size = PAGE_SIZE;
|
|
|
|
#endif
|
2009-08-14 13:00:52 +07:00
|
|
|
rc = pcpu_embed_first_chunk(PERCPU_FIRST_CHUNK_RESERVE,
|
|
|
|
dyn_size, atom_size,
|
|
|
|
pcpu_cpu_distance,
|
|
|
|
pcpu_fc_alloc, pcpu_fc_free);
|
2009-08-14 13:00:51 +07:00
|
|
|
if (rc < 0)
|
2009-12-10 01:45:34 +07:00
|
|
|
pr_warning("%s allocator failed (%d), falling back to page size\n",
|
2009-08-14 13:00:52 +07:00
|
|
|
pcpu_fc_names[pcpu_chosen_fc], rc);
|
2009-06-22 09:56:24 +07:00
|
|
|
}
|
2009-08-14 13:00:51 +07:00
|
|
|
if (rc < 0)
|
2009-08-14 13:00:52 +07:00
|
|
|
rc = pcpu_page_first_chunk(PERCPU_FIRST_CHUNK_RESERVE,
|
|
|
|
pcpu_fc_alloc, pcpu_fc_free,
|
|
|
|
pcpup_populate_pte);
|
2009-08-14 13:00:51 +07:00
|
|
|
if (rc < 0)
|
|
|
|
panic("cannot initialize percpu area (err=%d)", rc);
|
2009-02-20 14:29:09 +07:00
|
|
|
|
2009-02-24 09:57:21 +07:00
|
|
|
/* alrighty, percpu areas up and running */
|
2009-02-20 14:29:09 +07:00
|
|
|
delta = (unsigned long)pcpu_base_addr - (unsigned long)__per_cpu_start;
|
|
|
|
for_each_possible_cpu(cpu) {
|
2009-08-14 13:00:51 +07:00
|
|
|
per_cpu_offset(cpu) = delta + pcpu_unit_offsets[cpu];
|
2009-01-18 22:38:58 +07:00
|
|
|
per_cpu(this_cpu_off, cpu) = per_cpu_offset(cpu);
|
2009-01-18 22:38:58 +07:00
|
|
|
per_cpu(cpu_number, cpu) = cpu;
|
2009-01-27 10:56:48 +07:00
|
|
|
setup_percpu_segment(cpu);
|
2009-02-09 20:17:40 +07:00
|
|
|
setup_stack_canary_segment(cpu);
|
2009-01-27 10:56:47 +07:00
|
|
|
/*
|
2009-01-27 12:25:05 +07:00
|
|
|
* Copy data used in early init routines from the
|
|
|
|
* initial arrays to the per cpu data areas. These
|
|
|
|
* arrays then become expendable and the *_early_ptr's
|
|
|
|
* are zeroed indicating that the static arrays are
|
|
|
|
* gone.
|
2009-01-27 10:56:47 +07:00
|
|
|
*/
|
2009-01-27 10:56:47 +07:00
|
|
|
#ifdef CONFIG_X86_LOCAL_APIC
|
2009-01-27 10:56:47 +07:00
|
|
|
per_cpu(x86_cpu_to_apicid, cpu) =
|
2009-01-27 12:25:05 +07:00
|
|
|
early_per_cpu_map(x86_cpu_to_apicid, cpu);
|
2009-01-27 10:56:47 +07:00
|
|
|
per_cpu(x86_bios_cpu_apicid, cpu) =
|
2009-01-27 12:25:05 +07:00
|
|
|
early_per_cpu_map(x86_bios_cpu_apicid, cpu);
|
2016-06-30 22:56:36 +07:00
|
|
|
per_cpu(x86_cpu_to_acpiid, cpu) =
|
|
|
|
early_per_cpu_map(x86_cpu_to_acpiid, cpu);
|
2009-01-27 10:56:47 +07:00
|
|
|
#endif
|
2011-01-23 20:37:30 +07:00
|
|
|
#ifdef CONFIG_X86_32
|
|
|
|
per_cpu(x86_cpu_to_logical_apicid, cpu) =
|
|
|
|
early_per_cpu_map(x86_cpu_to_logical_apicid, cpu);
|
|
|
|
#endif
|
2009-01-27 10:56:47 +07:00
|
|
|
#ifdef CONFIG_NUMA
|
|
|
|
per_cpu(x86_cpu_to_node_map, cpu) =
|
2009-01-27 12:25:05 +07:00
|
|
|
early_per_cpu_map(x86_cpu_to_node_map, cpu);
|
2010-07-21 03:24:30 +07:00
|
|
|
/*
|
2010-07-21 23:25:42 +07:00
|
|
|
* Ensure that the boot cpu numa_node is correct when the boot
|
2010-07-21 03:24:30 +07:00
|
|
|
* cpu is on a node that doesn't have memory installed.
|
|
|
|
* Also cpu_up() will call cpu_to_node() for APs when
|
|
|
|
* MEMORY_HOTPLUG is defined, before per_cpu(numa_node) is set
|
|
|
|
* up later with c_init aka intel_init/amd_init.
|
|
|
|
* So set them all (boot cpu and all APs).
|
|
|
|
*/
|
|
|
|
set_cpu_numa_node(cpu, early_cpu_to_node(cpu));
|
2009-01-27 10:56:47 +07:00
|
|
|
#endif
|
2009-01-13 18:41:35 +07:00
|
|
|
/*
|
2010-02-20 07:03:53 +07:00
|
|
|
* Up to this point, the boot CPU has been using .init.data
|
2009-01-27 10:56:48 +07:00
|
|
|
* area. Reload any changed state for the boot CPU.
|
2009-01-13 18:41:35 +07:00
|
|
|
*/
|
2010-07-22 00:03:58 +07:00
|
|
|
if (!cpu)
|
2009-01-30 15:47:53 +07:00
|
|
|
switch_to_new_gdt(cpu);
|
2008-03-20 00:25:23 +07:00
|
|
|
}
|
|
|
|
|
2009-01-27 10:56:47 +07:00
|
|
|
/* indicate the early static arrays will soon be gone */
|
2009-01-27 12:21:37 +07:00
|
|
|
#ifdef CONFIG_X86_LOCAL_APIC
|
2009-01-27 10:56:47 +07:00
|
|
|
early_per_cpu_ptr(x86_cpu_to_apicid) = NULL;
|
|
|
|
early_per_cpu_ptr(x86_bios_cpu_apicid) = NULL;
|
2016-06-30 22:56:36 +07:00
|
|
|
early_per_cpu_ptr(x86_cpu_to_acpiid) = NULL;
|
2009-01-27 12:21:37 +07:00
|
|
|
#endif
|
2011-01-23 20:37:30 +07:00
|
|
|
#ifdef CONFIG_X86_32
|
|
|
|
early_per_cpu_ptr(x86_cpu_to_logical_apicid) = NULL;
|
|
|
|
#endif
|
2011-01-23 20:37:40 +07:00
|
|
|
#ifdef CONFIG_NUMA
|
2009-01-27 10:56:47 +07:00
|
|
|
early_per_cpu_ptr(x86_cpu_to_node_map) = NULL;
|
|
|
|
#endif
|
2008-04-05 08:11:01 +07:00
|
|
|
|
2008-05-13 02:21:12 +07:00
|
|
|
/* Setup node to cpumask map */
|
|
|
|
setup_node_to_cpumask_map();
|
2009-01-04 20:18:03 +07:00
|
|
|
|
|
|
|
/* Setup cpu initialized, callin, callout masks */
|
|
|
|
setup_cpu_local_masks();
|
2017-03-23 04:32:32 +07:00
|
|
|
|
|
|
|
/*
|
2017-05-09 07:09:10 +07:00
|
|
|
* Sync back kernel address range again. We already did this in
|
|
|
|
* setup_arch(), but percpu data also needs to be available in
|
|
|
|
* the smpboot asm. We can't reliably pick up percpu mappings
|
|
|
|
* using vmalloc_fault(), because exception dispatch needs
|
|
|
|
* percpu data.
|
2018-03-01 03:14:26 +07:00
|
|
|
*
|
|
|
|
* FIXME: Can the later sync in setup_cpu_entry_areas() replace
|
|
|
|
* this call?
|
2017-03-23 04:32:32 +07:00
|
|
|
*/
|
2018-03-01 03:14:26 +07:00
|
|
|
sync_initial_page_table();
|
2008-03-20 00:25:23 +07:00
|
|
|
}
|