Lines Matching defs:nRow
10795 double nRow; /* Estimated number of rows (for EQP) */
60675 int nRow; /* Stop when row count reaches this */
60702 /* When the number of output rows reaches nRow, that means the
60704 ** nRow is the sum of the number of rows in the main program, plus
60706 ** so far. The nRow value will increase as new trigger subprograms are
60707 ** encountered, but p->pc will eventually catch up to nRow.
60709 nRow = p->nOp;
60724 nRow += apSub[i]->nOp;
60730 }while( i<nRow && p->explain==2 && p->aOp[i].opcode!=OP_Explain );
60731 if( i>=nRow ){
79514 tRowcnt nRow; /* Number of rows in the entire table */
79546 tRowcnt nRow;
79551 nRow = (tRowcnt)sqlite3_value_int64(argv[0]);
79561 p->nRow = nRow;
79563 p->nPSample = p->nRow/(mxSample/3+1) + 1;
99184 int nRow; /* Number of rows in the result */
99186 int nData; /* Slots used in azResult[]. (nRow+1)*nColumn */
99204 if( p->nRow==0 && argv!=0 ){
99220 if( p->nRow==0 ){
99250 p->nRow++;
99285 res.nRow = 0;
99328 if( pnRow ) *pnRow = res.nRow;
104408 double nRow = 0;
104433 nRow += sTermCost.plan.nRow;
104442 rTotal, rTotal+nRow*estLog(nRow)));
104443 rTotal += nRow*estLog(nRow);
104449 WHERETRACE(("... multi-index OR cost=%.9g nrow=%.9g\n", rTotal, nRow));
104453 pCost->plan.nRow = nRow;
104545 pCost->plan.nRow = logN + 1;
105514 double nRow; /* Estimated number of rows in result set */
105515 double log10N = (double)1; /* base-10 logarithm of nRow (inexact) */
105706 nRow = (double)(aiRowEst[nEq] * nInMul);
105707 if( bInEst && nRow*2>aiRowEst[0] ){
105708 nRow = aiRowEst[0]/2;
105709 nInMul = (int)(nRow / aiRowEst[nEq]);
105719 if( nRow>(double)1 && nEq==1 && pFirstTerm!=0 && aiRowEst[1]>1 ){
105724 whereEqualScanEst(pParse, pProbe, pFirstTerm->pExpr->pRight, &nRow);
105727 whereInScanEst(pParse, pProbe, pFirstTerm->pExpr->x.pList, &nRow);
105735 nRow = nRow/rangeDiv;
105736 if( nRow<1 ) nRow = 1;
105764 cost = nRow;
105769 ** + nRow steps through the index
105770 ** + nRow table searches to lookup the table entry using the rowid
105772 cost += (nInMul + nRow)*log10N;
105776 ** + nRow steps through the index
105783 ** + nRow steps through the table
105796 cost += nRow*estLog(nRow)*3;
105799 cost += nRow*estLog(nRow)*3;
105806 ** of output rows, adjust the nRow value accordingly. This only
105820 if( nRow>2 && cost<=pCost->rCost ){
105827 for(pTerm=pWC->a, k=pWC->nTerm; nRow>2 && k; k--, pTerm++){
105838 nRow /= 10;
105852 nRow /= 3;
105856 nRow /= 2;
105859 if( nRow<2 ) nRow = 2;
105865 " notReady=0x%llx log10N=%.1f nRow=%.1f cost=%.1f used=0x%llx\n",
105868 notReady, log10N, nRow, cost, used
105875 && (cost<pCost->rCost || (cost<=pCost->rCost && nRow<pCost->plan.nRow))
105879 pCost->plan.nRow = nRow;
106300 sqlite3_int64 nRow; /* Expected number of rows visited by scan */
106352 nRow = 1;
106354 nRow = (sqlite3_int64)pLevel->plan.nRow;
106356 zMsg = sqlite3MAppendf(db, zMsg, "%s (~%lld rows)", zMsg, nRow);
107378 ** Note that the WhereCost.nRow parameter for an optimal scan might
107380 ** join. The nRow value can be reduced by WHERE clause constraints
107381 ** that do not use indices. But this nRow reduction only happens if the
107480 && sCost.plan.nRow<bestPlan.plan.nRow))
107483 " with cost=%g and nRow=%g\n",
107484 j, sCost.rCost, sCost.plan.nRow));
107494 " with cost=%g and nRow=%g\n",
107495 bestJ, pLevel-pWInfo->a, bestPlan.rCost, bestPlan.plan.nRow));
107515 if( bestPlan.plan.nRow>=(double)1 ){
107516 pParse->nQueryLoop *= bestPlan.plan.nRow;
107573 pWInfo->nRowOut *= pLevel->plan.nRow;
