Lines Matching refs:iPage
644 if( pCur->iPage>=0 ){ in btreeReleaseAllCursorPages()
645 for(i=0; i<pCur->iPage; i++){ in btreeReleaseAllCursorPages()
649 pCur->iPage = -1; in btreeReleaseAllCursorPages()
788 testcase( p->iPage>=0 ); in saveCursorsOnList()
2272 assert( pCur==0 || pCur->iPage>0 ); in getAndInitPage()
2305 pCur->iPage--; in getAndInitPage()
2306 pCur->pPage = pCur->apPage[pCur->iPage]; in getAndInitPage()
4563 pCur->iPage = -1; in btreeCursor()
5147 assert( pCur->iPage>=0 && pCur->pPage ); in sqlite3BtreePayload()
5205 assert( pCur!=0 && pCur->iPage>=0 && pCur->pPage); in fetchPayload()
5256 assert( pCur->iPage<BTCURSOR_MAX_DEPTH ); in moveToChild()
5257 assert( pCur->iPage>=0 ); in moveToChild()
5258 if( pCur->iPage>=(BTCURSOR_MAX_DEPTH-1) ){ in moveToChild()
5263 pCur->aiIdx[pCur->iPage] = pCur->ix; in moveToChild()
5264 pCur->apPage[pCur->iPage] = pCur->pPage; in moveToChild()
5266 pCur->iPage++; in moveToChild()
5305 assert( pCur->iPage>0 ); in moveToParent()
5308 pCur->apPage[pCur->iPage-1], in moveToParent()
5309 pCur->aiIdx[pCur->iPage-1], in moveToParent()
5312 testcase( pCur->aiIdx[pCur->iPage-1] > pCur->apPage[pCur->iPage-1]->nCell ); in moveToParent()
5315 pCur->ix = pCur->aiIdx[pCur->iPage-1]; in moveToParent()
5317 pCur->pPage = pCur->apPage[--pCur->iPage]; in moveToParent()
5350 assert( pCur->eState < CURSOR_REQUIRESEEK || pCur->iPage<0 ); in moveToRoot()
5351 assert( pCur->pgnoRoot>0 || pCur->iPage<0 ); in moveToRoot()
5353 if( pCur->iPage>=0 ){ in moveToRoot()
5354 if( pCur->iPage ){ in moveToRoot()
5356 while( --pCur->iPage ){ in moveToRoot()
5357 releasePageNotNull(pCur->apPage[pCur->iPage]); in moveToRoot()
5366 assert( pCur->iPage==(-1) ); in moveToRoot()
5380 pCur->iPage = 0; in moveToRoot()
5510 for(ii=0; ii<pCur->iPage; ii++){ in sqlite3BtreeLast()
5625 assert( pCur->iPage==0 || pCur->apPage[0]->intKey==pCur->curIntKey ); in sqlite3BtreeTableMoveto()
5761 for(i=0; i<pCur->iPage; i++){ in cursorOnLastPage()
5842 if( pCur->iPage>0 in sqlite3BtreeIndexMoveto()
6033 for(i=0; i<pCur->iPage; i++){ in sqlite3BtreeRowCountEst()
6093 if( pCur->iPage==0 ){ in btreeNext()
6182 if( pCur->iPage==0 ){ in btreePrevious()
6416 Pgno iPage; in allocateBtreePage() local
6423 iPage = get4byte(&aData[8+i*4]); in allocateBtreePage()
6424 if( iPage<=nearby ){ in allocateBtreePage()
6444 iPage = get4byte(&aData[8+closest*4]); in allocateBtreePage()
6445 testcase( iPage==mxPage ); in allocateBtreePage()
6446 if( iPage>mxPage || iPage<2 ){ in allocateBtreePage()
6450 testcase( iPage==mxPage ); in allocateBtreePage()
6452 || (iPage==nearby || (iPage<nearby && eMode==BTALLOC_LE)) in allocateBtreePage()
6455 *pPgno = iPage; in allocateBtreePage()
6561 static int freePage2(BtShared *pBt, MemPage *pMemPage, Pgno iPage){ in freePage2() argument
6570 assert( CORRUPT_DB || iPage>1 ); in freePage2()
6571 assert( !pMemPage || pMemPage->pgno==iPage ); in freePage2()
6573 if( iPage<2 || iPage>pBt->nPage ){ in freePage2()
6580 pPage = btreePageLookup(pBt, iPage); in freePage2()
6593 if( (!pPage && ((rc = btreeGetPage(pBt, iPage, &pPage, 0))!=0) ) in freePage2()
6605 ptrmapPut(pBt, iPage, PTRMAP_FREEPAGE, 0, &rc); in freePage2()
6658 put4byte(&pTrunk->aData[8+nLeaf*4], iPage); in freePage2()
6662 rc = btreeSetHasContent(pBt, iPage); in freePage2()
6675 if( pPage==0 && SQLITE_OK!=(rc = btreeGetPage(pBt, iPage, &pPage, 0)) ){ in freePage2()
6684 put4byte(&pPage1->aData[32], iPage); in freePage2()
8741 int iPage; in balance() local
8751 }else if( (iPage = pCur->iPage)==0 ){ in balance()
8762 pCur->iPage = 1; in balance()
8778 MemPage * const pParent = pCur->apPage[iPage-1]; in balance()
8779 int const iIdx = pCur->aiIdx[iPage-1]; in balance()
8830 rc = balance_nonroot(pParent, iIdx, pSpace, iPage==1, in balance()
8851 pCur->iPage--; in balance()
8852 assert( pCur->iPage>=0 ); in balance()
8853 pCur->pPage = pCur->apPage[pCur->iPage]; in balance()
9021 if( loc && pCur->iPage<0 ){ in sqlite3BtreeInsert()
9281 assert( pCur->iPage<0 || pCur->pPage->nOverflow==0 ); in sqlite3BtreeInsert()
9445 iCellDepth = pCur->iPage; in sqlite3BtreeDelete()
9538 if( iCellDepth<pCur->iPage-1 ){ in sqlite3BtreeDelete()
9581 if( rc==SQLITE_OK && pCur->iPage>iCellDepth ){ in sqlite3BtreeDelete()
9583 pCur->iPage--; in sqlite3BtreeDelete()
9584 while( pCur->iPage>iCellDepth ){ in sqlite3BtreeDelete()
9585 releasePage(pCur->apPage[pCur->iPage--]); in sqlite3BtreeDelete()
9587 pCur->pPage = pCur->apPage[pCur->iPage]; in sqlite3BtreeDelete()
9593 assert( (pCur->iPage==iCellDepth || CORRUPT_DB) ); in sqlite3BtreeDelete()
10114 if( pCur->iPage==0 ){ in sqlite3BtreeCount()
10205 static int checkRef(IntegrityCk *pCheck, Pgno iPage){ in checkRef() argument
10206 if( iPage>pCheck->nPage || iPage==0 ){ in checkRef()
10207 checkAppendMsg(pCheck, "invalid page number %d", iPage); in checkRef()
10210 if( getPageReferenced(pCheck, iPage) ){ in checkRef()
10211 checkAppendMsg(pCheck, "2nd reference to page %d", iPage); in checkRef()
10215 setPageReferenced(pCheck, iPage); in checkRef()
10257 Pgno iPage, /* Page number for first page in the list */ in checkList() argument
10263 while( iPage!=0 && pCheck->mxErr ){ in checkList()
10266 if( checkRef(pCheck, iPage) ) break; in checkList()
10268 if( sqlite3PagerGet(pCheck->pPager, (Pgno)iPage, &pOvflPage, 0) ){ in checkList()
10269 checkAppendMsg(pCheck, "failed to get page %d", iPage); in checkList()
10277 checkPtrmap(pCheck, iPage, PTRMAP_FREEPAGE, 0); in checkList()
10282 "freelist leaf count too big on page %d", iPage); in checkList()
10305 checkPtrmap(pCheck, i, PTRMAP_OVERFLOW2, iPage); in checkList()
10309 iPage = get4byte(pOvflData); in checkList()
10389 Pgno iPage, /* Page number of the page to check */ in checkTreePage() argument
10423 if( iPage==0 ) return 0; in checkTreePage()
10424 if( checkRef(pCheck, iPage) ) return 0; in checkTreePage()
10426 pCheck->v1 = iPage; in checkTreePage()
10427 if( (rc = btreeGetPage(pBt, iPage, &pPage, 0))!=0 ){ in checkTreePage()
10473 checkPtrmap(pCheck, pgno, PTRMAP_BTREE, iPage); in checkTreePage()
10527 checkPtrmap(pCheck, pgnoOvfl, PTRMAP_OVERFLOW1, iPage); in checkTreePage()
10538 checkPtrmap(pCheck, pgno, PTRMAP_BTREE, iPage); in checkTreePage()
10613 "Multiple uses for byte %u of page %u", x>>16, iPage); in checkTreePage()
10629 nFrag, data[hdr+7], iPage); in checkTreePage()