Lines Matching refs:nRow
10541 double nRow; /* Estimated number of rows (for EQP) */ member
59443 int nRow; /* Stop when row count reaches this */
59476 nRow = p->nOp;
59491 nRow += apSub[i]->nOp;
59497 }while( i<nRow && p->explain==2 && p->aOp[i].opcode!=OP_Explain );
59498 if( i>=nRow ){
96968 int nRow; /* Number of rows in the result */
96988 if( p->nRow==0 && argv!=0 ){
97004 if( p->nRow==0 ){
97034 p->nRow++;
97069 res.nRow = 0;
97112 if( pnRow ) *pnRow = res.nRow;
102166 double nRow = 0;
102189 nRow += sTermCost.plan.nRow;
102198 rTotal, rTotal+nRow*estLog(nRow)));
102199 rTotal += nRow*estLog(nRow);
102205 WHERETRACE(("... multi-index OR cost=%.9g nrow=%.9g\n", rTotal, nRow));
102209 pCost->plan.nRow = nRow;
102301 pCost->plan.nRow = logN + 1;
103280 double nRow; /* Estimated number of rows in result set */
103461 nRow = (double)(aiRowEst[nEq] * nInMul);
103462 if( bInEst && nRow*2>aiRowEst[0] ){
103463 nRow = aiRowEst[0]/2;
103464 nInMul = (int)(nRow / aiRowEst[nEq]);
103474 if( nRow>(double)1 && nEq==1 && pFirstTerm!=0 && aiRowEst[1]>1 ){
103478 whereEqualScanEst(pParse, pProbe, pFirstTerm->pExpr->pRight, &nRow);
103480 whereInScanEst(pParse, pProbe, pFirstTerm->pExpr->x.pList, &nRow);
103488 nRow = (nRow * (double)estBound) / (double)100;
103489 if( nRow<1 ) nRow = 1;
103517 cost = nRow;
103525 cost += (nInMul + nRow)*log10N;
103549 cost += nRow*estLog(nRow)*3;
103552 cost += nRow*estLog(nRow)*3;
103573 if( nRow>2 && cost<=pCost->rCost ){
103580 for(pTerm=pWC->a, k=pWC->nTerm; nRow>2 && k; k--, pTerm++){
103591 nRow /= 10;
103605 nRow /= 3;
103609 nRow /= 2;
103612 if( nRow<2 ) nRow = 2;
103621 notReady, log10N, nRow, cost, used
103628 && (cost<pCost->rCost || (cost<=pCost->rCost && nRow<pCost->plan.nRow))
103632 pCost->plan.nRow = nRow;
104051 sqlite3_int64 nRow; /* Expected number of rows visited by scan */
104103 nRow = 1;
104105 nRow = (sqlite3_int64)pLevel->plan.nRow;
104107 zMsg = sqlite3MAppendf(db, zMsg, "%s (~%lld rows)", zMsg, nRow);
105194 && sCost.plan.nRow<bestPlan.plan.nRow))
105198 j, sCost.rCost, sCost.plan.nRow));
105209 bestJ, pLevel-pWInfo->a, bestPlan.rCost, bestPlan.plan.nRow));
105228 if( bestPlan.plan.nRow>=(double)1 ){
105229 pParse->nQueryLoop *= bestPlan.plan.nRow;
105286 pWInfo->nRowOut *= pLevel->plan.nRow;