WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/src/time/timeout.c


/*
 * Copyright (C) 2001-2004 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <time/timeout.h>
#include <typedefs.h>
#include <arch/types.h>
#include <config.h>
#include <panic.h>
#include <synch/spinlock.h>
#include <func.h>
#include <cpu.h>
#include <print.h>
#include <arch/asm.h>
#include <arch.h>
 
void timeout_init(void)
{
    spinlock_initialize(&CPU->timeoutlock);
    list_initialize(&CPU->timeout_active_head);
}
 
 
void timeout_reinitialize(timeout_t *t)
{
    t->cpu = NULL;
    t->ticks = 0;
    t->handler = NULL;
    t->arg = NULL;
    link_initialize(&t->link);
}
 
void timeout_initialize(timeout_t *t)
{
    spinlock_initialize(&t->lock);
    timeout_reinitialize(t);
}
 
/*
 * This function registers f for execution in about time microseconds.
 */
void timeout_register(timeout_t *t, __u64 time, timeout_handler f, void *arg)
{
    timeout_t *hlp;
    link_t *l, *m;
    pri_t pri;
    __u64 sum;
 
    pri = cpu_priority_high();
    spinlock_lock(&CPU->timeoutlock);
    spinlock_lock(&t->lock);
   
    if (t->cpu)
        panic("timeout_register: t->cpu != 0");
 
    t->cpu = CPU;
    t->ticks = us2ticks(time);
   
    t->handler = f;
    t->arg = arg;
   
    /*
     * Insert t into the active timeouts list according to t->ticks.
     */
    sum = 0;
    l = CPU->timeout_active_head.next;
    while (l != &CPU->timeout_active_head) {
        hlp = list_get_instance(l, timeout_t, link);
        spinlock_lock(&hlp->lock);
        if (t->ticks < sum + hlp->ticks) {
            spinlock_unlock(&hlp->lock);
            break;
        }
        sum += hlp->ticks;
        spinlock_unlock(&hlp->lock);
        l = l->next;
    }
    m = l->prev;
    list_prepend(&t->link, m); /* avoid using l->prev */
 
    /*
     * Adjust t->ticks according to ticks accumulated in h's predecessors.
     */
    t->ticks -= sum;
 
    /*
     * Decrease ticks of t's immediate succesor by t->ticks.
     */
    if (l != &CPU->timeout_active_head) {
        spinlock_lock(&hlp->lock);
        hlp->ticks -= t->ticks;
        spinlock_unlock(&hlp->lock);
    }
 
    spinlock_unlock(&t->lock);
    spinlock_unlock(&CPU->timeoutlock);
    cpu_priority_restore(pri);
}
 
int timeout_unregister(timeout_t *t)
{
    timeout_t *hlp;
    link_t *l;
    pri_t pri;
 
grab_locks:
    pri = cpu_priority_high();
    spinlock_lock(&t->lock);
    if (!t->cpu) {
        spinlock_unlock(&t->lock);
        cpu_priority_restore(pri);
        return 0;
    }
    if (!spinlock_trylock(&t->cpu->timeoutlock)) {
        spinlock_unlock(&t->lock);
        cpu_priority_restore(pri);     
        goto grab_locks;
    }
   
    /*
     * Now we know for sure that t hasn't been activated yet
     * and is lurking in t->cpu->timeout_active_head queue.
     */
 
    l = t->link.next;
    if (l != &t->cpu->timeout_active_head) {
        hlp = list_get_instance(l, timeout_t, link);
        spinlock_lock(&hlp->lock);
        hlp->ticks += t->ticks;
        spinlock_unlock(&hlp->lock);
    }
   
    list_remove(&t->link);
    spinlock_unlock(&t->cpu->timeoutlock);
 
    timeout_reinitialize(t);
    spinlock_unlock(&t->lock);
 
    cpu_priority_restore(pri);
    return 1;
}
 

