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

Last change on this file 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
Line 
1/*
2 * Copyright (c) 2001-2004 Jakub Jermar
3 * Copyright (c) 2022 Jiří Zárevúcky
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
30/** @addtogroup kernel_time
31 * @{
32 */
33
34/**
35 * @file
36 * @brief High-level clock interrupt handler.
37 *
38 * This file contains the clock() function which is the source
39 * of preemption. It is also responsible for executing expired
40 * timeouts.
41 *
42 */
43
44#include <time/clock.h>
45#include <time/timeout.h>
46#include <config.h>
47#include <synch/spinlock.h>
48#include <synch/waitq.h>
49#include <halt.h>
50#include <proc/scheduler.h>
51#include <cpu.h>
52#include <arch.h>
53#include <adt/list.h>
54#include <atomic.h>
55#include <proc/thread.h>
56#include <sysinfo/sysinfo.h>
57#include <barrier.h>
58#include <mm/frame.h>
59#include <ddi/ddi.h>
60#include <arch/cycle.h>
61#include <preemption.h>
62
63/* Pointer to variable with uptime */
64uptime_t *uptime;
65
66/** Physical memory area of the real time clock */
67static parea_t clock_parea;
68
69/** Initialize realtime clock counter
70 *
71 * The applications (and sometimes kernel) need to access accurate
72 * information about realtime data. We allocate 1 page with these
73 * data and update it periodically.
74 *
75 */
76void clock_counter_init(void)
77{
78 uintptr_t faddr = frame_alloc(1, FRAME_LOWMEM | FRAME_ATOMIC, 0);
79 if (faddr == 0)
80 panic("Cannot allocate page for clock.");
81
82 uptime = (uptime_t *) PA2KA(faddr);
83
84 uptime->seconds1 = 0;
85 uptime->seconds2 = 0;
86 uptime->useconds = 0;
87
88 ddi_parea_init(&clock_parea);
89 clock_parea.pbase = faddr;
90 clock_parea.frames = 1;
91 clock_parea.unpriv = true;
92 clock_parea.mapped = false;
93 ddi_parea_register(&clock_parea);
94
95 /*
96 * Prepare information for the userspace so that it can successfully
97 * physmem_map() the clock_parea.
98 *
99 */
100 sysinfo_set_item_val("clock.faddr", NULL, (sysarg_t) faddr);
101}
102
103/** Update public counters
104 *
105 * Update it only on first processor
106 */
107static void clock_update_counters(uint64_t current_tick)
108{
109 if (CPU->id == 0) {
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;
120 }
121}
122
123static void cpu_update_accounting(void)
124{
125 // FIXME: get_cycle() is unimplemented on several platforms
126 uint64_t now = get_cycle();
127 atomic_time_increment(&CPU->busy_cycles, now - CPU_LOCAL->last_cycle);
128 CPU_LOCAL->last_cycle = now;
129}
130
131/** Clock routine
132 *
133 * Clock routine executed from clock interrupt handler
134 * (assuming interrupts_disable()'d). Runs expired timeouts
135 * and preemptive scheduling.
136 *
137 */
138void clock(void)
139{
140 size_t missed_clock_ticks = CPU_LOCAL->missed_clock_ticks;
141 CPU_LOCAL->missed_clock_ticks = 0;
142
143 CPU_LOCAL->current_clock_tick += missed_clock_ticks + 1;
144 uint64_t current_clock_tick = CPU_LOCAL->current_clock_tick;
145 clock_update_counters(current_clock_tick);
146
147 /* Account CPU usage */
148 cpu_update_accounting();
149
150 /*
151 * To avoid lock ordering problems,
152 * run all expired timeouts as you visit them.
153 *
154 */
155
156 irq_spinlock_lock(&CPU->timeoutlock, false);
157
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);
161
162 if (current_clock_tick <= timeout->deadline) {
163 break;
164 }
165
166 list_remove(cur);
167 timeout_handler_t handler = timeout->handler;
168 void *arg = timeout->arg;
169 atomic_bool *finished = &timeout->finished;
170
171 irq_spinlock_unlock(&CPU->timeoutlock, false);
172
173 handler(arg);
174
175 /* Signal that the handler is finished. */
176 atomic_store_explicit(finished, true, memory_order_release);
177
178 irq_spinlock_lock(&CPU->timeoutlock, false);
179 }
180
181 irq_spinlock_unlock(&CPU->timeoutlock, false);
182
183 /*
184 * Do CPU usage accounting and find out whether to preempt THREAD.
185 *
186 */
187
188 if (THREAD) {
189 if (current_clock_tick >= CPU_LOCAL->preempt_deadline && PREEMPTION_ENABLED) {
190 thread_yield();
191#ifdef CONFIG_UDEBUG
192 /*
193 * Give udebug chance to stop the thread
194 * before it begins executing userspace code.
195 */
196 istate_t *istate = THREAD->udebug.uspace_state;
197 if ((istate) && (istate_from_uspace(istate)))
198 udebug_before_thread_runs();
199#endif
200 }
201 }
202}
203
204/** @}
205 */
Note: See TracBrowser for help on using the repository browser.