Lines Matching defs:depth
142 ** The maximum depth of an expression tree. This is limited to
282 ** Maximum depth of recursion for triggers.
3384 ** <dd>The maximum depth of the parse tree on any expression.</dd>)^
3411 ** <dd>The maximum depth of recursion for triggers.</dd>)^
10140 int iSavepoint; /* Depth of the SAVEPOINT stack */
10918 int nDepth; /* Depth of subquery recursion. 1 for no recursion */
11355 int mxParserStack; /* maximum depth of the parser stack */
15896 SQLITE_PRIVATE void sqlite3MemdebugBacktrace(int depth){
15897 if( depth<0 ){ depth = 0; }
15898 if( depth>20 ){ depth = 20; }
15899 depth = (depth+1)&0xfe;
15900 mem.nBacktrace = depth;
38160 ** tree with depth of iDepth. A depth of 1 means the tree contains a single
38161 ** node taken from the head of *ppList. A depth of 2 means a tree with
38202 int iDepth; /* Depth of the tree so far */
48905 ** Maximum depth of an SQLite B-Tree structure. Any B-Tree deeper than
56271 int iCellDepth; /* Depth of node containing pCell */
57046 ** the tree depth. Root pages return 0. Parents of root pages
57058 ** 7. Verify that the depth of all children is the same.
57070 int i, rc, depth, d2, pgno, cnt;
57108 depth = 0;
57156 if( i>0 && d2!=depth ){
57157 checkAppendMsg(pCheck, zContext, "Child page depth differs");
57159 depth = d2;
57268 return depth+1;
74655 ** expression depth allowed. If it is not, leave an error message in
74663 "Expression tree is too large (maximum depth %d)", mxHeight
74728 ** the height is greater than the maximum allowed expression depth,
81434 assert( pParse->nested<10 ); /* Nesting should only be of limited depth */
107969 ** YYSTACKDEPTH is the maximum depth of the parser's stack. If
109317 ** Return the peak depth of the stack for a parser.
125249 SegmentNode *pLeftmost; /* Pointer to left-most node of this depth */
130157 ** of the node contain the tree depth as a big-endian integer.
130262 int iDepth; /* Current depth of the r-tree structure */
130270 ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree
130315 ** 2^40 is greater than 2^64, an r-tree structure always has a depth of
130627 ** are the leaves, and so on. If the depth as specified on the root node
