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