Cross Reference: /external/chromium_org/third

Lines Matching refs:iPage
601     for(i=0; i<=pCur->iPage; i++){
605     pCur->iPage = -1;
3264     for(i=0; i<=p->iPage; i++){
3469   pCur->iPage = -1;
3518   memset(p, 0, offsetof(BtCursor, iPage));
3570     for(i=0; i<=pCur->iPage; i++){
3599     int iPage = pCur->iPage;
3601     btreeParseCell(pCur->apPage[iPage], pCur->aiIdx[iPage], &info);
3611       int iPage = pCur->iPage;
3612       btreeParseCell(pCur->apPage[iPage],pCur->aiIdx[iPage],&pCur->info);
3622     int iPage = pCur->iPage;                                                   \
3623     btreeParseCell(pCur->apPage[iPage],pCur->aiIdx[iPage],&pCur->info); \
3832   MemPage *pPage = pCur->apPage[pCur->iPage]; /* Btree page of current entry */
3837   assert( pCur->aiIdx[pCur->iPage]<pPage->nCell );
3968   assert( pCur->iPage>=0 && pCur->apPage[pCur->iPage] );
3969   assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
3995     assert( pCur->iPage>=0 && pCur->apPage[pCur->iPage] );
3996     assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
4031   assert( pCur!=0 && pCur->iPage>=0 && pCur->apPage[pCur->iPage]);
4034   pPage = pCur->apPage[pCur->iPage];
4035   assert( pCur->aiIdx[pCur->iPage]<pPage->nCell );
4037     btreeParseCell(pCur->apPage[pCur->iPage], pCur->aiIdx[pCur->iPage],
4104   int i = pCur->iPage;
4110   assert( pCur->iPage<BTCURSOR_MAX_DEPTH );
4111   if( pCur->iPage>=(BTCURSOR_MAX_DEPTH-1) ){
4118   pCur->iPage++;
4159   assert( pCur->iPage>0 );
4160   assert( pCur->apPage[pCur->iPage] );
4162     pCur->apPage[pCur->iPage-1], 
4163     pCur->aiIdx[pCur->iPage-1], 
4164     pCur->apPage[pCur->iPage]->pgno
4166   releasePage(pCur->apPage[pCur->iPage]);
4167   pCur->iPage--;
4211   if( pCur->iPage>=0 ){
4213     for(i=1; i<=pCur->iPage; i++){
4216     pCur->iPage = 0;
4223     pCur->iPage = 0;
4276   while( rc==SQLITE_OK && !(pPage = pCur->apPage[pCur->iPage])->leaf ){
4277     assert( pCur->aiIdx[pCur->iPage]<pPage->nCell );
4278     pgno = get4byte(findCell(pPage, pCur->aiIdx[pCur->iPage]));
4301   while( rc==SQLITE_OK && !(pPage = pCur->apPage[pCur->iPage])->leaf ){
4303     pCur->aiIdx[pCur->iPage] = pPage->nCell;
4307     pCur->aiIdx[pCur->iPage] = pPage->nCell-1;
4326       assert( pCur->apPage[pCur->iPage]->nCell==0 );
4329       assert( pCur->apPage[pCur->iPage]->nCell>0 );
4353     for(ii=0; ii<pCur->iPage; ii++){
4356     assert( pCur->aiIdx[pCur->iPage]==pCur->apPage[pCur->iPage]->nCell-1 );
4357     assert( pCur->apPage[pCur->iPage]->leaf );
4365       assert( pCur->apPage[pCur->iPage]->nCell==0 );
4438   assert( pCur->apPage[pCur->iPage] );
4439   assert( pCur->apPage[pCur->iPage]->isInit );
4440   assert( pCur->apPage[pCur->iPage]->nCell>0 || pCur->eState==CURSOR_INVALID );
4443     assert( pCur->apPage[pCur->iPage]->nCell==0 );
4450     MemPage *pPage = pCur->apPage[pCur->iPage];
4464       pCur->aiIdx[pCur->iPage] = (u16)upr;
4466       pCur->aiIdx[pCur->iPage] = (u16)((upr+lwr)/2);
4469       int idx = pCur->aiIdx[pCur->iPage]; /* Index of current cell in pPage */
4554       pCur->aiIdx[pCur->iPage] = (u16)((lwr+upr)/2);
4566       assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
4571     pCur->aiIdx[pCur->iPage] = (u16)lwr;
4625   pPage = pCur->apPage[pCur->iPage];
4626   idx = ++pCur->aiIdx[pCur->iPage];
4641       if( pCur->iPage==0 ){
4647       pPage = pCur->apPage[pCur->iPage];
4648     }while( pCur->aiIdx[pCur->iPage]>=pPage->nCell );
4693   pPage = pCur->apPage[pCur->iPage];
4696     int idx = pCur->aiIdx[pCur->iPage];
4703     while( pCur->aiIdx[pCur->iPage]==0 ){
4704       if( pCur->iPage==0 ){
4714     pCur->aiIdx[pCur->iPage]--;
4715     pPage = pCur->apPage[pCur->iPage];
4905         Pgno iPage;
4923         iPage = get4byte(&aData[8+closest*4]);
4924         testcase( iPage==mxPage );
4925         if( iPage>mxPage ){
4929         testcase( iPage==mxPage );
4930         if( !searchList || iPage==nearby ){
4932           *pPgno = iPage;
5015 ** This function is used to add page iPage to the database file free-list. 
5020 ** corresponding to page iPage handy, it may pass it as the second value. 
5026 static int freePage2(BtShared *pBt, MemPage *pMemPage, Pgno iPage){
5035   assert( iPage>1 );
5036   assert( !pMemPage || pMemPage->pgno==iPage );
5042     pPage = btreePageLookup(pBt, iPage);
5055     if( (!pPage && ((rc = btreeGetPage(pBt, iPage, &pPage, 0))!=0) )
5067     ptrmapPut(pBt, iPage, PTRMAP_FREEPAGE, 0, &rc);
5111         put4byte(&pTrunk->aData[8+nLeaf*4], iPage);
5115         rc = btreeSetHasContent(pBt, iPage);
5128   if( pPage==0 && SQLITE_OK!=(rc = btreeGetPage(pBt, iPage, &pPage, 0)) ){
5137   put4byte(&pPage1->aData[32], iPage);
6515     int iPage = pCur->iPage;
6516     MemPage *pPage = pCur->apPage[iPage];
6518     if( iPage==0 ){
6528           pCur->iPage = 1;
6539       MemPage * const pParent = pCur->apPage[iPage-1];
6540       int const iIdx = pCur->aiIdx[iPage-1];
6587           rc = balance_nonroot(pParent, iIdx, pSpace, iPage==1);
6607       pCur->iPage--;
6700   pPage = pCur->apPage[pCur->iPage];
6715   idx = pCur->aiIdx[pCur->iPage];
6733     idx = ++pCur->aiIdx[pCur->iPage];
6769     pCur->apPage[pCur->iPage]->nOverflow = 0;
6772   assert( pCur->apPage[pCur->iPage]->nOverflow==0 );
6798   if( NEVER(pCur->aiIdx[pCur->iPage]>=pCur->apPage[pCur->iPage]->nCell) 
6810   iCellDepth = pCur->iPage;
6847     MemPage *pLeaf = pCur->apPage[pCur->iPage];
6881   if( rc==SQLITE_OK && pCur->iPage>iCellDepth ){
6882     while( pCur->iPage>iCellDepth ){
6883       releasePage(pCur->apPage[pCur->iPage--]);
7347     pPage = pCur->apPage[pCur->iPage];
7355     ** pCur->aiIdx[pCur->iPage] value is set to the index of the parent cell
7364         if( pCur->iPage==0 ){
7370       }while ( pCur->aiIdx[pCur->iPage]>=pCur->apPage[pCur->iPage]->nCell );
7372       pCur->aiIdx[pCur->iPage]++;
7373       pPage = pCur->apPage[pCur->iPage];
7379     iIdx = pCur->aiIdx[pCur->iPage];
7431 ** Add 1 to the reference count for page iPage.  If this is the second
7438 static int checkRef(IntegrityCk *pCheck, Pgno iPage, char *zContext){
7439   if( iPage==0 ) return 1;
7440   if( iPage>pCheck->nPage ){
7441     checkAppendMsg(pCheck, zContext, "invalid page number %d", iPage);
7444   if( pCheck->anRef[iPage]==1 ){
7445     checkAppendMsg(pCheck, zContext, "2nd reference to page %d", iPage);
7448   return  (pCheck->anRef[iPage]++)>1;
7490   int iPage,            /* Page number for first page in the list */
7496   int iFirst = iPage;
7500     if( iPage<1 ){
7506     if( checkRef(pCheck, iPage, zContext) ) break;
7507     if( sqlite3PagerGet(pCheck->pPager, (Pgno)iPage, &pOvflPage) ){
7508       checkAppendMsg(pCheck, zContext, "failed to get page %d", iPage);
7516         checkPtrmap(pCheck, iPage, PTRMAP_FREEPAGE, 0, zContext);
7521            "freelist leaf count too big on page %d", iPage);
7538       /* If this database supports auto-vacuum and iPage is not the last
7540       ** the following page matches iPage.
7544         checkPtrmap(pCheck, i, PTRMAP_OVERFLOW2, iPage, zContext);
7548     iPage = get4byte(pOvflData);
7575   int iPage,            /* Page number of the page to check */
7592   sqlite3_snprintf(sizeof(zContext), zContext, "Page %d: ", iPage);
7598   if( iPage==0 ) return 0;
7599   if( checkRef(pCheck, iPage, zParentContext) ) return 0;
7600   if( (rc = btreeGetPage(pBt, (Pgno)iPage, &pPage, 0))!=0 ){
7628              "On tree page %d cell %d: ", iPage, i);
7651         checkPtrmap(pCheck, pgnoOvfl, PTRMAP_OVERFLOW1, iPage, zContext);
7663         checkPtrmap(pCheck, pgno, PTRMAP_BTREE, iPage, zContext);
7677                      "On page %d at right child: ", iPage);
7680       checkPtrmap(pCheck, pgno, PTRMAP_BTREE, iPage, zContext);
7745             "Corruption detected in cell %d on page %d",i,iPage);
7767           "Multiple uses for byte %d of page %d", i, iPage);
7774           cnt, data[hdr+7], iPage);
8086   assert( pCsr->apPage[pCsr->iPage]->intKey );