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

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 05882233 was 05882233, checked in by Jiří Zárevúcky <jiri.zarevucky@…>, 7 years ago

Unify various barrier includes into <barrier.h>

  • Property mode set to 100644
File size: 5.8 KB
RevLine 
[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
[da1bafb]35 * @brief High-level clock interrupt handler.
[cf26ba9]36 *
37 * This file contains the clock() function which is the source
38 * of preemption. It is also responsible for executing expired
39 * timeouts.
[da1bafb]40 *
[cf26ba9]41 */
[da1bafb]42
[f761f1eb]43#include <time/clock.h>
44#include <time/timeout.h>
45#include <config.h>
46#include <synch/spinlock.h>
47#include <synch/waitq.h>
[b2e121a]48#include <halt.h>
[f761f1eb]49#include <proc/scheduler.h>
50#include <cpu.h>
51#include <arch.h>
[5c9a08b]52#include <adt/list.h>
[23684b7]53#include <atomic.h>
[1084a784]54#include <proc/thread.h>
[d6e5cbc]55#include <sysinfo/sysinfo.h>
[05882233]56#include <barrier.h>
[f8ddd17]57#include <mm/frame.h>
58#include <ddi/ddi.h>
[d0c82c5]59#include <arch/cycle.h>
[f8ddd17]60
[4b662f8c]61/* Pointer to variable with uptime */
62uptime_t *uptime;
63
64/** Physical memory area of the real time clock */
[f8ddd17]65static parea_t clock_parea;
[d6e5cbc]66
[da1bafb]67/** Fragment of second
68 *
69 * For updating seconds correctly.
70 *
[d6e5cbc]71 */
[96b02eb9]72static sysarg_t secfrag = 0;
[d6e5cbc]73
74/** Initialize realtime clock counter
75 *
76 * The applications (and sometimes kernel) need to access accurate
[1b20da0]77 * information about realtime data. We allocate 1 page with these
[d6e5cbc]78 * data and update it periodically.
[da1bafb]79 *
[d6e5cbc]80 */
81void clock_counter_init(void)
82{
[b0c2075]83 uintptr_t faddr = frame_alloc(1, FRAME_ATOMIC, 0);
[8cbf1c3]84 if (faddr == 0)
[f651e80]85 panic("Cannot allocate page for clock.");
[a35b458]86
[4b662f8c]87 uptime = (uptime_t *) PA2KA(faddr);
[a35b458]88
[4b662f8c]89 uptime->seconds1 = 0;
90 uptime->seconds2 = 0;
[9dae191e]91 uptime->useconds = 0;
[a35b458]92
[8cbf1c3]93 clock_parea.pbase = faddr;
[f8ddd17]94 clock_parea.frames = 1;
[d7533c7]95 clock_parea.unpriv = true;
[b366a6f4]96 clock_parea.mapped = false;
[f8ddd17]97 ddi_parea_register(&clock_parea);
[a35b458]98
[f8ddd17]99 /*
100 * Prepare information for the userspace so that it can successfully
101 * physmem_map() the clock_parea.
[da1bafb]102 *
[f8ddd17]103 */
[96b02eb9]104 sysinfo_set_item_val("clock.faddr", NULL, (sysarg_t) faddr);
[d6e5cbc]105}
106
107/** Update public counters
108 *
109 * Update it only on first processor
[da1bafb]110 * TODO: Do we really need so many write barriers?
111 *
[d6e5cbc]112 */
113static void clock_update_counters(void)
114{
115 if (CPU->id == 0) {
[4b662f8c]116 secfrag += 1000000 / HZ;
[d6e5cbc]117 if (secfrag >= 1000000) {
[fd8302d]118 secfrag -= 1000000;
[4b662f8c]119 uptime->seconds1++;
[d6e5cbc]120 write_barrier();
[4b662f8c]121 uptime->useconds = secfrag;
[fd8302d]122 write_barrier();
[4b662f8c]123 uptime->seconds2 = uptime->seconds1;
[d6e5cbc]124 } else
[4b662f8c]125 uptime->useconds += 1000000 / HZ;
[d6e5cbc]126 }
127}
[f761f1eb]128
[d0c82c5]129static void cpu_update_accounting(void)
130{
131 irq_spinlock_lock(&CPU->lock, false);
132 uint64_t now = get_cycle();
133 CPU->busy_cycles += now - CPU->last_cycle;
134 CPU->last_cycle = now;
135 irq_spinlock_unlock(&CPU->lock, false);
136}
137
[70527f1]138/** Clock routine
139 *
140 * Clock routine executed from clock interrupt handler
[22f7769]141 * (assuming interrupts_disable()'d). Runs expired timeouts
[70527f1]142 * and preemptive scheduling.
143 *
[f761f1eb]144 */
145void clock(void)
146{
[98000fb]147 size_t missed_clock_ticks = CPU->missed_clock_ticks;
[a35b458]148
[d0c82c5]149 /* Account CPU usage */
150 cpu_update_accounting();
[a35b458]151
[f761f1eb]152 /*
153 * To avoid lock ordering problems,
154 * run all expired timeouts as you visit them.
[da1bafb]155 *
[f761f1eb]156 */
[da1bafb]157 size_t i;
[8cf8ee6]158 for (i = 0; i <= missed_clock_ticks; i++) {
[d0c82c5]159 /* Update counters and accounting */
[d6e5cbc]160 clock_update_counters();
[d0c82c5]161 cpu_update_accounting();
[a35b458]162
[da1bafb]163 irq_spinlock_lock(&CPU->timeoutlock, false);
[a35b458]164
[da1bafb]165 link_t *cur;
[55b77d9]166 while ((cur = list_first(&CPU->timeout_active_list)) != NULL) {
167 timeout_t *timeout = list_get_instance(cur, timeout_t,
168 link);
[a35b458]169
[da1bafb]170 irq_spinlock_lock(&timeout->lock, false);
171 if (timeout->ticks-- != 0) {
172 irq_spinlock_unlock(&timeout->lock, false);
[c93e805]173 break;
174 }
[a35b458]175
[da1bafb]176 list_remove(cur);
177 timeout_handler_t handler = timeout->handler;
178 void *arg = timeout->arg;
179 timeout_reinitialize(timeout);
[a35b458]180
[da1bafb]181 irq_spinlock_unlock(&timeout->lock, false);
182 irq_spinlock_unlock(&CPU->timeoutlock, false);
[a35b458]183
[da1bafb]184 handler(arg);
[a35b458]185
[da1bafb]186 irq_spinlock_lock(&CPU->timeoutlock, false);
[c93e805]187 }
[a35b458]188
[da1bafb]189 irq_spinlock_unlock(&CPU->timeoutlock, false);
[f761f1eb]190 }
[c93e805]191 CPU->missed_clock_ticks = 0;
[a35b458]192
[f761f1eb]193 /*
[43114c5]194 * Do CPU usage accounting and find out whether to preempt THREAD.
[da1bafb]195 *
[f761f1eb]196 */
[a35b458]197
[43114c5]198 if (THREAD) {
[7f1c620]199 uint64_t ticks;
[a35b458]200
[da1bafb]201 irq_spinlock_lock(&CPU->lock, false);
[8cf8ee6]202 CPU->needs_relink += 1 + missed_clock_ticks;
[da1bafb]203 irq_spinlock_unlock(&CPU->lock, false);
[a35b458]204
[da1bafb]205 irq_spinlock_lock(&THREAD->lock, false);
[8cf8ee6]206 if ((ticks = THREAD->ticks)) {
207 if (ticks >= 1 + missed_clock_ticks)
208 THREAD->ticks -= 1 + missed_clock_ticks;
209 else
210 THREAD->ticks = 0;
211 }
[da1bafb]212 irq_spinlock_unlock(&THREAD->lock, false);
[a35b458]213
[057e77f]214 if (ticks == 0 && PREEMPTION_ENABLED) {
[f761f1eb]215 scheduler();
[3ff2b54]216#ifdef CONFIG_UDEBUG
217 /*
218 * Give udebug chance to stop the thread
[5d9430d7]219 * before it begins executing userspace code.
[3ff2b54]220 */
[da1bafb]221 istate_t *istate = THREAD->udebug.uspace_state;
222 if ((istate) && (istate_from_uspace(istate)))
[3ff2b54]223 udebug_before_thread_runs();
224#endif
[f761f1eb]225 }
226 }
227}
[b45c443]228
[1bb2e7a]229/** @}
[b45c443]230 */
Note: See TracBrowser for help on using the repository browser.