Lines Matching defs:iHeight
113556 ** varint iHeight; (height from leaf level, always 0)
113602 ** varint iHeight; (height from leaf level, always >0)
115716 int iHeight; /* Height of this node in tree */
115720 sqlite3Fts3GetVarint32(zNode, &iHeight);
115724 if( rc==SQLITE_OK && iHeight>1 ){
124099 int iHeight,
124103 assert( iHeight>=1 && iHeight<128 );
124105 pTree->aData[nStart] = (char)iHeight;
124126 int iHeight, /* Height of this node in tree */
124137 int nStart = fts3TreeFinishNode(pTree, iHeight, iLeaf);
124146 int nStart = fts3TreeFinishNode(pIter, iHeight, iNextLeaf);
124156 p, pTree->pParent, iHeight+1, iFree, iNextFree, piLast, paRoot, pnRoot
128016 ** height iHeight (if iHeight==0, then the node is a leaf). Descend
128023 int iHeight,
128035 assert( iHeight>=0 );
128037 if( iHeight==0 ){
128042 if( rc!=SQLITE_OK || isEof || iHeight==0 ){
128057 rc = descendToCell(pRtree, pCursor, iHeight-1, &isEof);
128130 int iHeight = 0;
128136 rc = descendToCell(pRtree, pCsr, iHeight, &isEof);
128148 iHeight++;
128587 int iHeight, /* Height of sub-tree rooted at pCell */
128595 for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){
129176 int iHeight
129179 xSetMapping = ((iHeight==0)?rowidWrite:parentWrite);
129180 if( iHeight>0 ){
129195 int iHeight
129268 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
129284 if( (rc = rtreeInsertCell(pRtree, pRight->pParent, &rightbbox, iHeight+1)) ){
129290 rc = updateMapping(pRtree, iRowid, pRight, iHeight);
129301 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
129307 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
129369 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
129382 rc = deleteCell(pRtree, pParent, iCell, iHeight+1);
129410 pNode->iNode = iHeight;
129445 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
129467 rc = removeNode(pRtree, pNode, iHeight);
129480 int iHeight
129544 if( iHeight==0 ){
129560 rc = ChooseLeaf(pRtree, p, iHeight, &pInsert);
129563 rc = rtreeInsertCell(pRtree, pInsert, p, iHeight);
129577 ** subtree iHeight high (leaf nodes have iHeight==0).
129583 int iHeight
129586 if( iHeight>0 ){
129596 if( iHeight<=pRtree->iReinsertHeight || pNode->iNode==1){
129597 rc = SplitNode(pRtree, pNode, pCell, iHeight);
129599 pRtree->iReinsertHeight = iHeight;
129600 rc = Reinsert(pRtree, pNode, pCell, iHeight);
129603 rc = SplitNode(pRtree, pNode, pCell, iHeight);
129608 if( iHeight==0 ){