Lines Matching defs:iCell

48157 static u8 *findOverflowCell(MemPage *pPage, int iCell){
48165 if( k<=iCell ){
48166 if( k==iCell ){
48169 iCell--;
48172 return findCell(pPage, iCell);
48250 #define parseCell(pPage, iCell, pInfo) \
48251 btreeParseCellPtr((pPage), findCell((pPage), (iCell)), (pInfo))
48254 int iCell, /* The cell index. First cell is 0 */
48257 parseCell(pPage, iCell, pInfo);
48322 static u16 cellSize(MemPage *pPage, int iCell){
48323 return cellSizePtr(pPage, findCell(pPage, iCell));
111541 unsigned iCell; /* Current cell. */
111543 /* Info parsed from data in iCell. */
111580 pCursor->iCell = pCursor->nCells = 0;
111606 pCursor->iCell = 0;
111728 /* Setup the cursor for reading the information from cell iCell. */
111732 unsigned iCellOffset; /* Offset of current cell (iCell). */
111734 unsigned nCellMaxBytes; /* Maximum local size of iCell. */
111735 unsigned iEndOffset; /* End of iCell's in-page data. */
111737 u64 iRowid; /* iCell's rowid (in table). */
111746 assert( pCursor->iCell<pCursor->nCells );
111753 iCellOffset = decodeUnsigned16(pCellOffsets + pCursor->iCell*2);
111938 pCursor->iCell++;
111941 if( pCursor->iCell>=pCursor->nCells ){
111946 assert( pCursor->iCell==0 );
124660 int iCell; /* Index of current cell in pNode */
124997 ** Overwrite cell iCell of node pNode with the contents of pCell.
125003 int iCell
125006 u8 *p = &pNode->zData[4 + pRtree->nBytesPerCell*iCell];
125015 ** Remove cell the cell with index iCell from node pNode.
125017 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
125018 u8 *pDst = &pNode->zData[4 + pRtree->nBytesPerCell*iCell];
125020 int nByte = (NCELL(pNode) - iCell - 1) * pRtree->nBytesPerCell;
125107 ** Return the 64-bit integer value associated with cell iCell of
125114 int iCell
125116 assert( iCell<NCELL(pNode) );
125117 return readInt64(&pNode->zData[4 + pRtree->nBytesPerCell*iCell]);
125121 ** Return coordinate iCoord from cell iCell in node pNode.
125126 int iCell,
125130 readCoord(&pNode->zData[12 + pRtree->nBytesPerCell*iCell + 4*iCoord], pCoord);
125134 ** Deserialize cell iCell of node pNode. Populate the structure pointed
125140 int iCell,
125144 pCell->iRowid = nodeGetRowid(pRtree, pNode, iCell);
125146 nodeGetCoord(pRtree, pNode, iCell, ii, &pCell->aCoord[ii]);
125345 nodeGetCell(pRtree, pCursor->pNode, pCursor->iCell, &cell);
125398 nodeGetCell(pRtree, pCursor->pNode, pCursor->iCell, &cell);
125451 int iSavedCell = pCursor->iCell;
125464 iRowid = nodeGetRowid(pRtree, pCursor->pNode, pCursor->iCell);
125474 pCursor->iCell = ii;
125486 pCursor->iCell = iSavedCell;
125552 for(pCsr->iCell++; pCsr->iCell<nCell; pCsr->iCell++){
125560 rc = nodeParentIndex(pRtree, pNode, &pCsr->iCell);
125581 *pRowid = nodeGetRowid(pRtree, pCsr->pNode, pCsr->iCell);
125594 i64 iRowid = nodeGetRowid(pRtree, pCsr->pNode, pCsr->iCell);
125598 nodeGetCoord(pRtree, pCsr->pNode, pCsr->iCell, i-1, &c);
125705 rc = nodeRowidIndex(pRtree, pLeaf, iRowid, &pCsr->iCell);
125747 for(pCsr->iCell=0; rc==SQLITE_OK && pCsr->iCell<nCell; pCsr->iCell++){
125759 assert( rc!=SQLITE_OK || !pCsr->pNode || pCsr->iCell<NCELL(pCsr->pNode) );
126014 int iCell;
126047 for(iCell=0; iCell<nCell; iCell++){
126052 nodeGetCell(pRtree, pNode, iCell, &cell);
126058 overlap = cellOverlapEnlargement(pRtree,&cell,pCell,aCell,nCell,iCell);
126060 if( (iCell==0)
126068 if( iCell==0||growth<fMinGrowth||(growth==fMinGrowth && area<fMinArea) ){
126104 int iCell;
126106 if( nodeParentIndex(pRtree, p, &iCell) ){
126110 nodeGetCell(pRtree, pParent, iCell, &cell);
126113 nodeOverwriteCell(pRtree, pParent, &cell, iCell);
126692 int iCell;
126693 rc = nodeParentIndex(pRtree, pLeft, &iCell);
126695 nodeOverwriteCell(pRtree, pParent, &leftbbox, iCell);
126791 int iCell;
126796 rc = nodeParentIndex(pRtree, pNode, &iCell);
126800 rc = deleteCell(pRtree, pParent, iCell, iHeight+1);
126860 ** Delete the cell at index iCell of node pNode. After removing the
126863 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
126874 nodeDeleteCell(pRtree, pNode, iCell);
127098 int iCell; /* Index of iDelete cell in pLeaf */
127115 rc = nodeRowidIndex(pRtree, pLeaf, iDelete, &iCell);
127117 rc = deleteCell(pRtree, pLeaf, iCell, 0);