|
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index] [PATCH v3 5/6] xen/x86: move NUMA scan nodes codes from x86 to common
x86 has implemented a set of codes to scan NUMA nodes. These
codes will parse NUMA memory and processor information from
ACPI SRAT table. But except some ACPI specific codes, most
of the scan codes like memory blocks validation, node memory
range updates and some sanity check can be reused by other
NUMA implementation.
So in this patch, we move some variables and related functions
for NUMA memory and processor to common as library. At the
same time, numa_set_processor_nodes_parsed has been introduced
for ACPI specific code to update processor parsing results.
With this helper, we can reuse most of NUMA memory affinity init
code from ACPI. As bad_srat and node_to_pxm functions have been
used in common code to do architectural fallback and node to
architectural node info translation. But it doesn't make sense
to reuse the functions names in common code, we have rename them
to neutral names as well.
PXM is an ACPI specific item, we can't use it in common code
directly. As an alternative, we extend the parameters of
numa_update_node_memblks. The caller can pass the PXM as print
messages' prefix or as architectural node id. In this case, we
do not need to retain a lot of per-arch code but still can print
architectural log messages for different NUMA implementations.
mem_hotplug also has been accessing by common code, except x86,
other architectures like Arm will also want to implement memory
hotplug in future. We export mem_hotplug to common will not bring
any harm for Arm and we also can reduce some per-arch helpers to
access mem_hotplug.
As asm/acpi.h has been removed from common/numa.c, we have to
move NR_NODE_MEMBLKS from asm/acpi.h to xen/numa.h in this patch
as well.
Signed-off-by: Wei Chen <wei.chen@xxxxxxx>
---
v2 -> v3:
1. Add __ro_after_init to proper variables.
2. Rename bad_srat to numa_fw_bad.
3. Rename node_to_pxm to numa_node_to_arch_nid.
4. Merge patch#7 and #8 into this patch.
5. Correct int to unsigned int in proper places.
6. Move NR_NODE_MEMBLKS from x86/acpi.h to common/numa.h
7. Drop helpers to access mem_hotplug, we export mem_hotplug
from x86/mm.c to common/page_alloc.c
v1 -> v2:
1. Add code comment for numa_update_node_memblks to explain:
Assumes all memory regions belonging to a single node
are in one chunk. Holes between them will be included
in the node.
2. Merge this single patch instead of serval patches to move
x86 SRAT code to common.
3. Export node_to_pxm to keep pxm information in NUMA scan
nodes error messages.
4. Change the code style to target file's Xen code-style.
5. Adjust some __init and __initdata for some functions and
variables.
6. Merge two patches into this patch:
1. replace CONFIG_ACPI_NUMA by CONFIG_NUMA.
2. replace "SRAT" texts.
7. Turn numa_scan_nodes to static.
---
xen/arch/x86/include/asm/acpi.h | 1 -
xen/arch/x86/include/asm/mm.h | 2 -
xen/arch/x86/include/asm/numa.h | 3 +-
xen/arch/x86/mm.c | 2 -
xen/arch/x86/srat.c | 311 +++----------------------------
xen/common/numa.c | 317 ++++++++++++++++++++++++++++++++
xen/common/page_alloc.c | 2 +
xen/include/xen/mm.h | 2 +
xen/include/xen/numa.h | 11 +-
9 files changed, 357 insertions(+), 294 deletions(-)
diff --git a/xen/arch/x86/include/asm/acpi.h b/xen/arch/x86/include/asm/acpi.h
index 5c2dd5da2d..c453450a74 100644
--- a/xen/arch/x86/include/asm/acpi.h
+++ b/xen/arch/x86/include/asm/acpi.h
@@ -102,7 +102,6 @@ extern unsigned long acpi_wakeup_address;
#define ARCH_HAS_POWER_INIT 1
extern s8 acpi_numa;
-#define NR_NODE_MEMBLKS (MAX_NUMNODES*2)
extern struct acpi_sleep_info acpi_sinfo;
#define acpi_video_flags bootsym(video_flags)
diff --git a/xen/arch/x86/include/asm/mm.h b/xen/arch/x86/include/asm/mm.h
index 0fc826de46..95ff71a83a 100644
--- a/xen/arch/x86/include/asm/mm.h
+++ b/xen/arch/x86/include/asm/mm.h
@@ -474,8 +474,6 @@ static inline int get_page_and_type(struct page_info *page,
ASSERT(((_p)->count_info & PGC_count_mask) != 0); \
ASSERT(page_get_owner(_p) == (_d))
-extern paddr_t mem_hotplug;
-
/******************************************************************************
* With shadow pagetables, the different kinds of address start
* to get get confusing.
diff --git a/xen/arch/x86/include/asm/numa.h b/xen/arch/x86/include/asm/numa.h
index 6c87942d43..2ca3475271 100644
--- a/xen/arch/x86/include/asm/numa.h
+++ b/xen/arch/x86/include/asm/numa.h
@@ -10,6 +10,7 @@ typedef u8 nodeid_t;
extern int srat_rev;
extern nodeid_t pxm_to_node(unsigned int pxm);
+extern unsigned int numa_node_to_arch_nid(nodeid_t n);
#define ZONE_ALIGN (1UL << (MAX_ORDER+PAGE_SHIFT))
@@ -22,8 +23,6 @@ extern void init_cpu_to_node(void);
#define arch_want_default_dmazone() (num_online_nodes() > 1)
-extern int valid_numa_range(paddr_t start, paddr_t end, nodeid_t node);
-
void srat_parse_regions(paddr_t addr);
extern u8 __node_distance(nodeid_t a, nodeid_t b);
unsigned int arch_get_dma_bitsize(void);
diff --git a/xen/arch/x86/mm.c b/xen/arch/x86/mm.c
index db1817b691..68f9989e1f 100644
--- a/xen/arch/x86/mm.c
+++ b/xen/arch/x86/mm.c
@@ -157,8 +157,6 @@ l1_pgentry_t __section(".bss.page_aligned")
__aligned(PAGE_SIZE)
l1_pgentry_t __section(".bss.page_aligned") __aligned(PAGE_SIZE)
l1_fixmap_x[L1_PAGETABLE_ENTRIES];
-paddr_t __read_mostly mem_hotplug;
-
/* Frame table size in pages. */
unsigned long max_page;
unsigned long total_pages;
diff --git a/xen/arch/x86/srat.c b/xen/arch/x86/srat.c
index 6bebfb344f..b6ffde4401 100644
--- a/xen/arch/x86/srat.c
+++ b/xen/arch/x86/srat.c
@@ -24,10 +24,6 @@
static struct acpi_table_slit *__read_mostly acpi_slit;
-static nodemask_t memory_nodes_parsed __initdata;
-static nodemask_t processor_nodes_parsed __initdata;
-static struct node nodes[MAX_NUMNODES] __initdata;
-
struct pxm2node {
unsigned pxm;
nodeid_t node;
@@ -35,19 +31,6 @@ struct pxm2node {
static struct pxm2node __read_mostly pxm2node[MAX_NUMNODES] =
{ [0 ... MAX_NUMNODES - 1] = {.node = NUMA_NO_NODE} };
-static unsigned node_to_pxm(nodeid_t n);
-
-static int num_node_memblks;
-static struct node node_memblk_range[NR_NODE_MEMBLKS];
-static nodeid_t memblk_nodeid[NR_NODE_MEMBLKS];
-static __initdata DECLARE_BITMAP(memblk_hotplug, NR_NODE_MEMBLKS);
-
-enum conflicts {
- NO_CONFLICT,
- OVERLAP,
- INTERLEAVE,
-};
-
static inline bool node_found(unsigned idx, unsigned pxm)
{
return ((pxm2node[idx].pxm == pxm) &&
@@ -110,78 +93,7 @@ nodeid_t setup_node(unsigned pxm)
return node;
}
-int valid_numa_range(paddr_t start, paddr_t end, nodeid_t node)
-{
- int i;
-
- for (i = 0; i < num_node_memblks; i++) {
- struct node *nd = &node_memblk_range[i];
-
- if (nd->start <= start && nd->end >= end &&
- memblk_nodeid[i] == node)
- return 1;
- }
-
- return 0;
-}
-
-static
-enum conflicts __init conflicting_memblks(nodeid_t nid, paddr_t start,
- paddr_t end, paddr_t nd_start,
- paddr_t nd_end, unsigned int *mblkid)
-{
- unsigned int i;
-
- /*
- * Scan all recorded nodes' memory blocks to check conflicts:
- * Overlap or interleave.
- */
- for (i = 0; i < num_node_memblks; i++) {
- struct node *nd = &node_memblk_range[i];
-
- *mblkid = i;
-
- /* Skip 0 bytes node memory block. */
- if (nd->start == nd->end)
- continue;
- /*
- * Use memblk range to check memblk overlaps, include the
- * self-overlap case. As nd's range is non-empty, the special
- * case "nd->end == end && nd->start == start" also can be
covered.
- */
- if (nd->end > start && nd->start < end)
- return OVERLAP;
-
- /*
- * Use node memory range to check whether new range contains
- * memory from other nodes - interleave check. We just need
- * to check full contains situation. Because overlaps have
- * been checked above.
- */
- if (nid != memblk_nodeid[i] &&
- nd->start >= nd_start && nd->end <= nd_end)
- return INTERLEAVE;
- }
-
- return NO_CONFLICT;
-}
-
-static __init void cutoff_node(int i, paddr_t start, paddr_t end)
-{
- struct node *nd = &nodes[i];
- if (nd->start < start) {
- nd->start = start;
- if (nd->end < nd->start)
- nd->start = nd->end;
- }
- if (nd->end > end) {
- nd->end = end;
- if (nd->start > nd->end)
- nd->start = nd->end;
- }
-}
-
-static __init void bad_srat(void)
+void __init numa_fw_bad(void)
{
int i;
printk(KERN_ERR "SRAT: SRAT not used.\n");
@@ -241,7 +153,7 @@ acpi_numa_x2apic_affinity_init(const struct
acpi_srat_x2apic_cpu_affinity *pa)
if (numa_disabled())
return;
if (pa->header.length < sizeof(struct acpi_srat_x2apic_cpu_affinity)) {
- bad_srat();
+ numa_fw_bad();
return;
}
if (!(pa->flags & ACPI_SRAT_CPU_ENABLED))
@@ -254,12 +166,12 @@ acpi_numa_x2apic_affinity_init(const struct
acpi_srat_x2apic_cpu_affinity *pa)
pxm = pa->proximity_domain;
node = setup_node(pxm);
if (node == NUMA_NO_NODE) {
- bad_srat();
+ numa_fw_bad();
return;
}
apicid_to_node[pa->apic_id] = node;
- node_set(node, processor_nodes_parsed);
+ numa_set_processor_nodes_parsed(node);
acpi_numa = 1;
if (opt_acpi_verbose)
@@ -277,7 +189,7 @@ acpi_numa_processor_affinity_init(const struct
acpi_srat_cpu_affinity *pa)
if (numa_disabled())
return;
if (pa->header.length != sizeof(struct acpi_srat_cpu_affinity)) {
- bad_srat();
+ numa_fw_bad();
return;
}
if (!(pa->flags & ACPI_SRAT_CPU_ENABLED))
@@ -290,11 +202,11 @@ acpi_numa_processor_affinity_init(const struct
acpi_srat_cpu_affinity *pa)
}
node = setup_node(pxm);
if (node == NUMA_NO_NODE) {
- bad_srat();
+ numa_fw_bad();
return;
}
apicid_to_node[pa->apic_id] = node;
- node_set(node, processor_nodes_parsed);
+ numa_set_processor_nodes_parsed(node);
acpi_numa = 1;
if (opt_acpi_verbose)
@@ -306,32 +218,28 @@ acpi_numa_processor_affinity_init(const struct
acpi_srat_cpu_affinity *pa)
void __init
acpi_numa_memory_affinity_init(const struct acpi_srat_mem_affinity *ma)
{
- struct node *nd;
- paddr_t nd_start, nd_end;
- paddr_t start, end;
unsigned pxm;
nodeid_t node;
- unsigned int i;
+ int ret;
if (numa_disabled())
return;
if (ma->header.length != sizeof(struct acpi_srat_mem_affinity)) {
- bad_srat();
+ numa_fw_bad();
return;
}
if (!(ma->flags & ACPI_SRAT_MEM_ENABLED))
return;
- start = ma->base_address;
- end = start + ma->length;
/* Supplement the heuristics in l1tf_calculations(). */
- l1tf_safe_maddr = max(l1tf_safe_maddr, ROUNDUP(end, PAGE_SIZE));
+ l1tf_safe_maddr = max(l1tf_safe_maddr,
+ ROUNDUP(ma->base_address + ma->length,
+ PAGE_SIZE));
- if (num_node_memblks >= NR_NODE_MEMBLKS)
- {
+ if (!numa_memblks_available()) {
dprintk(XENLOG_WARNING,
- "Too many numa entry, try bigger NR_NODE_MEMBLKS \n");
- bad_srat();
+ "Too many numa entries, try bigger NR_NODE_MEMBLKS!\n");
+ numa_fw_bad();
return;
}
@@ -340,134 +248,15 @@ acpi_numa_memory_affinity_init(const struct
acpi_srat_mem_affinity *ma)
pxm &= 0xff;
node = setup_node(pxm);
if (node == NUMA_NO_NODE) {
- bad_srat();
- return;
- }
-
- /*
- * For the node that already has some memory blocks, we will
- * expand the node memory range temporarily to check memory
- * interleaves with other nodes. We will not use this node
- * temp memory range to check overlaps, because it will mask
- * the overlaps in same node.
- *
- * Node with 0 bytes memory doesn't need this expandsion.
- */
- nd_start = start;
- nd_end = end;
- nd = &nodes[node];
- if (nd->start != nd->end) {
- if (nd_start > nd->start)
- nd_start = nd->start;
-
- if (nd_end < nd->end)
- nd_end = nd->end;
- }
-
- /* It is fine to add this area to the nodes data it will be used later*/
- switch (conflicting_memblks(node, start, end, nd_start, nd_end, &i)) {
- case OVERLAP:
- if (memblk_nodeid[i] == node) {
- bool mismatch = !(ma->flags &
- ACPI_SRAT_MEM_HOT_PLUGGABLE) !=
- !test_bit(i, memblk_hotplug);
-
- printk("%sSRAT: PXM %u [%"PRIpaddr", %"PRIpaddr"]
overlaps with itself [%"PRIpaddr", %"PRIpaddr"]\n",
- mismatch ? KERN_ERR : KERN_WARNING, pxm, start,
- end - 1, node_memblk_range[i].start,
- node_memblk_range[i].end - 1);
- if (mismatch) {
- bad_srat();
- return;
- }
- break;
- }
-
- printk(KERN_ERR
- "SRAT: PXM %u [%"PRIpaddr", %"PRIpaddr"] overlaps with
PXM %u [%"PRIpaddr", %"PRIpaddr"]\n",
- pxm, start, end - 1, node_to_pxm(memblk_nodeid[i]),
- node_memblk_range[i].start,
- node_memblk_range[i].end - 1);
- bad_srat();
- return;
-
- case INTERLEAVE:
- printk(KERN_ERR
- "SRAT： PXM %u: [%"PRIpaddr", %"PRIpaddr"] interleaves
with PXM %u memblk [%"PRIpaddr", %"PRIpaddr"]\n",
- pxm, nd_start, nd_end - 1, node_to_pxm(memblk_nodeid[i]),
- node_memblk_range[i].start, node_memblk_range[i].end -
1);
- bad_srat();
+ numa_fw_bad();
return;
-
- case NO_CONFLICT:
- break;
}
- if (!(ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE)) {
- node_set(node, memory_nodes_parsed);
- nd->start = nd_start;
- nd->end = nd_end;
- }
-
- printk(KERN_INFO "SRAT: Node %u PXM %u [%"PRIpaddr", %"PRIpaddr"]%s\n",
- node, pxm, start, end - 1,
- ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE ? " (hotplug)" : "");
-
- node_memblk_range[num_node_memblks].start = start;
- node_memblk_range[num_node_memblks].end = end;
- memblk_nodeid[num_node_memblks] = node;
- if (ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) {
- __set_bit(num_node_memblks, memblk_hotplug);
- if (end > mem_hotplug)
- mem_hotplug = end;
- }
- num_node_memblks++;
-}
-
-/* Sanity check to catch more bad SRATs (they are amazingly common).
- Make sure the PXMs cover all memory. */
-static int __init nodes_cover_memory(void)
-{
- unsigned int i;
-
- for (i = 0; ; i++) {
- int j, found;
- paddr_t start, end;
-
- /* Try to loop memory map from index 0 to end to get RAM
ranges. */
- found = arch_get_ram_range(i, &start, &end);
-
- /* Index relate entry is not RAM, skip it. */
- if (found == -EINVAL)
- continue;
-
- /* Reach the end of arch's memory map */
- if (found == -ENOENT)
- break;
-
- do {
- found = 0;
- for_each_node_mask(j, memory_nodes_parsed)
- if (start < nodes[j].end
- && end > nodes[j].start) {
- if (start >= nodes[j].start) {
- start = nodes[j].end;
- found = 1;
- }
- if (end <= nodes[j].end) {
- end = nodes[j].start;
- found = 1;
- }
- }
- } while (found && start < end);
-
- if (start < end) {
- printk(KERN_ERR "NUMA: No NODE for RAM range: "
- "[%"PRIpaddr", %"PRIpaddr"]\n", start, end - 1);
- return 0;
- }
- }
- return 1;
+ ret = numa_update_node_memblks(node, pxm, ma->base_address,
+ ma->length, "PXM",
+ ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE);
+ if (ret)
+ numa_fw_bad();
}
void __init acpi_numa_arch_fixup(void) {}
@@ -523,59 +312,9 @@ void __init srat_parse_regions(paddr_t addr)
pfn_pdx_hole_setup(mask >> PAGE_SHIFT);
}
-/* Use the information discovered above to actually set up the nodes. */
-int __init numa_scan_nodes(paddr_t start, paddr_t end)
-{
- int i;
- nodemask_t all_nodes_parsed;
-
- /* First clean up the node list */
- for (i = 0; i < MAX_NUMNODES; i++)
- cutoff_node(i, start, end);
-
- if (acpi_numa <= 0)
- return -1;
-
- if (!nodes_cover_memory()) {
- bad_srat();
- return -1;
- }
-
- memnode_shift = compute_hash_shift(node_memblk_range, num_node_memblks,
- memblk_nodeid);
-
- if (memnode_shift < 0) {
- printk(KERN_ERR
- "SRAT: No NUMA node hash function found. Contact
maintainer\n");
- bad_srat();
- return -1;
- }
-
- nodes_or(all_nodes_parsed, memory_nodes_parsed, processor_nodes_parsed);
-
- /* Finally register nodes */
- for_each_node_mask(i, all_nodes_parsed)
- {
- uint64_t size = nodes[i].end - nodes[i].start;
-
- if ( size == 0 )
- printk(KERN_INFO "SRAT: node %u has no memory\n", i);
-
- setup_node_bootmem(i, nodes[i].start, nodes[i].end);
- }
- for (i = 0; i < nr_cpu_ids; i++) {
- if (cpu_to_node[i] == NUMA_NO_NODE)
- continue;
- if (!nodemask_test(cpu_to_node[i], &processor_nodes_parsed))
- numa_set_node(i, NUMA_NO_NODE);
- }
- numa_init_array();
- return 0;
-}
-
-static unsigned node_to_pxm(nodeid_t n)
+unsigned int numa_node_to_arch_nid(nodeid_t n)
{
- unsigned i;
+ unsigned int i;
if ((n < ARRAY_SIZE(pxm2node)) && (pxm2node[n].node == n))
return pxm2node[n].pxm;
@@ -592,8 +331,8 @@ u8 __node_distance(nodeid_t a, nodeid_t b)
if (!acpi_slit)
return a == b ? 10 : 20;
- index = acpi_slit->locality_count * node_to_pxm(a);
- slit_val = acpi_slit->entry[index + node_to_pxm(b)];
+ index = acpi_slit->locality_count * numa_node_to_arch_nid(a);
+ slit_val = acpi_slit->entry[index + numa_node_to_arch_nid(b)];
/* ACPI defines 0xff as an unreachable node and 0-9 are undefined */
if ((slit_val == 0xff) || (slit_val <= 9))
diff --git a/xen/common/numa.c b/xen/common/numa.c
index 0bc5113753..3b8b475af7 100644
--- a/xen/common/numa.c
+++ b/xen/common/numa.c
@@ -13,6 +13,21 @@
#include <xen/sched.h>
#include <xen/softirq.h>
+static nodemask_t __initdata processor_nodes_parsed;
+static nodemask_t __initdata memory_nodes_parsed;
+static struct node __initdata nodes[MAX_NUMNODES];
+
+static int __ro_after_init num_node_memblks;
+static struct node __ro_after_init node_memblk_range[NR_NODE_MEMBLKS];
+static nodeid_t __ro_after_init memblk_nodeid[NR_NODE_MEMBLKS];
+static __initdata DECLARE_BITMAP(memblk_hotplug, NR_NODE_MEMBLKS);
+
+enum conflicts {
+ NO_CONFLICT,
+ OVERLAP,
+ INTERLEAVE,
+};
+
struct node_data __ro_after_init node_data[MAX_NUMNODES];
/* Mapping from pdx to node id */
@@ -36,6 +51,308 @@ bool numa_disabled(void)
return numa_off || arch_numa_disabled(false);
}
+void __init numa_set_processor_nodes_parsed(nodeid_t node)
+{
+ node_set(node, processor_nodes_parsed);
+}
+
+unsigned int valid_numa_range(paddr_t start, paddr_t end, nodeid_t node)
+{
+ unsigned int i;
+
+ for ( i = 0; i < num_node_memblks; i++ )
+ {
+ struct node *nd = &node_memblk_range[i];
+
+ if ( nd->start <= start && nd->end >= end &&
+ memblk_nodeid[i] == node )
+ return 1;
+ }
+
+ return 0;
+}
+
+static
+enum conflicts __init conflicting_memblks(nodeid_t nid, paddr_t start,
+ paddr_t end, paddr_t nd_start,
+ paddr_t nd_end, unsigned int *mblkid)
+{
+ unsigned int i;
+
+ /*
+ * Scan all recorded nodes' memory blocks to check conflicts:
+ * Overlap or interleave.
+ */
+ for ( i = 0; i < num_node_memblks; i++ )
+ {
+ struct node *nd = &node_memblk_range[i];
+
+ *mblkid = i;
+
+ /* Skip 0 bytes node memory block. */
+ if ( nd->start == nd->end )
+ continue;
+ /*
+ * Use memblk range to check memblk overlaps, include the
+ * self-overlap case. As nd's range is non-empty, the special
+ * case "nd->end == end && nd->start == start" also can be covered.
+ */
+ if ( nd->end > start && nd->start < end )
+ return OVERLAP;
+
+ /*
+ * Use node memory range to check whether new range contains
+ * memory from other nodes - interleave check. We just need
+ * to check full contains situation. Because overlaps have
+ * been checked above.
+ */
+ if ( nid != memblk_nodeid[i] &&
+ nd->start >= nd_start && nd->end <= nd_end )
+ return INTERLEAVE;
+ }
+
+ return NO_CONFLICT;
+}
+
+static void __init cutoff_node(nodeid_t i, paddr_t start, paddr_t end)
+{
+ struct node *nd = &nodes[i];
+
+ if ( nd->start < start )
+ {
+ nd->start = start;
+ if ( nd->end < nd->start )
+ nd->start = nd->end;
+ }
+
+ if ( nd->end > end )
+ {
+ nd->end = end;
+ if ( nd->start > nd->end )
+ nd->start = nd->end;
+ }
+}
+
+bool __init numa_memblks_available(void)
+{
+ return num_node_memblks < NR_NODE_MEMBLKS;
+}
+
+/*
+ * This function will be called by NUMA memory affinity initialization to
+ * update NUMA node's memory range. In this function, we assume all memory
+ * regions belonging to a single node are in one chunk. Holes (or MMIO
+ * ranges) between them will be included in the node.
+ *
+ * So in numa_update_node_memblks, if there are multiple banks for each
+ * node, start and end are stretched to cover the holes between them, and
+ * it works as long as memory banks of different NUMA nodes don't interleave.
+ */
+int __init numa_update_node_memblks(nodeid_t node, unsigned int arch_nid,
+ paddr_t start, paddr_t size,
+ const char *prefix,
+ bool hotplug)
+{
+ unsigned int i;
+ paddr_t end = start + size;
+ paddr_t nd_start = start;
+ paddr_t nd_end = end;
+ struct node *nd = &nodes[node];
+
+ /*
+ * For the node that already has some memory blocks, we will
+ * expand the node memory range temporarily to check memory
+ * interleaves with other nodes. We will not use this node
+ * temp memory range to check overlaps, because it will mask
+ * the overlaps in same node.
+ *
+ * Node with 0 bytes memory doesn't need this expandsion.
+ */
+ if ( nd->start != nd->end )
+ {
+ if ( nd_start > nd->start )
+ nd_start = nd->start;
+
+ if ( nd_end < nd->end )
+ nd_end = nd->end;
+ }
+
+ /* It is fine to add this area to the nodes data it will be used later*/
+ switch ( conflicting_memblks(node, start, end, nd_start, nd_end, &i) )
+ {
+ case OVERLAP:
+ if ( memblk_nodeid[i] == node )
+ {
+ bool mismatch = !(hotplug) != !test_bit(i, memblk_hotplug);
+
+ printk("%sNUMA: %s %u [%"PRIpaddr", %"PRIpaddr"] overlaps with
itself [%"PRIpaddr", %"PRIpaddr"]\n",
+ mismatch ? KERN_ERR : KERN_WARNING, prefix,
+ arch_nid, start, end - 1,
+ node_memblk_range[i].start, node_memblk_range[i].end - 1);
+ if ( mismatch )
+ return -EINVAL;
+ break;
+ }
+
+ printk(KERN_ERR
+ "NUMA: %s %u [%"PRIpaddr", %"PRIpaddr"] overlaps with %s %u
[%"PRIpaddr", %"PRIpaddr"]\n",
+ prefix, arch_nid, start, end - 1, prefix,
+ numa_node_to_arch_nid(memblk_nodeid[i]),
+ node_memblk_range[i].start, node_memblk_range[i].end - 1);
+ return -EINVAL;
+
+
+ case INTERLEAVE:
+ printk(KERN_ERR
+ "NUMA： %s %u: [%"PRIpaddr", %"PRIpaddr"] interleaves with %s %u
memblk [%"PRIpaddr", %"PRIpaddr"]\n",
+ prefix, arch_nid, nd_start, nd_end - 1,
+ prefix, numa_node_to_arch_nid(memblk_nodeid[i]),
+ node_memblk_range[i].start, node_memblk_range[i].end - 1);
+ return -EINVAL;
+
+ case NO_CONFLICT:
+ break;
+ }
+
+ if ( !hotplug )
+ {
+ node_set(node, memory_nodes_parsed);
+ nd->start = nd_start;
+ nd->end = nd_end;
+ }
+
+ if ( strcasecmp("Node", prefix) )
+ printk(KERN_INFO "NUMA: Node %u %s %u [%"PRIpaddr", %"PRIpaddr"]%s\n",
+ node, prefix, arch_nid, start, end - 1,
+ hotplug ? " (hotplug)" : "");
+ else
+ printk(KERN_INFO "NUMA: Node %u [%"PRIpaddr", %"PRIpaddr"]%s\n",
+ node, start, end - 1, hotplug ? " (hotplug)" : "");
+
+ node_memblk_range[num_node_memblks].start = start;
+ node_memblk_range[num_node_memblks].end = end;
+ memblk_nodeid[num_node_memblks] = node;
+ if ( hotplug )
+ {
+ __set_bit(num_node_memblks, memblk_hotplug);
+ if ( end > mem_hotplug )
+ mem_hotplug = end;
+ }
+ num_node_memblks++;
+
+ return 0;
+}
+
+/*
+ * Sanity check to catch more bad SRATs (they are amazingly common).
+ * Make sure the PXMs cover all memory.
+ */
+static int __init nodes_cover_memory(void)
+{
+ unsigned int i;
+
+ for ( i = 0; ; i++ )
+ {
+ int found;
+ nodeid_t j;
+ paddr_t start, end;
+
+ /* Try to loop memory map from index 0 to end to get RAM ranges. */
+ found = arch_get_ram_range(i, &start, &end);
+
+ /* Index relate entry is not RAM, skip it. */
+ if ( found == -EINVAL )
+ continue;
+
+ /* Reach the end of arch's memory map */
+ if ( found == -ENOENT )
+ break;
+
+ do {
+ found = 0;
+ for_each_node_mask( j, memory_nodes_parsed )
+ if ( start < nodes[j].end
+ && end > nodes[j].start )
+ {
+ if ( start >= nodes[j].start )
+ {
+ start = nodes[j].end;
+ found = 1;
+ }
+
+ if ( end <= nodes[j].end )
+ {
+ end = nodes[j].start;
+ found = 1;
+ }
+ }
+ } while ( found && start < end );
+
+ if ( start < end )
+ {
+ printk(KERN_ERR "NUMA: No node for RAM range: "
+ "[%"PRIpaddr", %"PRIpaddr"]\n", start, end - 1);
+ return 0;
+ }
+ }
+ return 1;
+}
+
+/* Use the information discovered above to actually set up the nodes. */
+static int __init numa_scan_nodes(paddr_t start, paddr_t end)
+{
+ unsigned int i;
+ nodemask_t all_nodes_parsed;
+
+ /* First clean up the node list */
+ for ( i = 0; i < MAX_NUMNODES; i++ )
+ cutoff_node(i, start, end);
+
+ /* When numa is on with good firmware, we can do numa scan nodes. */
+ if ( arch_numa_disabled(true) )
+ return -1;
+
+ if ( !nodes_cover_memory() )
+ {
+ numa_fw_bad();
+ return -1;
+ }
+
+ memnode_shift = compute_hash_shift(node_memblk_range, num_node_memblks,
+ memblk_nodeid);
+
+ if ( memnode_shift < 0 )
+ {
+ printk(KERN_ERR
+ "NUMA: No NUMA node hash function found. Contact maintainer\n");
+ numa_fw_bad();
+ return -1;
+ }
+
+ nodes_or(all_nodes_parsed, memory_nodes_parsed, processor_nodes_parsed);
+
+ /* Finally register nodes */
+ for_each_node_mask( i, all_nodes_parsed )
+ {
+ paddr_t size = nodes[i].end - nodes[i].start;
+
+ if ( size == 0 )
+ printk(KERN_INFO "NUMA: node %u has no memory\n", i);
+
+ setup_node_bootmem(i, nodes[i].start, nodes[i].end);
+ }
+
+ for ( i = 0; i < nr_cpu_ids; i++ )
+ {
+ if ( cpu_to_node[i] == NUMA_NO_NODE )
+ continue;
+ if ( !nodemask_test(cpu_to_node[i], &processor_nodes_parsed) )
+ numa_set_node(i, NUMA_NO_NODE);
+ }
+ numa_init_array();
+ return 0;
+}
+
/*
* Given a shift value, try to populate memnodemap[]
* Returns :
diff --git a/xen/common/page_alloc.c b/xen/common/page_alloc.c
index 00fa24e330..641d864774 100644
--- a/xen/common/page_alloc.c
+++ b/xen/common/page_alloc.c
@@ -159,6 +159,8 @@
#define PGT_TYPE_INFO_INITIALIZER 0
#endif
+paddr_t __read_mostly mem_hotplug;
+
/*
* Comma-separated list of hexadecimal page numbers containing bad bytes.
* e.g. 'badpage=0x3f45,0x8a321'.
diff --git a/xen/include/xen/mm.h b/xen/include/xen/mm.h
index 35b065146f..7b5ba5c189 100644
--- a/xen/include/xen/mm.h
+++ b/xen/include/xen/mm.h
@@ -58,6 +58,8 @@
#include <xen/perfc.h>
#include <public/memory.h>
+extern paddr_t mem_hotplug;
+
struct page_info;
void put_page(struct page_info *);
diff --git a/xen/include/xen/numa.h b/xen/include/xen/numa.h
index d64006483a..b5c9de24ed 100644
--- a/xen/include/xen/numa.h
+++ b/xen/include/xen/numa.h
@@ -11,6 +11,7 @@
#define NUMA_NO_DISTANCE 0xFF
#define MAX_NUMNODES (1 << NODES_SHIFT)
+#define NR_NODE_MEMBLKS (MAX_NUMNODES * 2)
#define vcpu_to_node(v) (cpu_to_node((v)->processor))
@@ -41,7 +42,7 @@ extern void numa_add_cpu(unsigned int cpu);
extern void numa_init_array(void);
extern void numa_set_node(unsigned int cpu, nodeid_t node);
extern void numa_initmem_init(unsigned long start_pfn, unsigned long end_pfn);
-extern int numa_scan_nodes(paddr_t start, paddr_t end);
+extern void numa_fw_bad(void);
extern int arch_numa_setup(const char *opt);
extern bool arch_numa_disabled(bool init_as_disable);
@@ -82,6 +83,14 @@ static inline __attribute_pure__ nodeid_t
phys_to_nid(paddr_t addr)
extern int arch_get_ram_range(unsigned int idx,
paddr_t *start, paddr_t *end);
+extern unsigned int valid_numa_range(paddr_t start, paddr_t end,
+ nodeid_t node);
+extern bool numa_memblks_available(void);
+extern int numa_update_node_memblks(nodeid_t node, unsigned int arch_nid,
+ paddr_t start, paddr_t size,
+ const char *prefix,
+ bool hotplug);
+extern void numa_set_processor_nodes_parsed(nodeid_t node);
#endif
--
2.25.1
|
 |
Lists.xenproject.org is hosted with RackSpace, monitoring our |