| /sqlite-3.40.0/ext/lsm1/ |
| H A D | lsm_tree.c | 282 assert( iCell>=0 && iCell<=array_size(p->aiChildPtr) ); in getChildPtr()
328 int iCell in assertIsWorkingChild() argument
1406 if( iCell<3 && pNode->aiKeyPtr[iCell] ){ in treeNextIsEndDelete()
1428 if( iCell>=0 && pNode->aiKeyPtr[iCell] ){ in treePrevIsStartDelete()
2071 int iCell; in lsmTreeCursorNext() local
2111 else if( iCell>=3 || pNode->aiKeyPtr[iCell]==0 ){ in lsmTreeCursorNext()
2114 if( iCell<3 && pCsr->apTreeNode[pCsr->iNode]->aiKeyPtr[iCell] ) break; in lsmTreeCursorNext()
2137 int iCell; in lsmTreeCursorPrev() local
2157 assert( iCell>=0 && iCell<3 ); in lsmTreeCursorPrev()
2181 if( iCell>=0 && pCsr->apTreeNode[pCsr->iNode]->aiKeyPtr[iCell] ) break; in lsmTreeCursorPrev()
[all …]
|
| H A D | lsm_sorted.c | 643 int iCell = pCsr->aPg[iPg].iCell; in btreeCursorLoadKey() local
645 iCell = pCsr->aPg[iPg].iCell-1; in btreeCursorLoadKey()
808 int iCell = pCsr->aPg[pCsr->iPg].iCell; in btreeCursorSplitkey() local
810 p->iCell = iCell; in btreeCursorSplitkey()
818 p->iCell = pCsr->aPg[i].iCell-1; in btreeCursorSplitkey()
852 iCell = (p->iCell >> 8) - 1; in btreeCursorRestore()
863 pCsr->aPg[pCsr->iPg].iCell = iCell; in btreeCursorRestore()
1191 iCell = pPtr->iCell + eDir; in segmentPtrAdvance()
1200 if( iCell>=pPtr->nCell || iCell<0 ){ in segmentPtrAdvance()
5740 for(iCell=0; iCell<nRec; iCell++){ in infoPageDump()
[all …]
|
| H A D | lsm_ckpt.c | 346 ckptSetValue(p, iOut++, pMerge->aInput[i].iCell, pRc); in ckptExportLevel()
349 ckptSetValue(p, iOut++, pMerge->splitkey.iCell, pRc); in ckptExportLevel()
539 pMerge->aInput[i].iCell = (int)aInt[iIn++]; in ckptSetupMerge()
542 pMerge->splitkey.iCell = (int)aInt[iIn++]; in ckptSetupMerge()
|
| H A D | lsmInt.h | 460 int iCell; /* Cell containing next input to merge */ member
|
| /sqlite-3.40.0/ext/rtree/ |
| H A D | rtree.c | 1650 p->iCell++; in rtreeStepToLeaf()
1660 x.iCell = 0; in rtreeStepToLeaf()
1663 x.iCell = p->iCell - 1; in rtreeStepToLeaf()
1674 p->iCell = x.iCell; in rtreeStepToLeaf()
1842 int iCell = 0; in rtreeFilter() local
1872 p->iCell = (u8)iCell; in rtreeFilter()
2209 int iCell; in ChooseLeaf() local
2225 for(iCell=0; iCell<nCell; iCell++){ in ChooseLeaf()
2268 int iCell; in AdjustTree() local
2663 int iCell; in SplitNode() local
[all …]
|
| H A D | viewrtree.tcl | 158 proc cell_report {db zTab iParent iCell} { argument
160 set cell [lindex $data $iCell]
|
| H A D | geopoly.c | 1351 int iCell = 0; in geopolyFilter() local
1372 rc = nodeRowidIndex(pRtree, pLeaf, iRowid, &iCell); in geopolyFilter()
1373 p->iCell = (u8)iCell; in geopolyFilter()
1444 pNew->iCell = 0; in geopolyFilter()
1543 nodeGetRowid(pRtree, pNode, p->iCell)); in geopolyColumn()
|
| H A D | rtreedoc.test | 1291 proc rnode_replace_cell {aData iCell cell} {
1295 set iOff [expr $iCell*$nBytePerCell+4]
|
| /sqlite-3.40.0/ext/recover/ |
| H A D | dbdata.c | 285 pCsr->iCell = 0; in dbdataResetCursor()
516 pCsr->iCell = pTab->bPtr ? -2 : 0; in dbdataNext()
522 pCsr->iCell = pCsr->nCell; in dbdataNext()
524 pCsr->iCell++; 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()
681 pCsr->iCell++; in dbdataNext()
840 if( pCsr->iCell<0 ){ in dbdataColumn()
843 iOff += 12 + pCsr->iCell*2; in dbdataColumn()
[all …]
|
| H A D | sqlite3recover.c | 1527 int iCell = sqlite3_column_int64(pPageData, 0); in recoverLostAndFoundOnePage() local
1530 if( iPrevCell!=iCell && nVal>=0 ){ in recoverLostAndFoundOnePage()
1556 if( iCell<0 ) break; in recoverLostAndFoundOnePage()
1573 iPrevCell = iCell; in recoverLostAndFoundOnePage()
1762 int iCell = sqlite3_column_int(pSel, 1); in recoverWriteDataStep() local
1765 int bNewCell = (p1->iPrevPage!=iPage || p1->iPrevCell!=iCell); in recoverWriteDataStep()
1826 p1->iPrevCell = iCell; in recoverWriteDataStep()
|
| /sqlite-3.40.0/src/ |
| H A D | dbstat.c | 105 int iCell; /* Current cell */ member
594 pCsr->aPage[0].iCell = 0; in statNext()
609 while( p->iCell<p->nCell ){ in statNext()
610 StatCell *pCell = &p->aCell[p->iCell]; in statNext()
632 "%s%.3x+%.6x", p->zPath, p->iCell, iOvfl in statNext()
638 p->iCell++; in statNext()
641 if( !p->iRightChildPg || p->iCell>p->nCell ){ in statNext()
658 if( p->iCell==p->nCell ){ in statNext()
661 p[1].iPgno = p->aCell[p->iCell].iChildPg; in statNext()
665 p[1].iCell = 0; in statNext()
[all …]
|
| H A D | btree.c | 1314 int iCell, /* The cell index. First cell is 0 */ in btreeParseCell() argument
1317 pPage->xParseCell(pPage, findCell(pPage, iCell), pInfo); in btreeParseCell()
1452 static u16 cellSize(MemPage *pPage, int iCell){ in cellSize() argument
1453 return pPage->xCellSize(pPage, findCell(pPage, iCell)); in cellSize()
7549 int iCell = (iOld + pPg->aiOvfl[i]) - iNew; in editPage() local
7550 if( iCell>=0 && iCell<nNew ){ in editPage()
7551 pCellptr = &pPg->aCellIdx[iCell * 2]; in editPage()
7552 if( nCell>iCell ){ in editPage()
7553 memmove(&pCellptr[2], pCellptr, (nCell - iCell) * 2); in editPage()
7556 cachedCellSize(pCArray, iCell+iNew); in editPage()
[all …]
|
| /sqlite-3.40.0/ext/misc/ |
| H A D | btreeinfo.c | 280 int iCell; in binfoCompute() local
312 iCell = get_uint16(aData+12+2*(nCell/2)); in binfoCompute()
313 if( pgno==1 ) iCell -= 100; in binfoCompute()
314 if( iCell<=12 || iCell>=pgsz-4 ){ in binfoCompute()
318 pgno = get_uint32(aData+iCell); in binfoCompute()
|
| /sqlite-3.40.0/tool/ |
| H A D | showdb.c | 491 int iCell, /* Cell index */ in decodeCell() argument
511 printf("Cell[%d]:\n", iCell); in decodeCell()
|