Rev 2307 | Rev 2416 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2307 | Rev 2336 | ||
---|---|---|---|
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 | /** @addtogroup time |
29 | /** @addtogroup time |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | 32 | ||
33 | /** |
33 | /** |
34 | * @file |
34 | * @file |
35 | * @brief High-level clock interrupt handler. |
35 | * @brief High-level clock interrupt handler. |
36 | * |
36 | * |
37 | * This file contains the clock() function which is the source |
37 | * This file contains the clock() function which is the source |
38 | * of preemption. It is also responsible for executing expired |
38 | * of preemption. It is also responsible for executing expired |
39 | * timeouts. |
39 | * timeouts. |
40 | */ |
40 | */ |
41 | 41 | ||
42 | #include <time/clock.h> |
42 | #include <time/clock.h> |
43 | #include <time/timeout.h> |
43 | #include <time/timeout.h> |
44 | #include <config.h> |
44 | #include <config.h> |
45 | #include <synch/spinlock.h> |
45 | #include <synch/spinlock.h> |
46 | #include <synch/waitq.h> |
46 | #include <synch/waitq.h> |
47 | #include <func.h> |
47 | #include <func.h> |
48 | #include <proc/scheduler.h> |
48 | #include <proc/scheduler.h> |
49 | #include <cpu.h> |
49 | #include <cpu.h> |
50 | #include <arch.h> |
50 | #include <arch.h> |
51 | #include <adt/list.h> |
51 | #include <adt/list.h> |
52 | #include <atomic.h> |
52 | #include <atomic.h> |
53 | #include <proc/thread.h> |
53 | #include <proc/thread.h> |
54 | #include <sysinfo/sysinfo.h> |
54 | #include <sysinfo/sysinfo.h> |
55 | #include <arch/barrier.h> |
55 | #include <arch/barrier.h> |
56 | #include <mm/frame.h> |
56 | #include <mm/frame.h> |
57 | #include <ddi/ddi.h> |
57 | #include <ddi/ddi.h> |
58 | 58 | ||
59 | /* Pointer to variable with uptime */ |
59 | /* Pointer to variable with uptime */ |
60 | uptime_t *uptime; |
60 | uptime_t *uptime; |
61 | 61 | ||
62 | /** Physical memory area of the real time clock */ |
62 | /** Physical memory area of the real time clock */ |
63 | static parea_t clock_parea; |
63 | static parea_t clock_parea; |
64 | 64 | ||
65 | /* Variable holding fragment of second, so that we would update |
65 | /* Variable holding fragment of second, so that we would update |
66 | * seconds correctly |
66 | * seconds correctly |
67 | */ |
67 | */ |
68 | static unative_t secfrag = 0; |
68 | static unative_t secfrag = 0; |
69 | 69 | ||
70 | /** Initialize realtime clock counter |
70 | /** Initialize realtime clock counter |
71 | * |
71 | * |
72 | * The applications (and sometimes kernel) need to access accurate |
72 | * The applications (and sometimes kernel) need to access accurate |
73 | * information about realtime data. We allocate 1 page with these |
73 | * information about realtime data. We allocate 1 page with these |
74 | * data and update it periodically. |
74 | * data and update it periodically. |
75 | */ |
75 | */ |
76 | void clock_counter_init(void) |
76 | void clock_counter_init(void) |
77 | { |
77 | { |
78 | void *faddr; |
78 | void *faddr; |
79 | 79 | ||
80 | faddr = frame_alloc(ONE_FRAME, FRAME_ATOMIC); |
80 | faddr = frame_alloc(ONE_FRAME, FRAME_ATOMIC); |
81 | if (!faddr) |
81 | if (!faddr) |
82 | panic("Cannot allocate page for clock"); |
82 | panic("Cannot allocate page for clock"); |
83 | 83 | ||
84 | uptime = (uptime_t *) PA2KA(faddr); |
84 | uptime = (uptime_t *) PA2KA(faddr); |
85 | 85 | ||
86 | uptime->seconds1 = 0; |
86 | uptime->seconds1 = 0; |
87 | uptime->seconds2 = 0; |
87 | uptime->seconds2 = 0; |
88 | uptime->useconds = 0; |
88 | uptime->useconds = 0; |
89 | 89 | ||
90 | clock_parea.pbase = (uintptr_t) faddr; |
90 | clock_parea.pbase = (uintptr_t) faddr; |
91 | clock_parea.vbase = (uintptr_t) uptime; |
91 | clock_parea.vbase = (uintptr_t) uptime; |
92 | clock_parea.frames = 1; |
92 | clock_parea.frames = 1; |
93 | clock_parea.cacheable = true; |
93 | clock_parea.cacheable = true; |
94 | ddi_parea_register(&clock_parea); |
94 | ddi_parea_register(&clock_parea); |
95 | 95 | ||
96 | /* |
96 | /* |
97 | * Prepare information for the userspace so that it can successfully |
97 | * Prepare information for the userspace so that it can successfully |
98 | * physmem_map() the clock_parea. |
98 | * physmem_map() the clock_parea. |
99 | */ |
99 | */ |
100 | sysinfo_set_item_val("clock.cacheable", NULL, (unative_t) true); |
100 | sysinfo_set_item_val("clock.cacheable", NULL, (unative_t) true); |
101 | sysinfo_set_item_val("clock.faddr", NULL, (unative_t) faddr); |
101 | sysinfo_set_item_val("clock.faddr", NULL, (unative_t) faddr); |
102 | } |
102 | } |
103 | 103 | ||
104 | 104 | ||
105 | /** Update public counters |
105 | /** Update public counters |
106 | * |
106 | * |
107 | * Update it only on first processor |
107 | * Update it only on first processor |
108 | * TODO: Do we really need so many write barriers? |
108 | * TODO: Do we really need so many write barriers? |
109 | */ |
109 | */ |
110 | static void clock_update_counters(void) |
110 | static void clock_update_counters(void) |
111 | { |
111 | { |
112 | if (CPU->id == 0) { |
112 | if (CPU->id == 0) { |
113 | secfrag += 1000000 / HZ; |
113 | secfrag += 1000000 / HZ; |
114 | if (secfrag >= 1000000) { |
114 | if (secfrag >= 1000000) { |
115 | secfrag -= 1000000; |
115 | secfrag -= 1000000; |
116 | uptime->seconds1++; |
116 | uptime->seconds1++; |
117 | write_barrier(); |
117 | write_barrier(); |
118 | uptime->useconds = secfrag; |
118 | uptime->useconds = secfrag; |
119 | write_barrier(); |
119 | write_barrier(); |
120 | uptime->seconds2 = uptime->seconds1; |
120 | uptime->seconds2 = uptime->seconds1; |
121 | } else |
121 | } else |
122 | uptime->useconds += 1000000 / HZ; |
122 | uptime->useconds += 1000000 / HZ; |
123 | } |
123 | } |
124 | } |
124 | } |
125 | 125 | ||
- | 126 | #ifdef CONFIG_TIMEOUT_EXTAVL_TREE |
|
- | 127 | ||
- | 128 | /** Clock routine |
|
- | 129 | * |
|
- | 130 | * Clock routine executed from clock interrupt handler |
|
- | 131 | * (assuming interrupts_disable()'d). Runs expired timeouts |
|
- | 132 | * and preemptive scheduling. |
|
- | 133 | * |
|
- | 134 | */ |
|
- | 135 | void clock(void) |
|
- | 136 | { |
|
- | 137 | timeout_t *h; |
|
- | 138 | timeout_handler_t f; |
|
- | 139 | void *arg; |
|
- | 140 | count_t missed_clock_ticks = CPU->missed_clock_ticks; |
|
- | 141 | uint64_t *i = &(CPU->timeout_active_tree.basetime); |
|
- | 142 | uint64_t absolute_clock_ticks = *i + |
|
- | 143 | missed_clock_ticks; |
|
- | 144 | extavltree_node_t *head = &(CPU->timeout_active_tree.head); |
|
- | 145 | extavltree_node_t *expnode = head->next; |
|
- | 146 | ||
- | 147 | /* |
|
- | 148 | * To avoid lock ordering problems, |
|
- | 149 | * run all expired timeouts as you visit them. |
|
- | 150 | */ |
|
- | 151 | ||
- | 152 | for (; *i <= absolute_clock_ticks; (*i)++) { |
|
- | 153 | clock_update_counters(); |
|
- | 154 | spinlock_lock(&CPU->timeoutlock); |
|
- | 155 | ||
- | 156 | while ((expnode = head->next) != head) { |
|
- | 157 | h = extavltree_get_instance(expnode,timeout_t,node); |
|
- | 158 | spinlock_lock(&h->lock); |
|
- | 159 | if (expnode->key != *i) { |
|
- | 160 | spinlock_unlock(&h->lock); |
|
- | 161 | break; |
|
- | 162 | } |
|
- | 163 | ||
- | 164 | extavltree_delete_min(&CPU->timeout_active_tree); |
|
- | 165 | ||
- | 166 | f = h->handler; |
|
- | 167 | arg = h->arg; |
|
- | 168 | timeout_reinitialize(h); |
|
- | 169 | spinlock_unlock(&h->lock); |
|
- | 170 | spinlock_unlock(&CPU->timeoutlock); |
|
- | 171 | ||
- | 172 | f(arg); |
|
- | 173 | ||
- | 174 | spinlock_lock(&CPU->timeoutlock); |
|
- | 175 | } |
|
- | 176 | spinlock_unlock(&CPU->timeoutlock); |
|
- | 177 | } |
|
- | 178 | ||
- | 179 | CPU->missed_clock_ticks = 0; |
|
- | 180 | ||
- | 181 | /* |
|
- | 182 | * Do CPU usage accounting and find out whether to preempt THREAD. |
|
- | 183 | */ |
|
- | 184 | if (THREAD) { |
|
- | 185 | uint64_t ticks; |
|
- | 186 | ||
- | 187 | spinlock_lock(&CPU->lock); |
|
- | 188 | CPU->needs_relink += 1 + missed_clock_ticks; |
|
- | 189 | spinlock_unlock(&CPU->lock); |
|
- | 190 | ||
- | 191 | spinlock_lock(&THREAD->lock); |
|
- | 192 | if ((ticks = THREAD->ticks)) { |
|
- | 193 | if (ticks >= 1 + missed_clock_ticks) |
|
- | 194 | THREAD->ticks -= 1 + missed_clock_ticks; |
|
- | 195 | else |
|
- | 196 | THREAD->ticks = 0; |
|
- | 197 | } |
|
- | 198 | spinlock_unlock(&THREAD->lock); |
|
- | 199 | ||
- | 200 | if (!ticks && !PREEMPTION_DISABLED) { |
|
- | 201 | scheduler(); |
|
- | 202 | } |
|
- | 203 | } |
|
- | 204 | } |
|
- | 205 | ||
- | 206 | ||
- | 207 | #else |
|
- | 208 | ||
- | 209 | ||
126 | /** Clock routine |
210 | /** Clock routine |
127 | * |
211 | * |
128 | * Clock routine executed from clock interrupt handler |
212 | * Clock routine executed from clock interrupt handler |
129 | * (assuming interrupts_disable()'d). Runs expired timeouts |
213 | * (assuming interrupts_disable()'d). Runs expired timeouts |
130 | * and preemptive scheduling. |
214 | * and preemptive scheduling. |
131 | * |
215 | * |
132 | */ |
216 | */ |
133 | void clock(void) |
217 | void clock(void) |
134 | { |
218 | { |
135 | link_t *l; |
219 | link_t *l; |
136 | timeout_t *h; |
220 | timeout_t *h; |
137 | timeout_handler_t f; |
221 | timeout_handler_t f; |
138 | void *arg; |
222 | void *arg; |
139 | count_t missed_clock_ticks = CPU->missed_clock_ticks; |
223 | count_t missed_clock_ticks = CPU->missed_clock_ticks; |
140 | int i; |
224 | int i; |
141 | 225 | ||
142 | /* |
226 | /* |
143 | * To avoid lock ordering problems, |
227 | * To avoid lock ordering problems, |
144 | * run all expired timeouts as you visit them. |
228 | * run all expired timeouts as you visit them. |
145 | */ |
229 | */ |
146 | for (i = 0; i <= missed_clock_ticks; i++) { |
230 | for (i = 0; i <= missed_clock_ticks; i++) { |
147 | clock_update_counters(); |
231 | clock_update_counters(); |
148 | spinlock_lock(&CPU->timeoutlock); |
232 | spinlock_lock(&CPU->timeoutlock); |
149 | while ((l = CPU->timeout_active_head.next) != &CPU->timeout_active_head) { |
233 | while ((l = CPU->timeout_active_head.next) != &CPU->timeout_active_head) { |
150 | h = list_get_instance(l, timeout_t, link); |
234 | h = list_get_instance(l, timeout_t, link); |
151 | spinlock_lock(&h->lock); |
235 | spinlock_lock(&h->lock); |
152 | if (h->ticks-- != 0) { |
236 | if (h->ticks-- != 0) { |
153 | spinlock_unlock(&h->lock); |
237 | spinlock_unlock(&h->lock); |
154 | break; |
238 | break; |
155 | } |
239 | } |
156 | list_remove(l); |
240 | list_remove(l); |
157 | f = h->handler; |
241 | f = h->handler; |
158 | arg = h->arg; |
242 | arg = h->arg; |
159 | timeout_reinitialize(h); |
243 | timeout_reinitialize(h); |
160 | spinlock_unlock(&h->lock); |
244 | spinlock_unlock(&h->lock); |
161 | spinlock_unlock(&CPU->timeoutlock); |
245 | spinlock_unlock(&CPU->timeoutlock); |
162 | 246 | ||
163 | f(arg); |
247 | f(arg); |
164 | 248 | ||
165 | spinlock_lock(&CPU->timeoutlock); |
249 | spinlock_lock(&CPU->timeoutlock); |
166 | } |
250 | } |
167 | spinlock_unlock(&CPU->timeoutlock); |
251 | spinlock_unlock(&CPU->timeoutlock); |
168 | } |
252 | } |
169 | CPU->missed_clock_ticks = 0; |
253 | CPU->missed_clock_ticks = 0; |
170 | 254 | ||
171 | /* |
255 | /* |
172 | * Do CPU usage accounting and find out whether to preempt THREAD. |
256 | * Do CPU usage accounting and find out whether to preempt THREAD. |
173 | */ |
257 | */ |
174 | 258 | ||
175 | if (THREAD) { |
259 | if (THREAD) { |
176 | uint64_t ticks; |
260 | uint64_t ticks; |
177 | 261 | ||
178 | spinlock_lock(&CPU->lock); |
262 | spinlock_lock(&CPU->lock); |
179 | CPU->needs_relink += 1 + missed_clock_ticks; |
263 | CPU->needs_relink += 1 + missed_clock_ticks; |
180 | spinlock_unlock(&CPU->lock); |
264 | spinlock_unlock(&CPU->lock); |
181 | 265 | ||
182 | spinlock_lock(&THREAD->lock); |
266 | spinlock_lock(&THREAD->lock); |
183 | if ((ticks = THREAD->ticks)) { |
267 | if ((ticks = THREAD->ticks)) { |
184 | if (ticks >= 1 + missed_clock_ticks) |
268 | if (ticks >= 1 + missed_clock_ticks) |
185 | THREAD->ticks -= 1 + missed_clock_ticks; |
269 | THREAD->ticks -= 1 + missed_clock_ticks; |
186 | else |
270 | else |
187 | THREAD->ticks = 0; |
271 | THREAD->ticks = 0; |
188 | } |
272 | } |
189 | spinlock_unlock(&THREAD->lock); |
273 | spinlock_unlock(&THREAD->lock); |
190 | 274 | ||
191 | if (!ticks && !PREEMPTION_DISABLED) { |
275 | if (!ticks && !PREEMPTION_DISABLED) { |
192 | scheduler(); |
276 | scheduler(); |
193 | } |
277 | } |
194 | } |
278 | } |
195 | 279 | ||
196 | } |
280 | } |
197 | 281 | ||
- | 282 | #endif |
|
198 | /** @} |
283 | /** @} |
199 | */ |
284 | */ |
200 | 285 |