Lines Matching defs:depth
142 ** The maximum depth of an expression tree. This is limited to
282 ** Maximum depth of recursion for triggers.
3289 ** <dd>The maximum depth of the parse tree on any expression.</dd>)^
3316 ** <dd>The maximum depth of recursion for triggers.</dd>)^
11098 int mxParserStack; /* maximum depth of the parser stack */
15408 SQLITE_PRIVATE void sqlite3MemdebugBacktrace(int depth){
15409 if( depth<0 ){ depth = 0; }
15410 if( depth>20 ){ depth = 20; }
15411 depth = (depth+1)&0xfe;
15412 mem.nBacktrace = depth;
37284 ** tree with depth of iDepth. A depth of 1 means the tree contains a single
37285 ** node taken from the head of *ppList. A depth of 2 means a tree with
47802 ** Maximum depth of an SQLite B-Tree structure. Any B-Tree deeper than
55859 ** the tree depth. Root pages return 0. Parents of root pages
55871 ** 7. Verify that the depth of all children is the same.
55883 int i, rc, depth, d2, pgno, cnt;
55921 depth = 0;
55969 if( i>0 && d2!=depth ){
55970 checkAppendMsg(pCheck, zContext, "Child page depth differs");
55972 depth = d2;
56081 return depth+1;
73284 ** expression depth allowed. If it is not, leave an error message in
73292 "Expression tree is too large (maximum depth %d)", mxHeight
73357 ** the height is greater than the maximum allowed expression depth,
79374 assert( pParse->nested<10 ); /* Nesting should only be of limited depth */
105710 ** YYSTACKDEPTH is the maximum depth of the parser's stack. If
107050 ** Return the peak depth of the stack for a parser.
122450 SegmentNode *pLeftmost; /* Pointer to left-most node of this depth */
127073 ** of the node contain the tree depth as a big-endian integer.
127178 int iDepth; /* Current depth of the r-tree structure */
127186 ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree
127231 ** 2^40 is greater than 2^64, an r-tree structure always has a depth of
127543 ** are the leaves, and so on. If the depth as specified on the root node