| Index: nss/lib/base/hash.c
|
| diff --git a/nss/lib/base/hash.c b/nss/lib/base/hash.c
|
| index 7eaaf6ff0a5ce1f391cef2e3828cef2847fca246..f9ee758038ec4a5ce62a320372f295a70b793a99 100644
|
| --- a/nss/lib/base/hash.c
|
| +++ b/nss/lib/base/hash.c
|
| @@ -32,48 +32,42 @@
|
| */
|
|
|
| struct nssHashStr {
|
| - NSSArena *arena;
|
| - PRBool i_alloced_arena;
|
| - PRLock *mutex;
|
| + NSSArena *arena;
|
| + PRBool i_alloced_arena;
|
| + PRLock *mutex;
|
|
|
| - /*
|
| - * The invariant that mutex protects is:
|
| - * The count accurately reflects the hashtable state.
|
| - */
|
| + /*
|
| + * The invariant that mutex protects is:
|
| + * The count accurately reflects the hashtable state.
|
| + */
|
|
|
| - PLHashTable *plHashTable;
|
| - PRUint32 count;
|
| + PLHashTable *plHashTable;
|
| + PRUint32 count;
|
| };
|
|
|
| static PLHashNumber
|
| -nss_identity_hash
|
| -(
|
| - const void *key
|
| -)
|
| +nss_identity_hash(const void *key)
|
| {
|
| - return (PLHashNumber)((char *)key - (char *)NULL);
|
| + return (PLHashNumber)((char *)key - (char *)NULL);
|
| }
|
|
|
| static PLHashNumber
|
| -nss_item_hash
|
| -(
|
| - const void *key
|
| -)
|
| +nss_item_hash(const void *key)
|
| {
|
| - unsigned int i;
|
| - PLHashNumber h;
|
| - NSSItem *it = (NSSItem *)key;
|
| - h = 0;
|
| - for (i=0; i<it->size; i++)
|
| - h = PR_ROTATE_LEFT32(h, 4) ^ ((unsigned char *)it->data)[i];
|
| - return h;
|
| + unsigned int i;
|
| + PLHashNumber h;
|
| + NSSItem *it = (NSSItem *)key;
|
| + h = 0;
|
| + for (i = 0; i < it->size; i++)
|
| + h = PR_ROTATE_LEFT32(h, 4) ^ ((unsigned char *)it->data)[i];
|
| + return h;
|
| }
|
|
|
| static int
|
| nss_compare_items(const void *v1, const void *v2)
|
| {
|
| - PRStatus ignore;
|
| - return (int)nssItem_Equal((NSSItem *)v1, (NSSItem *)v2, &ignore);
|
| + PRStatus ignore;
|
| + return (int)nssItem_Equal((NSSItem *)v1, (NSSItem *)v2, &ignore);
|
| }
|
|
|
| /*
|
| @@ -81,60 +75,54 @@ nss_compare_items(const void *v1, const void *v2)
|
| *
|
| */
|
| NSS_IMPLEMENT nssHash *
|
| -nssHash_Create
|
| -(
|
| - NSSArena *arenaOpt,
|
| - PRUint32 numBuckets,
|
| - PLHashFunction keyHash,
|
| - PLHashComparator keyCompare,
|
| - PLHashComparator valueCompare
|
| -)
|
| +nssHash_Create(NSSArena *arenaOpt, PRUint32 numBuckets, PLHashFunction keyHash,
|
| + PLHashComparator keyCompare, PLHashComparator valueCompare)
|
| {
|
| - nssHash *rv;
|
| - NSSArena *arena;
|
| - PRBool i_alloced;
|
| + nssHash *rv;
|
| + NSSArena *arena;
|
| + PRBool i_alloced;
|
|
|
| #ifdef NSSDEBUG
|
| - if( arenaOpt && PR_SUCCESS != nssArena_verifyPointer(arenaOpt) ) {
|
| - nss_SetError(NSS_ERROR_INVALID_POINTER);
|
| - return (nssHash *)NULL;
|
| - }
|
| + if (arenaOpt && PR_SUCCESS != nssArena_verifyPointer(arenaOpt)) {
|
| + nss_SetError(NSS_ERROR_INVALID_POINTER);
|
| + return (nssHash *)NULL;
|
| + }
|
| #endif /* NSSDEBUG */
|
|
|
| - if (arenaOpt) {
|
| - arena = arenaOpt;
|
| - i_alloced = PR_FALSE;
|
| - } else {
|
| - arena = nssArena_Create();
|
| - i_alloced = PR_TRUE;
|
| - }
|
| -
|
| - rv = nss_ZNEW(arena, nssHash);
|
| - if( (nssHash *)NULL == rv ) {
|
| - goto loser;
|
| - }
|
| -
|
| - rv->mutex = PZ_NewLock(nssILockOther);
|
| - if( (PZLock *)NULL == rv->mutex ) {
|
| - goto loser;
|
| - }
|
| -
|
| - rv->plHashTable = PL_NewHashTable(numBuckets,
|
| - keyHash, keyCompare, valueCompare,
|
| - &nssArenaHashAllocOps, arena);
|
| - if( (PLHashTable *)NULL == rv->plHashTable ) {
|
| - (void)PZ_DestroyLock(rv->mutex);
|
| - goto loser;
|
| - }
|
| -
|
| - rv->count = 0;
|
| - rv->arena = arena;
|
| - rv->i_alloced_arena = i_alloced;
|
| -
|
| - return rv;
|
| + if (arenaOpt) {
|
| + arena = arenaOpt;
|
| + i_alloced = PR_FALSE;
|
| + } else {
|
| + arena = nssArena_Create();
|
| + i_alloced = PR_TRUE;
|
| + }
|
| +
|
| + rv = nss_ZNEW(arena, nssHash);
|
| + if ((nssHash *)NULL == rv) {
|
| + goto loser;
|
| + }
|
| +
|
| + rv->mutex = PZ_NewLock(nssILockOther);
|
| + if ((PZLock *)NULL == rv->mutex) {
|
| + goto loser;
|
| + }
|
| +
|
| + rv->plHashTable =
|
| + PL_NewHashTable(numBuckets, keyHash, keyCompare, valueCompare,
|
| + &nssArenaHashAllocOps, arena);
|
| + if ((PLHashTable *)NULL == rv->plHashTable) {
|
| + (void)PZ_DestroyLock(rv->mutex);
|
| + goto loser;
|
| + }
|
| +
|
| + rv->count = 0;
|
| + rv->arena = arena;
|
| + rv->i_alloced_arena = i_alloced;
|
| +
|
| + return rv;
|
| loser:
|
| - (void)nss_ZFreeIf(rv);
|
| - return (nssHash *)NULL;
|
| + (void)nss_ZFreeIf(rv);
|
| + return (nssHash *)NULL;
|
| }
|
|
|
| /*
|
| @@ -142,14 +130,10 @@ loser:
|
| *
|
| */
|
| NSS_IMPLEMENT nssHash *
|
| -nssHash_CreatePointer
|
| -(
|
| - NSSArena *arenaOpt,
|
| - PRUint32 numBuckets
|
| -)
|
| +nssHash_CreatePointer(NSSArena *arenaOpt, PRUint32 numBuckets)
|
| {
|
| - return nssHash_Create(arenaOpt, numBuckets,
|
| - nss_identity_hash, PL_CompareValues, PL_CompareValues);
|
| + return nssHash_Create(arenaOpt, numBuckets, nss_identity_hash,
|
| + PL_CompareValues, PL_CompareValues);
|
| }
|
|
|
| /*
|
| @@ -157,14 +141,10 @@ nssHash_CreatePointer
|
| *
|
| */
|
| NSS_IMPLEMENT nssHash *
|
| -nssHash_CreateString
|
| -(
|
| - NSSArena *arenaOpt,
|
| - PRUint32 numBuckets
|
| -)
|
| +nssHash_CreateString(NSSArena *arenaOpt, PRUint32 numBuckets)
|
| {
|
| - return nssHash_Create(arenaOpt, numBuckets,
|
| - PL_HashString, PL_CompareStrings, PL_CompareStrings);
|
| + return nssHash_Create(arenaOpt, numBuckets, PL_HashString,
|
| + PL_CompareStrings, PL_CompareStrings);
|
| }
|
|
|
| /*
|
| @@ -172,14 +152,10 @@ nssHash_CreateString
|
| *
|
| */
|
| NSS_IMPLEMENT nssHash *
|
| -nssHash_CreateItem
|
| -(
|
| - NSSArena *arenaOpt,
|
| - PRUint32 numBuckets
|
| -)
|
| +nssHash_CreateItem(NSSArena *arenaOpt, PRUint32 numBuckets)
|
| {
|
| - return nssHash_Create(arenaOpt, numBuckets,
|
| - nss_item_hash, nss_compare_items, PL_CompareValues);
|
| + return nssHash_Create(arenaOpt, numBuckets, nss_item_hash,
|
| + nss_compare_items, PL_CompareValues);
|
| }
|
|
|
| /*
|
| @@ -187,18 +163,15 @@ nssHash_CreateItem
|
| *
|
| */
|
| NSS_IMPLEMENT void
|
| -nssHash_Destroy
|
| -(
|
| - nssHash *hash
|
| -)
|
| +nssHash_Destroy(nssHash *hash)
|
| {
|
| - (void)PZ_DestroyLock(hash->mutex);
|
| - PL_HashTableDestroy(hash->plHashTable);
|
| - if (hash->i_alloced_arena) {
|
| - nssArena_Destroy(hash->arena);
|
| - } else {
|
| - nss_ZFreeIf(hash);
|
| - }
|
| + (void)PZ_DestroyLock(hash->mutex);
|
| + PL_HashTableDestroy(hash->plHashTable);
|
| + if (hash->i_alloced_arena) {
|
| + nssArena_Destroy(hash->arena);
|
| + } else {
|
| + nss_ZFreeIf(hash);
|
| + }
|
| }
|
|
|
| /*
|
| @@ -206,31 +179,26 @@ nssHash_Destroy
|
| *
|
| */
|
| NSS_IMPLEMENT PRStatus
|
| -nssHash_Add
|
| -(
|
| - nssHash *hash,
|
| - const void *key,
|
| - const void *value
|
| -)
|
| +nssHash_Add(nssHash *hash, const void *key, const void *value)
|
| {
|
| - PRStatus error = PR_FAILURE;
|
| - PLHashEntry *he;
|
| -
|
| - PZ_Lock(hash->mutex);
|
| -
|
| - he = PL_HashTableAdd(hash->plHashTable, key, (void *)value);
|
| - if( (PLHashEntry *)NULL == he ) {
|
| - nss_SetError(NSS_ERROR_NO_MEMORY);
|
| - } else if (he->value != value) {
|
| - nss_SetError(NSS_ERROR_HASH_COLLISION);
|
| - } else {
|
| - hash->count++;
|
| - error = PR_SUCCESS;
|
| - }
|
| -
|
| - (void)PZ_Unlock(hash->mutex);
|
| -
|
| - return error;
|
| + PRStatus error = PR_FAILURE;
|
| + PLHashEntry *he;
|
| +
|
| + PZ_Lock(hash->mutex);
|
| +
|
| + he = PL_HashTableAdd(hash->plHashTable, key, (void *)value);
|
| + if ((PLHashEntry *)NULL == he) {
|
| + nss_SetError(NSS_ERROR_NO_MEMORY);
|
| + } else if (he->value != value) {
|
| + nss_SetError(NSS_ERROR_HASH_COLLISION);
|
| + } else {
|
| + hash->count++;
|
| + error = PR_SUCCESS;
|
| + }
|
| +
|
| + (void)PZ_Unlock(hash->mutex);
|
| +
|
| + return error;
|
| }
|
|
|
| /*
|
| @@ -238,23 +206,19 @@ nssHash_Add
|
| *
|
| */
|
| NSS_IMPLEMENT void
|
| -nssHash_Remove
|
| -(
|
| - nssHash *hash,
|
| - const void *it
|
| -)
|
| +nssHash_Remove(nssHash *hash, const void *it)
|
| {
|
| - PRBool found;
|
| + PRBool found;
|
|
|
| - PZ_Lock(hash->mutex);
|
| + PZ_Lock(hash->mutex);
|
|
|
| - found = PL_HashTableRemove(hash->plHashTable, it);
|
| - if( found ) {
|
| - hash->count--;
|
| - }
|
| + found = PL_HashTableRemove(hash->plHashTable, it);
|
| + if (found) {
|
| + hash->count--;
|
| + }
|
|
|
| - (void)PZ_Unlock(hash->mutex);
|
| - return;
|
| + (void)PZ_Unlock(hash->mutex);
|
| + return;
|
| }
|
|
|
| /*
|
| @@ -262,20 +226,17 @@ nssHash_Remove
|
| *
|
| */
|
| NSS_IMPLEMENT PRUint32
|
| -nssHash_Count
|
| -(
|
| - nssHash *hash
|
| -)
|
| +nssHash_Count(nssHash *hash)
|
| {
|
| - PRUint32 count;
|
| + PRUint32 count;
|
|
|
| - PZ_Lock(hash->mutex);
|
| + PZ_Lock(hash->mutex);
|
|
|
| - count = hash->count;
|
| + count = hash->count;
|
|
|
| - (void)PZ_Unlock(hash->mutex);
|
| + (void)PZ_Unlock(hash->mutex);
|
|
|
| - return count;
|
| + return count;
|
| }
|
|
|
| /*
|
| @@ -283,25 +244,21 @@ nssHash_Count
|
| *
|
| */
|
| NSS_IMPLEMENT PRBool
|
| -nssHash_Exists
|
| -(
|
| - nssHash *hash,
|
| - const void *it
|
| -)
|
| +nssHash_Exists(nssHash *hash, const void *it)
|
| {
|
| - void *value;
|
| + void *value;
|
|
|
| - PZ_Lock(hash->mutex);
|
| + PZ_Lock(hash->mutex);
|
|
|
| - value = PL_HashTableLookup(hash->plHashTable, it);
|
| + value = PL_HashTableLookup(hash->plHashTable, it);
|
|
|
| - (void)PZ_Unlock(hash->mutex);
|
| + (void)PZ_Unlock(hash->mutex);
|
|
|
| - if( (void *)NULL == value ) {
|
| - return PR_FALSE;
|
| - } else {
|
| - return PR_TRUE;
|
| - }
|
| + if ((void *)NULL == value) {
|
| + return PR_FALSE;
|
| + } else {
|
| + return PR_TRUE;
|
| + }
|
| }
|
|
|
| /*
|
| @@ -309,39 +266,30 @@ nssHash_Exists
|
| *
|
| */
|
| NSS_IMPLEMENT void *
|
| -nssHash_Lookup
|
| -(
|
| - nssHash *hash,
|
| - const void *it
|
| -)
|
| +nssHash_Lookup(nssHash *hash, const void *it)
|
| {
|
| - void *rv;
|
| + void *rv;
|
|
|
| - PZ_Lock(hash->mutex);
|
| + PZ_Lock(hash->mutex);
|
|
|
| - rv = PL_HashTableLookup(hash->plHashTable, it);
|
| + rv = PL_HashTableLookup(hash->plHashTable, it);
|
|
|
| - (void)PZ_Unlock(hash->mutex);
|
| + (void)PZ_Unlock(hash->mutex);
|
|
|
| - return rv;
|
| + return rv;
|
| }
|
|
|
| struct arg_str {
|
| - nssHashIterator fcn;
|
| - void *closure;
|
| + nssHashIterator fcn;
|
| + void *closure;
|
| };
|
|
|
| static PRIntn
|
| -nss_hash_enumerator
|
| -(
|
| - PLHashEntry *he,
|
| - PRIntn index,
|
| - void *arg
|
| -)
|
| +nss_hash_enumerator(PLHashEntry *he, PRIntn index, void *arg)
|
| {
|
| - struct arg_str *as = (struct arg_str *)arg;
|
| - as->fcn(he->key, he->value, as->closure);
|
| - return HT_ENUMERATE_NEXT;
|
| + struct arg_str *as = (struct arg_str *)arg;
|
| + as->fcn(he->key, he->value, as->closure);
|
| + return HT_ENUMERATE_NEXT;
|
| }
|
|
|
| /*
|
| @@ -350,22 +298,17 @@ nss_hash_enumerator
|
| * NOTE that the iteration function will be called with the hashtable locked.
|
| */
|
| NSS_IMPLEMENT void
|
| -nssHash_Iterate
|
| -(
|
| - nssHash *hash,
|
| - nssHashIterator fcn,
|
| - void *closure
|
| -)
|
| +nssHash_Iterate(nssHash *hash, nssHashIterator fcn, void *closure)
|
| {
|
| - struct arg_str as;
|
| - as.fcn = fcn;
|
| - as.closure = closure;
|
| + struct arg_str as;
|
| + as.fcn = fcn;
|
| + as.closure = closure;
|
|
|
| - PZ_Lock(hash->mutex);
|
| + PZ_Lock(hash->mutex);
|
|
|
| - PL_HashTableEnumerateEntries(hash->plHashTable, nss_hash_enumerator, &as);
|
| + PL_HashTableEnumerateEntries(hash->plHashTable, nss_hash_enumerator, &as);
|
|
|
| - (void)PZ_Unlock(hash->mutex);
|
| + (void)PZ_Unlock(hash->mutex);
|
|
|
| - return;
|
| + return;
|
| }
|
|
|