moparisthebest/pacman
1
0
Fork 0
mirror of https://github.com/moparisthebest/pacman synced 2024-11-11 20:05:07 -05:00
Code Issues Releases Wiki Activity

Implement a quick and dirty rehash function

Browse Source 
This allows us to get through the rehash required by smoke001 and pass
all pactests. It is by no means the best or most efficient
implementation but it does do the job.

Signed-off-by: Dan McGee <dan@archlinux.org>
This commit is contained in:
Dan McGee 2011-01-28 12:03:36 -06:00 committed by Allan McRae
parent f8fdce6cb0
commit ce54715112
1 changed files with 16 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
lib/libalpm/pkghash.c
View File

@ -77,9 +77,9 @@ pmpkghash_t *_alpm_pkghash_create(size_t size)
/* Expand the hash table size to the next increment and rebin the entries */ /* Expand the hash table size to the next increment and rebin the entries */
static pmpkghash_t *rehash(pmpkghash_t *oldhash) static pmpkghash_t *rehash(pmpkghash_t *oldhash)
{ {
//pmpkghash_t *newhash; pmpkghash_t *newhash;
alpm_list_t *ptr;
/* TODO - calculate size of newhash */ size_t newsize;
/* Hash tables will need resized in two cases: /* Hash tables will need resized in two cases:
* - adding packages to the local database * - adding packages to the local database
* - poor estimation of the number of packages in sync database * - poor estimation of the number of packages in sync database
@ -89,17 +89,22 @@ static pmpkghash_t *rehash(pmpkghash_t *oldhash)
* larger database sizes, this increase is reduced to avoid excess * larger database sizes, this increase is reduced to avoid excess
* memory allocation as both scenarios requiring a rehash should not * memory allocation as both scenarios requiring a rehash should not
* require a table size increase that large. */ * require a table size increase that large. */
if(oldhash->buckets < 500) {
newsize = oldhash->buckets * 2;
} else if(oldhash->buckets < 3500) {
newsize = oldhash->buckets * 3 / 2;
} else {
newsize = oldhash->buckets * 4 / 3;
}
//newhash = _alpm_pkghash_create(oldhash->buckets); newhash = _alpm_pkghash_create(newsize);
for(ptr = oldhash->list; ptr != NULL; ptr = ptr->next) {
newhash = _alpm_pkghash_add(newhash, ptr->data);
}
/* TODO - rebin entries */ _alpm_pkghash_free(oldhash);
//_alpm_pkghash_free(oldhash); return(newhash);
//return newhash;
printf("rehash needed!!!\n");
return(oldhash);
} }
pmpkghash_t *_alpm_pkghash_add(pmpkghash_t *hash, pmpkg_t *pkg) pmpkghash_t *_alpm_pkghash_add(pmpkghash_t *hash, pmpkg_t *pkg)