inc/hash.h File Reference

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

Go to the source code of this file.

Data Structures
struct	hashEl
struct	hash
struct	hashCookie
Defines
#define	hashMaxSize   24
#define	hashNew(a)   newHash(a)
#define	hashFree(a)   freeHash(a)
Functions
bits32	hashString (char *string)
bits32	hashCrc (char *string)
hashEl *	hashLookup (struct hash *hash, char *name)
hashEl *	hashLookupUpperCase (struct hash *hash, char *name)
hashEl *	hashLookupNext (struct hashEl *hashEl)
hashEl *	hashAdd (struct hash *hash, char *name, void *val)
hashEl *	hashAddN (struct hash *hash, char *name, int nameSize, void *val)
void *	hashRemove (struct hash *hash, char *name)
hashEl *	hashAddUnique (struct hash *hash, char *name, void *val)
hashEl *	hashAddSaveName (struct hash *hash, char *name, void *val, char **saveName)
hashEl *	hashStore (struct hash *hash, char *name)
char *	hashStoreName (struct hash *hash, char *name)
char *	hashMustFindName (struct hash *hash, char *name)
void *	hashMustFindVal (struct hash *hash, char *name)
void *	hashFindVal (struct hash *hash, char *name)
void *	hashOptionalVal (struct hash *hash, char *name, void *usual)
hashEl *	hashAddInt (struct hash *hash, char *name, int val)
int	hashIntVal (struct hash *hash, char *name)
int	hashIntValDefault (struct hash *hash, char *name, int defaultInt)
long long	hashIntSum (struct hash *hash)
void	hashTraverseEls (struct hash *hash, void(*func)(struct hashEl *hel))
void	hashTraverseVals (struct hash *hash, void(*func)(void *val))
hashEl *	hashElListHash (struct hash *hash)
int	hashElCmp (const void *va, const void *vb)
void *	hashElFindVal (struct hashEl *list, char *name)
void	hashElFree (struct hashEl **pEl)
void	hashElFreeList (struct hashEl **pList)
hashCookie	hashFirst (struct hash *hash)
hashEl *	hashNext (struct hashCookie *cookie)
void *	hashNextVal (struct hashCookie *cookie)
char *	hashNextName (struct hashCookie *cookie)
hash *	newHash (int powerOfTwoSize)
hash *	hashFromSlNameList (void *list)
void	freeHash (struct hash **pHash)
void	freeHashAndVals (struct hash **pHash)
void	hashFreeWithVals (struct hash **pHash, void(freeFunc)())
void	hashFreeList (struct hash **pList)
void	hashHisto (struct hash *hash, char *fname)
hashEl *	hashReplace (struct hash *hash, char *name, void *val)
boolean	hashMayRemove (struct hash *hash, char *name)
void	hashMustRemove (struct hash *hash, char *name)
char *	hashToRaString (struct hash *hash)

---

Define Documentation

#define hashFree

(

a

)

freeHash(a)

Definition at line 159 of file hash.h.

Referenced by gfFileCacheFree(), hashFreeList(), hashFreeWithVals(), nibTwoCacheFree(), pcrClumps(), pslTblFree(), raFoldIn(), trixClose(), twoBitClose(), and xpFree().

#define hashMaxSize   24

Definition at line 28 of file hash.h.

#define hashNew

(

a

)

newHash(a)

Definition at line 151 of file hash.h.

Referenced by buildSymHash(), chainReadUsedSwapLf(), dnaSeqHash(), faReadAllIntoHash(), gfFileCacheNew(), hashNameIntFile(), hashTwoColumnFile(), htmlHeaderRead(), initialEntityHash(), lineFileSetUniqueMetaData(), pscmOpen(), pslTblNew(), raFoldIn(), raReadAll(), and twoBitOpen().

---

Function Documentation

void freeHash

(

struct hash **

pHash

)

Definition at line 462 of file hash.c.

