Subversion Repositories HelenOS-historic

Rev

Rev 1 | Rev 35 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
1 jermar 1
/*
2
 * Copyright (C) 2001-2004 Jakub Jermar
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 *
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
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
15
 *   derived from this software without specific prior written permission.
16
 *
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
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
28
 
29
#include <proc/thread.h>
30
#include <proc/task.h>
31
#include <mm/vm.h>
32
 
33
#include <synch/spinlock.h>
34
#include <arch.h>
35
#include <panic.h>
36
#include <list.h>
37
 
38
spinlock_t tasks_lock;
39
link_t tasks_head;
40
 
41
void task_init(void)
42
{
15 jermar 43
    TASK = NULL;
1 jermar 44
    spinlock_initialize(&tasks_lock);
45
    list_initialize(&tasks_head);
46
}
47
 
48
task_t *task_create(vm_t *m)
49
{
50
    pri_t pri;
51
    task_t *ta;
52
 
53
    ta = (task_t *) malloc(sizeof(task_t));
54
    if (ta) {
55
        spinlock_initialize(&ta->lock);
56
        list_initialize(&ta->th_head);
57
        list_initialize(&ta->tasks_link);
58
        ta->vm = m;
59
 
60
        pri = cpu_priority_high();
61
        spinlock_lock(&tasks_lock);
62
        list_append(&ta->tasks_link, &tasks_head);
63
        spinlock_unlock(&tasks_lock);
64
        cpu_priority_restore(pri);
65
    }
66
    return ta;
67
}
68