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: ckh.h

#ifndef JEMALLOC_INTERNAL_CKH_H
#define JEMALLOC_INTERNAL_CKH_H

#include "jemalloc/internal/tsd.h"

/* Cuckoo hashing implementation.  Skip to the end for the interface. */

/******************************************************************************/
/* INTERNAL DEFINITIONS -- IGNORE */
/******************************************************************************/

/* Maintain counters used to get an idea of performance. */
/* #define CKH_COUNT */
/* Print counter values in ckh_delete() (requires CKH_COUNT). */
/* #define CKH_VERBOSE */

/*
 * There are 2^LG_CKH_BUCKET_CELLS cells in each hash table bucket.  Try to fit
 * one bucket per L1 cache line.
 */
#define LG_CKH_BUCKET_CELLS (LG_CACHELINE - LG_SIZEOF_PTR - 1)

/* Typedefs to allow easy function pointer passing. */
typedef void ckh_hash_t (const void *, size_t[2]);
typedef bool ckh_keycomp_t (const void *, const void *);

/* Hash table cell. */
typedef struct {
	const void *key;
	const void *data;
} ckhc_t;

/* The hash table itself. */
typedef struct {
#ifdef CKH_COUNT
	/* Counters used to get an idea of performance. */
	uint64_t ngrows;
	uint64_t nshrinks;
	uint64_t nshrinkfails;
	uint64_t ninserts;
	uint64_t nrelocs;
#endif

/* Used for pseudo-random number generation. */
	uint64_t prng_state;

/* Total number of items. */
	size_t count;

/*
	 * Minimum and current number of hash table buckets.  There are
	 * 2^LG_CKH_BUCKET_CELLS cells per bucket.
	 */
	unsigned lg_minbuckets;
	unsigned lg_curbuckets;

/* Hash and comparison functions. */
	ckh_hash_t *hash;
	ckh_keycomp_t *keycomp;

/* Hash table with 2^lg_curbuckets buckets. */
	ckhc_t *tab;
} ckh_t;

/******************************************************************************/
/* BEGIN PUBLIC API */
/******************************************************************************/

/* Lifetime management.  Minitems is the initial capacity. */
bool ckh_new(tsd_t *tsd, ckh_t *ckh, size_t minitems, ckh_hash_t *hash,
    ckh_keycomp_t *keycomp);
void ckh_delete(tsd_t *tsd, ckh_t *ckh);

/* Get the number of elements in the set. */
size_t ckh_count(ckh_t *ckh);

/*
 * To iterate over the elements in the table, initialize *tabind to 0 and call
 * this function until it returns true.  Each call that returns false will
 * update *key and *data to the next element in the table, assuming the pointers
 * are non-NULL.
 */
bool ckh_iter(ckh_t *ckh, size_t *tabind, void **key, void **data);

/*
 * Basic hash table operations -- insert, removal, lookup.  For ckh_remove and
 * ckh_search, key or data can be NULL.  The hash-table only stores pointers to
 * the key and value, and doesn't do any lifetime management.
 */
bool ckh_insert(tsd_t *tsd, ckh_t *ckh, const void *key, const void *data);
bool ckh_remove(tsd_t *tsd, ckh_t *ckh, const void *searchkey, void **key,
    void **data);
bool ckh_search(ckh_t *ckh, const void *searchkey, void **key, void **data);

/* Some useful hash and comparison functions for strings and pointers. */
void ckh_string_hash(const void *key, size_t r_hash[2]);
bool ckh_string_keycomp(const void *k1, const void *k2);
void ckh_pointer_hash(const void *key, size_t r_hash[2]);
bool ckh_pointer_keycomp(const void *k1, const void *k2);

#endif /* JEMALLOC_INTERNAL_CKH_H */

003 File Manager

Editing: ckh.h

Upload File

Create Folder