src/misc/hash/hashFlt.h File Reference

#include <stdio.h>
#include "extra.h"

Include dependency graph for hashFlt.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	Hash_Flt_Entry_t_
struct	Hash_Flt_t_
Defines
#define	Hash_FltForEachEntry(pHash, pEntry, bin)
Typedefs
typedef struct Hash_Flt_t_	Hash_Flt_t
typedef struct Hash_Flt_Entry_t_	Hash_Flt_Entry_t
Functions
int	Hash_DefaultHashFunc (int key, int nBins)
static Hash_Flt_t *	Hash_FltAlloc (int nBins)
static int	Hash_FltExists (Hash_Flt_t *p, int key)
static void	Hash_FltWriteEntry (Hash_Flt_t *p, int key, float data)
static float	Hash_FltEntry (Hash_Flt_t *p, int key, int fCreate)
static float *	Hash_FltEntryPtr (Hash_Flt_t *p, int key)
static void	Hash_FltRemove (Hash_Flt_t *p, int key)
static void	Hash_FltFree (Hash_Flt_t *p)

---

Define Documentation

#define Hash_FltForEachEntry	(	pHash,
		pEntry,
		bin		)

Value:

for(bin=-1, pEntry=NULL; bin < pHash->nBins; (!pEntry)?(pEntry=pHash->pArray[++bin]):(pEntry=pEntry->pNext)) \
    if (pEntry)

MACRO DEFINITIONS ///

Definition at line 65 of file hashFlt.h.

---

Typedef Documentation

typedef struct Hash_Flt_Entry_t_ Hash_Flt_Entry_t

Definition at line 42 of file hashFlt.h.

typedef struct Hash_Flt_t_ Hash_Flt_t

PARAMETERS /// BASIC TYPES ///

Definition at line 41 of file hashFlt.h.

---

Function Documentation

int Hash_DefaultHashFunc	(	int	key,
		int	nBins
	)

CFile****************************************************************

FileName [hashFlt.h]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Hash maps.]

Synopsis [Hash maps.]

Author [Aaron P. Hurst]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - May 16, 2006.]

Revision [

Id

vecInt.h,v 1.00 2005/06/20 00:00:00 ahurst Exp

] INCLUDES ///

CFile****************************************************************

FileName [hash.h]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Hash map.]

Synopsis [External declarations.]

Author [Aaron P. Hurst]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - May 16, 2005.]

Revision [

Id

vec.h,v 1.00 2005/06/20 00:00:00 ahurst Exp

] INCLUDES /// PARAMETERS /// BASIC TYPES /// MACRO DEFINITIONS /// FUNCTION DECLARATIONS ///

Definition at line 56 of file hash.h.

                                             {
  return ABS( ( (key+11)*(key)*7+3 ) % nBins );
}

static Hash_Flt_t* Hash_FltAlloc

(

int

nBins

)

[inline, static]

FUNCTION DEFINITIONS ///Function*************************************************************

Synopsis [Allocates a hash map with the given number of bins.]

Description []

SideEffects []

SeeAlso []

Definition at line 84 of file hashFlt.h.

{
  Hash_Flt_t * p;
  int i;
  assert(nBins > 0);
  p = ALLOC( Hash_Flt_t, 1);
  p->nBins = nBins;
  p->fHash = Hash_DefaultHashFunc;
  p->nSize  = 0;
  p->pArray = ALLOC( Hash_Flt_Entry_t *, nBins );
  for(i=0; i<nBins; i++)
    p->pArray[i] = NULL;

  return p;
}

static float Hash_FltEntry	(	Hash_Flt_t *	p,
		int	key,
		int	fCreate
	)			[inline, static]

Function*************************************************************

Synopsis [Finds or creates an entry with a key.]

Description [fCreate specifies whether new entries should be created.]

SideEffects []

SeeAlso []

Definition at line 187 of file hashFlt.h.

{
  int bin;
  Hash_Flt_Entry_t *pEntry, **pLast;

  // find the bin where this key would live
  bin = (*(p->fHash))(key, p->nBins);

  // search for key
  pLast = &(p->pArray[bin]);
  pEntry = p->pArray[bin];
  while(pEntry) {
    if (pEntry->key == key)
      return pEntry->data;
    pLast = &(pEntry->pNext);
    pEntry = pEntry->pNext;
  }

  // this key does not currently exist
  if (fCreate) {
    // create a new entry and add to bin
    p->nSize++;
    (*pLast) = pEntry = ALLOC( Hash_Flt_Entry_t, 1 );
    pEntry->pNext = NULL;
    pEntry->key = key;
    pEntry->data = 0.0;
    return pEntry->data;
  }

  return 0.0;
}

