/*
* Create and Init a MEMCAP - use free to release it
*/
MEMCAP * sfmemcap_new( unsigned nbytes )
{
MEMCAP * mc;
mc = (MEMCAP*)calloc(1,sizeof(MEMCAP));
if( mc ) sfmemcap_init( mc, nbytes );
return mc;
}
/*
Notes:
if nrows < 0 don't cal the nearest prime.
datasize must be the same for all entries, unless datasize is zero.
maxmem of 0 indicates no memory limits.
*/
SFXHASH * sfxhash_new( int nrows, int keysize, int datasize, int maxmem,
int anr_flag,
int (*anrfree)(void * key, void * data),
int (*usrfree)(void * key, void * data),
int recycle_flag )
{
int i;
SFXHASH * h;
if( nrows > 0 ) /* make sure we have a prime number */
{
nrows = calcNextPrime( nrows );
}
else /* use the magnitude or nrows as is */
{
nrows = -nrows;
}
/* Allocate the table structure from general memory */
//h = (SFXHASH*) calloc( 1, sizeof(SFXHASH) );
h = (SFXHASH*)SnortAlloc(sizeof(SFXHASH));
if( !h )
{
return 0;
}
/* this has a default hashing function */
h->sfhashfcn = sfhashfcn_new( nrows );
if( !h->sfhashfcn )
{
free(h);
return 0;
}
sfmemcap_init( &h->mc, maxmem );
/* Allocate the array of node ptrs */
h->table = (SFXHASH_NODE**) s_malloc( h, sizeof(SFXHASH_NODE*) * nrows );
if( !h->table )
{
free(h->sfhashfcn);
free(h);
return 0;
}
for( i=0; i<nrows; i++ )
{
h->table[i] = 0;
}
h->anrfree = anrfree;
h->usrfree = usrfree;
h->keysize = keysize;
h->datasize = datasize;
h->nrows = nrows;
h->crow = 0;
h->cnode = 0;
h->count = 0;
h->ghead = 0;
h->gtail = 0;
h->anr_count= 0;
h->anr_tries= 0;
h->anr_flag = anr_flag;
h->splay = 1;
h->recycle_nodes = recycle_flag;
h->find_success = 0;
h->find_fail = 0;
/* save off how much we've already allocated from our memcap */
h->overhead_bytes = h->mc.memused;
h->overhead_blocks = h->mc.nblocks;
return h;
}
