Home | History | Annotate | Download | only in amalgamation

Lines Matching defs:iHeight

112530 ** varint iHeight;             (height from leaf level, always 0)
112576 ** varint iHeight; (height from leaf level, always >0)
114381 int iHeight; /* Height of this node in tree */
114385 sqlite3Fts3GetVarint32(zNode, &iHeight);
114389 if( rc==SQLITE_OK && iHeight>1 ){
121529 int iHeight,
121533 assert( iHeight>=1 && iHeight<128 );
121535 pTree->aData[nStart] = (char)iHeight;
121556 int iHeight, /* Height of this node in tree */
121567 int nStart = fts3TreeFinishNode(pTree, iHeight, iLeaf);
121576 int nStart = fts3TreeFinishNode(pIter, iHeight, iNextLeaf);
121586 p, pTree->pParent, iHeight+1, iFree, iNextFree, piLast, paRoot, pnRoot
125255 ** height iHeight (if iHeight==0, then the node is a leaf). Descend
125262 int iHeight,
125274 assert( iHeight>=0 );
125276 if( iHeight==0 ){
125281 if( rc!=SQLITE_OK || isEof || iHeight==0 ){
125296 rc = descendToCell(pRtree, pCursor, iHeight-1, &isEof);
125369 int iHeight = 0;
125375 rc = descendToCell(pRtree, pCsr, iHeight, &isEof);
125387 iHeight++;
125826 int iHeight, /* Height of sub-tree rooted at pCell */
125834 for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){
126415 int iHeight
126418 xSetMapping = ((iHeight==0)?rowidWrite:parentWrite);
126419 if( iHeight>0 ){
126434 int iHeight
126507 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
126523 if( (rc = rtreeInsertCell(pRtree, pRight->pParent, &rightbbox, iHeight+1)) ){
126529 rc = updateMapping(pRtree, iRowid, pRight, iHeight);
126540 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
126546 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
126608 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
126621 rc = deleteCell(pRtree, pParent, iCell, iHeight+1);
126649 pNode->iNode = iHeight;
126684 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
126706 rc = removeNode(pRtree, pNode, iHeight);
126719 int iHeight
126783 if( iHeight==0 ){
126799 rc = ChooseLeaf(pRtree, p, iHeight, &pInsert);
126802 rc = rtreeInsertCell(pRtree, pInsert, p, iHeight);
126816 ** subtree iHeight high (leaf nodes have iHeight==0).
126822 int iHeight
126825 if( iHeight>0 ){
126835 if( iHeight<=pRtree->iReinsertHeight || pNode->iNode==1){
126836 rc = SplitNode(pRtree, pNode, pCell, iHeight);
126838 pRtree->iReinsertHeight = iHeight;
126839 rc = Reinsert(pRtree, pNode, pCell, iHeight);
126842 rc = SplitNode(pRtree, pNode, pCell, iHeight);
126847 if( iHeight==0 ){