Repository navigation
Expand file tree
/
Copy pathQueue.c
More file actions
289 lines (253 loc) · 8.03 KB
/
Copy pathQueue.c
File metadata and controls
289 lines (253 loc) · 8.03 KB
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
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include "booltype.h"
#include "Queue.h"
#if defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)
#define __STDC_FORMAT_MACROS
#include <inttypes.h>
#ifdef _WIN32
#ifdef _WIN64
#define PRI_SIZET PRIu64
#else
#define PRI_SIZET PRIu32
#endif
#else
#define PRI_SIZET "zu"
#endif
#else
#define PRI_SIZET "%lu"
#endif /* __STDC_VERSION__ >= C99 */
#ifdef QUEUE_INCLUDE_THREADSAFETY
#include <pthread.h>
#endif /* QUEUE_INCLUDE_THREADSAFETY */
#ifdef QUEUE_INCLUDE_THREADSAFETY
#define QUEUE_MUTEX_INIT(queue) if(queue->uiQueueOptions&QUEUE_OPTION_SYNCHRONIZED) pthread_mutex_init(&queue->tagQueueMutex,NULL)
#define QUEUE_MUTEX_DESTROY(queue) if(queue->uiQueueOptions&QUEUE_OPTION_SYNCHRONIZED) pthread_mutex_destroy(&queue->tagQueueMutex)
#define QUEUE_MUTEX_LOCK(queue) if(queue->uiQueueOptions&QUEUE_OPTION_SYNCHRONIZED) pthread_mutex_lock(&queue->tagQueueMutex)
#define QUEUE_MUTEX_UNLOCK(queue) if(queue->uiQueueOptions&QUEUE_OPTION_SYNCHRONIZED) pthread_mutex_unlock(&queue->tagQueueMutex)
#else /* !QUEUE_INCLUDE_THREADSAFETY */
#define QUEUE_MUTEX_INIT(queue)
#define QUEUE_MUTEX_DESTROY(queue)
#define QUEUE_MUTEX_LOCK(queue)
#define QUEUE_MUTEX_UNLOCK(queue)
#endif /* QUEUE_INCLUDE_THREADSAFETY */
#define QUEUE_FORCE_INLINE
#if defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)
#ifdef QUEUE_FORCE_INLINE
#define INLINE_FCT_LOCAL __attribute__((always_inline)) inline
#define INLINE_PROT_LOCAL __attribute__((always_inline)) static inline
#define INLINE_FCT_SHARED inline __attribute__((always_inline))
#define INLINE_PROT_SHARED extern
#else /* !QUEUE_FORCE_INLINE */
#define INLINE_FCT_LOCAL inline
#define INLINE_PROT_LOCAL static inline
#define INLINE_FCT_SHARED inline
#define INLINE_PROT_SHARED extern
#endif /* QUEUE_FORCE_INLINE */
#else /* No inline available from C Standard */
#define INLINE_FCT_LOCAL
#define INLINE_PROT_LOCAL
#define INLINE_FCT_SHARED inline
#define INLINE_PROT_SHARED extern
#endif /* __STDC_VERSION__ >= C99 */
struct TagQueueElement_t
{
struct TagQueueElement_t *ptagNext;
void *pvData;
size_t sDataSize;
};
typedef struct TagQueueElement_t TagQueueElement;
struct TagQueue_t
{
int iItemCount;
unsigned int uiQueueOptions;
struct TagQueueElement_t *ptagFirstElement;
struct TagQueueElement_t *ptagLastElement;
#ifdef QUEUE_INCLUDE_THREADSAFETY
pthread_mutex_t tagQueueMutex;
#endif /* QUEUE_INCLUDE_THREADSAFETY */
};
INLINE_PROT_LOCAL void vQueue_ElementsDelete_m(TagQueue *ptagQueue);
TagQueue *ptagQueue_New_g(unsigned int uiOptions) // TODO: Implement more otions
{
TagQueue *ptagNewQueue;
#ifndef QUEUE_INCLUDE_THREADSAFETY
/* If Threadsafe stuff is not included, option synchronized is not allowed */
if(uiOptions & QUEUE_OPTION_SYNCHRONIZED)
return(NULL);
#endif /* !QUEUE_INCLUDE_THREADSAFETY */
if(!(ptagNewQueue=malloc(sizeof(TagQueue))))
return(NULL);
ptagNewQueue->iItemCount=0;
ptagNewQueue->ptagFirstElement=NULL;
ptagNewQueue->ptagLastElement=NULL;
ptagNewQueue->uiQueueOptions=uiOptions;
QUEUE_MUTEX_INIT(ptagNewQueue);
return(ptagNewQueue);
}
void *pvQueue_AllocateElement_g(size_t sSize)
{
return(malloc(sSize+sizeof(TagQueueElement)));
}
bool bQueue_Push_g(TagQueue *ptagQueue,
void *pvData,
size_t sDataSize,
EQueue_DataInfo eDataInfo)
{
void *pvDataToAdd=pvData;
TagQueueElement *ptagNewElement;
if(eDataInfo==eQueue_DataUseCopy)
{
if(!(pvDataToAdd=malloc(sDataSize+sizeof(TagQueueElement))))
return(false);
memcpy(pvDataToAdd,pvData,sDataSize);
}
ptagNewElement=(TagQueueElement*)(((char*)pvDataToAdd)+sDataSize);
ptagNewElement->sDataSize=sDataSize;
ptagNewElement->pvData=pvDataToAdd;
ptagNewElement->ptagNext=NULL;
printf("***QUEUE 0x%p: Adding Msg data 0x%p,to datap ->0x%p, size: %" PRI_SIZET "\n",ptagQueue,pvData,pvDataToAdd,sDataSize); // TODO: remove this
QUEUE_MUTEX_LOCK(ptagQueue);
/* Check if first element */
if(!ptagQueue->ptagFirstElement)
{
ptagQueue->ptagFirstElement=ptagNewElement;
ptagQueue->ptagLastElement=ptagNewElement;
}
else
{
ptagQueue->ptagLastElement->ptagNext=ptagNewElement;
ptagQueue->ptagLastElement=ptagNewElement;
}
++ptagQueue->iItemCount;
QUEUE_MUTEX_UNLOCK(ptagQueue);
return(true);
}
int iQueue_GetElementsCount_g(TagQueue *ptagQueue)
{
return(ptagQueue->iItemCount);
}
size_t sQueue_GetNextElementSize_g(TagQueue *ptagQueue)
{
if(!ptagQueue->ptagFirstElement)
return(0);
return(ptagQueue->ptagFirstElement->sDataSize);
}
bool bQueue_DeleteNextElement_g(TagQueue *ptagQueue,
int *piItemsRemaining)
{
TagQueueElement *ptagNewFirstElement;
QUEUE_MUTEX_LOCK(ptagQueue);
if(!ptagQueue->ptagFirstElement)
{
QUEUE_MUTEX_UNLOCK(ptagQueue);
return(false);
}
ptagNewFirstElement=ptagQueue->ptagFirstElement->ptagNext;
free(ptagQueue->ptagFirstElement->pvData);
ptagQueue->ptagFirstElement=ptagNewFirstElement;
--ptagQueue->iItemCount;
if(piItemsRemaining)
*piItemsRemaining=ptagQueue->iItemCount;
QUEUE_MUTEX_UNLOCK(ptagQueue);
return(true);
}
bool bQueue_Pop_g(TagQueue *ptagQueue,
void **ppvData,
size_t *psDataSize,
int *piItemsRemaining)
{
TagQueueElement *ptagNewFirstElement;
/* Check if Queue is empty */
QUEUE_MUTEX_LOCK(ptagQueue);
if(!ptagQueue->ptagFirstElement)
{
QUEUE_MUTEX_UNLOCK(ptagQueue);
return(false);
}
printf("QUEUE 0x%p: ***getting data 0x%p, size: %" PRI_SIZET "\n",ptagQueue,ptagQueue->ptagFirstElement->pvData,ptagQueue->ptagFirstElement->sDataSize); // TODO: remove this
ptagNewFirstElement=ptagQueue->ptagFirstElement->ptagNext;
*ppvData=ptagQueue->ptagFirstElement->pvData;
*psDataSize=ptagQueue->ptagFirstElement->sDataSize;
ptagQueue->ptagFirstElement=ptagNewFirstElement;
--ptagQueue->iItemCount;
if(piItemsRemaining)
*piItemsRemaining=ptagQueue->iItemCount;
QUEUE_MUTEX_UNLOCK(ptagQueue);
return(true);
}
bool bQueue_Peek_g(TagQueue *ptagQueue,
void **ppvData,
size_t *psDataSize)
{
QUEUE_MUTEX_LOCK(ptagQueue);
if(!ptagQueue->ptagFirstElement)
{
QUEUE_MUTEX_UNLOCK(ptagQueue);
return(false);
}
*ppvData=ptagQueue->ptagFirstElement->pvData;
*psDataSize=ptagQueue->ptagFirstElement->sDataSize;
QUEUE_MUTEX_UNLOCK(ptagQueue);
return(true);
}
INLINE_FCT_LOCAL void vQueue_ElementsDelete_m(TagQueue *ptagQueue)
{
TagQueueElement *ptagCurrElement;
TagQueueElement *ptagNextElement;
ptagCurrElement=ptagQueue->ptagFirstElement;
while(ptagCurrElement!=NULL)
{
ptagNextElement=ptagCurrElement->ptagNext;
free(ptagCurrElement->pvData);
ptagCurrElement=ptagNextElement;
}
}
void vQueue_Clear_g(TagQueue *ptagQueue)
{
QUEUE_MUTEX_LOCK(ptagQueue);
vQueue_ElementsDelete_m(ptagQueue);
ptagQueue->iItemCount=0;
ptagQueue->ptagFirstElement=NULL;
ptagQueue->ptagLastElement=NULL;
QUEUE_MUTEX_UNLOCK(ptagQueue);
}
void vQueue_Delete_g(TagQueue *ptagQueue)
{
QUEUE_MUTEX_LOCK(ptagQueue);
vQueue_ElementsDelete_m(ptagQueue);
QUEUE_MUTEX_UNLOCK(ptagQueue);
QUEUE_MUTEX_DESTROY(ptagQueue);
free(ptagQueue);
}
void vQueue_DumpElements_g(TagQueue *ptagQueue)
{
TagQueueElement *ptagElement;
char caBuffer[256];
QUEUE_MUTEX_LOCK(ptagQueue);
sprintf(caBuffer,
"****DUMPING_QUEUE****\n"
"Queue 0x%p with %d elements, first element: 0x%p\n",
ptagQueue,
ptagQueue->iItemCount,
ptagQueue->ptagFirstElement);
puts(caBuffer);
for(ptagElement=ptagQueue->ptagFirstElement;
ptagElement!=NULL;
ptagElement=ptagElement->ptagNext)
{
sprintf(caBuffer,
"***********\n"
"0x%p->0x%p\n"
"***********\n"
"0x%p\n"
"*****v*****\n",
ptagElement,
ptagElement->pvData,
ptagElement->ptagNext);
puts(caBuffer);
}
QUEUE_MUTEX_UNLOCK(ptagQueue);
}