1 | /* $NetBSD: acpi_slit.c,v 1.3 2010/03/05 14:00:17 jruoho Exp $ */ |
2 | |
3 | /* |
4 | * Copyright (c) 2009 The NetBSD Foundation, Inc. |
5 | * All rights reserved. |
6 | * |
7 | * This code is derived from software contributed to The NetBSD Foundation |
8 | * by Christoph Egger. |
9 | * |
10 | * Redistribution and use in source and binary forms, with or without |
11 | * modification, are permitted provided that the following conditions |
12 | * are met: |
13 | * 1. Redistributions of source code must retain the above copyright |
14 | * notice, this list of conditions and the following disclaimer. |
15 | * 2. Redistributions in binary form must reproduce the above copyright |
16 | * notice, this list of conditions and the following disclaimer in the |
17 | * documentation and/or other materials provided with the distribution. |
18 | * |
19 | * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS |
20 | * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED |
21 | * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
22 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS |
23 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
24 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
25 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
26 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
27 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
28 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
29 | * POSSIBILITY OF SUCH DAMAGE. |
30 | */ |
31 | |
32 | #include <sys/cdefs.h> |
33 | __KERNEL_RCSID(0, "$NetBSD: acpi_slit.c,v 1.3 2010/03/05 14:00:17 jruoho Exp $" ); |
34 | |
35 | #include <sys/param.h> |
36 | #include <sys/systm.h> |
37 | |
38 | #include <dev/acpi/acpivar.h> |
39 | #include <dev/acpi/acpi_slit.h> |
40 | |
41 | static ACPI_TABLE_SLIT *slit; |
42 | |
43 | bool |
44 | acpislit_exist(void) |
45 | { |
46 | ACPI_TABLE_HEADER *table; |
47 | ACPI_STATUS rv; |
48 | |
49 | rv = AcpiGetTable(ACPI_SIG_SLIT, 1, (ACPI_TABLE_HEADER **)&table); |
50 | if (ACPI_FAILURE(rv)) |
51 | return false; |
52 | |
53 | /* Check if header is valid */ |
54 | if (table == NULL) |
55 | return false; |
56 | |
57 | if (table->Length == 0xffffffff) |
58 | return false; |
59 | |
60 | slit = (ACPI_TABLE_SLIT *)table; |
61 | |
62 | return true; |
63 | } |
64 | |
65 | int |
66 | acpislit_init(void) |
67 | { |
68 | if (!acpislit_exist()) |
69 | return EEXIST; |
70 | return 0; |
71 | } |
72 | |
73 | void |
74 | acpislit_dump(void) |
75 | { |
76 | uint64_t idx, count; |
77 | |
78 | count = acpislit_cpus(); |
79 | |
80 | aprint_debug("SLIT: matrix with %" PRIu64" nodes\n" , count); |
81 | aprint_debug("SLIT: " ); |
82 | for (idx = 0; idx < (count * count); idx++) { |
83 | aprint_debug("%u " , slit->Entry[idx]); |
84 | if ((idx % count) == (count - 1)) { |
85 | aprint_debug("\n" ); |
86 | if (idx < (count * count) - 1) |
87 | aprint_debug("SLIT: " ); |
88 | } |
89 | } |
90 | } |
91 | |
92 | uint32_t |
93 | acpislit_cpus(void) |
94 | { |
95 | return slit->LocalityCount; |
96 | } |
97 | |
98 | uint32_t |
99 | acpislit_distance(uint32_t cpu1, uint32_t cpu2) |
100 | { |
101 | uint64_t idx = cpu1 * slit->LocalityCount + cpu2; |
102 | return slit->Entry[idx]; |
103 | } |
104 | |