Home | History | Annotate | Download | only in dist

Lines Matching defs:pHash

9704 ** Collisions are on the FuncDef.pHash chain.
9899 FuncDef *pHash; /* Next with a different name but the same hash */
14660 FuncDefHash *pHash = &GLOBAL(FuncDefHash, sqlite3GlobalFunctions);
14664 sqlite3FuncDefInsert(pHash, &aFunc[i]);
78707 FuncDefHash *pHash = &GLOBAL(FuncDefHash, sqlite3GlobalFunctions);
78711 sqlite3FuncDefInsert(pHash, &aFunc[i]);
79577 0, /* pHash */
79670 0, /* pHash */
79712 0, /* pHash */
80809 0, /* pHash */
80831 0, /* pHash */
81604 Hash *pHash;
81607 pHash = &db->aDb[iDb].pSchema->idxHash;
81609 pIndex = sqlite3HashInsert(pHash, zIdxName, len, 0);
83105 Hash *pHash;
83110 pHash = &pDb->pSchema->tblHash;
83111 for(pElem=sqliteHashFirst(pHash); pElem; pElem=sqliteHashNext(pElem)){
83117 pHash = &pDb->pSchema->idxHash;
83118 for(pElem=sqliteHashFirst(pHash); pElem; pElem=sqliteHashNext(pElem)){
85314 FuncDefHash *pHash, /* Hash table to search */
85320 for(p=pHash->a[h]; p; p=p->pHash){
85332 FuncDefHash *pHash, /* The hash table into which to insert */
85338 int h = (sqlite3UpperToLower[c1] + nName) % ArraySize(pHash->a);
85339 pOther = functionSearch(pHash, h, pDef->zName, nName);
85346 pDef->pHash = pHash->a[h];
85347 pHash->a[h] = pDef;
85415 FuncDefHash *pHash = &GLOBAL(FuncDefHash, sqlite3GlobalFunctions);
85417 p = functionSearch(pHash, h, zName, nName);
87688 ** FuncDef.pHash elements at start-time. The elements of this array
87765 FuncDefHash *pHash = &GLOBAL(FuncDefHash, sqlite3GlobalFunctions);
87769 sqlite3FuncDefInsert(pHash, &aFunc[i]);
99673 Hash *pHash = &db->aDb[iDb].pSchema->trigHash;
99675 pTrig = sqlite3HashInsert(pHash, zName, sqlite3Strlen30(zName), pTrig);
99952 Hash *pHash;
99955 pHash = &(db->aDb[iDb].pSchema->trigHash);
99956 pTrigger = sqlite3HashInsert(pHash, zName, sqlite3Strlen30(zName), 0);
112658 FuncDefHash *pHash = &GLOBAL(FuncDefHash, sqlite3GlobalFunctions);
112660 memset(pHash, 0, sizeof(sqlite3GlobalFunctions));
113264 FuncDef *pNext, *pHash, *p;
113265 for(p=db->aFunc.a[j]; p; p=pHash){
113266 pHash = p->pHash;
116919 SQLITE_PRIVATE int sqlite3Fts3InitTokenizer(Fts3Hash *pHash, const char *,
117719 pHash = (Fts3Hash *)pAux;
117780 rc = sqlite3Fts3InitTokenizer(pHash, &z[9], &pTokenizer, pzErr);
117916 rc = sqlite3Fts3InitTokenizer(pHash, "simple", &pTokenizer, pzErr);
120155 Fts3Hash *pHash = (Fts3Hash *)p;
120156 sqlite3Fts3HashClear(pHash);
120157 sqlite3_free(pHash);
120184 Fts3Hash *pHash = 0;
120205 pHash = sqlite3_malloc(sizeof(Fts3Hash));
120206 if( !pHash ){
120209 sqlite3Fts3HashInit(pHash, FTS3_HASH_STRING, 1);
120214 if( sqlite3Fts3HashInsert(pHash, "simple", 7, (void *)pSimple)
120215 || sqlite3Fts3HashInsert(pHash, "porter", 7, (void *)pPorter)
120217 || (pIcu && sqlite3Fts3HashInsert(pHash, "icu", 4, (void *)pIcu))
120236 && SQLITE_OK==(rc = sqlite3Fts3InitHashTable(db, pHash, "fts3_tokenizer"))
120246 db, "fts1", &fts3Module, (void *)pHash, 0
120250 db, "fts2", &fts3Module, (void *)pHash, 0
120255 db, "fts3", &fts3Module, (void *)pHash, hashDestroy
120259 db, "fts4", &fts3Module, (void *)pHash, 0
120267 if( pHash ){
120268 sqlite3Fts3HashClear(pHash);
120269 sqlite3_free(pHash);
124437 Fts3Hash *pHash;
124444 pHash = (Fts3Hash *)sqlite3_user_data(context);
124457 pOld = sqlite3Fts3HashInsert(pHash, (void *)zName, nName, pPtr);
124463 pPtr = sqlite3Fts3HashFind(pHash, zName, nName);
124527 Fts3Hash *pHash, /* Tokenizer hash table */
124547 m = (sqlite3_tokenizer_module *)sqlite3Fts3HashFind(pHash,z,(int)strlen(z)+1);
124620 Fts3Hash *pHash;
124653 pHash = (Fts3Hash *)sqlite3_user_data(context);
124654 p = (sqlite3_tokenizer_module *)sqlite3Fts3HashFind(pHash, zName, nName+1);
124807 ** the hash table pointed to by argument pHash. The hash table must
124811 ** sqlite3Fts3HashInit(pHash, FTS3_HASH_STRING, 1);
124817 ** provide read/write access to the contents of *pHash.
124824 Fts3Hash *pHash,
124828 void *p = (void *)pHash;
125755 Fts3Hash *pHash, /* Pending terms hash table to add entry to */
125762 pList = (PendingList *)fts3HashFind(pHash, zToken, nToken);
125767 if( pList==fts3HashInsert(pHash, zToken, nToken, pList) ){
125771 assert( 0==fts3HashFind(pHash, zToken, nToken) );
125899 Fts3Hash *pHash = &p->aIndex[i].hPending;
125900 for(pElem=fts3HashFirst(pHash); pElem; pElem=fts3HashNext(pElem)){
125904 fts3HashClear(pHash);
126668 Fts3Hash *pHash;
126670 pHash = &p->aIndex[iIndex].hPending;
126674 for(pE=fts3HashFirst(pHash); pE; pE=fts3HashNext(pE)){
126712 pE = fts3HashFindElem(pHash, zTerm, nTerm);