/
queue.c
185 lines (155 loc) · 3.56 KB
/
queue.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
/*
* =====================================================================================
*
* Filename: pomme_queque.h
*
* Description: the implement of queue
*
* Version: 1.0
* Created: 11/15/2011 05:26:47 AM
* Revision: none
* Compiler: gcc
*
* Author: drealdal (zhumeiqi), meiqizhu@gmail.com
* Company: Tsinghua University, HPC
*
* =====================================================================================
*/
#include "queue.h"
int queue_init(queue_t **queue,
char *name,int maxLength)
{
queue_t * q_addr = *queue;
if(q_addr == NULL)
{
q_addr =(queue_t *) malloc(sizeof(queue_t));
if(q_addr == NULL)
{
debug(DEBUG_UTILS,
"Malloc Error for queue: %s",name);
return -1;
}
memset(q_addr,0,sizeof(struct queue_head));
q_addr->need_free = 1;
}else{
memset(q_addr,0,sizeof(struct queue_head));
}
q_addr->head = (queue_body_t *) QUEUE_HEAD_NULL;
q_addr->tail = (queue_body_t *) QUEUE_TAIL_NULL;
q_addr->maxLength = maxLength;
int nLen = strlen(name);
q_addr->name = (char *)malloc(nLen);
if( q_addr->name == NULL )
{
debug(DEBUG_UTILS,
"Malloc Error for queue:%s",name);
return -1;
}
memcpy(q_addr->name,name,nLen);
if( pthread_mutex_init(&q_addr->mutex,NULL) != 0 )
{
debug(DEBUG_UTILS,
"Queue %s init Mutex Error\n",name);
return -1;
}
q_addr->curLength = 0;
*queue = q_addr;
return 0;
}
int queue_distroy(queue_t *queue)
{
int ret = 0;
lock_queue(queue);
if( !is_empty_queue(queue) )
{
debug(DEBUG_UTILS,
"Distroy not empty queue:%s",queue->name);
ret = -1;
goto d_end;
}
free(queue->name);
if( queue->need_free == 1 )
{
unlock_queue(queue);
free(queue);
return 0;
}
queue->tail =(queue_body_t *) QUEUE_TAIL_NULL;
queue->head =(queue_body_t *) QUEUE_HEAD_NULL;
queue->maxLength = 0;
d_end:
unlock_queue(queue);
return ret;
}
static int __add_queue(queue_t *queue,
queue_body_t *toadd)
{
int ret = 0;
lock_queue(queue);
if(is_full_queue(queue))
{
debug(DEBUG_UTILS,
"Add to full queue");
ret = -1;
goto unl;
}
toadd->next = (queue_body_t *)QUEUE_TAIL_NULL;
if( is_tail_null(queue) )
{
queue->tail = toadd;
queue->head = toadd;
queue->curLength = 1;
ret = 0;
goto unl;
}
queue->tail->next = toadd;
queue->tail = toadd;
queue->curLength++;
unl:
unlock_queue(queue);
return ret;
}
static queue_body_t * __del_queue(queue_head *queue)
{
struct queue_body * re = NULL;
lock_queue(queue);
if( is_empty_queue(queue) )
{
debug(DEBUG_UTILS,
"Queue:%s is empty",queue->name);
goto out_pos;
}
re = queue->head;
queue->head = queue->head->next;
if(queue->head == QUEUE_TAIL_NULL)
{
queue->tail =(queue_body_t *) QUEUE_TAIL_NULL;
queue->head =(queue_body_t *) QUEUE_HEAD_NULL;
}
queue->curLength--;
out_pos:
unlock_queue(queue);
return re;
}
int queue_push_back(struct queue_head *queue,struct queue_body *toadd)
{
return __add_queue(queue,toadd);
}
struct queue_body * queue_get_front(struct queue_head *queue)
{
return __del_queue(queue);
}
int queue_cpy_del(struct queue_head *from, struct queue_head *to)
{
lock_queue(from);
lock_queue(to);
to->head = from->head;
to->tail = from->tail;
from->head = (queue_body_t *) QUEUE_HEAD_NULL;
from->tail = (queue_body_t *) QUEUE_TAIL_NULL;
to->curLength = from->curLength;
from->curLength = 0;
unlock_queue(to);
unlock_queue(from);
return 0;
}