aboutsummaryrefslogtreecommitdiffstats
path: root/arch/x86_64/mm/srat.c
Commit message (Expand)AuthorAge
* [PATCH] Unify pxm_to_node() and node_to_pxm()Yasunori Goto2006-06-23
* [PATCH] x86_64: Handle empty node zeroDaniel Yeisley2006-05-30
* [PATCH] x86_64: Fix memory hotadd heuristicsAndi Kleen2006-05-16
* [PATCH] x86_64: Handle empty PXMs that only contain hotplug memoryAndi Kleen2006-04-09
* [PATCH] x86_64: Reserve SRAT hotadd memory on x86-64Andi Kleen2006-04-09
* [PATCH] x86_64: Rename struct node in x86-64 NUMA code to struct bootnodeAndi Kleen2006-03-25
* [PATCH] x86_64: Always pass full number of nodes to NUMA hash computationAndi Kleen2006-02-17
* [PATCH] x86_64: Relax SRAT covers all memory check a bitAndi Kleen2006-02-17
* [PATCH] x86_64: Do more checking in the SRAT header codeAndi Kleen2006-02-04
* [PATCH] x86_64: Clear more state when ignoring empty node in SRAT parsingAndi Kleen2006-02-04
* [PATCH] x86_64: Reject SRAT tables that don't cover all memoryAndi Kleen2006-01-11
* [PATCH] x86_64: Return -1 for unknown PCI bus affinityAndi Kleen2006-01-11
* [PATCH] x86_64: Validate SLIT tableAndi Kleen2006-01-11
* [PATCH] x86_64: Make node boundaries consistentMagnus Damm2005-11-14
* [PATCH] x86_64: Speed up numa_node_id by putting it directly into the PDAAndi Kleen2005-11-14
* [PATCH] x86-64: Use correct mask to compute conflicting nodes in SRATAndi Kleen2005-09-12
* [PATCH] x86-64: reset apicid<->node tables when SRAT cannot be parsedAndi Kleen2005-09-12
* [PATCH] x86-64: Clean up the SRAT node list before computing the hash functionAndi Kleen2005-09-12
* [PATCH] x86-64: Improve error handling for overlapping PXMs in SRAT.Andi Kleen2005-09-12
* [PATCH] x86-64: Use ACPI PXM to parse PCI<->node assignmentsAndi Kleen2005-09-12
* [PATCH] x86-64: Don't assign CPU numbers in SRAT parsingAndi Kleen2005-09-12
* [PATCH] x86_64: fix cpu_to_node setup for sparse apic_idsRavikiran G Thirumalai2005-07-29
* [PATCH] x86_64: Print a boot message for hotplug memory zonesAndi Kleen2005-07-29
* Linux-2.6.12-rc2v2.6.12-rc2Linus Torvalds2005-04-16