Lines Matching refs:pEntry

33832 /* Link pNew element into the hash table pH.  If pEntry!=0 then also
33833 ** insert pNew into the pEntry hash bucket.
33837   struct _ht *pEntry,    /* The entry into which pNew is inserted */
33840   HashElem *pHead;       /* First element already in pEntry */
33841   if( pEntry ){
33842     pHead = pEntry->count ? pEntry->chain : 0;
33843     pEntry->count++;
33844     pEntry->chain = pNew;
33921     struct _ht *pEntry;
33923     pEntry = &pH->ht[h];
33924     elem = pEntry->chain;
33925     count = pEntry->count;
33950   struct _ht *pEntry;
33960     pEntry = &pH->ht[h];
33961     if( pEntry->chain==elem ){
33962       pEntry->chain = elem->next;
33964     assert( pEntry->count>0 );
33965     pEntry->count--;
52106   struct RowSetEntry *pEntry;    /* List of entries using pRight */
52107   struct RowSetEntry *pLast;     /* Last entry on the pEntry list */
52118 #define ROWSET_SORTED  0x01   /* True if RowSet.pEntry is sorted */
52131     p->pEntry = 0;
52156   p->pEntry = 0;
52206   struct RowSetEntry *pEntry;  /* The new entry */
52212   pEntry = rowSetEntryAlloc(p);
52213   if( pEntry==0 ) return;
52214   pEntry->v = rowid;
52215   pEntry->pRight = 0;
52223     pLast->pRight = pEntry;
52225     p->pEntry = pEntry;
52227   p->pLast = pEntry;
52410       p->pEntry = rowSetEntrySort(p->pEntry);
52416   if( p->pEntry ){
52417     *pRowid = p->pEntry->v;
52418     p->pEntry = p->pEntry->pRight;
52419     if( p->pEntry==0 ){ /*OPTIMIZATION-IF-TRUE*/
52434 ** on pRowSet->pEntry, then sort those entries into the forest at
52447     p = pRowSet->pEntry;
52474       pRowSet->pEntry = 0;
112436   HashElem *pEntry;
112466   pEntry = sqliteHashFirst(&db->aDb[1].pSchema->trigHash);
112467   while( pEntry ){
112468     Trigger *pTrig = (Trigger*)sqliteHashData(pEntry);
112472     pEntry = sqliteHashNext(pEntry);
180767   struct _fts3ht *pEntry,  /* The entry into which pNew is inserted */
180770   Fts3HashElem *pHead;     /* First element already in pEntry */
180771   pHead = pEntry->chain;
180784   pEntry->count++;
180785   pEntry->chain = pNew;
180830     struct _fts3ht *pEntry = &pH->ht[h];
180831     elem = pEntry->chain;
180832     count = pEntry->count;
180852   struct _fts3ht *pEntry;
180861   pEntry = &pH->ht[h];
180862   if( pEntry->chain==elem ){
180863     pEntry->chain = elem->next;
180865   pEntry->count--;
180866   if( pEntry->count<=0 ){
180867     pEntry->chain = 0;
218272     Fts5TermsetEntry *pEntry;
218284     for(pEntry=p->apHash[hash]; pEntry; pEntry=pEntry->pNext){
218285       if( pEntry->iIdx==iIdx
218286           && pEntry->nTerm==nTerm
218287           && memcmp(pEntry->pTerm, pTerm, nTerm)==0
218294     if( pEntry==0 ){
218295       pEntry = sqlite3Fts5MallocZero(&rc, sizeof(Fts5TermsetEntry) + nTerm);
218296       if( pEntry ){
218297         pEntry->pTerm = (char*)&pEntry[1];
218298         pEntry->nTerm = nTerm;
218299         pEntry->iIdx = iIdx;
218300         memcpy(pEntry->pTerm, pTerm, nTerm);
218301         pEntry->pNext = p->apHash[hash];
218302         p->apHash[hash] = pEntry;
218314       Fts5TermsetEntry *pEntry = p->apHash[i];
218315       while( pEntry ){
218316         Fts5TermsetEntry *pDel = pEntry;
218317         pEntry = pEntry->pNext;
222436 **   char *fts5EntryKey(Fts5HashEntry *pEntry){ return zKey; }
222821         Fts5HashEntry *pEntry = pIter;
222822         pEntry->pScanNext = 0;
222824           pEntry = fts5HashEntryMerge(pEntry, ap[i]);
222827         ap[i] = pEntry;