contrib/sqlite3/sqlite3.c

37453 /* Link pNew element into the hash table pH.  If pEntry!=0 then also
37454 ** insert pNew into the pEntry hash bucket.
37458   struct _ht *pEntry,    /* The entry into which pNew is inserted */
37461   HashElem *pHead;       /* First element already in pEntry */
37462   if( pEntry ){
37463     pHead = pEntry->count ? pEntry->chain : 0;
37464     pEntry->count++;
37465     pEntry->chain = pNew;
37542     struct _ht *pEntry;
37543     pEntry = &pH->ht[h % pH->htsize];
37544     elem = pEntry->chain;
37545     count = pEntry->count;
37569   struct _ht *pEntry;
37579     pEntry = &pH->ht[elem->h % pH->htsize];
37580     if( pEntry->chain==elem ){
37581       pEntry->chain = elem->next;
37583     assert( pEntry->count>0 );
37584     pEntry->count--;
57500   struct RowSetEntry *pEntry;    /* List of entries using pRight */
57501   struct RowSetEntry *pLast;     /* Last entry on the pEntry list */
57512 #define ROWSET_SORTED  0x01   /* True if RowSet.pEntry is sorted */
57525     p->pEntry = 0;
57550   p->pEntry = 0;
57600   struct RowSetEntry *pEntry;  /* The new entry */
57606   pEntry = rowSetEntryAlloc(p);
57607   if( pEntry==0 ) return;
57608   pEntry->v = rowid;
57609   pEntry->pRight = 0;
57617     pLast->pRight = pEntry;
57619     p->pEntry = pEntry;
57621   p->pLast = pEntry;
57804       p->pEntry = rowSetEntrySort(p->pEntry);
57810   if( p->pEntry ){
57811     *pRowid = p->pEntry->v;
57812     p->pEntry = p->pEntry->pRight;
57813     if( p->pEntry==0 ){ /*OPTIMIZATION-IF-TRUE*/
57828 ** on pRowSet->pEntry, then sort those entries into the forest at
57841     p = pRowSet->pEntry;
57868       pRowSet->pEntry = 0;
122408   HashElem *pEntry;
122438   pEntry = sqliteHashFirst(&db->aDb[1].pSchema->trigHash);
122439   while( pEntry ){
122440     Trigger *pTrig = (Trigger*)sqliteHashData(pEntry);
122444     pEntry = sqliteHashNext(pEntry);
197337   struct _fts3ht *pEntry,  /* The entry into which pNew is inserted */
197340   Fts3HashElem *pHead;     /* First element already in pEntry */
197341   pHead = pEntry->chain;
197354   pEntry->count++;
197355   pEntry->chain = pNew;
197400     struct _fts3ht *pEntry = &pH->ht[h];
197401     elem = pEntry->chain;
197402     count = pEntry->count;
197422   struct _fts3ht *pEntry;
197431   pEntry = &pH->ht[h];
197432   if( pEntry->chain==elem ){
197433     pEntry->chain = elem->next;
197435   pEntry->count--;
197436   if( pEntry->count<=0 ){
197437     pEntry->chain = 0;
239205     Fts5TermsetEntry *pEntry;
239217     for(pEntry=p->apHash[hash]; pEntry; pEntry=pEntry->pNext){
239218       if( pEntry->iIdx==iIdx
239219           && pEntry->nTerm==nTerm
239220           && memcmp(pEntry->pTerm, pTerm, nTerm)==0
239227     if( pEntry==0 ){
239228       pEntry = sqlite3Fts5MallocZero(&rc, sizeof(Fts5TermsetEntry) + nTerm);
239229       if( pEntry ){
239230         pEntry->pTerm = (char*)&pEntry[1];
239231         pEntry->nTerm = nTerm;
239232         pEntry->iIdx = iIdx;
239233         memcpy(pEntry->pTerm, pTerm, nTerm);
239234         pEntry->pNext = p->apHash[hash];
239235         p->apHash[hash] = pEntry;
239247       Fts5TermsetEntry *pEntry = p->apHash[i];
239248       while( pEntry ){
239249         Fts5TermsetEntry *pDel = pEntry;
239250         pEntry = pEntry->pNext;
243745 **   char *fts5EntryKey(Fts5HashEntry *pEntry){ return zKey; }
244132         Fts5HashEntry *pEntry = pIter;
244133         pEntry->pScanNext = 0;
244135           pEntry = fts5HashEntryMerge(pEntry, ap[i]);
244138         ap[i] = pEntry;