Home
last modified time | relevance | path

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

/external/sqlite/dist/orig/
Dshell.c4107 u16 nEntry; member
4903 pEOCD->nEntry = zipfileRead16(aRead); in zipfileReadEOCD()
4911 (int)pEOCD->iDisk, (int)pEOCD->iFirstDisk, (int)pEOCD->nEntry, in zipfileReadEOCD()
4954 if( pCsr->eocd.nEntry==0 ){ in zipfileFilter()
5036 if( rc==SQLITE_OK && eocd.nEntry>0 ){ in zipfileLoadDirectory()
5048 for(i=0; rc==SQLITE_OK && i<eocd.nEntry; i++){ in zipfileLoadDirectory()
5407 zipfileWrite16(aBuf, p->nEntry); in zipfileAppendEOCD()
5478 int nEntry = 0; in zipfileCommit() local
5484 nEntry++; in zipfileCommit()
5490 eocd.nEntry = (u16)nEntry; in zipfileCommit()
[all …]
Dsqlite3.c56115 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */
56671 int nEntry = 0; /* Number of entries in the hash table */
56672 for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; }
56673 assert( nEntry==idx );
57010 while( pSegment->iNext<pSegment->nEntry ){
57231 int nEntry; /* Number of entries in this segment */
57236 nEntry = (int)(iLast - iZero);
57238 nEntry = (int)((u32*)aHash - (u32*)aPgno);
57243 for(j=0; j<nEntry; j++){
57246 walMergesort((u32 *)aPgno, aTmp, aIndex, &nEntry);
[all …]
/external/sqlite/dist/
Dshell.c4113 u16 nEntry; member
4909 pEOCD->nEntry = zipfileRead16(aRead); in zipfileReadEOCD()
4917 (int)pEOCD->iDisk, (int)pEOCD->iFirstDisk, (int)pEOCD->nEntry, in zipfileReadEOCD()
4960 if( pCsr->eocd.nEntry==0 ){ in zipfileFilter()
5042 if( rc==SQLITE_OK && eocd.nEntry>0 ){ in zipfileLoadDirectory()
5054 for(i=0; rc==SQLITE_OK && i<eocd.nEntry; i++){ in zipfileLoadDirectory()
5413 zipfileWrite16(aBuf, p->nEntry); in zipfileAppendEOCD()
5484 int nEntry = 0; in zipfileCommit() local
5490 nEntry++; in zipfileCommit()
5496 eocd.nEntry = (u16)nEntry; in zipfileCommit()
[all …]
Dsqlite3.c56131 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */
56687 int nEntry = 0; /* Number of entries in the hash table */
56688 for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; }
56689 assert( nEntry==idx );
57026 while( pSegment->iNext<pSegment->nEntry ){
57247 int nEntry; /* Number of entries in this segment */
57252 nEntry = (int)(iLast - iZero);
57254 nEntry = (int)((u32*)aHash - (u32*)aPgno);
57259 for(j=0; j<nEntry; j++){
57262 walMergesort((u32 *)aPgno, aTmp, aIndex, &nEntry);
[all …]