Lines Matching defs:iHeight
987 ** height iHeight (if iHeight==0, then the node is a leaf). Descend
994 int iHeight,
1006 assert( iHeight>=0 );
1008 if( iHeight==0 ){
1013 if( rc!=SQLITE_OK || isEof || iHeight==0 ){
1028 rc = descendToCell(pRtree, pCursor, iHeight-1, &isEof);
1101 int iHeight = 0;
1107 rc = descendToCell(pRtree, pCsr, iHeight, &isEof);
1119 iHeight++;
1558 int iHeight, /* Height of sub-tree rooted at pCell */
1566 for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){
2147 int iHeight
2150 xSetMapping = ((iHeight==0)?rowidWrite:parentWrite);
2151 if( iHeight>0 ){
2166 int iHeight
2239 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
2255 if( (rc = rtreeInsertCell(pRtree, pRight->pParent, &rightbbox, iHeight+1)) ){
2261 rc = updateMapping(pRtree, iRowid, pRight, iHeight);
2272 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
2278 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
2340 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
2353 rc = deleteCell(pRtree, pParent, iCell, iHeight+1);
2381 iHeight;
2416 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
2438 rc = removeNode(pRtree, pNode, iHeight);
2451 int iHeight
2515 if( iHeight==0 ){
2531 rc = ChooseLeaf(pRtree, p, iHeight, &pInsert);
2534 rc = rtreeInsertCell(pRtree, pInsert, p, iHeight);
2548 ** subtree iHeight high (leaf nodes have iHeight==0).
2554 int iHeight
2557 if( iHeight>0 ){
2567 if( iHeight<=pRtree->iReinsertHeight || pNode->iNode==1){
2568 rc = SplitNode(pRtree, pNode, pCell, iHeight);
2570 pRtree->iReinsertHeight = iHeight;
2571 rc = Reinsert(pRtree, pNode, pCell, iHeight);
2574 rc = SplitNode(pRtree, pNode, pCell, iHeight);
2579 if( iHeight==0 ){
