Lines Matching refs:nCell
1063 int nCell; /* Number of cells on the page */
1079 nCell = pPage->nCell;
1080 assert( nCell==get2byte(&data[hdr+3]) );
1085 iCellFirst = cellOffset + 2*nCell;
1087 for(i=0; i<nCell; i++){
1165 gap = pPage->cellOffset + 2*pPage->nCell;
1402 pPage->nCell = get2byte(&data[hdr+3]);
1403 if( pPage->nCell>MX_CELL(pBt) ){
1407 testcase( pPage->nCell==MX_CELL(pBt) );
1416 iCellFirst = cellOffset + 2*pPage->nCell;
1424 for(i=0; i<pPage->nCell; i++){
1507 pPage->nCell = 0;
2668 int nCell; /* Number of cells in page pPage */
2679 nCell = pPage->nCell;
2681 for(i=0; i<nCell; i++){
2728 int nCell;
2731 nCell = pPage->nCell;
2733 for(i=0; i<nCell; i++){
2752 if( i==nCell ){
3837 assert( pCur->aiIdx[pCur->iPage]<pPage->nCell );
3969 assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
3996 assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
4035 assert( pCur->aiIdx[pCur->iPage]<pPage->nCell );
4122 if( pNewPage->nCell<1 || pNewPage->intKey!=pCur->apPage[i]->intKey ){
4137 assert( iIdx<=pParent->nCell );
4138 if( iIdx==pParent->nCell ){
4250 if( pRoot->nCell==0 && !pRoot->leaf ){
4257 pCur->eState = ((pRoot->nCell>0)?CURSOR_VALID:CURSOR_INVALID);
4277 assert( pCur->aiIdx[pCur->iPage]<pPage->nCell );
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 );
4354 assert( pCur->aiIdx[ii]==pCur->apPage[ii]->nCell );
4356 assert( pCur->aiIdx[pCur->iPage]==pCur->apPage[pCur->iPage]->nCell-1 );
4365 assert( pCur->apPage[pCur->iPage]->nCell==0 );
4440 assert( pCur->apPage[pCur->iPage]->nCell>0 || pCur->eState==CURSOR_INVALID );
4443 assert( pCur->apPage[pCur->iPage]->nCell==0 );
4453 /* pPage->nCell must be greater than zero. If this is the root-page
4459 assert( pPage->nCell>0 );
4462 upr = pPage->nCell-1;
4500 int nCell = pCell[0];
4501 if( !(nCell & 0x80) && nCell<=pPage->maxLocal ){
4505 c = sqlite3VdbeRecordCompare(nCell, (void*)&pCell[1], pIdxKey);
4507 && (nCell = ((nCell&0x7f)<<7) + pCell[1])<=pPage->maxLocal
4511 c = sqlite3VdbeRecordCompare(nCell, (void*)&pCell[2], pIdxKey);
4520 nCell = (int)pCur->info.nKey;
4521 pCellKey = sqlite3Malloc( nCell );
4526 rc = accessPayload(pCur, 0, nCell, (unsigned char*)pCellKey, 0);
4531 c = sqlite3VdbeRecordCompare(nCell, pCellKey, pIdxKey);
4560 }else if( lwr>=pPage->nCell ){
4566 assert( pCur->aiIdx[pCur->iPage]<pCur->apPage[pCur->iPage]->nCell );
4628 assert( idx<=pPage->nCell );
4632 if( idx>=pPage->nCell ){
4648 }while( pCur->aiIdx[pCur->iPage]>=pPage->nCell );
5396 assert( idx>=0 && idx<pPage->nCell );
5415 for(i=idx+1; i<pPage->nCell; i++, ptr+=2){
5419 pPage->nCell--;
5420 put2byte(&data[hdr+3], pPage->nCell);
5462 assert( i>=0 && i<=pPage->nCell+pPage->nOverflow );
5463 assert( pPage->nCell<=MX_CELL(pPage->pBt) && MX_CELL(pPage->pBt)<=10921 );
5493 end = cellOffset + 2*pPage->nCell;
5501 pPage->nCell++;
5512 put2byte(&data[pPage->hdrOffset+3], pPage->nCell);
5530 int nCell, /* The number of cells to add to this page */
5543 assert( nCell>=0 && nCell<=(int)MX_CELL(pPage->pBt)
5548 assert( pPage->nCell==0 );
5551 pCellptr = &data[pPage->cellOffset + nCell*2];
5553 for(i=nCell-1; i>=0; i--){
5559 put2byte(&data[hdr+3], nCell);
5561 pPage->nFree -= (nCell*2 + nUsable - cellbody);
5562 pPage->nCell = (u16)nCell;
5616 if( pPage->nCell<=0 ) return SQLITE_CORRUPT_BKPT;
5665 pCell = findCell(pPage, pPage->nCell-1);
5672 insertCell(pParent, pParent->nCell, pSpace, (int)(pOut-pSpace),
5701 for(j=0; j<pPage->nCell; j++){
5763 memcpy(&aTo[iToHdr], &aFrom[iFromHdr], pFrom->cellOffset + 2*pFrom->nCell);
5833 int nCell = 0; /* Number of cells in apCell[] */
5891 i = pParent->nOverflow + pParent->nCell;
5906 if( (i+nxDiv-pParent->nOverflow)==pParent->nCell ){
5918 nMaxCells += 1+apOld[i]->nCell+apOld[i]->nOverflow;
6010 limit = pOld->nCell+pOld->nOverflow;
6012 assert( nCell<nMaxCells );
6013 apCell[nCell] = findOverflowCell(pOld, j);
6014 szCell[nCell] = cellSizePtr(pOld, apCell[nCell]);
6015 nCell++;
6020 assert( nCell<nMaxCells );
6021 szCell[nCell] = sz;
6027 apCell[nCell] = pTemp+leafCorrection;
6029 szCell[nCell] = szCell[nCell] - leafCorrection;
6035 memcpy(apCell[nCell], &pOld->aData[8], 4);
6038 if( szCell[nCell]<4 ){
6040 szCell[nCell] = 4;
6043 nCell++;
6048 ** Figure out the number of pages needed to hold all nCell cells.
6052 ** cntNew[k] should equal nCell.
6064 for(subtotal=k=i=0; i<nCell; i++){
6077 cntNew[k] = nCell;
6115 assert( cntNew[0]>0 || (pParent->pgno==1 && pParent->nCell==0) );
6217 assert( pNew->nCell>0 || (nNew==1 && cntNew[0]==0) );
6225 assert( i<nNew-1 || j==nCell );
6226 if( j<nCell ){
6278 assert( j==nCell );
6286 if( isRoot && pParent->nCell==0 && pParent->hdrOffset<=apNew[0]->nFree ){
6303 (get2byte(&apNew[0]->aData[5])-apNew[0]->cellOffset-apNew[0]->nCell*2)
6342 int iNextOld = pOld->nCell + nOverflow;
6346 for(i=0; i<nCell; i++){
6353 iNextOld = i + !leafData + pOld->nCell + pOld->nOverflow;
6414 nOld, nNew, nCell));
6479 assert( pChild->nCell==pRoot->nCell );
6547 && pPage->aOvfl[0].idx==pPage->nCell
6549 && pParent->nCell==iIdx
6718 assert( idx<pPage->nCell );
6731 }else if( loc<0 && pPage->nCell>0 ){
6738 assert( rc!=SQLITE_OK || pPage->nCell>0 || pPage->nOverflow>0 );
6798 if( NEVER(pCur->aiIdx[pCur->iPage]>=pCur->apPage[pCur->iPage]->nCell)
6848 int nCell;
6852 pCell = findCell(pLeaf, pLeaf->nCell-1);
6853 nCell = cellSizePtr(pLeaf, pCell);
6854 assert( MX_CELL_SIZE(pBt) >= nCell );
6860 insertCell(pPage, iCellIdx, pCell-4, nCell+4, pTmp, n, &rc);
6861 dropCell(pLeaf, pLeaf->nCell-1, nCell, &rc);
7070 for(i=0; i<pPage->nCell; i++){
7084 *pnChange += pPage->nCell;
7349 nEntry += pPage->nCell;
7370 }while ( pCur->aiIdx[pCur->iPage]>=pCur->apPage[pCur->iPage]->nCell );
7377 ** points at. This is the right-child if (iIdx==pPage->nCell).
7380 if( iIdx==pPage->nCell ){
7583 int nCell;
7620 for(i=0; i<pPage->nCell && pCheck->mxErr; i++){
7683 checkTreePage(pCheck, pgno, zContext, NULL, !pPage->nCell ? NULL : &nMaxKey);
7734 nCell = get2byte(&data[hdr+3]);
7736 for(i=0; i<nCell; i++){