Cross Reference: /external/sqlite/dist/orig/sqlite3.c

Lines Matching defs:pEntry
23671 /* Link pNew element into the hash table pH.  If pEntry!=0 then also
23672 ** insert pNew into the pEntry hash bucket.
23676   struct _ht *pEntry,    /* The entry into which pNew is inserted */
23679   HashElem *pHead;       /* First element already in pEntry */
23680   if( pEntry ){
23681     pHead = pEntry->count ? pEntry->chain : 0;
23682     pEntry->count++;
23683     pEntry->chain = pNew;
23758     struct _ht *pEntry = &pH->ht[h];
23759     elem = pEntry->chain;
23760     count = pEntry->count;
23782   struct _ht *pEntry;
23792     pEntry = &pH->ht[h];
23793     if( pEntry->chain==elem ){
23794       pEntry->chain = elem->next;
23796     pEntry->count--;
23797     assert( pEntry->count>=0 );
39706   struct RowSetEntry *pEntry;    /* List of entries using pRight */
39707   struct RowSetEntry *pLast;     /* Last entry on the pEntry list */
39718 #define ROWSET_SORTED  0x01   /* True if RowSet.pEntry is sorted */
39739   p->pEntry = 0;
39762   p->pEntry = 0;
39800   struct RowSetEntry *pEntry;  /* The new entry */
39806   pEntry = rowSetEntryAlloc(p);
39807   if( pEntry==0 ) return;
39808   pEntry->v = rowid;
39809   pEntry->pRight = 0;
39815     pLast->pRight = pEntry;
39817     p->pEntry = pEntry;
39819   p->pLast = pEntry;
39978 ** Take all the entries on p->pEntry and on the trees in p->pForest and
39979 ** sort them all together into one big ordered list on p->pEntry.
39989     p->pEntry = rowSetEntrySort(p->pEntry);
40003       p->pEntry = rowSetEntryMerge(p->pEntry, pHead);
40026   if( p->pEntry ){
40027     *pRowid = p->pEntry->v;
40028     p->pEntry = p->pEntry->pRight;
40029     if( p->pEntry==0 ){
40043 ** on pRowSet->pEntry, then sort those entires into the forest at
40055     p = pRowSet->pEntry;
40081       pRowSet->pEntry = 0;
134638   struct _fts3ht *pEntry,  /* The entry into which pNew is inserted */
134641   Fts3HashElem *pHead;     /* First element already in pEntry */
134642   pHead = pEntry->chain;
134655   pEntry->count++;
134656   pEntry->chain = pNew;
134701     struct _fts3ht *pEntry = &pH->ht[h];
134702     elem = pEntry->chain;
134703     count = pEntry->count;
134723   struct _fts3ht *pEntry;
134732   pEntry = &pH->ht[h];
134733   if( pEntry->chain==elem ){
134734     pEntry->chain = elem->next;
134736   pEntry->count--;
134737   if( pEntry->count<=0 ){
134738     pEntry->chain = 0;