Home
last modified time | relevance | path

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

/external/chromium_org/third_party/sqlite/src/test/
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} {
Dwalcrash2.test72 for {set nEntry 8} {$nEntry < 8192} {incr nEntry 8} {
73 do_test walcrash2-1.2.[expr $nEntry/8] {
Dsavepoint6.test135 set nEntry [db one {SELECT count(*) FROM t1}]
137 if {$nEntry != $nEntry2} {
138 error "$nEntry entries in database, $nEntry2 entries in array"
Dwalthread.test397 proc wal_hook {zDb nEntry} {
398 if {$nEntry>10} {
459 proc wal_hook {zDb nEntry} {
460 if {$nEntry>15} {db eval {PRAGMA wal_checkpoint}}
/external/chromium_org/third_party/sqlite/src/src/
Dwal.c466 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */ member
1005 int nEntry = 0; /* Number of entries in the hash table */ in walIndexAppend() local
1006 for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; } in walIndexAppend()
1007 assert( nEntry==idx ); in walIndexAppend()
1313 while( pSegment->iNext<pSegment->nEntry ){ in walIteratorNext()
1530 int nEntry; /* Number of entries in this segment */ in walIteratorInit() local
1535 nEntry = (int)(iLast - iZero); in walIteratorInit()
1537 nEntry = (int)((u32*)aHash - (u32*)aPgno); in walIteratorInit()
1542 for(j=0; j<nEntry; j++){ in walIteratorInit()
1545 walMergesort((u32 *)aPgno, aTmp, aIndex, &nEntry); in walIteratorInit()
[all …]
Dvdbeapi.c322 int nEntry = sqlite3PagerWalCallback(sqlite3BtreePager(pBt)); in doWalCallbacks() local
323 if( db->xWalCallback && nEntry>0 && rc==SQLITE_OK ){ in doWalCallbacks()
324 rc = db->xWalCallback(db->pWalArg, db, db->aDb[i].zName, nEntry); in doWalCallbacks()
Dbtree.c3020 int nEntry; /* Number of entries on one ptrmap page */ in autoVacuumCommit() local
3033 nEntry = pBt->usableSize/5; in autoVacuumCommit()
3034 nPtrmap = (nFree-nOrig+PTRMAP_PAGENO(pBt, nOrig)+nEntry)/nEntry; in autoVacuumCommit()
7332 i64 nEntry = 0; /* Value to return in *pnEntry */ in sqlite3BtreeCount() local
7349 nEntry += pPage->nCell; in sqlite3BtreeCount()
7366 *pnEntry = nEntry; in sqlite3BtreeCount()
Dvdbe.c2531 i64 nEntry; in sqlite3VdbeExec() local
2536 rc = sqlite3BtreeCount(pCrsr, &nEntry); in sqlite3VdbeExec()
2538 nEntry = 0; in sqlite3VdbeExec()
2540 pOut->u.i = nEntry; in sqlite3VdbeExec()
Dtclsqlite.c603 int nEntry in DbWalHandler() argument
614 Tcl_ListObjAppendElement(interp, p, Tcl_NewIntObj(nEntry)); in DbWalHandler()
/external/chromium_org/third_party/sqlite/src/ext/fts3/
Dfts3_snippet.c763 int nEntry = 0; in fts3ColumnlistCount() local
768 if( !c ) nEntry++; in fts3ColumnlistCount()
772 return nEntry; in fts3ColumnlistCount()
Dfts3_write.c153 int nEntry; /* Number of terms written to node so far */ member
1548 pTree->nEntry++; in fts3NodeAddTerm()
1664 iNextLeaf += (pIter->nEntry+1); in fts3NodeWrite()
/external/sqlite/dist/orig/
Dsqlite3.c45812 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */
46355 int nEntry = 0; /* Number of entries in the hash table */
46356 for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; }
46357 assert( nEntry==idx );
46680 while( pSegment->iNext<pSegment->nEntry ){
46897 int nEntry; /* Number of entries in this segment */
46902 nEntry = (int)(iLast - iZero);
46904 nEntry = (int)((u32*)aHash - (u32*)aPgno);
46909 for(j=0; j<nEntry; j++){
46912 walMergesort((u32 *)aPgno, aTmp, aIndex, &nEntry);
[all …]
/external/sqlite/dist/
Dsqlite3.c45840 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */
46383 int nEntry = 0; /* Number of entries in the hash table */
46384 for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; }
46385 assert( nEntry==idx );
46708 while( pSegment->iNext<pSegment->nEntry ){
46925 int nEntry; /* Number of entries in this segment */
46930 nEntry = (int)(iLast - iZero);
46932 nEntry = (int)((u32*)aHash - (u32*)aPgno);
46937 for(j=0; j<nEntry; j++){
46940 walMergesort((u32 *)aPgno, aTmp, aIndex, &nEntry);
[all …]
/external/chromium_org/third_party/sqlite/amalgamation/
Dsqlite3.c43925 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */
44464 int nEntry = 0; /* Number of entries in the hash table */
44465 for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; }
44466 assert( nEntry==idx );
44772 while( pSegment->iNext<pSegment->nEntry ){
44989 int nEntry; /* Number of entries in this segment */
44994 nEntry = (int)(iLast - iZero);
44996 nEntry = (int)((u32*)aHash - (u32*)aPgno);
45001 for(j=0; j<nEntry; j++){
45004 walMergesort((u32 *)aPgno, aTmp, aIndex, &nEntry);
[all …]