Mirror of the lttng-dev mailing list
 help / color / mirror / Atom feed
From: laijs@cn.fujitsu.com (Lai Jiangshan)
Subject: [ltt-dev] [PATCH 6/9] test hash value Confilict with buckets
Date: Wed, 16 Nov 2011 16:53:03 +0800	[thread overview]
Message-ID: <4EC379EF.1090501@cn.fujitsu.com> (raw)
In-Reply-To: <20111115112259.GE16701@Krystal>

On 11/15/2011 07:22 PM, Mathieu Desnoyers wrote:
> "Confilict" -> "conflict"
> 
> This increases conflicts by restricting the pool of random numbers to a
> limited number of bits. Actually, this approach replaces the "pool size"
> parameters I already have there, with slightly less flexibility though.
> Please look into the "random number pool size" to try to achieve the
> same effect.

I missed something? pool size in the original code is constant when the test
is started.

And when the hash table is larger/equal than the pool, many bucket is unused
and cause long chain in a bucket.

> 
> Thanks,
> 
> Mathieu
> 
> * Lai Jiangshan (laijs at cn.fujitsu.com) wrote:
>> Signed-off-by: Lai Jiangshan <laijs at cn.fujitsu.com>
>> ---
>>  tests/test_urcu_hash.c |   20 +++++++++++++++++++-
>>  1 files changed, 19 insertions(+), 1 deletions(-)
>>
>> diff --git a/tests/test_urcu_hash.c b/tests/test_urcu_hash.c
>> index 02d2c63..eb42522 100644
>> --- a/tests/test_urcu_hash.c
>> +++ b/tests/test_urcu_hash.c
>> @@ -141,6 +141,7 @@ static unsigned long min_hash_alloc_size = DEFAULT_MIN_ALLOC_SIZE;
>>  static unsigned long init_populate;
>>  static int opt_auto_resize;
>>  static int add_only, add_unique, add_replace;
>> +static int opt_test_bucket_conflict;
>>  
>>  static int count_pipe[2];
>>  
>> @@ -390,8 +391,22 @@ int lookup_first(struct cds_lfht_node *node, void *key)
>>  static inline
>>  void lfht_test_node_init(struct lfht_test_node *node)
>>  {
>> +	unsigned long hash = test_rand_get();
>> +
>>  	cds_lfht_node_init(&node->node);
>> -	node->hash = test_rand_get();
>> +
>> +	if (opt_test_bucket_conflict) {
>> +#if (CAA_BITS_PER_LONG == 32)
>> +		int hash_bits= test_rand_get_bits(5);
>> +#else
>> +		int hash_bits= test_rand_get_bits(6);
>> +#endif
>> +
>> +		if (hash_bits > 4)
>> +			hash &= (1UL << hash_bits) - 1;
>> +	}
>> +
>> +	node->hash = hash;
>>  }
>>  
>>  static
>> @@ -674,6 +689,7 @@ void show_usage(int argc, char **argv)
>>  	printf("        [-i] Add only (no removal).\n");
>>  	printf("        [-k nr_nodes] Number of nodes to insert initially.\n");
>>  	printf("        [-A] Automatically resize hash table.\n");
>> +	printf("	[-C] Use some hash value Confilict with buckets.\n");
>>  	printf("\n\n");
>>  }
>>  
>> @@ -792,6 +808,8 @@ int main(int argc, char **argv)
>>  		case 'A':
>>  			opt_auto_resize = 1;
>>  			break;
>> +		case 'C':
>> +			opt_test_bucket_conflict = 1;
>>  			break;
>>  
>>  		}
>> -- 
>> 1.7.4.4
>>
> 




  reply	other threads:[~2011-11-16  8:53 UTC|newest]

Thread overview: 29+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2011-11-14  4:50 [ltt-dev] [PATCH 0/9] change lfht test Lai Jiangshan
2011-11-14  4:50 ` [ltt-dev] [PATCH 1/9] Fix arguments order Lai Jiangshan
2011-11-14 12:57   ` Mathieu Desnoyers
2011-11-14  4:50 ` [ltt-dev] [PATCH 2/9] keep the last position for failed lookup Lai Jiangshan
2011-11-15 11:10   ` Mathieu Desnoyers
2011-11-16  8:33     ` Lai Jiangshan
2011-11-14  4:50 ` [ltt-dev] [PATCH 3/9] add cds_lfht_add_at() Lai Jiangshan
2011-11-15  8:23   ` Lai Jiangshan
2011-11-15 11:07     ` Mathieu Desnoyers
2011-11-18 14:29     ` Mathieu Desnoyers
2011-11-21  3:15       ` Lai Jiangshan
2011-11-22  9:41         ` Mathieu Desnoyers
2011-11-14  4:50 ` [ltt-dev] [PATCH 4/9] new random generator Lai Jiangshan
2011-11-15 11:17   ` Mathieu Desnoyers
2011-11-14  4:50 ` [ltt-dev] [PATCH 5/9] use random value for hash value directly Lai Jiangshan
2011-11-15 11:20   ` Mathieu Desnoyers
2011-11-16  8:41     ` Lai Jiangshan
2011-11-14  4:50 ` [ltt-dev] [PATCH 6/9] test hash value Confilict with buckets Lai Jiangshan
2011-11-15 11:22   ` Mathieu Desnoyers
2011-11-16  8:53     ` Lai Jiangshan [this message]
2011-11-14  4:50 ` [ltt-dev] [PATCH 7/9] add identical-hash-value-chain test Lai Jiangshan
2011-11-15 11:24   ` Mathieu Desnoyers
2011-11-16  8:55     ` Lai Jiangshan
2011-11-14  4:50 ` [ltt-dev] [PATCH 8/9] add duplicated node test Lai Jiangshan
2011-11-15 11:31   ` Mathieu Desnoyers
2011-11-16  9:16     ` Lai Jiangshan
2011-11-14  4:50 ` [ltt-dev] [PATCH 9/9] change strategy for AR_RANDOM Lai Jiangshan
2011-11-15 11:35   ` Mathieu Desnoyers
2011-11-16  9:26     ` Lai Jiangshan

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=4EC379EF.1090501@cn.fujitsu.com \
    --to=laijs@cn.fujitsu.com \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox