source: mainline/kernel/generic/src/time/clock.c@ 25939997

Last change on this file since 25939997 was 25939997, checked in by Jiří Zárevúcky <zarevucky.jiri@…>, 18 months ago

Make separate-stack-scheduler a loop with persistent context

We can see scheduler as a looping idle thread in which a thread
is repeatedly retrieved from a queue, prepared, switched to,
returned from, and cleaned up after.

IMO this is a more natural view of the process.

  • Property mode set to 100644
File size: 5.4 KB
RevLine 
[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 */
64uptime_t *uptime;
65
66/** Physical memory area of the real time clock */
[f8ddd17]67static 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 */
76void 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]107static 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]123static void cpu_update_accounting(void)
124{
[25939997]125 // FIXME: get_cycle() is unimplemented on several platforms
[d0c82c5]126 uint64_t now = get_cycle();
[4760793]127 atomic_time_increment(&CPU->busy_cycles, now - CPU_LOCAL->last_cycle);
128 CPU_LOCAL->last_cycle = now;
[d0c82c5]129}
130
[70527f1]131/** Clock routine
132 *
133 * Clock routine executed from clock interrupt handler
[22f7769]134 * (assuming interrupts_disable()'d). Runs expired timeouts
[70527f1]135 * and preemptive scheduling.
136 *
[f761f1eb]137 */
138void clock(void)
139{
[4760793]140 size_t missed_clock_ticks = CPU_LOCAL->missed_clock_ticks;
141 CPU_LOCAL->missed_clock_ticks = 0;
[ab855cd]142
[4760793]143 CPU_LOCAL->current_clock_tick += missed_clock_ticks + 1;
144 uint64_t current_clock_tick = CPU_LOCAL->current_clock_tick;
[d9dda26]145 clock_update_counters(current_clock_tick);
[a35b458]146
[d0c82c5]147 /* Account CPU usage */
148 cpu_update_accounting();
[a35b458]149
[f761f1eb]150 /*
151 * To avoid lock ordering problems,
152 * run all expired timeouts as you visit them.
[da1bafb]153 *
[f761f1eb]154 */
[a35b458]155
[ab855cd]156 irq_spinlock_lock(&CPU->timeoutlock, false);
[a35b458]157
[ab855cd]158 link_t *cur;
159 while ((cur = list_first(&CPU->timeout_active_list)) != NULL) {
160 timeout_t *timeout = list_get_instance(cur, timeout_t, link);
[a35b458]161
[ab855cd]162 if (current_clock_tick <= timeout->deadline) {
163 break;
164 }
[a35b458]165
[ab855cd]166 list_remove(cur);
167 timeout_handler_t handler = timeout->handler;
168 void *arg = timeout->arg;
[ba25c4b]169 atomic_bool *finished = &timeout->finished;
[a35b458]170
[ab855cd]171 irq_spinlock_unlock(&CPU->timeoutlock, false);
[a35b458]172
[ab855cd]173 handler(arg);
[a35b458]174
[ba25c4b]175 /* Signal that the handler is finished. */
176 atomic_store_explicit(finished, true, memory_order_release);
177
[ab855cd]178 irq_spinlock_lock(&CPU->timeoutlock, false);
[f761f1eb]179 }
[ab855cd]180
181 irq_spinlock_unlock(&CPU->timeoutlock, false);
[a35b458]182
[f761f1eb]183 /*
[43114c5]184 * Do CPU usage accounting and find out whether to preempt THREAD.
[da1bafb]185 *
[f761f1eb]186 */
[a35b458]187
[43114c5]188 if (THREAD) {
[4760793]189 if (current_clock_tick >= CPU_LOCAL->preempt_deadline && PREEMPTION_ENABLED) {
[151c050]190 thread_yield();
[3ff2b54]191#ifdef CONFIG_UDEBUG
192 /*
193 * Give udebug chance to stop the thread
[5d9430d7]194 * before it begins executing userspace code.
[3ff2b54]195 */
[da1bafb]196 istate_t *istate = THREAD->udebug.uspace_state;
197 if ((istate) && (istate_from_uspace(istate)))
[3ff2b54]198 udebug_before_thread_runs();
199#endif
[f761f1eb]200 }
201 }
202}
[b45c443]203
[1bb2e7a]204/** @}
[b45c443]205 */
Note: See TracBrowser for help on using the repository browser.