WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/src/main/kinit.c


/*
 * Copyright (C) 2001-2004 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <config.h>
#include <arch.h>
#include <main/kinit.h>
#include <main/uinit.h>
#include <proc/scheduler.h>
#include <proc/task.h>
#include <proc/thread.h>
#include <panic.h>
#include <func.h>
#include <cpu.h>
#include <arch/asm.h>
#include <mm/page.h>
#include <arch/mm/page.h>
#include <mm/vm.h>
#include <print.h>
#include <memstr.h>
 
#ifdef __SMP__
#include <arch/smp/mps.h>
#endif /* __SMP__ */
 
#include <synch/waitq.h>
#include <synch/spinlock.h>
 
#ifdef __TEST__
#include <test.h>
#endif /* __TEST__ */
 
void kinit(void *arg)
{
    vm_t *m;
    vm_area_t *a;
    task_t *u;
    thread_t *t;
    int i;
 
    cpu_priority_high();
 
#ifdef __SMP__          
    if (config.cpu_count > 1) {
        /*
         * Create the kmp thread and wait for its completion.
         * cpu1 through cpuN-1 will come up consecutively and
         * not mess together with kcpulb and klwtm threads.
         * Just a beautification.
         */
        if (t = thread_create(kmp, NULL, TASK, 0)) {
            spinlock_lock(&t->lock);
            t->flags |= X_WIRED;
            t->cpu = &cpus[0];
            spinlock_unlock(&t->lock);
            thread_ready(t);
            waitq_sleep(&kmp_completion_wq);
        }
        else panic("thread_create/kmp");
    }
#endif /* __SMP__ */
    /*
     * Now that all CPUs are up, we can report what we've found.
     */
    for (i = 0; i < config.cpu_count; i++) {
        if (cpus[i].active)
            cpu_print_report(&cpus[i]);
        else
            printf("cpu%d: not active\n", i);
    }
 
#ifdef __SMP__
    if (config.cpu_count > 1) {
        /*
         * For each CPU, create its load balancing thread.
         */
        for (i = 0; i < config.cpu_count; i++) {
 
            if (t = thread_create(kcpulb, NULL, TASK, 0)) {
                spinlock_lock(&t->lock);           
                t->flags |= X_WIRED;
                t->cpu = &cpus[i];
                spinlock_unlock(&t->lock);
                thread_ready(t);
            }
            else panic("thread_create/kcpulb");
 
        }
    }
#endif /* __SMP__ */
 
    cpu_priority_low();
 
#ifdef __USERSPACE__
    /*
     * Create the first user task.
     */
    m = vm_create(NULL);
    if (!m) panic("vm_create");
    u = task_create(m);
    if (!u) panic("task_create");
    t = thread_create(uinit, NULL, u, THREAD_USER_STACK);
    if (!t) panic("thread_create");
 
    /*
     * Create the text vm_area and copy the userspace code there.
     */
    a = vm_area_create(m, VMA_TEXT, 1, UTEXT_ADDRESS);
    if (!a) panic("vm_area_create: vm_text");
    vm_area_map(a, m);
    memcpy((void *) PA2KA(a->mapping[0]), (void *) utext, utext_size < PAGE_SIZE ? utext_size : PAGE_SIZE);
 
    /*
     * Create the data vm_area.
     */
    a = vm_area_create(m, VMA_STACK, 1, USTACK_ADDRESS);
    if (!a) panic("vm_area_create: vm_stack");
    vm_area_map(a, m); 
   
    thread_ready(t);
#endif /* __USERSPACE__ */
 
#ifdef __TEST__
    test();
#endif /* __TEST__ */
 
 
    while (1) {
        thread_usleep(1000000);
        printf("kinit... ");
    }
 
}
 

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

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/main/kinit.c @ 1705 – Rev 205 → 236