Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
M
mariadb
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
mariadb
Commits
f0ae92f4
Commit
f0ae92f4
authored
Jun 04, 2009
by
Bernt M. Johnsen
Browse files
Options
Browse Files
Download
Plain Diff
Bug#15866 Split of main.sp and main.sp-fib. Merged from 5.0 gca
parents
932c7a31
5068840b
Changes
4
Show whitespace changes
Inline
Side-by-side
Showing
4 changed files
with
106 additions
and
101 deletions
+106
-101
mysql-test/r/sp-fib.result
mysql-test/r/sp-fib.result
+46
-0
mysql-test/r/sp.result
mysql-test/r/sp.result
+0
-46
mysql-test/t/sp-fib.test
mysql-test/t/sp-fib.test
+60
-0
mysql-test/t/sp.test
mysql-test/t/sp.test
+0
-55
No files found.
mysql-test/r/sp-fib.result
0 → 100644
View file @
f0ae92f4
drop table if exists t3;
create table t3 ( f bigint unsigned not null );
drop procedure if exists fib;
create procedure fib(n int unsigned)
begin
if n > 1 then
begin
declare x, y bigint unsigned;
declare c cursor for select f from t3 order by f desc limit 2;
open c;
fetch c into y;
fetch c into x;
close c;
insert into t3 values (x+y);
call fib(n-1);
end;
end if;
end|
set @@max_sp_recursion_depth= 20|
insert into t3 values (0), (1)|
call fib(3)|
select * from t3 order by f asc|
f
0
1
1
2
delete from t3|
insert into t3 values (0), (1)|
call fib(10)|
select * from t3 order by f asc|
f
0
1
1
2
3
5
8
13
21
34
55
drop table t3|
drop procedure fib|
set @@max_sp_recursion_depth= 0|
mysql-test/r/sp.result
View file @
f0ae92f4
...
...
@@ -1337,52 +1337,6 @@ drop procedure opp|
drop procedure ip|
show procedure status like '%p%'|
Db Name Type Definer Modified Created Security_type Comment
drop table if exists t3|
create table t3 ( f bigint unsigned not null )|
drop procedure if exists fib|
create procedure fib(n int unsigned)
begin
if n > 1 then
begin
declare x, y bigint unsigned;
declare c cursor for select f from t3 order by f desc limit 2;
open c;
fetch c into y;
fetch c into x;
close c;
insert into t3 values (x+y);
call fib(n-1);
end;
end if;
end|
set @@max_sp_recursion_depth= 20|
insert into t3 values (0), (1)|
call fib(3)|
select * from t3 order by f asc|
f
0
1
1
2
delete from t3|
insert into t3 values (0), (1)|
call fib(10)|
select * from t3 order by f asc|
f
0
1
1
2
3
5
8
13
21
34
55
drop table t3|
drop procedure fib|
set @@max_sp_recursion_depth= 0|
drop procedure if exists bar|
create procedure bar(x char(16), y int)
comment "111111111111" sql security invoker
...
...
mysql-test/t/sp-fib.test
0 → 100644
View file @
f0ae92f4
# Fibonacci, for recursion test. (Yet Another Numerical series :)
# Split from main.sp due to problems reported in Bug#15866
--
disable_warnings
drop
table
if
exists
t3
;
--
enable_warnings
create
table
t3
(
f
bigint
unsigned
not
null
);
# We deliberately do it the awkward way, fetching the last two
# values from the table, in order to exercise various statements
# and table accesses at each turn.
--
disable_warnings
drop
procedure
if
exists
fib
;
--
enable_warnings
# Now for multiple statements...
delimiter
|
;
create
procedure
fib
(
n
int
unsigned
)
begin
if
n
>
1
then
begin
declare
x
,
y
bigint
unsigned
;
declare
c
cursor
for
select
f
from
t3
order
by
f
desc
limit
2
;
open
c
;
fetch
c
into
y
;
fetch
c
into
x
;
close
c
;
insert
into
t3
values
(
x
+
y
);
call
fib
(
n
-
1
);
end
;
end
if
;
end
|
# Enable recursion
set
@@
max_sp_recursion_depth
=
20
|
# Minimum test: recursion of 3 levels
insert
into
t3
values
(
0
),
(
1
)
|
call
fib
(
3
)
|
select
*
from
t3
order
by
f
asc
|
delete
from
t3
|
# The original test, 20 levels, ran into memory limits on some machines
# and builds. Try 10 instead...
insert
into
t3
values
(
0
),
(
1
)
|
call
fib
(
10
)
|
select
*
from
t3
order
by
f
asc
|
drop
table
t3
|
drop
procedure
fib
|
set
@@
max_sp_recursion_depth
=
0
|
mysql-test/t/sp.test
View file @
f0ae92f4
...
...
@@ -1560,61 +1560,6 @@ drop procedure ip|
show
procedure
status
like
'%p%'
|
# Fibonacci, for recursion test. (Yet Another Numerical series :)
#
--
disable_warnings
drop
table
if
exists
t3
|
--
enable_warnings
create
table
t3
(
f
bigint
unsigned
not
null
)
|
# We deliberately do it the awkward way, fetching the last two
# values from the table, in order to exercise various statements
# and table accesses at each turn.
--
disable_warnings
drop
procedure
if
exists
fib
|
--
enable_warnings
create
procedure
fib
(
n
int
unsigned
)
begin
if
n
>
1
then
begin
declare
x
,
y
bigint
unsigned
;
declare
c
cursor
for
select
f
from
t3
order
by
f
desc
limit
2
;
open
c
;
fetch
c
into
y
;
fetch
c
into
x
;
close
c
;
insert
into
t3
values
(
x
+
y
);
call
fib
(
n
-
1
);
end
;
end
if
;
end
|
# Enable recursion
set
@@
max_sp_recursion_depth
=
20
|
# Minimum test: recursion of 3 levels
insert
into
t3
values
(
0
),
(
1
)
|
call
fib
(
3
)
|
select
*
from
t3
order
by
f
asc
|
delete
from
t3
|
# The original test, 20 levels, ran into memory limits on some machines
# and builds. Try 10 instead...
insert
into
t3
values
(
0
),
(
1
)
|
call
fib
(
10
)
|
select
*
from
t3
order
by
f
asc
|
drop
table
t3
|
drop
procedure
fib
|
set
@@
max_sp_recursion_depth
=
0
|
#
# Comment & suid
#
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment