313   Expr *pX;            /* An expression being tested */  in whereScanNext()  local
337            && (pX = whereRightSubexprIsColumn(pTerm->pExpr))!=0  in whereScanNext()
341               if( pScan->aiCur[j]==pX->iTable  in whereScanNext()
342                && pScan->aiColumn[j]==pX->iColumn ){  in whereScanNext()
347               pScan->aiCur[j] = pX->iTable;  in whereScanNext()
348               pScan->aiColumn[j] = pX->iColumn;  in whereScanNext()
357               pX = pTerm->pExpr;  in whereScanNext()
358               if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){  in whereScanNext()
361               assert(pX->pLeft);  in whereScanNext()
362               pColl = sqlite3ExprCompareCollSeq(pParse, pX);  in whereScanNext()
369              && (pX = pTerm->pExpr->pRight, ALWAYS(pX!=0))  in whereScanNext()
370              && pX->op==TK_COLUMN  in whereScanNext()
371              && pX->iTable==pScan->aiCur[0]  in whereScanNext()
372              && pX->iColumn==pScan->aiColumn[0]  in whereScanNext()
940         Expr *pX = pTerm->pExpr;  in constructAutomaticIndex()  local
943         pColl = sqlite3ExprCompareCollSeq(pParse, pX);  in constructAutomaticIndex()
2318   const WhereLoop *pX,       /* First WhereLoop to compare */  in whereLoopCheaperProperSubset()  argument
2322   if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){  in whereLoopCheaperProperSubset()
2325   if( pX->rRun>pY->rRun && pX->nOut>pY->nOut ) return 0;  in whereLoopCheaperProperSubset()
2326   if( pY->nSkip > pX->nSkip ) return 0;  in whereLoopCheaperProperSubset()
2327   for(i=pX->nLTerm-1; i>=0; i--){  in whereLoopCheaperProperSubset()
2328     if( pX->aLTerm[i]==0 ) continue;  in whereLoopCheaperProperSubset()
2330       if( pY->aLTerm[j]==pX->aLTerm[i] ) break;  in whereLoopCheaperProperSubset()
2334   if( (pX->wsFlags&WHERE_IDX_ONLY)!=0   in whereLoopCheaperProperSubset()
2626   WhereTerm *pTerm, *pX;  in whereLoopOutputAdjust()  local
2638       pX = pLoop->aLTerm[j];  in whereLoopOutputAdjust()
2639       if( pX==0 ) continue;  in whereLoopOutputAdjust()
2640       if( pX==pTerm ) break;  in whereLoopOutputAdjust()
2641       if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;  in whereLoopOutputAdjust()
3870     Expr *pX = pHidden->pWC->a[iTerm].pExpr;  in sqlite3_vtab_collation()  local
3871     if( pX->pLeft ){  in sqlite3_vtab_collation()
3872       pC = sqlite3ExprCompareCollSeq(pHidden->pParse, pX);  in sqlite3_vtab_collation()
4540             Expr *pX = pLoop->aLTerm[j]->pExpr;  in wherePathSatisfiesOrderBy()  local
4542               if( pLoop->aLTerm[i]->pExpr==pX ){  in wherePathSatisfiesOrderBy()
4795   WhereLoop **pX;           /* Used to divy up the pSpace memory */  in wherePathSolver()  local
4828   pX = (WhereLoop**)(aFrom+mxChoice);  in wherePathSolver()
4829   for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){  in wherePathSolver()
4830     pFrom->aLoop = pX;  in wherePathSolver()
4839     aSortCost = (LogEst*)pX;  in wherePathSolver()
4843   assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );  in wherePathSolver()