Lines Matching defs:pEntry
21437 /* Link pNew element into the hash table pH. If pEntry!=0 then also
21438 ** insert pNew into the pEntry hash bucket.
21442 struct _ht *pEntry, /* The entry into which pNew is inserted */
21445 HashElem *pHead; /* First element already in pEntry */
21446 if( pEntry ){
21447 pHead = pEntry->count ? pEntry->chain : 0;
21448 pEntry->count++;
21449 pEntry->chain = pNew;
21520 struct _ht *pEntry = &pH->ht[h];
21521 elem = pEntry->chain;
21522 count = pEntry->count;
21544 struct _ht *pEntry;
21554 pEntry = &pH->ht[h];
21555 if( pEntry->chain==elem ){
21556 pEntry->chain = elem->next;
21558 pEntry->count--;
21559 assert( pEntry->count>=0 );
35990 struct RowSetEntry *pEntry; /* List of entries using pRight */
35991 struct RowSetEntry *pLast; /* Last entry on the pEntry list */
35995 u8 isSorted; /* True if pEntry is sorted */
36017 p->pEntry = 0;
36040 p->pEntry = 0;
36053 struct RowSetEntry *pEntry; /* The new entry */
36067 pEntry = p->pFresh++;
36069 pEntry->v = rowid;
36070 pEntry->pRight = 0;
36076 pLast->pRight = pEntry;
36078 assert( p->pEntry==0 ); /* Fires if INSERT after SMALLEST */
36079 p->pEntry = pEntry;
36081 p->pLast = pEntry;
36124 ** Sort all elements on the pEntry list of the RowSet into ascending order.
36128 struct RowSetEntry *pEntry;
36133 while( p->pEntry ){
36134 pEntry = p->pEntry;
36135 p->pEntry = pEntry->pRight;
36136 pEntry->pRight = 0;
36138 pEntry = rowSetMerge(aBucket[i], pEntry);
36141 aBucket[i] = pEntry;
36143 pEntry = 0;
36145 pEntry = rowSetMerge(pEntry, aBucket[i]);
36147 p->pEntry = pEntry;
36243 ** Convert the list in p->pEntry into a sorted list if it is not
36245 ** convert it into a list too and merge it into the p->pEntry list.
36255 p->pEntry = rowSetMerge(p->pEntry, pHead);
36269 if( p->pEntry ){
36270 *pRowid = p->pEntry->v;
36271 p->pEntry = p->pEntry->pRight;
36272 if( p->pEntry==0 ){
36288 if( pRowSet->pEntry ){
36290 pRowSet->pTree = rowSetListToTree(pRowSet->pEntry);
36291 pRowSet->pEntry = 0;
118338 struct _fts3ht *pEntry, /* The entry into which pNew is inserted */
118341 Fts3HashElem *pHead; /* First element already in pEntry */
118342 pHead = pEntry->chain;
118355 pEntry->count++;
118356 pEntry->chain = pNew;
118401 struct _fts3ht *pEntry = &pH->ht[h];
118402 elem = pEntry->chain;
118403 count = pEntry->count;
118423 struct _fts3ht *pEntry;
118432 pEntry = &pH->ht[h];
118433 if( pEntry->chain==elem ){
118434 pEntry->chain = elem->next;
118436 pEntry->count--;
118437 if( pEntry->count<=0 ){
118438 pEntry->chain = 0;
