1 | #include "globals.h"
|
---|
2 | #include "oscam-string.h"
|
---|
3 |
|
---|
4 | /* This function encapsulates malloc. It automatically adds an error message
|
---|
5 | to the log if it failed and calls cs_exit(quiterror) if quiterror > -1.
|
---|
6 | result will be automatically filled with the new memory position or NULL
|
---|
7 | on failure. */
|
---|
8 | bool cs_malloc(void *result, size_t size)
|
---|
9 | {
|
---|
10 | void **tmp = result;
|
---|
11 | *tmp = malloc(size);
|
---|
12 | if (*tmp == NULL) {
|
---|
13 | fprintf(stderr, "%s: ERROR: Can't allocate %zu bytes!", __func__, size);
|
---|
14 | } else {
|
---|
15 | memset(*tmp, 0, size);
|
---|
16 | }
|
---|
17 | return !!*tmp;
|
---|
18 | }
|
---|
19 |
|
---|
20 | /* This function encapsulates realloc. It automatically adds an error message
|
---|
21 | to the log if it failed and calls cs_exit(quiterror) if quiterror > -1.
|
---|
22 | result will be automatically filled with the new memory position or NULL
|
---|
23 | on failure. If a failure occured, the existing memory in result will
|
---|
24 | be freed. */
|
---|
25 | bool cs_realloc(void *result, size_t size)
|
---|
26 | {
|
---|
27 | void **tmp = result, **tmp2 = result;
|
---|
28 | *tmp = realloc(*tmp, size);
|
---|
29 | if (*tmp == NULL) {
|
---|
30 | fprintf(stderr, "%s: ERROR: Can't allocate %zu bytes!", __func__, size);
|
---|
31 | free(*tmp2);
|
---|
32 | }
|
---|
33 | return !!*tmp;
|
---|
34 | }
|
---|
35 |
|
---|
36 | /* Allocates a new empty string and copies str into it. You need to free() the result. */
|
---|
37 | char *cs_strdup(const char *str)
|
---|
38 | {
|
---|
39 | char *newstr;
|
---|
40 | if (!str)
|
---|
41 | return NULL;
|
---|
42 | if (cs_malloc(&newstr, strlen(str) + 1)) {
|
---|
43 | strncpy(newstr, str, strlen(str));
|
---|
44 | return newstr;
|
---|
45 | }
|
---|
46 | return NULL;
|
---|
47 | }
|
---|
48 |
|
---|
49 | /* Ordinary strncpy does not terminate the string if the source is exactly
|
---|
50 | as long or longer as the specified size. This can raise security issues.
|
---|
51 | This function is a replacement which makes sure that a \0 is always added.
|
---|
52 | num should be the real size of char array (do not subtract -1). */
|
---|
53 | void cs_strncpy(char *destination, const char *source, size_t num)
|
---|
54 | {
|
---|
55 | if (!source) {
|
---|
56 | destination[0] = '\0';
|
---|
57 | return;
|
---|
58 | }
|
---|
59 | uint32_t l, size = strlen(source);
|
---|
60 | if (size > num - 1)
|
---|
61 | l = num - 1;
|
---|
62 | else
|
---|
63 | l = size;
|
---|
64 | memcpy(destination, source, l);
|
---|
65 | destination[l] = '\0';
|
---|
66 | }
|
---|
67 |
|
---|
68 | /* Converts the string txt to it's lower case representation. */
|
---|
69 | char *strtolower(char *txt) {
|
---|
70 | char *p;
|
---|
71 | for (p = txt; *p; p++) {
|
---|
72 | if (isupper((uchar)*p))
|
---|
73 | *p = tolower((uchar)*p);
|
---|
74 | }
|
---|
75 | return txt;
|
---|
76 | }
|
---|
77 |
|
---|
78 | /* Converts the string txt to it's upper case representation. */
|
---|
79 | char *strtoupper(char *txt) {
|
---|
80 | char *p;
|
---|
81 | for (p = txt; *p; p++) {
|
---|
82 | if (islower((uchar)*p))
|
---|
83 | *p = toupper((uchar)*p);
|
---|
84 | }
|
---|
85 | return txt;
|
---|
86 | }
|
---|
87 |
|
---|
88 | char *trim(char *txt)
|
---|
89 | {
|
---|
90 | int32_t l;
|
---|
91 | char *p1, *p2;
|
---|
92 | if (*txt == ' ') {
|
---|
93 | for (p1=p2=txt; (*p1==' ') || (*p1=='\t') || (*p1=='\n') || (*p1=='\r'); p1++)
|
---|
94 | ;
|
---|
95 | while (*p1)
|
---|
96 | *p2++ = *p1++;
|
---|
97 | *p2 = '\0';
|
---|
98 | }
|
---|
99 | l = strlen(txt);
|
---|
100 | if (l > 0) {
|
---|
101 | for (p1 = txt + l - 1; l > 0 && ((*p1==' ') || (*p1=='\t') || (*p1=='\n') || (*p1=='\r')); *p1--='\0', l--)
|
---|
102 | ;
|
---|
103 | }
|
---|
104 | return txt;
|
---|
105 | }
|
---|
106 |
|
---|
107 | char *remove_white_chars(char *txt) {
|
---|
108 |
|
---|
109 | char *p1 = txt, *p2 = txt;
|
---|
110 |
|
---|
111 | if(NULL != p1) {
|
---|
112 | while('\0' != *p1) {
|
---|
113 | if((' ' != *p1) && ('\t' != *p1) &&
|
---|
114 | ('\n' != *p1) && ('\r' != *p1)) {
|
---|
115 | *p2++ = *p1;
|
---|
116 | }
|
---|
117 | p1++;
|
---|
118 | }
|
---|
119 | *p2 = '\0';
|
---|
120 | }
|
---|
121 | return txt;
|
---|
122 | }
|
---|
123 |
|
---|
124 | bool streq(const char *s1, const char *s2)
|
---|
125 | {
|
---|
126 | if (!s1 && s2) return 0;
|
---|
127 | if (s1 && !s2) return 0;
|
---|
128 | if (!s1 && !s2) return 1;
|
---|
129 | return strcmp(s1, s2) == 0;
|
---|
130 | }
|
---|
131 |
|
---|
132 | char *cs_hexdump(int32_t m, const uchar *buf, int32_t n, char *target, int32_t len)
|
---|
133 | {
|
---|
134 | int32_t i = 0;
|
---|
135 | target[0] = '\0';
|
---|
136 | m = m ? 3 : 2;
|
---|
137 | if (m * n >= len)
|
---|
138 | n = (len / m) - 1;
|
---|
139 | while (i < n) {
|
---|
140 | snprintf(target + (m * i), len - (m * i), "%02X%s", *buf++, m > 2 ? " " : "");
|
---|
141 | i++;
|
---|
142 | }
|
---|
143 | return target;
|
---|
144 | }
|
---|
145 |
|
---|
146 | int32_t gethexval(char c)
|
---|
147 | {
|
---|
148 | if (c >= '0' && c <= '9') return c - '0';
|
---|
149 | if (c >= 'A' && c <= 'F') return c - 'A' + 10;
|
---|
150 | if (c >= 'a' && c <= 'f') return c - 'a' + 10;
|
---|
151 | return -1;
|
---|
152 | }
|
---|
153 |
|
---|
154 | int32_t cs_atob(uchar *buf, char *asc, int32_t n)
|
---|
155 | {
|
---|
156 | int32_t i, rc;
|
---|
157 | for (i = 0; i < n; i++) {
|
---|
158 | rc = (gethexval(asc[i<<1]) << 4) | gethexval(asc[(i <<1 ) + 1]);
|
---|
159 | if (rc & 0x100)
|
---|
160 | return -1;
|
---|
161 | buf[i] = rc;
|
---|
162 | }
|
---|
163 | return n;
|
---|
164 | }
|
---|
165 |
|
---|
166 | uint32_t cs_atoi(char *asc, int32_t l, int32_t val_on_err)
|
---|
167 | {
|
---|
168 | int32_t i, n = 0;
|
---|
169 | uint32_t rc = 0;
|
---|
170 | for (i = ((l-1) << 1), errno = 0; i >= 0 && n < 4; i -= 2) {
|
---|
171 | int32_t b = (gethexval(asc[i]) << 4) | gethexval(asc[i+1]);
|
---|
172 | if (b < 0) {
|
---|
173 | errno = EINVAL;
|
---|
174 | rc = val_on_err ? 0xFFFFFFFF : 0;
|
---|
175 | break;
|
---|
176 | }
|
---|
177 | rc |= b << (n << 3);
|
---|
178 | n++;
|
---|
179 | }
|
---|
180 | return rc;
|
---|
181 | }
|
---|
182 |
|
---|
183 | int32_t byte_atob(char *asc)
|
---|
184 | {
|
---|
185 | int32_t rc;
|
---|
186 | if (strlen(trim(asc)) != 2) {
|
---|
187 | rc = -1;
|
---|
188 | } else {
|
---|
189 | rc = (gethexval(asc[0]) << 4) | gethexval(asc[1]);
|
---|
190 | if (rc & 0x100)
|
---|
191 | rc = -1;
|
---|
192 | }
|
---|
193 | return rc;
|
---|
194 | }
|
---|
195 |
|
---|
196 | int32_t word_atob(char *asc)
|
---|
197 | {
|
---|
198 | int32_t rc;
|
---|
199 | if (strlen(trim(asc)) != 4) {
|
---|
200 | rc = -1;
|
---|
201 | } else {
|
---|
202 | rc = gethexval(asc[0]) << 12 | gethexval(asc[1]) << 8 |
|
---|
203 | gethexval(asc[2]) << 4 | gethexval(asc[3]);
|
---|
204 | if (rc & 0x10000)
|
---|
205 | rc = -1;
|
---|
206 | }
|
---|
207 | return rc;
|
---|
208 | }
|
---|
209 |
|
---|
210 | /*
|
---|
211 | * dynamic word_atob
|
---|
212 | * converts an 1-4 digit asc hexstring
|
---|
213 | */
|
---|
214 | int32_t dyn_word_atob(char *asc)
|
---|
215 | {
|
---|
216 | int32_t rc = (-1);
|
---|
217 | int32_t i, len = strlen(trim(asc));
|
---|
218 | if (len <= 4 && len > 0) {
|
---|
219 | for (i = 0, rc = 0; i < len; i++) {
|
---|
220 | rc = rc << 4 | gethexval(asc[i]);
|
---|
221 | }
|
---|
222 | if (rc & 0x10000)
|
---|
223 | rc = -1;
|
---|
224 | }
|
---|
225 | return rc;
|
---|
226 | }
|
---|
227 |
|
---|
228 | int32_t key_atob_l(char *asc, uchar *bin, int32_t l)
|
---|
229 | {
|
---|
230 | int32_t i, n1, n2, rc;
|
---|
231 | for (i = rc = 0; i < l; i += 2) {
|
---|
232 | if ((n1 = gethexval(asc[i ])) < 0) rc = -1;
|
---|
233 | if ((n2 = gethexval(asc[i+1])) < 0) rc = -1;
|
---|
234 | bin[i >> 1] = (n1 << 4) + (n2 & 0xff);
|
---|
235 | }
|
---|
236 | return rc;
|
---|
237 | }
|
---|
238 |
|
---|
239 | uint32_t b2i(int32_t n, const uchar *b)
|
---|
240 | {
|
---|
241 | switch(n) {
|
---|
242 | case 2: return (b[0] << 8) | b[1];
|
---|
243 | case 3: return (b[0] << 16) | (b[1] << 8) | b[2];
|
---|
244 | case 4: return ((b[0] << 24) | (b[1] << 16) | (b[2] <<8 ) | b[3]) & 0xffffffffL;
|
---|
245 | default: cs_log("Error in b2i, n=%i",n);
|
---|
246 | }
|
---|
247 | return 0;
|
---|
248 | }
|
---|
249 |
|
---|
250 | uint64_t b2ll(int32_t n, uchar *b)
|
---|
251 | {
|
---|
252 | int32_t i;
|
---|
253 | uint64_t k = 0;
|
---|
254 | for (i = 0; i < n; k += b[i++])
|
---|
255 | k <<= 8;
|
---|
256 | return k;
|
---|
257 | }
|
---|
258 |
|
---|
259 | uchar *i2b_buf(int32_t n, uint32_t i, uchar *b)
|
---|
260 | {
|
---|
261 | switch(n) {
|
---|
262 | case 2:
|
---|
263 | b[0] = (i>> 8) & 0xff;
|
---|
264 | b[1] = (i ) & 0xff;
|
---|
265 | break;
|
---|
266 | case 3:
|
---|
267 | b[0] = (i>>16) & 0xff;
|
---|
268 | b[1] = (i>> 8) & 0xff;
|
---|
269 | b[2] = (i ) & 0xff;
|
---|
270 | case 4:
|
---|
271 | b[0] = (i>>24) & 0xff;
|
---|
272 | b[1] = (i>>16) & 0xff;
|
---|
273 | b[2] = (i>> 8) & 0xff;
|
---|
274 | b[3] = (i ) & 0xff;
|
---|
275 | break;
|
---|
276 | }
|
---|
277 | return b;
|
---|
278 | }
|
---|
279 |
|
---|
280 | uint32_t a2i(char *asc, int32_t bytes)
|
---|
281 | {
|
---|
282 | int32_t i, n;
|
---|
283 | uint32_t rc;
|
---|
284 | for (rc = i = 0, n = strlen(trim(asc)) - 1; i < abs(bytes) << 1; n--, i++) {
|
---|
285 | if (n >= 0) {
|
---|
286 | int32_t rcl;
|
---|
287 | if ((rcl = gethexval(asc[n])) < 0) {
|
---|
288 | errno = EINVAL;
|
---|
289 | return 0x1f1f1f;
|
---|
290 | }
|
---|
291 | rc |= rcl << (i << 2);
|
---|
292 | } else {
|
---|
293 | if (bytes < 0)
|
---|
294 | rc |= 0xf << (i << 2);
|
---|
295 | }
|
---|
296 | }
|
---|
297 | errno = 0;
|
---|
298 | return rc;
|
---|
299 | }
|
---|
300 |
|
---|
301 | int32_t boundary(int32_t exp, int32_t n)
|
---|
302 | {
|
---|
303 | return (((n-1) >> exp) + 1) << exp;
|
---|
304 | }
|
---|
305 |
|
---|
306 | /* Checks an array if it is filled (a value > 0) and number of filled bytes.
|
---|
307 | length specifies the maximum length to check for. */
|
---|
308 | int32_t check_filled(uchar *value, int32_t length)
|
---|
309 | {
|
---|
310 | if (!value)
|
---|
311 | return 0;
|
---|
312 | int32_t i, j = 0;
|
---|
313 | for (i = 0; i < length; ++i){
|
---|
314 | if (value[i] > 0)
|
---|
315 | j++;
|
---|
316 | }
|
---|
317 | return j;
|
---|
318 | }
|
---|
319 |
|
---|
320 | #define RAND_POOL_SIZE 64
|
---|
321 |
|
---|
322 | // The last bytes are used to init random seed
|
---|
323 | static uint8_t rand_pool[RAND_POOL_SIZE + sizeof(uint32_t)];
|
---|
324 |
|
---|
325 | void get_random_bytes_init(void) {
|
---|
326 | srand(time(NULL));
|
---|
327 | int fd = open("/dev/urandom", O_RDONLY);
|
---|
328 | if (fd < 0) {
|
---|
329 | fd = open("/dev/random", O_RDONLY);
|
---|
330 | if (fd < 0)
|
---|
331 | return;
|
---|
332 | }
|
---|
333 | if (read(fd, rand_pool, RAND_POOL_SIZE + sizeof(uint32_t)) > -1) {
|
---|
334 | uint32_t *pool_seed = (uint32_t *)rand_pool + RAND_POOL_SIZE;
|
---|
335 | srand(*pool_seed);
|
---|
336 | }
|
---|
337 | close(fd);
|
---|
338 | }
|
---|
339 |
|
---|
340 | void get_random_bytes(uint8_t *dst, uint32_t dst_len) {
|
---|
341 | static uint32_t rand_pool_pos; // *MUST* be static
|
---|
342 | uint32_t i;
|
---|
343 | for (i = 0; i < dst_len; i++) {
|
---|
344 | rand_pool_pos++; // Races are welcome...
|
---|
345 | dst[i] = rand() ^ rand_pool[rand_pool_pos % RAND_POOL_SIZE];
|
---|
346 | }
|
---|
347 | }
|
---|
348 |
|
---|
349 | static unsigned long crc_table[256] = {
|
---|
350 | 0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L,
|
---|
351 | 0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L,
|
---|
352 | 0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L,
|
---|
353 | 0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL,
|
---|
354 | 0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L,
|
---|
355 | 0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L,
|
---|
356 | 0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L,
|
---|
357 | 0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL,
|
---|
358 | 0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L,
|
---|
359 | 0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL,
|
---|
360 | 0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L,
|
---|
361 | 0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L,
|
---|
362 | 0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L,
|
---|
363 | 0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL,
|
---|
364 | 0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL,
|
---|
365 | 0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L,
|
---|
366 | 0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL,
|
---|
367 | 0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L,
|
---|
368 | 0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L,
|
---|
369 | 0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L,
|
---|
370 | 0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL,
|
---|
371 | 0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L,
|
---|
372 | 0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L,
|
---|
373 | 0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL,
|
---|
374 | 0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L,
|
---|
375 | 0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L,
|
---|
376 | 0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L,
|
---|
377 | 0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L,
|
---|
378 | 0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L,
|
---|
379 | 0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL,
|
---|
380 | 0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL,
|
---|
381 | 0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L,
|
---|
382 | 0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L,
|
---|
383 | 0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL,
|
---|
384 | 0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL,
|
---|
385 | 0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L,
|
---|
386 | 0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL,
|
---|
387 | 0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L,
|
---|
388 | 0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL,
|
---|
389 | 0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L,
|
---|
390 | 0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL,
|
---|
391 | 0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L,
|
---|
392 | 0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L,
|
---|
393 | 0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL,
|
---|
394 | 0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L,
|
---|
395 | 0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L,
|
---|
396 | 0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L,
|
---|
397 | 0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L,
|
---|
398 | 0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L,
|
---|
399 | 0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L,
|
---|
400 | 0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL,
|
---|
401 | 0x2d02ef8dL
|
---|
402 | };
|
---|
403 |
|
---|
404 | /*
|
---|
405 | * crc32 -- compute the CRC-32 of a data stream
|
---|
406 | * Copyright (C) 1995-1996 Mark Adler
|
---|
407 | * For conditions of distribution and use, see copyright notice in zlib.h
|
---|
408 | */
|
---|
409 | #define DO1(buf) crc = crc_table[((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8);
|
---|
410 | #define DO2(buf) DO1(buf); DO1(buf);
|
---|
411 | #define DO4(buf) DO2(buf); DO2(buf);
|
---|
412 | #define DO8(buf) DO4(buf); DO4(buf);
|
---|
413 |
|
---|
414 | unsigned long crc32(unsigned long crc, const unsigned char *buf, unsigned int len)
|
---|
415 | {
|
---|
416 | if (!buf)
|
---|
417 | return 0L;
|
---|
418 | crc = crc ^ 0xffffffffL;
|
---|
419 | while (len >= 8) {
|
---|
420 | DO8(buf);
|
---|
421 | len -= 8;
|
---|
422 | }
|
---|
423 | if (len) {
|
---|
424 | do {
|
---|
425 | DO1(buf);
|
---|
426 | } while (--len);
|
---|
427 | }
|
---|
428 | return crc ^ 0xffffffffL;
|
---|
429 | }
|
---|
430 |
|
---|
431 | // https://en.wikipedia.org/wiki/Jenkins_hash_function
|
---|
432 | uint32_t jhash(const char *key, size_t len) {
|
---|
433 | uint32_t hash, i;
|
---|
434 | for (hash = i = 0; i < len; i++) {
|
---|
435 | hash += key[i];
|
---|
436 | hash += (hash << 10);
|
---|
437 | hash ^= (hash >> 6);
|
---|
438 | }
|
---|
439 | hash += (hash << 3);
|
---|
440 | hash ^= (hash >> 11);
|
---|
441 | hash += (hash << 15);
|
---|
442 | return hash;
|
---|
443 | }
|
---|
444 |
|
---|
445 | /* Converts a char to it's hex representation. See char_to_hex on how to use it. */
|
---|
446 | char to_hex(char code)
|
---|
447 | {
|
---|
448 | static const char hex[] = "0123456789abcdef";
|
---|
449 | return hex[(int)code & 15];
|
---|
450 | }
|
---|
451 |
|
---|
452 | /* Converts a char array to a char array with hex values (needed for example for md5).
|
---|
453 | Note that result needs to be at least (p_array_len * 2) + 1 large. */
|
---|
454 | void char_to_hex(const unsigned char *p_array, uint32_t p_array_len, unsigned char *result)
|
---|
455 | {
|
---|
456 | result[p_array_len * 2] = '\0';
|
---|
457 | const unsigned char *p_end = p_array + p_array_len;
|
---|
458 | uint32_t pos = 0;
|
---|
459 | const unsigned char* p;
|
---|
460 | for (p = p_array; p != p_end; p++, pos+=2 ) {
|
---|
461 | result[pos ] = to_hex(*p >> 4);
|
---|
462 | result[pos + 1] = to_hex(*p & 15);
|
---|
463 | }
|
---|
464 | }
|
---|