Lines Matching defs:nRow
10795 double nRow; /* Estimated number of rows (for EQP) */
60647 int nRow; /* Stop when row count reaches this */
60674 /* When the number of output rows reaches nRow, that means the
60676 ** nRow is the sum of the number of rows in the main program, plus
60678 ** so far. The nRow value will increase as new trigger subprograms are
60679 ** encountered, but p->pc will eventually catch up to nRow.
60681 nRow = p->nOp;
60696 nRow += apSub[i]->nOp;
60702 }while( i<nRow && p->explain==2 && p->aOp[i].opcode!=OP_Explain );
60703 if( i>=nRow ){
79478 tRowcnt nRow; /* Number of rows in the entire table */
79510 tRowcnt nRow;
79515 nRow = (tRowcnt)sqlite3_value_int64(argv[0]);
79525 p->nRow = nRow;
79527 p->nPSample = p->nRow/(mxSample/3+1) + 1;
99148 int nRow; /* Number of rows in the result */
99150 int nData; /* Slots used in azResult[]. (nRow+1)*nColumn */
99168 if( p->nRow==0 && argv!=0 ){
99184 if( p->nRow==0 ){
99214 p->nRow++;
99249 res.nRow = 0;
99292 if( pnRow ) *pnRow = res.nRow;
104372 double nRow = 0;
104397 nRow += sTermCost.plan.nRow;
104406 rTotal, rTotal+nRow*estLog(nRow)));
104407 rTotal += nRow*estLog(nRow);
104413 WHERETRACE(("... multi-index OR cost=%.9g nrow=%.9g\n", rTotal, nRow));
104417 pCost->plan.nRow = nRow;
104509 pCost->plan.nRow = logN + 1;
105478 double nRow; /* Estimated number of rows in result set */
105479 double log10N = (double)1; /* base-10 logarithm of nRow (inexact) */
105670 nRow = (double)(aiRowEst[nEq] * nInMul);
105671 if( bInEst && nRow*2>aiRowEst[0] ){
105672 nRow = aiRowEst[0]/2;
105673 nInMul = (int)(nRow / aiRowEst[nEq]);
105683 if( nRow>(double)1 && nEq==1 && pFirstTerm!=0 && aiRowEst[1]>1 ){
105688 whereEqualScanEst(pParse, pProbe, pFirstTerm->pExpr->pRight, &nRow);
105691 whereInScanEst(pParse, pProbe, pFirstTerm->pExpr->x.pList, &nRow);
105699 nRow = nRow/rangeDiv;
105700 if( nRow<1 ) nRow = 1;
105728 cost = nRow;
105733 ** + nRow steps through the index
105734 ** + nRow table searches to lookup the table entry using the rowid
105736 cost += (nInMul + nRow)*log10N;
105740 ** + nRow steps through the index
105747 ** + nRow steps through the table
105760 cost += nRow*estLog(nRow)*3;
105763 cost += nRow*estLog(nRow)*3;
105770 ** of output rows, adjust the nRow value accordingly. This only
105784 if( nRow>2 && cost<=pCost->rCost ){
105791 for(pTerm=pWC->a, k=pWC->nTerm; nRow>2 && k; k--, pTerm++){
105802 nRow /= 10;
105816 nRow /= 3;
105820 nRow /= 2;
105823 if( nRow<2 ) nRow = 2;
105829 " notReady=0x%llx log10N=%.1f nRow=%.1f cost=%.1f used=0x%llx\n",
105832 notReady, log10N, nRow, cost, used
105839 && (cost<pCost->rCost || (cost<=pCost->rCost && nRow<pCost->plan.nRow))
105843 pCost->plan.nRow = nRow;
106264 sqlite3_int64 nRow; /* Expected number of rows visited by scan */
106316 nRow = 1;
106318 nRow = (sqlite3_int64)pLevel->plan.nRow;
106320 zMsg = sqlite3MAppendf(db, zMsg, "%s (~%lld rows)", zMsg, nRow);
107342 ** Note that the WhereCost.nRow parameter for an optimal scan might
107344 ** join. The nRow value can be reduced by WHERE clause constraints
107345 ** that do not use indices. But this nRow reduction only happens if the
107444 && sCost.plan.nRow<bestPlan.plan.nRow))
107447 " with cost=%g and nRow=%g\n",
107448 j, sCost.rCost, sCost.plan.nRow));
107458 " with cost=%g and nRow=%g\n",
107459 bestJ, pLevel-pWInfo->a, bestPlan.rCost, bestPlan.plan.nRow));
107479 if( bestPlan.plan.nRow>=(double)1 ){
107480 pParse->nQueryLoop *= bestPlan.plan.nRow;
107537 pWInfo->nRowOut *= pLevel->plan.nRow;