Rev 236 | Rev 413 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 236 | Rev 391 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
2 | * Copyright (C) 2001-2004 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 <config.h> |
29 | #include <config.h> |
30 | #include <arch.h> |
30 | #include <arch.h> |
31 | #include <main/kinit.h> |
31 | #include <main/kinit.h> |
32 | #include <main/uinit.h> |
32 | #include <main/uinit.h> |
33 | #include <proc/scheduler.h> |
33 | #include <proc/scheduler.h> |
34 | #include <proc/task.h> |
34 | #include <proc/task.h> |
35 | #include <proc/thread.h> |
35 | #include <proc/thread.h> |
36 | #include <panic.h> |
36 | #include <panic.h> |
37 | #include <func.h> |
37 | #include <func.h> |
38 | #include <cpu.h> |
38 | #include <cpu.h> |
39 | #include <arch/asm.h> |
39 | #include <arch/asm.h> |
40 | #include <mm/page.h> |
40 | #include <mm/page.h> |
41 | #include <arch/mm/page.h> |
41 | #include <arch/mm/page.h> |
42 | #include <mm/vm.h> |
42 | #include <mm/vm.h> |
43 | #include <print.h> |
43 | #include <print.h> |
44 | #include <memstr.h> |
44 | #include <memstr.h> |
45 | 45 | ||
46 | #ifdef __SMP__ |
46 | #ifdef __SMP__ |
47 | #include <arch/smp/mps.h> |
47 | #include <arch/smp/mps.h> |
48 | #endif /* __SMP__ */ |
48 | #endif /* __SMP__ */ |
49 | 49 | ||
50 | #include <synch/waitq.h> |
50 | #include <synch/waitq.h> |
51 | #include <synch/spinlock.h> |
51 | #include <synch/spinlock.h> |
52 | 52 | ||
53 | #ifdef __TEST__ |
53 | #ifdef __TEST__ |
54 | #include <test.h> |
54 | #include <test.h> |
55 | #endif /* __TEST__ */ |
55 | #endif /* __TEST__ */ |
56 | 56 | ||
- | 57 | #include <mm/frame.h> |
|
- | 58 | ||
57 | void kinit(void *arg) |
59 | void kinit(void *arg) |
58 | { |
60 | { |
59 | vm_t *m; |
61 | vm_t *m; |
60 | vm_area_t *a; |
62 | vm_area_t *a; |
61 | task_t *u; |
63 | task_t *u; |
62 | thread_t *t; |
64 | thread_t *t; |
63 | int i; |
65 | int i; |
64 | 66 | ||
65 | cpu_priority_high(); |
67 | cpu_priority_high(); |
66 | 68 | ||
67 | #ifdef __SMP__ |
69 | #ifdef __SMP__ |
68 | if (config.cpu_count > 1) { |
70 | if (config.cpu_count > 1) { |
69 | /* |
71 | /* |
70 | * Create the kmp thread and wait for its completion. |
72 | * Create the kmp thread and wait for its completion. |
71 | * cpu1 through cpuN-1 will come up consecutively and |
73 | * cpu1 through cpuN-1 will come up consecutively and |
72 | * not mess together with kcpulb and klwtm threads. |
74 | * not mess together with kcpulb and klwtm threads. |
73 | * Just a beautification. |
75 | * Just a beautification. |
74 | */ |
76 | */ |
75 | if (t = thread_create(kmp, NULL, TASK, 0)) { |
77 | if (t = thread_create(kmp, NULL, TASK, 0)) { |
76 | spinlock_lock(&t->lock); |
78 | spinlock_lock(&t->lock); |
77 | t->flags |= X_WIRED; |
79 | t->flags |= X_WIRED; |
78 | t->cpu = &cpus[0]; |
80 | t->cpu = &cpus[0]; |
79 | spinlock_unlock(&t->lock); |
81 | spinlock_unlock(&t->lock); |
80 | thread_ready(t); |
82 | thread_ready(t); |
81 | waitq_sleep(&kmp_completion_wq); |
83 | waitq_sleep(&kmp_completion_wq); |
82 | } |
84 | } |
83 | else panic("thread_create/kmp"); |
85 | else panic("thread_create/kmp"); |
84 | } |
86 | } |
85 | #endif /* __SMP__ */ |
87 | #endif /* __SMP__ */ |
86 | /* |
88 | /* |
87 | * Now that all CPUs are up, we can report what we've found. |
89 | * Now that all CPUs are up, we can report what we've found. |
88 | */ |
90 | */ |
89 | for (i = 0; i < config.cpu_count; i++) { |
91 | for (i = 0; i < config.cpu_count; i++) { |
90 | if (cpus[i].active) |
92 | if (cpus[i].active) |
91 | cpu_print_report(&cpus[i]); |
93 | cpu_print_report(&cpus[i]); |
92 | else |
94 | else |
93 | printf("cpu%d: not active\n", i); |
95 | printf("cpu%d: not active\n", i); |
94 | } |
96 | } |
95 | 97 | ||
96 | #ifdef __SMP__ |
98 | #ifdef __SMP__ |
97 | if (config.cpu_count > 1) { |
99 | if (config.cpu_count > 1) { |
98 | /* |
100 | /* |
99 | * For each CPU, create its load balancing thread. |
101 | * For each CPU, create its load balancing thread. |
100 | */ |
102 | */ |
101 | for (i = 0; i < config.cpu_count; i++) { |
103 | for (i = 0; i < config.cpu_count; i++) { |
102 | 104 | ||
103 | if (t = thread_create(kcpulb, NULL, TASK, 0)) { |
105 | if (t = thread_create(kcpulb, NULL, TASK, 0)) { |
104 | spinlock_lock(&t->lock); |
106 | spinlock_lock(&t->lock); |
105 | t->flags |= X_WIRED; |
107 | t->flags |= X_WIRED; |
106 | t->cpu = &cpus[i]; |
108 | t->cpu = &cpus[i]; |
107 | spinlock_unlock(&t->lock); |
109 | spinlock_unlock(&t->lock); |
108 | thread_ready(t); |
110 | thread_ready(t); |
109 | } |
111 | } |
110 | else panic("thread_create/kcpulb"); |
112 | else panic("thread_create/kcpulb"); |
111 | 113 | ||
112 | } |
114 | } |
113 | } |
115 | } |
114 | #endif /* __SMP__ */ |
116 | #endif /* __SMP__ */ |
115 | 117 | ||
116 | cpu_priority_low(); |
118 | cpu_priority_low(); |
117 | 119 | ||
118 | #ifdef __USERSPACE__ |
120 | #ifdef __USERSPACE__ |
119 | /* |
121 | /* |
120 | * Create the first user task. |
122 | * Create the first user task. |
121 | */ |
123 | */ |
122 | m = vm_create(NULL); |
124 | m = vm_create(NULL); |
123 | if (!m) panic("vm_create"); |
125 | if (!m) panic("vm_create"); |
124 | u = task_create(m); |
126 | u = task_create(m); |
125 | if (!u) panic("task_create"); |
127 | if (!u) panic("task_create"); |
126 | t = thread_create(uinit, NULL, u, THREAD_USER_STACK); |
128 | t = thread_create(uinit, NULL, u, THREAD_USER_STACK); |
127 | if (!t) panic("thread_create"); |
129 | if (!t) panic("thread_create"); |
128 | 130 | ||
129 | /* |
131 | /* |
130 | * Create the text vm_area and copy the userspace code there. |
132 | * Create the text vm_area and copy the userspace code there. |
131 | */ |
133 | */ |
132 | a = vm_area_create(m, VMA_TEXT, 1, UTEXT_ADDRESS); |
134 | a = vm_area_create(m, VMA_TEXT, 1, UTEXT_ADDRESS); |
133 | if (!a) panic("vm_area_create: vm_text"); |
135 | if (!a) panic("vm_area_create: vm_text"); |
134 | vm_area_map(a, m); |
136 | vm_area_map(a, m); |
135 | memcpy((void *) PA2KA(a->mapping[0]), (void *) utext, utext_size < PAGE_SIZE ? utext_size : PAGE_SIZE); |
137 | memcpy((void *) PA2KA(a->mapping[0]), (void *) utext, utext_size < PAGE_SIZE ? utext_size : PAGE_SIZE); |
136 | 138 | ||
137 | /* |
139 | /* |
138 | * Create the data vm_area. |
140 | * Create the data vm_area. |
139 | */ |
141 | */ |
140 | a = vm_area_create(m, VMA_STACK, 1, USTACK_ADDRESS); |
142 | a = vm_area_create(m, VMA_STACK, 1, USTACK_ADDRESS); |
141 | if (!a) panic("vm_area_create: vm_stack"); |
143 | if (!a) panic("vm_area_create: vm_stack"); |
142 | vm_area_map(a, m); |
144 | vm_area_map(a, m); |
143 | 145 | ||
144 | thread_ready(t); |
146 | thread_ready(t); |
145 | #endif /* __USERSPACE__ */ |
147 | #endif /* __USERSPACE__ */ |
146 | 148 | ||
147 | #ifdef __TEST__ |
149 | #ifdef __TEST__ |
148 | test(); |
150 | test(); |
149 | #endif /* __TEST__ */ |
151 | #endif /* __TEST__ */ |
150 | 152 | ||
151 | 153 | ||
152 | while (1) { |
154 | while (1) { |
153 | thread_usleep(1000000); |
155 | thread_usleep(1000000); |
154 | printf("kinit... "); |
156 | printf("kinit... "); |
155 | } |
157 | } |
156 | 158 | ||
157 | } |
159 | } |
158 | 160 |