Lines Matching refs:high
2375 ** value of [sqlite3_memory_used()] since the high-water mark
2382 ** ^The memory high-water mark is reset to the current value of
2385 ** by [sqlite3_memory_highwater(1)] is the high-water mark
2394 ** SQLite contains a high-quality pseudo-random number generator (PRNG) used to
8024 ** is set high so that we don't have to allocate an unused page except
10920 int *pHighwater, /* Write high-water mark here */
10921 int resetFlag /* Reset high-water mark if true */
20059 ** high-performance timing routines.
20075 ** This file contains inline asm code for retrieving "high-performance"
20084 ** processor and returns that value. This can be used for high-res
21584 ** high-performance timing routines.
21600 ** This file contains inline asm code for retrieving "high-performance"
21609 ** processor and returns that value. This can be used for high-res
27216 ** high-performance timing routines.
27232 ** This file contains inline asm code for retrieving "high-performance"
27241 ** processor and returns that value. This can be used for high-res
29260 ** the bitmap becomes dense with high cardinality. The algorithm needs
32880 ** detect this invalid data (with high
38425 int bias, /* Bias search to the high end */
39832 ** there is a high probability of damage) Level 2 is the default. There
42043 int biasRight, /* If true, bias the search to the high end */
45550 ** purposes (for example, to store a high-level schema associated with
50250 ** impact, since this routine is a very high runner. And so, we choose
52375 ** high-performance timing routines.
52391 ** This file contains inline asm code for retrieving "high-performance"
52400 ** processor and returns that value. This can be used for high-res
59666 ** then set the high-order bit of the bitmask.
94613 ** For ASCII, any character with the high-order bit set is
98363 ** At query time, high MERGE_COUNT increases the number of segments
99009 q[-1] &= 0x7f; /* turn off high bit in final byte */
99557 ** one level high (i.e. the root node is not also a leaf). If successful,
109756 ** subtree iHeight high (leaf nodes have iHeight==0).
