Lines Matching refs:nRow
84636 int nRow; /* Stop when row count reaches this */
84644 /* When the number of output rows reaches nRow, that means the
84646 ** nRow is the sum of the number of rows in the main program, plus
84648 ** so far. The nRow value will increase as new trigger subprograms are
84649 ** encountered, but p->pc will eventually catch up to nRow.
84651 nRow = p->nOp;
84660 nRow += apSub[i]->nOp;
84666 if( i>=nRow ){
84710 nRow += aOp[i].p4.pProgram->nOp;
114890 tRowcnt nRow; /* Number of rows visited so far */
115050 p->nRow = 0;
115323 if( p->nRow==0 ){
115346 p->nRow++;
115376 if( p->nLimit && p->nRow>(tRowcnt)p->nLimit*(p->nSkipAhead+1) ){
115470 p->nSkipAhead ? (u64)p->nEst : (u64)p->nRow);
115473 u64 iVal = (p->nRow + nDistinct - 1) / nDistinct;
115474 if( iVal==2 && p->nRow*10 <= nDistinct*11 ) iVal = 1;
116249 tRowcnt nRow; /* Number of rows in index */
116254 nRow = pFinal->anLt[iCol];
116258 nRow = pIdx->aiRowEst[0];
116261 pIdx->nRowEst0 = nRow;
116276 if( nDist100>nSum100 && sumEq<nRow ){
116277 avgEq = ((i64)100 * (nRow - sumEq))/(nDist100 - nSum100);
140984 int nRow = 1;
140998 nRow += bShowAll;
141000 ExplainQueryPlan((pParse, 0, "SCAN %d CONSTANT ROW%s", nRow,
141001 nRow==1 ? "" : "S"));
141005 p->nSelectRow = nRow;
146192 u32 nRow; /* Number of rows in the result */
146194 u32 nData; /* Slots used in azResult[]. (nRow+1)*nColumn */
146212 if( p->nRow==0 && argv!=0 ){
146228 if( p->nRow==0 ){
146258 p->nRow++;
146296 res.nRow = 0;
146339 if( pnRow ) *pnRow = res.nRow;
151515 LogEst nRow; /* Estimated number of rows generated by this path */
159174 LogEst nRow /* Number of rows in the entire table */
159179 LogEst iReduce = 0; /* pLoop->nOut should not exceed nRow-iReduce */
159238 if( pLoop->nOut > nRow-iReduce ){
159239 pLoop->nOut = nRow - iReduce;
159896 ** For a full scan, assuming the table (or index) contains nRow rows:
159898 ** cost = nRow * 3.0 // full-table scan
159899 ** cost = nRow * K // scan of covering index
159900 ** cost = nRow * (K+3.0) // scan of non-covering index
159909 ** cost = nSeek * (log(nRow) + K * nVisit) // covering index
159910 ** cost = nSeek * (log(nRow) + (K+3.0) * nVisit) // non-covering index
159916 ** The estimated values (nRow, nVisit, nSeek) often contain a large amount
159919 ** log(nRow) factor is omitted from a non-covering index scan in order to
161272 ** Return the cost of sorting nRow rows, assuming that the keys have
161278 LogEst nRow,
161299 rSortCost = nRow + rScale + 16;
161306 if( (pWInfo->wctrlFlags & WHERE_USE_LIMIT)!=0 && pWInfo->iLimit<nRow ){
161307 nRow = pWInfo->iLimit;
161311 if( nRow>10 ){ nRow -= 10; assert( 10==sqlite3LogEst(2) ); }
161313 rSortCost += estLog(nRow);
161400 aFrom[0].nRow = MIN(pParse->nQueryLoop, 48); assert( 48==sqlite3LogEst(28) );
161429 if( (pWLoop->wsFlags & WHERE_AUTO_INDEX)!=0 && pFrom->nRow<3 ){
161440 rUnsorted = sqlite3LogEstAdd(pWLoop->rSetup,pWLoop->rRun + pFrom->nRow);
161442 nOut = pFrom->nRow + pWLoop->nOut;
161541 ** (pTo->rCost,pTo->nRow,pTo->rUnsorted) <= (rCost,nOut,rUnsorted)
161545 && (pTo->nRow<nOut
161546 || (pTo->nRow==nOut && pTo->rUnsorted<=rUnsorted)
161557 wherePathName(pTo, iLoop+1, 0), pTo->rCost, pTo->nRow,
161575 wherePathName(pTo, iLoop+1, 0), pTo->rCost, pTo->nRow,
161583 pTo->nRow = nOut;
161592 mxUnsorted = aTo[0].nRow;
161611 wherePathName(pTo, iLoop+1, 0), pTo->rCost, pTo->nRow,
161710 pWInfo->nRowOut = pFrom->nRow;
162433 sqlite3DebugPrintf("---- Solution nRow=%d", pWInfo->nRowOut);
181219 ** Set the pIdxInfo->estimatedRows variable to nRow. Unless this
181223 static void fts3SetEstimatedRows(sqlite3_index_info *pIdxInfo, i64 nRow){
181226 pIdxInfo->estimatedRows = nRow;
202936 i64 nRow; /* Estimated rows returned by this scan */
203010 nRow = pRtree->nRowEst >> (iIdx/2);
203011 pIdxInfo->estimatedCost = (double)6.0 * (double)nRow;
203012 pIdxInfo->estimatedRows = nRow;
204386 i64 nRow = RTREE_MIN_ROWEST;
204401 if( sqlite3_step(p)==SQLITE_ROW ) nRow = sqlite3_column_int64(p, 0);
204406 pRtree->nRowEst = MAX(nRow, RTREE_MIN_ROWEST);
209033 int nRow;
209161 ** nRow * (nIndex + 1)
209163 ** for all source tables in the RBU database, where nRow is the number
211534 pRet->nRow = sqlite3_column_int(pStmt, 1);
211862 p->nStep = (pState ? pState->nRow : 0);
212626 p->nStep = pState->nRow;
224854 sqlite3_int64 nRow = 0; /* Number of rows in table */
224873 if( rc==SQLITE_OK ) rc = pApi->xRowCount(pFts, &nRow);
224874 assert( rc!=SQLITE_OK || nRow>0 );
224876 if( rc==SQLITE_OK ) p->avgdl = (double)nToken / (double)nRow;
224896 double idf = log( (nRow - nHit + 0.5) / (nHit + 0.5) );
240725 i64 nRow = 0;
240726 rc = fts5StorageCount(p, "content", &nRow);
240727 if( rc==SQLITE_OK && nRow!=p->nTotalRow ) rc = FTS5_CORRUPT;
240730 i64 nRow = 0;
240731 rc = fts5StorageCount(p, "docsize", &nRow);
240732 if( rc==SQLITE_OK && nRow!=p->nTotalRow ) rc = FTS5_CORRUPT;