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