File Manager

003 File Manager

Current Path: /usr/src/contrib/jemalloc/include/jemalloc/internal

usr / src / contrib / jemalloc / include / jemalloc / internal /

📁 ..
📄 arena_externs.h(4.83 KB)
📄 arena_inlines_a.h(1.44 KB)
📄 arena_inlines_b.h(11.54 KB)
📄 arena_stats.h(7.92 KB)
📄 arena_structs_a.h(293 B)
📄 arena_structs_b.h(6.63 KB)
📄 arena_types.h(1.67 KB)
📄 assert.h(1.3 KB)
📄 atomic.h(2.66 KB)
📄 atomic_c11.h(3.46 KB)
📄 atomic_gcc_atomic.h(4.06 KB)
📄 atomic_gcc_sync.h(6.21 KB)
📄 background_thread_externs.h(1.29 KB)
📄 background_thread_inlines.h(2.09 KB)
📄 background_thread_structs.h(1.74 KB)
📄 base_externs.h(946 B)
📄 base_inlines.h(312 B)
📄 base_structs.h(1.52 KB)
📄 base_types.h(1.08 KB)
📄 bin.h(3.6 KB)
📄 bin_stats.h(1.35 KB)
📄 bin_types.h(474 B)
📄 bit_util.h(5.22 KB)
📄 bitmap.h(10.97 KB)
📄 cache_bin.h(3.69 KB)
📄 ckh.h(3.19 KB)
📄 ctl.h(3.62 KB)
📄 div.h(1.14 KB)
📄 emitter.h(13.06 KB)
📄 extent_dss.h(728 B)
📄 extent_externs.h(3.75 KB)
📄 extent_inlines.h(13.4 KB)
📄 extent_mmap.h(328 B)
📄 extent_structs.h(8.46 KB)
📄 extent_types.h(700 B)
📄 hash.h(7.88 KB)
📄 hook.h(5.41 KB)
📄 jemalloc_internal_decls.h(2.19 KB)
📄 jemalloc_internal_defs.h(10.93 KB)
📄 jemalloc_internal_defs_FreeBSD.h(256 B)
📄 jemalloc_internal_externs.h(1.75 KB)
📄 jemalloc_internal_includes.h(4.19 KB)
📄 jemalloc_internal_inlines_a.h(4.39 KB)
📄 jemalloc_internal_inlines_b.h(2.24 KB)
📄 jemalloc_internal_inlines_c.h(7.08 KB)
📄 jemalloc_internal_macros.h(3.99 KB)
📄 jemalloc_internal_types.h(3.42 KB)
📄 jemalloc_preamble.h(3.9 KB)
📄 large_externs.h(1.4 KB)
📄 log.h(3.67 KB)
📄 malloc_io.h(2.9 KB)
📄 mutex.h(9.34 KB)
📄 mutex_pool.h(2.81 KB)
📄 mutex_prof.h(3.55 KB)
📄 nstime.h(1.27 KB)
📄 pages.h(3.05 KB)
📄 ph.h(12.26 KB)
📄 private_namespace.h(22.72 KB)
📄 prng.h(4.69 KB)
📄 prof_externs.h(3.79 KB)
📄 prof_inlines_a.h(2.44 KB)
📄 prof_inlines_b.h(6.42 KB)
📄 prof_structs.h(5.02 KB)
📄 prof_types.h(1.74 KB)
📄 public_namespace.h(1.03 KB)
📄 ql.h(2.45 KB)
📄 qr.h(2.29 KB)
📄 quantum.h(1.75 KB)
📄 rb.h(37.41 KB)
📄 rtree.h(17.01 KB)
📄 rtree_tsd.h(1.82 KB)
📄 safety_check.h(797 B)
📄 sc.h(12.98 KB)
📄 seq.h(1.81 KB)
📄 smoothstep.h(15.26 KB)
📄 spin.h(613 B)
📄 stats.h(998 B)
📄 sz.h(7.96 KB)
📄 tcache_externs.h(2.09 KB)
📄 tcache_inlines.h(5.73 KB)
📄 tcache_structs.h(2.05 KB)
📄 tcache_types.h(2.01 KB)
📄 test_hooks.h(459 B)
📄 ticker.h(2.21 KB)
📄 tsd.h(12.49 KB)
📄 tsd_generic.h(3.76 KB)
📄 tsd_malloc_thread_cleanup.h(1.19 KB)
📄 tsd_tls.h(1.12 KB)
📄 tsd_types.h(258 B)
📄 util.h(1.43 KB)
📄 witness.h(9.32 KB)

