[f761f1eb] | 1 | /*
|
---|
[df4ed85] | 2 | * Copyright (c) 2001-2004 Jakub Jermar
|
---|
[f761f1eb] | 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 |
|
---|
[1bb2e7a] | 29 | /** @addtogroup time
|
---|
[b45c443] | 30 | * @{
|
---|
| 31 | */
|
---|
| 32 |
|
---|
[cf26ba9] | 33 | /**
|
---|
[b45c443] | 34 | * @file
|
---|
[cf26ba9] | 35 | * @brief High-level clock interrupt handler.
|
---|
| 36 | *
|
---|
| 37 | * This file contains the clock() function which is the source
|
---|
| 38 | * of preemption. It is also responsible for executing expired
|
---|
| 39 | * timeouts.
|
---|
| 40 | */
|
---|
| 41 |
|
---|
[f761f1eb] | 42 | #include <time/clock.h>
|
---|
| 43 | #include <time/timeout.h>
|
---|
| 44 | #include <config.h>
|
---|
| 45 | #include <synch/spinlock.h>
|
---|
| 46 | #include <synch/waitq.h>
|
---|
| 47 | #include <func.h>
|
---|
| 48 | #include <proc/scheduler.h>
|
---|
| 49 | #include <cpu.h>
|
---|
| 50 | #include <arch.h>
|
---|
[5c9a08b] | 51 | #include <adt/list.h>
|
---|
[23684b7] | 52 | #include <atomic.h>
|
---|
[1084a784] | 53 | #include <proc/thread.h>
|
---|
[d6e5cbc] | 54 | #include <sysinfo/sysinfo.h>
|
---|
| 55 | #include <arch/barrier.h>
|
---|
[f8ddd17] | 56 | #include <mm/frame.h>
|
---|
| 57 | #include <ddi/ddi.h>
|
---|
| 58 |
|
---|
[4b662f8c] | 59 | /* Pointer to variable with uptime */
|
---|
| 60 | uptime_t *uptime;
|
---|
| 61 |
|
---|
| 62 | /** Physical memory area of the real time clock */
|
---|
[f8ddd17] | 63 | static parea_t clock_parea;
|
---|
[d6e5cbc] | 64 |
|
---|
| 65 | /* Variable holding fragment of second, so that we would update
|
---|
| 66 | * seconds correctly
|
---|
| 67 | */
|
---|
[7f1c620] | 68 | static unative_t secfrag = 0;
|
---|
[d6e5cbc] | 69 |
|
---|
| 70 | /** Initialize realtime clock counter
|
---|
| 71 | *
|
---|
| 72 | * The applications (and sometimes kernel) need to access accurate
|
---|
| 73 | * information about realtime data. We allocate 1 page with these
|
---|
| 74 | * data and update it periodically.
|
---|
| 75 | */
|
---|
| 76 | void clock_counter_init(void)
|
---|
| 77 | {
|
---|
| 78 | void *faddr;
|
---|
| 79 |
|
---|
[f8ddd17] | 80 | faddr = frame_alloc(ONE_FRAME, FRAME_ATOMIC);
|
---|
[d6e5cbc] | 81 | if (!faddr)
|
---|
| 82 | panic("Cannot allocate page for clock");
|
---|
| 83 |
|
---|
[4b662f8c] | 84 | uptime = (uptime_t *) PA2KA(faddr);
|
---|
| 85 |
|
---|
| 86 | uptime->seconds1 = 0;
|
---|
| 87 | uptime->seconds2 = 0;
|
---|
| 88 | uptime->useconds = 0;
|
---|
[d6e5cbc] | 89 |
|
---|
[f8ddd17] | 90 | clock_parea.pbase = (uintptr_t) faddr;
|
---|
[4b662f8c] | 91 | clock_parea.vbase = (uintptr_t) uptime;
|
---|
[f8ddd17] | 92 | clock_parea.frames = 1;
|
---|
| 93 | clock_parea.cacheable = true;
|
---|
| 94 | ddi_parea_register(&clock_parea);
|
---|
| 95 |
|
---|
| 96 | /*
|
---|
| 97 | * Prepare information for the userspace so that it can successfully
|
---|
| 98 | * physmem_map() the clock_parea.
|
---|
| 99 | */
|
---|
| 100 | sysinfo_set_item_val("clock.cacheable", NULL, (unative_t) true);
|
---|
| 101 | sysinfo_set_item_val("clock.faddr", NULL, (unative_t) faddr);
|
---|
[d6e5cbc] | 102 | }
|
---|
| 103 |
|
---|
| 104 |
|
---|
| 105 | /** Update public counters
|
---|
| 106 | *
|
---|
| 107 | * Update it only on first processor
|
---|
| 108 | * TODO: Do we really need so many write barriers?
|
---|
| 109 | */
|
---|
| 110 | static void clock_update_counters(void)
|
---|
| 111 | {
|
---|
| 112 | if (CPU->id == 0) {
|
---|
[4b662f8c] | 113 | secfrag += 1000000 / HZ;
|
---|
[d6e5cbc] | 114 | if (secfrag >= 1000000) {
|
---|
[fd8302d] | 115 | secfrag -= 1000000;
|
---|
[4b662f8c] | 116 | uptime->seconds1++;
|
---|
[d6e5cbc] | 117 | write_barrier();
|
---|
[4b662f8c] | 118 | uptime->useconds = secfrag;
|
---|
[fd8302d] | 119 | write_barrier();
|
---|
[4b662f8c] | 120 | uptime->seconds2 = uptime->seconds1;
|
---|
[d6e5cbc] | 121 | } else
|
---|
[4b662f8c] | 122 | uptime->useconds += 1000000 / HZ;
|
---|
[d6e5cbc] | 123 | }
|
---|
| 124 | }
|
---|
[f761f1eb] | 125 |
|
---|
[70527f1] | 126 | /** Clock routine
|
---|
| 127 | *
|
---|
| 128 | * Clock routine executed from clock interrupt handler
|
---|
[22f7769] | 129 | * (assuming interrupts_disable()'d). Runs expired timeouts
|
---|
[70527f1] | 130 | * and preemptive scheduling.
|
---|
| 131 | *
|
---|
[f761f1eb] | 132 | */
|
---|
| 133 | void clock(void)
|
---|
| 134 | {
|
---|
| 135 | link_t *l;
|
---|
| 136 | timeout_t *h;
|
---|
[ba1b2194] | 137 | timeout_handler_t f;
|
---|
[f761f1eb] | 138 | void *arg;
|
---|
[8cf8ee6] | 139 | count_t missed_clock_ticks = CPU->missed_clock_ticks;
|
---|
[6c441cf8] | 140 | unsigned int i;
|
---|
[f761f1eb] | 141 |
|
---|
| 142 | /*
|
---|
| 143 | * To avoid lock ordering problems,
|
---|
| 144 | * run all expired timeouts as you visit them.
|
---|
| 145 | */
|
---|
[8cf8ee6] | 146 | for (i = 0; i <= missed_clock_ticks; i++) {
|
---|
[d6e5cbc] | 147 | clock_update_counters();
|
---|
[c93e805] | 148 | spinlock_lock(&CPU->timeoutlock);
|
---|
| 149 | while ((l = CPU->timeout_active_head.next) != &CPU->timeout_active_head) {
|
---|
| 150 | h = list_get_instance(l, timeout_t, link);
|
---|
| 151 | spinlock_lock(&h->lock);
|
---|
| 152 | if (h->ticks-- != 0) {
|
---|
| 153 | spinlock_unlock(&h->lock);
|
---|
| 154 | break;
|
---|
| 155 | }
|
---|
| 156 | list_remove(l);
|
---|
| 157 | f = h->handler;
|
---|
| 158 | arg = h->arg;
|
---|
| 159 | timeout_reinitialize(h);
|
---|
| 160 | spinlock_unlock(&h->lock);
|
---|
| 161 | spinlock_unlock(&CPU->timeoutlock);
|
---|
[f761f1eb] | 162 |
|
---|
[c93e805] | 163 | f(arg);
|
---|
[f761f1eb] | 164 |
|
---|
[c93e805] | 165 | spinlock_lock(&CPU->timeoutlock);
|
---|
| 166 | }
|
---|
| 167 | spinlock_unlock(&CPU->timeoutlock);
|
---|
[f761f1eb] | 168 | }
|
---|
[c93e805] | 169 | CPU->missed_clock_ticks = 0;
|
---|
[f761f1eb] | 170 |
|
---|
| 171 | /*
|
---|
[43114c5] | 172 | * Do CPU usage accounting and find out whether to preempt THREAD.
|
---|
[f761f1eb] | 173 | */
|
---|
| 174 |
|
---|
[43114c5] | 175 | if (THREAD) {
|
---|
[7f1c620] | 176 | uint64_t ticks;
|
---|
[dbe9ff0] | 177 |
|
---|
[43114c5] | 178 | spinlock_lock(&CPU->lock);
|
---|
[8cf8ee6] | 179 | CPU->needs_relink += 1 + missed_clock_ticks;
|
---|
[43114c5] | 180 | spinlock_unlock(&CPU->lock);
|
---|
[f761f1eb] | 181 |
|
---|
[43114c5] | 182 | spinlock_lock(&THREAD->lock);
|
---|
[8cf8ee6] | 183 | if ((ticks = THREAD->ticks)) {
|
---|
| 184 | if (ticks >= 1 + missed_clock_ticks)
|
---|
| 185 | THREAD->ticks -= 1 + missed_clock_ticks;
|
---|
| 186 | else
|
---|
| 187 | THREAD->ticks = 0;
|
---|
| 188 | }
|
---|
[dbe9ff0] | 189 | spinlock_unlock(&THREAD->lock);
|
---|
| 190 |
|
---|
| 191 | if (!ticks && !PREEMPTION_DISABLED) {
|
---|
[f761f1eb] | 192 | scheduler();
|
---|
[3ff2b54] | 193 | #ifdef CONFIG_UDEBUG
|
---|
| 194 | /*
|
---|
| 195 | * Give udebug chance to stop the thread
|
---|
| 196 | * before it begins executing.
|
---|
| 197 | */
|
---|
| 198 | if (istate_from_uspace(THREAD->udebug.uspace_state))
|
---|
| 199 | udebug_before_thread_runs();
|
---|
| 200 | #endif
|
---|
[f761f1eb] | 201 | }
|
---|
| 202 | }
|
---|
| 203 |
|
---|
| 204 | }
|
---|
[b45c443] | 205 |
|
---|
[1bb2e7a] | 206 | /** @}
|
---|
[b45c443] | 207 | */
|
---|