1dd540b46SJohn Baldwin /*- 2dd540b46SJohn Baldwin * Copyright (c) 2010 Advanced Computing Technologies LLC 3dd540b46SJohn Baldwin * Written by: John H. Baldwin <jhb@FreeBSD.org> 4dd540b46SJohn Baldwin * All rights reserved. 5dd540b46SJohn Baldwin * 6dd540b46SJohn Baldwin * Redistribution and use in source and binary forms, with or without 7dd540b46SJohn Baldwin * modification, are permitted provided that the following conditions 8dd540b46SJohn Baldwin * are met: 9dd540b46SJohn Baldwin * 1. Redistributions of source code must retain the above copyright 10dd540b46SJohn Baldwin * notice, this list of conditions and the following disclaimer. 11dd540b46SJohn Baldwin * 2. Redistributions in binary form must reproduce the above copyright 12dd540b46SJohn Baldwin * notice, this list of conditions and the following disclaimer in the 13dd540b46SJohn Baldwin * documentation and/or other materials provided with the distribution. 14dd540b46SJohn Baldwin * 15dd540b46SJohn Baldwin * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 16dd540b46SJohn Baldwin * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 17dd540b46SJohn Baldwin * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 18dd540b46SJohn Baldwin * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 19dd540b46SJohn Baldwin * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 20dd540b46SJohn Baldwin * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 21dd540b46SJohn Baldwin * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 22dd540b46SJohn Baldwin * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 23dd540b46SJohn Baldwin * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 24dd540b46SJohn Baldwin * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 25dd540b46SJohn Baldwin * SUCH DAMAGE. 26dd540b46SJohn Baldwin */ 27dd540b46SJohn Baldwin 28dd540b46SJohn Baldwin #include <sys/cdefs.h> 29dd540b46SJohn Baldwin __FBSDID("$FreeBSD$"); 30dd540b46SJohn Baldwin 31dd540b46SJohn Baldwin #include <sys/param.h> 32dd540b46SJohn Baldwin #include <sys/bus.h> 33dd540b46SJohn Baldwin #include <sys/kernel.h> 34dd540b46SJohn Baldwin #include <sys/smp.h> 35dd540b46SJohn Baldwin #include <vm/vm.h> 36dd540b46SJohn Baldwin #include <vm/pmap.h> 37dd540b46SJohn Baldwin #include <vm/vm_param.h> 38dd540b46SJohn Baldwin #include <vm/vm_phys.h> 39dd540b46SJohn Baldwin 40dd540b46SJohn Baldwin #include <contrib/dev/acpica/include/acpi.h> 41dd540b46SJohn Baldwin #include <contrib/dev/acpica/include/actables.h> 42dd540b46SJohn Baldwin 43dd540b46SJohn Baldwin #include <machine/intr_machdep.h> 44dd540b46SJohn Baldwin #include <machine/apicvar.h> 45dd540b46SJohn Baldwin 46dd540b46SJohn Baldwin #include <dev/acpica/acpivar.h> 47dd540b46SJohn Baldwin 48dd540b46SJohn Baldwin struct cpu_info { 49dd540b46SJohn Baldwin int enabled:1; 50dd540b46SJohn Baldwin int has_memory:1; 51dd540b46SJohn Baldwin int domain; 52dd540b46SJohn Baldwin } cpus[MAX_APIC_ID + 1]; 53dd540b46SJohn Baldwin 54dd540b46SJohn Baldwin struct mem_affinity mem_info[VM_PHYSSEG_MAX + 1]; 55dd540b46SJohn Baldwin int num_mem; 56dd540b46SJohn Baldwin 57dd540b46SJohn Baldwin static ACPI_TABLE_SRAT *srat; 58dd540b46SJohn Baldwin static vm_paddr_t srat_physaddr; 59dd540b46SJohn Baldwin 60dd540b46SJohn Baldwin static void srat_walk_table(acpi_subtable_handler *handler, void *arg); 61dd540b46SJohn Baldwin 62dd540b46SJohn Baldwin static void 63dd540b46SJohn Baldwin srat_parse_entry(ACPI_SUBTABLE_HEADER *entry, void *arg) 64dd540b46SJohn Baldwin { 65dd540b46SJohn Baldwin ACPI_SRAT_CPU_AFFINITY *cpu; 66dd540b46SJohn Baldwin ACPI_SRAT_X2APIC_CPU_AFFINITY *x2apic; 67dd540b46SJohn Baldwin ACPI_SRAT_MEM_AFFINITY *mem; 68dd540b46SJohn Baldwin int domain, i, slot; 69dd540b46SJohn Baldwin 70dd540b46SJohn Baldwin switch (entry->Type) { 71dd540b46SJohn Baldwin case ACPI_SRAT_TYPE_CPU_AFFINITY: 72dd540b46SJohn Baldwin cpu = (ACPI_SRAT_CPU_AFFINITY *)entry; 73dd540b46SJohn Baldwin domain = cpu->ProximityDomainLo | 74dd540b46SJohn Baldwin cpu->ProximityDomainHi[0] << 8 | 75dd540b46SJohn Baldwin cpu->ProximityDomainHi[1] << 16 | 76dd540b46SJohn Baldwin cpu->ProximityDomainHi[2] << 24; 77dd540b46SJohn Baldwin if (bootverbose) 78dd540b46SJohn Baldwin printf("SRAT: Found CPU APIC ID %u domain %d: %s\n", 79dd540b46SJohn Baldwin cpu->ApicId, domain, 80dd540b46SJohn Baldwin (cpu->Flags & ACPI_SRAT_CPU_ENABLED) ? 81dd540b46SJohn Baldwin "enabled" : "disabled"); 82dd540b46SJohn Baldwin if (!(cpu->Flags & ACPI_SRAT_CPU_ENABLED)) 83dd540b46SJohn Baldwin break; 84dd540b46SJohn Baldwin KASSERT(!cpus[cpu->ApicId].enabled, 85dd540b46SJohn Baldwin ("Duplicate local APIC ID %u", cpu->ApicId)); 86dd540b46SJohn Baldwin cpus[cpu->ApicId].domain = domain; 87dd540b46SJohn Baldwin cpus[cpu->ApicId].enabled = 1; 88dd540b46SJohn Baldwin break; 89dd540b46SJohn Baldwin case ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY: 90dd540b46SJohn Baldwin x2apic = (ACPI_SRAT_X2APIC_CPU_AFFINITY *)entry; 91dd540b46SJohn Baldwin if (bootverbose) 92dd540b46SJohn Baldwin printf("SRAT: Found CPU APIC ID %u domain %d: %s\n", 93dd540b46SJohn Baldwin x2apic->ApicId, x2apic->ProximityDomain, 94dd540b46SJohn Baldwin (x2apic->Flags & ACPI_SRAT_CPU_ENABLED) ? 95dd540b46SJohn Baldwin "enabled" : "disabled"); 96dd540b46SJohn Baldwin if (!(x2apic->Flags & ACPI_SRAT_CPU_ENABLED)) 97dd540b46SJohn Baldwin break; 98dd540b46SJohn Baldwin KASSERT(!cpus[x2apic->ApicId].enabled, 99dd540b46SJohn Baldwin ("Duplicate local APIC ID %u", x2apic->ApicId)); 100dd540b46SJohn Baldwin cpus[x2apic->ApicId].domain = x2apic->ProximityDomain; 101dd540b46SJohn Baldwin cpus[x2apic->ApicId].enabled = 1; 102dd540b46SJohn Baldwin break; 103dd540b46SJohn Baldwin case ACPI_SRAT_TYPE_MEMORY_AFFINITY: 104dd540b46SJohn Baldwin mem = (ACPI_SRAT_MEM_AFFINITY *)entry; 105dd540b46SJohn Baldwin if (bootverbose) 106dd540b46SJohn Baldwin printf( 107dd540b46SJohn Baldwin "SRAT: Found memory domain %d addr %jx len %jx: %s\n", 108dd540b46SJohn Baldwin mem->ProximityDomain, (uintmax_t)mem->BaseAddress, 109dd540b46SJohn Baldwin (uintmax_t)mem->Length, 110dd540b46SJohn Baldwin (mem->Flags & ACPI_SRAT_MEM_ENABLED) ? 111dd540b46SJohn Baldwin "enabled" : "disabled"); 112dd540b46SJohn Baldwin if (!(mem->Flags & ACPI_SRAT_MEM_ENABLED)) 113dd540b46SJohn Baldwin break; 114dd540b46SJohn Baldwin if (num_mem == VM_PHYSSEG_MAX) { 115dd540b46SJohn Baldwin printf("SRAT: Too many memory regions\n"); 116dd540b46SJohn Baldwin *(int *)arg = ENXIO; 117dd540b46SJohn Baldwin break; 118dd540b46SJohn Baldwin } 119dd540b46SJohn Baldwin slot = num_mem; 120dd540b46SJohn Baldwin for (i = 0; i < num_mem; i++) { 121dd540b46SJohn Baldwin if (mem_info[i].end <= mem->BaseAddress) 122dd540b46SJohn Baldwin continue; 123dd540b46SJohn Baldwin if (mem_info[i].start < 124dd540b46SJohn Baldwin (mem->BaseAddress + mem->Length)) { 125dd540b46SJohn Baldwin printf("SRAT: Overlapping memory entries\n"); 126dd540b46SJohn Baldwin *(int *)arg = ENXIO; 127dd540b46SJohn Baldwin return; 128dd540b46SJohn Baldwin } 129dd540b46SJohn Baldwin slot = i; 130dd540b46SJohn Baldwin } 131dd540b46SJohn Baldwin for (i = num_mem; i > slot; i--) 132dd540b46SJohn Baldwin mem_info[i] = mem_info[i - 1]; 133dd540b46SJohn Baldwin mem_info[slot].start = mem->BaseAddress; 134dd540b46SJohn Baldwin mem_info[slot].end = mem->BaseAddress + mem->Length; 135dd540b46SJohn Baldwin mem_info[slot].domain = mem->ProximityDomain; 136dd540b46SJohn Baldwin num_mem++; 137dd540b46SJohn Baldwin break; 138dd540b46SJohn Baldwin } 139dd540b46SJohn Baldwin } 140dd540b46SJohn Baldwin 141dd540b46SJohn Baldwin /* 142dd540b46SJohn Baldwin * Ensure each memory domain has at least one CPU and that each CPU 143dd540b46SJohn Baldwin * has at least one memory domain. 144dd540b46SJohn Baldwin */ 145dd540b46SJohn Baldwin static int 146dd540b46SJohn Baldwin check_domains(void) 147dd540b46SJohn Baldwin { 148dd540b46SJohn Baldwin int found, i, j; 149dd540b46SJohn Baldwin 150dd540b46SJohn Baldwin for (i = 0; i < num_mem; i++) { 151dd540b46SJohn Baldwin found = 0; 152dd540b46SJohn Baldwin for (j = 0; j <= MAX_APIC_ID; j++) 153*6676877bSJohn Baldwin if (cpus[j].enabled && 154*6676877bSJohn Baldwin cpus[j].domain == mem_info[i].domain) { 155dd540b46SJohn Baldwin cpus[j].has_memory = 1; 156dd540b46SJohn Baldwin found++; 157dd540b46SJohn Baldwin } 158dd540b46SJohn Baldwin if (!found) { 159dd540b46SJohn Baldwin printf("SRAT: No CPU found for memory domain %d\n", 160dd540b46SJohn Baldwin mem_info[i].domain); 161dd540b46SJohn Baldwin return (ENXIO); 162dd540b46SJohn Baldwin } 163dd540b46SJohn Baldwin } 164dd540b46SJohn Baldwin for (i = 0; i <= MAX_APIC_ID; i++) 165dd540b46SJohn Baldwin if (cpus[i].enabled && !cpus[i].has_memory) { 166dd540b46SJohn Baldwin printf("SRAT: No memory found for CPU %d\n", i); 167dd540b46SJohn Baldwin return (ENXIO); 168dd540b46SJohn Baldwin } 169dd540b46SJohn Baldwin return (0); 170dd540b46SJohn Baldwin } 171dd540b46SJohn Baldwin 172dd540b46SJohn Baldwin /* 173dd540b46SJohn Baldwin * Check that the SRAT memory regions cover all of the regions in 174dd540b46SJohn Baldwin * phys_avail[]. 175dd540b46SJohn Baldwin */ 176dd540b46SJohn Baldwin static int 177dd540b46SJohn Baldwin check_phys_avail(void) 178dd540b46SJohn Baldwin { 179dd540b46SJohn Baldwin vm_paddr_t address; 180dd540b46SJohn Baldwin int i, j; 181dd540b46SJohn Baldwin 182dd540b46SJohn Baldwin /* j is the current offset into phys_avail[]. */ 183dd540b46SJohn Baldwin address = phys_avail[0]; 184dd540b46SJohn Baldwin j = 0; 185dd540b46SJohn Baldwin for (i = 0; i < num_mem; i++) { 186dd540b46SJohn Baldwin /* 187dd540b46SJohn Baldwin * Consume as many phys_avail[] entries as fit in this 188dd540b46SJohn Baldwin * region. 189dd540b46SJohn Baldwin */ 190dd540b46SJohn Baldwin while (address >= mem_info[i].start && 191dd540b46SJohn Baldwin address <= mem_info[i].end) { 192dd540b46SJohn Baldwin /* 193dd540b46SJohn Baldwin * If we cover the rest of this phys_avail[] entry, 194dd540b46SJohn Baldwin * advance to the next entry. 195dd540b46SJohn Baldwin */ 196dd540b46SJohn Baldwin if (phys_avail[j + 1] <= mem_info[i].end) { 197dd540b46SJohn Baldwin j += 2; 198dd540b46SJohn Baldwin if (phys_avail[j] == 0 && 199dd540b46SJohn Baldwin phys_avail[j + 1] == 0) { 200dd540b46SJohn Baldwin return (0); 201dd540b46SJohn Baldwin } 202dd540b46SJohn Baldwin address = phys_avail[j]; 203dd540b46SJohn Baldwin } else 204dd540b46SJohn Baldwin address = mem_info[i].end + 1; 205dd540b46SJohn Baldwin } 206dd540b46SJohn Baldwin } 207dd540b46SJohn Baldwin printf("SRAT: No memory region found for %jx - %jx\n", 208dd540b46SJohn Baldwin (uintmax_t)phys_avail[j], (uintmax_t)phys_avail[j + 1]); 209dd540b46SJohn Baldwin return (ENXIO); 210dd540b46SJohn Baldwin } 211dd540b46SJohn Baldwin 212dd540b46SJohn Baldwin /* 213dd540b46SJohn Baldwin * Renumber the memory domains to be compact and zero-based if not 214dd540b46SJohn Baldwin * already. 215dd540b46SJohn Baldwin */ 216dd540b46SJohn Baldwin static void 217dd540b46SJohn Baldwin renumber_domains(void) 218dd540b46SJohn Baldwin { 219dd540b46SJohn Baldwin int domains[VM_PHYSSEG_MAX]; 220dd540b46SJohn Baldwin int ndomain, i, j, slot; 221dd540b46SJohn Baldwin 222dd540b46SJohn Baldwin /* Enumerate all the domains. */ 223dd540b46SJohn Baldwin ndomain = 0; 224dd540b46SJohn Baldwin for (i = 0; i < num_mem; i++) { 225dd540b46SJohn Baldwin /* See if this domain is already known. */ 226dd540b46SJohn Baldwin for (j = 0; j < ndomain; j++) { 227dd540b46SJohn Baldwin if (domains[j] >= mem_info[i].domain) 228dd540b46SJohn Baldwin break; 229dd540b46SJohn Baldwin } 230dd540b46SJohn Baldwin if (j < ndomain && domains[j] == mem_info[i].domain) 231dd540b46SJohn Baldwin continue; 232dd540b46SJohn Baldwin 233dd540b46SJohn Baldwin /* Insert the new domain at slot 'j'. */ 234dd540b46SJohn Baldwin slot = j; 235dd540b46SJohn Baldwin for (j = ndomain; j > slot; j--) 236dd540b46SJohn Baldwin domains[j] = domains[j - 1]; 237dd540b46SJohn Baldwin domains[slot] = mem_info[i].domain; 238dd540b46SJohn Baldwin } 239dd540b46SJohn Baldwin 240dd540b46SJohn Baldwin /* Renumber each domain to its index in the sorted 'domains' list. */ 241dd540b46SJohn Baldwin for (i = 0; i < ndomain; i++) { 242dd540b46SJohn Baldwin /* 243dd540b46SJohn Baldwin * If the domain is already the right value, no need 244dd540b46SJohn Baldwin * to renumber. 245dd540b46SJohn Baldwin */ 246dd540b46SJohn Baldwin if (domains[i] == i) 247dd540b46SJohn Baldwin continue; 248dd540b46SJohn Baldwin 249dd540b46SJohn Baldwin /* Walk the cpu[] and mem_info[] arrays to renumber. */ 250dd540b46SJohn Baldwin for (j = 0; j < num_mem; j++) 251dd540b46SJohn Baldwin if (mem_info[j].domain == domains[i]) 252dd540b46SJohn Baldwin mem_info[j].domain = i; 253dd540b46SJohn Baldwin for (j = 0; j <= MAX_APIC_ID; j++) 254dd540b46SJohn Baldwin if (cpus[j].enabled && cpus[j].domain == domains[i]) 255dd540b46SJohn Baldwin cpus[j].domain = i; 256dd540b46SJohn Baldwin } 257dd540b46SJohn Baldwin } 258dd540b46SJohn Baldwin 259dd540b46SJohn Baldwin /* 260dd540b46SJohn Baldwin * Look for an ACPI System Resource Affinity Table ("SRAT") 261dd540b46SJohn Baldwin */ 262dd540b46SJohn Baldwin static void 263dd540b46SJohn Baldwin parse_srat(void *dummy) 264dd540b46SJohn Baldwin { 265dd540b46SJohn Baldwin int error; 266dd540b46SJohn Baldwin 267dd540b46SJohn Baldwin if (resource_disabled("srat", 0)) 268dd540b46SJohn Baldwin return; 269dd540b46SJohn Baldwin 270dd540b46SJohn Baldwin srat_physaddr = acpi_find_table(ACPI_SIG_SRAT); 271dd540b46SJohn Baldwin if (srat_physaddr == 0) 272dd540b46SJohn Baldwin return; 273dd540b46SJohn Baldwin 274dd540b46SJohn Baldwin /* 275dd540b46SJohn Baldwin * Make a pass over the table to populate the cpus[] and 276dd540b46SJohn Baldwin * mem_info[] tables. 277dd540b46SJohn Baldwin */ 278dd540b46SJohn Baldwin srat = acpi_map_table(srat_physaddr, ACPI_SIG_SRAT); 279dd540b46SJohn Baldwin error = 0; 280dd540b46SJohn Baldwin srat_walk_table(srat_parse_entry, &error); 281dd540b46SJohn Baldwin acpi_unmap_table(srat); 282dd540b46SJohn Baldwin srat = NULL; 283dd540b46SJohn Baldwin if (error || check_domains() != 0 || check_phys_avail() != 0) { 284dd540b46SJohn Baldwin srat_physaddr = 0; 285dd540b46SJohn Baldwin return; 286dd540b46SJohn Baldwin } 287dd540b46SJohn Baldwin 288dd540b46SJohn Baldwin renumber_domains(); 289dd540b46SJohn Baldwin 290dd540b46SJohn Baldwin /* Point vm_phys at our memory affinity table. */ 291dd540b46SJohn Baldwin mem_affinity = mem_info; 292dd540b46SJohn Baldwin } 293dd540b46SJohn Baldwin SYSINIT(parse_srat, SI_SUB_VM - 1, SI_ORDER_FIRST, parse_srat, NULL); 294dd540b46SJohn Baldwin 295dd540b46SJohn Baldwin static void 296dd540b46SJohn Baldwin srat_walk_table(acpi_subtable_handler *handler, void *arg) 297dd540b46SJohn Baldwin { 298dd540b46SJohn Baldwin 299dd540b46SJohn Baldwin acpi_walk_subtables(srat + 1, (char *)srat + srat->Header.Length, 300dd540b46SJohn Baldwin handler, arg); 301dd540b46SJohn Baldwin } 302dd540b46SJohn Baldwin 303dd540b46SJohn Baldwin /* 304dd540b46SJohn Baldwin * Setup per-CPU ACPI IDs. 305dd540b46SJohn Baldwin */ 306dd540b46SJohn Baldwin static void 307dd540b46SJohn Baldwin srat_set_cpus(void *dummy) 308dd540b46SJohn Baldwin { 309dd540b46SJohn Baldwin struct cpu_info *cpu; 310dd540b46SJohn Baldwin struct pcpu *pc; 311dd540b46SJohn Baldwin u_int i; 312dd540b46SJohn Baldwin 313dd540b46SJohn Baldwin if (srat_physaddr == 0) 314dd540b46SJohn Baldwin return; 315dd540b46SJohn Baldwin for (i = 0; i < MAXCPU; i++) { 316dd540b46SJohn Baldwin if (CPU_ABSENT(i)) 317dd540b46SJohn Baldwin continue; 318dd540b46SJohn Baldwin pc = pcpu_find(i); 319dd540b46SJohn Baldwin KASSERT(pc != NULL, ("no pcpu data for CPU %u", i)); 320dd540b46SJohn Baldwin cpu = &cpus[pc->pc_apic_id]; 321dd540b46SJohn Baldwin if (!cpu->enabled) 322dd540b46SJohn Baldwin panic("SRAT: CPU with APIC ID %u is not known", 323dd540b46SJohn Baldwin pc->pc_apic_id); 324dd540b46SJohn Baldwin pc->pc_domain = cpu->domain; 325dd540b46SJohn Baldwin if (bootverbose) 326dd540b46SJohn Baldwin printf("SRAT: CPU %u has memory domain %d\n", i, 327dd540b46SJohn Baldwin cpu->domain); 328dd540b46SJohn Baldwin } 329dd540b46SJohn Baldwin } 330dd540b46SJohn Baldwin SYSINIT(srat_set_cpus, SI_SUB_CPU, SI_ORDER_ANY, srat_set_cpus, NULL); 331