Lines Matching defs:depth
3368 ** <dd>The maximum depth of the parse tree on any expression.</dd>)^
3395 ** <dd>The maximum depth of recursion for triggers.</dd>)^
8112 ** The maximum depth of an expression tree. This is limited to
8254 ** Maximum depth of recursion for triggers.
11497 int iSavepoint; /* Depth of the SAVEPOINT stack */
11964 ** TK_AGG_FUNCTION: nesting depth */
12800 int mxParserStack; /* maximum depth of the parser stack */
17747 SQLITE_PRIVATE void sqlite3MemdebugBacktrace(int depth){
17748 if( depth<0 ){ depth = 0; }
17749 if( depth>20 ){ depth = 20; }
17750 depth = (depth+1)&0xfe;
17751 mem.nBacktrace = depth;
41301 ** tree with depth of iDepth. A depth of 1 means the tree contains a single
41302 ** node taken from the head of *ppList. A depth of 2 means a tree with
41343 int iDepth; /* Depth of the tree so far */
52555 ** Maximum depth of an SQLite B-Tree structure. Any B-Tree deeper than
60756 int iCellDepth; /* Depth of node containing pCell */
61636 ** the tree depth. Root pages return 0. Parents of root pages
61648 ** 7. Verify that the depth of all children is the same.
61659 int i, rc, depth, d2, pgno, cnt;
61684 depth = -1;
61696 depth = -1;
61702 depth = 0;
61750 if( i>0 && d2!=depth ){
61751 checkAppendMsg(pCheck, "Child page depth differs");
61753 depth = d2;
61896 return depth+1;
80208 ** Return the depth of a tree comprising nPMA PMAs, assuming a fanout of
80228 ** pRoot is the root of an incremental merge-tree with depth nDepth (according
80237 int nDepth, /* Depth of tree according to TreeDepth() */
81319 ** depth (the Expr.op2 field) by N on every TK_AGG_FUNCTION node.
83119 ** expression depth allowed. If it is not, leave an error message in
83127 "Expression tree is too large (maximum depth %d)", mxHeight
83196 ** the height is greater than the maximum allowed expression depth,
91073 assert( pParse->nested<10 ); /* Nesting should only be of limited depth */
123425 ** YYSTACKDEPTH is the maximum depth of the parser's stack. If
124765 ** Return the peak depth of the stack for a parser.
132720 ** This constant determines the maximum depth of an FTS expression tree
140197 ** Return SQLITE_ERROR if the maximum depth of the expression tree passed
140221 ** nMaxDepth is the maximum allowable depth of the balanced sub-tree.
140369 ** maximum allowable depth.
140452 /* Rebalance the expression. And check that its depth does not exceed
140466 "FTS expression tree is too large (maximum depth %d)",
143179 SegmentNode *pLeftmost; /* Pointer to left-most node of this depth */
151014 ** of the node contain the tree depth as a big-endian integer.
151091 int iDepth; /* Current depth of the r-tree structure */
151099 ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree
151176 ** 2^40 is greater than 2^64, an r-tree structure always has a depth of
151527 ** are the leaves, and so on. If the depth as specified on the root node
152075 ** is a depth-first search, which is the desired default behavior.
154282 /* This routine implements an SQL function that returns the "depth" parameter
154287 ** The depth value is 0 for all nodes other than the root node, and the root
