Lines Matching refs:iPage
20978 int iPage, in sqlite3OsShmMap() argument
20984 return id->pMethods->xShmMap(id, iPage, pgsz, bExtend, pp); in sqlite3OsShmMap()
56158 static int walIndexPage(Wal *pWal, int iPage, volatile u32 **ppPage){
56162 if( pWal->nWiData<=iPage ){
56163 int nByte = sizeof(u32*)*(iPage+1);
56171 sizeof(u32*)*(iPage+1-pWal->nWiData));
56173 pWal->nWiData = iPage+1;
56177 if( pWal->apWiData[iPage]==0 ){
56179 pWal->apWiData[iPage] = (u32 volatile *)sqlite3MallocZero(WALINDEX_PGSZ);
56180 if( !pWal->apWiData[iPage] ) rc = SQLITE_NOMEM_BKPT;
56182 rc = sqlite3OsShmMap(pWal->pDbFd, iPage, WALINDEX_PGSZ,
56183 pWal->writeLock, (void volatile **)&pWal->apWiData[iPage]
56185 assert( pWal->apWiData[iPage]!=0 || rc!=SQLITE_OK || pWal->writeLock==0 );
56186 testcase( pWal->apWiData[iPage]==0 && rc==SQLITE_OK );
56196 *ppPage = pWal->apWiData[iPage];
56197 assert( iPage==0 || *ppPage || rc!=SQLITE_OK );
56315 u32 iPage, /* Database page number for frame */
56323 sqlite3Put4byte(&aFrame[0], iPage);
56462 static int walHash(u32 iPage){
56463 assert( iPage>0 );
56465 return (iPage*HASHTABLE_HASH_1) & (HASHTABLE_NSLOT-1);
56619 static int walIndexAppend(Wal *pWal, u32 iFrame, u32 iPage){
56659 for(iKey=walHash(iPage); aHash[iKey]; iKey=walNextHash(iKey)){
56662 aPgno[idx] = iPage;
59923 i8 iPage; /* Index of current page in apPage */
61034 if( pCur->iPage>=0 ){
61035 for(i=0; i<pCur->iPage; i++){
61039 pCur->iPage = -1;
61169 testcase( p->iPage>=0 );
62503 assert( pCur==0 || pCur->iPage>0 );
62536 pCur->iPage--;
62537 pCur->pPage = pCur->apPage[pCur->iPage];
64693 pCur->iPage = -1;
64751 memset(p, 0, offsetof(BtCursor, iPage));
65214 assert( pCur->iPage>=0 && pCur->pPage );
65273 assert( pCur!=0 && pCur->iPage>=0 && pCur->pPage);
65326 assert( pCur->iPage<BTCURSOR_MAX_DEPTH );
65327 assert( pCur->iPage>=0 );
65328 if( pCur->iPage>=(BTCURSOR_MAX_DEPTH-1) ){
65333 pCur->aiIdx[pCur->iPage] = pCur->ix;
65334 pCur->apPage[pCur->iPage] = pCur->pPage;
65336 pCur->iPage++;
65374 assert( pCur->iPage>0 );
65377 pCur->apPage[pCur->iPage-1],
65378 pCur->aiIdx[pCur->iPage-1],
65381 testcase( pCur->aiIdx[pCur->iPage-1] > pCur->apPage[pCur->iPage-1]->nCell );
65384 pCur->ix = pCur->aiIdx[pCur->iPage-1];
65386 pCur->pPage = pCur->apPage[--pCur->iPage];
65419 assert( pCur->eState < CURSOR_REQUIRESEEK || pCur->iPage<0 );
65420 assert( pCur->pgnoRoot>0 || pCur->iPage<0 );
65422 if( pCur->iPage>=0 ){
65423 if( pCur->iPage ){
65425 while( --pCur->iPage ){
65426 releasePageNotNull(pCur->apPage[pCur->iPage]);
65435 assert( pCur->iPage==(-1) );
65449 pCur->iPage = 0;
65580 for(ii=0; ii<pCur->iPage; ii++){
65712 assert( pCur->iPage==0 || pCur->apPage[0]->intKey==pCur->curIntKey );
65913 for(i=0; i<pCur->iPage; i++){
65984 if( pCur->iPage==0 ){
66080 if( pCur->iPage==0 ){
66315 Pgno iPage;
66322 iPage = get4byte(&aData[8+i*4]);
66323 if( iPage<=nearby ){
66343 iPage = get4byte(&aData[8+closest*4]);
66344 testcase( iPage==mxPage );
66345 if( iPage>mxPage ){
66349 testcase( iPage==mxPage );
66351 || (iPage==nearby || (iPage<nearby && eMode==BTALLOC_LE))
66354 *pPgno = iPage;
66460 static int freePage2(BtShared *pBt, MemPage *pMemPage, Pgno iPage){
66469 assert( CORRUPT_DB || iPage>1 );
66470 assert( !pMemPage || pMemPage->pgno==iPage );
66472 if( iPage<2 ) return SQLITE_CORRUPT_BKPT;
66477 pPage = btreePageLookup(pBt, iPage);
66490 if( (!pPage && ((rc = btreeGetPage(pBt, iPage, &pPage, 0))!=0) )
66502 ptrmapPut(pBt, iPage, PTRMAP_FREEPAGE, 0, &rc);
66551 put4byte(&pTrunk->aData[8+nLeaf*4], iPage);
66555 rc = btreeSetHasContent(pBt, iPage);
66568 if( pPage==0 && SQLITE_OK!=(rc = btreeGetPage(pBt, iPage, &pPage, 0)) ){
66577 put4byte(&pPage1->aData[32], iPage);
68432 int iPage = pCur->iPage;
68435 if( iPage==0 ){
68446 pCur->iPage = 1;
68459 MemPage * const pParent = pCur->apPage[iPage-1];
68460 int const iIdx = pCur->aiIdx[iPage-1];
68508 rc = balance_nonroot(pParent, iIdx, pSpace, iPage==1,
68529 pCur->iPage--;
68530 assert( pCur->iPage>=0 );
68531 pCur->pPage = pCur->apPage[pCur->iPage];
68767 assert( pCur->iPage<0 || pCur->pPage->nOverflow==0 );
68812 iCellDepth = pCur->iPage;
68885 if( iCellDepth<pCur->iPage-1 ){
68920 if( rc==SQLITE_OK && pCur->iPage>iCellDepth ){
68922 pCur->iPage--;
68923 while( pCur->iPage>iCellDepth ){
68924 releasePage(pCur->apPage[pCur->iPage--]);
68926 pCur->pPage = pCur->apPage[pCur->iPage];
68932 assert( bPreserve && (pCur->iPage==iCellDepth || CORRUPT_DB) );
69447 if( pCur->iPage==0 ){
69539 static int checkRef(IntegrityCk *pCheck, Pgno iPage){
69540 if( iPage==0 ) return 1;
69541 if( iPage>pCheck->nPage ){
69542 checkAppendMsg(pCheck, "invalid page number %d", iPage);
69545 if( getPageReferenced(pCheck, iPage) ){
69546 checkAppendMsg(pCheck, "2nd reference to page %d", iPage);
69549 setPageReferenced(pCheck, iPage);
69591 int iPage, /* Page number for first page in the list */
69596 int iFirst = iPage;
69600 if( iPage<1 ){
69606 if( checkRef(pCheck, iPage) ) break;
69607 if( sqlite3PagerGet(pCheck->pPager, (Pgno)iPage, &pOvflPage, 0) ){
69608 checkAppendMsg(pCheck, "failed to get page %d", iPage);
69616 checkPtrmap(pCheck, iPage, PTRMAP_FREEPAGE, 0);
69621 "freelist leaf count too big on page %d", iPage);
69644 checkPtrmap(pCheck, i, PTRMAP_OVERFLOW2, iPage);
69648 iPage = get4byte(pOvflData);
69651 if( isFreeList && N<(iPage!=0) ){
69726 int iPage, /* Page number of the page to check */
69760 if( iPage==0 ) return 0;
69761 if( checkRef(pCheck, iPage) ) return 0;
69763 pCheck->v1 = iPage;
69764 if( (rc = btreeGetPage(pBt, (Pgno)iPage, &pPage, 0))!=0 ){
69805 checkPtrmap(pCheck, pgno, PTRMAP_BTREE, iPage);
69859 checkPtrmap(pCheck, pgnoOvfl, PTRMAP_OVERFLOW1, iPage);
69870 checkPtrmap(pCheck, pgno, PTRMAP_BTREE, iPage);
69945 "Multiple uses for byte %u of page %d", x>>16, iPage);
69961 nFrag, data[hdr+7], iPage);
71079 Pgno iPage,
71085 if( !isFatalError(p->rc) && iPage<p->iNext ){
71093 rc = backupOnePage(p, iPage, aData, 1);
71102 SQLITE_PRIVATE void sqlite3BackupUpdate(sqlite3_backup *pBackup, Pgno iPage, const u8 *aData){
71103 if( pBackup ) backupUpdate(pBackup, iPage, aData);
177757 int iPage; /* Current entry in aPage[] */
177921 pCsr->iPage = 0;
178108 pCsr->iPage = 0;
178117 StatPage *p = &pCsr->aPage[pCsr->iPage];
178152 if( pCsr->iPage==0 ) return statNext(pCursor);
178153 pCsr->iPage--;
178156 pCsr->iPage++;
178157 assert( p==&pCsr->aPage[pCsr->iPage-1] );
178177 StatPage *p = &pCsr->aPage[pCsr->iPage];