Lines Matching refs:pEntry

32855 /* Link pNew element into the hash table pH.  If pEntry!=0 then also
32856 ** insert pNew into the pEntry hash bucket.
32860   struct _ht *pEntry,    /* The entry into which pNew is inserted */
32863   HashElem *pHead;       /* First element already in pEntry */
32864   if( pEntry ){
32865     pHead = pEntry->count ? pEntry->chain : 0;
32866     pEntry->count++;
32867     pEntry->chain = pNew;
32944     struct _ht *pEntry;
32946     pEntry = &pH->ht[h];
32947     elem = pEntry->chain;
32948     count = pEntry->count;
32973   struct _ht *pEntry;
32983     pEntry = &pH->ht[h];
32984     if( pEntry->chain==elem ){
32985       pEntry->chain = elem->next;
32987     assert( pEntry->count>0 );
32988     pEntry->count--;
51055   struct RowSetEntry *pEntry;    /* List of entries using pRight */
51056   struct RowSetEntry *pLast;     /* Last entry on the pEntry list */
51067 #define ROWSET_SORTED  0x01   /* True if RowSet.pEntry is sorted */
51080     p->pEntry = 0;
51105   p->pEntry = 0;
51155   struct RowSetEntry *pEntry;  /* The new entry */
51161   pEntry = rowSetEntryAlloc(p);
51162   if( pEntry==0 ) return;
51163   pEntry->v = rowid;
51164   pEntry->pRight = 0;
51172     pLast->pRight = pEntry;
51174     p->pEntry = pEntry;
51176   p->pLast = pEntry;
51359       p->pEntry = rowSetEntrySort(p->pEntry);
51365   if( p->pEntry ){
51366     *pRowid = p->pEntry->v;
51367     p->pEntry = p->pEntry->pRight;
51368     if( p->pEntry==0 ){ /*OPTIMIZATION-IF-TRUE*/
51383 ** on pRowSet->pEntry, then sort those entries into the forest at
51396     p = pRowSet->pEntry;
51423       pRowSet->pEntry = 0;
109427   HashElem *pEntry;
109455   pEntry = sqliteHashFirst(&db->aDb[1].pSchema->trigHash);
109456   while( pEntry ){
109457     Trigger *pTrig = (Trigger*)sqliteHashData(pEntry);
109461     pEntry = sqliteHashNext(pEntry);
174136   struct _fts3ht *pEntry,  /* The entry into which pNew is inserted */
174139   Fts3HashElem *pHead;     /* First element already in pEntry */
174140   pHead = pEntry->chain;
174153   pEntry->count++;
174154   pEntry->chain = pNew;
174199     struct _fts3ht *pEntry = &pH->ht[h];
174200     elem = pEntry->chain;
174201     count = pEntry->count;
174221   struct _fts3ht *pEntry;
174230   pEntry = &pH->ht[h];
174231   if( pEntry->chain==elem ){
174232     pEntry->chain = elem->next;
174234   pEntry->count--;
174235   if( pEntry->count<=0 ){
174236     pEntry->chain = 0;
210984     Fts5TermsetEntry *pEntry;
210996     for(pEntry=p->apHash[hash]; pEntry; pEntry=pEntry->pNext){
210997       if( pEntry->iIdx==iIdx 
210998           && pEntry->nTerm==nTerm 
210999           && memcmp(pEntry->pTerm, pTerm, nTerm)==0 
211006     if( pEntry==0 ){
211007       pEntry = sqlite3Fts5MallocZero(&rc, sizeof(Fts5TermsetEntry) + nTerm);
211008       if( pEntry ){
211009         pEntry->pTerm = (char*)&pEntry[1];
211010         pEntry->nTerm = nTerm;
211011         pEntry->iIdx = iIdx;
211012         memcpy(pEntry->pTerm, pTerm, nTerm);
211013         pEntry->pNext = p->apHash[hash];
211014         p->apHash[hash] = pEntry;
211026       Fts5TermsetEntry *pEntry = p->apHash[i];
211027       while( pEntry ){
211028         Fts5TermsetEntry *pDel = pEntry;
211029         pEntry = pEntry->pNext;
214968 **   char *fts5EntryKey(Fts5HashEntry *pEntry){ return zKey; }
215353         Fts5HashEntry *pEntry = pIter;
215354         pEntry->pScanNext = 0;
215356           pEntry = fts5HashEntryMerge(pEntry, ap[i]);
215359         ap[i] = pEntry;