Lines Matching refs:nRow
19257 ** u1.nRow !fg.isTabFunc && !fg.isIndexedBy
19299 u32 nRow; /* Number of rows in a VALUES clause */
32004 pItem->u1.nRow);
70222 i64 nRow; /* Number of rows visited in current tree */
81360 pCheck->nRow += nCell;
81662 sCheck.nRow = 0;
81673 sqlite3MemSetArrayInt64(aCnt, i, sCheck.nRow);
87084 int nRow; /* Stop when row count reaches this */
87092 /* When the number of output rows reaches nRow, that means the
87094 ** nRow is the sum of the number of rows in the main program, plus
87096 ** so far. The nRow value will increase as new trigger subprograms are
87097 ** encountered, but p->pc will eventually catch up to nRow.
87099 nRow = p->nOp;
87108 nRow += apSub[i]->nOp;
87114 if( i>=nRow ){
87158 nRow += aOp[i].p4.pProgram->nOp;
110904 pNewItem->u1.nRow = pOldItem->u1.nRow;
118740 tRowcnt nRow; /* Number of rows visited so far */
118900 p->nRow = 0;
119173 if( p->nRow==0 ){
119200 p->nRow++;
119230 if( p->nLimit && p->nRow>(tRowcnt)p->nLimit*(p->nSkipAhead+1) ){
119324 p->nSkipAhead ? (u64)p->nEst : (u64)p->nRow);
119327 u64 iVal = (p->nRow + nDistinct - 1) / nDistinct;
119328 if( iVal==2 && p->nRow*10 <= nDistinct*11 ) iVal = 1;
119331 assert( p->current.anEq[i] || p->nRow==0 );
120167 tRowcnt nRow; /* Number of rows in index */
120172 nRow = pFinal->anLt[iCol];
120176 nRow = pIdx->aiRowEst[0];
120179 pIdx->nRowEst0 = nRow;
120194 if( nDist100>nSum100 && sumEq<nRow ){
120195 avgEq = ((i64)100 * (nRow - sumEq))/(nDist100 - nSum100);
133624 p->u1.nRow = 2;
133646 p->u1.nRow++;
145695 int nRow = 1;
145709 nRow += bShowAll;
145711 ExplainQueryPlan((pParse, 0, "SCAN %d CONSTANT ROW%s", nRow,
145712 nRow==1 ? "" : "S"));
145716 p->nSelectRow = nRow;
151542 u32 nRow; /* Number of rows in the result */
151544 u32 nData; /* Slots used in azResult[]. (nRow+1)*nColumn */
151562 if( p->nRow==0 && argv!=0 ){
151578 if( p->nRow==0 ){
151608 p->nRow++;
151646 res.nRow = 0;
151689 if( pnRow ) *pnRow = res.nRow;
156999 LogEst nRow; /* Estimated number of rows generated by this path */
164941 LogEst nRow /* Number of rows in the entire table */
164946 LogEst iReduce = 0; /* pLoop->nOut should not exceed nRow-iReduce */
165006 if( pLoop->nOut > nRow-iReduce ){
165007 pLoop->nOut = nRow - iReduce;
165845 ** For a full scan, assuming the table (or index) contains nRow rows:
165847 ** cost = nRow * 3.0 // full-table scan
165848 ** cost = nRow * K // scan of covering index
165849 ** cost = nRow * (K+3.0) // scan of non-covering index
165858 ** cost = nSeek * (log(nRow) + K * nVisit) // covering index
165859 ** cost = nSeek * (log(nRow) + (K+3.0) * nVisit) // non-covering index
165865 ** The estimated values (nRow, nVisit, nSeek) often contain a large amount
165868 ** log(nRow) factor is omitted from a non-covering index scan in order to
167265 ** Return the cost of sorting nRow rows, assuming that the keys have
167271 LogEst nRow, /* Estimated number of rows to sort */
167301 rSortCost = nRow + nCol;
167317 if( pWInfo->iLimit<nRow ){
167318 nRow = pWInfo->iLimit;
167323 if( nRow>10 ){ nRow -= 10; assert( 10==sqlite3LogEst(2) ); }
167325 rSortCost += estLog(nRow);
167413 aFrom[0].nRow = MIN(pParse->nQueryLoop, 48); assert( 48==sqlite3LogEst(28) );
167442 if( (pWLoop->wsFlags & WHERE_AUTO_INDEX)!=0 && pFrom->nRow<3 ){
167453 rUnsorted = sqlite3LogEstAdd(pWLoop->rSetup,pWLoop->rRun + pFrom->nRow);
167455 nOut = pFrom->nRow + pWLoop->nOut;
167547 ** (pTo->rCost,pTo->nRow,pTo->rUnsorted) <= (rCost,nOut,rUnsorted)
167551 && (pTo->nRow<nOut
167552 || (pTo->nRow==nOut && pTo->rUnsorted<=rUnsorted)
167563 wherePathName(pTo, iLoop+1, 0), pTo->rCost, pTo->nRow,
167581 wherePathName(pTo, iLoop+1, 0), pTo->rCost, pTo->nRow,
167589 pTo->nRow = nOut;
167598 mxUnsorted = aTo[0].nRow;
167617 wherePathName(pTo, iLoop+1, 0), pTo->rCost, pTo->nRow,
167718 pWInfo->nRowOut = pFrom->nRow;
168652 sqlite3DebugPrintf("---- Solution nRow=%d", pWInfo->nRowOut);
187729 ** Set the pIdxInfo->estimatedRows variable to nRow. Unless this
187733 static void fts3SetEstimatedRows(sqlite3_index_info *pIdxInfo, i64 nRow){
187736 pIdxInfo->estimatedRows = nRow;
212334 i64 nRow; /* Estimated rows returned by this scan */
212413 nRow = pRtree->nRowEst >> (iIdx/2);
212414 pIdxInfo->estimatedCost = (double)6.0 * (double)nRow;
212415 pIdxInfo->estimatedRows = nRow;
213619 i64 nRow = RTREE_MIN_ROWEST;
213634 if( sqlite3_step(p)==SQLITE_ROW ) nRow = sqlite3_column_int64(p, 0);
213639 pRtree->nRowEst = MAX(nRow, RTREE_MIN_ROWEST);
218343 int nRow;
218471 ** nRow * (nIndex + 1)
218473 ** for all source tables in the RBU database, where nRow is the number
220845 pRet->nRow = sqlite3_column_int(pStmt, 1);
221173 p->nStep = (pState ? pState->nRow : 0);
221953 p->nStep = pState->nRow;
235074 sqlite3_int64 nRow = 0; /* Number of rows in table */
235093 if( rc==SQLITE_OK ) rc = pApi->xRowCount(pFts, &nRow);
235094 assert( rc!=SQLITE_OK || nRow>0 );
235096 if( rc==SQLITE_OK ) p->avgdl = (double)nToken / (double)nRow;
235116 double idf = log( (nRow - nHit + 0.5) / (nHit + 0.5) );
253742 i64 nRow = 0;
253743 rc = fts5StorageCount(p, "content", &nRow);
253744 if( rc==SQLITE_OK && nRow!=p->nTotalRow ) rc = FTS5_CORRUPT;
253747 i64 nRow = 0;
253748 rc = fts5StorageCount(p, "docsize", &nRow);
253749 if( rc==SQLITE_OK && nRow!=p->nTotalRow ) rc = FTS5_CORRUPT;