Lines Matching defs:iPage
14803 int iPage,
14809 return id->pMethods->xShmMap(id, iPage, pgsz, bExtend, pp);
45842 ** Obtain a pointer to the iPage'th page of the wal-index. The wal-index
45850 static int walIndexPage(Wal *pWal, int iPage, volatile u32 **ppPage){
45854 if( pWal->nWiData<=iPage ){
45855 int nByte = sizeof(u32*)*(iPage+1);
45863 sizeof(u32*)*(iPage+1-pWal->nWiData));
45865 pWal->nWiData = iPage+1;
45869 if( pWal->apWiData[iPage]==0 ){
45871 pWal->apWiData[iPage] = (u32 volatile *)sqlite3MallocZero(WALINDEX_PGSZ);
45872 if( !pWal->apWiData[iPage] ) rc = SQLITE_NOMEM;
45874 rc = sqlite3OsShmMap(pWal->pDbFd, iPage, WALINDEX_PGSZ,
45875 pWal->writeLock, (void volatile **)&pWal->apWiData[iPage]
45884 *ppPage = pWal->apWiData[iPage];
45885 assert( iPage==0 || *ppPage || rc!=SQLITE_OK );
46003 u32 iPage, /* Database page number for frame */
46011 sqlite3Put4byte(&aFrame[0], iPage);
46146 static int walHash(u32 iPage){
46147 assert( iPage>0 );
46149 return (iPage*HASHTABLE_HASH_1) & (HASHTABLE_NSLOT-1);
46303 static int walIndexAppend(Wal *pWal, u32 iFrame, u32 iPage){
46343 for(iKey=walHash(iPage); aHash[iKey]; iKey=walNextHash(iKey)){
46346 aPgno[idx] = iPage;
48950 i16 iPage; /* Index of current page in apPage */
49963 for(i=0; i<=pCur->iPage; i++){
49967 pCur->iPage = -1;
52653 for(i=0; i<=p->iPage; i++){
52856 pCur->iPage = -1;
52905 memset(p, 0, offsetof(BtCursor, iPage));
52957 for(i=0; i<=pCur->iPage; i++){
52986 int iPage = pCur->iPage;
52988 btreeParseCell(pCur->apPage[iPage], pCur->aiIdx[iPage], &info);
52998 int iPage = pCur->iPage;
52999 btreeParseCell(pCur->apPage[iPage],pCur->aiIdx[iPage],&pCur->info);
53009 int iPage = pCur->iPage; \
53010 btreeParseCell(pCur->apPage[iPage],pCur->aiIdx[iPage],&pCur->info); \
53219 MemPage *pPage = pCur->apPage[pCur->iPage]; /* Btree page of current entry */
53224 assert( pCur->aiIdx[pCur->iPage]<pPage->nCell );
53389 assert( pCur->iPage>=0 && pCur->apPage[pCur->iPage] );
53390 assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
53416 assert( pCur->iPage>=0 && pCur->apPage[pCur->iPage] );
53417 assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
53452 assert( pCur!=0 && pCur->iPage>=0 && pCur->apPage[pCur->iPage]);
53455 pPage = pCur->apPage[pCur->iPage];
53456 assert( pCur->aiIdx[pCur->iPage]<pPage->nCell );
53458 btreeParseCell(pCur->apPage[pCur->iPage], pCur->aiIdx[pCur->iPage],
53525 int i = pCur->iPage;
53531 assert( pCur->iPage<BTCURSOR_MAX_DEPTH );
53532 if( pCur->iPage>=(BTCURSOR_MAX_DEPTH-1) ){
53539 pCur->iPage++;
53580 assert( pCur->iPage>0 );
53581 assert( pCur->apPage[pCur->iPage] );
53590 pCur->apPage[pCur->iPage-1],
53591 pCur->aiIdx[pCur->iPage-1],
53592 pCur->apPage[pCur->iPage]->pgno
53595 testcase( pCur->aiIdx[pCur->iPage-1] > pCur->apPage[pCur->iPage-1]->nCell );
53597 releasePage(pCur->apPage[pCur->iPage]);
53598 pCur->iPage--;
53642 if( pCur->iPage>=0 ){
53644 for(i=1; i<=pCur->iPage; i++){
53647 pCur->iPage = 0;
53657 pCur->iPage = 0;
53710 while( rc==SQLITE_OK && !(pPage = pCur->apPage[pCur->iPage])->leaf ){
53711 assert( pCur->aiIdx[pCur->iPage]<pPage->nCell );
53712 pgno = get4byte(findCell(pPage, pCur->aiIdx[pCur->iPage]));
53735 while( rc==SQLITE_OK && !(pPage = pCur->apPage[pCur->iPage])->leaf ){
53737 pCur->aiIdx[pCur->iPage] = pPage->nCell;
53741 pCur->aiIdx[pCur->iPage] = pPage->nCell-1;
53760 assert( pCur->pgnoRoot==0 || pCur->apPage[pCur->iPage]->nCell==0 );
53763 assert( pCur->apPage[pCur->iPage]->nCell>0 );
53787 for(ii=0; ii<pCur->iPage; ii++){
53790 assert( pCur->aiIdx[pCur->iPage]==pCur->apPage[pCur->iPage]->nCell-1 );
53791 assert( pCur->apPage[pCur->iPage]->leaf );
53799 assert( pCur->pgnoRoot==0 || pCur->apPage[pCur->iPage]->nCell==0 );
53872 assert( pCur->pgnoRoot==0 || pCur->apPage[pCur->iPage] );
53873 assert( pCur->pgnoRoot==0 || pCur->apPage[pCur->iPage]->isInit );
53874 assert( pCur->eState==CURSOR_INVALID || pCur->apPage[pCur->iPage]->nCell>0 );
53877 assert( pCur->pgnoRoot==0 || pCur->apPage[pCur->iPage]->nCell==0 );
53884 MemPage *pPage = pCur->apPage[pCur->iPage];
53898 pCur->aiIdx[pCur->iPage] = (u16)(idx = upr);
53900 pCur->aiIdx[pCur->iPage] = (u16)(idx = (upr+lwr)/2);
53905 assert( idx==pCur->aiIdx[pCur->iPage] );
53992 pCur->aiIdx[pCur->iPage] = (u16)(idx = (lwr+upr)/2);
54004 assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
54009 pCur->aiIdx[pCur->iPage] = (u16)lwr;
54063 pPage = pCur->apPage[pCur->iPage];
54064 idx = ++pCur->aiIdx[pCur->iPage];
54085 if( pCur->iPage==0 ){
54091 pPage = pCur->apPage[pCur->iPage];
54092 }while( pCur->aiIdx[pCur->iPage]>=pPage->nCell );
54137 pPage = pCur->apPage[pCur->iPage];
54140 int idx = pCur->aiIdx[pCur->iPage];
54147 while( pCur->aiIdx[pCur->iPage]==0 ){
54148 if( pCur->iPage==0 ){
54158 pCur->aiIdx[pCur->iPage]--;
54159 pPage = pCur->apPage[pCur->iPage];
54351 Pgno iPage;
54369 iPage = get4byte(&aData[8+closest*4]);
54370 testcase( iPage==mxPage );
54371 if( iPage>mxPage ){
54375 testcase( iPage==mxPage );
54376 if( !searchList || iPage==nearby ){
54378 *pPgno = iPage;
54461 ** This function is used to add page iPage to the database file free-list.
54466 ** corresponding to page iPage handy, it may pass it as the second value.
54472 static int freePage2(BtShared *pBt, MemPage *pMemPage, Pgno iPage){
54481 assert( iPage>1 );
54482 assert( !pMemPage || pMemPage->pgno==iPage );
54488 pPage = btreePageLookup(pBt, iPage);
54501 if( (!pPage && ((rc = btreeGetPage(pBt, iPage, &pPage, 0))!=0) )
54513 ptrmapPut(pBt, iPage, PTRMAP_FREEPAGE, 0, &rc);
54557 put4byte(&pTrunk->aData[8+nLeaf*4], iPage);
54561 rc = btreeSetHasContent(pBt, iPage);
54574 if( pPage==0 && SQLITE_OK!=(rc = btreeGetPage(pBt, iPage, &pPage, 0)) ){
54583 put4byte(&pPage1->aData[32], iPage);
55996 int iPage = pCur->iPage;
55997 MemPage *pPage = pCur->apPage[iPage];
55999 if( iPage==0 ){
56009 pCur->iPage = 1;
56020 MemPage * const pParent = pCur->apPage[iPage-1];
56021 int const iIdx = pCur->aiIdx[iPage-1];
56068 rc = balance_nonroot(pParent, iIdx, pSpace, iPage==1);
56088 pCur->iPage--;
56182 pPage = pCur->apPage[pCur->iPage];
56197 idx = pCur->aiIdx[pCur->iPage];
56215 idx = ++pCur->aiIdx[pCur->iPage];
56251 pCur->apPage[pCur->iPage]->nOverflow = 0;
56254 assert( pCur->apPage[pCur->iPage]->nOverflow==0 );
56280 if( NEVER(pCur->aiIdx[pCur->iPage]>=pCur->apPage[pCur->iPage]->nCell)
56292 iCellDepth = pCur->iPage;
56329 MemPage *pLeaf = pCur->apPage[pCur->iPage];
56363 if( rc==SQLITE_OK && pCur->iPage>iCellDepth ){
56364 while( pCur->iPage>iCellDepth ){
56365 releasePage(pCur->apPage[pCur->iPage--]);
56836 pPage = pCur->apPage[pCur->iPage];
56844 ** pCur->aiIdx[pCur->iPage] value is set to the index of the parent cell
56853 if( pCur->iPage==0 ){
56859 }while ( pCur->aiIdx[pCur->iPage]>=pCur->apPage[pCur->iPage]->nCell );
56861 pCur->aiIdx[pCur->iPage]++;
56862 pPage = pCur->apPage[pCur->iPage];
56868 iIdx = pCur->aiIdx[pCur->iPage];
56920 ** Add 1 to the reference count for page iPage. If this is the second
56927 static int checkRef(IntegrityCk *pCheck, Pgno iPage, char *zContext){
56928 if( iPage==0 ) return 1;
56929 if( iPage>pCheck->nPage ){
56930 checkAppendMsg(pCheck, zContext, "invalid page number %d", iPage);
56933 if( pCheck->anRef[iPage]==1 ){
56934 checkAppendMsg(pCheck, zContext, "2nd reference to page %d", iPage);
56937 return (pCheck->anRef[iPage]++)>1;
56979 int iPage, /* Page number for first page in the list */
56985 int iFirst = iPage;
56989 if( iPage<1 ){
56995 if( checkRef(pCheck, iPage, zContext) ) break;
56996 if( sqlite3PagerGet(pCheck->pPager, (Pgno)iPage, &pOvflPage) ){
56997 checkAppendMsg(pCheck, zContext, "failed to get page %d", iPage);
57005 checkPtrmap(pCheck, iPage, PTRMAP_FREEPAGE, 0, zContext);
57010 "freelist leaf count too big on page %d", iPage);
57027 /* If this database supports auto-vacuum and iPage is not the last
57029 ** the following page matches iPage.
57033 checkPtrmap(pCheck, i, PTRMAP_OVERFLOW2, iPage, zContext);
57037 iPage = get4byte(pOvflData);
57064 int iPage, /* Page number of the page to check */
57081 sqlite3_snprintf(sizeof(zContext), zContext, "Page %d: ", iPage);
57087 if( iPage==0 ) return 0;
57088 if( checkRef(pCheck, iPage, zParentContext) ) return 0;
57089 if( (rc = btreeGetPage(pBt, (Pgno)iPage, &pPage, 0))!=0 ){
57117 "On tree page %d cell %d: ", iPage, i);
57140 checkPtrmap(pCheck, pgnoOvfl, PTRMAP_OVERFLOW1, iPage, zContext);
57152 checkPtrmap(pCheck, pgno, PTRMAP_BTREE, iPage, zContext);
57166 "On page %d at right child: ", iPage);
57169 checkPtrmap(pCheck, pgno, PTRMAP_BTREE, iPage, zContext);
57234 "Corruption detected in cell %d on page %d",i,iPage);
57256 "Multiple uses for byte %d of page %d", i, iPage);
57263 cnt, data[hdr+7], iPage);
57576 assert( pCsr->apPage[pCsr->iPage]->intKey );
58243 ** This function is called after the contents of page iPage of the
58244 ** source database have been modified. If page iPage has already been
58246 iPage needs
58254 SQLITE_PRIVATE void sqlite3BackupUpdate(sqlite3_backup *pBackup, Pgno iPage, const u8 *aData){
58258 if( !isFatalError(p->rc) && iPage<p->iNext ){
58259 /* The backup process p has already copied page iPage. But now it
58266 rc = backupOnePage(p, iPage, aData);
