#define JA_LOG2_BITS_PER_BYTE 3U
#define JA_BITS_PER_BYTE (1U << JA_LOG2_BITS_PER_BYTE)
+#define JA_POOL_1D_MASK ((JA_BITS_PER_BYTE - 1) << JA_TYPE_BITS)
+#define JA_POOL_2D_MASK (JA_POOL_1D_MASK << JA_LOG2_BITS_PER_BYTE)
+
#define JA_MAX_DEPTH 9 /* Maximum depth, including leafs */
/*
*/
struct cds_lfht *ht;
unsigned long nr_fallback; /* Number of fallback nodes used */
+
+ /* For debugging */
+ unsigned long node_fallback_count_distribution[JA_ENTRY_PER_NODE];
+ unsigned long nr_nodes_allocated, nr_nodes_freed;
};
static inline
}
static inline
-struct cds_ja_inode *ja_node_ptr(struct cds_ja_inode_flag *node)
+struct cds_ja_inode_flag *ja_node_flag_pool_1d(struct cds_ja_inode *node,
+ unsigned long type, unsigned long bitsel)
+{
+ assert(type < (1UL << JA_TYPE_BITS));
+ assert(bitsel < JA_BITS_PER_BYTE);
+ return (struct cds_ja_inode_flag *) (((unsigned long) node) | (bitsel << JA_TYPE_BITS) | type);
+}
+
+static inline
+struct cds_ja_inode_flag *ja_node_flag_pool_2d(struct cds_ja_inode *node,
+ unsigned long type, unsigned int bitsel[2])
+{
+ assert(type < (1UL << JA_TYPE_BITS));
+ assert(bitsel[0] < JA_BITS_PER_BYTE);
+ assert(bitsel[1] < JA_BITS_PER_BYTE);
+ return (struct cds_ja_inode_flag *) (((unsigned long) node) | (bitsel[0] << (JA_TYPE_BITS + JA_LOG2_BITS_PER_BYTE)) | (bitsel[1] << JA_TYPE_BITS) | type);
+}
+
+static inline
+unsigned long ja_node_pool_1d_bitsel(struct cds_ja_inode_flag *node)
+{
+ return ((unsigned long) node & JA_POOL_1D_MASK) >> JA_TYPE_BITS;
+}
+
+static inline
+void ja_node_pool_2d_bitsel(struct cds_ja_inode_flag *node, unsigned long *bits)
{
- return (struct cds_ja_inode *) (((unsigned long) node) & JA_PTR_MASK);
+ bits[0] = ((unsigned long) node & JA_POOL_2D_MASK) >> (JA_TYPE_BITS + JA_LOG2_BITS_PER_BYTE);
+ bits[1] = ((unsigned long) node & JA_POOL_1D_MASK) >> JA_TYPE_BITS;
}
+/* Hardcoded pool indexes for fast path */
+#define RCU_JA_POOL_IDX_5 5
+#define RCU_JA_POOL_IDX_6 6
static inline
-unsigned long ja_node_type(struct cds_ja_inode_flag *node)
+struct cds_ja_inode *ja_node_ptr(struct cds_ja_inode_flag *node)
{
- unsigned long type;
+ unsigned long v, type_idx;
+
+ if (!node)
+ return NULL; /* RCU_JA_NULL */
+ v = (unsigned long) node;
+ type_idx = v & JA_TYPE_MASK;
- if (ja_node_ptr(node) == NULL) {
- return NODE_INDEX_NULL;
+ switch (type_idx) {
+ case RCU_JA_POOL_IDX_5:
+ v &= ~(JA_POOL_1D_MASK | JA_TYPE_MASK);
+ break;
+ case RCU_JA_POOL_IDX_6:
+ v &= ~(JA_POOL_2D_MASK | JA_POOL_1D_MASK | JA_TYPE_MASK);
+ break;
+ default:
+ /* RCU_JA_LINEAR or RCU_JA_PIGEON */
+ v &= JA_PTR_MASK;
+ break;
}
- type = (unsigned int) ((unsigned long) node & JA_TYPE_MASK);
- assert(type < (1UL << JA_TYPE_BITS));
- return type;
+ return (struct cds_ja_inode *) v;
}
+__attribute__((visibility("protected")))
+unsigned long ja_node_type(struct cds_ja_inode_flag *node);
+
__attribute__((visibility("protected")))
void rcuja_free_all_children(struct cds_ja_shadow_node *shadow_node,
struct cds_ja_inode_flag *node_flag,
- void (*free_node_cb)(struct rcu_head *head));
+ void (*free_node_cb)(struct cds_ja_node *node));
__attribute__((visibility("protected")))
struct cds_ja_shadow_node *rcuja_shadow_lookup_lock(struct cds_lfht *ht,
struct cds_ja_shadow_node *rcuja_shadow_set(struct cds_lfht *ht,
struct cds_ja_inode_flag *new_node_flag,
struct cds_ja_shadow_node *inherit_from,
- struct cds_ja *ja);
+ struct cds_ja *ja, int level);
/* rcuja_shadow_clear flags */
enum {
__attribute__((visibility("protected")))
void rcuja_shadow_prune(struct cds_lfht *ht,
unsigned int flags,
- void (*free_node_cb)(struct rcu_head *head));
+ void (*free_node_cb)(struct cds_ja_node *node));
__attribute__((visibility("protected")))
struct cds_lfht *rcuja_create_ht(const struct rcu_flavor_struct *flavor);
__attribute__((visibility("protected")))
int rcuja_delete_ht(struct cds_lfht *ht);
+__attribute__((visibility("protected")))
+void free_cds_ja_node(struct cds_ja *ja, struct cds_ja_inode *node);
+
+/*
+ * Iterate through duplicates returned by cds_ja_lookup*()
+ * Receives a struct cds_ja_node * as parameter, which is used as start
+ * of duplicate list and loop cursor.
+ */
+#define cds_ja_for_each_duplicate(pos) \
+ for (; (pos) != NULL; (pos) = (pos)->next)
+
+/*
+ * Iterate through duplicates returned by cds_ja_lookup*()
+ * Safe against removal of entries during traversal.
+ */
+#define cds_ja_for_each_duplicate_safe(_pos, _next) \
+ for (; (_pos) != NULL ? ((_next) = (_pos)->next, 1) : 0; \
+ (_pos) = (_next))
+
//#define DEBUG
#ifdef __linux__