Home
last modified time | relevance | path

Searched refs:pHash (Results 1 – 8 of 8) sorted by relevance

/freebsd-13.1/stand/ficl/
H A Ddict.c412 FICL_HASH *pHash; in dictCreateWordlist() local
420 hashReset(pHash); in dictCreateWordlist()
421 return pHash; in dictCreateWordlist()
444 FICL_HASH *pHash; in dictEmpty() local
595 assert(pHash); in ficlLookupLoc()
672 assert(pHash); in dictUnsmudge()
706 assert(pHash); in hashForget()
770 assert(pHash); in hashInsertWord()
779 pList = pHash->table + (pFW->hash % pHash->size); in hashInsertWord()
806 for (; pHash != NULL; pHash = pHash->link) in hashLookup()
[all …]
H A Dprefix.c76 FICL_HASH *pHash; in ficlParsePrefix() local
86 pHash = (FICL_HASH *)(pFW->param[0].p); in ficlParsePrefix()
90 for (i = 0; i < (int)pHash->size; i++) in ficlParsePrefix()
92 pFW = pHash->table[i]; in ficlParsePrefix()
161 FICL_HASH *pHash; in ficlCompilePrefix() local
172 pHash = dictCreateWordlist(dp, 1); in ficlCompilePrefix()
173 pHash->name = list_name; in ficlCompilePrefix()
175 dictAppendCell(dp, LVALUEtoCELL(pHash)); in ficlCompilePrefix()
186 dp->pCompile = pHash; in ficlCompilePrefix()
H A Dsearch.c83 stackPushPtr(pVM->pStack, pHash); in forthWordlist()
141 FICL_HASH *pHash = stackPopPtr(pVM->pStack); in searchWordlist() local
148 pFW = hashLookup(pHash, si, hashCode); in searchWordlist()
175 pDict->pCompile = pHash; in setCurrent()
241 FICL_HASH *pHash; in ficlWordlist() local
248 pHash = dictCreateWordlist(dp, nBuckets); in ficlWordlist()
249 stackPushPtr(pVM->pStack, pHash); in ficlWordlist()
303 FICL_HASH *pHash = vmPop(pVM).p; in widGetName() local
304 char *cp = pHash->name; in widGetName()
323 FICL_HASH *pHash = vmPop(pVM).p; in widSetName() local
[all …]
H A Dtools.c698 FICL_HASH *pHash; in forgetWid() local
700 pHash = (FICL_HASH *)stackPopPtr(pVM->pStack); in forgetWid()
701 hashForget(pHash, pDict->here); in forgetWid()
723 FICL_HASH *pHash = pDict->pCompile; in forget() local
727 hashForget(pHash, where); in forget()
742 FICL_HASH *pHash = dp->pSearch[dp->nLists - 1]; in listWords() local
752 for (i = 0; i < pHash->size; i++) in listWords()
754 for (wp = pHash->table[i]; wp != NULL; wp = wp->link, nWords++) in listWords()
819 FICL_HASH *pHash = dp->pForthWords; in listEnv() local
824 for (i = 0; i < pHash->size; i++) in listEnv()
[all …]
H A Dtestmain.c215 FICL_HASH *pHash = vmGetDict(pVM)->pForthWords; in spewHash() local
219 unsigned nHash = pHash->size; in spewHash()
235 pFW = pHash->table[i]; in spewHash()
244 pFW = pHash->table[i]; in spewHash()
H A Dficl.h692 void hashForget (FICL_HASH *pHash, void *where);
694 void hashInsertWord(FICL_HASH *pHash, FICL_WORD *pFW);
695 FICL_WORD *hashLookup (FICL_HASH *pHash, STRINGINFO si, UNS16 hashCode);
696 void hashReset (FICL_HASH *pHash);
/freebsd-13.1/contrib/sqlite3/
H A Dsqlite3.c33931 if( pHash ) *pHash = h;
113620 Hash *pHash;
114457 Hash *pHash;
114482 Hash *pHash;
116240 Hash *pHash;
141675 Hash *pHash;
176711 if( !pHash ){
176768 if( pHash ){
222475 if( pHash ){
222636 if( (pHash->nEntry*2)>=pHash->nSlot ){
[all …]
H A Dshell.c9435 static void idxHashInit(IdxHash *pHash){ in idxHashInit() argument
9436 memset(pHash, 0, sizeof(IdxHash)); in idxHashInit()
9442 static void idxHashClear(IdxHash *pHash){ in idxHashClear() argument
9447 for(pEntry=pHash->aHash[i]; pEntry; pEntry=pNext){ in idxHashClear()
9453 memset(pHash, 0, sizeof(IdxHash)); in idxHashClear()
9476 IdxHash *pHash, in idxHashAdd() argument
9498 pEntry->pHashNext = pHash->aHash[iHash]; in idxHashAdd()
9499 pHash->aHash[iHash] = pEntry; in idxHashAdd()
9501 pEntry->pNext = pHash->pFirst; in idxHashAdd()
9502 pHash->pFirst = pEntry; in idxHashAdd()
[all …]