Editing: hash.h

#ifndef JEMALLOC_INTERNAL_HASH_H
#define JEMALLOC_INTERNAL_HASH_H

#include "jemalloc/internal/assert.h"

/*
 * The following hash function is based on MurmurHash3, placed into the public
 * domain by Austin Appleby.  See https://github.com/aappleby/smhasher for
 * details.
 */

/******************************************************************************/
/* Internal implementation. */
static inline uint32_t
hash_rotl_32(uint32_t x, int8_t r) {
	return ((x << r) | (x >> (32 - r)));
}

static inline uint64_t
hash_rotl_64(uint64_t x, int8_t r) {
	return ((x << r) | (x >> (64 - r)));
}

static inline uint32_t
hash_get_block_32(const uint32_t *p, int i) {
	/* Handle unaligned read. */
	if (unlikely((uintptr_t)p & (sizeof(uint32_t)-1)) != 0) {
		uint32_t ret;

memcpy(&ret, (uint8_t *)(p + i), sizeof(uint32_t));
		return ret;
	}

return p[i];
}

static inline uint64_t
hash_get_block_64(const uint64_t *p, int i) {
	/* Handle unaligned read. */
	if (unlikely((uintptr_t)p & (sizeof(uint64_t)-1)) != 0) {
		uint64_t ret;

memcpy(&ret, (uint8_t *)(p + i), sizeof(uint64_t));
		return ret;
	}

return p[i];
}

static inline uint32_t
hash_fmix_32(uint32_t h) {
	h ^= h >> 16;
	h *= 0x85ebca6b;
	h ^= h >> 13;
	h *= 0xc2b2ae35;
	h ^= h >> 16;

return h;
}

static inline uint64_t
hash_fmix_64(uint64_t k) {
	k ^= k >> 33;
	k *= KQU(0xff51afd7ed558ccd);
	k ^= k >> 33;
	k *= KQU(0xc4ceb9fe1a85ec53);
	k ^= k >> 33;

return k;
}

static inline uint32_t
hash_x86_32(const void *key, int len, uint32_t seed) {
	const uint8_t *data = (const uint8_t *) key;
	const int nblocks = len / 4;

uint32_t h1 = seed;

const uint32_t c1 = 0xcc9e2d51;
	const uint32_t c2 = 0x1b873593;

/* body */
	{
		const uint32_t *blocks = (const uint32_t *) (data + nblocks*4);
		int i;

for (i = -nblocks; i; i++) {
			uint32_t k1 = hash_get_block_32(blocks, i);

k1 *= c1;
			k1 = hash_rotl_32(k1, 15);
			k1 *= c2;

h1 ^= k1;
			h1 = hash_rotl_32(h1, 13);
			h1 = h1*5 + 0xe6546b64;
		}
	}

/* tail */
	{
		const uint8_t *tail = (const uint8_t *) (data + nblocks*4);

uint32_t k1 = 0;

switch (len & 3) {
		case 3: k1 ^= tail[2] << 16; JEMALLOC_FALLTHROUGH
		case 2: k1 ^= tail[1] << 8; JEMALLOC_FALLTHROUGH
		case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
			k1 *= c2; h1 ^= k1;
		}
	}

/* finalization */
	h1 ^= len;

h1 = hash_fmix_32(h1);

return h1;
}

