- unsigned long count, removed, approx_before, approx_after;
+ unsigned long count, removed;
+ long approx_before, approx_after;
approx_before);
printf("Accounting of nodes in the hash table: "
"%lu nodes + %lu logically removed.\n",
count, removed);
approx_before);
printf("Accounting of nodes in the hash table: "
"%lu nodes + %lu logically removed.\n",
count, removed);
if ((addremove == AR_ADD || add_only)
|| (addremove == AR_RANDOM && rand_r(&rand_lookup) & 1)) {
node = malloc(sizeof(struct cds_lfht_node));
if ((addremove == AR_ADD || add_only)
|| (addremove == AR_RANDOM && rand_r(&rand_lookup) & 1)) {
node = malloc(sizeof(struct cds_lfht_node));
struct wr_count *count_writer;
unsigned long long tot_reads = 0, tot_writes = 0,
tot_add = 0, tot_add_exist = 0, tot_remove = 0;
struct wr_count *count_writer;
unsigned long long tot_reads = 0, tot_writes = 0,
tot_add = 0, tot_add_exist = 0, tot_remove = 0;
- unsigned long count, removed, approx_before, approx_after;
+ unsigned long count, removed;
+ long approx_before, approx_after;
cds_lfht_count_nodes(test_ht, &approx_before, &count, &removed,
&approx_after);
cds_lfht_count_nodes(test_ht, &approx_before, &count, &removed,
&approx_after);
approx_before);
printf("WARNING: nodes left in the hash table upon destroy: "
"%lu nodes + %lu logically removed.\n",
count, removed);
approx_before);
printf("WARNING: nodes left in the hash table upon destroy: "
"%lu nodes + %lu logically removed.\n",
count, removed);
nr_writers, wdelay, tot_reads, tot_writes,
tot_reads + tot_writes, tot_add, tot_add_exist, tot_remove,
(long long) tot_add + init_populate - tot_remove - count);
nr_writers, wdelay, tot_reads, tot_writes,
tot_reads + tot_writes, tot_add, tot_add_exist, tot_remove,
(long long) tot_add + init_populate - tot_remove - count);