| /sqlite-3.40.0/src/ |
| H A D | btree.c | 1519 nCell = pPage->nCell; in defragmentPage()
3677 nCell = pPage->nCell; in setChildPtrmaps()
3723 int nCell; in modifyPagePointer() local
3728 nCell = pPage->nCell; in modifyPagePointer()
7335 pPg->nCell = nCell; in rebuildPage()
7503 int nCell = pPg->nCell; /* Cells stored on pPg */ in editPage() local
7555 nCell++; in editPage()
7569 iNew+nCell, nNew-nCell, pCArray in editPage()
8679 assert( pChild->nCell==pRoot->nCell || CORRUPT_DB ); in balance_deeper()
9553 dropCell(pLeaf, pLeaf->nCell-1, nCell, &rc); in sqlite3BtreeDelete()
[all …]
|
| H A D | dbstat.c | 307 for(i=0; i<p->nCell; i++){ in statClearCells()
312 p->nCell = 0; in statClearCells()
344 pCsr->nCell = 0; in statResetCounts()
414 p->nCell = get2byte(&aHdr[3]); in statDecodePage()
432 if( p->nCell ){ in statDecodePage()
443 for(i=0; i<p->nCell; i++){ in statDecodePage()
609 while( p->iCell<p->nCell ){ in statNext()
658 if( p->iCell==p->nCell ){ in statNext()
700 pCsr->nCell += p->nCell; in statNext()
708 for(i=0; i<p->nCell; i++){ in statNext()
[all …]
|
| H A D | btreeInt.h | 289 u16 nCell; /* Number of cells on this page, local and ovfl */ member
|
| /sqlite-3.40.0/ext/rtree/ |
| H A D | rtree.c | 851 nCell = NCELL(pNode); in nodeInsertCell()
854 if( nCell<nMaxCell ){ in nodeInsertCell()
1365 assert( nCell<200 ); in nodeRowidIndex()
1615 int nCell; in rtreeStepToLeaf() local
1627 assert( nCell<200 ); in rtreeStepToLeaf()
2169 int nCell in cellOverlap() argument
2460 int nCell, in splitNodeStartree() argument
2614 nCell++; in SplitNode()
2880 int nCell; in Reinsert() local
2890 n = (nCell+1)&(~1); in Reinsert()
[all …]
|
| H A D | rtree_util.tcl | 62 set nCell [llength $node]
64 for {set ii 0} {$ii < $nCell} {incr ii} {
|
| H A D | rtreedoc3.test | 42 binary scan [string range $aData 2 3] S nCell
45 for {set i 0} {$i < $nCell} {incr i} {
98 set nCell [llength [rnode_cells [rt_node_get 1]]]
|
| H A D | rtreedoc.test | 1266 binary scan [string range $aData 2 3] S nCell
1269 for {set i 0} {$i < $nCell} {incr i} {
|
| /sqlite-3.40.0/ext/misc/ |
| H A D | btreeinfo.c | 279 int nCell; in binfoCompute() local
305 nCell = get_uint16(aData+3); in binfoCompute()
306 nEntry *= (nCell+1); in binfoCompute()
308 nPage *= (nCell+1); in binfoCompute()
309 if( nCell<=1 ){ in binfoCompute()
312 iCell = get_uint16(aData+12+2*(nCell/2)); in binfoCompute()
|
| H A D | scrub.c | 377 u32 nCell; in scrubBackupBtree() local
402 nCell = scrubBackupInt16(&aTop[3]); in scrubBackupBtree()
408 y = szHdr + nPrefix + nCell*2; in scrubBackupBtree()
429 for(i=0; i<nCell; i++){ in scrubBackupBtree()
|
| /sqlite-3.40.0/tool/ |
| H A D | showdb.c | 648 int nCell; in decode_btree_page() local
680 nCell = a[3]*256 + a[4]; in decode_btree_page()
682 if( cellToDecode>=nCell ){ in decode_btree_page()
695 if( cellToDecode==(-2) && nCell>0 ){ in decode_btree_page()
703 memset(&zMap[hdrSize+iCellPtr], 'P', 2*nCell); in decode_btree_page()
705 for(i=0; i<nCell; i++){ in decode_btree_page()
870 int nCell; in page_usage_btree() local
897 nCell = a[hdr+3]*256 + a[hdr+4]; in page_usage_btree()
898 if( nCell==1 ){ in page_usage_btree()
914 for(i=0; i<nCell; i++){ in page_usage_btree()
[all …]
|
| H A D | offsets.c | 225 int nCell; in ofstWalkInteriorPage() local
230 nCell = ofst2byte(p, 3); in ofstWalkInteriorPage()
231 for(i=0; i<nCell; i++){ in ofstWalkInteriorPage()
242 int nCell; in ofstWalkLeafPage() local
254 nCell = ofst2byte(p, 3); in ofstWalkLeafPage()
255 for(i=0; i<nCell; i++){ in ofstWalkLeafPage()
|
| H A D | showwal.c | 447 int nCell; in decode_btree_page() local
470 nCell = a[3]*256 + a[4]; in decode_btree_page()
479 if( nCell>0 ){ in decode_btree_page()
487 memset(&zMap[hdrSize+iCellPtr], 'P', 2*nCell); in decode_btree_page()
489 for(i=0; i<nCell; i++){ in decode_btree_page()
|
| /sqlite-3.40.0/ext/recover/ |
| H A D | dbdata.c | 101 int nCell; /* Number of cells on aPage[] */ member
517 pCsr->nCell = get_uint16(&pCsr->aPage[iOff+3]); in dbdataNext()
522 pCsr->iCell = pCsr->nCell; in dbdataNext()
525 if( pCsr->iCell>=pCsr->nCell ){ in dbdataNext()
555 pCsr->iCell = pCsr->nCell; in dbdataNext()
559 if( pCsr->iCell>=pCsr->nCell ){ in dbdataNext()
|
| H A D | sqlite3recover.c | 2074 int nCell = 0; /* Number of cells on page */ in recoverIsValidPage() local
2084 nCell = (int)recoverGetU16(&a[3]); in recoverIsValidPage()
2114 if( (iCellOff + 2*nCell)>iContent ) return 0; in recoverIsValidPage()
2115 for(ii=0; ii<nCell; ii++){ in recoverIsValidPage()
|
| /sqlite-3.40.0/ext/lsm1/ |
| H A D | lsm_sorted.c | 415 int nCell; in sortedReadData() local
661 int nCell; in btreeCursorPtr() local
664 if( iCell>=nCell ){ in btreeCursorPtr()
674 int nCell; in btreeCursorNext() local
683 assert( pPg->iCell<=nCell ); in btreeCursorNext()
685 if( pPg->iCell==nCell ){ in btreeCursorNext()
1065 assert( iNew<pPtr->nCell ); in segmentPtrLoadCell()
1163 pPtr->nCell = 0; in segmentPtrReset()
1665 assert( pPtr->nCell>0 in segmentPtrSeek()
1669 if( pPtr->nCell==0 ){ in segmentPtrSeek()
[all …]
|
| /sqlite-3.40.0/test/ |
| H A D | dbfuzz001.test | 197 # pPage->nCell==0 to enter the balancer.
|