github-code/json-c
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

reduce duplicate hash computation in json_object_object_add()

Browse Source 
This can be a very considerable performance saver.
This commit is contained in:
Rainer Gerhards
2015-09-22 19:07:30 +02:00
parent ec4879ac5b
commit d8e44dc685
3 changed files with 60 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
linkhash.c
View File

@@ -490,14 +490,13 @@ void lh_table_free(struct lh_table *t)
}
int lh_table_insert(struct lh_table *t, void *k, const void *v)
int lh_table_insert_w_hash(struct lh_table *t, void *k, const void *v, const unsigned long h)
{
unsigned long h, n;
unsigned long n;
t->inserts++;
if(t->count >= t->size * LH_LOAD_FACTOR) lh_table_resize(t, t->size * 2);
h = t->hash_fn(k);
n = h % t->size;
while( 1 ) {
@@ -522,11 +521,14 @@ int lh_table_insert(struct lh_table *t, void *k, const void *v)
return 0;
}
struct lh_entry* lh_table_lookup_entry(struct lh_table *t, const void *k)
int lh_table_insert(struct lh_table *t, void *k, const void *v)
{
return lh_table_insert_w_hash(t, k, v, lh_get_hash(t, k));
}
struct lh_entry* lh_table_lookup_entry_w_hash(struct lh_table *t, const void *k, const unsigned long h)
{
unsigned long h = t->hash_fn(k);
unsigned long n = h % t->size;
int count = 0;
@@ -541,6 +543,10 @@ struct lh_entry* lh_table_lookup_entry(struct lh_table *t, const void *k)
return NULL;
}
struct lh_entry* lh_table_lookup_entry(struct lh_table *t, const void *k)
{
return lh_table_lookup_entry_w_hash(t, k, lh_get_hash(t, k));
}
const void* lh_table_lookup(struct lh_table *t, const void *k)
{