#define MAX_TABLE_ORDER 64
#endif
+#define MAX_CHUNK_TABLE (1UL << 10)
+
#ifndef min
#define min(a, b) ((a) < (b) ? (a) : (b))
#endif
* cds_lfht: Top-level data structure representing a lock-free hash
* table. Defined in the implementation file to make it be an opaque
* cookie to users.
+ *
+ * The fields used in fast-paths are placed near the end of the
+ * structure, because we need to have a variable-sized union to contain
+ * the mm plugin fields, which are used in the fast path.
*/
struct cds_lfht {
- unsigned long size; /* always a power of 2, shared (RCU) */
- int flags;
+ /* Initial configuration items */
+ unsigned long max_nr_buckets;
+ const struct cds_lfht_mm_type *mm; /* memory management plugin */
+ const struct rcu_flavor_struct *flavor; /* RCU flavor */
+
+ long count; /* global approximate item count */
/*
* We need to put the work threads offline (QSBR) when taking this
unsigned int in_progress_resize, in_progress_destroy;
unsigned long resize_target;
int resize_initiated;
- const struct rcu_flavor_struct *flavor;
-
- long count; /* global approximate item count */
- struct ht_items_count *split_count; /* split item count */
-
- /* memory management related fields are located at the end */
- const struct cds_lfht_mm_type *mm;
+ /*
+ * Variables needed for add and remove fast-paths.
+ */
+ int flags;
unsigned long min_alloc_buckets_order;
unsigned long min_nr_alloc_buckets;
- unsigned long max_nr_buckets;
+ struct ht_items_count *split_count; /* split item count */
+ /*
+ * Variables needed for the lookup, add and remove fast-paths.
+ */
+ unsigned long size; /* always a power of 2, shared (RCU) */
+ /*
+ * bucket_at pointer is kept here to skip the extra level of
+ * dereference needed to get to "mm" (this is a fast-path).
+ */
struct cds_lfht_node *(*bucket_at)(struct cds_lfht *ht,
unsigned long index);
-
+ /*
+ * Dynamic length "tbl_chunk" needs to be at the end of
+ * cds_lfht.
+ */
union {
/*
* Contains the per order-index-level bucket node table.
* levels to improve cache locality for small index orders.
*/
struct cds_lfht_node *tbl_order[MAX_TABLE_ORDER];
+
+ /*
+ * Contains the bucket node chunks. The size of each
+ * bucket node chunk is ->min_alloc_size (we avoid to
+ * allocate chunks with different size). Chunks improve
+ * cache locality for small index orders, and are more
+ * friendly with environments where allocation of large
+ * contiguous memory areas is challenging due to memory
+ * fragmentation concerns or inability to use virtual
+ * memory addressing.
+ */
+ struct cds_lfht_node *tbl_chunk[0];
+
+ /*
+ * Memory mapping with room for all possible buckets.
+ * Their memory is allocated when needed.
+ */
+ struct cds_lfht_node *tbl_mmap;
};
+ /*
+ * End of variables needed for the lookup, add and remove
+ * fast-paths.
+ */
};
extern unsigned int fls_ulong(unsigned long x);
#define poison_free(ptr) free(ptr)
#endif
+static inline
+struct cds_lfht *__default_alloc_cds_lfht(
+ const struct cds_lfht_mm_type *mm,
+ unsigned long cds_lfht_size,
+ unsigned long min_nr_alloc_buckets,
+ unsigned long max_nr_buckets)
+{
+ struct cds_lfht *ht;
+
+ ht = calloc(1, cds_lfht_size);
+ assert(ht);
+
+ ht->mm = mm;
+ ht->bucket_at = mm->bucket_at;
+ ht->min_nr_alloc_buckets = min_nr_alloc_buckets;
+ ht->min_alloc_buckets_order =
+ get_count_order_ulong(min_nr_alloc_buckets);
+ ht->max_nr_buckets = max_nr_buckets;
+
+ return ht;
+}
+
#endif /* _URCU_RCULFHASH_INTERNAL_H */