Subversion Repositories HelenOS-historic

Rev

Rev 11 | Rev 107 | 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 <time/clock.h>
30
#include <time/timeout.h>
31
#include <arch/types.h>
32
#include <config.h>
33
#include <synch/spinlock.h>
34
#include <synch/waitq.h>
35
#include <func.h>
36
#include <proc/scheduler.h>
37
#include <cpu.h>
38
#include <print.h>
39
#include <arch.h>
40
#include <list.h>
41
 
42
#ifdef __SMP__
11 jermar 43
#include <arch/smp/atomic.h>
1 jermar 44
#endif
45
 
46
/*
47
 * Clock is called from an interrupt and is cpu_priority_high()'d.
48
 */
49
void clock(void)
50
{
51
    link_t *l;
52
    timeout_t *h;
53
    timeout_handler f;
54
    void *arg;
55
 
56
    /*
57
     * To avoid lock ordering problems,
58
     * run all expired timeouts as you visit them.
59
     */
15 jermar 60
    spinlock_lock(&CPU->timeoutlock);
61
    while ((l = CPU->timeout_active_head.next) != &CPU->timeout_active_head) {
1 jermar 62
        h = list_get_instance(l, timeout_t, link);
63
        spinlock_lock(&h->lock);
64
        if (h->ticks-- != 0) {
65
            spinlock_unlock(&h->lock);
66
            break;
67
        }
68
        list_remove(l);
69
        f = h->handler;
70
        arg = h->arg;
71
        timeout_reinitialize(h);
72
        spinlock_unlock(&h->lock); 
15 jermar 73
        spinlock_unlock(&CPU->timeoutlock);
1 jermar 74
 
75
        f(arg);
76
 
15 jermar 77
        spinlock_lock(&CPU->timeoutlock);
1 jermar 78
    }
15 jermar 79
    spinlock_unlock(&CPU->timeoutlock);
1 jermar 80
 
81
    /*
15 jermar 82
     * Do CPU usage accounting and find out whether to preempt THREAD.
1 jermar 83
     */
84
 
15 jermar 85
    if (THREAD) {
86
        spinlock_lock(&CPU->lock);
87
        CPU->needs_relink++;
88
        spinlock_unlock(&CPU->lock);   
1 jermar 89
 
15 jermar 90
        spinlock_lock(&THREAD->lock);
91
            if (!THREAD->ticks--) {
92
            spinlock_unlock(&THREAD->lock);
1 jermar 93
            scheduler();
94
        }
95
        else {
15 jermar 96
            spinlock_unlock(&THREAD->lock);
1 jermar 97
        }
98
    }
99
 
100
}