static inline void
hash_x86_128(const void *key, const int len, uint32_t seed,
    uint64_t r_out[2]) {
	const uint8_t * data = (const uint8_t *) key;
	const int nblocks = len / 16;

uint32_t h1 = seed;
	uint32_t h2 = seed;
	uint32_t h3 = seed;
	uint32_t h4 = seed;

const uint32_t c1 = 0x239b961b;
	const uint32_t c2 = 0xab0e9789;
	const uint32_t c3 = 0x38b34ae5;
	const uint32_t c4 = 0xa1e38b93;

/* body */
	{
		const uint32_t *blocks = (const uint32_t *) (data + nblocks*16);
		int i;

for (i = -nblocks; i; i++) {
			uint32_t k1 = hash_get_block_32(blocks, i*4 + 0);
			uint32_t k2 = hash_get_block_32(blocks, i*4 + 1);
			uint32_t k3 = hash_get_block_32(blocks, i*4 + 2);
			uint32_t k4 = hash_get_block_32(blocks, i*4 + 3);

k1 *= c1; k1 = hash_rotl_32(k1, 15); k1 *= c2; h1 ^= k1;

h1 = hash_rotl_32(h1, 19); h1 += h2;
			h1 = h1*5 + 0x561ccd1b;

k2 *= c2; k2 = hash_rotl_32(k2, 16); k2 *= c3; h2 ^= k2;

h2 = hash_rotl_32(h2, 17); h2 += h3;
			h2 = h2*5 + 0x0bcaa747;

k3 *= c3; k3 = hash_rotl_32(k3, 17); k3 *= c4; h3 ^= k3;

h3 = hash_rotl_32(h3, 15); h3 += h4;
			h3 = h3*5 + 0x96cd1c35;

k4 *= c4; k4 = hash_rotl_32(k4, 18); k4 *= c1; h4 ^= k4;

h4 = hash_rotl_32(h4, 13); h4 += h1;
			h4 = h4*5 + 0x32ac3b17;
		}
	}

/* tail */
	{
		const uint8_t *tail = (const uint8_t *) (data + nblocks*16);
		uint32_t k1 = 0;
		uint32_t k2 = 0;
		uint32_t k3 = 0;
		uint32_t k4 = 0;

switch (len & 15) {
		case 15: k4 ^= tail[14] << 16; JEMALLOC_FALLTHROUGH
		case 14: k4 ^= tail[13] << 8; JEMALLOC_FALLTHROUGH
		case 13: k4 ^= tail[12] << 0;
			k4 *= c4; k4 = hash_rotl_32(k4, 18); k4 *= c1; h4 ^= k4;
      JEMALLOC_FALLTHROUGH
		case 12: k3 ^= tail[11] << 24; JEMALLOC_FALLTHROUGH
		case 11: k3 ^= tail[10] << 16; JEMALLOC_FALLTHROUGH
		case 10: k3 ^= tail[ 9] << 8; JEMALLOC_FALLTHROUGH
		case  9: k3 ^= tail[ 8] << 0;
		     k3 *= c3; k3 = hash_rotl_32(k3, 17); k3 *= c4; h3 ^= k3;
         JEMALLOC_FALLTHROUGH
		case  8: k2 ^= tail[ 7] << 24; JEMALLOC_FALLTHROUGH
		case  7: k2 ^= tail[ 6] << 16; JEMALLOC_FALLTHROUGH
		case  6: k2 ^= tail[ 5] << 8; JEMALLOC_FALLTHROUGH
		case  5: k2 ^= tail[ 4] << 0;
			k2 *= c2; k2 = hash_rotl_32(k2, 16); k2 *= c3; h2 ^= k2;
      JEMALLOC_FALLTHROUGH
		case  4: k1 ^= tail[ 3] << 24; JEMALLOC_FALLTHROUGH
		case  3: k1 ^= tail[ 2] << 16; JEMALLOC_FALLTHROUGH
		case  2: k1 ^= tail[ 1] << 8; JEMALLOC_FALLTHROUGH
		case  1: k1 ^= tail[ 0] << 0;
			k1 *= c1; k1 = hash_rotl_32(k1, 15); k1 *= c2; h1 ^= k1;
			break;
		}
	}

/* finalization */
	h1 ^= len; h2 ^= len; h3 ^= len; h4 ^= len;

h1 += h2; h1 += h3; h1 += h4;
	h2 += h1; h3 += h1; h4 += h1;

h1 = hash_fmix_32(h1);
	h2 = hash_fmix_32(h2);
	h3 = hash_fmix_32(h3);
	h4 = hash_fmix_32(h4);

h1 += h2; h1 += h3; h1 += h4;
	h2 += h1; h3 += h1; h4 += h1;

r_out[0] = (((uint64_t) h2) << 32) | h1;
	r_out[1] = (((uint64_t) h4) << 32) | h3;
}

