Lines Matching refs:pEntry

36963 /* Link pNew element into the hash table pH.  If pEntry!=0 then also
36964 ** insert pNew into the pEntry hash bucket.
36968   struct _ht *pEntry,    /* The entry into which pNew is inserted */
36971   HashElem *pHead;       /* First element already in pEntry */
36972   if( pEntry ){
36973     pHead = pEntry->count ? pEntry->chain : 0;
36974     pEntry->count++;
36975     pEntry->chain = pNew;
37052     struct _ht *pEntry;
37054     pEntry = &pH->ht[h];
37055     elem = pEntry->chain;
37056     count = pEntry->count;
37082   struct _ht *pEntry;
37092     pEntry = &pH->ht[h];
37093     if( pEntry->chain==elem ){
37094       pEntry->chain = elem->next;
37096     assert( pEntry->count>0 );
37097     pEntry->count--;
56550   struct RowSetEntry *pEntry;    /* List of entries using pRight */
56551   struct RowSetEntry *pLast;     /* Last entry on the pEntry list */
56562 #define ROWSET_SORTED  0x01   /* True if RowSet.pEntry is sorted */
56575     p->pEntry = 0;
56600   p->pEntry = 0;
56650   struct RowSetEntry *pEntry;  /* The new entry */
56656   pEntry = rowSetEntryAlloc(p);
56657   if( pEntry==0 ) return;
56658   pEntry->v = rowid;
56659   pEntry->pRight = 0;
56667     pLast->pRight = pEntry;
56669     p->pEntry = pEntry;
56671   p->pLast = pEntry;
56854       p->pEntry = rowSetEntrySort(p->pEntry);
56860   if( p->pEntry ){
56861     *pRowid = p->pEntry->v;
56862     p->pEntry = p->pEntry->pRight;
56863     if( p->pEntry==0 ){ /*OPTIMIZATION-IF-TRUE*/
56878 ** on pRowSet->pEntry, then sort those entries into the forest at
56891     p = pRowSet->pEntry;
56918       pRowSet->pEntry = 0;
120765   HashElem *pEntry;
120795   pEntry = sqliteHashFirst(&db->aDb[1].pSchema->trigHash);
120796   while( pEntry ){
120797     Trigger *pTrig = (Trigger*)sqliteHashData(pEntry);
120801     pEntry = sqliteHashNext(pEntry);
194366   struct _fts3ht *pEntry,  /* The entry into which pNew is inserted */
194369   Fts3HashElem *pHead;     /* First element already in pEntry */
194370   pHead = pEntry->chain;
194383   pEntry->count++;
194384   pEntry->chain = pNew;
194429     struct _fts3ht *pEntry = &pH->ht[h];
194430     elem = pEntry->chain;
194431     count = pEntry->count;
194451   struct _fts3ht *pEntry;
194460   pEntry = &pH->ht[h];
194461   if( pEntry->chain==elem ){
194462     pEntry->chain = elem->next;
194464   pEntry->count--;
194465   if( pEntry->count<=0 ){
194466     pEntry->chain = 0;
235577     Fts5TermsetEntry *pEntry;
235589     for(pEntry=p->apHash[hash]; pEntry; pEntry=pEntry->pNext){
235590       if( pEntry->iIdx==iIdx
235591           && pEntry->nTerm==nTerm
235592           && memcmp(pEntry->pTerm, pTerm, nTerm)==0
235599     if( pEntry==0 ){
235600       pEntry = sqlite3Fts5MallocZero(&rc, sizeof(Fts5TermsetEntry) + nTerm);
235601       if( pEntry ){
235602         pEntry->pTerm = (char*)&pEntry[1];
235603         pEntry->nTerm = nTerm;
235604         pEntry->iIdx = iIdx;
235605         memcpy(pEntry->pTerm, pTerm, nTerm);
235606         pEntry->pNext = p->apHash[hash];
235607         p->apHash[hash] = pEntry;
235619       Fts5TermsetEntry *pEntry = p->apHash[i];
235620       while( pEntry ){
235621         Fts5TermsetEntry *pDel = pEntry;
235622         pEntry = pEntry->pNext;
240015 **   char *fts5EntryKey(Fts5HashEntry *pEntry){ return zKey; }
240402         Fts5HashEntry *pEntry = pIter;
240403         pEntry->pScanNext = 0;
240405           pEntry = fts5HashEntryMerge(pEntry, ap[i]);
240408         ap[i] = pEntry;