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