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

Subversion Repositories HelenOS-historic

(root)/SPARTAN/trunk/generic/src/main/kinit.c – Rev 430 → 452