References freez(), hash::lm, and lmCleanup().

Referenced by bigBlat(), blat(), cgiVarExcludeExcept(), checkTagIsInside(), dgFree(), formParseVars(), freeHashAndVals(), gfAlignTrans(), gfAlignTransTrans(), gffFileFree(), gfWebConfigRead(), maskFromOut(), metaDataFree(), and xStitch().

{
struct hash *hash = *pHash;
if (hash == NULL)
    return;
lmCleanup(&hash->lm);
freez(pHash);
}

Here is the call graph for this function:

Here is the caller graph for this function:

void freeHashAndVals

(

struct hash **

pHash

)

Definition at line 473 of file hash.c.

References freeHash(), freeMem(), and hashTraverseVals().

Referenced by dtdParse(), emblOpen(), and htmlPageFree().

{
struct hash *hash;
if ((hash = *pHash) != NULL)
    {
    hashTraverseVals(hash, freeMem);
    freeHash(pHash);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

struct hashEl* hashAdd	(	struct hash *	hash,
		char *	name,
		void *	val
	)			[read]

Definition at line 126 of file hash.c.

References hashAddN().

Referenced by addToBigBundleList(), blat(), bundleIntoTargets(), cgiVarExcludeExcept(), chainReadUsedSwapLf(), checkTagIsInside(), dgAddNode(), dgFindSubEdges(), emblRecord(), faReadAllIntoHash(), findOrMakeVar(), gffFileAddRow(), gfiExpandAndLoadCached(), gfWebConfigRead(), hashAddInt(), hashAddSaveName(), hashAddUnique(), hashFromSlNameList(), hashReplace(), hashStore(), hashStoreName(), hashTwoColumnFile(), hashVarLine(), hashWordsInFile(), htmlHeaderRead(), htmlPageParse(), initialEntityHash(), loadHashT3Ranges(), maskFromOut(), metaDataAdd(), netUrlHead(), nibInfoFromCache(), parseAnOption(), parseEntity(), parseGtfEnd(), parseMultiOption(), pcrClumps(), pscmSetHint(), raFoldIn(), raFoldInOneRetName(), raFromString(), raNextRecord(), raReadAll(), readPartHeaderMB(), readPslToBinKeeper(), trixSearchWordResults(), and xmlEscapeSymHash().

{
return hashAddN(hash, name, strlen(name), val);
}

Here is the call graph for this function:

Here is the caller graph for this function:

struct hashEl* hashAddInt	(	struct hash *	hash,
		char *	name,
		int	val
	)			[read]

Definition at line 262 of file hash.c.

References hashAdd().

Referenced by buildSymHash(), and hashNameIntFile().

{
char *pt = NULL;
return hashAdd(hash, name, pt + val);
}

Here is the call graph for this function:

Here is the caller graph for this function:

struct hashEl* hashAddN	(	struct hash *	hash,
		char *	name,
		int	nameSize,
		void *	val
	)			[read]

Definition at line 112 of file hash.c.

References hash::elCount, hashString(), hash::lm, lmAlloc(), hash::mask, and hash::table.

Referenced by hashAdd().

{
struct hashEl *el = lmAlloc(hash->lm, sizeof(*el));
int hashVal = (hashString(name)&hash->mask);
el->name = lmAlloc(hash->lm, nameSize+1);
memcpy(el->name, name, nameSize);
el->val = val;
el->next = hash->table[hashVal];
hash->table[hashVal] = el;
hash->elCount += 1;
return el;
}

Here is the call graph for this function:

Here is the caller graph for this function:

struct hashEl* hashAddSaveName	(	struct hash *	hash,
		char *	name,
		void *	val,
		char **	saveName
	)			[read]

Definition at line 173 of file hash.c.

References hashAdd(), and hashEl::name.

Referenced by cgiParseInputAbort(), cgiParseMultipart(), cgiVarSet(), parseCookies(), parseElement(), and twoBitOpen().

                                                                       :
 *    AllocVar(el);
 *    hashAddSaveName(hash, name, el, &el->name);
 */
{
struct hashEl *hel = hashAdd(hash, name, val);
*saveName = hel->name;
return hel;
}

Here is the call graph for this function:

Here is the caller graph for this function:

struct hashEl* hashAddUnique	(	struct hash *	hash,
		char *	name,
		void *	val
	)			[read]

Definition at line 165 of file hash.c.

References errAbort(), hashAdd(), and hashLookup().

Referenced by dnaSeqHash(), and seqListToTrans3List().

{
if (hashLookup(hash, name) != NULL)
    errAbort("%s duplicated, aborting", name);
return hashAdd(hash, name, val);
}

Here is the call graph for this function:

Here is the caller graph for this function:

bits32 hashCrc

(

char *

string

)

Definition at line 56 of file hash.c.

References bits32.

{
unsigned char *us = (unsigned char *)string;
unsigned char c;
bits32 shiftAcc = 0;
bits32 addAcc = 0;

while ((c = *us++) != 0)
    {
    shiftAcc <<= 2;
    shiftAcc += c;
    addAcc += c;
    }
return shiftAcc + addAcc;
}

int hashElCmp	(	const void *	va,
		const void *	vb
	)

Definition at line 346 of file hash.c.

References hashEl::name.

Referenced by hashToRaString().

{
const struct hashEl *a = *((struct hashEl **)va);
const struct hashEl *b = *((struct hashEl **)vb);
return strcmp(a->name, b->name);
}

Here is the caller graph for this function:

void* hashElFindVal	(	struct hashEl *	list,
		char *	name
	)

Definition at line 354 of file hash.c.

References hashEl::name, hashEl::next, and hashEl::val.

{
struct hashEl *el;
for (el = list; el != NULL; el = el->next)
    {
    if (strcmp(el->name, name) == 0)
        return el->val;
    }
return NULL;
}

void hashElFree

(

struct hashEl **

pEl

)

Definition at line 383 of file hash.c.

References freez().

{
freez(pEl);
}

Here is the call graph for this function:

void hashElFreeList

(

struct hashEl **

pList

)

Definition at line 390 of file hash.c.

References slFreeList().

Referenced by cgiVarExcludeExcept(), hashToRaString(), nibTwoCacheFree(), and pcrClumps().

{
slFreeList(pList);
}

Here is the call graph for this function:

Here is the caller graph for this function:

struct hashEl* hashElListHash

(

struct hash *

hash

)

[read]

Definition at line 366 of file hash.c.

References CloneVar, hashEl::next, hash::size, slAddHead, and hash::table.

Referenced by cgiVarExcludeExcept(), hashToRaString(), nibTwoCacheFree(), and pcrClumps().

{
int i;
struct hashEl *hel, *dupe, *list = NULL;
for (i=0; i<hash->size; ++i)
    {
    for (hel = hash->table[i]; hel != NULL; hel = hel->next)
        {
        dupe = CloneVar(hel);
        slAddHead(&list, dupe);
        }
    }
return list;
}

Here is the caller graph for this function:

void* hashFindVal	(	struct hash *	hash,
		char *	name
	)

Definition at line 233 of file hash.c.

References hashLookup(), and hashEl::val.

Referenced by addToBigBundleList(), bundleIntoTargets(), cgiParseMultipart(), emblOpen(), expandEntities(), findCookieData(), findOrMakeVar(), findVarData(), fixupChildRefs(), gfiExpandAndLoadCached(), htmlPageForwarded(), htmlPageParse(), htmlPageValidateOrAbort(), loadHashT3Ranges(), mafMayFindComponentInHash(), maskFromOut(), nibInfoFromCache(), optGet(), optionMultiVal(), parseAttribute(), parseElement(), parseEntity(), parseMultiOption(), parseMultiParts(), pcrClumps(), raFoldInOneRetName(), raReadAll(), trans3Find(), trixSearchWordResults(), twoBitSeekTo(), and xpLookup().

{
struct hashEl *hel = hashLookup(hash, name);
if (hel == NULL)
    return NULL;
return hel->val;
}

Here is the call graph for this function:

Here is the caller graph for this function:

struct hashCookie hashFirst

(

struct hash *

hash

)

[read]

Definition at line 397 of file hash.c.

References hashCookie::hash, hash::size, and hash::table.

Referenced by hashFreeWithVals(), and mafMayFindAllComponents().

{
struct hashCookie cookie;
cookie.hash = hash;
cookie.idx = 0;
cookie.nextEl = NULL;

/* find first entry */
for (cookie.idx = 0;
     (cookie.idx < hash->size) && (hash->table[cookie.idx] == NULL);
     cookie.idx++)
    continue;  /* empty body */
if (cookie.idx < hash->size)
    cookie.nextEl = hash->table[cookie.idx];
return cookie;
}

Here is the caller graph for this function:

void hashFreeList

(

struct hash **

pList

)

Definition at line 501 of file hash.c.

References hashFree, and hash::next.

{
struct hash *el, *next;

for (el = *pList; el != NULL; el = next)
    {
    next = el->next;
    hashFree(&el);
    }
*pList = NULL;
}

void hashFreeWithVals	(	struct hash **	pHash,
		void(freeFunc)()
	)

Definition at line 485 of file hash.c.

References hashCookie::hash, hashFirst(), hashFree, hashNext(), and hashEl::val.

{
struct hash *hash = *pHash;
if (hash != NULL)
    {
    struct hashCookie cookie = hashFirst(hash);
    struct hashEl *hel;
    while ((hel = hashNext(&cookie)) != NULL)
        freeFunc(&hel->val);
    hashFree(pHash);
    }
}

Here is the call graph for this function:

struct hash* hashFromSlNameList

(

void *

list

)

[read]

Definition at line 308 of file hash.c.

References hashAdd(), newHash(), and slName::next.

{
struct hash *hash = NULL;
struct slName *namedList = list, *item;
if (!list)
    return NULL;
hash = newHash(0);
for (item = namedList; item != NULL; item = item->next)
    hashAdd(hash, item->name, item);
return hash;
}

Here is the call graph for this function:

void hashHisto	(	struct hash *	hash,
		char *	fname
	)

Definition at line 523 of file hash.c.

References bucketLen(), carefulClose(), mustOpen(), hash::size, and hash::table.

{
FILE* fh = mustOpen(fname, "w");
int i;

for (i=0; i<hash->size; ++i)
    fprintf(fh, "%d\n", bucketLen(hash->table[i]));
carefulClose(&fh);
}

Here is the call graph for this function:

long long hashIntSum

(

struct hash *

hash

)

Definition at line 269 of file hash.c.

References hashEl::next, ptToInt(), hash::size, hash::table, and hashEl::val.

{
long long sum = 0;
int i;
struct hashEl *hel;
for (i=0; i<hash->size; ++i)
    {
    for (hel = hash->table[i]; hel != NULL; hel = hel->next)
        {
        int num = ptToInt(hel->val);
        sum += (long long)num;
        }
    }
return sum;
}

Here is the call graph for this function:

int hashIntVal	(	struct hash *	hash,
		char *	name
	)

Definition at line 207 of file hash.c.

References hashMustFindVal(), ptToInt(), and hashEl::val.

Referenced by sqlEnumParse(), and sqlSetParse().

{
void *val = hashMustFindVal(hash, name);
return ptToInt(val);
}

Here is the call graph for this function:

Here is the caller graph for this function:

int hashIntValDefault	(	struct hash *	hash,
		char *	name,
		int	defaultInt
	)

Definition at line 214 of file hash.c.

References hashLookup(), ptToInt(), and hashEl::val.

{
struct hashEl *hel = hashLookup(hash, name);
if(hel == NULL)
    return defaultInt;
return ptToInt(hel->val);
}

Here is the call graph for this function:

struct hashEl* hashLookup	(	struct hash *	hash,
		char *	name
	)			[read]

Definition at line 73 of file hash.c.

References hashString(), hash::mask, hashEl::name, hashEl::next, and hash::table.

Referenced by cgiStringList(), cgiVarExcludeExcept(), cgiVarExists(), chainReadUsedSwapLf(), checkTagIsInside(), dgAddNode(), dgFindNode(), dgFindSubEdges(), faReadAllIntoHash(), gffFileAddRow(), gffGroupLines(), gfWebConfigRead(), hashAddUnique(), hashFindVal(), hashIntValDefault(), hashLookupUpperCase(), hashMustFindName(), hashMustFindVal(), hashOptionalVal(), hashReplace(), hashStore(), hashStoreName(), metaDataAdd(), parseEntity(), parseGtfEnd(), pscmSetHint(), raFoldIn(), raFoldInOneRetName(), and readPslToBinKeeper().

{
struct hashEl *el = hash->table[hashString(name)&hash->mask];
while (el != NULL)
    {
    if (strcmp(el->name, name) == 0)
        break;
    el = el->next;
    }
return el;
}

Here is the call graph for this function:

Here is the caller graph for this function:

struct hashEl* hashLookupNext

(

struct hashEl *

hashEl

)

[read]

Definition at line 98 of file hash.c.

References hashEl::name, and hashEl::next.

{
struct hashEl *el = hashEl->next;
while (el != NULL)
    {
    if (strcmp(el->name, hashEl->name) == 0)
        break;
    el = el->next;
    }
return el;
}

struct hashEl* hashLookupUpperCase	(	struct hash *	hash,
		char *	name
	)			[read]

Definition at line 87 of file hash.c.

References hashLookup(), safef(), and touppers().

{
char s[256];
safef(s, sizeof(s), "%s", name);
touppers(s);
return hashLookup(hash, s);
}

Here is the call graph for this function:

boolean hashMayRemove	(	struct hash *	hash,
		char *	name
	)

Definition at line 132 of file hash.c.

References hashRemove().

{
return (hashRemove(hash, name) != NULL);
}

Here is the call graph for this function:

char* hashMustFindName	(	struct hash *	hash,
		char *	name
	)

Definition at line 252 of file hash.c.

References errAbort(), hashLookup(), and hashEl::name.

{
struct hashEl *hel = hashLookup(hash, name);
if (hel == NULL)
    errAbort("%s not found", name);
return hel->name;
}

Here is the call graph for this function:

void* hashMustFindVal	(	struct hash *	hash,
		char *	name
	)

Definition at line 224 of file hash.c.

References errAbort(), hashLookup(), and hashEl::val.

Referenced by chainLookup(), gfAlignTrans(), gfFindAlignAaTrans(), hashIntVal(), readPslToBinKeeper(), saveAlignments(), saveAxtBundle(), and savePslx().

{
struct hashEl *hel = hashLookup(hash, name);
if (hel == NULL)
    errAbort("%s not found", name);
return hel->val;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void hashMustRemove	(	struct hash *	hash,
		char *	name
	)

Definition at line 139 of file hash.c.

References errAbort(), and hashRemove().

{
if (hashRemove(hash, name) == NULL)
    errAbort("attempt to remove non-existant %s from hash", name);
}

Here is the call graph for this function:

struct hashEl* hashNext

(

struct hashCookie *

cookie

)

[read]

Definition at line 416 of file hash.c.

References hashCookie::hash, hashCookie::idx, hashEl::next, hashCookie::nextEl, hash::size, and hash::table.

Referenced by hashFreeWithVals(), hashNextName(), hashNextVal(), and mafMayFindAllComponents().

{
/* NOTE: if hashRemove were coded to track the previous entry during the
 * search and then use it to do the remove, it would be possible to
 * remove the entry returned by this method */
struct hashEl *retEl = cookie->nextEl;
if (retEl == NULL)
    return NULL;  /* no more */

/* find next entry */
cookie->nextEl = retEl->next;
if (cookie->nextEl == NULL)
    {
    for (cookie->idx++; (cookie->idx < cookie->hash->size)
             && (cookie->hash->table[cookie->idx] == NULL); cookie->idx++)
        continue;  /* empty body */
    if (cookie->idx < cookie->hash->size)
        cookie->nextEl = cookie->hash->table[cookie->idx];
    }
return retEl;
}

Here is the caller graph for this function:

char* hashNextName

(

struct hashCookie *

cookie

)

Definition at line 451 of file hash.c.

References hashNext(), and hashEl::name.

{
struct hashEl *hel = hashNext(cookie);
if (hel == NULL)
    return NULL;
else
    return hel->name;
}

Here is the call graph for this function:

void* hashNextVal

(

struct hashCookie *

cookie

)

Definition at line 440 of file hash.c.

References hashNext(), and hashEl::val.

{
struct hashEl *hel = hashNext(cookie);
if (hel == NULL)
    return NULL;
else
    return hel->val;
}

Here is the call graph for this function:

void* hashOptionalVal	(	struct hash *	hash,
		char *	name,
		void *	usual
	)

Definition at line 242 of file hash.c.

References hashLookup(), and hashEl::val.

Referenced by pscmGetHint().

{
struct hashEl *hel = hashLookup(hash, name);
if (hel == NULL)
    return usual;
else
    return hel->val;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void* hashRemove	(	struct hash *	hash,
		char *	name
	)

Definition at line 147 of file hash.c.

References hash::elCount, hashString(), hash::mask, hashEl::name, hashEl::next, sameString, slRemoveEl(), hash::table, and hashEl::val.

Referenced by cgiVarExclude(), hashMayRemove(), hashMustRemove(), hashReplace(), and pscmSetHint().

{
struct hashEl *hel;
void *ret;
struct hashEl **pBucket = &hash->table[hashString(name)&hash->mask];
for (hel = *pBucket; hel != NULL; hel = hel->next)
    if (sameString(hel->name, name))
        break;
if (hel == NULL)
    return NULL;
ret = hel->val;
if (slRemoveEl(pBucket, hel))
    hash->elCount -= 1;
return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

struct hashEl* hashReplace	(	struct hash *	hash,
		char *	name,
		void *	val
	)			[read]

Definition at line 534 of file hash.c.

References hashAdd(), hashLookup(), and hashRemove().

{
if (hashLookup(hash, name))
    hashRemove(hash, name);
return hashAdd(hash, name, val);
}

Here is the call graph for this function:

struct hashEl* hashStore	(	struct hash *	hash,
		char *	name
	)			[read]

Definition at line 185 of file hash.c.

References hashAdd(), and hashLookup().

Referenced by pslQueryGet().

{
struct hashEl *hel;
if ((hel = hashLookup(hash, name)) != NULL)
    return hel;
return hashAdd(hash, name, NULL);
}

Here is the call graph for this function:

Here is the caller graph for this function:

char* hashStoreName	(	struct hash *	hash,
		char *	name
	)

Definition at line 195 of file hash.c.

References hashAdd(), hashLookup(), and hashEl::name.

Referenced by xStitch().

{
struct hashEl *hel;
if (name == NULL)
    return NULL;
if ((hel = hashLookup(hash, name)) != NULL)
    return hel->name;
return hashAdd(hash, name, NULL)->name;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bits32 hashString

(

char *

string

)

Definition at line 42 of file hash.c.

Referenced by hashAddN(), hashLookup(), and hashRemove().

{
char *keyStr = string;
unsigned int result = 0;
int c;

while ((c = *keyStr++) != '\0')
    {
    result += (result<<3) + c;
    }
return result;
}

Here is the caller graph for this function:

char* hashToRaString

(

struct hash *

hash

)

Definition at line 542 of file hash.c.

References dyStringAppend(), dyStringAppendC(), dyStringCannibalize(), dyStringNew, hashElCmp(), hashElFreeList(), hashElListHash(), hashEl::name, hashEl::next, slSort(), and hashEl::val.

{
struct hashEl *el, *list = hashElListHash(hash);
struct dyString *dy = dyStringNew(0);
slSort(&list, hashElCmp);
for (el = list; el != NULL; el = el->next)
   {
   dyStringAppend(dy, el->name);
   dyStringAppendC(dy, ' ');
   dyStringAppend(dy, el->val);
   dyStringAppendC(dy, '\n');
   }
hashElFreeList(&list);
return dyStringCannibalize(&dy);
}

Here is the call graph for this function:

void hashTraverseEls	(	struct hash *	hash,
		void(*)(struct hashEl *hel)	func
	)

Definition at line 322 of file hash.c.

References hashEl::next, hash::size, and hash::table.

Referenced by gfFileCacheFree().

{
int i;
struct hashEl *hel;
for (i=0; i<hash->size; ++i)
    {
    for (hel = hash->table[i]; hel != NULL; hel = hel->next)
        func(hel);
    }
}

Here is the caller graph for this function:

void hashTraverseVals	(	struct hash *	hash,
		void(*)(void *val)	func
	)

Definition at line 334 of file hash.c.

References hashEl::next, hash::size, hash::table, and hashEl::val.

Referenced by freeHashAndVals(), and trixClose().

{
int i;
struct hashEl *hel;
for (i=0; i<hash->size; ++i)
    {
    for (hel = hash->table[i]; hel != NULL; hel = hel->next)
        func(hel->val);
    }
}

Here is the caller graph for this function:

struct hash* newHash

(

int

powerOfTwoSize

)

[read]

Definition at line 286 of file hash.c.

References lmAlloc(), lmInit(), and needMem().

Referenced by blat(), bundleIntoTargets(), cgiParseInputAbort(), cgiParseMultipart(), cgiVarExcludeExcept(), checkTagIsInside(), dgFindSubEdges(), dgNew(), dtdParse(), emblRecord(), formParseVars(), gffFileNew(), gfLongDnaInMem(), gfLongTransTransInMem(), gfWebConfigRead(), hashFromSlNameList(), hashVarLine(), hashWordsInFile(), loadHashT3Ranges(), maskFromOut(), nibTwoCacheNew(), parseCookies(), parseOptions(), pcrClumps(), raFoldInOneRetName(), raFromString(), raNextRecord(), readPartHeaderMB(), readPslToBinKeeper(), seqListToTrans3List(), trixNew(), xmlEscapeSymHash(), and xStitch().

{
struct hash *hash = needMem(sizeof(*hash));
int memBlockPower = 16;
if (powerOfTwoSize == 0)
    powerOfTwoSize = 12;
assert(powerOfTwoSize <= hashMaxSize && powerOfTwoSize > 0);
hash->powerOfTwoSize = powerOfTwoSize;
hash->size = (1<<powerOfTwoSize);
/* Make size of memory block for allocator vary between
 * 256 bytes and 64k depending on size of table. */
if (powerOfTwoSize < 8)
    memBlockPower = 8;
else if (powerOfTwoSize < 16)
    memBlockPower = powerOfTwoSize;
hash->lm = lmInit(1<<memBlockPower);
hash->mask = hash->size-1;
hash->table = lmAlloc(hash->lm, sizeof(struct hashEl *) * hash->size);
return hash;
}

Here is the call graph for this function:

Here is the caller graph for this function:

---