Rev 279 | Rev 298 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 279 | Rev 294 | ||
---|---|---|---|
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 <smp/smp.h> |
29 | #include <smp/smp.h> |
30 | #include <arch/smp/smp.h> |
30 | #include <arch/smp/smp.h> |
31 | #include <arch/smp/mps.h> |
31 | #include <arch/smp/mps.h> |
32 | #include <arch/smp/ap.h> |
32 | #include <arch/smp/ap.h> |
33 | #include <arch/acpi/acpi.h> |
33 | #include <arch/acpi/acpi.h> |
34 | #include <arch/acpi/madt.h> |
34 | #include <arch/acpi/madt.h> |
35 | #include <config.h> |
35 | #include <config.h> |
36 | #include <synch/waitq.h> |
36 | #include <synch/waitq.h> |
- | 37 | #include <synch/synch.h> |
|
37 | #include <arch/pm.h> |
38 | #include <arch/pm.h> |
38 | #include <func.h> |
39 | #include <func.h> |
39 | #include <panic.h> |
40 | #include <panic.h> |
40 | #include <debug.h> |
41 | #include <debug.h> |
41 | #include <arch/asm.h> |
42 | #include <arch/asm.h> |
42 | #include <mm/frame.h> |
43 | #include <mm/frame.h> |
43 | #include <mm/page.h> |
44 | #include <mm/page.h> |
44 | #include <mm/heap.h> |
45 | #include <mm/heap.h> |
45 | #include <print.h> |
46 | #include <print.h> |
46 | #include <memstr.h> |
47 | #include <memstr.h> |
47 | #include <arch/i8259.h> |
48 | #include <arch/i8259.h> |
48 | 49 | ||
49 | #ifdef __SMP__ |
50 | #ifdef __SMP__ |
50 | 51 | ||
51 | static struct smp_config_operations *ops = NULL; |
52 | static struct smp_config_operations *ops = NULL; |
52 | 53 | ||
53 | void smp_init(void) |
54 | void smp_init(void) |
54 | { |
55 | { |
55 | if (acpi_madt) { |
56 | if (acpi_madt) { |
56 | acpi_madt_parse(); |
57 | acpi_madt_parse(); |
57 | ops = &madt_config_operations; |
58 | ops = &madt_config_operations; |
58 | } |
59 | } |
59 | if (config.cpu_count == 1) { |
60 | if (config.cpu_count == 1) { |
60 | mps_init(); |
61 | mps_init(); |
61 | ops = &mps_config_operations; |
62 | ops = &mps_config_operations; |
62 | } |
63 | } |
63 | 64 | ||
64 | if (config.cpu_count > 1) { |
65 | if (config.cpu_count > 1) { |
65 | map_page_to_frame((__address)l_apic, (__address)l_apic, |
66 | map_page_to_frame((__address)l_apic, (__address)l_apic, |
66 | PAGE_NOT_CACHEABLE, 0); |
67 | PAGE_NOT_CACHEABLE, 0); |
67 | map_page_to_frame((__address) io_apic, |
68 | map_page_to_frame((__address) io_apic, |
68 | (__address) io_apic, |
69 | (__address) io_apic, |
69 | PAGE_NOT_CACHEABLE, 0); |
70 | PAGE_NOT_CACHEABLE, 0); |
70 | } |
71 | } |
71 | 72 | ||
72 | /* |
73 | /* |
73 | * Must be initialized outside the kmp thread, since it is waited |
74 | * Must be initialized outside the kmp thread, since it is waited |
74 | * on before the kmp thread is created. |
75 | * on before the kmp thread is created. |
75 | */ |
76 | */ |
76 | waitq_initialize(&kmp_completion_wq); |
77 | waitq_initialize(&kmp_completion_wq); |
77 | 78 | ||
78 | } |
79 | } |
79 | 80 | ||
80 | /* |
81 | /* |
81 | * Kernel thread for bringing up application processors. It becomes clear |
82 | * Kernel thread for bringing up application processors. It becomes clear |
82 | * that we need an arrangement like this (AP's being initialized by a kernel |
83 | * that we need an arrangement like this (AP's being initialized by a kernel |
83 | * thread), for a thread has its dedicated stack. (The stack used during the |
84 | * thread), for a thread has its dedicated stack. (The stack used during the |
84 | * BSP initialization (prior the very first call to scheduler()) will be used |
85 | * BSP initialization (prior the very first call to scheduler()) will be used |
85 | * as an initialization stack for each AP.) |
86 | * as an initialization stack for each AP.) |
86 | */ |
87 | */ |
87 | void kmp(void *arg) |
88 | void kmp(void *arg) |
88 | { |
89 | { |
89 | __address src, dst; |
90 | __address src, dst; |
90 | int i; |
91 | int i; |
91 | 92 | ||
92 | ASSERT(ops != NULL); |
93 | ASSERT(ops != NULL); |
93 | 94 | ||
94 | waitq_initialize(&ap_completion_wq); |
95 | waitq_initialize(&ap_completion_wq); |
95 | 96 | ||
96 | /* |
97 | /* |
97 | * We need to access data in frame 0. |
98 | * We need to access data in frame 0. |
98 | * We boldly make use of kernel address space mapping. |
99 | * We boldly make use of kernel address space mapping. |
99 | */ |
100 | */ |
100 | 101 | ||
101 | /* |
102 | /* |
102 | * Set the warm-reset vector to the real-mode address of 4K-aligned ap_boot() |
103 | * Set the warm-reset vector to the real-mode address of 4K-aligned ap_boot() |
103 | */ |
104 | */ |
104 | *((__u16 *) (PA2KA(0x467+0))) = ((__address) ap_boot) >> 4; /* segment */ |
105 | *((__u16 *) (PA2KA(0x467+0))) = ((__address) ap_boot) >> 4; /* segment */ |
105 | *((__u16 *) (PA2KA(0x467+2))) = 0; /* offset */ |
106 | *((__u16 *) (PA2KA(0x467+2))) = 0; /* offset */ |
106 | 107 | ||
107 | /* |
108 | /* |
108 | * Save 0xa to address 0xf of the CMOS RAM. |
109 | * Save 0xa to address 0xf of the CMOS RAM. |
109 | * BIOS will not do the POST after the INIT signal. |
110 | * BIOS will not do the POST after the INIT signal. |
110 | */ |
111 | */ |
111 | outb(0x70,0xf); |
112 | outb(0x70,0xf); |
112 | outb(0x71,0xa); |
113 | outb(0x71,0xa); |
113 | 114 | ||
114 | cpu_priority_high(); |
- | |
115 | - | ||
116 | pic_disable_irqs(0xffff); |
115 | pic_disable_irqs(0xffff); |
117 | apic_init(); |
116 | apic_init(); |
118 | 117 | ||
119 | for (i = 0; i < ops->cpu_count(); i++) { |
118 | for (i = 0; i < ops->cpu_count(); i++) { |
120 | struct descriptor *gdt_new; |
119 | struct descriptor *gdt_new; |
121 | 120 | ||
122 | /* |
121 | /* |
123 | * Skip processors marked unusable. |
122 | * Skip processors marked unusable. |
124 | */ |
123 | */ |
125 | if (!ops->cpu_enabled(i)) |
124 | if (!ops->cpu_enabled(i)) |
126 | continue; |
125 | continue; |
127 | 126 | ||
128 | /* |
127 | /* |
129 | * The bootstrap processor is already up. |
128 | * The bootstrap processor is already up. |
130 | */ |
129 | */ |
131 | if (ops->cpu_bootstrap(i)) |
130 | if (ops->cpu_bootstrap(i)) |
132 | continue; |
131 | continue; |
133 | 132 | ||
134 | if (ops->cpu_apic_id(i) == l_apic_id()) { |
133 | if (ops->cpu_apic_id(i) == l_apic_id()) { |
135 | printf("kmp: bad processor entry #%d, will not send IPI to myself\n", i); |
134 | printf("%s: bad processor entry #%d, will not send IPI to myself\n", __FUNCTION__, i); |
136 | continue; |
135 | continue; |
137 | } |
136 | } |
138 | 137 | ||
139 | /* |
138 | /* |
140 | * Prepare new GDT for CPU in question. |
139 | * Prepare new GDT for CPU in question. |
141 | */ |
140 | */ |
142 | if (!(gdt_new = (struct descriptor *) malloc(GDT_ITEMS*sizeof(struct descriptor)))) |
141 | if (!(gdt_new = (struct descriptor *) malloc(GDT_ITEMS*sizeof(struct descriptor)))) |
143 | panic("couldn't allocate memory for GDT\n"); |
142 | panic("couldn't allocate memory for GDT\n"); |
144 | 143 | ||
145 | memcpy(gdt_new, gdt, GDT_ITEMS*sizeof(struct descriptor)); |
144 | memcpy(gdt_new, gdt, GDT_ITEMS*sizeof(struct descriptor)); |
146 | memsetb((__address)(&gdt_new[TSS_DES]), sizeof(struct descriptor), 0); |
145 | memsetb((__address)(&gdt_new[TSS_DES]), sizeof(struct descriptor), 0); |
147 | real_bootstrap_gdtr.base = KA2PA((__address) gdt_new); |
146 | real_bootstrap_gdtr.base = KA2PA((__address) gdt_new); |
148 | gdtr.base = (__address) gdt_new; |
147 | gdtr.base = (__address) gdt_new; |
149 | 148 | ||
150 | if (l_apic_send_init_ipi(ops->cpu_apic_id(i))) { |
149 | if (l_apic_send_init_ipi(ops->cpu_apic_id(i))) { |
151 | /* |
150 | /* |
152 | * There may be just one AP being initialized at |
151 | * There may be just one AP being initialized at |
153 | * the time. After it comes completely up, it is |
152 | * the time. After it comes completely up, it is |
154 | * supposed to wake us up. |
153 | * supposed to wake us up. |
155 | */ |
154 | */ |
156 | waitq_sleep(&ap_completion_wq); |
155 | if (waitq_sleep_timeout(&ap_completion_wq, 1000000, SYNCH_BLOCKING) == ESYNCH_TIMEOUT) |
- | 156 | printf("%s: waiting for cpu%d (APIC ID = %d) timed out\n", __FUNCTION__, config.cpu_active > i ? config.cpu_active : i, ops->cpu_apic_id(i)); |
|
157 | } |
157 | } |
158 | else { |
158 | else { |
159 | printf("INIT IPI for l_apic%d failed\n", ops->cpu_apic_id(i)); |
159 | printf("INIT IPI for l_apic%d failed\n", ops->cpu_apic_id(i)); |
160 | } |
160 | } |
161 | } |
161 | } |
162 | 162 | ||
163 | /* |
163 | /* |
164 | * Wakeup the kinit thread so that |
164 | * Wakeup the kinit thread so that |
165 | * system initialization can go on. |
165 | * system initialization can go on. |
166 | */ |
166 | */ |
167 | waitq_wakeup(&kmp_completion_wq, WAKEUP_FIRST); |
167 | waitq_wakeup(&kmp_completion_wq, WAKEUP_FIRST); |
168 | } |
168 | } |
169 | 169 | ||
170 | #endif /* __SMP__ */ |
170 | #endif /* __SMP__ */ |
171 | 171 |