File: stack.result

package info (click to toggle)
mariadb 1%3A11.8.2-1
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 765,428 kB
  • sloc: ansic: 2,382,827; cpp: 1,803,532; asm: 378,315; perl: 63,176; sh: 46,496; pascal: 40,776; java: 39,363; yacc: 20,428; python: 19,506; sql: 17,864; xml: 12,463; ruby: 8,544; makefile: 6,059; cs: 5,855; ada: 1,700; lex: 1,193; javascript: 1,039; objc: 80; tcl: 73; awk: 46; php: 22
file content (47 lines) | stat: -rw-r--r-- 1,132 bytes parent folder | download | duplicates (6)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
# Checking stack usage
#
# basic tests
#
select variable_value > 0 from information_schema.session_status where variable_name="stack_usage";
variable_value > 0
1
#
# Ensure stack usage is same for each iteration when using WITH recursive
#
create table t1
WITH recursive Fibonacci(PrevN, N, Stack) AS
(
SELECT 0, 1, 0
UNION ALL
SELECT N, PrevN + N, (select variable_value from information_schema.session_status where variable_name="stack_usage")
FROM Fibonacci
WHERE N < 100000
)
SELECT PrevN as N, Stack FROM Fibonacci;
select (select stack from t1 where n=2) = (select stack from t1 where N=75025) as c;
c
1
DROP table t1;
#
# Check stack with recursion
#
set @@max_sp_recursion_depth=20;
create or replace procedure recursion(x int, max int, OUT res int)
begin
select variable_value into res from information_schema.session_status where variable_name="stack_usage";
if (x < max) then
call recursion(x+1, max, res);
end if;
end;
$$
call recursion(0,2,@s1);
call recursion(0,3,@s2);
call recursion(0,4,@s3);
$$
select @s1 > 0 && @s2 > 0 && @s3 > 0;
@s1 > 0 && @s2 > 0 && @s3 > 0
1
drop procedure recursion;
#
# End of 10.5 tests
#