Lines Matching defs:iPage
20218 int iPage,
20224 return id->pMethods->xShmMap(id, iPage, pgsz, bExtend, pp);
54931 ** Obtain a pointer to the iPage'th page of the wal-index. The wal-index
54939 static int walIndexPage(Wal *pWal, int iPage, volatile u32 **ppPage){
54943 if( pWal->nWiData<=iPage ){
54944 int nByte = sizeof(u32*)*(iPage+1);
54952 sizeof(u32*)*(iPage+1-pWal->nWiData));
54954 pWal->nWiData = iPage+1;
54958 if( pWal->apWiData[iPage]==0 ){
54960 pWal->apWiData[iPage] = (u32 volatile *)sqlite3MallocZero(WALINDEX_PGSZ);
54961 if( !pWal->apWiData[iPage] ) rc = SQLITE_NOMEM_BKPT;
54963 rc = sqlite3OsShmMap(pWal->pDbFd, iPage, WALINDEX_PGSZ,
54964 pWal->writeLock, (void volatile **)&pWal->apWiData[iPage]
54973 *ppPage = pWal->apWiData[iPage];
54974 assert( iPage==0 || *ppPage || rc!=SQLITE_OK );
55092 u32 iPage, /* Database page number for frame */
55100 sqlite3Put4byte(&aFrame[0], iPage);
55239 static int walHash(u32 iPage){
55240 assert( iPage>0 );
55242 return (iPage*HASHTABLE_HASH_1) & (HASHTABLE_NSLOT-1);
55396 static int walIndexAppend(Wal *pWal, u32 iFrame, u32 iPage){
55436 for(iKey=walHash(iPage); aHash[iKey]; iKey=walNextHash(iKey)){
55439 aPgno[idx] = iPage;
58479 i8 iPage; /* Index of current page in apPage */
59558 for(i=0; i<=pCur->iPage; i++){
59562 pCur->iPage = -1;
59691 testcase( p->iPage>0 );
60987 ** And if the fetch fails, this routine must decrement pCur->iPage.
61005 assert( pCur==0 || ppPage==&pCur->apPage[pCur->iPage] );
61007 assert( pCur==0 || pCur->iPage>0 );
61039 if( pCur ) pCur->iPage--;
62934 for(i=0; i<=p->iPage; i++){
63168 pCur->iPage = -1;
63226 memset(p, 0, offsetof(BtCursor, iPage));
63253 for(i=0; i<=pCur->iPage; i++){
63275 int iPage = pCur->iPage;
63277 btreeParseCell(pCur->apPage[iPage], pCur->aiIdx[iPage], &info);
63285 int iPage = pCur->iPage;
63287 btreeParseCell(pCur->apPage[iPage],pCur->aiIdx[iPage],&pCur->info);
63485 MemPage *pPage = pCur->apPage[pCur->iPage]; /* Btree page of current entry */
63494 assert( pCur->aiIdx[pCur->iPage]<pPage->nCell );
63680 assert( pCur->iPage>=0 && pCur->apPage[pCur->iPage] );
63681 assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
63739 assert( pCur!=0 && pCur->iPage>=0 && pCur->apPage[pCur->iPage]);
63743 assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
63745 assert( pCur->info.pPayload>pCur->apPage[pCur->iPage]->aData || CORRUPT_DB );
63746 assert( pCur->info.pPayload<pCur->apPage[pCur->iPage]->aDataEnd ||CORRUPT_DB);
63747 iPage]->aDataEnd - pCur->info.pPayload);
63787 assert( pCur->iPage<BTCURSOR_MAX_DEPTH );
63788 assert( pCur->iPage>=0 );
63789 if( pCur->iPage>=(BTCURSOR_MAX_DEPTH-1) ){
63794 pCur->iPage++;
63795 pCur->aiIdx[pCur->iPage] = 0;
63796 return getAndInitPage(pBt, newPgno, &pCur->apPage[pCur->iPage],
63833 assert( pCur->iPage>0 );
63834 assert( pCur->apPage[pCur->iPage] );
63836 pCur->apPage[pCur->iPage-1],
63837 pCur->aiIdx[pCur->iPage-1],
63838 pCur->apPage[pCur->iPage]->pgno
63840 testcase( pCur->aiIdx[pCur->iPage-1] > pCur->apPage[pCur->iPage-1]->nCell );
63843 releasePageNotNull(pCur->apPage[pCur->iPage--]);
63883 if( pCur->iPage>=0 ){
63884 if( pCur->iPage ){
63886 assert( pCur->apPage[pCur->iPage]!=0 );
63887 releasePageNotNull(pCur->apPage[pCur->iPage--]);
63888 }while( pCur->iPage);
63895 assert( pCur->iPage==(-1) );
63902 pCur->iPage = 0;
63915 ** if pCur->iPage>=0). But this is not so if the database is corrupted
63957 while( rc==SQLITE_OK && !(pPage = pCur->apPage[pCur->iPage])->leaf ){
63958 assert( pCur->aiIdx[pCur->iPage]<pPage->nCell );
63959 pgno = get4byte(findCell(pPage, pCur->aiIdx[pCur->iPage]));
63982 while( !(pPage = pCur->apPage[pCur->iPage])->leaf ){
63984 pCur->aiIdx[pCur->iPage] = pPage->nCell;
63988 pCur->aiIdx[pCur->iPage] = pPage->nCell-1;
64006 assert( pCur->pgnoRoot==0 || pCur->apPage[pCur->iPage]->nCell==0 );
64009 assert( pCur->apPage[pCur->iPage]->nCell>0 );
64033 for(ii=0; ii<pCur->iPage; ii++){
64036 assert( pCur->aiIdx[pCur->iPage]==pCur->apPage[pCur->iPage]->nCell-1 );
64037 assert( pCur->apPage[pCur->iPage]->leaf );
64045 assert( pCur->pgnoRoot==0 || pCur->apPage[pCur->iPage]->nCell==0 );
64155 assert( pCur->pgnoRoot==0 || pCur->apPage[pCur->iPage] );
64156 assert( pCur->pgnoRoot==0 || pCur->apPage[pCur->iPage]->isInit );
64157 assert( pCur->eState==CURSOR_INVALID || pCur->apPage[pCur->iPage]->nCell>0 );
64160 assert( pCur->pgnoRoot==0 || pCur->apPage[pCur->iPage]->nCell==0 );
64168 MemPage *pPage = pCur->apPage[pCur->iPage];
64183 pCur->aiIdx[pCur->iPage] = (u16)idx;
64202 pCur->aiIdx[pCur->iPage] = (u16)idx;
64271 pCur->aiIdx[pCur->iPage] = (u16)idx;
64293 pCur->aiIdx[pCur->iPage] = (u16)idx;
64305 assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
64306 pCur->aiIdx[pCur->iPage] = (u16)idx;
64317 pCur->aiIdx[pCur->iPage] = (u16)lwr;
64359 if( NEVER(pCur->apPage[pCur->iPage]->leaf==0) ) return -1;
64361 for(n=1, i=0; i<=pCur->iPage; i++){
64417 pPage = pCur->apPage[pCur->iPage];
64418 idx = ++pCur->aiIdx[pCur->iPage];
64435 if( pCur->iPage==0 ){
64441 pPage = pCur->apPage[pCur->iPage];
64442 }while( pCur->aiIdx[pCur->iPage]>=pPage->nCell );
64465 pPage = pCur->apPage[pCur->iPage];
64466 if( (++pCur->aiIdx[pCur->iPage])>=pPage->nCell ){
64467 pCur->aiIdx[pCur->iPage]--;
64528 pPage = pCur->apPage[pCur->iPage];
64531 int idx = pCur->aiIdx[pCur->iPage];
64536 while( pCur->aiIdx[pCur->iPage]==0 ){
64537 if( pCur->iPage==0 ){
64547 pCur->aiIdx[pCur->iPage]--;
64548 pPage = pCur->apPage[pCur->iPage];
64566 || pCur->aiIdx[pCur->iPage]==0
64567 || pCur->apPage[pCur->iPage]->leaf==0
64571 pCur->aiIdx[pCur->iPage]--;
64774 Pgno iPage;
64781 iPage = get4byte(&aData[8+i*4]);
64782 if( iPage<=nearby ){
64802 iPage = get4byte(&aData[8+closest*4]);
64803 testcase( iPage==mxPage );
64804 if( iPage>mxPage ){
64808 testcase( iPage==mxPage );
64810 || (iPage==nearby || (iPage<nearby && eMode==BTALLOC_LE))
64813 *pPgno = iPage;
64908 ** This function is used to add page iPage to the database file free-list.
64913 ** corresponding to page iPage handy, it may pass it as the second value.
64919 static int freePage2(BtShared *pBt, MemPage *pMemPage, Pgno iPage){
64928 assert( CORRUPT_DB || iPage>1 );
64929 assert( !pMemPage || pMemPage->pgno==iPage );
64931 if( iPage<2 ) return SQLITE_CORRUPT_BKPT;
64936 pPage = btreePageLookup(pBt, iPage);
64949 if( (!pPage && ((rc = btreeGetPage(pBt, iPage, &pPage, 0))!=0) )
64961 ptrmapPut(pBt, iPage, PTRMAP_FREEPAGE, 0, &rc);
65010 put4byte(&pTrunk->aData[8+nLeaf*4], iPage);
65014 rc = btreeSetHasContent(pBt, iPage);
65027 if( pPage==0 && SQLITE_OK!=(rc = btreeGetPage(pBt, iPage, &pPage, 0)) ){
65036 put4byte(&pPage1->aData[32], iPage);
66878 int iPage = pCur->iPage;
66879 MemPage *pPage = pCur->apPage[iPage];
66881 if( iPage==0 ){
66892 pCur->iPage = 1;
66903 MemPage * const pParent = pCur->apPage[iPage-1];
66904 int const iIdx = pCur->aiIdx[iPage-1];
66952 rc = balance_nonroot(pParent, iIdx, pSpace, iPage==1,
66973 pCur->iPage--;
66974 assert( pCur->iPage>=0 );
67106 pPage = pCur->apPage[pCur->iPage];
67120 idx = pCur->aiIdx[pCur->iPage];
67154 idx = ++pCur->aiIdx[pCur->iPage];
67192 pCur->apPage[pCur->iPage]->nOverflow = 0;
67209 assert( pCur->apPage[pCur->iPage]->nOverflow==0 );
67250 assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
67254 iCellDepth = pCur->iPage;
67322 MemPage *pLeaf = pCur->apPage[pCur->iPage];
67357 if( rc==SQLITE_OK && pCur->iPage>iCellDepth ){
67358 while( pCur->iPage>iCellDepth ){
67359 releasePage(pCur->apPage[pCur->iPage--]);
67366 assert( bPreserve && (pCur->iPage==iCellDepth || CORRUPT_DB) );
67367 assert( pPage==pCur->apPage[pCur->iPage] || CORRUPT_DB );
67862 pPage = pCur->apPage[pCur->iPage];
67870 ** pCur->aiIdx[pCur->iPage] value is set to the index of the parent cell
67879 if( pCur->iPage==0 ){
67885 }while ( pCur->aiIdx[pCur->iPage]>=pCur->apPage[pCur->iPage]->nCell );
67887 pCur->aiIdx[pCur->iPage]++;
67888 pPage = pCur->apPage[pCur->iPage];
67894 iIdx = pCur->aiIdx[pCur->iPage];
67964 ** Add 1 to the reference count for page iPage. If this is the second
67971 static int checkRef(IntegrityCk *pCheck, Pgno iPage){
67972 if( iPage==0 ) return 1;
67973 if( iPage>pCheck->nPage ){
67974 checkAppendMsg(pCheck, "invalid page number %d", iPage);
67977 if( getPageReferenced(pCheck, iPage) ){
67978 checkAppendMsg(pCheck, "2nd reference to page %d", iPage);
67981 setPageReferenced(pCheck, iPage);
68023 int iPage, /* Page number for first page in the list */
68028 int iFirst = iPage;
68032 if( iPage<1 ){
68038 if( checkRef(pCheck, iPage) ) break;
68039 if( sqlite3PagerGet(pCheck->pPager, (Pgno)iPage, &pOvflPage, 0) ){
68040 checkAppendMsg(pCheck, "failed to get page %d", iPage);
68048 checkPtrmap(pCheck, iPage, PTRMAP_FREEPAGE, 0);
68053 "freelist leaf count too big on page %d", iPage);
68070 /* If this database supports auto-vacuum and iPage is not the last
68072 ** the following page matches iPage.
68076 checkPtrmap(pCheck, i, PTRMAP_OVERFLOW2, iPage);
68080 iPage = get4byte(pOvflData);
68083 if( isFreeList && N<(iPage!=0) ){
68158 int iPage, /* Page number of the page to check */
68192 if( iPage==0 ) return 0;
68193 if( checkRef(pCheck, iPage) ) return 0;
68195 pCheck->v1 = iPage;
68196 if( (rc = btreeGetPage(pBt, (Pgno)iPage, &pPage, 0))!=0 ){
68237 checkPtrmap(pCheck, pgno, PTRMAP_BTREE, iPage);
68290 checkPtrmap(pCheck, pgnoOvfl, PTRMAP_OVERFLOW1, iPage);
68301 checkPtrmap(pCheck, pgno, PTRMAP_BTREE, iPage);
68376 "Multiple uses for byte %u of page %d", x>>16, iPage);
68392 nFrag, data[hdr+7], iPage);
68728 assert( pCsr->apPage[pCsr->iPage]->intKey );
69497 ** This function is called after the contents of page iPage of the
69498 ** source database have been modified. If page iPage has already been
69500 ** destination is now invalidated. The destination copy of iPage needs
69510 Pgno iPage,
69516 if( !isFatalError(p->rc) && iPage<p->iNext ){
69517 /* The backup process p has already copied page iPage. But now it
69524 rc = backupOnePage(p, iPage, aData, 1);
69533 SQLITE_PRIVATE void sqlite3BackupUpdate(sqlite3_backup *pBackup, Pgno iPage, const u8 *aData){
69534 if( pBackup ) backupUpdate(pBackup, iPage, aData);
173582 int iPage; /* Current entry in aPage[] */
173746 pCsr->iPage = 0;
173933 pCsr->iPage = 0;
173942 StatPage *p = &pCsr->aPage[pCsr->iPage];
173977 if( pCsr->iPage==0 ) return statNext(pCursor);
173978 pCsr->iPage--;
173981 pCsr->iPage++;
173982 assert( p==&pCsr->aPage[pCsr->iPage-1] );
174002 StatPage *p = &pCsr->aPage[pCsr->iPage];
