Subversion Repositories HelenOS-historic

Rev

Rev 107 | Rev 430 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 107 Rev 413
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 <proc/thread.h>
29
#include <proc/thread.h>
30
#include <proc/task.h>
30
#include <proc/task.h>
31
#include <mm/vm.h>
31
#include <mm/vm.h>
32
#include <mm/heap.h>
32
#include <mm/heap.h>
33
 
33
 
34
#include <synch/spinlock.h>
34
#include <synch/spinlock.h>
35
#include <arch.h>
35
#include <arch.h>
36
#include <panic.h>
36
#include <panic.h>
37
#include <list.h>
37
#include <list.h>
38
 
38
 
39
spinlock_t tasks_lock;
39
spinlock_t tasks_lock;
40
link_t tasks_head;
40
link_t tasks_head;
41
 
41
 
42
 
42
 
43
/** Initialize tasks
43
/** Initialize tasks
44
 *
44
 *
45
 * Initialize kernel tasks support.
45
 * Initialize kernel tasks support.
46
 *
46
 *
47
 */
47
 */
48
void task_init(void)
48
void task_init(void)
49
{
49
{
50
    TASK = NULL;
50
    TASK = NULL;
51
    spinlock_initialize(&tasks_lock);
51
    spinlock_initialize(&tasks_lock);
52
    list_initialize(&tasks_head);
52
    list_initialize(&tasks_head);
53
}
53
}
54
 
54
 
55
 
55
 
56
/** Create new task
56
/** Create new task
57
 *
57
 *
58
 * Create new task with no threads.
58
 * Create new task with no threads.
59
 *
59
 *
60
 * @param m Task's virtual memory structure.
60
 * @param m Task's virtual memory structure.
61
 *
61
 *
62
 * @return New task's structure on success, NULL on failure.
62
 * @return New task's structure on success, NULL on failure.
63
 *
63
 *
64
 */
64
 */
65
task_t *task_create(vm_t *m)
65
task_t *task_create(vm_t *m)
66
{
66
{
67
    pri_t pri;
67
    ipl_t ipl;
68
    task_t *ta;
68
    task_t *ta;
69
   
69
   
70
    ta = (task_t *) malloc(sizeof(task_t));
70
    ta = (task_t *) malloc(sizeof(task_t));
71
    if (ta) {
71
    if (ta) {
72
        spinlock_initialize(&ta->lock);
72
        spinlock_initialize(&ta->lock);
73
        list_initialize(&ta->th_head);
73
        list_initialize(&ta->th_head);
74
        list_initialize(&ta->tasks_link);
74
        list_initialize(&ta->tasks_link);
75
        ta->vm = m;
75
        ta->vm = m;
76
       
76
       
77
        pri = cpu_priority_high();
77
        ipl = interrupts_disable();
78
        spinlock_lock(&tasks_lock);
78
        spinlock_lock(&tasks_lock);
79
        list_append(&ta->tasks_link, &tasks_head);
79
        list_append(&ta->tasks_link, &tasks_head);
80
        spinlock_unlock(&tasks_lock);
80
        spinlock_unlock(&tasks_lock);
81
        cpu_priority_restore(pri);
81
        interrupts_restore(ipl);
82
    }
82
    }
83
    return ta;
83
    return ta;
84
}
84
}
85
 
85
 
86
 
86