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

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since e2ea4ab1 was d0c82c5, checked in by Martin Decky <martin@…>, 15 years ago

perfect CPU cycles accounting, cherry-picked and adopted from lp:~ersin/helenos/measure2

  • 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>
48#include <func.h>
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>
56#include <arch/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 */
[7f1c620]72static unative_t secfrag = 0;
[d6e5cbc]73
74/** Initialize realtime clock counter
75 *
76 * The applications (and sometimes kernel) need to access accurate
77 * information about realtime data. We allocate 1 page with these
78 * data and update it periodically.
[da1bafb]79 *
[d6e5cbc]80 */
81void clock_counter_init(void)
82{
[da1bafb]83 void *faddr = frame_alloc(ONE_FRAME, FRAME_ATOMIC);
[d6e5cbc]84 if (!faddr)
[f651e80]85 panic("Cannot allocate page for clock.");
[d6e5cbc]86
[4b662f8c]87 uptime = (uptime_t *) PA2KA(faddr);
88
89 uptime->seconds1 = 0;
90 uptime->seconds2 = 0;
[9dae191e]91 uptime->useconds = 0;
[da1bafb]92
[f8ddd17]93 clock_parea.pbase = (uintptr_t) faddr;
94 clock_parea.frames = 1;
95 ddi_parea_register(&clock_parea);
[da1bafb]96
[f8ddd17]97 /*
98 * Prepare information for the userspace so that it can successfully
99 * physmem_map() the clock_parea.
[da1bafb]100 *
[f8ddd17]101 */
102 sysinfo_set_item_val("clock.cacheable", NULL, (unative_t) true);
103 sysinfo_set_item_val("clock.faddr", NULL, (unative_t) faddr);
[d6e5cbc]104}
105
106/** Update public counters
107 *
108 * Update it only on first processor
[da1bafb]109 * TODO: Do we really need so many write barriers?
110 *
[d6e5cbc]111 */
112static void clock_update_counters(void)
113{
114 if (CPU->id == 0) {
[4b662f8c]115 secfrag += 1000000 / HZ;
[d6e5cbc]116 if (secfrag >= 1000000) {
[fd8302d]117 secfrag -= 1000000;
[4b662f8c]118 uptime->seconds1++;
[d6e5cbc]119 write_barrier();
[4b662f8c]120 uptime->useconds = secfrag;
[fd8302d]121 write_barrier();
[4b662f8c]122 uptime->seconds2 = uptime->seconds1;
[d6e5cbc]123 } else
[4b662f8c]124 uptime->useconds += 1000000 / HZ;
[d6e5cbc]125 }
126}
[f761f1eb]127
[d0c82c5]128static void cpu_update_accounting(void)
129{
130 irq_spinlock_lock(&CPU->lock, false);
131 uint64_t now = get_cycle();
132 CPU->busy_cycles += now - CPU->last_cycle;
133 CPU->last_cycle = now;
134 irq_spinlock_unlock(&CPU->lock, false);
135}
136
[70527f1]137/** Clock routine
138 *
139 * Clock routine executed from clock interrupt handler
[22f7769]140 * (assuming interrupts_disable()'d). Runs expired timeouts
[70527f1]141 * and preemptive scheduling.
142 *
[f761f1eb]143 */
144void clock(void)
145{
[98000fb]146 size_t missed_clock_ticks = CPU->missed_clock_ticks;
[da1bafb]147
[d0c82c5]148 /* Account CPU usage */
149 cpu_update_accounting();
[da1bafb]150
[f761f1eb]151 /*
152 * To avoid lock ordering problems,
153 * run all expired timeouts as you visit them.
[da1bafb]154 *
[f761f1eb]155 */
[da1bafb]156 size_t i;
[8cf8ee6]157 for (i = 0; i <= missed_clock_ticks; i++) {
[d0c82c5]158 /* Update counters and accounting */
[d6e5cbc]159 clock_update_counters();
[d0c82c5]160 cpu_update_accounting();
161
[da1bafb]162 irq_spinlock_lock(&CPU->timeoutlock, false);
163
164 link_t *cur;
165 while ((cur = CPU->timeout_active_head.next) != &CPU->timeout_active_head) {
166 timeout_t *timeout = list_get_instance(cur, timeout_t, link);
167
168 irq_spinlock_lock(&timeout->lock, false);
169 if (timeout->ticks-- != 0) {
170 irq_spinlock_unlock(&timeout->lock, false);
[c93e805]171 break;
172 }
[da1bafb]173
174 list_remove(cur);
175 timeout_handler_t handler = timeout->handler;
176 void *arg = timeout->arg;
177 timeout_reinitialize(timeout);
178
179 irq_spinlock_unlock(&timeout->lock, false);
180 irq_spinlock_unlock(&CPU->timeoutlock, false);
181
182 handler(arg);
183
184 irq_spinlock_lock(&CPU->timeoutlock, false);
[c93e805]185 }
[da1bafb]186
187 irq_spinlock_unlock(&CPU->timeoutlock, false);
[f761f1eb]188 }
[c93e805]189 CPU->missed_clock_ticks = 0;
[da1bafb]190
[f761f1eb]191 /*
[43114c5]192 * Do CPU usage accounting and find out whether to preempt THREAD.
[da1bafb]193 *
[f761f1eb]194 */
[da1bafb]195
[43114c5]196 if (THREAD) {
[7f1c620]197 uint64_t ticks;
[dbe9ff0]198
[da1bafb]199 irq_spinlock_lock(&CPU->lock, false);
[8cf8ee6]200 CPU->needs_relink += 1 + missed_clock_ticks;
[da1bafb]201 irq_spinlock_unlock(&CPU->lock, false);
202
203 irq_spinlock_lock(&THREAD->lock, false);
[8cf8ee6]204 if ((ticks = THREAD->ticks)) {
205 if (ticks >= 1 + missed_clock_ticks)
206 THREAD->ticks -= 1 + missed_clock_ticks;
207 else
208 THREAD->ticks = 0;
209 }
[da1bafb]210 irq_spinlock_unlock(&THREAD->lock, false);
[dbe9ff0]211
[2e4e706]212 if ((!ticks) && (!PREEMPTION_DISABLED)) {
[f761f1eb]213 scheduler();
[3ff2b54]214#ifdef CONFIG_UDEBUG
215 /*
216 * Give udebug chance to stop the thread
[5d9430d7]217 * before it begins executing userspace code.
[3ff2b54]218 */
[da1bafb]219 istate_t *istate = THREAD->udebug.uspace_state;
220 if ((istate) && (istate_from_uspace(istate)))
[3ff2b54]221 udebug_before_thread_runs();
222#endif
[f761f1eb]223 }
224 }
225}
[b45c443]226
[1bb2e7a]227/** @}
[b45c443]228 */
Note: See TracBrowser for help on using the repository browser.