Searched refs:iNode (Results 1 – 6 of 6) sorted by relevance
34 proc rtree_nodedepth {db zTab iNode} { argument37 set ii $iNode55 proc rtree_node {db zTab iNode {iPrec 6}} {108 proc rtree_node_check {db zTab iNode iDepth} {109 if {[info exists ::checked($iNode)]} { error "Second ref to $iNode" }110 set ::checked($iNode) 1112 set node [rtree_node $db $zTab $iNode]116 puts "Node $iNode: Has only [llength $node] cells"147 if {$mapping != $iNode} {153 set ret [list $iNode][all …]
19 set ::O(iNode) [db one $sql]20 if {$::O(iNode) eq ""} {set ::O(iNode) 1}24 set O(iNode) 158 set ::O(iNode) 169 set ::O(iNode) [lindex $::O(listbox_captions) $sel 1]85 .status configure -text [cell_report db $::O(zTab) $::O(iNode) $i]118 set iNode $::O(iNode)121 set data [rtree_node db $zTab $iNode 12]122 set depth [rtree_nodedepth db $zTab $iNode]130 if {$iNode == 1} {.b configure -state disabled}[all …]
633 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext); in nodeHashLookup()653 if( pNode->iNode!=0 ){ in nodeHashDelete()753 pNode->iNode = iNode; in nodeAcquire()870 if( pNode->iNode ){ in nodeWrite()1855 i64 iNode = 0; in rtreeFilter() local1869 p->id = iNode; in rtreeFilter()2616 if( pNode->iNode==1 ){ in SplitNode()2656 if( pNode->iNode==1 ){ in SplitNode()2688 if( pNode->iNode==1 ){ in SplitNode()2744 for(pTest=pLeaf; pTest && pTest->iNode!=iNode; pTest=pTest->pParent); in fixLeafParent()[all …]
64 # Return a blob containing node iNode of r-tree "rt".66 proc rt_node_get {iNode} {67 db one { SELECT data FROM rt_node WHERE nodeno=$iNode }
1364 i64 iNode = 0; in geopolyFilter() local1365 rc = findLeafNode(pRtree, iRowid, &pLeaf, &iNode); in geopolyFilter()1370 p->id = iNode; in geopolyFilter()
596 int iNode = pCsr->iNode; in lsmTreeCursorSave() local1031 pCsr->iNode--; in treeInsertLeaf()1379 if( (pCsr->iNode>0 && (u32)pCsr->iNode==(p->nHeight-1)) ){ in treeOverwriteKey()1398 int iNode = pCsr->iNode; in treeNextIsEndDelete() local1412 iNode--; in treeNextIsEndDelete()1420 int iNode = pCsr->iNode; in treePrevIsStartDelete() local1434 iNode--; in treePrevIsStartDelete()1856 int iNode = csr.iNode; in lsmTreeDelete() local1869 assert( res==0 && csr.iNode==iNode ); in lsmTreeDelete()2002 iNode++; in lsmTreeCursorSeek()[all …]