1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
|
//$Id: VirtualizeTimerC.nc,v 1.13 2010-06-29 22:07:50 scipio Exp $
/* Copyright (c) 2000-2003 The Regents of the University of California.
* 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.
* - Neither the name of the copyright holder nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "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 COPYRIGHT HOLDER OR CONTRIBUTORS 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.
*/
/**
* VirtualizeTimerC uses a single Timer to create up to 255 virtual timers.
*
* <p>See TEP102 for more details.
*
* @param precision_tag A type indicating the precision of the Timer being
* virtualized.
* @param max_timers Number of virtual timers to create.
*
* @author Cory Sharp <cssharp@eecs.berkeley.edu>
*/
generic module VirtualizeTimerC(typedef precision_tag, int max_timers) @safe()
{
provides interface Timer<precision_tag> as Timer[uint8_t num];
uses interface Timer<precision_tag> as TimerFrom;
}
implementation
{
enum
{
NUM_TIMERS = max_timers,
END_OF_LIST = 255,
};
typedef struct
{
uint32_t t0;
uint32_t dt;
bool isoneshot : 1;
bool isrunning : 1;
bool _reserved : 6;
} Timer_t;
Timer_t m_timers[NUM_TIMERS];
bool m_timers_changed;
task void updateFromTimer();
void fireTimers(uint32_t now)
{
uint16_t num;
for (num=0; num<NUM_TIMERS; num++)
{
Timer_t* timer = &m_timers[num];
if (timer->isrunning)
{
uint32_t elapsed = now - timer->t0;
if (elapsed >= timer->dt)
{
if (timer->isoneshot)
timer->isrunning = FALSE;
else // Update timer for next event
timer->t0 += timer->dt;
signal Timer.fired[num]();
break;
}
}
}
post updateFromTimer();
}
task void updateFromTimer()
{
/* This code supports a maximum dt of MAXINT. If min_remaining and
remaining were switched to uint32_t, and the logic changed a
little, dt's up to 2^32-1 should work (but at a slightly higher
runtime cost). */
uint32_t now = call TimerFrom.getNow();
int32_t min_remaining = (1UL << 31) - 1; /* max int32_t */
bool min_remaining_isset = FALSE;
uint16_t num;
call TimerFrom.stop();
for (num=0; num<NUM_TIMERS; num++)
{
Timer_t* timer = &m_timers[num];
if (timer->isrunning)
{
uint32_t elapsed = now - timer->t0;
int32_t remaining = timer->dt - elapsed;
if (remaining < min_remaining)
{
min_remaining = remaining;
min_remaining_isset = TRUE;
}
}
}
if (min_remaining_isset)
{
if (min_remaining <= 0)
fireTimers(now);
else
call TimerFrom.startOneShotAt(now, min_remaining);
}
}
event void TimerFrom.fired()
{
fireTimers(call TimerFrom.getNow());
}
void startTimer(uint8_t num, uint32_t t0, uint32_t dt, bool isoneshot)
{
Timer_t* timer = &m_timers[num];
timer->t0 = t0;
timer->dt = dt;
timer->isoneshot = isoneshot;
timer->isrunning = TRUE;
post updateFromTimer();
}
command void Timer.startPeriodic[uint8_t num](uint32_t dt)
{
startTimer(num, call TimerFrom.getNow(), dt, FALSE);
}
command void Timer.startOneShot[uint8_t num](uint32_t dt)
{
startTimer(num, call TimerFrom.getNow(), dt, TRUE);
}
command void Timer.stop[uint8_t num]()
{
m_timers[num].isrunning = FALSE;
}
command bool Timer.isRunning[uint8_t num]()
{
return m_timers[num].isrunning;
}
command bool Timer.isOneShot[uint8_t num]()
{
return m_timers[num].isoneshot;
}
command void Timer.startPeriodicAt[uint8_t num](uint32_t t0, uint32_t dt)
{
startTimer(num, t0, dt, FALSE);
}
command void Timer.startOneShotAt[uint8_t num](uint32_t t0, uint32_t dt)
{
startTimer(num, t0, dt, TRUE);
}
command uint32_t Timer.getNow[uint8_t num]()
{
return call TimerFrom.getNow();
}
command uint32_t Timer.gett0[uint8_t num]()
{
return m_timers[num].t0;
}
command uint32_t Timer.getdt[uint8_t num]()
{
return m_timers[num].dt;
}
default event void Timer.fired[uint8_t num]()
{
}
}
|
