void (*ht_call_rcu)(struct rcu_head *head,
void (*func)(struct rcu_head *head));
};
void (*ht_call_rcu)(struct rcu_head *head,
void (*func)(struct rcu_head *head));
};
new_node->p.reverse_hash =
bit_reverse_ulong(!i ? 0 : (1UL << (i - 1)) + j);
(void) _ht_add(ht, t, new_node, 0, 1);
new_node->p.reverse_hash =
bit_reverse_ulong(!i ? 0 : (1UL << (i - 1)) + j);
(void) _ht_add(ht, t, new_node, 0, 1);
}
/* Update table size */
t->size = !i ? 1 : (1UL << i);
dbg_printf("rculfhash: init new size: %lu\n", t->size);
}
/* Update table size */
t->size = !i ? 1 : (1UL << i);
dbg_printf("rculfhash: init new size: %lu\n", t->size);
while (uatomic_read(&ht->in_progress_resize))
poll(NULL, 0, 100); /* wait for 100ms */
ret = ht_delete_dummy(ht);
while (uatomic_read(&ht->in_progress_resize))
poll(NULL, 0, 100); /* wait for 100ms */
ret = ht_delete_dummy(ht);
- dbg_printf("rculfhash: resize from %lu (order %lu) to %lu (order %lu) buckets\n",
- old_size, old_order, new_size, new_order);
+ printf("rculfhash: resize from %lu (order %lu) to %lu (order %lu) buckets\n",
+ old_size, old_order, new_size, new_order);
new_t = malloc(sizeof(struct rcu_table)
+ (new_order * sizeof(struct _rcu_ht_node *)));
assert(new_size > old_size);
new_t = malloc(sizeof(struct rcu_table)
+ (new_order * sizeof(struct _rcu_ht_node *)));
assert(new_size > old_size);