Rev 1433 | Rev 1438 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1433 | Rev 1434 | ||
---|---|---|---|
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 | /** |
29 | /** |
30 | * @file clock.c |
30 | * @file clock.c |
31 | * @brief High-level clock interrupt handler. |
31 | * @brief High-level clock interrupt handler. |
32 | * |
32 | * |
33 | * This file contains the clock() function which is the source |
33 | * This file contains the clock() function which is the source |
34 | * of preemption. It is also responsible for executing expired |
34 | * of preemption. It is also responsible for executing expired |
35 | * timeouts. |
35 | * timeouts. |
36 | */ |
36 | */ |
37 | 37 | ||
38 | #include <time/clock.h> |
38 | #include <time/clock.h> |
39 | #include <time/timeout.h> |
39 | #include <time/timeout.h> |
40 | #include <arch/types.h> |
40 | #include <arch/types.h> |
41 | #include <config.h> |
41 | #include <config.h> |
42 | #include <synch/spinlock.h> |
42 | #include <synch/spinlock.h> |
43 | #include <synch/waitq.h> |
43 | #include <synch/waitq.h> |
44 | #include <func.h> |
44 | #include <func.h> |
45 | #include <proc/scheduler.h> |
45 | #include <proc/scheduler.h> |
46 | #include <cpu.h> |
46 | #include <cpu.h> |
47 | #include <arch.h> |
47 | #include <arch.h> |
48 | #include <adt/list.h> |
48 | #include <adt/list.h> |
49 | #include <atomic.h> |
49 | #include <atomic.h> |
50 | #include <proc/thread.h> |
50 | #include <proc/thread.h> |
- | 51 | #include <sysinfo/sysinfo.h> |
|
- | 52 | #include <arch/barrier.h> |
|
- | 53 | ||
- | 54 | /* Pointers to public variables with time */ |
|
- | 55 | struct ptime { |
|
- | 56 | __native seconds; |
|
- | 57 | __native useconds; |
|
- | 58 | __native useconds2; |
|
- | 59 | }; |
|
- | 60 | struct ptime *public_time; |
|
- | 61 | /* Variable holding fragment of second, so that we would update |
|
- | 62 | * seconds correctly |
|
- | 63 | */ |
|
- | 64 | static __native secfrag = 0; |
|
- | 65 | ||
- | 66 | /** Initialize realtime clock counter |
|
- | 67 | * |
|
- | 68 | * The applications (and sometimes kernel) need to access accurate |
|
- | 69 | * information about realtime data. We allocate 1 page with these |
|
- | 70 | * data and update it periodically. |
|
- | 71 | * |
|
- | 72 | * |
|
- | 73 | */ |
|
- | 74 | void clock_counter_init(void) |
|
- | 75 | { |
|
- | 76 | void *faddr; |
|
- | 77 | ||
- | 78 | faddr = (void *)PFN2ADDR(frame_alloc(0, FRAME_ATOMIC)); |
|
- | 79 | if (!faddr) |
|
- | 80 | panic("Cannot allocate page for clock"); |
|
- | 81 | ||
- | 82 | public_time = (struct ptime *)PA2KA(faddr); |
|
- | 83 | ||
- | 84 | /* TODO: We would need some arch dependent settings here */ |
|
- | 85 | public_time->seconds = 0; |
|
- | 86 | public_time->useconds = 0; |
|
- | 87 | ||
- | 88 | sysinfo_set_item_val("clock.faddr", NULL, (__native)faddr); |
|
- | 89 | } |
|
- | 90 | ||
- | 91 | ||
- | 92 | /** Update public counters |
|
- | 93 | * |
|
- | 94 | * Update it only on first processor |
|
- | 95 | * TODO: Do we really need so many write barriers? |
|
- | 96 | */ |
|
- | 97 | static void clock_update_counters(void) |
|
- | 98 | { |
|
- | 99 | if (CPU->id == 0) { |
|
- | 100 | secfrag += 1000000/HZ; |
|
- | 101 | if (secfrag >= 1000000) { |
|
- | 102 | public_time->useconds = 0; |
|
- | 103 | write_barrier(); |
|
- | 104 | public_time->seconds++; |
|
- | 105 | secfrag = 0; |
|
- | 106 | } else |
|
- | 107 | public_time->useconds += 1000000/HZ; |
|
- | 108 | write_barrier(); |
|
- | 109 | public_time->useconds2 = public_time->useconds; |
|
- | 110 | write_barrier(); |
|
- | 111 | } |
|
- | 112 | } |
|
51 | 113 | ||
52 | /** Clock routine |
114 | /** Clock routine |
53 | * |
115 | * |
54 | * Clock routine executed from clock interrupt handler |
116 | * Clock routine executed from clock interrupt handler |
55 | * (assuming interrupts_disable()'d). Runs expired timeouts |
117 | * (assuming interrupts_disable()'d). Runs expired timeouts |
56 | * and preemptive scheduling. |
118 | * and preemptive scheduling. |
57 | * |
119 | * |
58 | */ |
120 | */ |
59 | void clock(void) |
121 | void clock(void) |
60 | { |
122 | { |
61 | link_t *l; |
123 | link_t *l; |
62 | timeout_t *h; |
124 | timeout_t *h; |
63 | timeout_handler_t f; |
125 | timeout_handler_t f; |
64 | void *arg; |
126 | void *arg; |
65 | int i; |
127 | int i; |
66 | 128 | ||
67 | /* |
129 | /* |
68 | * To avoid lock ordering problems, |
130 | * To avoid lock ordering problems, |
69 | * run all expired timeouts as you visit them. |
131 | * run all expired timeouts as you visit them. |
70 | */ |
132 | */ |
71 | for (i = 0; i <= CPU->missed_clock_ticks; i++) { |
133 | for (i = 0; i <= CPU->missed_clock_ticks; i++) { |
- | 134 | clock_update_counters(); |
|
72 | spinlock_lock(&CPU->timeoutlock); |
135 | spinlock_lock(&CPU->timeoutlock); |
73 | while ((l = CPU->timeout_active_head.next) != &CPU->timeout_active_head) { |
136 | while ((l = CPU->timeout_active_head.next) != &CPU->timeout_active_head) { |
74 | h = list_get_instance(l, timeout_t, link); |
137 | h = list_get_instance(l, timeout_t, link); |
75 | spinlock_lock(&h->lock); |
138 | spinlock_lock(&h->lock); |
76 | if (h->ticks-- != 0) { |
139 | if (h->ticks-- != 0) { |
77 | spinlock_unlock(&h->lock); |
140 | spinlock_unlock(&h->lock); |
78 | break; |
141 | break; |
79 | } |
142 | } |
80 | list_remove(l); |
143 | list_remove(l); |
81 | f = h->handler; |
144 | f = h->handler; |
82 | arg = h->arg; |
145 | arg = h->arg; |
83 | timeout_reinitialize(h); |
146 | timeout_reinitialize(h); |
84 | spinlock_unlock(&h->lock); |
147 | spinlock_unlock(&h->lock); |
85 | spinlock_unlock(&CPU->timeoutlock); |
148 | spinlock_unlock(&CPU->timeoutlock); |
86 | 149 | ||
87 | f(arg); |
150 | f(arg); |
88 | 151 | ||
89 | spinlock_lock(&CPU->timeoutlock); |
152 | spinlock_lock(&CPU->timeoutlock); |
90 | } |
153 | } |
91 | spinlock_unlock(&CPU->timeoutlock); |
154 | spinlock_unlock(&CPU->timeoutlock); |
92 | } |
155 | } |
93 | CPU->missed_clock_ticks = 0; |
156 | CPU->missed_clock_ticks = 0; |
94 | 157 | ||
95 | /* |
158 | /* |
96 | * Do CPU usage accounting and find out whether to preempt THREAD. |
159 | * Do CPU usage accounting and find out whether to preempt THREAD. |
97 | */ |
160 | */ |
98 | 161 | ||
99 | if (THREAD) { |
162 | if (THREAD) { |
100 | __u64 ticks; |
163 | __u64 ticks; |
101 | 164 | ||
102 | spinlock_lock(&CPU->lock); |
165 | spinlock_lock(&CPU->lock); |
103 | CPU->needs_relink++; |
166 | CPU->needs_relink++; |
104 | spinlock_unlock(&CPU->lock); |
167 | spinlock_unlock(&CPU->lock); |
105 | 168 | ||
106 | spinlock_lock(&THREAD->lock); |
169 | spinlock_lock(&THREAD->lock); |
107 | if ((ticks = THREAD->ticks)) |
170 | if ((ticks = THREAD->ticks)) |
108 | THREAD->ticks--; |
171 | THREAD->ticks--; |
109 | spinlock_unlock(&THREAD->lock); |
172 | spinlock_unlock(&THREAD->lock); |
110 | 173 | ||
111 | if (!ticks && !PREEMPTION_DISABLED) { |
174 | if (!ticks && !PREEMPTION_DISABLED) { |
112 | scheduler(); |
175 | scheduler(); |
113 | } |
176 | } |
114 | } |
177 | } |
115 | 178 | ||
116 | } |
179 | } |
117 | 180 |