Rev 15	Rev 68
1	/*	1	/*
2	* Copyright (C) 2001-2004 Jakub Jermar	2	* Copyright (C) 2001-2004 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	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	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.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	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	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	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	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	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	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.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	#include <time/timeout.h>	29	#include <time/timeout.h>
30	#include <typedefs.h>	30	#include <typedefs.h>
31	#include <arch/types.h>	31	#include <arch/types.h>
32	#include <config.h>	32	#include <config.h>
-		33	#include <panic.h>
33	#include <synch/spinlock.h>	34	#include <synch/spinlock.h>
34	#include <func.h>	35	#include <func.h>
35	#include <cpu.h>	36	#include <cpu.h>
36	#include <print.h>	37	#include <print.h>
37	#include <arch/asm.h>	38	#include <arch/asm.h>
38	#include <arch.h>	39	#include <arch.h>
39		40
40	void timeout_init(void)	41	void timeout_init(void)
41	{	42	{
42	spinlock_initialize(&CPU->timeoutlock);	43	spinlock_initialize(&CPU->timeoutlock);
43	list_initialize(&CPU->timeout_active_head);	44	list_initialize(&CPU->timeout_active_head);
44	}	45	}
45		46
46		47
47	void timeout_reinitialize(timeout_t *t)	48	void timeout_reinitialize(timeout_t *t)
48	{	49	{
49	t->cpu = NULL;	50	t->cpu = NULL;
50	t->ticks = 0;	51	t->ticks = 0;
51	t->handler = NULL;	52	t->handler = NULL;
52	t->arg = NULL;	53	t->arg = NULL;
53	link_initialize(&t->link);	54	link_initialize(&t->link);
54	}	55	}
55		56
56	void timeout_initialize(timeout_t *t)	57	void timeout_initialize(timeout_t *t)
57	{	58	{
58	spinlock_initialize(&t->lock);	59	spinlock_initialize(&t->lock);
59	timeout_reinitialize(t);	60	timeout_reinitialize(t);
60	}	61	}
61		62
62	/*	63	/*
63	* This function registers f for execution in about time microseconds.	64	* This function registers f for execution in about time microseconds.
64	*/	65	*/
65	void timeout_register(timeout_t t, __u64 time, timeout_handler f, void arg)	66	void timeout_register(timeout_t t, __u64 time, timeout_handler f, void arg)
66	{	67	{
67	timeout_t *hlp;	68	timeout_t *hlp;
68	link_t l, m;	69	link_t l, m;
69	pri_t pri;	70	pri_t pri;
70	__u64 sum;	71	__u64 sum;
71		72
72	pri = cpu_priority_high();	73	pri = cpu_priority_high();
73	spinlock_lock(&CPU->timeoutlock);	74	spinlock_lock(&CPU->timeoutlock);
74	spinlock_lock(&t->lock);	75	spinlock_lock(&t->lock);
75		76
76	if (t->cpu)	77	if (t->cpu)
77	panic("timeout_register: t->cpu != 0");	78	panic("timeout_register: t->cpu != 0");
78		79
79	t->cpu = CPU;	80	t->cpu = CPU;
80	t->ticks = us2ticks(time);	81	t->ticks = us2ticks(time);
81		82
82	t->handler = f;	83	t->handler = f;
83	t->arg = arg;	84	t->arg = arg;
84		85
85	/*	86	/*
86	* Insert t into the active timeouts list according to t->ticks.	87	* Insert t into the active timeouts list according to t->ticks.
87	*/	88	*/
88	sum = 0;	89	sum = 0;
89	l = CPU->timeout_active_head.next;	90	l = CPU->timeout_active_head.next;
90	while (l != &CPU->timeout_active_head) {	91	while (l != &CPU->timeout_active_head) {
91	hlp = list_get_instance(l, timeout_t, link);	92	hlp = list_get_instance(l, timeout_t, link);
92	spinlock_lock(&hlp->lock);	93	spinlock_lock(&hlp->lock);
93	if (t->ticks < sum + hlp->ticks) {	94	if (t->ticks < sum + hlp->ticks) {
94	spinlock_unlock(&hlp->lock);	95	spinlock_unlock(&hlp->lock);
95	break;	96	break;
96	}	97	}
97	sum += hlp->ticks;	98	sum += hlp->ticks;
98	spinlock_unlock(&hlp->lock);	99	spinlock_unlock(&hlp->lock);
99	l = l->next;	100	l = l->next;
100	}	101	}
101	m = l->prev;	102	m = l->prev;
102	list_prepend(&t->link, m); /* avoid using l->prev */	103	list_prepend(&t->link, m); /* avoid using l->prev */
103		104
104	/*	105	/*
105	* Adjust t->ticks according to ticks accumulated in h's predecessors.	106	* Adjust t->ticks according to ticks accumulated in h's predecessors.
106	*/	107	*/
107	t->ticks -= sum;	108	t->ticks -= sum;
108		109
109	/*	110	/*
110	* Decrease ticks of t's immediate succesor by t->ticks.	111	* Decrease ticks of t's immediate succesor by t->ticks.
111	*/	112	*/
112	if (l != &CPU->timeout_active_head) {	113	if (l != &CPU->timeout_active_head) {
113	spinlock_lock(&hlp->lock);	114	spinlock_lock(&hlp->lock);
114	hlp->ticks -= t->ticks;	115	hlp->ticks -= t->ticks;
115	spinlock_unlock(&hlp->lock);	116	spinlock_unlock(&hlp->lock);
116	}	117	}
117		118
118	spinlock_unlock(&t->lock);	119	spinlock_unlock(&t->lock);
119	spinlock_unlock(&CPU->timeoutlock);	120	spinlock_unlock(&CPU->timeoutlock);
120	cpu_priority_restore(pri);	121	cpu_priority_restore(pri);
121	}	122	}
122		123
123	int timeout_unregister(timeout_t *t)	124	int timeout_unregister(timeout_t *t)
124	{	125	{
125	timeout_t *hlp;	126	timeout_t *hlp;
126	link_t *l;	127	link_t *l;
127	pri_t pri;	128	pri_t pri;
128		129
129	grab_locks:	130	grab_locks:
130	pri = cpu_priority_high();	131	pri = cpu_priority_high();
131	spinlock_lock(&t->lock);	132	spinlock_lock(&t->lock);
132	if (!t->cpu) {	133	if (!t->cpu) {
133	spinlock_unlock(&t->lock);	134	spinlock_unlock(&t->lock);
134	cpu_priority_restore(pri);	135	cpu_priority_restore(pri);
135	return 0;	136	return 0;
136	}	137	}
137	if (!spinlock_trylock(&t->cpu->timeoutlock)) {	138	if (!spinlock_trylock(&t->cpu->timeoutlock)) {
138	spinlock_unlock(&t->lock);	139	spinlock_unlock(&t->lock);
139	cpu_priority_restore(pri);	140	cpu_priority_restore(pri);
140	goto grab_locks;	141	goto grab_locks;
141	}	142	}
142		143
143	/*	144	/*
144	* Now we know for sure that t hasn't been activated yet	145	* Now we know for sure that t hasn't been activated yet
145	* and is lurking in t->cpu->timeout_active_head queue.	146	* and is lurking in t->cpu->timeout_active_head queue.
146	*/	147	*/
147		148
148	l = t->link.next;	149	l = t->link.next;
149	if (l != &t->cpu->timeout_active_head) {	150	if (l != &t->cpu->timeout_active_head) {
150	hlp = list_get_instance(l, timeout_t, link);	151	hlp = list_get_instance(l, timeout_t, link);
151	spinlock_lock(&hlp->lock);	152	spinlock_lock(&hlp->lock);
152	hlp->ticks += t->ticks;	153	hlp->ticks += t->ticks;
153	spinlock_unlock(&hlp->lock);	154	spinlock_unlock(&hlp->lock);
154	}	155	}
155		156
156	list_remove(&t->link);	157	list_remove(&t->link);
157	spinlock_unlock(&t->cpu->timeoutlock);	158	spinlock_unlock(&t->cpu->timeoutlock);
158		159
159	timeout_reinitialize(t);	160	timeout_reinitialize(t);
160	spinlock_unlock(&t->lock);	161	spinlock_unlock(&t->lock);
161		162
162	cpu_priority_restore(pri);	163	cpu_priority_restore(pri);
163	return 1;	164	return 1;
164	}	165	}
165		166

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/time/timeout.c @ 1757 – Rev 15 → 68