Lines Matching defs:pEntry
105 struct RowSetEntry *pEntry; /* List of entries using pRight */
106 struct RowSetEntry *pLast; /* Last entry on the pEntry list */
110 u8 isSorted; /* True if pEntry is sorted */
132 p->pEntry = 0;
155 p->pEntry = 0;
168 struct RowSetEntry *pEntry; /* The new entry */
182 pEntry = p->pFresh++;
184 pEntry->v = rowid;
185 pEntry->pRight = 0;
191 pLast->pRight = pEntry;
193 assert( p->pEntry==0 ); /* Fires if INSERT after SMALLEST */
194 p->pEntry = pEntry;
196 p->pLast = pEntry;
239 ** Sort all elements on the pEntry list of the RowSet into ascending order.
243 struct RowSetEntry *pEntry;
248 while( p->pEntry ){
249 pEntry = p->pEntry;
250 p->pEntry = pEntry->pRight;
251 pEntry->pRight = 0;
253 pEntry = rowSetMerge(aBucket[i], pEntry);
256 aBucket[i] = pEntry;
258 pEntry = 0;
260 pEntry = rowSetMerge(pEntry, aBucket[i]);
262 p->pEntry = pEntry;
358 ** Convert the list in p->pEntry into a sorted list if it is not
360 ** convert it into a list too and merge it into the p->pEntry list.
370 p->pEntry = rowSetMerge(p->pEntry, pHead);
384 if( p->pEntry ){
385 *pRowid = p->pEntry->v;
386 p->pEntry = p->pEntry->pRight;
387 if( p->pEntry==0 ){
403 if( pRowSet->pEntry ){
405 pRowSet->pTree = rowSetListToTree(pRowSet->pEntry);
406 pRowSet->pEntry = 0;