Rev 32 | Rev 34 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
29 | jermar | 1 | /* |
2 | * Copyright (C) 2005 Jakub Jermar |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * - The name of the author may not be used to endorse or promote products |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
||
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
29 | #include <arch/acpi/acpi.h> |
||
33 | jermar | 30 | #include <arch/acpi/madt.h> |
32 | jermar | 31 | #include <arch/bios/bios.h> |
29 | jermar | 32 | |
33 | jermar | 33 | #include <mm/page.h> |
34 | |||
32 | jermar | 35 | #define RSDP_SIGNATURE "RSD PTR " |
36 | #define RSDP_REVISION_OFFS 15 |
||
37 | |||
29 | jermar | 38 | struct acpi_rsdp *acpi_rsdp = NULL; |
33 | jermar | 39 | struct acpi_rsdt *acpi_rsdt = NULL; |
40 | struct acpi_xsdt *acpi_xsdt = NULL; |
||
29 | jermar | 41 | |
33 | jermar | 42 | struct acpi_signature_map signature_map[] = { |
43 | { "APIC", (struct acpi_sdt_header **) &acpi_madt, "Multiple APIC Description Table" } |
||
44 | }; |
||
45 | |||
32 | jermar | 46 | int rsdp_check(__u8 *rsdp) { |
47 | struct acpi_rsdp *r = (struct acpi_rsdp *) rsdp; |
||
48 | __u8 sum = 0; |
||
49 | int i; |
||
50 | |||
51 | for (i=0; i<20; i++) |
||
52 | sum += rsdp[i]; |
||
53 | |||
54 | if (sum) |
||
55 | return 0; /* bad checksum */ |
||
56 | |||
57 | if (r->revision == 0) |
||
58 | return 1; /* ACPI 1.0 */ |
||
59 | |||
60 | for (; i<r->length; i++) |
||
61 | sum += rsdp[i]; |
||
62 | |||
63 | return !sum; |
||
64 | |||
65 | } |
||
66 | |||
33 | jermar | 67 | int acpi_sdt_check(__u8 *sdt) |
68 | { |
||
69 | struct acpi_sdt_header *h = (struct acpi_sdt_header *) sdt; |
||
70 | __u8 sum = 0; |
||
71 | int i; |
||
72 | |||
73 | for (i=0; i<h->length; i++) |
||
74 | sum += sdt[i]; |
||
75 | |||
76 | return !sum; |
||
77 | } |
||
78 | |||
79 | void map_sdt(struct acpi_sdt_header *sdt) |
||
80 | { |
||
81 | map_page_to_frame((__address) sdt, (__address) sdt, PAGE_NOT_CACHEABLE, 0); |
||
82 | } |
||
83 | |||
29 | jermar | 84 | void acpi_init(void) |
85 | { |
||
32 | jermar | 86 | __u8 *addr[2] = { NULL, (__u8 *) 0xe0000 }; |
87 | int i, j, length[2] = { 1024, 128*1024 }; |
||
88 | __u64 *sig = (__u64 *) RSDP_SIGNATURE; |
||
89 | |||
90 | /* |
||
91 | * Find Root System Description Pointer |
||
92 | * 1. search first 1K of EBDA |
||
93 | * 2. search 128K starting at 0xe0000 |
||
94 | */ |
||
95 | |||
96 | addr[0] = (__u8 *) ebda; |
||
97 | for (i = (ebda ? 0 : 1); i < 2; i++) { |
||
98 | for (j = 0; j < length[i]; j += 16) { |
||
99 | if (*((__u64 *) &addr[i][j]) == *sig && rsdp_check(&addr[i][j])) { |
||
100 | acpi_rsdp = (struct acpi_rsdp *) &addr[i][j]; |
||
101 | goto rsdp_found; |
||
102 | } |
||
103 | } |
||
104 | } |
||
105 | |||
106 | return; |
||
107 | |||
108 | rsdp_found: |
||
33 | jermar | 109 | printf("%L: ACPI Root System Description Pointer\n", acpi_rsdp); |
110 | |||
111 | acpi_rsdt = (struct acpi_rsdt *) acpi_rsdp->rsdt_address; |
||
112 | if (acpi_rsdp->revision) acpi_xsdt = (struct acpi_xsdt *) ((__address) acpi_rsdp->xsdt_address); |
||
113 | |||
114 | if (acpi_rsdt) map_sdt((struct acpi_sdt_header *) acpi_rsdt); |
||
115 | if (acpi_xsdt) map_sdt((struct acpi_sdt_header *) acpi_xsdt); |
||
116 | |||
117 | if (acpi_rsdt && !acpi_sdt_check((__u8 *) acpi_rsdt)) { |
||
118 | printf("RSDT: %s\n", "bad checksum"); |
||
119 | return; |
||
120 | } |
||
121 | if (acpi_xsdt && !acpi_sdt_check((__u8 *) acpi_xsdt)) { |
||
122 | printf("XSDT: %s\n", "bad checksum"); |
||
123 | return; |
||
124 | } |
||
125 | |||
126 | if (acpi_xsdt) configure_via_xsdt(); |
||
127 | else if (acpi_rsdt) configure_via_rsdt(); |
||
128 | |||
29 | jermar | 129 | } |
33 | jermar | 130 | |
131 | void configure_via_rsdt(void) |
||
132 | { |
||
133 | int i, j, cnt = (acpi_rsdt->header.length - sizeof(struct acpi_sdt_header))/sizeof(__u32); |
||
134 | |||
135 | for (i=0; i<cnt; i++) { |
||
136 | for (j=0; j<sizeof(signature_map)/sizeof(struct acpi_signature_map); j++) { |
||
137 | struct acpi_sdt_header *h = (struct acpi_sdt_header *) acpi_rsdt->entry[i]; |
||
138 | |||
139 | map_sdt(h); |
||
140 | if (*((__u32 *) &h->signature[0])==*((__u32 *) &signature_map[j].signature[0])) { |
||
141 | if (!acpi_sdt_check((__u8 *) h)) |
||
142 | goto next; |
||
143 | *signature_map[j].sdt_ptr = h; |
||
144 | printf("%L: ACPI %s\n", *signature_map[j].sdt_ptr, signature_map[j].description); |
||
145 | } |
||
146 | } |
||
147 | next: |
||
148 | ; |
||
149 | } |
||
150 | } |
||
151 | |||
152 | void configure_via_xsdt(void) |
||
153 | { |
||
154 | int i, j, cnt = (acpi_xsdt->header.length - sizeof(struct acpi_sdt_header))/sizeof(__u64); |
||
155 | |||
156 | for (i=0; i<cnt; i++) { |
||
157 | for (j=0; j<sizeof(signature_map)/sizeof(struct acpi_signature_map); j++) { |
||
158 | struct acpi_sdt_header *h = (struct acpi_sdt_header *) ((__address) acpi_rsdt->entry[i]); |
||
159 | |||
160 | map_sdt(h); |
||
161 | if (*((__u32 *) &h->signature[0])==*((__u32 *) &signature_map[j].signature[0])) { |
||
162 | if (!acpi_sdt_check((__u8 *) h)) |
||
163 | goto next; |
||
164 | *signature_map[j].sdt_ptr = h; |
||
165 | printf("%L: ACPI %s\n", *signature_map[j].sdt_ptr, signature_map[j].description); |
||
166 | } |
||
167 | } |
||
168 | next: |
||
169 | ; |
||
170 | } |
||
171 | |||
172 | } |