Home
last modified time | relevance | path

Searched refs:nRow (Results 1 – 25 of 61) sorted by relevance

123

/sqlite-3.40.0/ext/fts5/
H A Dfts5_test_tok.c77 int nRow; /* Number of entries in aRow[] */ member
294 for(i=0; i<pCsr->nRow; i++){ in fts5tokResetCursor()
301 pCsr->nRow = 0; in fts5tokResetCursor()
335 if( (pCsr->nRow & (pCsr->nRow-1))==0 ){ in fts5tokCb()
336 int nNew = pCsr->nRow ? pCsr->nRow*2 : 32; in fts5tokCb()
340 memset(&aNew[pCsr->nRow], 0, sizeof(Fts5tokRow)*(nNew-pCsr->nRow)); in fts5tokCb()
344 pRow = &pCsr->aRow[pCsr->nRow]; in fts5tokCb()
347 if( pCsr->nRow ){ in fts5tokCb()
354 pCsr->nRow++; in fts5tokCb()
398 return (pCsr->iRowid>pCsr->nRow); in fts5tokEofMethod()
H A Dfts5_test_mi.c177 sqlite3_int64 nRow; in fts5MatchinfoGlobalCb() local
178 rc = pApi->xRowCount(pFts, &nRow); in fts5MatchinfoGlobalCb()
179 aOut[0] = (u32)nRow; in fts5MatchinfoGlobalCb()
184 sqlite3_int64 nRow = 0; in fts5MatchinfoGlobalCb() local
185 rc = pApi->xRowCount(pFts, &nRow); in fts5MatchinfoGlobalCb()
186 if( nRow==0 ){ in fts5MatchinfoGlobalCb()
194 aOut[i] = (u32)((2*nToken + nRow) / (2*nRow)); in fts5MatchinfoGlobalCb()
H A Dfts5_aux.c572 sqlite3_int64 nRow = 0; /* Number of rows in table */ in fts5Bm25GetData() local
591 if( rc==SQLITE_OK ) rc = pApi->xRowCount(pFts, &nRow); in fts5Bm25GetData()
592 assert( rc!=SQLITE_OK || nRow>0 ); in fts5Bm25GetData()
594 if( rc==SQLITE_OK ) p->avgdl = (double)nToken / (double)nRow; in fts5Bm25GetData()
614 double idf = log( (nRow - nHit + 0.5) / (nHit + 0.5) ); in fts5Bm25GetData()
/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest_main.c170 int nRow; member
218 p->nRow++; in scanCompareCb()
294 if( res1.nRow!=res2.nRow in testScanCompare()
837 nRow = atoi(azArg[i]); in do_speed_tests()
868 nRow = MAX(nRow, 100000); in do_speed_tests()
869 nStep = nRow/100; in do_speed_tests()
870 nSelStep = nRow/10; in do_speed_tests()
903 for(i=0; i<nRow; i+=nStep){ in do_speed_tests()
1063 for(i=0; i<nRow; i+=nStep){ in do_speed_tests()
1404 const int nRow = 1 * 1000 * 1000; in do_insert() local
[all …]
H A Dlsmtest1.c89 zSystem, zData, bRecover, pTest->nRow, pTest->nVerify in getName()
156 int nRow, /* Size of key domain */ in testDbContents() argument
185 iKey1 = testPrngValue((iFirst<<8) + (iLast<<16)) % nRow; in testDbContents()
186 iKey2 = testPrngValue((iLast<<8) + (iFirst<<16)) % nRow; in testDbContents()
211 if( nLookupTest>=nRow ){ in testDbContents()
285 while( rc==LSM_OK && i<p->nRow ){ in doDataTest1()
307 testCaseProgress(i, p->nRow, testCaseNDot()/2, &iDot); in doDataTest1()
312 while( rc==LSM_OK && i<p->nRow ){ in doDataTest1()
319 testDbContents(pDb, pData, p->nRow, i, p->nRow-1,p->nTest,p->bTestScan,&rc); in doDataTest1()
329 testDbContents(pDb, pData, p->nRow, i, p->nRow-1,p->nTest,p->bTestScan,&rc); in doDataTest1()
[all …]
H A Dlsmtest2.c14 int nRow; member
30 p->nRow++; in scanCksumDb()
50 p->nRow++; in scanCountDb()
81 cksum.nRow, (u32)cksum.cksum1, (u32)cksum.cksum2 in testCksumDatabase()
84 return cksum.nRow; in testCksumDatabase()
91 return cksum.nRow; in testCountDatabase()
183 int nRow, in testSetupSavedLsmdb() argument
191 testWriteDatasourceRange(pDb, pData, 0, nRow, &rc); in testSetupSavedLsmdb()
296 const int nRow = 5000; /* Database size */ in crash_test1() local
317 pCksumDb = testCksumArrayNew(pData, nRow, nRow, 1); in crash_test1()
[all …]
H A Dlsmtest3.c75 char *testCksumArrayGet(CksumDb *p, int nRow){ in testCksumArrayGet() argument
77 assert( nRow>=p->nFirst ); in testCksumArrayGet()
78 assert( nRow<=p->nLast ); in testCksumArrayGet()
79 assert( ((nRow-p->nFirst) % p->nStep)==0 ); in testCksumArrayGet()
81 i = (nRow - p->nFirst) / p->nStep; in testCksumArrayGet()
/sqlite-3.40.0/test/
H A Dmmapfault.test60 set nRow [db2 one {SELECT count(*) FROM t1}]
61 if {$nRow!=4} { error "Database content appears incorrect (1)" }
66 set nRow [db one {SELECT count(*) FROM t1}]
67 if {$nRow!=5 && $nRow!=66 && $nRow!=65} {
68 error "Database content appears incorrect (2) ($nRow)"
H A Dsort4.test50 # Set up a table "t1" containing $nRow rows. Each row contains also
70 proc populate_table {nRow nPayload} {
89 for {set i 0} {$i < $nRow} {incr i} {
98 proc sorter_test {nRow nRead nPayload} {
101 set nLoad [expr ($nRow > $nRead) ? $nRead : $nRow]
113 # $nRow records of a bit over $nPayload bytes each read from the "t1"
121 set sql1 "SELECT a, [join $cols ,], b FROM t1 WHERE rowid<=$nRow ORDER BY a"
122 set sql2 "SELECT a FROM t1 WHERE rowid<=$nRow ORDER BY a LIMIT $nRead"
H A Doptfuzz.c210 int nRow, nStmt; /* Number of rows and statements */ in main() local
261 rc = optfuzz_exec(dbRun, zSql, dbOut, "opt", &nStmt, &nRow, bTrace); in main()
268 rc = optfuzz_exec(dbRun, zSql, dbOut, "noopt", &nStmt, &nRow, bTrace); in main()
294 printf("%s: %d stmts %d rows ok\n", azIn[i], nStmt, nRow); in main()
H A Dfts3sort.test25 proc build_database {nRow param} {
34 for {set i 0} {$i < $nRow} {incr i} {
55 set nRow 1000
57 build_database $nRow $param
59 } $nRow
H A Dwalfault.test518 set nRow [db eval {SELECT count(*) FROM abc}]
519 if {!(($nRow==2 && $testrc) || $nRow==3)} { error "Bad db content" }
548 set nRow [db eval {SELECT count(*) FROM abc}]
549 if {!(($nRow==2 && $testrc) || $nRow==3)} { error "Bad db content" }
586 set nRow [db eval {SELECT count(*) FROM abc}]
587 if {$nRow!=3 && $nRow!=4} { error "Bad db content" }
H A Dmemjournal2.test25 set nRow [expr 2000]
30 SELECT 1 UNION ALL SELECT i+1 FROM s WHERE i<$nRow
H A Dchanges.test26 foreach {tn nRow wor} {
37 set nBig [expr $nRow]
/sqlite-3.40.0/src/
H A Dtable.c31 u32 nRow; /* Number of rows in the result */ member
51 if( p->nRow==0 && argv!=0 ){ in sqlite3_get_table_cb()
67 if( p->nRow==0 ){ in sqlite3_get_table_cb()
97 p->nRow++; in sqlite3_get_table_cb()
135 res.nRow = 0; in sqlite3_get_table()
178 if( pnRow ) *pnRow = res.nRow; in sqlite3_get_table()
H A Danalyze.c284 tRowcnt nRow; /* Number of rows visited so far */ member
444 p->nRow = 0; in statInit()
717 if( p->nRow==0 ){ in statPush()
740 p->nRow++; in statPush()
864 p->nSkipAhead ? (u64)p->nEst : (u64)p->nRow); in statGet()
867 u64 iVal = (p->nRow + nDistinct - 1) / nDistinct; in statGet()
868 if( iVal==2 && p->nRow*10 <= nDistinct*11 ) iVal = 1; in statGet()
1648 nRow = pFinal->anLt[iCol];
1652 nRow = pIdx->aiRowEst[0];
1655 pIdx->nRowEst0 = nRow;
[all …]
/sqlite-3.40.0/ext/session/
H A Dsession_speed_test.c213 int nRow, in run_test() argument
239 for(i=0; i<nRow; i++){ in run_test()
263 int nRow; in main() member
273 offsetof(struct Options, nRow) ), in main()
345 run_test(db, db2, o.nRow, azInsert[o.bInteger]); in main()
346 run_test(db, db2, o.nRow, azUpdate[o.bInteger]); in main()
347 run_test(db, db2, o.nRow, azDelete[o.bInteger]); in main()
/sqlite-3.40.0/tool/
H A Dindex_usage.c62 int nRow = 0; in main() local
176 nRow++; in main()
177 if( iProgress>0 && (nRow%iProgress)==0 ){ in main()
178 printf("%d...\n", nRow); in main()
H A Dspeedtest16.c84 int nRow = 0; in prepareAndRun() local
86 while( (rc=sqlite3_step(pStmt))==SQLITE_ROW ){ nRow++; } in prepareAndRun()
90 rc, nRow, iElapse); in prepareAndRun()
H A Dspeedtest8.c74 int nRow = 0; in prepareAndRun() local
76 while( (rc=sqlite3_step(pStmt))==SQLITE_ROW ){ nRow++; } in prepareAndRun()
81 rc, nRow, iElapse); in prepareAndRun()
/sqlite-3.40.0/ext/misc/
H A Dspellfix.c2157 for(i=0; i<pCur->nRow; i++){ in spellfix1ResetCursor()
2160 pCur->nRow = 0; in spellfix1ResetCursor()
2174 assert( N>=pCur->nRow ); in spellfix1ResizeCursor()
2444 for(i=0; i<pCur->nRow; i++){ in spellfix1RunQuery()
2485 if( pCur->nRow<pCur->nAlloc ){ in spellfix1RunQuery()
2486 idx = pCur->nRow; in spellfix1RunQuery()
2505 if( pCur->nRow<pCur->nAlloc ) pCur->nRow++; in spellfix1RunQuery()
2509 for(i=1; i<pCur->nRow; i++){ in spellfix1RunQuery()
2664 pCur->nRow = pCur->iRow = 0; in spellfix1FilterForFullScan()
2704 if( pCur->iRow < pCur->nRow ){ in spellfix1Next()
[all …]
H A Dvtablog.c41 int nRow; /* Number of rows in the table */ member
209 pNew->nRow = 10; in vtablogConnectCreate()
210 if( zNRow ) pNew->nRow = atoi(zNRow); in vtablogConnectCreate()
339 int rc = pCur->iRowid >= pTab->nRow; in vtablogEof()
H A Dunionvtab.c1305 sqlite3_int64 nRow = 1000000; in unionBestIndex() local
1307 nRow = nRow / 2; in unionBestIndex()
1313 nRow = nRow / 2; in unionBestIndex()
1318 pIdxInfo->estimatedRows = nRow; in unionBestIndex()
1319 pIdxInfo->estimatedCost = 3.0 * (double)nRow; in unionBestIndex()
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5merge.test72 proc do_merge2_test {testname nRow} {
81 set ::nRow $nRow
83 for {set i 0} {$i < $::nRow} {incr i} {
H A Dfts5hash.test98 set nRow [db one {SELECT count(*) FROM eee WHERE eee MATCH $term}]
99 if {$nRow != $doc} {
100 error "term=$term fts5vocab=$doc cnt=$nRow"

123