-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPacketQueueC.nc
158 lines (137 loc) · 2.49 KB
/
PacketQueueC.nc
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
#ifdef PRINTFDBG_MODE
#include "printf.h"
#endif
generic module PacketQueueC( uint8_t queueSize)
{
provides interface PacketQueue;
}
implementation
{
message_t Q[queueSize];
uint8_t headIndex=0;
uint8_t tailIndex=0;
uint8_t size=0;
//bool isEmpty=TRUE;
//bool isFull=FALSE;
command bool PacketQueue.empty()
{
bool em;
atomic{
em = (size==0);}
return em;
}
command bool PacketQueue.full()
{
bool em;
atomic{
if (size==queueSize)
{
em=TRUE;
}
else
{
em=FALSE;
}
}
return em ;
}
command uint8_t PacketQueue.size()
{
uint8_t ms;
atomic{
ms= size;
}
return ms;
}
command uint8_t PacketQueue.maxSize()
{
uint8_t ms;
atomic{
ms= queueSize;
}
return ms;
}
/**
* @deprecated
*/
command message_t PacketQueue.head()
{
return Q[headIndex];
}
command error_t PacketQueue.enqueue(message_t newPkt)
{
bool wasEmpty=FALSE, isFull=FALSE;
atomic{
wasEmpty= (size==0);//call PacketQueue.empty();
isFull=(size==queueSize);
}
if (isFull)
{
dbg("PacketQueueC","enqueue(): Queue is FULL!!!\n");
#ifdef PRINTFDBG_MODE
printf("PacketQueueC:enqueue(): Queue is FULL!!!\n");
printfflush();
#endif
return FAIL;
}
atomic{
if(!wasEmpty)
{
tailIndex = (tailIndex+1)%queueSize;
}
memcpy(&Q[tailIndex],&newPkt,sizeof(message_t));//???
//Q[tailIndex]=*(message_t*)newPkt;
size++;
}
dbg("PacketQueueC","enqueue(): Enqueued in pos= %u \n",tailIndex);
#ifdef PRINTFDBG_MODE
printf("PacketQueueC : enqueue() : pos=%u \n", tailIndex);
printfflush();
#endif
return SUCCESS;
}
command message_t PacketQueue.dequeue()
{
uint8_t tmp;
bool isEmpty=FALSE;
message_t m;
atomic{
isEmpty=(size==0);
}
if (isEmpty)
{
dbg("PacketQueueC","dequeue(): Q is emtpy!!!!\n");
#ifdef PRINTFDBG_MODE
printf("PacketQueueC : dequeue() : Q is empty!!! \n");
printfflush();
#endif
atomic{
m=Q[headIndex];
}
return m; // must return something to indicate error... (event???)
}
atomic{
tmp=headIndex;
if(tailIndex!=headIndex)
{
headIndex=(headIndex+1)%queueSize;//???
}
size--;
m=Q[tmp];
}
dbg("PacketQueueC","dequeue(): Dequeued from pos = %u \n",tmp);//(queueSize+headIndex-1)%queueSize);
#ifdef PRINTFDBG_MODE
printf("PacketQueueC : dequeue(): pos = %u \n", tmp);
printfflush();
#endif
return m;
}
command message_t PacketQueue.element(uint8_t mindex)
{
message_t m;
atomic{
m = Q[mindex];
}
return m;
}
}