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
fba0ead6
Commit
fba0ead6
authored
Mar 03, 2012
by
Igor Babaev
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Supported extended keys (MWL #247) for innodb_plugin.
parent
dac5c75c
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
58 additions
and
12 deletions
+58
-12
mysql-test/t/innodb_ext_key.test
mysql-test/t/innodb_ext_key.test
+1
-1
storage/innobase/handler/ha_innodb.cc
storage/innobase/handler/ha_innodb.cc
+57
-11
No files found.
mysql-test/t/innodb_ext_key.test
View file @
fba0ead6
--
source
include
/
have_
xtra
db
.
inc
--
source
include
/
have_
inno
db
.
inc
--
disable_warnings
--
disable_warnings
DROP
TABLE
IF
EXISTS
t1
,
t2
,
t3
,
t4
;
DROP
TABLE
IF
EXISTS
t1
,
t2
,
t3
,
t4
;
...
...
storage/innobase/handler/ha_innodb.cc
View file @
fba0ead6
...
@@ -7550,6 +7550,7 @@ ha_innobase::records_in_range(
...
@@ -7550,6 +7550,7 @@ ha_innobase::records_in_range(
ib_int64_t
n_rows
;
ib_int64_t
n_rows
;
ulint
mode1
;
ulint
mode1
;
ulint
mode2
;
ulint
mode2
;
uint
key_parts
;
mem_heap_t
*
heap
;
mem_heap_t
*
heap
;
DBUG_ENTER
(
"records_in_range"
);
DBUG_ENTER
(
"records_in_range"
);
...
@@ -7585,14 +7586,19 @@ ha_innobase::records_in_range(
...
@@ -7585,14 +7586,19 @@ ha_innobase::records_in_range(
goto
func_exit
;
goto
func_exit
;
}
}
heap
=
mem_heap_create
(
2
*
(
key
->
key_parts
*
sizeof
(
dfield_t
)
key_parts
=
key
->
key_parts
;
+
sizeof
(
dtuple_t
)));
if
((
min_key
&&
min_key
->
keypart_map
>=
(
key_part_map
)
(
1
<<
key_parts
))
||
(
max_key
&&
max_key
->
keypart_map
>=
(
key_part_map
)
(
1
<<
key_parts
)))
key_parts
=
key
->
ext_key_parts
;
range_start
=
dtuple_create
(
heap
,
key
->
key_parts
);
heap
=
mem_heap_create
(
2
*
(
key_parts
*
sizeof
(
dfield_t
)
dict_index_copy_types
(
range_start
,
index
,
key
->
key_parts
);
+
sizeof
(
dtuple_t
))
);
range_end
=
dtuple_create
(
heap
,
key
->
key_parts
);
range_start
=
dtuple_create
(
heap
,
key_parts
);
dict_index_copy_types
(
range_end
,
index
,
key
->
key_parts
);
dict_index_copy_types
(
range_start
,
index
,
key_parts
);
range_end
=
dtuple_create
(
heap
,
key_parts
);
dict_index_copy_types
(
range_end
,
index
,
key_parts
);
row_sel_convert_mysql_key_to_innobase
(
row_sel_convert_mysql_key_to_innobase
(
range_start
,
range_start
,
...
@@ -7743,11 +7749,6 @@ ha_innobase::read_time(
...
@@ -7743,11 +7749,6 @@ ha_innobase::read_time(
return
(
handler
::
read_time
(
index
,
ranges
,
rows
));
return
(
handler
::
read_time
(
index
,
ranges
,
rows
));
}
}
if
(
rows
<=
2
)
{
return
((
double
)
rows
);
}
/* Assume that the read time is proportional to the scan time for all
/* Assume that the read time is proportional to the scan time for all
rows + at most one seek per range. */
rows + at most one seek per range. */
...
@@ -8104,6 +8105,7 @@ ha_innobase::info_low(
...
@@ -8104,6 +8105,7 @@ ha_innobase::info_low(
for
(
i
=
0
;
i
<
table
->
s
->
keys
;
i
++
)
{
for
(
i
=
0
;
i
<
table
->
s
->
keys
;
i
++
)
{
ulong
j
;
ulong
j
;
rec_per_key
=
1
;
/* We could get index quickly through internal
/* We could get index quickly through internal
index mapping with the index translation table.
index mapping with the index translation table.
The identity of index (match up index name with
The identity of index (match up index name with
...
@@ -8157,6 +8159,50 @@ ha_innobase::info_low(
...
@@ -8157,6 +8159,50 @@ ha_innobase::info_low(
rec_per_key
>=
~
(
ulong
)
0
?
~
(
ulong
)
0
:
rec_per_key
>=
~
(
ulong
)
0
?
~
(
ulong
)
0
:
(
ulong
)
rec_per_key
;
(
ulong
)
rec_per_key
;
}
}
KEY
*
key_info
=
table
->
key_info
+
i
;
key_part_map
ext_key_part_map
=
key_info
->
ext_key_part_map
;
if
(
key_info
->
key_parts
!=
key_info
->
ext_key_parts
)
{
KEY
*
pk_key_info
=
key_info
+
table
->
s
->
primary_key
;
uint
k
=
key_info
->
key_parts
;
ha_rows
k_rec_per_key
=
rec_per_key
;
uint
pk_parts
=
pk_key_info
->
key_parts
;
index
=
innobase_get_index
(
table
->
s
->
primary_key
);
n_rows
=
ib_table
->
stat_n_rows
;
for
(
j
=
0
;
j
<
pk_parts
;
j
++
)
{
if
(
ext_key_part_map
&
1
<<
j
)
{
rec_per_key
=
innodb_rec_per_key
(
index
,
j
,
stats
.
records
);
if
(
rec_per_key
==
0
)
{
rec_per_key
=
1
;
}
else
if
(
rec_per_key
>
1
)
{
rec_per_key
=
k_rec_per_key
*
(
double
)
rec_per_key
/
n_rows
;
}
key_info
->
rec_per_key
[
k
++
]
=
rec_per_key
>=
~
(
ulong
)
0
?
~
(
ulong
)
0
:
(
ulong
)
rec_per_key
;
}
}
}
}
}
dict_table_stats_unlock
(
ib_table
,
RW_S_LATCH
);
dict_table_stats_unlock
(
ib_table
,
RW_S_LATCH
);
...
...
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