Home
last modified time | relevance | path

Searched refs:nEntry (Results 1 – 25 of 27) sorted by relevance

12

/sqlite-3.40.0/test/
H A Dfts3expr3.test47 proc balanced_exprtree_structure {nEntry} {
49 for {set i 1} {$i <= $nEntry} {incr i} {
65 proc balanced_and_tree {nEntry} {
70 for {set i 1} {$i <= $nEntry} {incr i} {
78 for {set i 1} {$i < $nEntry} {incr i} {
95 for {set i 1} {$i <= $nEntry} {incr i} {
101 proc random_or_query {nEntry} {
103 for {set i 1} {$i <= $nEntry} {incr i} {
109 proc random_andor_query {nEntry} {
111 for {set i 1} {$i <= $nEntry} {incr i} {
[all …]
H A Dwalhook.test27 proc wal_hook {zDb nEntry} {
28 lappend ::wal_hook $zDb $nEntry
55 proc wal_hook {zDb nEntry} {
65 proc wal_hook {zDb nEntry} {
H A Dwalcrash2.test72 for {set nEntry 8} {$nEntry < 8192} {incr nEntry 8} {
73 do_test walcrash2-1.2.[expr $nEntry/8] {
H A Dsavepoint6.test135 set nEntry [db one {SELECT count(*) FROM t1}]
137 if {$nEntry != $nEntry2} {
138 error "$nEntry entries in database, $nEntry2 entries in array"
H A De_walhook.test86 proc my_wal_hook {dbname nEntry} {
87 set ::wal_hook_args [list $dbname $nEntry]
H A Dwalthread.test399 proc wal_hook {zDb nEntry} {
400 if {$nEntry>10} {
461 proc wal_hook {zDb nEntry} {
462 if {$nEntry>15} {db eval {PRAGMA wal_checkpoint}}
H A Dfts3query.test227 foreach {iFirst nEntry} [subst {
232 for {set i 0} {$i < $nEntry} {incr i} {
/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest3.c42 int nEntry; in testCksumArrayNew() local
52 nEntry = 1 + ((nLast - nFirst) / nStep); in testCksumArrayNew()
56 pRet->azCksum = (char **)malloc(nEntry * (sizeof(char *) + TEST_CKSUM_BYTES)); in testCksumArrayNew()
57 for(i=0; i<nEntry; i++){ in testCksumArrayNew()
58 char *pStart = (char *)(&pRet->azCksum[nEntry]); in testCksumArrayNew()
64 for(i=0; i<nEntry; i++){ in testCksumArrayNew()
66 if( i==nEntry ) break; in testCksumArrayNew()
/sqlite-3.40.0/ext/misc/
H A Dbtreeinfo.c94 sqlite3_int64 nEntry; /* nEntry value */ member
273 sqlite3_int64 nEntry = 1; in binfoCompute() local
306 nEntry *= (nCell+1); in binfoCompute()
325 pCsr->nEntry = nEntry; in binfoCompute()
360 sqlite3_result_int64(ctx, pCsr->nEntry); in binfoColumn()
H A Dzipfile.c174 u16 nEntry; member
1290 if( pCsr->eocd.nEntry==0 ){ in zipfileFilter()
1737 zipfileWrite16(a, p->nEntry); in zipfileSerializeEOCD()
1808 int nEntry = 0; in zipfileCommit() local
1814 nEntry++; in zipfileCommit()
1820 eocd.nEntry = (u16)nEntry; in zipfileCommit()
1821 eocd.nEntryTotal = (u16)nEntry; in zipfileCommit()
1918 int nEntry; member
2103 p->nEntry++; in zipfileStep()
2129 if( p->nEntry>0 ){ in zipfileFinal()
[all …]
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5dlidx.test37 # This test populates the FTS5 table with $nEntry entries. Rows are
38 # numbered from 0 to ($nEntry-1). The rowid for row $i is:
46 proc do_dlidx_test1 {tn spc1 spc2 nEntry iFirst nStep} {
54 for {set i 0} {$i < $nEntry} {incr i} {
106 proc do_dlidx_test2 {tn nEntry iFirst nStep} {
117 SELECT ii+1, i+$nStep FROM iii WHERE ii<$nEntry
/sqlite-3.40.0/ext/fts3/
H A Dfts3_unicode.c140 int nEntry = 0; in unicodeAddExceptions() local
150 nEntry++; in unicodeAddExceptions()
154 if( nEntry ){ in unicodeAddExceptions()
158 aNew = sqlite3_realloc64(p->aiException,(p->nException+nEntry)*sizeof(int)); in unicodeAddExceptions()
H A Dfts3_snippet.c849 int nEntry = 0; in fts3ColumnlistCount() local
854 if( !c ) nEntry++; in fts3ColumnlistCount()
858 return nEntry; in fts3ColumnlistCount()
H A Dfts3_write.c221 int nEntry; /* Number of terms written to node so far */ member
2077 pTree->nEntry++; in fts3NodeAddTerm()
2193 iNextLeaf += (pIter->nEntry+1); in fts3NodeWrite()
3565 int nEntry = 0; in fts3DoRebuild() local
3607 nEntry++; in fts3DoRebuild()
3614 fts3UpdateDocTotals(&rc, p, aSzIns, aSzDel, nEntry); in fts3DoRebuild()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_hash.c31 int nEntry; /* Number of entries currently in hash */ member
137 pHash->nEntry = 0; in sqlite3Fts5HashClear()
277 if( (pHash->nEntry*2)>=pHash->nSlot ){ in sqlite3Fts5HashWrite()
297 pHash->nEntry++; in sqlite3Fts5HashWrite()
478 pHash->nEntry = 0; in fts5HashEntrySort()
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_shared.c89 for(i=0; i<p->nEntry; i++){
109 assert( p->nAlloc>=p->nEntry ); in freelistAppend()
110 if( p->nAlloc==p->nEntry ){ in freelistAppend()
123 for(i=0; i<p->nEntry; i++){ in freelistAppend()
128 if( i<p->nEntry && p->aEntry[i].iBlk==iBlk ){ in freelistAppend()
133 int nByte = sizeof(FreelistEntry)*(p->nEntry-i); in freelistAppend()
137 p->nEntry++; in freelistAppend()
642 while( (p->iFree < pFree->nEntry) && p->iFree>=0 ){ in walkFreelistCb()
695 ctx[0].iFree = ctx[0].pFreelist->nEntry-1; in lsmWalkFreelist()
707 ctx[1].iFree = ctx[1].pFreelist->nEntry-1; in lsmWalkFreelist()
[all …]
H A Dlsm_sorted.c95 #define SEGMENT_EOF(pgsz, nEntry) SEGMENT_CELLPTR_OFFSET(pgsz, nEntry-1) argument
2011 int nEntry = pWorker->freelist.nEntry; in multiCursorGetKey() local
2012 if( pCsr->iFree < (nEntry*2) ){ in multiCursorGetKey()
3184 int nEntry = pCsr->pDb->pWorker->freelist.nEntry; in flCsrAdvance() local
3421 int nEntry = pageGetNRec(a2, n2); in mergeWorkerMoveHierarchy() local
3440 int nEntry = pageGetNRec(a2, n2); in mergeWorkerMoveHierarchy()
4432 if( freelist.nEntry ){ in sortedNewToplevel()
4438 pDb->pWorker->freelist.nEntry = 0; in sortedNewToplevel()
5984 int nEntry; in lsmSortedExpandBtreePage() local
5988 nEntry = pageGetNRec(aData, nOrig); in lsmSortedExpandBtreePage()
[all …]
H A Dlsm_ckpt.c446 assert( pSnap->freelist.nEntry<=pDb->nMaxFreelist ); in ckptExportSnapshot()
448 int nFree = pSnap->freelist.nEntry; in ckptExportSnapshot()
484 "ckptExportSnapshot(): id=%lld freelist: %d", iId, pSnap->freelist.nEntry in ckptExportSnapshot()
486 for(i=0; i<pSnap->freelist.nEntry; i++){ in ckptExportSnapshot()
1027 pNew->freelist.nEntry = pNew->freelist.nAlloc = nFree; in lsmCheckpointDeserialize()
H A Dlsm_tree.c1825 int nEntry = treeCountEntries(db); in lsmTreeDelete() local
1883 assert( bDone || treeCountEntries(db)==(nEntry-1) ); in lsmTreeDelete()
2451 int nEntry = 0; in treeCountEntries() local
2458 nEntry++; in treeCountEntries()
2463 return nEntry; in treeCountEntries()
H A DlsmInt.h560 int nEntry; /* Number of valid slots in aEntry[] */ member
/sqlite-3.40.0/src/
H A Dwal.c584 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */ member
1184 int nEntry = 0; /* Number of entries in the hash table */ in walIndexAppend() local
1185 for(i=0; i<HASHTABLE_NSLOT; i++){ if( sLoc.aHash[i] ) nEntry++; } in walIndexAppend()
1186 assert( nEntry==idx ); in walIndexAppend()
1603 while( pSegment->iNext<pSegment->nEntry ){ in walIteratorNext()
1823 int nEntry; /* Number of entries in this segment */ in walIteratorInit() local
1827 nEntry = (int)(iLast - sLoc.iZero); in walIteratorInit()
1829 nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno); in walIteratorInit()
1834 for(j=0; j<nEntry; j++){ in walIteratorInit()
1837 walMergesort((u32 *)sLoc.aPgno, aTmp, aIndex, &nEntry); in walIteratorInit()
[all …]
H A Dvdbeapi.c623 int nEntry; in doWalCallbacks() local
625 nEntry = sqlite3PagerWalCallback(sqlite3BtreePager(pBt)); in doWalCallbacks()
627 if( nEntry>0 && db->xWalCallback && rc==SQLITE_OK ){ in doWalCallbacks()
628 rc = db->xWalCallback(db->pWalArg, db, db->aDb[i].zDbSName, nEntry); in doWalCallbacks()
H A Dbtree.c3972 int nEntry; /* Number of entries on one ptrmap page */ in finalDbSize() local
3976 nEntry = pBt->usableSize/5; in finalDbSize()
3977 nPtrmap = (nFree-nOrig+PTRMAP_PAGENO(pBt, nOrig)+nEntry)/nEntry; in finalDbSize()
10077 i64 nEntry = 0; /* Value to return in *pnEntry */ in sqlite3BtreeCount() local
10099 nEntry += pPage->nCell; in sqlite3BtreeCount()
10116 *pnEntry = nEntry; in sqlite3BtreeCount()
/sqlite-3.40.0/ext/repair/
H A Dsqlite3_checker.tcl50 set max [db one {SELECT nEntry FROM sqlite_btreeinfo('main')
260 ORDER BY nEntry}]
/sqlite-3.40.0/ext/session/
H A Dsqlite3session.c127 int nEntry; /* Total number of entries in hash table */ member
931 if( pTab->nChange==0 || pTab->nEntry>=(pTab->nChange/2) ){ in sessionGrowHash()
1368 pTab->nEntry++; in sessionPreupdateOneChange()
2572 if( pTab->nEntry ){ in sessionGenerateChangeset()
2762 ret = (pTab->nEntry>0); in sqlite3session_isempty()
5212 pTab->nEntry--; in sessionChangesetToHash()
5224 pTab->nEntry++; in sessionChangesetToHash()
5267 if( pTab->nEntry==0 ) continue; in sessionChangegroupOutput()

12