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
|
/*
** Zabbix
** Copyright (C) 2001-2019 Zabbix SIA
**
** This program is free software; you can redistribute it and/or modify
** it under the terms of the GNU General Public License as published by
** the Free Software Foundation; either version 2 of the License, or
** (at your option) any later version.
**
** This program is distributed in the hope that it will be useful,
** but WITHOUT ANY WARRANTY; without even the implied warranty of
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
** GNU General Public License for more details.
**
** You should have received a copy of the GNU General Public License
** along with this program; if not, write to the Free Software
** Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
**/
#include "common.h"
#include "zbxalgo.h"
/******************************************************************************
* *
* Function: zbx_queue_ptr_values_num *
* *
* Purpose: calculates the number of values in queue *
* *
* Parameters: queue - [IN] the queue *
* *
* Return value: The number of values in queue *
* *
******************************************************************************/
int zbx_queue_ptr_values_num(zbx_queue_ptr_t *queue)
{
int values_num;
values_num = queue->head_pos - queue->tail_pos;
if (0 > values_num)
values_num += queue->alloc_num;
return values_num;
}
/******************************************************************************
* *
* Function: zbx_queue_ptr_reserve *
* *
* Purpose: reserves space in queue for additional values *
* *
* Parameters: queue - [IN] the queue *
* num - [IN] the number of additional values to reserve *
* *
******************************************************************************/
void zbx_queue_ptr_reserve(zbx_queue_ptr_t *queue, int num)
{
int values_num, alloc_num, resize_num;
values_num = zbx_queue_ptr_values_num(queue);
if (values_num + num + 1 <= queue->alloc_num)
return;
alloc_num = MAX(queue->alloc_num + num + 1, queue->alloc_num * 1.5);
queue->values = (void **)zbx_realloc(queue->values, alloc_num * sizeof(*queue->values));
if (queue->tail_pos > queue->head_pos)
{
resize_num = alloc_num - queue->alloc_num;
memmove(queue->values + queue->tail_pos + resize_num, queue->values + queue->tail_pos,
(queue->alloc_num - queue->tail_pos) * sizeof(*queue->values));
queue->tail_pos += resize_num;
}
queue->alloc_num = alloc_num;
}
/******************************************************************************
* *
* Function: zbx_queue_ptr_compact *
* *
* Purpose: compacts queue by freeing unused space *
* *
* Parameters: queue - [IN] the queue *
* *
******************************************************************************/
void zbx_queue_ptr_compact(zbx_queue_ptr_t *queue)
{
int values_num, alloc_num;
values_num = zbx_queue_ptr_values_num(queue);
alloc_num = values_num + 1;
if (alloc_num == queue->alloc_num)
return;
if (0 != queue->tail_pos)
{
if (queue->tail_pos > queue->head_pos)
{
memmove(queue->values + queue->head_pos + 1, queue->values + queue->tail_pos,
(queue->alloc_num - queue->tail_pos) * sizeof(*queue->values));
queue->tail_pos = queue->head_pos + 1;
}
else
{
memmove(queue->values, queue->values + queue->tail_pos, values_num * sizeof(*queue->values));
queue->tail_pos = 0;
queue->head_pos = values_num;
}
}
queue->values = (void **)zbx_realloc(queue->values, alloc_num * sizeof(*queue->values));
queue->alloc_num = alloc_num;
}
/******************************************************************************
* *
* Function: zbx_queue_ptr_create *
* *
* Purpose: creates queue *
* *
* Parameters: queue - [IN] the queue *
* *
******************************************************************************/
void zbx_queue_ptr_create(zbx_queue_ptr_t *queue)
{
memset(queue, 0, sizeof(*queue));
}
/******************************************************************************
* *
* Function: zbx_queue_ptr_destroy *
* *
* Purpose: destroys queue *
* *
* Parameters: queue - [IN] the queue *
* *
******************************************************************************/
void zbx_queue_ptr_destroy(zbx_queue_ptr_t *queue)
{
zbx_free(queue->values);
}
/******************************************************************************
* *
* Function: zbx_queue_ptr_push *
* *
* Purpose: pushes value in the queue *
* *
* Parameters: queue - [IN] the queue *
* elem - [IN] the value *
* *
******************************************************************************/
void zbx_queue_ptr_push(zbx_queue_ptr_t *queue, void *value)
{
zbx_queue_ptr_reserve(queue, 1);
queue->values[queue->head_pos++] = value;
if (queue->head_pos == queue->alloc_num)
queue->head_pos = 0;
}
/******************************************************************************
* *
* Function: zbx_queue_ptr_pop *
* *
* Purpose: pops value in the queue *
* *
* Parameters: queue - [IN] the queue *
* *
* Return value: The first queue element. *
* *
******************************************************************************/
void *zbx_queue_ptr_pop(zbx_queue_ptr_t *queue)
{
void *value;
if (queue->tail_pos != queue->head_pos)
{
value = queue->values[queue->tail_pos++];
if (queue->tail_pos == queue->alloc_num)
queue->tail_pos = 0;
if (queue->head_pos == queue->alloc_num)
queue->head_pos = 0;
}
else
value = NULL;
return value;
}
/******************************************************************************
* *
* Function: zbx_queue_ptr_remove_value *
* *
* Purpose: removes specified value from queue *
* *
* Parameters: queue - [IN] the queue *
* value - [IN] the value to remove *
* *
******************************************************************************/
void zbx_queue_ptr_remove_value(zbx_queue_ptr_t *queue, const void *value)
{
int i, start_pos;
if (queue->tail_pos == queue->head_pos)
return;
if (queue->tail_pos < queue->head_pos)
start_pos = queue->tail_pos;
else
start_pos = 0;
for (i = start_pos; i < queue->head_pos; i++)
{
if (queue->values[i] == value)
{
for (; i < queue->head_pos - 1; i++)
queue->values[i] = queue->values[i + 1];
queue->head_pos--;
return;
}
}
if (queue->tail_pos <= queue->head_pos)
return;
for (i = queue->alloc_num - 1; i >= queue->tail_pos; i--)
{
if (queue->values[i] == value)
{
for (; i > queue->tail_pos; i--)
queue->values[i] = queue->values[i - 1];
if (++queue->tail_pos == queue->alloc_num)
queue->tail_pos = 0;
return;
}
}
}
|
