DGNum/libubox
6
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

remove hash.[ch] - i don't think we will need it

Browse source
This commit is contained in:
Felix Fietkau 2011-02-06 17:20:46 +01:00
parent 02074ab521
commit c9e852301b
3 changed files with 1 additions and 63 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
CMakeLists.txt
View file

@ -8,7 +8,7 @@ IF(APPLE)
LINK_DIRECTORIES(/opt/local/lib)
ENDIF()
SET(SOURCES avl.c blob.c blobmsg.c hash.c uloop.c usock.c)
SET(SOURCES avl.c blob.c blobmsg.c uloop.c usock.c)
ADD_LIBRARY(ubox SHARED ${SOURCES})
ADD_LIBRARY(blobmsg_json SHARED blobmsg_json.c)

54
hash.c
View file

@ -1,54 +0,0 @@
#include <stdint.h>
#include <stdlib.h>
#include "hash.h"
//-----------------------------------------------------------------------------
// MurmurHashNeutral2, by Austin Appleby
// Same as MurmurHash2, but endian- and alignment-neutral.
uint32_t hash_murmur2(const void * key, int len)
{
const unsigned int seed = 0xdeadc0de;
const unsigned int m = 0x5bd1e995;
const int r = 24;
unsigned int h = seed ^ len;
const unsigned char * data = (const unsigned char *)key;
while(len >= 4)
{
unsigned int k;
k = data[0];
k |= data[1] << 8;
k |= data[2] << 16;
k |= data[3] << 24;
k *= m;
k ^= k >> r;
k *= m;
h *= m;
h ^= k;
data += 4;
len -= 4;
}
switch(len)
{
case 3: h ^= data[2] << 16;
case 2: h ^= data[1] << 8;
case 1: h ^= data[0];
h *= m;
};
h ^= h >> 13;
h *= m;
h ^= h >> 15;
return h;
}

8
hash.h
View file

@ -1,8 +0,0 @@
#ifndef _HASH_H__
#define _HASH_H__
#include <stdint.h>
uint32_t hash_murmur2(const void * key, int len);
#endif