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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
|
/*************************************************************************************
Copyright (c) 2016-2017, Harman International Industries, Incorporated
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. 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.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS LISTED "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 OWNER OR CONTRIBUTORS LISTED 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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include <assert.h>
#include "maap_net.h"
#define MAAP_LOG_COMPONENT "Net"
#include "maap_log.h"
/* Number of preallocated buffers to use. */
#define NUM_BUFFERS 4
/* Uncomment the DEBUG_NET_MSG define to display debug messages. */
#define DEBUG_NET_MSG
typedef enum {
BUFFER_FREE = 0,
BUFFER_SUPPLIED,
BUFFER_QUEUED,
BUFFER_SENDING,
} Buffer_State;
struct maap_buffer {
char buffer[MAAP_NET_BUFFER_SIZE];
Buffer_State state;
struct maap_buffer *pNext; /* Pointer to next item when used in a linked list */
};
struct maap_net {
struct maap_buffer net_buffer[NUM_BUFFERS];
struct maap_buffer *pFirst; /* Linked list of additional buffers, in case more than NUM_BUFFERS supplied. */
};
Net *Net_newNet(void)
{
Net *pNew;
pNew = malloc(sizeof(Net));
if (!pNew) { return NULL; }
memset(pNew, 0, sizeof(Net));
return pNew;
}
void Net_delNet(Net *net)
{
struct maap_buffer *pDel;
assert(net);
while (net->pFirst) {
pDel = net->pFirst;
net->pFirst = pDel->pNext;
free(pDel);
}
free(net);
}
void *Net_getPacketBuffer(Net *net)
{
struct maap_buffer *pNew, *pLast;
int buffer_index;
assert(net);
/* See if one of the preallocated buffers is available. */
for (buffer_index = 0; buffer_index < NUM_BUFFERS; ++buffer_index)
{
if (net->net_buffer[buffer_index].state == BUFFER_FREE)
{
net->net_buffer[buffer_index].state = BUFFER_SUPPLIED;
#ifdef DEBUG_NET_MSG
MAAP_LOGF_DEBUG("Allocated buffer %d", buffer_index);
#endif
return (void *)(net->net_buffer[buffer_index].buffer);
}
}
/* We need to create an overflow buffer. */
pNew = malloc(sizeof(struct maap_buffer));
if (pNew) {
memset(pNew, 0, sizeof(struct maap_buffer));
if (net->pFirst == NULL) {
net->pFirst = pNew;
} else {
pLast = net->pFirst;
while (pLast->pNext) { pLast = pLast->pNext; }
pLast->pNext = pNew;
}
pNew->state = BUFFER_SUPPLIED;
#ifdef DEBUG_NET_MSG
MAAP_LOGF_DEBUG("Allocated buffer 0x%llx", (long long int)(uintptr_t) pNew);
#endif
return (void *)(pNew->buffer);
}
assert(0);
return NULL;
}
int Net_queuePacket(Net *net, void *buffer)
{
struct maap_buffer *pTest;
int buffer_index;
assert(net);
/* See if the supplied buffer is one of the preallocated buffers. */
for (buffer_index = 0; buffer_index < NUM_BUFFERS; ++buffer_index)
{
if (net->net_buffer[buffer_index].buffer == buffer)
{
/* We found the buffer provided. */
assert(net->net_buffer[buffer_index].state == BUFFER_SUPPLIED);
net->net_buffer[buffer_index].state = BUFFER_QUEUED;
#ifdef DEBUG_NET_MSG
MAAP_LOGF_DEBUG("Queuing buffer %d", buffer_index);
#endif
return 0;
}
}
/* See if the supplied buffer is one of the allocated buffers. */
for (pTest = net->pFirst; pTest != NULL; pTest = pTest->pNext)
{
if (pTest->buffer == buffer)
{
/* We found the the buffer provided. */
assert(pTest->state == BUFFER_SUPPLIED);
pTest->state = BUFFER_QUEUED;
#ifdef DEBUG_NET_MSG
MAAP_LOGF_DEBUG("Queuing buffer 0x%llx", (long long int)(uintptr_t) pTest);
#endif
return 0;
}
}
assert(0);
return -1;
}
void *Net_getNextQueuedPacket(Net *net)
{
struct maap_buffer *pTest;
int buffer_index;
assert(net);
/* See if one of the preallocated buffers is available. */
for (buffer_index = 0; buffer_index < NUM_BUFFERS; ++buffer_index)
{
if (net->net_buffer[buffer_index].state == BUFFER_QUEUED)
{
net->net_buffer[buffer_index].state = BUFFER_SENDING;
#ifdef DEBUG_NET_MSG
MAAP_LOGF_DEBUG("Buffer %d pulled from queue", buffer_index);
MAAP_LOG_DEBUG(""); /* Blank line */
#endif
return (void *)(net->net_buffer[buffer_index].buffer);
}
}
/* See if one of the allocated buffers is available. */
for (pTest = net->pFirst; pTest != NULL; pTest = pTest->pNext)
{
if (pTest->state == BUFFER_QUEUED)
{
pTest->state = BUFFER_SENDING;
#ifdef DEBUG_NET_MSG
MAAP_LOGF_DEBUG("Buffer 0x%llx pulled from queue", (long long int)(uintptr_t) pTest);
MAAP_LOG_DEBUG(""); /* Blank line */
#endif
return (void *)(pTest->buffer);
}
}
/* No packets are currently in the queue. */
return NULL;
}
int Net_freeQueuedPacket(Net *net, void *buffer)
{
struct maap_buffer *pTest, *pPrevious;
int buffer_index;
assert(net);
/* See if the supplied buffer is one of the preallocated buffers. */
for (buffer_index = 0; buffer_index < NUM_BUFFERS; ++buffer_index)
{
if (net->net_buffer[buffer_index].buffer == buffer)
{
/* We found the buffer provided. */
assert(net->net_buffer[buffer_index].state == BUFFER_SENDING);
net->net_buffer[buffer_index].state = BUFFER_FREE;
#ifdef DEBUG_NET_MSG
MAAP_LOGF_DEBUG("Freed buffer %d", buffer_index);
#endif
return 0;
}
}
/* See if the supplied buffer is one of the allocated buffers. */
for (pPrevious = NULL, pTest = net->pFirst; pTest != NULL; pPrevious = pTest, pTest = pTest->pNext)
{
if (pTest->buffer == buffer)
{
/* We found the the buffer provided. */
assert(pTest->state == BUFFER_SENDING);
pTest->state = BUFFER_FREE;
#ifdef DEBUG_NET_MSG
MAAP_LOGF_DEBUG("Freed buffer 0x%llx", (long long int)(uintptr_t) pTest);
#endif
/* Free the buffer. */
if (pPrevious) {
/* Remove this item from the middle (or end) of the queue. */
pPrevious->pNext = pTest->pNext;
} else {
/* Remove this item from the start of the queue. */
net->pFirst = pTest->pNext;
}
free(pTest);
return 0;
}
}
assert(0);
return -1;
}
|
