blob: c1e2624b23226c76213eb98de9a630a546c4ee05 (
plain) (
blame)
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
|
// SPDX-License-Identifier: GPL-2.0-only
/*
* Copyright(C) 2021 Alibaba Communications Inc.
* Author: David Li <liyong.li@alibaba-inc.com>
*/
/*
* queue management
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include "queue.h"
/**
* queue init
* parameter：
* queueIncreasedEvent：event
* ret：queue_ptr to be successful，NULL to be failed
*/
Queue* Queue_Init(QueueIncreased queueIncreasedEvent)
{
Queue* queue = NULL;
queue = (Queue*)malloc(sizeof(Queue));
if(queue == NULL)
{
return NULL;
}
queue->length = 0;
queue->head = NULL;
queue->tail = NULL;
queue->onQueueIncreased = queueIncreasedEvent;
return queue;
}
/**
* insert data to head
* parameter：
* queue：queue ptr
* data：data to be inserted
* ret：0 to be successful，-1 to be failed
*/
int Queue_AddToHead(Queue* queue, char data)
{
QueueNode* node = NULL;
if(queue == NULL)
return -1;
// create node
node = (QueueNode*)malloc(sizeof(QueueNode));
if(node == NULL)
return -1;
node->data = data;
// in first time
if(queue->tail == NULL && queue->head == NULL)
{
queue->tail = node;
queue->head = node;
node->next = NULL;
node->prior = NULL;
}
else
{
// add to head
queue->head->prior = node;
node->next = queue->head;
node->prior = NULL;
queue->head = node;
}
queue->length++;
//callback event
if(queue->onQueueIncreased != NULL)
return queue->onQueueIncreased(queue,data);
return 0;
}
/**
* insert data to taol
* parameter：
* queue：queue ptr
* data：data to be inserted
* ret：0 to be successful，-1 to be failed
*/
int Queue_AddToTail(Queue* queue, char data)
{
QueueNode* node = NULL;
if(queue == NULL)
return -1;
// create node
node = (QueueNode*)malloc(sizeof(QueueNode));
if(node == NULL)
return -1;
node->data = data;
// in first time
if(queue->tail == NULL && queue->head == NULL)
{
queue->tail = node;
queue->head = node;
node->next = NULL;
node->prior = NULL;
}
else
{
//add to tail
queue->tail->next = node;
node->prior = queue->tail;
node->next = NULL;
queue->tail = node;
}
queue->length++;
// callback event
if(queue->onQueueIncreased != NULL)
return queue->onQueueIncreased(queue,data);
return 0;
}
/**
* get data from queue head
* parameter：
* queue：queue ptr
* ret：valid data to be successful，-1 to be failed
*/
char Queue_GetFromHead(Queue* queue)
{
char data = -1;
QueueNode* node = NULL;
if(queue == NULL || queue->head == NULL)
{
return -1;
}
node = queue->head;
queue->head = node->next;
if(queue->head != NULL)
{
queue->head->prior = NULL;
}
else
{
//empty queue
queue->tail = NULL;
queue->head = NULL;
}
data = node->data;
free(node);
queue->length--;
return data;
}
/**
* get data from queue tail
* parameter：
* queue：queue ptr
* ret：valid data to be successful，-1 to be failed
*/
char Queue_GetFromTail(Queue* queue)
{
char data = -1;
QueueNode* node = NULL;
if(queue == NULL || queue->tail == NULL)
{
return -1;
}
node = queue->tail;
queue->tail = node->prior;
if(queue->tail != NULL)
{
queue->tail->next = NULL;
}
else
{
// empty queue
queue->tail = NULL;
queue->head = NULL;
}
data = node->data;
free(node);
queue->length--;
return data;
}
char Queue_QueryAt(Queue* queue, unsigned long index)
{
QueueNode* node = NULL;
if(queue == NULL || queue->head == NULL)
{
return -1;
}
node = queue->head;
while (index > 0) {
if (node == queue->tail) {
printf("Queue QueryAt is out of range");
return -1;
}
node = node->next;
index--;
};
return node->data;
}
/**
* free queue
* parameter：
* queue：queue ptr
* isFreeData: flag to indicator free data automatically
*/
void Queue_Free(Queue* queue, bool isFreeData)
{
if(isFreeData) {
while (queue->tail != NULL)
Queue_GetFromTail(queue);
}
free(queue);
}
// new event
int OnQueueIncreasedEvent(void* queue, char data)
{
Queue* q = (Queue*)queue;
char p = data;
return 0;
}
|
