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
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
|
/*
** Zabbix
** Copyright (C) 2001-2022 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.
**/
#ifndef ZABBIX_ZBXALGO_H
#define ZABBIX_ZBXALGO_H
#include "common.h"
/* generic */
typedef zbx_uint32_t zbx_hash_t;
zbx_hash_t zbx_hash_lookup2(const void *data, size_t len, zbx_hash_t seed);
zbx_hash_t zbx_hash_modfnv(const void *data, size_t len, zbx_hash_t seed);
zbx_hash_t zbx_hash_murmur2(const void *data, size_t len, zbx_hash_t seed);
zbx_hash_t zbx_hash_sdbm(const void *data, size_t len, zbx_hash_t seed);
zbx_hash_t zbx_hash_djb2(const void *data, size_t len, zbx_hash_t seed);
zbx_hash_t zbx_hash_splittable64(const void *data);
#define ZBX_DEFAULT_HASH_ALGO zbx_hash_modfnv
#define ZBX_DEFAULT_PTR_HASH_ALGO zbx_hash_modfnv
#define ZBX_DEFAULT_UINT64_HASH_ALGO zbx_hash_modfnv
#define ZBX_DEFAULT_STRING_HASH_ALGO zbx_hash_modfnv
typedef zbx_hash_t (*zbx_hash_func_t)(const void *data);
zbx_hash_t zbx_default_ptr_hash_func(const void *data);
zbx_hash_t zbx_default_string_hash_func(const void *data);
zbx_hash_t zbx_default_uint64_pair_hash_func(const void *data);
#define ZBX_DEFAULT_HASH_SEED 0
#define ZBX_DEFAULT_PTR_HASH_FUNC zbx_default_ptr_hash_func
#define ZBX_DEFAULT_UINT64_HASH_FUNC zbx_hash_splittable64
#define ZBX_DEFAULT_STRING_HASH_FUNC zbx_default_string_hash_func
#define ZBX_DEFAULT_UINT64_PAIR_HASH_FUNC zbx_default_uint64_pair_hash_func
typedef int (*zbx_compare_func_t)(const void *d1, const void *d2);
int zbx_default_int_compare_func(const void *d1, const void *d2);
int zbx_default_uint64_compare_func(const void *d1, const void *d2);
int zbx_default_uint64_ptr_compare_func(const void *d1, const void *d2);
int zbx_default_str_compare_func(const void *d1, const void *d2);
int zbx_natural_str_compare_func(const void *d1, const void *d2);
int zbx_default_ptr_compare_func(const void *d1, const void *d2);
int zbx_default_uint64_pair_compare_func(const void *d1, const void *d2);
int zbx_default_dbl_compare_func(const void *d1, const void *d2);
#define ZBX_DEFAULT_INT_COMPARE_FUNC zbx_default_int_compare_func
#define ZBX_DEFAULT_UINT64_COMPARE_FUNC zbx_default_uint64_compare_func
#define ZBX_DEFAULT_UINT64_PTR_COMPARE_FUNC zbx_default_uint64_ptr_compare_func
#define ZBX_DEFAULT_STR_COMPARE_FUNC zbx_default_str_compare_func
#define ZBX_DEFAULT_PTR_COMPARE_FUNC zbx_default_ptr_compare_func
#define ZBX_DEFAULT_UINT64_PAIR_COMPARE_FUNC zbx_default_uint64_pair_compare_func
#define ZBX_DEFAULT_DBL_COMPARE_FUNC zbx_default_dbl_compare_func
typedef void *(*zbx_mem_malloc_func_t)(void *old, size_t size);
typedef void *(*zbx_mem_realloc_func_t)(void *old, size_t size);
typedef void (*zbx_mem_free_func_t)(void *ptr);
void *zbx_default_mem_malloc_func(void *old, size_t size);
void *zbx_default_mem_realloc_func(void *old, size_t size);
void zbx_default_mem_free_func(void *ptr);
#define ZBX_DEFAULT_MEM_MALLOC_FUNC zbx_default_mem_malloc_func
#define ZBX_DEFAULT_MEM_REALLOC_FUNC zbx_default_mem_realloc_func
#define ZBX_DEFAULT_MEM_FREE_FUNC zbx_default_mem_free_func
typedef void (*zbx_clean_func_t)(void *data);
#define ZBX_RETURN_IF_NOT_EQUAL(a, b) \
\
if ((a) < (b)) \
return -1; \
if ((a) > (b)) \
return +1
#define ZBX_RETURN_IF_DBL_NOT_EQUAL(a, b) \
\
if (FAIL == zbx_double_compare(a, b)) \
{ \
if ((a) < (b)) \
return -1; \
else \
return +1; \
}
int is_prime(int n);
int next_prime(int n);
/* pair */
typedef struct
{
void *first;
void *second;
}
zbx_ptr_pair_t;
typedef struct
{
zbx_uint64_t first;
zbx_uint64_t second;
}
zbx_uint64_pair_t;
/* hashset */
#define ZBX_HASHSET_ENTRY_T struct zbx_hashset_entry_s
ZBX_HASHSET_ENTRY_T
{
ZBX_HASHSET_ENTRY_T *next;
zbx_hash_t hash;
#if SIZEOF_VOID_P > 4
/* the data member must be properly aligned on 64-bit architectures that require aligned memory access */
char padding[sizeof(void *) - sizeof(zbx_hash_t)];
#endif
char data[1];
};
typedef struct
{
ZBX_HASHSET_ENTRY_T **slots;
int num_slots;
int num_data;
zbx_hash_func_t hash_func;
zbx_compare_func_t compare_func;
zbx_clean_func_t clean_func;
zbx_mem_malloc_func_t mem_malloc_func;
zbx_mem_realloc_func_t mem_realloc_func;
zbx_mem_free_func_t mem_free_func;
}
zbx_hashset_t;
#define ZBX_HASHSET_ENTRY_OFFSET offsetof(ZBX_HASHSET_ENTRY_T, data)
void zbx_hashset_create(zbx_hashset_t *hs, size_t init_size,
zbx_hash_func_t hash_func,
zbx_compare_func_t compare_func);
void zbx_hashset_create_ext(zbx_hashset_t *hs, size_t init_size,
zbx_hash_func_t hash_func,
zbx_compare_func_t compare_func,
zbx_clean_func_t clean_func,
zbx_mem_malloc_func_t mem_malloc_func,
zbx_mem_realloc_func_t mem_realloc_func,
zbx_mem_free_func_t mem_free_func);
void zbx_hashset_destroy(zbx_hashset_t *hs);
int zbx_hashset_reserve(zbx_hashset_t *hs, int num_slots_req);
void *zbx_hashset_insert(zbx_hashset_t *hs, const void *data, size_t size);
void *zbx_hashset_insert_ext(zbx_hashset_t *hs, const void *data, size_t size, size_t offset);
void *zbx_hashset_search(zbx_hashset_t *hs, const void *data);
void zbx_hashset_remove(zbx_hashset_t *hs, const void *data);
void zbx_hashset_remove_direct(zbx_hashset_t *hs, const void *data);
void zbx_hashset_clear(zbx_hashset_t *hs);
typedef struct
{
zbx_hashset_t *hashset;
int slot;
ZBX_HASHSET_ENTRY_T *entry;
}
zbx_hashset_iter_t;
void zbx_hashset_iter_reset(zbx_hashset_t *hs, zbx_hashset_iter_t *iter);
void *zbx_hashset_iter_next(zbx_hashset_iter_t *iter);
void zbx_hashset_iter_remove(zbx_hashset_iter_t *iter);
/* hashmap */
/* currently, we only have a very specialized hashmap */
/* that maps zbx_uint64_t keys into non-negative ints */
#define ZBX_HASHMAP_ENTRY_T struct zbx_hashmap_entry_s
#define ZBX_HASHMAP_SLOT_T struct zbx_hashmap_slot_s
ZBX_HASHMAP_ENTRY_T
{
zbx_uint64_t key;
int value;
};
ZBX_HASHMAP_SLOT_T
{
ZBX_HASHMAP_ENTRY_T *entries;
int entries_num;
int entries_alloc;
};
typedef struct
{
ZBX_HASHMAP_SLOT_T *slots;
int num_slots;
int num_data;
zbx_hash_func_t hash_func;
zbx_compare_func_t compare_func;
zbx_mem_malloc_func_t mem_malloc_func;
zbx_mem_realloc_func_t mem_realloc_func;
zbx_mem_free_func_t mem_free_func;
}
zbx_hashmap_t;
void zbx_hashmap_create(zbx_hashmap_t *hm, size_t init_size);
void zbx_hashmap_create_ext(zbx_hashmap_t *hm, size_t init_size,
zbx_hash_func_t hash_func,
zbx_compare_func_t compare_func,
zbx_mem_malloc_func_t mem_malloc_func,
zbx_mem_realloc_func_t mem_realloc_func,
zbx_mem_free_func_t mem_free_func);
void zbx_hashmap_destroy(zbx_hashmap_t *hm);
int zbx_hashmap_get(zbx_hashmap_t *hm, zbx_uint64_t key);
void zbx_hashmap_set(zbx_hashmap_t *hm, zbx_uint64_t key, int value);
void zbx_hashmap_remove(zbx_hashmap_t *hm, zbx_uint64_t key);
void zbx_hashmap_clear(zbx_hashmap_t *hm);
/* binary heap (min-heap) */
/* currently, we only have a very specialized binary heap that can */
/* store zbx_uint64_t keys with arbitrary auxiliary information */
#define ZBX_BINARY_HEAP_OPTION_EMPTY 0
#define ZBX_BINARY_HEAP_OPTION_DIRECT (1<<0) /* support for direct update() and remove() operations */
typedef struct
{
zbx_uint64_t key;
const void *data;
}
zbx_binary_heap_elem_t;
typedef struct
{
zbx_binary_heap_elem_t *elems;
int elems_num;
int elems_alloc;
int options;
zbx_compare_func_t compare_func;
zbx_hashmap_t *key_index;
/* The binary heap is designed to work correctly only with memory allocation functions */
/* that return pointer to the allocated memory or quit. Functions that can return NULL */
/* are not supported (process will exit() if NULL return value is encountered). If */
/* using zbx_mem_info_t and the associated memory functions then ensure that allow_oom */
/* is always set to 0. */
zbx_mem_malloc_func_t mem_malloc_func;
zbx_mem_realloc_func_t mem_realloc_func;
zbx_mem_free_func_t mem_free_func;
}
zbx_binary_heap_t;
void zbx_binary_heap_create(zbx_binary_heap_t *heap, zbx_compare_func_t compare_func, int options);
void zbx_binary_heap_create_ext(zbx_binary_heap_t *heap, zbx_compare_func_t compare_func, int options,
zbx_mem_malloc_func_t mem_malloc_func,
zbx_mem_realloc_func_t mem_realloc_func,
zbx_mem_free_func_t mem_free_func);
void zbx_binary_heap_destroy(zbx_binary_heap_t *heap);
int zbx_binary_heap_empty(zbx_binary_heap_t *heap);
zbx_binary_heap_elem_t *zbx_binary_heap_find_min(zbx_binary_heap_t *heap);
void zbx_binary_heap_insert(zbx_binary_heap_t *heap, zbx_binary_heap_elem_t *elem);
void zbx_binary_heap_update_direct(zbx_binary_heap_t *heap, zbx_binary_heap_elem_t *elem);
void zbx_binary_heap_remove_min(zbx_binary_heap_t *heap);
void zbx_binary_heap_remove_direct(zbx_binary_heap_t *heap, zbx_uint64_t key);
void zbx_binary_heap_clear(zbx_binary_heap_t *heap);
/* vector */
#define ZBX_VECTOR_DECL(__id, __type) \
\
typedef struct \
{ \
__type *values; \
int values_num; \
int values_alloc; \
zbx_mem_malloc_func_t mem_malloc_func; \
zbx_mem_realloc_func_t mem_realloc_func; \
zbx_mem_free_func_t mem_free_func; \
} \
zbx_vector_ ## __id ## _t; \
\
void zbx_vector_ ## __id ## _create(zbx_vector_ ## __id ## _t *vector); \
void zbx_vector_ ## __id ## _create_ext(zbx_vector_ ## __id ## _t *vector, \
zbx_mem_malloc_func_t mem_malloc_func, \
zbx_mem_realloc_func_t mem_realloc_func, \
zbx_mem_free_func_t mem_free_func); \
void zbx_vector_ ## __id ## _destroy(zbx_vector_ ## __id ## _t *vector); \
\
void zbx_vector_ ## __id ## _append(zbx_vector_ ## __id ## _t *vector, __type value); \
void zbx_vector_ ## __id ## _append_ptr(zbx_vector_ ## __id ## _t *vector, __type *value); \
void zbx_vector_ ## __id ## _append_array(zbx_vector_ ## __id ## _t *vector, __type const *values, \
int values_num); \
void zbx_vector_ ## __id ## _remove_noorder(zbx_vector_ ## __id ## _t *vector, int index); \
void zbx_vector_ ## __id ## _remove(zbx_vector_ ## __id ## _t *vector, int index); \
\
void zbx_vector_ ## __id ## _sort(zbx_vector_ ## __id ## _t *vector, zbx_compare_func_t compare_func); \
void zbx_vector_ ## __id ## _uniq(zbx_vector_ ## __id ## _t *vector, zbx_compare_func_t compare_func); \
\
int zbx_vector_ ## __id ## _nearestindex(const zbx_vector_ ## __id ## _t *vector, const __type value, \
zbx_compare_func_t compare_func); \
int zbx_vector_ ## __id ## _bsearch(const zbx_vector_ ## __id ## _t *vector, const __type value, \
zbx_compare_func_t compare_func); \
int zbx_vector_ ## __id ## _lsearch(const zbx_vector_ ## __id ## _t *vector, const __type value, int *index,\
zbx_compare_func_t compare_func); \
int zbx_vector_ ## __id ## _search(const zbx_vector_ ## __id ## _t *vector, const __type value, \
zbx_compare_func_t compare_func); \
void zbx_vector_ ## __id ## _setdiff(zbx_vector_ ## __id ## _t *left, const zbx_vector_ ## __id ## _t *right,\
zbx_compare_func_t compare_func); \
\
void zbx_vector_ ## __id ## _reserve(zbx_vector_ ## __id ## _t *vector, size_t size); \
void zbx_vector_ ## __id ## _clear(zbx_vector_ ## __id ## _t *vector);
#define ZBX_PTR_VECTOR_DECL(__id, __type) \
\
ZBX_VECTOR_DECL(__id, __type) \
\
typedef void (*zbx_ ## __id ## _free_func_t)(__type data); \
\
void zbx_vector_ ## __id ## _clear_ext(zbx_vector_ ## __id ## _t *vector, zbx_ ## __id ## _free_func_t free_func);
ZBX_VECTOR_DECL(uint64, zbx_uint64_t)
ZBX_PTR_VECTOR_DECL(str, char *)
ZBX_PTR_VECTOR_DECL(ptr, void *)
ZBX_VECTOR_DECL(ptr_pair, zbx_ptr_pair_t)
ZBX_VECTOR_DECL(uint64_pair, zbx_uint64_pair_t)
ZBX_VECTOR_DECL(dbl, double)
/* this function is only for use with zbx_vector_XXX_clear_ext() */
/* and only if the vector does not contain nested allocations */
void zbx_ptr_free(void *data);
void zbx_str_free(char *data);
/* 128 bit unsigned integer handling */
#define uset128(base, hi64, lo64) (base)->hi = hi64; (base)->lo = lo64
void uinc128_64(zbx_uint128_t *base, zbx_uint64_t value);
void uinc128_128(zbx_uint128_t *base, const zbx_uint128_t *value);
void udiv128_64(zbx_uint128_t *result, const zbx_uint128_t *dividend, zbx_uint64_t value);
void umul64_64(zbx_uint128_t *result, zbx_uint64_t value, zbx_uint64_t factor);
unsigned int zbx_isqrt32(unsigned int value);
char *zbx_gen_uuid4(const char *seed);
/* expression evaluation */
#define ZBX_INFINITY (1.0 / 0.0) /* "Positive infinity" value used as a fatal error code */
#define ZBX_UNKNOWN (-1.0 / 0.0) /* "Negative infinity" value used as a code for "Unknown" */
#define ZBX_UNKNOWN_STR "ZBX_UNKNOWN" /* textual representation of ZBX_UNKNOWN */
#define ZBX_UNKNOWN_STR_LEN ZBX_CONST_STRLEN(ZBX_UNKNOWN_STR)
int evaluate(double *value, const char *expression, char *error, size_t max_error_len,
zbx_vector_ptr_t *unknown_msgs);
int evaluate_unknown(const char *expression, double *value, char *error, size_t max_error_len);
double evaluate_string_to_double(const char *in);
/* forecasting */
#define ZBX_MATH_ERROR -1.0
typedef enum
{
FIT_LINEAR,
FIT_POLYNOMIAL,
FIT_EXPONENTIAL,
FIT_LOGARITHMIC,
FIT_POWER,
FIT_INVALID
}
zbx_fit_t;
typedef enum
{
MODE_VALUE,
MODE_MAX,
MODE_MIN,
MODE_DELTA,
MODE_AVG,
MODE_INVALID
}
zbx_mode_t;
int zbx_fit_code(char *fit_str, zbx_fit_t *fit, unsigned *k, char **error);
int zbx_mode_code(char *mode_str, zbx_mode_t *mode, char **error);
double zbx_forecast(double *t, double *x, int n, double now, double time, zbx_fit_t fit, unsigned k, zbx_mode_t mode);
double zbx_timeleft(double *t, double *x, int n, double now, double threshold, zbx_fit_t fit, unsigned k);
/* fifo queue of pointers */
typedef struct
{
void **values;
int alloc_num;
int head_pos;
int tail_pos;
}
zbx_queue_ptr_t;
#define zbx_queue_ptr_empty(queue) ((queue)->head_pos == (queue)->tail_pos ? SUCCEED : FAIL)
int zbx_queue_ptr_values_num(zbx_queue_ptr_t *queue);
void zbx_queue_ptr_reserve(zbx_queue_ptr_t *queue, int num);
void zbx_queue_ptr_compact(zbx_queue_ptr_t *queue);
void zbx_queue_ptr_create(zbx_queue_ptr_t *queue);
void zbx_queue_ptr_destroy(zbx_queue_ptr_t *queue);
void zbx_queue_ptr_push(zbx_queue_ptr_t *queue, void *value);
void *zbx_queue_ptr_pop(zbx_queue_ptr_t *queue);
void zbx_queue_ptr_remove_value(zbx_queue_ptr_t *queue, const void *value);
/* list item data */
typedef struct list_item
{
struct list_item *next;
void *data;
}
zbx_list_item_t;
/* list data */
typedef struct
{
zbx_list_item_t *head;
zbx_list_item_t *tail;
zbx_mem_malloc_func_t mem_malloc_func;
zbx_mem_realloc_func_t mem_realloc_func;
zbx_mem_free_func_t mem_free_func;
}
zbx_list_t;
/* queue item data */
typedef struct
{
zbx_list_t *list;
zbx_list_item_t *current;
zbx_list_item_t *next;
}
zbx_list_iterator_t;
void zbx_list_create(zbx_list_t *queue);
void zbx_list_create_ext(zbx_list_t *queue, zbx_mem_malloc_func_t mem_malloc_func, zbx_mem_free_func_t mem_free_func);
void zbx_list_destroy(zbx_list_t *list);
void zbx_list_append(zbx_list_t *list, void *value, zbx_list_item_t **inserted);
void zbx_list_insert_after(zbx_list_t *list, zbx_list_item_t *after, void *value, zbx_list_item_t **inserted);
void zbx_list_prepend(zbx_list_t *list, void *value, zbx_list_item_t **inserted);
int zbx_list_pop(zbx_list_t *list, void **value);
int zbx_list_peek(const zbx_list_t *list, void **value);
void zbx_list_iterator_init(zbx_list_t *list, zbx_list_iterator_t *iterator);
int zbx_list_iterator_next(zbx_list_iterator_t *iterator);
int zbx_list_iterator_peek(const zbx_list_iterator_t *iterator, void **value);
void zbx_list_iterator_clear(zbx_list_iterator_t *iterator);
int zbx_list_iterator_equal(const zbx_list_iterator_t *iterator1, const zbx_list_iterator_t *iterator2);
int zbx_list_iterator_isset(const zbx_list_iterator_t *iterator);
void zbx_list_iterator_update(zbx_list_iterator_t *iterator);
void *zbx_list_iterator_remove_next(zbx_list_iterator_t *iterator);
ZBX_PTR_VECTOR_DECL(tags, zbx_tag_t*)
#endif
|