static inline void
hash_x64_128(const void *key, const int len, const uint32_t seed,
    uint64_t r_out[2]) {
	const uint8_t *data = (const uint8_t *) key;
	const int nblocks = len / 16;

uint64_t h1 = seed;
	uint64_t h2 = seed;

const uint64_t c1 = KQU(0x87c37b91114253d5);
	const uint64_t c2 = KQU(0x4cf5ad432745937f);

/* body */
	{
		const uint64_t *blocks = (const uint64_t *) (data);
		int i;

for (i = 0; i < nblocks; i++) {
			uint64_t k1 = hash_get_block_64(blocks, i*2 + 0);
			uint64_t k2 = hash_get_block_64(blocks, i*2 + 1);

k1 *= c1; k1 = hash_rotl_64(k1, 31); k1 *= c2; h1 ^= k1;

h1 = hash_rotl_64(h1, 27); h1 += h2;
			h1 = h1*5 + 0x52dce729;

k2 *= c2; k2 = hash_rotl_64(k2, 33); k2 *= c1; h2 ^= k2;

h2 = hash_rotl_64(h2, 31); h2 += h1;
			h2 = h2*5 + 0x38495ab5;
		}
	}

/* tail */
	{
		const uint8_t *tail = (const uint8_t*)(data + nblocks*16);
		uint64_t k1 = 0;
		uint64_t k2 = 0;

switch (len & 15) {
		case 15: k2 ^= ((uint64_t)(tail[14])) << 48; JEMALLOC_FALLTHROUGH
		case 14: k2 ^= ((uint64_t)(tail[13])) << 40; JEMALLOC_FALLTHROUGH
		case 13: k2 ^= ((uint64_t)(tail[12])) << 32; JEMALLOC_FALLTHROUGH
		case 12: k2 ^= ((uint64_t)(tail[11])) << 24; JEMALLOC_FALLTHROUGH
		case 11: k2 ^= ((uint64_t)(tail[10])) << 16; JEMALLOC_FALLTHROUGH
		case 10: k2 ^= ((uint64_t)(tail[ 9])) << 8;  JEMALLOC_FALLTHROUGH
		case  9: k2 ^= ((uint64_t)(tail[ 8])) << 0;
			k2 *= c2; k2 = hash_rotl_64(k2, 33); k2 *= c1; h2 ^= k2;
			JEMALLOC_FALLTHROUGH
		case  8: k1 ^= ((uint64_t)(tail[ 7])) << 56; JEMALLOC_FALLTHROUGH
		case  7: k1 ^= ((uint64_t)(tail[ 6])) << 48; JEMALLOC_FALLTHROUGH
		case  6: k1 ^= ((uint64_t)(tail[ 5])) << 40; JEMALLOC_FALLTHROUGH
		case  5: k1 ^= ((uint64_t)(tail[ 4])) << 32; JEMALLOC_FALLTHROUGH
		case  4: k1 ^= ((uint64_t)(tail[ 3])) << 24; JEMALLOC_FALLTHROUGH
		case  3: k1 ^= ((uint64_t)(tail[ 2])) << 16; JEMALLOC_FALLTHROUGH
		case  2: k1 ^= ((uint64_t)(tail[ 1])) << 8;  JEMALLOC_FALLTHROUGH
		case  1: k1 ^= ((uint64_t)(tail[ 0])) << 0;
			k1 *= c1; k1 = hash_rotl_64(k1, 31); k1 *= c2; h1 ^= k1;
		}
	}

/* finalization */
	h1 ^= len; h2 ^= len;

h1 += h2;
	h2 += h1;

h1 = hash_fmix_64(h1);
	h2 = hash_fmix_64(h2);

h1 += h2;
	h2 += h1;

r_out[0] = h1;
	r_out[1] = h2;
}

/******************************************************************************/
/* API. */
static inline void
hash(const void *key, size_t len, const uint32_t seed, size_t r_hash[2]) {
	assert(len <= INT_MAX); /* Unfortunate implementation limitation. */

#if (LG_SIZEOF_PTR == 3 && !defined(JEMALLOC_BIG_ENDIAN))
	hash_x64_128(key, (int)len, seed, (uint64_t *)r_hash);
#else
	{
		uint64_t hashes[2];
		hash_x86_128(key, (int)len, seed, hashes);
		r_hash[0] = (size_t)hashes[0];
		r_hash[1] = (size_t)hashes[1];
	}
#endif
}

#endif /* JEMALLOC_INTERNAL_HASH_H */

003 File Manager

Editing: hash.h

Upload File

Create Folder