[f761f1eb] | 1 | /*
|
---|
[df4ed85] | 2 | * Copyright (c) 2001-2004 Jakub Jermar
|
---|
[eda43238] | 3 | * Copyright (c) 2022 Jiří Zárevúcky
|
---|
[f761f1eb] | 4 | * All rights reserved.
|
---|
| 5 | *
|
---|
| 6 | * Redistribution and use in source and binary forms, with or without
|
---|
| 7 | * modification, are permitted provided that the following conditions
|
---|
| 8 | * are met:
|
---|
| 9 | *
|
---|
| 10 | * - Redistributions of source code must retain the above copyright
|
---|
| 11 | * notice, this list of conditions and the following disclaimer.
|
---|
| 12 | * - Redistributions in binary form must reproduce the above copyright
|
---|
| 13 | * notice, this list of conditions and the following disclaimer in the
|
---|
| 14 | * documentation and/or other materials provided with the distribution.
|
---|
| 15 | * - The name of the author may not be used to endorse or promote products
|
---|
| 16 | * derived from this software without specific prior written permission.
|
---|
| 17 | *
|
---|
| 18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
| 19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
| 20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
| 21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
| 22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
| 23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
| 24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
| 25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
| 26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
| 27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
| 28 | */
|
---|
| 29 |
|
---|
[e88eb48] | 30 | /** @addtogroup kernel_time
|
---|
[b45c443] | 31 | * @{
|
---|
| 32 | */
|
---|
| 33 |
|
---|
[cf26ba9] | 34 | /**
|
---|
[b45c443] | 35 | * @file
|
---|
[da1bafb] | 36 | * @brief High-level clock interrupt handler.
|
---|
[cf26ba9] | 37 | *
|
---|
| 38 | * This file contains the clock() function which is the source
|
---|
| 39 | * of preemption. It is also responsible for executing expired
|
---|
| 40 | * timeouts.
|
---|
[da1bafb] | 41 | *
|
---|
[cf26ba9] | 42 | */
|
---|
[da1bafb] | 43 |
|
---|
[f761f1eb] | 44 | #include <time/clock.h>
|
---|
| 45 | #include <time/timeout.h>
|
---|
| 46 | #include <config.h>
|
---|
| 47 | #include <synch/spinlock.h>
|
---|
| 48 | #include <synch/waitq.h>
|
---|
[b2e121a] | 49 | #include <halt.h>
|
---|
[f761f1eb] | 50 | #include <proc/scheduler.h>
|
---|
| 51 | #include <cpu.h>
|
---|
| 52 | #include <arch.h>
|
---|
[5c9a08b] | 53 | #include <adt/list.h>
|
---|
[23684b7] | 54 | #include <atomic.h>
|
---|
[1084a784] | 55 | #include <proc/thread.h>
|
---|
[d6e5cbc] | 56 | #include <sysinfo/sysinfo.h>
|
---|
[05882233] | 57 | #include <barrier.h>
|
---|
[f8ddd17] | 58 | #include <mm/frame.h>
|
---|
| 59 | #include <ddi/ddi.h>
|
---|
[d0c82c5] | 60 | #include <arch/cycle.h>
|
---|
[f43d8ce] | 61 | #include <preemption.h>
|
---|
[f8ddd17] | 62 |
|
---|
[4b662f8c] | 63 | /* Pointer to variable with uptime */
|
---|
| 64 | uptime_t *uptime;
|
---|
| 65 |
|
---|
| 66 | /** Physical memory area of the real time clock */
|
---|
[f8ddd17] | 67 | static parea_t clock_parea;
|
---|
[d6e5cbc] | 68 |
|
---|
| 69 | /** Initialize realtime clock counter
|
---|
| 70 | *
|
---|
| 71 | * The applications (and sometimes kernel) need to access accurate
|
---|
[1b20da0] | 72 | * information about realtime data. We allocate 1 page with these
|
---|
[d6e5cbc] | 73 | * data and update it periodically.
|
---|
[da1bafb] | 74 | *
|
---|
[d6e5cbc] | 75 | */
|
---|
| 76 | void clock_counter_init(void)
|
---|
| 77 | {
|
---|
[482f968] | 78 | uintptr_t faddr = frame_alloc(1, FRAME_LOWMEM | FRAME_ATOMIC, 0);
|
---|
[8cbf1c3] | 79 | if (faddr == 0)
|
---|
[f651e80] | 80 | panic("Cannot allocate page for clock.");
|
---|
[a35b458] | 81 |
|
---|
[4b662f8c] | 82 | uptime = (uptime_t *) PA2KA(faddr);
|
---|
[a35b458] | 83 |
|
---|
[4b662f8c] | 84 | uptime->seconds1 = 0;
|
---|
| 85 | uptime->seconds2 = 0;
|
---|
[9dae191e] | 86 | uptime->useconds = 0;
|
---|
[a35b458] | 87 |
|
---|
[6f7071b] | 88 | ddi_parea_init(&clock_parea);
|
---|
[8cbf1c3] | 89 | clock_parea.pbase = faddr;
|
---|
[f8ddd17] | 90 | clock_parea.frames = 1;
|
---|
[d7533c7] | 91 | clock_parea.unpriv = true;
|
---|
[b366a6f4] | 92 | clock_parea.mapped = false;
|
---|
[f8ddd17] | 93 | ddi_parea_register(&clock_parea);
|
---|
[a35b458] | 94 |
|
---|
[f8ddd17] | 95 | /*
|
---|
| 96 | * Prepare information for the userspace so that it can successfully
|
---|
| 97 | * physmem_map() the clock_parea.
|
---|
[da1bafb] | 98 | *
|
---|
[f8ddd17] | 99 | */
|
---|
[96b02eb9] | 100 | sysinfo_set_item_val("clock.faddr", NULL, (sysarg_t) faddr);
|
---|
[d6e5cbc] | 101 | }
|
---|
| 102 |
|
---|
| 103 | /** Update public counters
|
---|
| 104 | *
|
---|
| 105 | * Update it only on first processor
|
---|
| 106 | */
|
---|
[d9dda26] | 107 | static void clock_update_counters(uint64_t current_tick)
|
---|
[d6e5cbc] | 108 | {
|
---|
| 109 | if (CPU->id == 0) {
|
---|
[d9dda26] | 110 | uint64_t usec = (1000000 / HZ) * current_tick;
|
---|
| 111 |
|
---|
| 112 | sysarg_t secs = usec / 1000000;
|
---|
| 113 | sysarg_t usecs = usec % 1000000;
|
---|
| 114 |
|
---|
| 115 | uptime->seconds1 = secs;
|
---|
| 116 | write_barrier();
|
---|
| 117 | uptime->useconds = usecs;
|
---|
| 118 | write_barrier();
|
---|
| 119 | uptime->seconds2 = secs;
|
---|
[d6e5cbc] | 120 | }
|
---|
| 121 | }
|
---|
[f761f1eb] | 122 |
|
---|
[d0c82c5] | 123 | static void cpu_update_accounting(void)
|
---|
| 124 | {
|
---|
| 125 | uint64_t now = get_cycle();
|
---|
[b2ec5cf] | 126 | atomic_time_increment(&CPU->busy_cycles, now - CPU->last_cycle);
|
---|
[d0c82c5] | 127 | CPU->last_cycle = now;
|
---|
| 128 | }
|
---|
| 129 |
|
---|
[70527f1] | 130 | /** Clock routine
|
---|
| 131 | *
|
---|
| 132 | * Clock routine executed from clock interrupt handler
|
---|
[22f7769] | 133 | * (assuming interrupts_disable()'d). Runs expired timeouts
|
---|
[70527f1] | 134 | * and preemptive scheduling.
|
---|
| 135 | *
|
---|
[f761f1eb] | 136 | */
|
---|
| 137 | void clock(void)
|
---|
| 138 | {
|
---|
[98000fb] | 139 | size_t missed_clock_ticks = CPU->missed_clock_ticks;
|
---|
[ab855cd] | 140 | CPU->missed_clock_ticks = 0;
|
---|
| 141 |
|
---|
[d9dda26] | 142 | CPU->current_clock_tick += missed_clock_ticks + 1;
|
---|
| 143 | uint64_t current_clock_tick = CPU->current_clock_tick;
|
---|
| 144 | clock_update_counters(current_clock_tick);
|
---|
[a35b458] | 145 |
|
---|
[d0c82c5] | 146 | /* Account CPU usage */
|
---|
| 147 | cpu_update_accounting();
|
---|
[a35b458] | 148 |
|
---|
[f761f1eb] | 149 | /*
|
---|
| 150 | * To avoid lock ordering problems,
|
---|
| 151 | * run all expired timeouts as you visit them.
|
---|
[da1bafb] | 152 | *
|
---|
[f761f1eb] | 153 | */
|
---|
[a35b458] | 154 |
|
---|
[ab855cd] | 155 | irq_spinlock_lock(&CPU->timeoutlock, false);
|
---|
[a35b458] | 156 |
|
---|
[ab855cd] | 157 | link_t *cur;
|
---|
| 158 | while ((cur = list_first(&CPU->timeout_active_list)) != NULL) {
|
---|
| 159 | timeout_t *timeout = list_get_instance(cur, timeout_t, link);
|
---|
[a35b458] | 160 |
|
---|
[ab855cd] | 161 | if (current_clock_tick <= timeout->deadline) {
|
---|
| 162 | break;
|
---|
| 163 | }
|
---|
[a35b458] | 164 |
|
---|
[ab855cd] | 165 | list_remove(cur);
|
---|
| 166 | timeout_handler_t handler = timeout->handler;
|
---|
| 167 | void *arg = timeout->arg;
|
---|
[ba25c4b] | 168 | atomic_bool *finished = &timeout->finished;
|
---|
[a35b458] | 169 |
|
---|
[ab855cd] | 170 | irq_spinlock_unlock(&CPU->timeoutlock, false);
|
---|
[a35b458] | 171 |
|
---|
[ab855cd] | 172 | handler(arg);
|
---|
[a35b458] | 173 |
|
---|
[ba25c4b] | 174 | /* Signal that the handler is finished. */
|
---|
| 175 | atomic_store_explicit(finished, true, memory_order_release);
|
---|
| 176 |
|
---|
[ab855cd] | 177 | irq_spinlock_lock(&CPU->timeoutlock, false);
|
---|
[f761f1eb] | 178 | }
|
---|
[ab855cd] | 179 |
|
---|
| 180 | irq_spinlock_unlock(&CPU->timeoutlock, false);
|
---|
[a35b458] | 181 |
|
---|
[f761f1eb] | 182 | /*
|
---|
[43114c5] | 183 | * Do CPU usage accounting and find out whether to preempt THREAD.
|
---|
[da1bafb] | 184 | *
|
---|
[f761f1eb] | 185 | */
|
---|
[a35b458] | 186 |
|
---|
[43114c5] | 187 | if (THREAD) {
|
---|
[aae2869] | 188 | if (current_clock_tick >= CPU->preempt_deadline && PREEMPTION_ENABLED) {
|
---|
[f761f1eb] | 189 | scheduler();
|
---|
[3ff2b54] | 190 | #ifdef CONFIG_UDEBUG
|
---|
| 191 | /*
|
---|
| 192 | * Give udebug chance to stop the thread
|
---|
[5d9430d7] | 193 | * before it begins executing userspace code.
|
---|
[3ff2b54] | 194 | */
|
---|
[da1bafb] | 195 | istate_t *istate = THREAD->udebug.uspace_state;
|
---|
| 196 | if ((istate) && (istate_from_uspace(istate)))
|
---|
[3ff2b54] | 197 | udebug_before_thread_runs();
|
---|
| 198 | #endif
|
---|
[f761f1eb] | 199 | }
|
---|
| 200 | }
|
---|
| 201 | }
|
---|
[b45c443] | 202 |
|
---|
[1bb2e7a] | 203 | /** @}
|
---|
[b45c443] | 204 | */
|
---|