Lines Matching refs:pEntry
35386 /* Link pNew element into the hash table pH. If pEntry!=0 then also
35387 ** insert pNew into the pEntry hash bucket.
35391 struct _ht *pEntry, /* The entry into which pNew is inserted */
35394 HashElem *pHead; /* First element already in pEntry */
35395 if( pEntry ){
35396 pHead = pEntry->count ? pEntry->chain : 0;
35397 pEntry->count++;
35398 pEntry->chain = pNew;
35475 struct _ht *pEntry;
35477 pEntry = &pH->ht[h];
35478 elem = pEntry->chain;
35479 count = pEntry->count;
35504 struct _ht *pEntry;
35514 pEntry = &pH->ht[h];
35515 if( pEntry->chain==elem ){
35516 pEntry->chain = elem->next;
35518 assert( pEntry->count>0 );
35519 pEntry->count--;
54928 struct RowSetEntry *pEntry; /* List of entries using pRight */
54929 struct RowSetEntry *pLast; /* Last entry on the pEntry list */
54940 #define ROWSET_SORTED 0x01 /* True if RowSet.pEntry is sorted */
54953 p->pEntry = 0;
54978 p->pEntry = 0;
55028 struct RowSetEntry *pEntry; /* The new entry */
55034 pEntry = rowSetEntryAlloc(p);
55035 if( pEntry==0 ) return;
55036 pEntry->v = rowid;
55037 pEntry->pRight = 0;
55045 pLast->pRight = pEntry;
55047 p->pEntry = pEntry;
55049 p->pLast = pEntry;
55232 p->pEntry = rowSetEntrySort(p->pEntry);
55238 if( p->pEntry ){
55239 *pRowid = p->pEntry->v;
55240 p->pEntry = p->pEntry->pRight;
55241 if( p->pEntry==0 ){ /*OPTIMIZATION-IF-TRUE*/
55256 ** on pRowSet->pEntry, then sort those entries into the forest at
55269 p = pRowSet->pEntry;
55296 pRowSet->pEntry = 0;
116857 HashElem *pEntry;
116887 pEntry = sqliteHashFirst(&db->aDb[1].pSchema->trigHash);
116888 while( pEntry ){
116889 Trigger *pTrig = (Trigger*)sqliteHashData(pEntry);
116893 pEntry = sqliteHashNext(pEntry);
187783 struct _fts3ht *pEntry, /* The entry into which pNew is inserted */
187786 Fts3HashElem *pHead; /* First element already in pEntry */
187787 pHead = pEntry->chain;
187800 pEntry->count++;
187801 pEntry->chain = pNew;
187846 struct _fts3ht *pEntry = &pH->ht[h];
187847 elem = pEntry->chain;
187848 count = pEntry->count;
187868 struct _fts3ht *pEntry;
187877 pEntry = &pH->ht[h];
187878 if( pEntry->chain==elem ){
187879 pEntry->chain = elem->next;
187881 pEntry->count--;
187882 if( pEntry->count<=0 ){
187883 pEntry->chain = 0;
225354 Fts5TermsetEntry *pEntry;
225366 for(pEntry=p->apHash[hash]; pEntry; pEntry=pEntry->pNext){
225367 if( pEntry->iIdx==iIdx
225368 && pEntry->nTerm==nTerm
225369 && memcmp(pEntry->pTerm, pTerm, nTerm)==0
225376 if( pEntry==0 ){
225377 pEntry = sqlite3Fts5MallocZero(&rc, sizeof(Fts5TermsetEntry) + nTerm);
225378 if( pEntry ){
225379 pEntry->pTerm = (char*)&pEntry[1];
225380 pEntry->nTerm = nTerm;
225381 pEntry->iIdx = iIdx;
225382 memcpy(pEntry->pTerm, pTerm, nTerm);
225383 pEntry->pNext = p->apHash[hash];
225384 p->apHash[hash] = pEntry;
225396 Fts5TermsetEntry *pEntry = p->apHash[i];
225397 while( pEntry ){
225398 Fts5TermsetEntry *pDel = pEntry;
225399 pEntry = pEntry->pNext;
229521 ** char *fts5EntryKey(Fts5HashEntry *pEntry){ return zKey; }
229906 Fts5HashEntry *pEntry = pIter;
229907 pEntry->pScanNext = 0;
229909 pEntry = fts5HashEntryMerge(pEntry, ap[i]);
229912 ap[i] = pEntry;