Home
last modified time | relevance | path

Searched refs:iDepth (Results 1 – 6 of 6) sorted by relevance

/sqlite-3.40.0/src/
H A Drowset.c342 int iDepth in rowSetNDeepTree() argument
350 if( iDepth>1 ){ /*OPTIMIZATION-IF-TRUE*/ in rowSetNDeepTree()
354 pLeft = rowSetNDeepTree(ppList, iDepth-1); in rowSetNDeepTree()
363 p->pRight = rowSetNDeepTree(ppList, iDepth-1); in rowSetNDeepTree()
377 int iDepth; /* Depth of the tree so far */ in rowSetListToTree() local
385 for(iDepth=1; pList; iDepth++){ in rowSetListToTree()
390 p->pRight = rowSetNDeepTree(&pList, iDepth); in rowSetListToTree()
H A Djson.c135 u16 iDepth; /* Nesting depth */ member
779 if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1; in jsonParseValue()
782 pParse->iDepth--; in jsonParseValue()
795 pParse->iDepth--; in jsonParseValue()
813 if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1; in jsonParseValue()
815 pParse->iDepth--; in jsonParseValue()
938 assert( pParse->iDepth==0 ); in jsonParse()
/sqlite-3.40.0/ext/rtree/
H A Drtree_util.tcl35 set iDepth [rtree_depth $db $zTab]
41 incr iDepth -1
44 return $iDepth
108 proc rtree_node_check {db zTab iNode iDepth} { argument
127 if {$iDepth > 0} {
176 proc rtree_nodetreedump {db zTab zIndent iDepth iNode} {
H A Drtree.c768 pRtree->iDepth = readInt16(pNode->zData); in nodeAcquire()
769 if( pRtree->iDepth>RTREE_MAX_DEPTH ){ in nodeAcquire()
901 pRtree->iDepth = -1; in nodeRelease()
1908 p->pInfo->mxLevel = pRtree->iDepth + 1; in rtreeFilter()
2619 pRtree->iDepth++; in SplitNode()
2621 writeInt16(pNode->zData, pRtree->iDepth); in SplitNode()
3112 pRtree->iDepth--; in rtreeDeleteRowid()
3113 writeInt16(pRoot->zData, pRtree->iDepth); in rtreeDeleteRowid()
4199 iDepth = readInt16(aNode); in rtreeCheckNode()
4200 if( iDepth>RTREE_MAX_DEPTH ){ in rtreeCheckNode()
[all …]
H A Dgeopoly.c1398 memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1)); in geopolyFilter()
1438 pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, (u8)(pRtree->iDepth+1)); in geopolyFilter()
/sqlite-3.40.0/ext/misc/
H A Dscrub.c374 static void scrubBackupBtree(ScrubState *p, int pgno, int iDepth){ in scrubBackupBtree() argument
388 if( iDepth>50 ){ in scrubBackupBtree()
439 scrubBackupBtree(p, iChild, iDepth+1); in scrubBackupBtree()
468 scrubBackupBtree(p, iChild, iDepth+1); in scrubBackupBtree()