lib/sqlite/sqlite3.c

21863 /* Link pNew element into the hash table pH.  If pEntry!=0 then also
21864 ** insert pNew into the pEntry hash bucket.
21868   struct _ht *pEntry,    /* The entry into which pNew is inserted */
21871   HashElem *pHead;       /* First element already in pEntry */
21872   if( pEntry ){
21873     pHead = pEntry->count ? pEntry->chain : 0;
21874     pEntry->count++;
21875     pEntry->chain = pNew;
21946     struct _ht *pEntry = &pH->ht[h];
21947     elem = pEntry->chain;
21948     count = pEntry->count;
21970   struct _ht *pEntry;
21980     pEntry = &pH->ht[h];
21981     if( pEntry->chain==elem ){
21982       pEntry->chain = elem->next;
21984     pEntry->count--;
21985     assert( pEntry->count>=0 );
37092   struct RowSetEntry *pEntry;    /* List of entries using pRight */
37093   struct RowSetEntry *pLast;     /* Last entry on the pEntry list */
37097   u8 isSorted;                   /* True if pEntry is sorted */
37119   p->pEntry = 0;
37142   p->pEntry = 0;
37155   struct RowSetEntry *pEntry;  /* The new entry */
37169   pEntry = p->pFresh++;
37171   pEntry->v = rowid;
37172   pEntry->pRight = 0;
37178     pLast->pRight = pEntry;
37180     assert( p->pEntry==0 ); /* Fires if INSERT after SMALLEST */
37181     p->pEntry = pEntry;
37183   p->pLast = pEntry;
37226 ** Sort all elements on the pEntry list of the RowSet into ascending order.
37230   struct RowSetEntry *pEntry;
37235   while( p->pEntry ){
37236     pEntry = p->pEntry;
37237     p->pEntry = pEntry->pRight;
37238     pEntry->pRight = 0;
37240       pEntry = rowSetMerge(aBucket[i], pEntry);
37243     aBucket[i] = pEntry;
37245   pEntry = 0;
37247     pEntry = rowSetMerge(pEntry, aBucket[i]);
37249   p->pEntry = pEntry;
37345 ** Convert the list in p->pEntry into a sorted list if it is not
37347 ** convert it into a list too and merge it into the p->pEntry list.
37357     p->pEntry = rowSetMerge(p->pEntry, pHead);
37371   if( p->pEntry ){
37372     *pRowid = p->pEntry->v;
37373     p->pEntry = p->pEntry->pRight;
37374     if( p->pEntry==0 ){
37390     if( pRowSet->pEntry ){
37392       pRowSet->pTree = rowSetListToTree(pRowSet->pEntry);
37393       pRowSet->pEntry = 0;
120671   struct _fts3ht *pEntry,  /* The entry into which pNew is inserted */
120674   Fts3HashElem *pHead;     /* First element already in pEntry */
120675   pHead = pEntry->chain;
120688   pEntry->count++;
120689   pEntry->chain = pNew;
120734     struct _fts3ht *pEntry = &pH->ht[h];
120735     elem = pEntry->chain;
120736     count = pEntry->count;
120756   struct _fts3ht *pEntry;
120765   pEntry = &pH->ht[h];
120766   if( pEntry->chain==elem ){
120767     pEntry->chain = elem->next;
120769   pEntry->count--;
120770   if( pEntry->count<=0 ){
120771     pEntry->chain = 0;