1/******************************************************************************/
2#ifdef JEMALLOC_H_TYPES
3
4typedef struct ckh_s ckh_t;
5typedef struct ckhc_s ckhc_t;
6
7/* Typedefs to allow easy function pointer passing. */
8typedef void ckh_hash_t (const void *, size_t[2]);
9typedef bool ckh_keycomp_t (const void *, const void *);
10
11/* Maintain counters used to get an idea of performance. */
12/* #define CKH_COUNT */
13/* Print counter values in ckh_delete() (requires CKH_COUNT). */
14/* #define CKH_VERBOSE */
15
16/*
17 * There are 2^LG_CKH_BUCKET_CELLS cells in each hash table bucket. Try to fit
18 * one bucket per L1 cache line.
19 */
| 1/******************************************************************************/
2#ifdef JEMALLOC_H_TYPES
3
4typedef struct ckh_s ckh_t;
5typedef struct ckhc_s ckhc_t;
6
7/* Typedefs to allow easy function pointer passing. */
8typedef void ckh_hash_t (const void *, size_t[2]);
9typedef bool ckh_keycomp_t (const void *, const void *);
10
11/* Maintain counters used to get an idea of performance. */
12/* #define CKH_COUNT */
13/* Print counter values in ckh_delete() (requires CKH_COUNT). */
14/* #define CKH_VERBOSE */
15
16/*
17 * There are 2^LG_CKH_BUCKET_CELLS cells in each hash table bucket. Try to fit
18 * one bucket per L1 cache line.
19 */
|
20#define LG_CKH_BUCKET_CELLS (LG_CACHELINE - LG_SIZEOF_PTR - 1)
| 20#define LG_CKH_BUCKET_CELLS (LG_CACHELINE - LG_SIZEOF_PTR - 1)
|
21
22#endif /* JEMALLOC_H_TYPES */
23/******************************************************************************/
24#ifdef JEMALLOC_H_STRUCTS
25
26/* Hash table cell. */
27struct ckhc_s {
28 const void *key;
--- 60 unchanged lines hidden --- | 21
22#endif /* JEMALLOC_H_TYPES */
23/******************************************************************************/
24#ifdef JEMALLOC_H_STRUCTS
25
26/* Hash table cell. */
27struct ckhc_s {
28 const void *key;
--- 60 unchanged lines hidden --- |