Rev 268 | Rev 311 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 268 | Rev 310 | ||
---|---|---|---|
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/types.h> |
29 | #include <arch/types.h> |
30 | #include <typedefs.h> |
30 | #include <typedefs.h> |
31 | #include <arch/acpi/acpi.h> |
31 | #include <arch/acpi/acpi.h> |
32 | #include <arch/acpi/madt.h> |
32 | #include <arch/acpi/madt.h> |
33 | #include <arch/smp/apic.h> |
33 | #include <arch/smp/apic.h> |
34 | #include <arch/smp/smp.h> |
34 | #include <arch/smp/smp.h> |
35 | #include <panic.h> |
35 | #include <panic.h> |
36 | #include <debug.h> |
36 | #include <debug.h> |
37 | #include <config.h> |
37 | #include <config.h> |
38 | #include <print.h> |
38 | #include <print.h> |
- | 39 | #include <mm/heap.h> |
|
- | 40 | #include <memstr.h> |
|
39 | 41 | ||
40 | struct acpi_madt *acpi_madt = NULL; |
42 | struct acpi_madt *acpi_madt = NULL; |
41 | 43 | ||
42 | #ifdef __SMP__ |
44 | #ifdef __SMP__ |
43 | 45 | ||
44 | /* |
- | |
45 | * NOTE: it is currently not completely clear to the authors of SPARTAN whether |
- | |
46 | * MADT can exist in such a form that entries of the same type are not consecutive. |
- | |
47 | * Because of this uncertainity, some entry types are explicitly checked for |
- | |
48 | * being consecutive with other entries of the same kind. |
- | |
49 | */ |
- | |
50 | - | ||
51 | static void madt_l_apic_entry(struct madt_l_apic *la, __u8 prev_type); |
46 | static void madt_l_apic_entry(struct madt_l_apic *la, __u32 index); |
52 | static void madt_io_apic_entry(struct madt_io_apic *ioa, __u8 prev_type); |
47 | static void madt_io_apic_entry(struct madt_io_apic *ioa, __u32 index); |
53 | 48 | ||
54 | struct madt_l_apic *madt_l_apic_entries = NULL; |
49 | struct madt_l_apic *madt_l_apic_entries = NULL; |
55 | struct madt_io_apic *madt_io_apic_entries = NULL; |
50 | struct madt_io_apic *madt_io_apic_entries = NULL; |
56 | 51 | ||
- | 52 | __u32 madt_l_apic_entry_index = 0; |
|
- | 53 | __u32 madt_io_apic_entry_index = 0; |
|
57 | int madt_l_apic_entry_cnt = 0; |
54 | int madt_l_apic_entry_cnt = 0; |
58 | int madt_io_apic_entry_cnt = 0; |
55 | int madt_io_apic_entry_cnt = 0; |
59 | 56 | ||
- | 57 | struct madt_apic_header * * madt_entries_index = NULL; |
|
- | 58 | int madt_entries_index_cnt = 0; |
|
- | 59 | ||
60 | char *entry[] = { |
60 | char *entry[] = { |
61 | "L_APIC", |
61 | "L_APIC", |
62 | "IO_APIC", |
62 | "IO_APIC", |
63 | "INTR_SRC_OVRD", |
63 | "INTR_SRC_OVRD", |
64 | "NMI_SRC", |
64 | "NMI_SRC", |
65 | "L_APIC_NMI", |
65 | "L_APIC_NMI", |
66 | "L_APIC_ADDR_OVRD", |
66 | "L_APIC_ADDR_OVRD", |
67 | "IO_SAPIC", |
67 | "IO_SAPIC", |
68 | "L_SAPIC", |
68 | "L_SAPIC", |
69 | "PLATFORM_INTR_SRC" |
69 | "PLATFORM_INTR_SRC" |
70 | }; |
70 | }; |
71 | 71 | ||
72 | /* |
72 | /* |
73 | * ACPI MADT Implementation of SMP configuration interface. |
73 | * ACPI MADT Implementation of SMP configuration interface. |
74 | */ |
74 | */ |
75 | static count_t madt_cpu_count(void); |
75 | static count_t madt_cpu_count(void); |
76 | static bool madt_cpu_enabled(index_t i); |
76 | static bool madt_cpu_enabled(index_t i); |
77 | static bool madt_cpu_bootstrap(index_t i); |
77 | static bool madt_cpu_bootstrap(index_t i); |
78 | static __u8 madt_cpu_apic_id(index_t i); |
78 | static __u8 madt_cpu_apic_id(index_t i); |
79 | 79 | ||
80 | struct smp_config_operations madt_config_operations = { |
80 | struct smp_config_operations madt_config_operations = { |
81 | .cpu_count = madt_cpu_count, |
81 | .cpu_count = madt_cpu_count, |
82 | .cpu_enabled = madt_cpu_enabled, |
82 | .cpu_enabled = madt_cpu_enabled, |
83 | .cpu_bootstrap = madt_cpu_bootstrap, |
83 | .cpu_bootstrap = madt_cpu_bootstrap, |
84 | .cpu_apic_id = madt_cpu_apic_id |
84 | .cpu_apic_id = madt_cpu_apic_id |
85 | }; |
85 | }; |
86 | 86 | ||
87 | static count_t madt_cpu_count(void) |
87 | static count_t madt_cpu_count(void) |
88 | { |
88 | { |
89 | return madt_l_apic_entry_cnt; |
89 | return madt_l_apic_entry_cnt; |
90 | } |
90 | } |
91 | 91 | ||
92 | static bool madt_cpu_enabled(index_t i) |
92 | static bool madt_cpu_enabled(index_t i) |
93 | { |
93 | { |
94 | ASSERT(i < madt_l_apic_entry_cnt); |
94 | ASSERT(i < madt_l_apic_entry_cnt); |
95 | return madt_l_apic_entries[i].flags & 0x1; |
95 | return ((struct madt_l_apic *) madt_entries_index[madt_l_apic_entry_index + i])->flags & 0x1; |
- | 96 | ||
96 | } |
97 | } |
97 | 98 | ||
98 | static bool madt_cpu_bootstrap(index_t i) |
99 | static bool madt_cpu_bootstrap(index_t i) |
99 | { |
100 | { |
100 | ASSERT(i < madt_l_apic_entry_cnt); |
101 | ASSERT(i < madt_l_apic_entry_cnt); |
101 | return madt_l_apic_entries[i].apic_id == l_apic_id(); |
102 | return ((struct madt_l_apic *) madt_entries_index[madt_l_apic_entry_index + i])->apic_id == l_apic_id(); |
102 | } |
103 | } |
103 | 104 | ||
104 | static __u8 madt_cpu_apic_id(index_t i) |
105 | static __u8 madt_cpu_apic_id(index_t i) |
105 | { |
106 | { |
106 | ASSERT(i < madt_l_apic_entry_cnt); |
107 | ASSERT(i < madt_l_apic_entry_cnt); |
107 | return madt_l_apic_entries[i].apic_id; |
108 | return ((struct madt_l_apic *) madt_entries_index[madt_l_apic_entry_index + i])->apic_id; |
108 | } |
109 | } |
109 | 110 | ||
110 | void acpi_madt_parse(void) |
111 | void acpi_madt_parse(void) |
111 | { |
112 | { |
112 | struct madt_apic_header *end = (struct madt_apic_header *) (((__u8 *) acpi_madt) + acpi_madt->header.length); |
113 | struct madt_apic_header *end = (struct madt_apic_header *) (((__u8 *) acpi_madt) + acpi_madt->header.length); |
113 | struct madt_apic_header *h = &acpi_madt->apic_header[0]; |
114 | struct madt_apic_header *h; |
114 | __u8 prev_type = 0; /* used to detect inconsecutive entries */ |
- | |
115 | 115 | ||
- | 116 | /* calculate madt entries */ |
|
- | 117 | for (h = &acpi_madt->apic_header[0]; h < end; h = (struct madt_apic_header *) (((__u8 *) h) + h->length)) { |
|
- | 118 | madt_entries_index_cnt++; |
|
- | 119 | } |
|
- | 120 | printf("MADT: Found %d entries\n", madt_entries_index_cnt); |
|
- | 121 | ||
- | 122 | /* create madt apic entries index array */ |
|
- | 123 | madt_entries_index = (struct madt_apic_header * *) malloc(madt_entries_index_cnt * sizeof(struct madt_apic_header * *)); |
|
- | 124 | ||
- | 125 | __u32 index = 0; |
|
- | 126 | ||
- | 127 | for (h = &acpi_madt->apic_header[0]; h < end; h = (struct madt_apic_header *) (((__u8 *) h) + h->length)) { |
|
- | 128 | madt_entries_index[index++] = h; |
|
- | 129 | } |
|
116 | 130 | ||
117 | l_apic = (__u32 *) (__native) acpi_madt->l_apic_address; |
- | |
118 | 131 | ||
- | 132 | /* Bublesort madt index. Quicksort later. */ |
|
- | 133 | bool done = false; |
|
- | 134 | ||
119 | while (h < end) { |
135 | while (!done) { |
- | 136 | done = true; |
|
- | 137 | for (index = 0; index < madt_entries_index_cnt - 1; index++) { |
|
- | 138 | if (madt_entries_index[index]->type > madt_entries_index[index + 1]->type) { |
|
- | 139 | h = madt_entries_index[index]; |
|
- | 140 | madt_entries_index[index] = madt_entries_index[index + 1]; |
|
- | 141 | madt_entries_index[index + 1] = h; |
|
- | 142 | done = false; |
|
- | 143 | } |
|
- | 144 | } |
|
- | 145 | ||
- | 146 | } |
|
- | 147 | ||
- | 148 | ||
- | 149 | /* Parse MADT entries */ |
|
- | 150 | for (index = 0; index < madt_entries_index_cnt - 1; index++) { |
|
- | 151 | h = madt_entries_index[index]; |
|
120 | switch (h->type) { |
152 | switch (h->type) { |
121 | case MADT_L_APIC: |
153 | case MADT_L_APIC: |
122 | madt_l_apic_entry((struct madt_l_apic *) h, prev_type); |
154 | madt_l_apic_entry((struct madt_l_apic *) h, index); |
123 | break; |
155 | break; |
124 | case MADT_IO_APIC: |
156 | case MADT_IO_APIC: |
125 | madt_io_apic_entry((struct madt_io_apic *) h, prev_type); |
157 | madt_io_apic_entry((struct madt_io_apic *) h, index); |
126 | break; |
158 | break; |
127 | case MADT_INTR_SRC_OVRD: |
159 | case MADT_INTR_SRC_OVRD: |
128 | case MADT_NMI_SRC: |
160 | case MADT_NMI_SRC: |
129 | case MADT_L_APIC_NMI: |
161 | case MADT_L_APIC_NMI: |
130 | case MADT_L_APIC_ADDR_OVRD: |
162 | case MADT_L_APIC_ADDR_OVRD: |
131 | case MADT_IO_SAPIC: |
163 | case MADT_IO_SAPIC: |
132 | case MADT_L_SAPIC: |
164 | case MADT_L_SAPIC: |
133 | case MADT_PLATFORM_INTR_SRC: |
165 | case MADT_PLATFORM_INTR_SRC: |
134 | printf("MADT: skipping %s entry (type=%d)\n", entry[h->type], h->type); |
166 | printf("MADT: skipping %s entry (type=%d)\n", entry[h->type], h->type); |
135 | break; |
167 | break; |
136 | 168 | ||
137 | default: |
169 | default: |
138 | if (h->type >= MADT_RESERVED_SKIP_BEGIN && h->type <= MADT_RESERVED_SKIP_END) { |
170 | if (h->type >= MADT_RESERVED_SKIP_BEGIN && h->type <= MADT_RESERVED_SKIP_END) { |
139 | printf("MADT: skipping reserved entry (type=%d)\n", h->type); |
171 | printf("MADT: skipping reserved entry (type=%d)\n", h->type); |
140 | } |
172 | } |
141 | if (h->type >= MADT_RESERVED_OEM_BEGIN) { |
173 | if (h->type >= MADT_RESERVED_OEM_BEGIN) { |
142 | printf("MADT: skipping OEM entry (type=%d)\n", h->type); |
174 | printf("MADT: skipping OEM entry (type=%d)\n", h->type); |
143 | } |
175 | } |
144 | break; |
176 | break; |
145 | } |
177 | } |
146 | prev_type = h->type; |
178 | |
147 | h = (struct madt_apic_header *) (((__u8 *) h) + h->length); |
- | |
- | 179 | ||
148 | } |
180 | } |
- | 181 | ||
149 | 182 | ||
150 | if (madt_l_apic_entry_cnt) |
183 | if (madt_l_apic_entry_cnt) |
151 | config.cpu_count = madt_l_apic_entry_cnt; |
184 | config.cpu_count = madt_l_apic_entry_cnt; |
152 | } |
185 | } |
153 | 186 | ||
154 | void madt_l_apic_entry(struct madt_l_apic *la, __u8 prev_type) |
- | |
155 | { |
- | |
156 | /* check for consecutiveness */ |
- | |
157 | if (madt_l_apic_entry_cnt && prev_type != MADT_L_APIC) |
- | |
158 | panic("%s entries are not consecuitve\n", entry[MADT_L_APIC]); |
- | |
159 | 187 | ||
- | 188 | void madt_l_apic_entry(struct madt_l_apic *la, __u32 index) |
|
- | 189 | { |
|
160 | if (!madt_l_apic_entry_cnt++) |
190 | if (!madt_l_apic_entry_cnt++) { |
161 | madt_l_apic_entries = la; |
191 | madt_l_apic_entry_index = index; |
- | 192 | } |
|
162 | 193 | ||
163 | if (!(la->flags & 0x1)) { |
194 | if (!(la->flags & 0x1)) { |
164 | /* Processor is unusable, skip it. */ |
195 | /* Processor is unusable, skip it. */ |
165 | return; |
196 | return; |
166 | } |
197 | } |
167 | 198 | ||
168 | apic_id_mask |= 1<<la->apic_id; |
199 | apic_id_mask |= 1<<la->apic_id; |
169 | } |
200 | } |
170 | 201 | ||
171 | void madt_io_apic_entry(struct madt_io_apic *ioa, __u8 prev_type) |
202 | void madt_io_apic_entry(struct madt_io_apic *ioa, __u32 index) |
172 | { |
203 | { |
173 | /* check for consecutiveness */ |
- | |
174 | if (madt_io_apic_entry_cnt && prev_type != MADT_IO_APIC) |
- | |
175 | panic("%s entries are not consecuitve\n", entry[MADT_IO_APIC]); |
- | |
176 | - | ||
177 | if (!madt_io_apic_entry_cnt++) { |
204 | if (!madt_io_apic_entry_cnt++) { |
- | 205 | /* remember index of the first io apic entry */ |
|
178 | madt_io_apic_entries = ioa; |
206 | madt_io_apic_entry_index = index; |
- | 207 | /* ????!!!! */ |
|
179 | io_apic = (__u32 *) (__native) ioa->io_apic_address; |
208 | io_apic = (__u32 *) (__native) ioa->io_apic_address; |
180 | } |
- | |
181 | else { |
209 | } else { |
182 | /* currently not supported */ |
210 | /* currently not supported */ |
183 | return; |
211 | return; |
184 | } |
212 | } |
185 | } |
213 | } |
186 | 214 | ||
187 | 215 | ||
188 | #endif /* __SMP__ */ |
216 | #endif /* __SMP__ */ |
189 | 217 |