static float* Hash_FltEntryPtr	(	Hash_Flt_t *	p,
		int	key
	)			[inline, static]

Function*************************************************************

Synopsis [Finds or creates an entry with a key and returns the pointer to it.]

Description []

SideEffects []

SeeAlso []

Definition at line 231 of file hashFlt.h.

{
  int bin;
  Hash_Flt_Entry_t *pEntry, **pLast;

  // find the bin where this key would live
  bin = (*(p->fHash))(key, p->nBins);

  // search for key
  pLast = &(p->pArray[bin]);
  pEntry = p->pArray[bin];
  while(pEntry) {
    if (pEntry->key == key)
      return &(pEntry->data);
    pLast = &(pEntry->pNext);
    pEntry = pEntry->pNext;
  }

  // this key does not currently exist
  // create a new entry and add to bin
  p->nSize++;
  (*pLast) = pEntry = ALLOC( Hash_Flt_Entry_t, 1 );
  pEntry->pNext = NULL;
  pEntry->key = key;
  pEntry->data = 0.0;

  return &(pEntry->data);
}

static int Hash_FltExists	(	Hash_Flt_t *	p,
		int	key
	)			[inline, static]

Function*************************************************************

Synopsis [Returns 1 if a key already exists.]

Description []

SideEffects []

SeeAlso []

Definition at line 111 of file hashFlt.h.

{
  int bin;
  Hash_Flt_Entry_t *pEntry, **pLast;

  // find the bin where this key would live
  bin = (*(p->fHash))(key, p->nBins);

  // search for key
  pLast = &(p->pArray[bin]);
  pEntry = p->pArray[bin];
  while(pEntry) {
    if (pEntry->key == key) {
      return 1;
    }
    pLast = &(pEntry->pNext);
    pEntry = pEntry->pNext;
  }

  return 0;
}

static void Hash_FltFree

(

Hash_Flt_t *

p

)

[inline, static]

Function*************************************************************

Synopsis [Frees the hash.]

Description []

SideEffects []

SeeAlso []

Definition at line 308 of file hashFlt.h.

                                                 {
  int bin;
  Hash_Flt_Entry_t *pEntry;

  // free bins
  for(bin = 0; bin < p->nBins; bin++) {
    pEntry = p->pArray[bin];
    while(pEntry) {
      pEntry = pEntry->pNext;
      FREE( pEntry );
    }
  }
 
  // free hash
  FREE( p->pArray );
  FREE( p );
}

static void Hash_FltRemove	(	Hash_Flt_t *	p,
		int	key
	)			[inline, static]

Function*************************************************************

Synopsis [Deletes an entry.]

Description []

SideEffects []

SeeAlso []

Definition at line 271 of file hashFlt.h.

{
  int    bin;
  Hash_Flt_Entry_t *pEntry, **pLast;

  // find the bin where this key would live
  bin = (*(p->fHash))(key, p->nBins);

  // search for key
  pLast = &(p->pArray[bin]);
  pEntry = p->pArray[bin];
  while(pEntry) {
    if (pEntry->key == key) {
      p->nSize--;
      *pLast = pEntry->pNext;
      FREE( pEntry );
      return;
    }
    pLast = &(pEntry->pNext);
    pEntry = pEntry->pNext;
  }
    
  // could not find key
  return;
}

static void Hash_FltWriteEntry	(	Hash_Flt_t *	p,
		int	key,
		float	data
	)			[inline, static]

Function*************************************************************

Synopsis [Finds or creates an entry with a key and writes value.]

Description []

SideEffects []

SeeAlso []

Definition at line 144 of file hashFlt.h.

{
  int bin;
  Hash_Flt_Entry_t *pEntry, **pLast;

  // find the bin where this key would live
  bin = (*(p->fHash))(key, p->nBins);

  // search for key
  pLast = &(p->pArray[bin]);
  pEntry = p->pArray[bin];
  while(pEntry) {
    if (pEntry->key == key) {
      pEntry->data = data;
      return;
    }
    pLast = &(pEntry->pNext);
    pEntry = pEntry->pNext;
  }

  // this key does not currently exist
  // create a new entry and add to bin
  p->nSize++;
  (*pLast) = pEntry = ALLOC( Hash_Flt_Entry_t, 1 );
  pEntry->pNext = NULL;
  pEntry->key = key;
  pEntry->data = data;

  return;
}