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