88   struct RowSetEntry *pRight;   /* Right subtree (larger entries) or list */  member
220   pEntry->pRight = 0;  in sqlite3RowSetInsert()
228     pLast->pRight = pEntry;  in sqlite3RowSetInsert()
251     assert( pA->pRight==0 || pA->v<=pA->pRight->v );  in rowSetEntryMerge()
252     assert( pB->pRight==0 || pB->v<=pB->pRight->v );  in rowSetEntryMerge()
254       if( pA->v<pB->v ) pTail = pTail->pRight = pA;  in rowSetEntryMerge()
255       pA = pA->pRight;  in rowSetEntryMerge()
257         pTail->pRight = pB;  in rowSetEntryMerge()
261       pTail = pTail->pRight = pB;  in rowSetEntryMerge()
262       pB = pB->pRight;  in rowSetEntryMerge()
264         pTail->pRight = pA;  in rowSetEntryMerge()
269   return head.pRight;  in rowSetEntryMerge()
282     pNext = pIn->pRight;  in rowSetEntrySort()
283     pIn->pRight = 0;  in rowSetEntrySort()
314     p->pRight = pIn;  in rowSetTreeToList()
318   if( pIn->pRight ){  in rowSetTreeToList()
319     rowSetTreeToList(pIn->pRight, &pIn->pRight, ppLast);  in rowSetTreeToList()
323   assert( (*ppLast)->pRight==0 );  in rowSetTreeToList()
362     *ppList = p->pRight;  in rowSetNDeepTree()
363     p->pRight = rowSetNDeepTree(ppList, iDepth-1);  in rowSetNDeepTree()
366     *ppList = p->pRight;  in rowSetNDeepTree()
367     p->pLeft = p->pRight = 0;  in rowSetNDeepTree()
383   pList = p->pRight;  in rowSetListToTree()
384   p->pLeft = p->pRight = 0;  in rowSetListToTree()
388     pList = p->pRight;  in rowSetListToTree()
390     p->pRight = rowSetNDeepTree(&pList, iDepth);  in rowSetListToTree()
423     p->pEntry = p->pEntry->pRight;  in sqlite3RowSetNext()
459       for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){  in sqlite3RowSetTest()
460         ppPrevTree = &pTree->pRight;  in sqlite3RowSetTest()
475           pTree->pRight = 0;  in sqlite3RowSetTest()
489   for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){  in sqlite3RowSetTest()
493         p = p->pRight;  in sqlite3RowSetTest()