Lines Matching refs:pIn
276 static struct RowSetEntry *rowSetEntrySort(struct RowSetEntry *pIn){ in rowSetEntrySort() argument
281 while( pIn ){ in rowSetEntrySort()
282 pNext = pIn->pRight; in rowSetEntrySort()
283 pIn->pRight = 0; in rowSetEntrySort()
285 pIn = rowSetEntryMerge(aBucket[i], pIn); in rowSetEntrySort()
288 aBucket[i] = pIn; in rowSetEntrySort()
289 pIn = pNext; in rowSetEntrySort()
291 pIn = aBucket[0]; in rowSetEntrySort()
294 pIn = pIn ? rowSetEntryMerge(pIn, aBucket[i]) : aBucket[i]; in rowSetEntrySort()
296 return pIn; in rowSetEntrySort()
306 struct RowSetEntry *pIn, /* Root of the input tree */ in rowSetTreeToList() argument
310 assert( pIn!=0 ); in rowSetTreeToList()
311 if( pIn->pLeft ){ in rowSetTreeToList()
313 rowSetTreeToList(pIn->pLeft, ppFirst, &p); in rowSetTreeToList()
314 p->pRight = pIn; in rowSetTreeToList()
316 *ppFirst = pIn; in rowSetTreeToList()
318 if( pIn->pRight ){ in rowSetTreeToList()
319 rowSetTreeToList(pIn->pRight, &pIn->pRight, ppLast); in rowSetTreeToList()
321 *ppLast = pIn; in rowSetTreeToList()