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
|
/* tab:2
*
* Copyright (c) 2000-2007 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 holders 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.
*
*/
/**
* Implementation of the <code>PacketParrot</code> application.
*
* @author Prabal Dutta
* @date Apr 6, 2007
* @author Janos Sallai
* @date Jan 25, 2012
*/
module PacketParrotP {
uses {
interface Boot;
interface Leds;
interface Packet;
interface AMPacket;
interface AMSend[uint8_t id];
interface Receive[uint8_t id];
interface Receive as Snoop[uint8_t id];
interface SplitControl as AMControl;
interface LogRead;
interface LogWrite;
interface Timer<TMilli> as Timer0;
}
}
implementation {
enum {
INTER_PACKET_INTERVAL = 25
};
typedef nx_struct logentry_t {
nx_uint8_t len;
message_t msg;
} logentry_t;
bool m_busy = TRUE;
logentry_t m_entry;
event void Boot.booted() {
call AMControl.start();
}
event void AMControl.startDone(error_t err) {
if (err == SUCCESS) {
if (call LogRead.read(&m_entry, sizeof(logentry_t)) != SUCCESS) {
// Handle error.
}
}
else {
call AMControl.start();
}
}
event void AMControl.stopDone(error_t err) {
}
event void LogRead.readDone(void* buf, storage_len_t len, error_t err) {
if ( (len == sizeof(logentry_t)) && (buf == &m_entry) ) {
call AMSend.send[call AMPacket.type(&m_entry.msg)](call AMPacket.destination(&m_entry.msg), &m_entry.msg, m_entry.len);
call Leds.led1On();
}
else {
if (call LogWrite.erase() != SUCCESS) {
// Handle error.
}
call Leds.led0On();
}
}
event void AMSend.sendDone[uint8_t id](message_t* msg, error_t err) {
call Leds.led1Off();
if ( (err == SUCCESS) && (msg == &m_entry.msg) ) {
call Packet.clear(&m_entry.msg);
if (call LogRead.read(&m_entry, sizeof(logentry_t)) != SUCCESS) {
// Handle error.
}
}
else {
call Timer0.startOneShot(INTER_PACKET_INTERVAL);
}
}
event void Timer0.fired() {
call AMSend.send[call AMPacket.type(&m_entry.msg)](call AMPacket.destination(&m_entry.msg), &m_entry.msg, m_entry.len);
}
event void LogWrite.eraseDone(error_t err) {
if (err == SUCCESS) {
m_busy = FALSE;
}
else {
// Handle error.
}
call Leds.led0Off();
}
event message_t* Receive.receive[uint8_t id](message_t* msg, void* payload, uint8_t len) {
call Leds.led2On();
if (!m_busy) {
m_busy = TRUE;
m_entry.len = len;
m_entry.msg = *msg;
if (call LogWrite.append(&m_entry, sizeof(logentry_t)) != SUCCESS) {
m_busy = FALSE;
}
}
return msg;
}
event message_t* Snoop.receive[uint8_t id](message_t* msg, void* payload, uint8_t len) {
return signal Receive.receive[id](msg, payload, len);
}
event void LogWrite.appendDone(void* buf, storage_len_t len,
bool recordsLost, error_t err) {
m_busy = FALSE;
call Leds.led2Off();
}
event void LogRead.seekDone(error_t err) {
}
event void LogWrite.syncDone(error_t err) {
}
}
|
