Lines Matching refs:tRowcnt
267 tRowcnt *anEq; /* sqlite_stat4.nEq */
268 tRowcnt *anDLt; /* sqlite_stat4.nDLt */
270 tRowcnt *anLt; /* sqlite_stat4.nLt */
283 tRowcnt nEst; /* Estimated number of rows */
284 tRowcnt nRow; /* Number of rows visited so far */
291 tRowcnt nPSample; /* How often to do a periodic sample */
351 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol); in sampleCopy()
352 memcpy(pTo->anLt, pFrom->anLt, sizeof(tRowcnt)*p->nCol); in sampleCopy()
353 memcpy(pTo->anDLt, pFrom->anDLt, sizeof(tRowcnt)*p->nCol); in sampleCopy()
420 nColUp = sizeof(tRowcnt)<8 ? (nCol+1)&~1 : nCol; in statInit()
427 + sizeof(tRowcnt)*nColUp /* StatAccum.anEq */ in statInit()
428 + sizeof(tRowcnt)*nColUp; /* StatAccum.anDLt */ in statInit()
431 n += sizeof(tRowcnt)*nColUp /* StatAccum.anLt */ in statInit()
433 + sizeof(tRowcnt)*3*nColUp*(nCol+mxSample); in statInit()
449 p->current.anDLt = (tRowcnt*)&p[1]; in statInit()
459 p->nPSample = (tRowcnt)(p->nEst/(mxSample/3+1) + 1); in statInit()
468 p->a[i].anEq = (tRowcnt *)pSpace; pSpace += (sizeof(tRowcnt) * nColUp); in statInit()
469 p->a[i].anLt = (tRowcnt *)pSpace; pSpace += (sizeof(tRowcnt) * nColUp); in statInit()
470 p->a[i].anDLt = (tRowcnt *)pSpace; pSpace += (sizeof(tRowcnt) * nColUp); in statInit()
539 tRowcnt nEqNew = pNew->anEq[pNew->iCol]; in sampleIsBetter()
540 tRowcnt nEqOld = pOld->anEq[pOld->iCol]; in sampleIsBetter()
600 tRowcnt *anEq = pMin->anEq; in sampleInsert()
601 tRowcnt *anLt = pMin->anLt; in sampleInsert()
602 tRowcnt *anDLt = pMin->anDLt; in sampleInsert()
625 memset(pSample->anEq, 0, sizeof(tRowcnt)*nEqZero); in sampleInsert()
743 tRowcnt nLt; in statPush()
770 if( p->nLimit && p->nRow>(tRowcnt)p->nLimit*(p->nSkipAhead+1) ){ in statPush()
890 tRowcnt *aCnt = 0; in statGet()
1466 tRowcnt *aOut, /* Store integers here */
1473 tRowcnt v;
1562 tRowcnt *aiRowEst = 0;
1569 pIndex->aiRowEst = (tRowcnt*)sqlite3MallocZero(sizeof(tRowcnt) * nCol);
1641 tRowcnt sumEq = 0; /* Sum of the nEq values */
1642 tRowcnt avgEq = 0;
1643 tRowcnt nRow; /* Number of rows in index */
1737 tRowcnt *pSpace;
1753 nByte += sizeof(tRowcnt) * nIdxCol * 3 * nSample;
1754 nByte += nIdxCol * sizeof(tRowcnt); /* Space for Index.aAvgEq[] */
1761 pSpace = (tRowcnt*)&pIdx->aSample[nSample];