-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathList.c
242 lines (223 loc) · 6.86 KB
/
List.c
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
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
/*------------------------------------------------------------------------------
-- SOURCE FILE: List.c Contains implementations of linked lists.
--
-- PROGRAM: Dean and the Rockets' Wireless Protocol Testing and Evaluation
-- Facilitator
--
-- FUNCTIONS:
-- BOOL AddToByteQueue(PPBYTE_NODE, PPBYTE_NODE, BYTE);
-- BOOL AddToFrameQueue(PPFRAME_NODE, PPFRAME_NODE, FRAME);
-- VOID DeleteByteQueue(PBYTE_NODE);
-- PBYTE RemoveFromByteQueue(PPBYTE_NODE, DWORD);
-- PFRAME RemoveFromFrameQueue(PPFRAME_NODE, DWORD);
--
--
-- DATE: Nov 24, 2010
--
-- REVISIONS:
--
-- DESIGNER: Dean Morin
--
-- PROGRAMMER: Dean Morin
--
-- NOTES: Implements linked lists for bytes and data frames.
------------------------------------------------------------------------------*/
#include "List.h"
/*------------------------------------------------------------------------------
-- FUNCTION: AddToByteQueue
--
-- DATE: Nov 24, 2010
--
-- REVISIONS:
--
-- DESIGNER: Dean Morin
--
-- PROGRAMMER: Dean Morin
--
-- INTERFACE: AddToByteQueue(PPBYTE_NODE pHead, PPBYTE_NODE pTail,
-- BYTE data)
-- pHead - the first node in the queue
-- pTail - the last node in the list
-- data - the BYTE to be added to the list
--
-- RETURNS: FALSE if memory allocation for the new node failed.
--
-- NOTES: Adds the new BYTE to the back of the list.
------------------------------------------------------------------------------*/
BOOL AddToByteQueue(PPBYTE_NODE pHead, PPBYTE_NODE pTail, BYTE data) {
PBYTE_NODE newNode = NULL;
if ((newNode = (PBYTE_NODE) malloc(sizeof(BYTE_NODE))) == NULL) {
return FALSE;
}
newNode->b = data;
newNode->next = NULL;
if (*pHead == NULL) {
*pHead = newNode;
*pTail = newNode;
return TRUE;
}
(*pTail)->next = newNode;
*pTail = newNode;
return TRUE;
}
/*------------------------------------------------------------------------------
-- FUNCTION: RemoveFromByteQueue
--
-- DATE: Nov 24, 2010
--
-- REVISIONS:
--
-- DESIGNER: Dean Morin
--
-- PROGRAMMER: Dean Morin
--
-- INTERFACE: RemoveFromByteQueue(PPBYTE_NODE pHead, DWORD dwLength)
-- pHead - the first node in the queue
-- dwLength - the number of nodes to remove
--
-- RETURNS: A pointer to the first node that was removed.
--
-- NOTES: Removes dwLength nodes from the queue. The function requires
-- that dwLength be no longer than the list.
------------------------------------------------------------------------------*/
PBYTE RemoveFromByteQueue(PPBYTE_NODE pHead, DWORD dwLength) {
PBYTE_NODE p = NULL;
PBYTE_NODE tracer = NULL;
UINT i = 0;
PBYTE removed = NULL;
p = *pHead;
removed = (PBYTE) malloc(sizeof(BYTE) * dwLength);
for (i = 0; i < dwLength; i++) {
removed[i] = p->b;
tracer = p;
p = p->next;
free(tracer);
}
*pHead = p;
return removed;
}
/*------------------------------------------------------------------------------
-- FUNCTION: DeleteByteQueue
--
-- DATE: Nov 24, 2010
--
-- REVISIONS:
--
-- DESIGNER: Dean Morin
--
-- PROGRAMMER: Dean Morin
--
-- INTERFACE: DeleteByteQueue(PBYTE_NODE pHead)
-- pHead - the first node in the queue
--
-- RETURNS: VOID.
--
-- NOTES: Deletes the queue.
------------------------------------------------------------------------------*/
VOID DeleteByteQueue(PBYTE_NODE pHead) {
PBYTE_NODE p = NULL;
PBYTE_NODE q = NULL;
for (p = pHead; p != NULL; p = q) {
q = p->next;
free(p);
}
}
/*------------------------------------------------------------------------------
-- FUNCTION: AddToFrameQueue
--
-- DATE: Nov 24, 2010
--
-- REVISIONS:
--
-- DESIGNER: Dean Morin
--
-- PROGRAMMER: Dean Morin
--
-- INTERFACE: AddToFrameQueue(PPFRAME_NODE pHead, PPFRAME_NODE pTail,
-- FRAME data)
-- pHead - the first node in the queue
-- pTail - the last node in the list
-- data - the FRAME to be added to the list
--
-- RETURNS: FALSE if memory allocation for the new node failed.
--
-- NOTES: Adds the new FRAME to the back of the list.
------------------------------------------------------------------------------*/
BOOL AddToFrameQueue(PPFRAME_NODE pHead, PPFRAME_NODE pTail, FRAME data) {
PFRAME_NODE newNode = NULL;
if ((newNode = (PFRAME_NODE) malloc(sizeof(FRAME_NODE))) == NULL) {
return FALSE;
}
newNode->f = data;
newNode->next = NULL;
if (*pHead == NULL) {
*pHead = newNode;
*pTail = newNode;
return TRUE;
}
(*pTail)->next = newNode;
*pTail = newNode;
return TRUE;
}
/*------------------------------------------------------------------------------
-- FUNCTION: RemoveFromFrameQueue
--
-- DATE: Nov 24, 2010
--
-- REVISIONS:
--
-- DESIGNER: Dean Morin
--
-- PROGRAMMER: Dean Morin
--
-- INTERFACE: RemoveFromFrameQueue(PPBYTE_NODE pHead, DWORD dwLength)
-- pHead - the first node in the queue
-- dwLength - the number of nodes to remove
--
-- RETURNS: A pointer to the first node that was removed.
--
-- NOTES: Removes dwLength nodes from the queue. The function requires
-- that dwLength be no longer than the list.
------------------------------------------------------------------------------*/
PFRAME RemoveFromFrameQueue(PPFRAME_NODE pHead, DWORD dwLength) {
PFRAME_NODE p = NULL;
PFRAME_NODE tracer = NULL;
UINT i = 0;
PFRAME removed = NULL;
p = *pHead;
removed = (PFRAME) malloc(sizeof(FRAME) * dwLength);
for (i = 0; i < dwLength; i++) {
removed[i] = p->f;
tracer = p;
p = p->next;
free(tracer);
}
*pHead = p;
return removed;
}
/*------------------------------------------------------------------------------
-- FUNCTION: DeleteFrameQueue
--
-- DATE: Nov 24, 2010
--
-- REVISIONS:
--
-- DESIGNER: Dean Morin
--
-- PROGRAMMER: Daniel Wright
--
-- INTERFACE: DeleteFrameQueue(PFRAME_NODE pHead)
-- pHead - the first node in the queue
--
-- RETURNS: VOID.
--
-- NOTES: Deletes the queue.
------------------------------------------------------------------------------*/
VOID DeleteFrameQueue(PFRAME_NODE pHead) {
PFRAME_NODE p = NULL;
PFRAME_NODE q = NULL;
for (p = pHead; p != NULL; p = q) {
q = p->next;
free(p);
}
}