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
|
/******************************************************************************
* qLibc
*
* Copyright (c) 2010-2014 Seungyoung Kim.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*****************************************************************************/
/**
* @file qhash.c Hash APIs.
*/
/*
* Modified parts of this file by XS Embedded GmbH, 2014
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <stdint.h>
#include <string.h>
#include <unistd.h>
#include <fcntl.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/stat.h>
#include "md5.h"
#include "qhash.h"
/**
* Calculate 128-bit(16-bytes) MD5 hash.
*
* @param data source object
* @param nbytes size of data
* @param retbuf user buffer. It must be at leat 16-bytes long.
*
* @return true if successful, otherwise false.
*
* @code
* // get MD5
* unsigned char md5hash[16];
* qhashmd5((void*)"hello", 5, md5hash);
*
* // hex encode
* char *md5ascii = qhex_encode(md5hash, 16);
* printf("Hex encoded MD5: %s\n", md5ascii);
* free(md5ascii);
* @endcode
*/
bool qhashmd5(const void *data, size_t nbytes, void *retbuf) {
if (data == NULL || retbuf == NULL) {
errno = EINVAL;
return false;
}
MD5_CTX context;
MD5Init(&context);
MD5Update(&context, (unsigned char *) data, (unsigned int) nbytes);
MD5Final(retbuf, &context);
return true;
}
/**
* Get 32-bit Murmur3 hash.
*
* @param data source data
* @param nbytes size of data
*
* @return 32-bit unsigned hash value.
*
* @code
* uint32_t hashval = qhashmurmur3_32((void*)"hello", 5);
* @endcode
*
* @code
* MurmurHash3 was created by Austin Appleby in 2008. The initial
* implementation was published in C++ and placed in the public.
* https://sites.google.com/site/murmurhash/
* Seungyoung Kim has ported its implementation into C language
* in 2012 and published it as a part of qLibc component.
* @endcode
*/
uint32_t qhashmurmur3_32(const void *data, size_t nbytes) {
if (data == NULL || nbytes == 0)
return 0;
const uint32_t c1 = 0xcc9e2d51;
const uint32_t c2 = 0x1b873593;
const int nblocks = nbytes / 4;
const uint32_t *blocks = (const uint32_t *) (data);
const uint8_t *tail = (const uint8_t *) (data + (nblocks * 4));
uint32_t h = 0;
int i;
uint32_t k;
for (i = 0; i < nblocks; i++) {
k = blocks[i];
k *= c1;
k = (k << 15) | (k >> (32 - 15));
k *= c2;
h ^= k;
h = (h << 13) | (h >> (32 - 13));
h = (h * 5) + 0xe6546b64;
}
k = 0;
switch (nbytes & 3) {
case 3:
k ^= tail[2] << 16;
case 2:
k ^= tail[1] << 8;
case 1:
k ^= tail[0];
k *= c1;
k = (k << 15) | (k >> (32 - 15));
k *= c2;
h ^= k;
};
h ^= nbytes;
h ^= h >> 16;
h *= 0x85ebca6b;
h ^= h >> 13;
h *= 0xc2b2ae35;
h ^= h >> 16;
return h;
}
|
