blob: b9b485542c22d6b2247f2c2d8f0aaa3afc926f8e (
plain)
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
|
/**
* @licence app begin@
* Copyright (C) 2012 BMW AG
*
* This file is part of GENIVI Project Dlt - Diagnostic Log and Trace console apps.
*
* Contributions are licensed to the GENIVI Alliance under one or more
* Contribution License Agreements.
*
* \copyright
* This Source Code Form is subject to the terms of the
* Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with
* this file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
*
* \author Lassi Marttala <lassi.lm.marttala@partner.bmw.de> BMW 2012
*
* \file dlt_queue.h
* For further information see http://www.genivi.org/.
* @licence end@
*/
/*******************************************************************************
** **
** SRC-MODULE: dlt_queue.h **
** **
** TARGET : linux **
** **
** PROJECT : DLT **
** **
** AUTHOR : Lassi Marttala <lassi.lm.marttala@partner.bmw.de> **
** **
** PURPOSE : Linked list based dynamic queue **
** **
** REMARKS : **
** **
** PLATFORM DEPENDANT [yes/no]: no **
** **
** TO BE CHANGED BY USER [yes/no]: no **
** **
*******************************************************************************/
/*******************************************************************************
** Author Identity **
********************************************************************************
** **
** Initials Name Company **
** -------- ------------------------- ---------------------------------- **
** lm Lassi Marttala Eureka GmbH **
*******************************************************************************/
#include <stdlib.h>
#include <semaphore.h>
#include "dlt_queue.h"
// Thread safety
static sem_t dlt_queue_mutex;
#define DLT_QUEUE_SEM_LOCK() { sem_wait(&dlt_queue_mutex); }
#define DLT_QUEUE_SEM_FREE() { sem_post(&dlt_queue_mutex); }
dlt_queue_item *dlt_queue_create_item()
{
dlt_queue_item *item = malloc(sizeof(dlt_queue_item));
item->item = NULL;
item->item_size = 0;
item->next_item = NULL;
return item;
}
void dlt_queue_free_item(dlt_queue_item *item)
{
if(item != NULL)
{
free(item);
item = NULL;
}
}
dlt_queue *dlt_queue_create()
{
static int init_done = 0;
if(!init_done)
{
init_done = 1;
sem_init(&dlt_queue_mutex, 0, 1);
}
return (dlt_queue *)malloc(sizeof(dlt_queue));
}
void dlt_queue_free(dlt_queue *queue)
{
if(queue != NULL)
{
free(queue);
queue = NULL;
}
}
void dlt_queue_push(dlt_queue_item *item, dlt_queue *queue)
{
DLT_QUEUE_SEM_LOCK()
item->next_item = NULL;
// Empty queue
if(dlt_queue_is_empty(queue))
{
queue->head = item;
queue->tail = item;
}
// Exactly one item
else if(queue->head == queue->tail)
{
queue->head->next_item = (struct dlt_queue_item *)item;
queue->tail = item;
}
// Default case
else
{
queue->tail->next_item = (struct dlt_queue_item *)item;
queue->tail = item;
}
DLT_QUEUE_SEM_FREE()
}
dlt_queue_item *dlt_queue_pop(dlt_queue *queue)
{
DLT_QUEUE_SEM_LOCK()
dlt_queue_item *retval = NULL;
// Empty queue
if(dlt_queue_is_empty(queue))
{
retval = NULL;
}
// Exactly one item
else if(queue->head == queue->tail)
{
retval = queue->head;
retval->next_item = NULL;
queue->head = NULL;
queue->tail = NULL;
}
// Default case
else
{
retval = queue->head;
queue->head = (dlt_queue_item *)retval->next_item;
retval->next_item = NULL;
}
DLT_QUEUE_SEM_FREE()
return retval;
}
int dlt_queue_is_empty(dlt_queue *queue)
{
if(queue->head == NULL && queue->tail == NULL)
return 1;
return 0;
}
int dlt_queue_item_count(dlt_queue *queue)
{
DLT_QUEUE_SEM_LOCK()
int retval = 0;
dlt_queue_item *ptr = queue->head;
while(ptr != NULL)
{
ptr = (dlt_queue_item *) ptr->next_item;
retval++;
}
DLT_QUEUE_SEM_FREE()
return retval;
}
|
