Lines Matching refs:pProbe

167590   Index *pProbe,                  /* An index on pSrc */
167619 pProbe->pTable->zName,pProbe->zName,
167630 if( pProbe->bUnordered ){
167634 assert( pNew->u.btree.nEq<pProbe->nColumn );
167635 assert( pNew->u.btree.nEq<pProbe->nKeyCol
167636 || pProbe->idxType!=SQLITE_IDXTYPE_PRIMARYKEY );
167647 opMask, pProbe);
167649 rSize = pProbe->aiRowLogEst[0];
167660 && indexColumnNotNull(pProbe, saved_nEq)
167675 if( IsUniqueIndex(pProbe) && saved_nEq==pProbe->nKeyCol-1 ){
167732 if( pProbe->hasStat1 && rLogSize>=10 ){
167754 M = pProbe->aiRowLogEst[saved_nEq];
167779 int iCol = pProbe->aiColumn[saved_nEq];
167783 || (iCol>=0 && nInMul==0 && saved_nEq==pProbe->nKeyCol-1)
167785 if( iCol==XN_ROWID || pProbe->uniqNotNull
167786 || (pProbe->nKeyCol==1 && pProbe->onError && (eOp & WO_EQ))
167798 pParse, pSrc->iCursor, pProbe, saved_nEq, pTerm
167846 if( pTerm->truthProb<=0 && pProbe->aiColumn[saved_nEq]>=0 ){
167855 && pProbe->nSample
167856 && ALWAYS(pNew->u.btree.nEq<=pProbe->nSampleCol)
167877 && pNew->nOut+10 > pProbe->aiRowLogEst[0]
167901 pNew->nOut += (pProbe->aiRowLogEst[nEq] - pProbe->aiRowLogEst[nEq-1]);
167920 if( pProbe->idxType==SQLITE_IDXTYPE_IPK ){
167927 rCostIdx = pNew->nOut + 1 + (15*pProbe->szIdxRow)/pSrc->pSTab->szTabRow;
167941 ApplyCostMultiplier(pNew->rRun, pProbe->pTable->costMult);
167956 && pNew->u.btree.nEq<pProbe->nColumn
167957 && (pNew->u.btree.nEq<pProbe->nKeyCol ||
167958 pProbe->idxType!=SQLITE_IDXTYPE_PRIMARYKEY)
167963 whereLoopAddBtreeIndex(pBuilder, pSrc, pProbe, nInMul+nIn);
167991 && saved_nEq+1<pProbe->nKeyCol
167993 && pProbe->noSkipScan==0
167994 && pProbe->hasStat1!=0
167996 && pProbe->aiRowLogEst[saved_nEq+1]>=42 /* TUNING: Minimum for skip-scan */
168004 nIter = pProbe->aiRowLogEst[saved_nEq] - pProbe->aiRowLogEst[saved_nEq+1];
168009 whereLoopAddBtreeIndex(pBuilder, pSrc, pProbe, nIter + nInMul);
168017 pProbe->pTable->zName, pProbe->zName, saved_nEq, rc));
168374 Index *pProbe; /* An index we are evaluating */
168399 pProbe = pSrc->u2.pIBIndex;
168401 pProbe = pTab->pIndex;
168425 pProbe = &sPk;
168486 for(; rc==SQLITE_OK && pProbe;
168487 pProbe=(pSrc->fg.isIndexedBy ? 0 : pProbe->pNext), iSortIdx++
168489 if( pProbe->pPartIdxWhere!=0
168491 pProbe->pPartIdxWhere)
168496 if( pProbe->bNoQuery ) continue;
168497 rSize = pProbe->aiRowLogEst[0];
168508 pNew->u.btree.pIndex = pProbe;
168510 b = indexMightHelpWithOrderBy(pBuilder, pProbe, pSrc->iCursor);
168514 if( pProbe->idxType==SQLITE_IDXTYPE_IPK ){
168548 if( pProbe->isCovering ){
168552 m = pSrc->colUsed & pProbe->colNotIdxed;
168553 if( pProbe->pPartIdxWhere ){
168555 pWInfo->pParse, pProbe, pProbe->pPartIdxWhere, &m, 0, 0
168559 if( m==TOPBIT || (pProbe->bHasExpr && !pProbe->bHasVCol && m!=0) ){
168560 u32 isCov = whereIsCoveringIndex(pWInfo, pProbe, pSrc->iCursor);
168564 " according to whereIsCoveringIndex()\n", pProbe->zName));
168572 " according to whereIsCoveringIndex()\n", pProbe->zName));
168577 " according to whereIsCoveringIndex()\n", pProbe->zName));
168585 pProbe->zName, m==0 ? "is" : "is not"));
168593 || pProbe->pPartIdxWhere!=0
168596 && pProbe->bUnordered==0
168597 && (pProbe->szIdxRow<pTab->szTabRow)
168608 pNew->rRun = rSize + 1 + (15*pProbe->szIdxRow)/pTab->szTabRow;
168621 if( !sqlite3ExprCoveredByIndex(pTerm->pExpr, iCur, pProbe) ){
168638 if( (pSrc->fg.jointype & JT_RIGHT)!=0 && pProbe->aColExpr ){
168652 rc = whereLoopAddBtreeIndex(pBuilder, pSrc, pProbe, 0);