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
|
/*
** Zabbix
** Copyright (C) 2001-2021 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"
typedef unsigned char uchar;
/*
* Bob Jenkins hash function (see http://burtleburtle.net/bob/hash/evahash.html)
*/
zbx_hash_t zbx_hash_lookup2(const void *data, size_t len, zbx_hash_t seed)
{
const uchar *p = (const uchar *)data;
zbx_hash_t a, b, c;
#define mix(a, b, c) \
{ \
a = a - b; a = a - c; a = a ^ (c >> 13); \
b = b - c; b = b - a; b = b ^ (a << 8); \
c = c - a; c = c - b; c = c ^ (b >> 13); \
a = a - b; a = a - c; a = a ^ (c >> 12); \
b = b - c; b = b - a; b = b ^ (a << 16); \
c = c - a; c = c - b; c = c ^ (b >> 5); \
a = a - b; a = a - c; a = a ^ (c >> 3); \
b = b - c; b = b - a; b = b ^ (a << 10); \
c = c - a; c = c - b; c = c ^ (b >> 15); \
}
a = b = 0x9e3779b9u;
c = seed;
while (len >= 12)
{
a = a + (p[0] + ((zbx_hash_t)p[1] << 8) + ((zbx_hash_t)p[2] << 16) + ((zbx_hash_t)p[3] << 24));
b = b + (p[4] + ((zbx_hash_t)p[5] << 8) + ((zbx_hash_t)p[6] << 16) + ((zbx_hash_t)p[7] << 24));
c = c + (p[8] + ((zbx_hash_t)p[9] << 8) + ((zbx_hash_t)p[10] << 16) + ((zbx_hash_t)p[11] << 24));
mix(a, b, c);
p += 12;
len -= 12;
}
c = c + (zbx_hash_t)len;
switch (len)
{
case 11: c = c + ((zbx_hash_t)p[10] << 24);
ZBX_FALLTHROUGH;
case 10: c = c + ((zbx_hash_t)p[9] << 16);
ZBX_FALLTHROUGH;
case 9: c = c + ((zbx_hash_t)p[8] << 8);
ZBX_FALLTHROUGH;
case 8: b = b + ((zbx_hash_t)p[7] << 24);
ZBX_FALLTHROUGH;
case 7: b = b + ((zbx_hash_t)p[6] << 16);
ZBX_FALLTHROUGH;
case 6: b = b + ((zbx_hash_t)p[5] << 8);
ZBX_FALLTHROUGH;
case 5: b = b + p[4];
ZBX_FALLTHROUGH;
case 4: a = a + ((zbx_hash_t)p[3] << 24);
ZBX_FALLTHROUGH;
case 3: a = a + ((zbx_hash_t)p[2] << 16);
ZBX_FALLTHROUGH;
case 2: a = a + ((zbx_hash_t)p[1] << 8);
ZBX_FALLTHROUGH;
case 1: a = a + p[0];
}
mix(a, b, c);
return c;
}
/*
* modified FNV hash function (see http://www.isthe.com/chongo/tech/comp/fnv/)
*/
zbx_hash_t zbx_hash_modfnv(const void *data, size_t len, zbx_hash_t seed)
{
const uchar *p = (const uchar *)data;
zbx_hash_t hash;
hash = 2166136261u ^ seed;
while (len-- >= 1)
{
hash = (hash ^ *(p++)) * 16777619u;
}
hash += hash << 13;
hash ^= hash >> 7;
hash += hash << 3;
hash ^= hash >> 17;
hash += hash << 5;
return hash;
}
/*
* Murmur (see http://sites.google.com/site/murmurhash/)
*/
zbx_hash_t zbx_hash_murmur2(const void *data, size_t len, zbx_hash_t seed)
{
const uchar *p = (const uchar *)data;
zbx_hash_t hash;
const zbx_hash_t m = 0x5bd1e995u;
const zbx_hash_t r = 24;
hash = seed ^ (zbx_hash_t)len;
while (len >= 4)
{
zbx_hash_t k;
k = p[0];
k |= p[1] << 8;
k |= p[2] << 16;
k |= p[3] << 24;
k *= m;
k ^= k >> r;
k *= m;
hash *= m;
hash ^= k;
p += 4;
len -= 4;
}
switch (len)
{
case 3: hash ^= p[2] << 16;
ZBX_FALLTHROUGH;
case 2: hash ^= p[1] << 8;
ZBX_FALLTHROUGH;
case 1: hash ^= p[0];
hash *= m;
}
hash ^= hash >> 13;
hash *= m;
hash ^= hash >> 15;
return hash;
}
/*
* sdbm (see http://www.cse.yorku.ca/~oz/hash.html)
*/
zbx_hash_t zbx_hash_sdbm(const void *data, size_t len, zbx_hash_t seed)
{
const uchar *p = (const uchar *)data;
zbx_hash_t hash = seed;
#if 1
while (len-- >= 1)
{
/* hash = *(p++) + hash * 65599; */
hash = *(p++) + (hash << 6) + (hash << 16) - hash;
}
#else /* Duff's device */
#define HASH_STEP len--; \
hash = *(p++) + (hash << 6) + (hash << 16) - hash
switch (len & 7)
{
do
{
HASH_STEP;
case 7: HASH_STEP;
case 6: HASH_STEP;
case 5: HASH_STEP;
case 4: HASH_STEP;
case 3: HASH_STEP;
case 2: HASH_STEP;
case 1: HASH_STEP;
case 0: ;
}
while (len >= 8);
}
#endif
return hash;
}
/*
* djb2 (see http://www.cse.yorku.ca/~oz/hash.html)
*/
zbx_hash_t zbx_hash_djb2(const void *data, size_t len, zbx_hash_t seed)
{
const uchar *p = (const uchar *)data;
zbx_hash_t hash;
hash = 5381u ^ seed;
while (len-- >= 1)
{
/* hash = hash * 33 + *(p++); */
hash = ((hash << 5) + hash) + *(p++);
}
return hash;
}
/*
* see http://xoshiro.di.unimi.it/splitmix64.c
*/
zbx_hash_t zbx_hash_splittable64(const void *data)
{
zbx_uint64_t value = *(const zbx_uint64_t *)data;
value ^= value >> 30;
value *= __UINT64_C(0xbf58476d1ce4e5b9);
value ^= value >> 27;
value *= __UINT64_C(0x94d049bb133111eb);
value ^= value >> 31;
return (zbx_hash_t)value ^ (value >> 32);
}
/* default hash functions */
zbx_hash_t zbx_default_ptr_hash_func(const void *data)
{
return ZBX_DEFAULT_PTR_HASH_ALGO(data, ZBX_PTR_SIZE, ZBX_DEFAULT_HASH_SEED);
}
zbx_hash_t zbx_default_string_hash_func(const void *data)
{
return ZBX_DEFAULT_STRING_HASH_ALGO(data, strlen((const char *)data), ZBX_DEFAULT_HASH_SEED);
}
zbx_hash_t zbx_default_uint64_pair_hash_func(const void *data)
{
const zbx_uint64_pair_t *pair = (const zbx_uint64_pair_t *)data;
zbx_hash_t hash;
hash = ZBX_DEFAULT_UINT64_HASH_FUNC(&pair->first);
hash = ZBX_DEFAULT_UINT64_HASH_ALGO(&pair->second, sizeof(pair->second), hash);
return hash;
}
/* default comparison functions */
int zbx_default_int_compare_func(const void *d1, const void *d2)
{
const int *i1 = (const int *)d1;
const int *i2 = (const int *)d2;
ZBX_RETURN_IF_NOT_EQUAL(*i1, *i2);
return 0;
}
int zbx_default_uint64_compare_func(const void *d1, const void *d2)
{
const zbx_uint64_t *i1 = (const zbx_uint64_t *)d1;
const zbx_uint64_t *i2 = (const zbx_uint64_t *)d2;
ZBX_RETURN_IF_NOT_EQUAL(*i1, *i2);
return 0;
}
int zbx_default_uint64_ptr_compare_func(const void *d1, const void *d2)
{
const zbx_uint64_t *p1 = *(const zbx_uint64_t **)d1;
const zbx_uint64_t *p2 = *(const zbx_uint64_t **)d2;
return zbx_default_uint64_compare_func(p1, p2);
}
int zbx_default_str_compare_func(const void *d1, const void *d2)
{
return strcmp(*(const char **)d1, *(const char **)d2);
}
int zbx_default_ptr_compare_func(const void *d1, const void *d2)
{
const void *p1 = *(const void **)d1;
const void *p2 = *(const void **)d2;
ZBX_RETURN_IF_NOT_EQUAL(p1, p2);
return 0;
}
int zbx_default_uint64_pair_compare_func(const void *d1, const void *d2)
{
const zbx_uint64_pair_t *p1 = (const zbx_uint64_pair_t *)d1;
const zbx_uint64_pair_t *p2 = (const zbx_uint64_pair_t *)d2;
ZBX_RETURN_IF_NOT_EQUAL(p1->first, p2->first);
ZBX_RETURN_IF_NOT_EQUAL(p1->second, p2->second);
return 0;
}
int zbx_default_dbl_compare_func(const void *d1, const void *d2)
{
const double *p1 = (const double *)d1;
const double *p2 = (const double *)d2;
ZBX_RETURN_IF_DBL_NOT_EQUAL(*p1, *p2);
return 0;
}
/* default memory management functions */
void *zbx_default_mem_malloc_func(void *old, size_t size)
{
return zbx_malloc(old, size);
}
void *zbx_default_mem_realloc_func(void *old, size_t size)
{
return zbx_realloc(old, size);
}
void zbx_default_mem_free_func(void *ptr)
{
zbx_free(ptr);
}
/* numeric functions */
int is_prime(int n)
{
int i;
if (n <= 1)
return 0;
if (n == 2)
return 1;
if (n % 2 == 0)
return 0;
for (i = 3; i * i <= n; i+=2)
if (n % i == 0)
return 0;
return 1;
}
int next_prime(int n)
{
while (!is_prime(n))
n++;
return n;
}
/******************************************************************************
* *
* Function: zbx_isqrt32 *
* *
* Purpose: calculate integer part of square root of a 32 bit integer value *
* *
* Parameters: value - [IN] the value to calculate square root for *
* *
* Return value: the integer part of square root *
* *
* Comments: Uses basic digit by digit square root calculation algorithm with *
* binary base. *
* *
******************************************************************************/
unsigned int zbx_isqrt32(unsigned int value)
{
unsigned int i, remainder = 0, result = 0, p;
for (i = 0; i < 16; i++)
{
result <<= 1;
remainder = (remainder << 2) + (value >> 30);
value <<= 2;
p = (result << 1) | 1;
if (p <= remainder)
{
remainder -= p;
result |= 1;
}
}
return result;
}
/******************************************************************************
* *
* Function: zbx_gen_uuid4 *
* *
* Purpose: calculate UUID version 4 as string of 32 symbols *
* *
* Parameters: seed - [IN] string for seed calculation *
* *
* Return value: uuid string *
* *
******************************************************************************/
char *zbx_gen_uuid4(const char *seed)
{
size_t i;
const char *hex = "0123456789abcdef";
char *ptr, *uuid;
md5_state_t state;
md5_byte_t hash[MD5_DIGEST_SIZE];
#define ZBX_UUID_VERSION 4
#define ZBX_UUID_VARIANT 2
ptr = uuid = (char *)zbx_malloc(NULL, 2 * MD5_DIGEST_SIZE + 1);
zbx_md5_init(&state);
zbx_md5_append(&state, (const md5_byte_t *)seed, (int)strlen(seed));
zbx_md5_finish(&state, hash);
hash[6] = (md5_byte_t)((hash[6] & 0xf) | (ZBX_UUID_VERSION << 4));
hash[8] = (md5_byte_t)((hash[8] & 0x3f) | (ZBX_UUID_VARIANT << 6));
for (i = 0; i < MD5_DIGEST_SIZE; i++)
{
*ptr++ = hex[(hash[i] >> 4) & 0xf];
*ptr++ = hex[hash[i] & 0xf];
}
*ptr = '\0';
return uuid;
}
|