mirror of
https://github.com/MariaDB/server.git
synced 2025-01-16 12:02:42 +01:00
Merge MariaDB 5.3 into latest MariaDB 5.5
This commit is contained in:
commit
99aa3d465e
42 changed files with 893 additions and 382 deletions
|
@ -446,6 +446,10 @@ extern "C" int madvise(void *addr, size_t len, int behav);
|
|||
#define SIGNAL_HANDLER_RESET_ON_DELIVERY
|
||||
#endif
|
||||
|
||||
#ifndef STDERR_FILENO
|
||||
#define STDERR_FILENO 2
|
||||
#endif
|
||||
|
||||
/*
|
||||
Deprecated workaround for false-positive uninitialized variables
|
||||
warnings. Those should be silenced using tool-specific heuristics.
|
||||
|
|
|
@ -82,50 +82,6 @@ const char *my_addr_resolve_init();
|
|||
void my_write_core(int sig);
|
||||
#endif
|
||||
|
||||
|
||||
|
||||
/**
|
||||
Async-signal-safe utility functions used by signal handler routines.
|
||||
Declared here in order to unit-test them.
|
||||
These are not general-purpose, but tailored to the signal handling routines.
|
||||
*/
|
||||
/**
|
||||
Converts a longlong value to string.
|
||||
@param base 10 for decimal, 16 for hex values (0..9a..f)
|
||||
@param val The value to convert
|
||||
@param buf Assumed to point to the *end* of the buffer.
|
||||
@returns Pointer to the first character of the converted string.
|
||||
Negative values:
|
||||
for base-10 the return string will be prepended with '-'
|
||||
for base-16 the return string will contain 16 characters
|
||||
Implemented with simplicity, and async-signal-safety in mind.
|
||||
*/
|
||||
char *my_safe_itoa(int base, longlong val, char *buf);
|
||||
|
||||
/**
|
||||
Converts a ulonglong value to string.
|
||||
@param base 10 for decimal, 16 for hex values (0..9a..f)
|
||||
@param val The value to convert
|
||||
@param buf Assumed to point to the *end* of the buffer.
|
||||
@returns Pointer to the first character of the converted string.
|
||||
Implemented with simplicity, and async-signal-safety in mind.
|
||||
*/
|
||||
char *my_safe_utoa(int base, ulonglong val, char *buf);
|
||||
|
||||
/**
|
||||
A (very) limited version of snprintf.
|
||||
@param to Destination buffer.
|
||||
@param n Size of destination buffer.
|
||||
@param fmt printf() style format string.
|
||||
@returns Number of bytes written, including terminating '\0'
|
||||
Supports 'd' 'i' 'u' 'x' 'p' 's' conversion.
|
||||
Supports 'l' and 'll' modifiers for integral types.
|
||||
Does not support any width/precision.
|
||||
Implemented with simplicity, and async-signal-safety in mind.
|
||||
*/
|
||||
size_t my_safe_snprintf(char* to, size_t n, const char* fmt, ...)
|
||||
ATTRIBUTE_FORMAT(printf, 3, 4);
|
||||
|
||||
/**
|
||||
A (very) limited version of snprintf, which writes the result to STDERR.
|
||||
@sa my_safe_snprintf
|
||||
|
|
|
@ -4,7 +4,7 @@ SET @old_debug= @@session.debug;
|
|||
#
|
||||
CREATE TABLE t1(f0 int auto_increment primary key, f1 int);
|
||||
INSERT INTO t1(f1) VALUES (0),(1),(2),(3),(4),(5);
|
||||
SET session debug_dbug= '+d,make_char_array_fail';
|
||||
SET session debug_dbug= '+d,make_sort_keys_alloc_fail';
|
||||
CALL mtr.add_suppression("Out of sort memory");
|
||||
SELECT * FROM t1 ORDER BY f1 ASC, f0;
|
||||
ERROR HY001: Out of sort memory, consider increasing server sort buffer size
|
||||
|
|
|
@ -1402,4 +1402,74 @@ select t2.i from t1 left join t2 on t2.i = t1.i where t1.i = '1:1:1';
|
|||
i
|
||||
01:01:01
|
||||
drop table t1,t2;
|
||||
#
|
||||
# BUG#954900: unexpected empty set due to an invalid build of key ref
|
||||
#
|
||||
CREATE TABLE t1 (dog_id int(10), birthday date, PRIMARY KEY (dog_id,birthday));
|
||||
INSERT INTO t1 VALUES (5918,'2004-07-22');
|
||||
CREATE TABLE t2 (dog_id int(10) unsigned, t_id char(1), birthday date, a_id int(10),
|
||||
PRIMARY KEY (dog_id,t_id,birthday,a_id));
|
||||
INSERT INTO t2 VALUES
|
||||
(5918,'N','2004-07-22',5216551), (5918,'N','2004-07-22',5223640),
|
||||
(5918,'N','2004-07-22',5389491), (5918,'N','2004-07-22',5749434),
|
||||
(5918,'N','2004-07-22',5992424), (5922,'N','2005-06-30',5076957),
|
||||
(5924,'N','2000-08-11',20264), (5924,'N','2000-08-11',64251),
|
||||
(5924,'N','2000-08-11',74748), (5924,'N','2000-08-11',87590),
|
||||
(5924,'N','2000-08-11',104695), (5924,'N','2000-08-11',133136),
|
||||
(5924,'N','2000-08-11',5027806), (5924,'N','2000-08-11',5076957),
|
||||
(5924,'N','2000-08-11',5166821), (5924,'N','2000-08-11',5181896),
|
||||
(5924,'N','2000-08-11',5217908), (5924,'N','2000-08-11',5220812),
|
||||
(5924,'N','2000-08-11',5226473), (5924,'N','2000-08-11',5339111),
|
||||
(5925,'N','2005-02-10',19227), (5925,'N','2005-02-10',74529),
|
||||
(5925,'N','2005-02-10',74748), (5927,'N','2005-08-18',20264),
|
||||
(5927,'N','2005-08-18',58364), (5929,'N','2005-01-19',58364),
|
||||
(5935,'N','2006-03-10',19227), (5935,'N','2006-03-10',64251),
|
||||
(5935,'N','2006-03-10',5222400), (5935,'N','2006-03-10',5226473),
|
||||
(5936,'N','2004-10-29',5015032), (5937,'N','2002-04-05',11237),
|
||||
(5937,'N','2002-04-05',23911), (5937,'N','2002-04-05',112133),
|
||||
(5937,'N','2002-04-05',169721), (5937,'N','2002-04-05',170650),
|
||||
(5937,'N','2002-04-05',5014494), (5937,'N','2002-04-05',5166009),
|
||||
(5937,'N','2002-04-05',5181871), (5937,'N','2002-04-05',5213380),
|
||||
(5937,'N','2002-04-05',5214875), (5937,'N','2002-04-05',5895062),
|
||||
(5938,'N','2006-03-24',11237), (5938,'N','2006-03-24',19227),
|
||||
(5938,'N','2006-03-24',23911), (5938,'N','2006-03-24',58364),
|
||||
(5938,'N','2006-03-24',64251), (5938,'N','2006-03-24',111716),
|
||||
(5938,'N','2006-03-24',112702), (5938,'N','2006-03-24',133136),
|
||||
(5938,'N','2006-03-24',168718), (5938,'N','2006-03-24',5137136),
|
||||
(5938,'N','2006-03-24',5161519), (5938,'N','2006-03-24',5168120),
|
||||
(5938,'N','2006-03-24',5219034), (6234,'N','2006-06-02',103058),
|
||||
(6234,'N','2006-06-02',5146844), (6235,'N','2006-06-01',12900),
|
||||
(6235,'N','2006-06-01',20264), (6235,'N','2006-06-01',64251),
|
||||
(6235,'N','2006-06-01',75160), (6235,'N','2006-06-01',5014494),
|
||||
(6235,'N','2006-06-01',5181638), (6236,'N','2006-06-06',112595),
|
||||
(6236,'N','2006-06-06',5219601), (6236,'N','2006-06-06',5808374);
|
||||
CREATE TABLE t3 (dog_id int(10) unsigned);
|
||||
INSERT INTO t3 VALUES (5918);
|
||||
CREATE TABLE t4 (dog_id int(10), t_id char(1), birthday date, KEY (t_id));
|
||||
INSERT INTO t4 VALUES (5918,'N','2004-07-22'), (5919,'N','2004-07-20');
|
||||
CREATE TABLE t5 (dog_id int(10) unsigned, UNIQUE KEY (dog_id));
|
||||
INSERT INTO t5 VALUES (5918);
|
||||
SET @tmp_optimizer_switch=@@optimizer_switch;
|
||||
SET optimizer_switch='index_condition_pushdown=off';
|
||||
EXPLAIN
|
||||
SELECT * FROM t5 DU, t1 D, t4 DT, t2 DSA, t3 DSAR
|
||||
WHERE DU.dog_id=D.dog_id AND D.dog_id=DT.dog_id AND D.birthday=DT.birthday AND
|
||||
DT.t_id=DSA.t_id AND DT.birthday=DSA.birthday AND DSA.dog_id=DSAR.dog_id;
|
||||
id select_type table type possible_keys key key_len ref rows Extra
|
||||
1 SIMPLE DU system dog_id NULL NULL NULL 1
|
||||
1 SIMPLE D system PRIMARY NULL NULL NULL 1
|
||||
1 SIMPLE DSAR system NULL NULL NULL NULL 1
|
||||
1 SIMPLE DT range t_id t_id 2 NULL 2 Using where
|
||||
1 SIMPLE DSA ref PRIMARY PRIMARY 8 const,test.DT.t_id,test.D.birthday 1 Using index
|
||||
SELECT * FROM t5 DU, t1 D, t4 DT, t2 DSA, t3 DSAR
|
||||
WHERE DU.dog_id=D.dog_id AND D.dog_id=DT.dog_id AND D.birthday=DT.birthday AND
|
||||
DT.t_id=DSA.t_id AND DT.birthday=DSA.birthday AND DSA.dog_id=DSAR.dog_id;
|
||||
dog_id dog_id birthday dog_id t_id birthday dog_id t_id birthday a_id dog_id
|
||||
5918 5918 2004-07-22 5918 N 2004-07-22 5918 N 2004-07-22 5216551 5918
|
||||
5918 5918 2004-07-22 5918 N 2004-07-22 5918 N 2004-07-22 5223640 5918
|
||||
5918 5918 2004-07-22 5918 N 2004-07-22 5918 N 2004-07-22 5389491 5918
|
||||
5918 5918 2004-07-22 5918 N 2004-07-22 5918 N 2004-07-22 5749434 5918
|
||||
5918 5918 2004-07-22 5918 N 2004-07-22 5918 N 2004-07-22 5992424 5918
|
||||
SET optimizer_switch=@tmp_optimizer_switch;
|
||||
DROP TABLE t1,t2,t3,t4,t5;
|
||||
SET optimizer_switch=@save_optimizer_switch;
|
||||
|
|
|
@ -1045,6 +1045,182 @@ ID Name Country Population
|
|||
4030 Sandy USA 101853
|
||||
4031 Athens-Clarke County USA 101489
|
||||
4032 Cambridge USA 101355
|
||||
set @save_optimizer_switch=@@optimizer_switch;
|
||||
CREATE INDEX CityName on City(Name);
|
||||
EXPLAIN SELECT Name, Country, Population FROM City WHERE
|
||||
(Name='Manila' AND Country='PHL') OR
|
||||
(Name='Addis Abeba' AND Country='ETH') OR
|
||||
(Name='Jakarta' AND Country='IDN') OR
|
||||
(Name='Bangalore' AND Country='IND') OR
|
||||
(Name='Teheran' AND Country='IRN') OR
|
||||
(Name='Roma' AND Country='ITA') OR
|
||||
(Name='Delhi' AND Country='IND') OR
|
||||
(Name='Venezia' AND Country='ITA') OR
|
||||
(Name='Tokyo' AND Country='JPN') OR
|
||||
(Name='Toronto' AND Country='CAN') OR
|
||||
(Name='Peking' AND Country='CHN') OR
|
||||
(Name='Lagos' AND Country='NGA') OR
|
||||
(Name='Tijuana' AND Country='MEX') OR
|
||||
(Name='Rabat' AND Country='MAR') OR
|
||||
(Name='Seoul' AND Country='KOR') OR
|
||||
(Name='Vancouver' AND Country='CAN') OR
|
||||
(Name='Kaunas' AND Country='LTU') OR
|
||||
(Name='Paris' AND Country='FRA') OR
|
||||
(Name='Dakar' AND Country='SEN') OR
|
||||
(Name='Basel' AND Country='CHE') OR
|
||||
(Name='Praha' AND Country='CZE') OR
|
||||
(Name='Ankara' AND Country='TUR') OR
|
||||
(Name='Dresden' AND Country='DEU') OR
|
||||
(Name='Lugansk' AND Country='UKR') OR
|
||||
(Name='Caracas' AND Country='VEN') OR
|
||||
(Name='Samara' AND Country='RUS') OR
|
||||
(Name='Seattle' AND Country='USA');
|
||||
id select_type table type possible_keys key key_len ref rows Extra
|
||||
1 SIMPLE City index_merge Country,CountryPopulation,CountryName,CityName CountryName,CityName 38,35 NULL 28 Using sort_union(CountryName,CityName); Using where
|
||||
SELECT Name, Country, Population FROM City WHERE
|
||||
(Name='Manila' AND Country='PHL') OR
|
||||
(Name='Addis Abeba' AND Country='ETH') OR
|
||||
(Name='Jakarta' AND Country='IDN') OR
|
||||
(Name='Bangalore' AND Country='IND') OR
|
||||
(Name='Teheran' AND Country='IRN') OR
|
||||
(Name='Roma' AND Country='ITA') OR
|
||||
(Name='Delhi' AND Country='IND') OR
|
||||
(Name='Venezia' AND Country='ITA') OR
|
||||
(Name='Tokyo' AND Country='JPN') OR
|
||||
(Name='Toronto' AND Country='CAN') OR
|
||||
(Name='Peking' AND Country='CHN') OR
|
||||
(Name='Lagos' AND Country='NGA') OR
|
||||
(Name='Tijuana' AND Country='MEX') OR
|
||||
(Name='Rabat' AND Country='MAR') OR
|
||||
(Name='Seoul' AND Country='KOR') OR
|
||||
(Name='Vancouver' AND Country='CAN') OR
|
||||
(Name='Kaunas' AND Country='LTU') OR
|
||||
(Name='Paris' AND Country='FRA') OR
|
||||
(Name='Dakar' AND Country='SEN') OR
|
||||
(Name='Basel' AND Country='CHE') OR
|
||||
(Name='Praha' AND Country='CZE') OR
|
||||
(Name='Ankara' AND Country='TUR') OR
|
||||
(Name='Dresden' AND Country='DEU') OR
|
||||
(Name='Lugansk' AND Country='UKR') OR
|
||||
(Name='Caracas' AND Country='VEN') OR
|
||||
(Name='Samara' AND Country='RUS') OR
|
||||
(Name='Seattle' AND Country='USA');
|
||||
Name Country Population
|
||||
Addis Abeba ETH 2495000
|
||||
Manila PHL 1581082
|
||||
Jakarta IDN 9604900
|
||||
Delhi IND 7206704
|
||||
Bangalore IND 2660088
|
||||
Teheran IRN 6758845
|
||||
Roma ITA 2643581
|
||||
Venezia ITA 277305
|
||||
Tokyo JPN 7980230
|
||||
Toronto CAN 688275
|
||||
Vancouver CAN 514008
|
||||
Peking CHN 7472000
|
||||
Seoul KOR 9981619
|
||||
Kaunas LTU 412639
|
||||
Rabat MAR 623457
|
||||
Tijuana MEX 1212232
|
||||
Lagos NGA 1518000
|
||||
Paris FRA 2125246
|
||||
Dresden DEU 476668
|
||||
Dakar SEN 785071
|
||||
Basel CHE 166700
|
||||
Praha CZE 1181126
|
||||
Ankara TUR 3038159
|
||||
Lugansk UKR 469000
|
||||
Caracas VEN 1975294
|
||||
Samara RUS 1156100
|
||||
Seattle USA 563374
|
||||
set optimizer_switch='index_merge=off';
|
||||
EXPLAIN SELECT Name, Country, Population FROM City WHERE
|
||||
(Name='Manila' AND Country='PHL') OR
|
||||
(Name='Addis Abeba' AND Country='ETH') OR
|
||||
(Name='Jakarta' AND Country='IDN') OR
|
||||
(Name='Bangalore' AND Country='IND') OR
|
||||
(Name='Teheran' AND Country='IRN') OR
|
||||
(Name='Roma' AND Country='ITA') OR
|
||||
(Name='Delhi' AND Country='IND') OR
|
||||
(Name='Venezia' AND Country='ITA') OR
|
||||
(Name='Tokyo' AND Country='JPN') OR
|
||||
(Name='Toronto' AND Country='CAN') OR
|
||||
(Name='Peking' AND Country='CHN') OR
|
||||
(Name='Lagos' AND Country='NGA') OR
|
||||
(Name='Tijuana' AND Country='MEX') OR
|
||||
(Name='Rabat' AND Country='MAR') OR
|
||||
(Name='Seoul' AND Country='KOR') OR
|
||||
(Name='Vancouver' AND Country='CAN') OR
|
||||
(Name='Kaunas' AND Country='LTU') OR
|
||||
(Name='Paris' AND Country='FRA') OR
|
||||
(Name='Dakar' AND Country='SEN') OR
|
||||
(Name='Basel' AND Country='CHE') OR
|
||||
(Name='Praha' AND Country='CZE') OR
|
||||
(Name='Ankara' AND Country='TUR') OR
|
||||
(Name='Dresden' AND Country='DEU') OR
|
||||
(Name='Lugansk' AND Country='UKR') OR
|
||||
(Name='Caracas' AND Country='VEN') OR
|
||||
(Name='Samara' AND Country='RUS') OR
|
||||
(Name='Seattle' AND Country='USA');
|
||||
id select_type table type possible_keys key key_len ref rows Extra
|
||||
1 SIMPLE City range Country,CountryPopulation,CountryName,CityName CountryName 38 NULL 29 Using index condition; Using where
|
||||
SELECT Name, Country, Population FROM City WHERE
|
||||
(Name='Manila' AND Country='PHL') OR
|
||||
(Name='Addis Abeba' AND Country='ETH') OR
|
||||
(Name='Jakarta' AND Country='IDN') OR
|
||||
(Name='Bangalore' AND Country='IND') OR
|
||||
(Name='Teheran' AND Country='IRN') OR
|
||||
(Name='Roma' AND Country='ITA') OR
|
||||
(Name='Delhi' AND Country='IND') OR
|
||||
(Name='Venezia' AND Country='ITA') OR
|
||||
(Name='Tokyo' AND Country='JPN') OR
|
||||
(Name='Toronto' AND Country='CAN') OR
|
||||
(Name='Peking' AND Country='CHN') OR
|
||||
(Name='Lagos' AND Country='NGA') OR
|
||||
(Name='Tijuana' AND Country='MEX') OR
|
||||
(Name='Rabat' AND Country='MAR') OR
|
||||
(Name='Seoul' AND Country='KOR') OR
|
||||
(Name='Vancouver' AND Country='CAN') OR
|
||||
(Name='Kaunas' AND Country='LTU') OR
|
||||
(Name='Paris' AND Country='FRA') OR
|
||||
(Name='Dakar' AND Country='SEN') OR
|
||||
(Name='Basel' AND Country='CHE') OR
|
||||
(Name='Praha' AND Country='CZE') OR
|
||||
(Name='Ankara' AND Country='TUR') OR
|
||||
(Name='Dresden' AND Country='DEU') OR
|
||||
(Name='Lugansk' AND Country='UKR') OR
|
||||
(Name='Caracas' AND Country='VEN') OR
|
||||
(Name='Samara' AND Country='RUS') OR
|
||||
(Name='Seattle' AND Country='USA');
|
||||
Name Country Population
|
||||
Toronto CAN 688275
|
||||
Vancouver CAN 514008
|
||||
Basel CHE 166700
|
||||
Peking CHN 7472000
|
||||
Praha CZE 1181126
|
||||
Dresden DEU 476668
|
||||
Addis Abeba ETH 2495000
|
||||
Paris FRA 2125246
|
||||
Jakarta IDN 9604900
|
||||
Bangalore IND 2660088
|
||||
Delhi IND 7206704
|
||||
Teheran IRN 6758845
|
||||
Roma ITA 2643581
|
||||
Venezia ITA 277305
|
||||
Tokyo JPN 7980230
|
||||
Seoul KOR 9981619
|
||||
Kaunas LTU 412639
|
||||
Rabat MAR 623457
|
||||
Tijuana MEX 1212232
|
||||
Lagos NGA 1518000
|
||||
Manila PHL 1581082
|
||||
Samara RUS 1156100
|
||||
Dakar SEN 785071
|
||||
Ankara TUR 3038159
|
||||
Lugansk UKR 469000
|
||||
Seattle USA 563374
|
||||
Caracas VEN 1975294
|
||||
set optimizer_switch=@save_optimizer_switch;
|
||||
DROP DATABASE world;
|
||||
use test;
|
||||
CREATE TABLE t1 (
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
--- r/range_vs_index_merge_innodb.result 2012-02-23 15:57:49.000000000 +0100
|
||||
+++ r/range_vs_index_merge_innodb,innodb_plugin.reject 2012-02-23 19:46:02.000000000 +0100
|
||||
--- r/range_vs_index_merge_innodb.result 2012-03-24 17:12:02.124422000 +0100
|
||||
+++ r/range_vs_index_merge_innodb,innodb_plugin.reject 2012-03-24 18:00:13.647902620 +0100
|
||||
@@ -50,14 +50,14 @@
|
||||
WHERE (Population >= 100000 OR Name LIKE 'P%') AND Country='CAN' OR
|
||||
(Population < 100000 OR Name Like 'T%') AND Country='ARG';
|
||||
|
@ -251,3 +251,21 @@
|
|||
SELECT * FROM City USE INDEX ()
|
||||
WHERE ((Population > 101000 AND Population < 11000) OR
|
||||
ID BETWEEN 3500 AND 3800) AND Country='USA'
|
||||
@@ -1077,7 +1077,7 @@
|
||||
(Name='Samara' AND Country='RUS') OR
|
||||
(Name='Seattle' AND Country='USA');
|
||||
id select_type table type possible_keys key key_len ref rows Extra
|
||||
-1 SIMPLE City range Country,CountryPopulation,CountryName,CityName CountryName 38 NULL 27 Using index condition; Using where
|
||||
+1 SIMPLE City range Country,CountryPopulation,CountryName,CityName CountryName 38 NULL 27 Using where
|
||||
SELECT Name, Country, Population FROM City WHERE
|
||||
(Name='Manila' AND Country='PHL') OR
|
||||
(Name='Addis Abeba' AND Country='ETH') OR
|
||||
@@ -1164,7 +1164,7 @@
|
||||
(Name='Samara' AND Country='RUS') OR
|
||||
(Name='Seattle' AND Country='USA');
|
||||
id select_type table type possible_keys key key_len ref rows Extra
|
||||
-1 SIMPLE City range Country,CountryPopulation,CountryName,CityName CountryName 38 NULL 27 Using index condition; Using where
|
||||
+1 SIMPLE City range Country,CountryPopulation,CountryName,CityName CountryName 38 NULL 27 Using where
|
||||
SELECT Name, Country, Population FROM City WHERE
|
||||
(Name='Manila' AND Country='PHL') OR
|
||||
(Name='Addis Abeba' AND Country='ETH') OR
|
||||
|
|
|
@ -1046,6 +1046,182 @@ ID Name Country Population
|
|||
4030 Sandy USA 101853
|
||||
4031 Athens-Clarke County USA 101489
|
||||
4032 Cambridge USA 101355
|
||||
set @save_optimizer_switch=@@optimizer_switch;
|
||||
CREATE INDEX CityName on City(Name);
|
||||
EXPLAIN SELECT Name, Country, Population FROM City WHERE
|
||||
(Name='Manila' AND Country='PHL') OR
|
||||
(Name='Addis Abeba' AND Country='ETH') OR
|
||||
(Name='Jakarta' AND Country='IDN') OR
|
||||
(Name='Bangalore' AND Country='IND') OR
|
||||
(Name='Teheran' AND Country='IRN') OR
|
||||
(Name='Roma' AND Country='ITA') OR
|
||||
(Name='Delhi' AND Country='IND') OR
|
||||
(Name='Venezia' AND Country='ITA') OR
|
||||
(Name='Tokyo' AND Country='JPN') OR
|
||||
(Name='Toronto' AND Country='CAN') OR
|
||||
(Name='Peking' AND Country='CHN') OR
|
||||
(Name='Lagos' AND Country='NGA') OR
|
||||
(Name='Tijuana' AND Country='MEX') OR
|
||||
(Name='Rabat' AND Country='MAR') OR
|
||||
(Name='Seoul' AND Country='KOR') OR
|
||||
(Name='Vancouver' AND Country='CAN') OR
|
||||
(Name='Kaunas' AND Country='LTU') OR
|
||||
(Name='Paris' AND Country='FRA') OR
|
||||
(Name='Dakar' AND Country='SEN') OR
|
||||
(Name='Basel' AND Country='CHE') OR
|
||||
(Name='Praha' AND Country='CZE') OR
|
||||
(Name='Ankara' AND Country='TUR') OR
|
||||
(Name='Dresden' AND Country='DEU') OR
|
||||
(Name='Lugansk' AND Country='UKR') OR
|
||||
(Name='Caracas' AND Country='VEN') OR
|
||||
(Name='Samara' AND Country='RUS') OR
|
||||
(Name='Seattle' AND Country='USA');
|
||||
id select_type table type possible_keys key key_len ref rows Extra
|
||||
1 SIMPLE City range Country,CountryPopulation,CountryName,CityName CountryName 38 NULL 27 Using index condition; Using where
|
||||
SELECT Name, Country, Population FROM City WHERE
|
||||
(Name='Manila' AND Country='PHL') OR
|
||||
(Name='Addis Abeba' AND Country='ETH') OR
|
||||
(Name='Jakarta' AND Country='IDN') OR
|
||||
(Name='Bangalore' AND Country='IND') OR
|
||||
(Name='Teheran' AND Country='IRN') OR
|
||||
(Name='Roma' AND Country='ITA') OR
|
||||
(Name='Delhi' AND Country='IND') OR
|
||||
(Name='Venezia' AND Country='ITA') OR
|
||||
(Name='Tokyo' AND Country='JPN') OR
|
||||
(Name='Toronto' AND Country='CAN') OR
|
||||
(Name='Peking' AND Country='CHN') OR
|
||||
(Name='Lagos' AND Country='NGA') OR
|
||||
(Name='Tijuana' AND Country='MEX') OR
|
||||
(Name='Rabat' AND Country='MAR') OR
|
||||
(Name='Seoul' AND Country='KOR') OR
|
||||
(Name='Vancouver' AND Country='CAN') OR
|
||||
(Name='Kaunas' AND Country='LTU') OR
|
||||
(Name='Paris' AND Country='FRA') OR
|
||||
(Name='Dakar' AND Country='SEN') OR
|
||||
(Name='Basel' AND Country='CHE') OR
|
||||
(Name='Praha' AND Country='CZE') OR
|
||||
(Name='Ankara' AND Country='TUR') OR
|
||||
(Name='Dresden' AND Country='DEU') OR
|
||||
(Name='Lugansk' AND Country='UKR') OR
|
||||
(Name='Caracas' AND Country='VEN') OR
|
||||
(Name='Samara' AND Country='RUS') OR
|
||||
(Name='Seattle' AND Country='USA');
|
||||
Name Country Population
|
||||
Toronto CAN 688275
|
||||
Vancouver CAN 514008
|
||||
Basel CHE 166700
|
||||
Peking CHN 7472000
|
||||
Praha CZE 1181126
|
||||
Dresden DEU 476668
|
||||
Addis Abeba ETH 2495000
|
||||
Paris FRA 2125246
|
||||
Jakarta IDN 9604900
|
||||
Bangalore IND 2660088
|
||||
Delhi IND 7206704
|
||||
Teheran IRN 6758845
|
||||
Roma ITA 2643581
|
||||
Venezia ITA 277305
|
||||
Tokyo JPN 7980230
|
||||
Seoul KOR 9981619
|
||||
Kaunas LTU 412639
|
||||
Rabat MAR 623457
|
||||
Tijuana MEX 1212232
|
||||
Lagos NGA 1518000
|
||||
Manila PHL 1581082
|
||||
Samara RUS 1156100
|
||||
Dakar SEN 785071
|
||||
Ankara TUR 3038159
|
||||
Lugansk UKR 469000
|
||||
Seattle USA 563374
|
||||
Caracas VEN 1975294
|
||||
set optimizer_switch='index_merge=off';
|
||||
EXPLAIN SELECT Name, Country, Population FROM City WHERE
|
||||
(Name='Manila' AND Country='PHL') OR
|
||||
(Name='Addis Abeba' AND Country='ETH') OR
|
||||
(Name='Jakarta' AND Country='IDN') OR
|
||||
(Name='Bangalore' AND Country='IND') OR
|
||||
(Name='Teheran' AND Country='IRN') OR
|
||||
(Name='Roma' AND Country='ITA') OR
|
||||
(Name='Delhi' AND Country='IND') OR
|
||||
(Name='Venezia' AND Country='ITA') OR
|
||||
(Name='Tokyo' AND Country='JPN') OR
|
||||
(Name='Toronto' AND Country='CAN') OR
|
||||
(Name='Peking' AND Country='CHN') OR
|
||||
(Name='Lagos' AND Country='NGA') OR
|
||||
(Name='Tijuana' AND Country='MEX') OR
|
||||
(Name='Rabat' AND Country='MAR') OR
|
||||
(Name='Seoul' AND Country='KOR') OR
|
||||
(Name='Vancouver' AND Country='CAN') OR
|
||||
(Name='Kaunas' AND Country='LTU') OR
|
||||
(Name='Paris' AND Country='FRA') OR
|
||||
(Name='Dakar' AND Country='SEN') OR
|
||||
(Name='Basel' AND Country='CHE') OR
|
||||
(Name='Praha' AND Country='CZE') OR
|
||||
(Name='Ankara' AND Country='TUR') OR
|
||||
(Name='Dresden' AND Country='DEU') OR
|
||||
(Name='Lugansk' AND Country='UKR') OR
|
||||
(Name='Caracas' AND Country='VEN') OR
|
||||
(Name='Samara' AND Country='RUS') OR
|
||||
(Name='Seattle' AND Country='USA');
|
||||
id select_type table type possible_keys key key_len ref rows Extra
|
||||
1 SIMPLE City range Country,CountryPopulation,CountryName,CityName CountryName 38 NULL 27 Using index condition; Using where
|
||||
SELECT Name, Country, Population FROM City WHERE
|
||||
(Name='Manila' AND Country='PHL') OR
|
||||
(Name='Addis Abeba' AND Country='ETH') OR
|
||||
(Name='Jakarta' AND Country='IDN') OR
|
||||
(Name='Bangalore' AND Country='IND') OR
|
||||
(Name='Teheran' AND Country='IRN') OR
|
||||
(Name='Roma' AND Country='ITA') OR
|
||||
(Name='Delhi' AND Country='IND') OR
|
||||
(Name='Venezia' AND Country='ITA') OR
|
||||
(Name='Tokyo' AND Country='JPN') OR
|
||||
(Name='Toronto' AND Country='CAN') OR
|
||||
(Name='Peking' AND Country='CHN') OR
|
||||
(Name='Lagos' AND Country='NGA') OR
|
||||
(Name='Tijuana' AND Country='MEX') OR
|
||||
(Name='Rabat' AND Country='MAR') OR
|
||||
(Name='Seoul' AND Country='KOR') OR
|
||||
(Name='Vancouver' AND Country='CAN') OR
|
||||
(Name='Kaunas' AND Country='LTU') OR
|
||||
(Name='Paris' AND Country='FRA') OR
|
||||
(Name='Dakar' AND Country='SEN') OR
|
||||
(Name='Basel' AND Country='CHE') OR
|
||||
(Name='Praha' AND Country='CZE') OR
|
||||
(Name='Ankara' AND Country='TUR') OR
|
||||
(Name='Dresden' AND Country='DEU') OR
|
||||
(Name='Lugansk' AND Country='UKR') OR
|
||||
(Name='Caracas' AND Country='VEN') OR
|
||||
(Name='Samara' AND Country='RUS') OR
|
||||
(Name='Seattle' AND Country='USA');
|
||||
Name Country Population
|
||||
Toronto CAN 688275
|
||||
Vancouver CAN 514008
|
||||
Basel CHE 166700
|
||||
Peking CHN 7472000
|
||||
Praha CZE 1181126
|
||||
Dresden DEU 476668
|
||||
Addis Abeba ETH 2495000
|
||||
Paris FRA 2125246
|
||||
Jakarta IDN 9604900
|
||||
Bangalore IND 2660088
|
||||
Delhi IND 7206704
|
||||
Teheran IRN 6758845
|
||||
Roma ITA 2643581
|
||||
Venezia ITA 277305
|
||||
Tokyo JPN 7980230
|
||||
Seoul KOR 9981619
|
||||
Kaunas LTU 412639
|
||||
Rabat MAR 623457
|
||||
Tijuana MEX 1212232
|
||||
Lagos NGA 1518000
|
||||
Manila PHL 1581082
|
||||
Samara RUS 1156100
|
||||
Dakar SEN 785071
|
||||
Ankara TUR 3038159
|
||||
Lugansk UKR 469000
|
||||
Seattle USA 563374
|
||||
Caracas VEN 1975294
|
||||
set optimizer_switch=@save_optimizer_switch;
|
||||
DROP DATABASE world;
|
||||
use test;
|
||||
CREATE TABLE t1 (
|
||||
|
|
|
@ -2638,4 +2638,37 @@ id select_type table type possible_keys key key_len ref rows Extra
|
|||
1 PRIMARY t3 ALL NULL NULL NULL NULL 100 Using where; Using join buffer (flat, BNL join)
|
||||
drop table t0,t1,t3;
|
||||
set optimizer_switch= @tmp_923246;
|
||||
#
|
||||
# BUG#952583: Server crashes in Item_field::fix_after_pullout on INSERT .. SELECT
|
||||
#
|
||||
CREATE TABLE t1 ( a INT );
|
||||
INSERT INTO t1 VALUES (1),(2);
|
||||
CREATE TABLE t2 ( b INT );
|
||||
INSERT INTO t2 VALUES (3),(4);
|
||||
INSERT INTO t1
|
||||
SELECT * FROM ( SELECT * FROM t1 ) AS alias
|
||||
WHERE a IN ( SELECT b FROM t2 );
|
||||
DROP TABLE t1, t2;
|
||||
#
|
||||
# BUG#952372: Server crashes on 2nd execution of PS in find_field_in_tables with semijoin+materialization
|
||||
#
|
||||
CREATE TABLE t1 ( a INT );
|
||||
INSERT INTO t1 VALUES (2),(3);
|
||||
CREATE VIEW v1 AS SELECT * FROM t1;
|
||||
CREATE TABLE t2 ( b VARCHAR(1) );
|
||||
INSERT INTO t2 VALUES ('v'),('v');
|
||||
PREPARE pstmt FROM
|
||||
'SELECT DISTINCT a FROM v1, t2
|
||||
WHERE b IN ( SELECT MIN(b) FROM t2 )';
|
||||
EXECUTE pstmt;
|
||||
a
|
||||
2
|
||||
3
|
||||
EXECUTE pstmt;
|
||||
a
|
||||
2
|
||||
3
|
||||
DEALLOCATE PREPARE pstmt;
|
||||
DROP VIEW v1;
|
||||
DROP TABLE t1, t2;
|
||||
set optimizer_switch=@subselect_sj_tmp;
|
||||
|
|
|
@ -2652,6 +2652,39 @@ id select_type table type possible_keys key key_len ref rows Extra
|
|||
1 PRIMARY t3 ALL NULL NULL NULL NULL 100 Using where; Using join buffer (flat, BNL join)
|
||||
drop table t0,t1,t3;
|
||||
set optimizer_switch= @tmp_923246;
|
||||
#
|
||||
# BUG#952583: Server crashes in Item_field::fix_after_pullout on INSERT .. SELECT
|
||||
#
|
||||
CREATE TABLE t1 ( a INT );
|
||||
INSERT INTO t1 VALUES (1),(2);
|
||||
CREATE TABLE t2 ( b INT );
|
||||
INSERT INTO t2 VALUES (3),(4);
|
||||
INSERT INTO t1
|
||||
SELECT * FROM ( SELECT * FROM t1 ) AS alias
|
||||
WHERE a IN ( SELECT b FROM t2 );
|
||||
DROP TABLE t1, t2;
|
||||
#
|
||||
# BUG#952372: Server crashes on 2nd execution of PS in find_field_in_tables with semijoin+materialization
|
||||
#
|
||||
CREATE TABLE t1 ( a INT );
|
||||
INSERT INTO t1 VALUES (2),(3);
|
||||
CREATE VIEW v1 AS SELECT * FROM t1;
|
||||
CREATE TABLE t2 ( b VARCHAR(1) );
|
||||
INSERT INTO t2 VALUES ('v'),('v');
|
||||
PREPARE pstmt FROM
|
||||
'SELECT DISTINCT a FROM v1, t2
|
||||
WHERE b IN ( SELECT MIN(b) FROM t2 )';
|
||||
EXECUTE pstmt;
|
||||
a
|
||||
2
|
||||
3
|
||||
EXECUTE pstmt;
|
||||
a
|
||||
2
|
||||
3
|
||||
DEALLOCATE PREPARE pstmt;
|
||||
DROP VIEW v1;
|
||||
DROP TABLE t1, t2;
|
||||
set optimizer_switch=@subselect_sj_tmp;
|
||||
#
|
||||
# BUG#49129: Wrong result with IN-subquery with join_cache_level=6 and firstmatch=off
|
||||
|
|
|
@ -11,7 +11,7 @@ SET @old_debug= @@session.debug;
|
|||
CREATE TABLE t1(f0 int auto_increment primary key, f1 int);
|
||||
INSERT INTO t1(f1) VALUES (0),(1),(2),(3),(4),(5);
|
||||
|
||||
SET session debug_dbug= '+d,make_char_array_fail';
|
||||
SET session debug_dbug= '+d,make_sort_keys_alloc_fail';
|
||||
CALL mtr.add_suppression("Out of sort memory");
|
||||
--error ER_OUT_OF_SORTMEMORY
|
||||
SELECT * FROM t1 ORDER BY f1 ASC, f0;
|
||||
|
|
|
@ -1067,4 +1067,72 @@ insert into t2 values ('1:1:1');
|
|||
select t2.i from t1 left join t2 on t2.i = t1.i where t1.i = '1:1:1';
|
||||
drop table t1,t2;
|
||||
|
||||
--echo #
|
||||
--echo # BUG#954900: unexpected empty set due to an invalid build of key ref
|
||||
--echo #
|
||||
|
||||
CREATE TABLE t1 (dog_id int(10), birthday date, PRIMARY KEY (dog_id,birthday));
|
||||
INSERT INTO t1 VALUES (5918,'2004-07-22');
|
||||
|
||||
CREATE TABLE t2 (dog_id int(10) unsigned, t_id char(1), birthday date, a_id int(10),
|
||||
PRIMARY KEY (dog_id,t_id,birthday,a_id));
|
||||
INSERT INTO t2 VALUES
|
||||
(5918,'N','2004-07-22',5216551), (5918,'N','2004-07-22',5223640),
|
||||
(5918,'N','2004-07-22',5389491), (5918,'N','2004-07-22',5749434),
|
||||
(5918,'N','2004-07-22',5992424), (5922,'N','2005-06-30',5076957),
|
||||
(5924,'N','2000-08-11',20264), (5924,'N','2000-08-11',64251),
|
||||
(5924,'N','2000-08-11',74748), (5924,'N','2000-08-11',87590),
|
||||
(5924,'N','2000-08-11',104695), (5924,'N','2000-08-11',133136),
|
||||
(5924,'N','2000-08-11',5027806), (5924,'N','2000-08-11',5076957),
|
||||
(5924,'N','2000-08-11',5166821), (5924,'N','2000-08-11',5181896),
|
||||
(5924,'N','2000-08-11',5217908), (5924,'N','2000-08-11',5220812),
|
||||
(5924,'N','2000-08-11',5226473), (5924,'N','2000-08-11',5339111),
|
||||
(5925,'N','2005-02-10',19227), (5925,'N','2005-02-10',74529),
|
||||
(5925,'N','2005-02-10',74748), (5927,'N','2005-08-18',20264),
|
||||
(5927,'N','2005-08-18',58364), (5929,'N','2005-01-19',58364),
|
||||
(5935,'N','2006-03-10',19227), (5935,'N','2006-03-10',64251),
|
||||
(5935,'N','2006-03-10',5222400), (5935,'N','2006-03-10',5226473),
|
||||
(5936,'N','2004-10-29',5015032), (5937,'N','2002-04-05',11237),
|
||||
(5937,'N','2002-04-05',23911), (5937,'N','2002-04-05',112133),
|
||||
(5937,'N','2002-04-05',169721), (5937,'N','2002-04-05',170650),
|
||||
(5937,'N','2002-04-05',5014494), (5937,'N','2002-04-05',5166009),
|
||||
(5937,'N','2002-04-05',5181871), (5937,'N','2002-04-05',5213380),
|
||||
(5937,'N','2002-04-05',5214875), (5937,'N','2002-04-05',5895062),
|
||||
(5938,'N','2006-03-24',11237), (5938,'N','2006-03-24',19227),
|
||||
(5938,'N','2006-03-24',23911), (5938,'N','2006-03-24',58364),
|
||||
(5938,'N','2006-03-24',64251), (5938,'N','2006-03-24',111716),
|
||||
(5938,'N','2006-03-24',112702), (5938,'N','2006-03-24',133136),
|
||||
(5938,'N','2006-03-24',168718), (5938,'N','2006-03-24',5137136),
|
||||
(5938,'N','2006-03-24',5161519), (5938,'N','2006-03-24',5168120),
|
||||
(5938,'N','2006-03-24',5219034), (6234,'N','2006-06-02',103058),
|
||||
(6234,'N','2006-06-02',5146844), (6235,'N','2006-06-01',12900),
|
||||
(6235,'N','2006-06-01',20264), (6235,'N','2006-06-01',64251),
|
||||
(6235,'N','2006-06-01',75160), (6235,'N','2006-06-01',5014494),
|
||||
(6235,'N','2006-06-01',5181638), (6236,'N','2006-06-06',112595),
|
||||
(6236,'N','2006-06-06',5219601), (6236,'N','2006-06-06',5808374);
|
||||
|
||||
CREATE TABLE t3 (dog_id int(10) unsigned);
|
||||
INSERT INTO t3 VALUES (5918);
|
||||
|
||||
CREATE TABLE t4 (dog_id int(10), t_id char(1), birthday date, KEY (t_id));
|
||||
INSERT INTO t4 VALUES (5918,'N','2004-07-22'), (5919,'N','2004-07-20');
|
||||
|
||||
CREATE TABLE t5 (dog_id int(10) unsigned, UNIQUE KEY (dog_id));
|
||||
INSERT INTO t5 VALUES (5918);
|
||||
|
||||
SET @tmp_optimizer_switch=@@optimizer_switch;
|
||||
SET optimizer_switch='index_condition_pushdown=off';
|
||||
|
||||
EXPLAIN
|
||||
SELECT * FROM t5 DU, t1 D, t4 DT, t2 DSA, t3 DSAR
|
||||
WHERE DU.dog_id=D.dog_id AND D.dog_id=DT.dog_id AND D.birthday=DT.birthday AND
|
||||
DT.t_id=DSA.t_id AND DT.birthday=DSA.birthday AND DSA.dog_id=DSAR.dog_id;
|
||||
SELECT * FROM t5 DU, t1 D, t4 DT, t2 DSA, t3 DSAR
|
||||
WHERE DU.dog_id=D.dog_id AND D.dog_id=DT.dog_id AND D.birthday=DT.birthday AND
|
||||
DT.t_id=DSA.t_id AND DT.birthday=DSA.birthday AND DSA.dog_id=DSAR.dog_id;
|
||||
|
||||
SET optimizer_switch=@tmp_optimizer_switch;
|
||||
|
||||
DROP TABLE t1,t2,t3,t4,t5;
|
||||
|
||||
SET optimizer_switch=@save_optimizer_switch;
|
||||
|
|
|
@ -621,6 +621,62 @@ SELECT * FROM City
|
|||
(Population BETWEEN 101000 AND 102000 OR Name LIKE 'Pa%');
|
||||
|
||||
|
||||
#
|
||||
# LP bug #954262: index merge oover long disjunction in WHERE
|
||||
#
|
||||
|
||||
set @save_optimizer_switch=@@optimizer_switch;
|
||||
|
||||
CREATE INDEX CityName on City(Name);
|
||||
|
||||
let $cond =
|
||||
(Name='Manila' AND Country='PHL') OR
|
||||
(Name='Addis Abeba' AND Country='ETH') OR
|
||||
(Name='Jakarta' AND Country='IDN') OR
|
||||
(Name='Bangalore' AND Country='IND') OR
|
||||
(Name='Teheran' AND Country='IRN') OR
|
||||
(Name='Roma' AND Country='ITA') OR
|
||||
(Name='Delhi' AND Country='IND') OR
|
||||
(Name='Venezia' AND Country='ITA') OR
|
||||
(Name='Tokyo' AND Country='JPN') OR
|
||||
(Name='Toronto' AND Country='CAN') OR
|
||||
(Name='Peking' AND Country='CHN') OR
|
||||
(Name='Lagos' AND Country='NGA') OR
|
||||
(Name='Tijuana' AND Country='MEX') OR
|
||||
(Name='Rabat' AND Country='MAR') OR
|
||||
(Name='Seoul' AND Country='KOR') OR
|
||||
(Name='Vancouver' AND Country='CAN') OR
|
||||
(Name='Kaunas' AND Country='LTU') OR
|
||||
(Name='Paris' AND Country='FRA') OR
|
||||
(Name='Dakar' AND Country='SEN') OR
|
||||
(Name='Basel' AND Country='CHE') OR
|
||||
(Name='Praha' AND Country='CZE') OR
|
||||
(Name='Ankara' AND Country='TUR') OR
|
||||
(Name='Dresden' AND Country='DEU') OR
|
||||
(Name='Lugansk' AND Country='UKR') OR
|
||||
(Name='Caracas' AND Country='VEN') OR
|
||||
(Name='Samara' AND Country='RUS') OR
|
||||
(Name='Seattle' AND Country='USA');
|
||||
|
||||
eval
|
||||
EXPLAIN SELECT Name, Country, Population FROM City WHERE
|
||||
$cond;
|
||||
eval
|
||||
SELECT Name, Country, Population FROM City WHERE
|
||||
$cond;
|
||||
|
||||
set optimizer_switch='index_merge=off';
|
||||
|
||||
eval
|
||||
EXPLAIN SELECT Name, Country, Population FROM City WHERE
|
||||
$cond;
|
||||
eval
|
||||
SELECT Name, Country, Population FROM City WHERE
|
||||
$cond;
|
||||
|
||||
set optimizer_switch=@save_optimizer_switch;
|
||||
|
||||
|
||||
DROP DATABASE world;
|
||||
|
||||
use test;
|
||||
|
|
|
@ -2331,5 +2331,40 @@ explain select * from t3 where a in (select kp1 from t1 where kp1<20);
|
|||
drop table t0,t1,t3;
|
||||
set optimizer_switch= @tmp_923246;
|
||||
|
||||
--echo #
|
||||
--echo # BUG#952583: Server crashes in Item_field::fix_after_pullout on INSERT .. SELECT
|
||||
--echo #
|
||||
CREATE TABLE t1 ( a INT );
|
||||
INSERT INTO t1 VALUES (1),(2);
|
||||
CREATE TABLE t2 ( b INT );
|
||||
INSERT INTO t2 VALUES (3),(4);
|
||||
|
||||
INSERT INTO t1
|
||||
SELECT * FROM ( SELECT * FROM t1 ) AS alias
|
||||
WHERE a IN ( SELECT b FROM t2 );
|
||||
|
||||
DROP TABLE t1, t2;
|
||||
|
||||
--echo #
|
||||
--echo # BUG#952372: Server crashes on 2nd execution of PS in find_field_in_tables with semijoin+materialization
|
||||
--echo #
|
||||
CREATE TABLE t1 ( a INT );
|
||||
INSERT INTO t1 VALUES (2),(3);
|
||||
CREATE VIEW v1 AS SELECT * FROM t1;
|
||||
|
||||
CREATE TABLE t2 ( b VARCHAR(1) );
|
||||
INSERT INTO t2 VALUES ('v'),('v');
|
||||
|
||||
PREPARE pstmt FROM
|
||||
'SELECT DISTINCT a FROM v1, t2
|
||||
WHERE b IN ( SELECT MIN(b) FROM t2 )';
|
||||
|
||||
EXECUTE pstmt;
|
||||
EXECUTE pstmt;
|
||||
|
||||
DEALLOCATE PREPARE pstmt;
|
||||
DROP VIEW v1;
|
||||
DROP TABLE t1, t2;
|
||||
|
||||
# The following command must be the last one the file
|
||||
set optimizer_switch=@subselect_sj_tmp;
|
||||
|
|
|
@ -140,7 +140,7 @@ int my_addr_resolve(void *ptr, my_addr_loc *loc)
|
|||
char output[1024];
|
||||
size_t len;
|
||||
|
||||
len= my_safe_snprintf(input, sizeof(input), "0x%p\n", ptr);
|
||||
len= snprintf(input, sizeof(input), "0x%p\n", ptr);
|
||||
if (write(in[1], input, len) <= 0)
|
||||
return 1;
|
||||
if (read(out[0], output, sizeof(output)) <= 0)
|
||||
|
|
|
@ -661,9 +661,10 @@ void my_print_stacktrace(uchar* unused1, ulong unused2)
|
|||
my_safe_printf_stderr("%s!", base_image_name);
|
||||
}
|
||||
if(have_symbol)
|
||||
fprintf(stderr, "%s()", package.sym.Name);
|
||||
my_safe_printf_stderr("%s()", package.sym.Name);
|
||||
|
||||
else if(have_module)
|
||||
fprintf(stderr,"%s", "???");
|
||||
my_safe_printf_stderr("%s", "???");
|
||||
|
||||
if(have_source)
|
||||
{
|
||||
|
@ -671,7 +672,7 @@ void my_print_stacktrace(uchar* unused1, ulong unused2)
|
|||
my_safe_printf_stderr("[%s:%u]",
|
||||
base_file_name, line.LineNumber);
|
||||
}
|
||||
fprintf(stderr,"%s", "\n");
|
||||
my_safe_printf_stderr("%s", "\n");
|
||||
}
|
||||
}
|
||||
|
||||
|
@ -742,189 +743,10 @@ void my_safe_print_str(const char *val, int len)
|
|||
#endif /*__WIN__*/
|
||||
|
||||
|
||||
#ifdef __WIN__
|
||||
size_t my_write_stderr(const void *buf, size_t count)
|
||||
{
|
||||
return fwrite(buf, 1, count, stderr);
|
||||
}
|
||||
#else
|
||||
size_t my_write_stderr(const void *buf, size_t count)
|
||||
{
|
||||
return (size_t) write(STDERR_FILENO, buf, count);
|
||||
}
|
||||
#endif
|
||||
|
||||
|
||||
static const char digits[]= "0123456789abcdef";
|
||||
|
||||
char *my_safe_utoa(int base, ulonglong val, char *buf)
|
||||
{
|
||||
*buf--= 0;
|
||||
do {
|
||||
*buf--= digits[val % base];
|
||||
} while ((val /= base) != 0);
|
||||
return buf + 1;
|
||||
}
|
||||
|
||||
|
||||
char *my_safe_itoa(int base, longlong val, char *buf)
|
||||
{
|
||||
char *orig_buf= buf;
|
||||
const my_bool is_neg= (val < 0);
|
||||
*buf--= 0;
|
||||
|
||||
if (is_neg)
|
||||
val= -val;
|
||||
if (is_neg && base == 16)
|
||||
{
|
||||
int ix;
|
||||
val-= 1;
|
||||
for (ix= 0; ix < 16; ++ix)
|
||||
buf[-ix]= '0';
|
||||
}
|
||||
|
||||
do {
|
||||
*buf--= digits[val % base];
|
||||
} while ((val /= base) != 0);
|
||||
|
||||
if (is_neg && base == 10)
|
||||
*buf--= '-';
|
||||
|
||||
if (is_neg && base == 16)
|
||||
{
|
||||
int ix;
|
||||
buf= orig_buf - 1;
|
||||
for (ix= 0; ix < 16; ++ix, --buf)
|
||||
{
|
||||
switch (*buf)
|
||||
{
|
||||
case '0': *buf= 'f'; break;
|
||||
case '1': *buf= 'e'; break;
|
||||
case '2': *buf= 'd'; break;
|
||||
case '3': *buf= 'c'; break;
|
||||
case '4': *buf= 'b'; break;
|
||||
case '5': *buf= 'a'; break;
|
||||
case '6': *buf= '9'; break;
|
||||
case '7': *buf= '8'; break;
|
||||
case '8': *buf= '7'; break;
|
||||
case '9': *buf= '6'; break;
|
||||
case 'a': *buf= '5'; break;
|
||||
case 'b': *buf= '4'; break;
|
||||
case 'c': *buf= '3'; break;
|
||||
case 'd': *buf= '2'; break;
|
||||
case 'e': *buf= '1'; break;
|
||||
case 'f': *buf= '0'; break;
|
||||
}
|
||||
}
|
||||
}
|
||||
return buf+1;
|
||||
}
|
||||
|
||||
|
||||
static const char *check_longlong(const char *fmt, my_bool *have_longlong)
|
||||
{
|
||||
*have_longlong= FALSE;
|
||||
if (*fmt == 'l')
|
||||
{
|
||||
fmt++;
|
||||
if (*fmt != 'l')
|
||||
*have_longlong= (sizeof(long) == sizeof(longlong));
|
||||
else
|
||||
{
|
||||
fmt++;
|
||||
*have_longlong= TRUE;
|
||||
}
|
||||
}
|
||||
return fmt;
|
||||
}
|
||||
|
||||
static size_t my_safe_vsnprintf(char *to, size_t size,
|
||||
const char* format, va_list ap)
|
||||
{
|
||||
char *start= to;
|
||||
char *end= start + size - 1;
|
||||
for (; *format; ++format)
|
||||
{
|
||||
my_bool have_longlong = FALSE;
|
||||
if (*format != '%')
|
||||
{
|
||||
if (to == end) /* end of buffer */
|
||||
break;
|
||||
*to++= *format; /* copy ordinary char */
|
||||
continue;
|
||||
}
|
||||
++format; /* skip '%' */
|
||||
|
||||
format= check_longlong(format, &have_longlong);
|
||||
|
||||
switch (*format)
|
||||
{
|
||||
case 'd':
|
||||
case 'i':
|
||||
case 'u':
|
||||
case 'x':
|
||||
case 'p':
|
||||
{
|
||||
longlong ival= 0;
|
||||
ulonglong uval = 0;
|
||||
if (*format == 'p')
|
||||
have_longlong= (sizeof(void *) == sizeof(longlong));
|
||||
if (have_longlong)
|
||||
{
|
||||
if (*format == 'u')
|
||||
uval= va_arg(ap, ulonglong);
|
||||
else
|
||||
ival= va_arg(ap, longlong);
|
||||
}
|
||||
else
|
||||
{
|
||||
if (*format == 'u')
|
||||
uval= va_arg(ap, unsigned int);
|
||||
else
|
||||
ival= va_arg(ap, int);
|
||||
}
|
||||
|
||||
{
|
||||
char buff[22];
|
||||
const int base= (*format == 'x' || *format == 'p') ? 16 : 10;
|
||||
char *val_as_str= (*format == 'u') ?
|
||||
my_safe_utoa(base, uval, &buff[sizeof(buff)-1]) :
|
||||
my_safe_itoa(base, ival, &buff[sizeof(buff)-1]);
|
||||
|
||||
/* Strip off "ffffffff" if we have 'x' format without 'll' */
|
||||
if (*format == 'x' && !have_longlong && ival < 0)
|
||||
val_as_str+= 8;
|
||||
|
||||
while (*val_as_str && to < end)
|
||||
*to++= *val_as_str++;
|
||||
continue;
|
||||
}
|
||||
}
|
||||
case 's':
|
||||
{
|
||||
const char *val= va_arg(ap, char*);
|
||||
if (!val)
|
||||
val= "(null)";
|
||||
while (*val && to < end)
|
||||
*to++= *val++;
|
||||
continue;
|
||||
}
|
||||
}
|
||||
}
|
||||
*to= 0;
|
||||
return to - start;
|
||||
}
|
||||
|
||||
|
||||
size_t my_safe_snprintf(char* to, size_t n, const char* fmt, ...)
|
||||
{
|
||||
size_t result;
|
||||
va_list args;
|
||||
va_start(args,fmt);
|
||||
result= my_safe_vsnprintf(to, n, fmt, args);
|
||||
va_end(args);
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
size_t my_safe_printf_stderr(const char* fmt, ...)
|
||||
|
@ -933,7 +755,7 @@ size_t my_safe_printf_stderr(const char* fmt, ...)
|
|||
size_t result;
|
||||
va_list args;
|
||||
va_start(args,fmt);
|
||||
result= my_safe_vsnprintf(to, sizeof(to), fmt, args);
|
||||
result= vsnprintf(to, sizeof(to), fmt, args);
|
||||
va_end(args);
|
||||
my_write_stderr(to, result);
|
||||
return result;
|
||||
|
|
|
@ -44,12 +44,11 @@ if (my_b_write((file),(uchar*) (from),param->ref_length)) \
|
|||
|
||||
/* functions defined in this file */
|
||||
|
||||
static char **make_char_array(char **old_pos, register uint fields,
|
||||
uint length, myf my_flag);
|
||||
static uchar *read_buffpek_from_file(IO_CACHE *buffer_file, uint count,
|
||||
uchar *buf);
|
||||
static ha_rows find_all_keys(SORTPARAM *param,SQL_SELECT *select,
|
||||
uchar * *sort_keys, IO_CACHE *buffer_file,
|
||||
uchar * *sort_keys, uchar *sort_keys_buf,
|
||||
IO_CACHE *buffer_file,
|
||||
IO_CACHE *tempfile,IO_CACHE *indexfile);
|
||||
static int write_keys(SORTPARAM *param,uchar * *sort_keys,
|
||||
uint count, IO_CACHE *buffer_file, IO_CACHE *tempfile);
|
||||
|
@ -217,20 +216,30 @@ ha_rows filesort(THD *thd, TABLE *table, SORT_FIELD *sortorder, uint s_length,
|
|||
|
||||
memavl= thd->variables.sortbuff_size;
|
||||
min_sort_memory= max(MIN_SORT_MEMORY, param.sort_length*MERGEBUFF2);
|
||||
if (!table_sort.sort_keys)
|
||||
{
|
||||
while (memavl >= min_sort_memory)
|
||||
{
|
||||
ulong old_memavl;
|
||||
ulong keys= memavl/(param.rec_length+sizeof(char*));
|
||||
param.keys=(uint) min(records+1, keys);
|
||||
table_sort.keys= (uint) min(records+1, keys);
|
||||
|
||||
DBUG_EXECUTE_IF("make_sort_keys_alloc_fail",
|
||||
DBUG_SET("+d,simulate_out_of_memory"););
|
||||
|
||||
if ((table_sort.sort_keys=
|
||||
(uchar **) make_char_array((char **) table_sort.sort_keys,
|
||||
param.keys, param.rec_length, MYF(0))))
|
||||
(uchar**) my_malloc(table_sort.keys*(param.rec_length+sizeof(char*)),
|
||||
MYF(0))))
|
||||
break;
|
||||
old_memavl=memavl;
|
||||
if ((memavl=memavl/4*3) < min_sort_memory && old_memavl > min_sort_memory)
|
||||
if ((memavl=memavl/4*3) < min_sort_memory &&
|
||||
old_memavl > min_sort_memory)
|
||||
memavl= min_sort_memory;
|
||||
}
|
||||
}
|
||||
|
||||
sort_keys= table_sort.sort_keys;
|
||||
param.keys= table_sort.keys - 1; /* TODO: check why we do this " - 1" */
|
||||
if (memavl < min_sort_memory)
|
||||
{
|
||||
my_error(ER_OUT_OF_SORTMEMORY,MYF(ME_ERROR+ME_WAITTANG));
|
||||
|
@ -240,10 +249,10 @@ ha_rows filesort(THD *thd, TABLE *table, SORT_FIELD *sortorder, uint s_length,
|
|||
DISK_BUFFER_SIZE, MYF(ME_ERROR | MY_WME)))
|
||||
goto err;
|
||||
|
||||
param.keys--; /* TODO: check why we do this */
|
||||
param.sort_form= table;
|
||||
param.end=(param.local_sortorder=sortorder)+s_length;
|
||||
if ((records=find_all_keys(¶m,select,sort_keys, &buffpek_pointers,
|
||||
if ((records=find_all_keys(¶m,select,sort_keys,
|
||||
(uchar *)(sort_keys+param.keys), &buffpek_pointers,
|
||||
&tempfile, selected_records_file)) ==
|
||||
HA_POS_ERROR)
|
||||
goto err;
|
||||
|
@ -381,29 +390,6 @@ void filesort_free_buffers(TABLE *table, bool full)
|
|||
table->sort.addon_field= NULL;
|
||||
}
|
||||
|
||||
/** Make a array of string pointers. */
|
||||
|
||||
static char **make_char_array(char **old_pos, register uint fields,
|
||||
uint length, myf my_flag)
|
||||
{
|
||||
register char **pos;
|
||||
char *char_pos;
|
||||
DBUG_ENTER("make_char_array");
|
||||
|
||||
DBUG_EXECUTE_IF("make_char_array_fail",
|
||||
DBUG_SET("+d,simulate_out_of_memory"););
|
||||
|
||||
if (old_pos ||
|
||||
(old_pos= (char**) my_malloc((uint) fields*(length+sizeof(char*)),
|
||||
my_flag)))
|
||||
{
|
||||
pos=old_pos; char_pos=((char*) (pos+fields)) -length;
|
||||
while (fields--) *(pos++) = (char_pos+= length);
|
||||
}
|
||||
|
||||
DBUG_RETURN(old_pos);
|
||||
} /* make_char_array */
|
||||
|
||||
|
||||
/** Read 'count' number of buffer pointers into memory. */
|
||||
|
||||
|
@ -518,7 +504,7 @@ static void dbug_print_record(TABLE *table, bool print_rowid)
|
|||
*/
|
||||
|
||||
static ha_rows find_all_keys(SORTPARAM *param, SQL_SELECT *select,
|
||||
uchar **sort_keys,
|
||||
uchar **sort_keys, uchar *sort_keys_buf,
|
||||
IO_CACHE *buffpek_pointers,
|
||||
IO_CACHE *tempfile, IO_CACHE *indexfile)
|
||||
{
|
||||
|
@ -531,6 +517,7 @@ static ha_rows find_all_keys(SORTPARAM *param, SQL_SELECT *select,
|
|||
volatile killed_state *killed= &thd->killed;
|
||||
handler *file;
|
||||
MY_BITMAP *save_read_set, *save_write_set, *save_vcol_set;
|
||||
uchar *next_sort_key= sort_keys_buf;
|
||||
DBUG_ENTER("find_all_keys");
|
||||
DBUG_PRINT("info",("using: %s",
|
||||
(select ? select->quick ? "ranges" : "where":
|
||||
|
@ -672,9 +659,12 @@ static ha_rows find_all_keys(SORTPARAM *param, SQL_SELECT *select,
|
|||
if (write_keys(param,sort_keys,idx,buffpek_pointers,tempfile))
|
||||
DBUG_RETURN(HA_POS_ERROR);
|
||||
idx=0;
|
||||
next_sort_key= sort_keys_buf;
|
||||
indexpos++;
|
||||
}
|
||||
make_sortkey(param,sort_keys[idx++],ref_pos);
|
||||
sort_keys[idx++]= next_sort_key;
|
||||
make_sortkey(param, next_sort_key, ref_pos);
|
||||
next_sort_key+= param->rec_length;
|
||||
}
|
||||
else
|
||||
file->unlock_row();
|
||||
|
|
|
@ -2606,6 +2606,8 @@ void Item_field::fix_after_pullout(st_select_lex *new_parent, Item **ref)
|
|||
{
|
||||
if (new_parent == get_depended_from())
|
||||
depended_from= NULL;
|
||||
if (context)
|
||||
{
|
||||
Name_resolution_context *ctx= new Name_resolution_context();
|
||||
ctx->outer_context= NULL; // We don't build a complete name resolver
|
||||
ctx->table_list= NULL; // We rely on first_name_resolution_table instead
|
||||
|
@ -2617,6 +2619,7 @@ void Item_field::fix_after_pullout(st_select_lex *new_parent, Item **ref)
|
|||
ctx->resolve_in_select_list= context->resolve_in_select_list;
|
||||
ctx->security_ctx= context->security_ctx;
|
||||
this->context=ctx;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
|
|
@ -1396,7 +1396,7 @@ SEL_IMERGE::SEL_IMERGE(SEL_IMERGE *arg, uint cnt,
|
|||
for (SEL_TREE **tree = trees, **arg_tree= arg->trees; tree < trees_next;
|
||||
tree++, arg_tree++)
|
||||
{
|
||||
if (!(*tree= new SEL_TREE(*arg_tree, FALSE, param)))
|
||||
if (!(*tree= new SEL_TREE(*arg_tree, TRUE, param)))
|
||||
goto mem_err;
|
||||
}
|
||||
|
||||
|
|
|
@ -1267,7 +1267,10 @@ static bool convert_subq_to_sj(JOIN *parent_join, Item_in_subselect *subq_pred)
|
|||
(a theory: a next_local chain always starts with ::leaf_tables
|
||||
because view's tables are inserted after the view)
|
||||
*/
|
||||
for (tl= parent_lex->leaf_tables.head(); tl->next_local; tl= tl->next_local) ;
|
||||
|
||||
for (tl= (TABLE_LIST*)(parent_lex->table_list.first); tl->next_local; tl= tl->next_local)
|
||||
{}
|
||||
|
||||
tl->next_local= subq_lex->leaf_tables.head();
|
||||
|
||||
/* A theory: no need to re-connect the next_global chain */
|
||||
|
@ -1480,7 +1483,7 @@ static bool convert_subq_to_jtbm(JOIN *parent_join,
|
|||
(a theory: a next_local chain always starts with ::leaf_tables
|
||||
because view's tables are inserted after the view)
|
||||
*/
|
||||
for (tl= parent_lex->leaf_tables.head(); tl->next_local; tl= tl->next_local)
|
||||
for (tl= (TABLE_LIST*)(parent_lex->table_list.first); tl->next_local; tl= tl->next_local)
|
||||
{}
|
||||
tl->next_local= jtbm;
|
||||
|
||||
|
@ -4975,7 +4978,8 @@ bool JOIN::choose_subquery_plan(table_map join_tables)
|
|||
DBUG_ASSERT(!in_to_exists_where || in_to_exists_where->fixed);
|
||||
DBUG_ASSERT(!in_to_exists_having || in_to_exists_having->fixed);
|
||||
|
||||
Join_plan_state save_qep; /* The original QEP of the subquery. */
|
||||
/* The original QEP of the subquery. */
|
||||
Join_plan_state save_qep(table_count);
|
||||
|
||||
/*
|
||||
Compute and compare the costs of materialization and in-exists if both
|
||||
|
|
|
@ -461,7 +461,7 @@ int rr_sequential(READ_RECORD *info)
|
|||
break;
|
||||
}
|
||||
}
|
||||
if (!tmp)
|
||||
if (!tmp && info->table->vfield)
|
||||
update_virtual_fields(info->thd, info->table);
|
||||
return tmp;
|
||||
}
|
||||
|
|
|
@ -77,7 +77,7 @@ extern "C" sig_handler handle_fatal_signal(int sig)
|
|||
curr_time= my_time(0);
|
||||
localtime_r(&curr_time, &tm);
|
||||
|
||||
fprintf(stderr, "%02d%02d%02d %2d:%02d:%02d ",
|
||||
my_safe_printf_stderr("%02d%02d%02d %2d:%02d:%02d ",
|
||||
tm.tm_year % 100, tm.tm_mon+1, tm.tm_mday,
|
||||
tm.tm_hour, tm.tm_min, tm.tm_sec);
|
||||
if (opt_expect_abort
|
||||
|
|
|
@ -520,7 +520,7 @@ static void table_def_use_table(THD *thd, TABLE *table)
|
|||
|
||||
static void table_def_unuse_table(TABLE *table)
|
||||
{
|
||||
THD *thd= table->in_use;
|
||||
THD *thd __attribute__((unused))= table->in_use;
|
||||
DBUG_ASSERT(table->in_use);
|
||||
|
||||
/* We shouldn't put the table to 'unused' list if the share is old. */
|
||||
|
@ -8803,14 +8803,9 @@ fill_record(THD * thd, List<Item> &fields, List<Item> &values,
|
|||
}
|
||||
/* Update virtual fields*/
|
||||
thd->abort_on_warning= FALSE;
|
||||
if (vcol_table)
|
||||
{
|
||||
if (vcol_table->vfield)
|
||||
{
|
||||
if (update_virtual_fields(thd, vcol_table, TRUE))
|
||||
if (vcol_table && vcol_table->vfield &&
|
||||
update_virtual_fields(thd, vcol_table, TRUE))
|
||||
goto err;
|
||||
}
|
||||
}
|
||||
thd->abort_on_warning= save_abort_on_warning;
|
||||
thd->no_errors= save_no_errors;
|
||||
DBUG_RETURN(thd->is_error());
|
||||
|
|
|
@ -327,6 +327,7 @@ bool mysql_delete(THD *thd, TABLE_LIST *table_list, COND *conds,
|
|||
while (!(error=info.read_record(&info)) && !thd->killed &&
|
||||
! thd->is_error())
|
||||
{
|
||||
if (table->vfield)
|
||||
update_virtual_fields(thd, table);
|
||||
thd->examined_row_count++;
|
||||
// thd->is_error() is tested to disallow delete row on error
|
||||
|
|
|
@ -922,6 +922,7 @@ retry:
|
|||
goto ok;
|
||||
}
|
||||
/* Generate values for virtual fields */
|
||||
if (table->vfield)
|
||||
update_virtual_fields(thd, table);
|
||||
if (cond && !cond->val_int())
|
||||
{
|
||||
|
|
|
@ -3345,23 +3345,26 @@ int JOIN_TAB_SCAN::next()
|
|||
int skip_rc;
|
||||
READ_RECORD *info= &join_tab->read_record;
|
||||
SQL_SELECT *select= join_tab->cache_select;
|
||||
TABLE *table= join_tab->table;
|
||||
THD *thd= join->thd;
|
||||
|
||||
if (is_first_record)
|
||||
is_first_record= FALSE;
|
||||
else
|
||||
err= info->read_record(info);
|
||||
if (!err)
|
||||
update_virtual_fields(join->thd, join_tab->table);
|
||||
while (!err && select && (skip_rc= select->skip_record(join->thd)) <= 0)
|
||||
if (!err && table->vfield)
|
||||
update_virtual_fields(thd, table);
|
||||
while (!err && select && (skip_rc= select->skip_record(thd)) <= 0)
|
||||
{
|
||||
if (join->thd->killed || skip_rc < 0)
|
||||
if (thd->killed || skip_rc < 0)
|
||||
return 1;
|
||||
/*
|
||||
Move to the next record if the last retrieved record does not
|
||||
meet the condition pushed to the table join_tab.
|
||||
*/
|
||||
err= info->read_record(info);
|
||||
if (!err)
|
||||
update_virtual_fields(join->thd, join_tab->table);
|
||||
if (!err && table->vfield)
|
||||
update_virtual_fields(thd, table);
|
||||
}
|
||||
return err;
|
||||
}
|
||||
|
@ -3875,6 +3878,7 @@ int JOIN_TAB_SCAN_MRR::next()
|
|||
*/
|
||||
DBUG_ASSERT(cache->buff <= (uchar *) (*ptr) &&
|
||||
(uchar *) (*ptr) <= cache->end_pos);
|
||||
if (join_tab->table->vfield)
|
||||
update_virtual_fields(join->thd, join_tab->table);
|
||||
}
|
||||
return rc;
|
||||
|
|
|
@ -3085,12 +3085,11 @@ make_join_statistics(JOIN *join, List<TABLE_LIST> &tables_list,
|
|||
key_map const_ref, eq_part;
|
||||
bool has_expensive_keyparts;
|
||||
TABLE **table_vector;
|
||||
JOIN_TAB *stat,*stat_end,*s,**stat_ref;
|
||||
JOIN_TAB *stat,*stat_end,*s,**stat_ref, **stat_vector;
|
||||
KEYUSE *keyuse,*start_keyuse;
|
||||
table_map outer_join=0;
|
||||
table_map no_rows_const_tables= 0;
|
||||
SARGABLE_PARAM *sargables= 0;
|
||||
JOIN_TAB *stat_vector[MAX_TABLES+1];
|
||||
List_iterator<TABLE_LIST> ti(tables_list);
|
||||
TABLE_LIST *tables;
|
||||
DBUG_ENTER("make_join_statistics");
|
||||
|
@ -3099,9 +3098,19 @@ make_join_statistics(JOIN *join, List<TABLE_LIST> &tables_list,
|
|||
table_count=join->table_count;
|
||||
|
||||
stat=(JOIN_TAB*) join->thd->calloc(sizeof(JOIN_TAB)*(table_count));
|
||||
stat_ref=(JOIN_TAB**) join->thd->alloc(sizeof(JOIN_TAB*)*MAX_TABLES);
|
||||
stat_ref=(JOIN_TAB**) join->thd->alloc(sizeof(JOIN_TAB*)*
|
||||
(MAX_TABLES + table_count + 1));
|
||||
stat_vector= stat_ref + MAX_TABLES;
|
||||
table_vector=(TABLE**) join->thd->alloc(sizeof(TABLE*)*(table_count*2));
|
||||
if (!stat || !stat_ref || !table_vector)
|
||||
join->positions= new (join->thd->mem_root) POSITION[(table_count+1)];
|
||||
/*
|
||||
best_positions is ok to allocate with alloc() as we copy things to it with
|
||||
memcpy()
|
||||
*/
|
||||
join->best_positions= (POSITION*) join->thd->alloc(sizeof(POSITION)*
|
||||
(table_count +1));
|
||||
|
||||
if (join->thd->is_fatal_error)
|
||||
DBUG_RETURN(1); // Eom /* purecov: inspected */
|
||||
|
||||
join->best_ref=stat_vector;
|
||||
|
@ -7634,7 +7643,7 @@ static bool create_ref_for_key(JOIN *join, JOIN_TAB *j,
|
|||
if (keyuse->null_rejecting)
|
||||
j->ref.null_rejecting |= 1 << i;
|
||||
keyuse_uses_no_tables= keyuse_uses_no_tables && !keyuse->used_tables;
|
||||
if (!keyuse->used_tables && !thd->lex->describe)
|
||||
if (!keyuse->val->used_tables() && !thd->lex->describe)
|
||||
{ // Compare against constant
|
||||
store_key_item tmp(thd,
|
||||
keyinfo->key_part[i].field,
|
||||
|
@ -16257,6 +16266,7 @@ join_read_system(JOIN_TAB *tab)
|
|||
empty_record(table); // Make empty record
|
||||
return -1;
|
||||
}
|
||||
if (table->vfield)
|
||||
update_virtual_fields(tab->join->thd, table);
|
||||
store_record(table,record[1]);
|
||||
}
|
||||
|
@ -16306,6 +16316,7 @@ join_read_const(JOIN_TAB *tab)
|
|||
return report_error(table, error);
|
||||
return -1;
|
||||
}
|
||||
if (table->vfield)
|
||||
update_virtual_fields(tab->join->thd, table);
|
||||
store_record(table,record[1]);
|
||||
}
|
||||
|
|
|
@ -742,7 +742,7 @@ public:
|
|||
Information about a position of table within a join order. Used in join
|
||||
optimization.
|
||||
*/
|
||||
typedef struct st_position
|
||||
typedef struct st_position :public Sql_alloc
|
||||
{
|
||||
/* The table that's put into join order */
|
||||
JOIN_TAB *table;
|
||||
|
@ -845,22 +845,35 @@ protected:
|
|||
class Join_plan_state {
|
||||
public:
|
||||
DYNAMIC_ARRAY keyuse; /* Copy of the JOIN::keyuse array. */
|
||||
POSITION best_positions[MAX_TABLES+1]; /* Copy of JOIN::best_positions */
|
||||
POSITION *best_positions; /* Copy of JOIN::best_positions */
|
||||
/* Copies of the JOIN_TAB::keyuse pointers for each JOIN_TAB. */
|
||||
KEYUSE *join_tab_keyuse[MAX_TABLES];
|
||||
KEYUSE **join_tab_keyuse;
|
||||
/* Copies of JOIN_TAB::checked_keys for each JOIN_TAB. */
|
||||
key_map join_tab_checked_keys[MAX_TABLES];
|
||||
SJ_MATERIALIZATION_INFO *sj_mat_info[MAX_TABLES];
|
||||
key_map *join_tab_checked_keys;
|
||||
SJ_MATERIALIZATION_INFO **sj_mat_info;
|
||||
my_bool error;
|
||||
public:
|
||||
Join_plan_state()
|
||||
Join_plan_state(uint tables) : error(0)
|
||||
{
|
||||
keyuse.elements= 0;
|
||||
keyuse.buffer= NULL;
|
||||
best_positions= 0; /* To detect errors */
|
||||
error= my_multi_malloc(MYF(MY_WME),
|
||||
&best_positions,
|
||||
sizeof(*best_positions) * (tables + 1),
|
||||
&join_tab_keyuse,
|
||||
sizeof(*join_tab_keyuse) * tables,
|
||||
&join_tab_checked_keys,
|
||||
sizeof(*join_tab_checked_keys) * tables,
|
||||
&sj_mat_info,
|
||||
sizeof(sj_mat_info) * tables,
|
||||
NullS) == 0;
|
||||
}
|
||||
Join_plan_state(JOIN *join);
|
||||
~Join_plan_state()
|
||||
{
|
||||
delete_dynamic(&keyuse);
|
||||
my_free(best_positions);
|
||||
}
|
||||
};
|
||||
|
||||
|
@ -958,7 +971,7 @@ public:
|
|||
*/
|
||||
ha_rows fetch_limit;
|
||||
/* Finally picked QEP. This is result of join optimization */
|
||||
POSITION best_positions[MAX_TABLES+1];
|
||||
POSITION *best_positions;
|
||||
|
||||
/******* Join optimization state members start *******/
|
||||
/*
|
||||
|
@ -968,7 +981,7 @@ public:
|
|||
TABLE_LIST *emb_sjm_nest;
|
||||
|
||||
/* Current join optimization state */
|
||||
POSITION positions[MAX_TABLES+1];
|
||||
POSITION *positions;
|
||||
|
||||
/*
|
||||
Bitmap of nested joins embedding the position at the end of the current
|
||||
|
@ -1238,6 +1251,7 @@ public:
|
|||
exec_const_cond= 0;
|
||||
group_optimized_away= 0;
|
||||
no_rows_in_result_called= 0;
|
||||
positions= best_positions= 0;
|
||||
|
||||
all_fields= fields_arg;
|
||||
if (&fields_list != &fields_arg) /* Avoid valgrind-warning */
|
||||
|
|
|
@ -3628,16 +3628,17 @@ end:
|
|||
@retval 1 error
|
||||
*/
|
||||
|
||||
static int fill_schema_table_names(THD *thd, TABLE *table,
|
||||
static int fill_schema_table_names(THD *thd, TABLE_LIST *tables,
|
||||
LEX_STRING *db_name, LEX_STRING *table_name,
|
||||
bool with_i_schema)
|
||||
{
|
||||
TABLE *table= tables->table;
|
||||
if (with_i_schema)
|
||||
{
|
||||
table->field[3]->store(STRING_WITH_LEN("SYSTEM VIEW"),
|
||||
system_charset_info);
|
||||
}
|
||||
else
|
||||
else if (tables->table_open_method != SKIP_OPEN_TABLE)
|
||||
{
|
||||
enum legacy_db_type not_used;
|
||||
char path[FN_REFLEN + 1];
|
||||
|
@ -4199,7 +4200,7 @@ int get_all_tables(THD *thd, TABLE_LIST *tables, COND *cond)
|
|||
/* SHOW TABLE NAMES command */
|
||||
if (schema_table_idx == SCH_TABLE_NAMES)
|
||||
{
|
||||
if (fill_schema_table_names(thd, tables->table, db_name,
|
||||
if (fill_schema_table_names(thd, tables, db_name,
|
||||
table_name, with_i_schema))
|
||||
continue;
|
||||
}
|
||||
|
@ -7498,6 +7499,8 @@ bool get_schema_tables_result(JOIN *join,
|
|||
join->error= 1;
|
||||
tab->read_record.table->file= table_list->table->file;
|
||||
table_list->schema_table_state= executed_place;
|
||||
if (!thd->is_error())
|
||||
my_error(ER_UNKNOWN_ERROR, MYF(0));
|
||||
break;
|
||||
}
|
||||
tab->read_record.table->file= table_list->table->file;
|
||||
|
@ -8385,7 +8388,7 @@ ST_SCHEMA_TABLE schema_tables[]=
|
|||
get_all_tables, 0, get_schema_constraints_record, 3, 4, 0,
|
||||
OPTIMIZE_I_S_TABLE|OPEN_TABLE_ONLY},
|
||||
{"TABLE_NAMES", table_names_fields_info, create_schema_table,
|
||||
get_all_tables, make_table_names_old_format, 0, 1, 2, 1, 0},
|
||||
get_all_tables, make_table_names_old_format, 0, 1, 2, 1, OPTIMIZE_I_S_TABLE},
|
||||
{"TABLE_PRIVILEGES", table_privileges_fields_info, create_schema_table,
|
||||
fill_schema_table_privileges, 0, 0, -1, -1, 0, 0},
|
||||
{"TABLE_STATISTICS", table_stats_fields_info, create_schema_table,
|
||||
|
|
|
@ -7274,6 +7274,7 @@ copy_data_between_tables(THD *thd, TABLE *from,TABLE *to,
|
|||
error= 1;
|
||||
break;
|
||||
}
|
||||
if (from->vfield)
|
||||
update_virtual_fields(thd, from);
|
||||
if (++thd->progress.counter >= time_to_report_progress)
|
||||
{
|
||||
|
@ -7301,6 +7302,7 @@ copy_data_between_tables(THD *thd, TABLE *from,TABLE *to,
|
|||
copy_ptr->do_copy(copy_ptr);
|
||||
}
|
||||
prev_insert_id= to->file->next_insert_id;
|
||||
if (to->vfield)
|
||||
update_virtual_fields(thd, to, TRUE);
|
||||
if (thd->is_error())
|
||||
{
|
||||
|
|
|
@ -559,6 +559,7 @@ int mysql_update(THD *thd,
|
|||
|
||||
while (!(error=info.read_record(&info)) && !thd->killed)
|
||||
{
|
||||
if (table->vfield)
|
||||
update_virtual_fields(thd, table);
|
||||
thd->examined_row_count++;
|
||||
if (!select || (error= select->skip_record(thd)) > 0)
|
||||
|
@ -674,6 +675,7 @@ int mysql_update(THD *thd,
|
|||
|
||||
while (!(error=info.read_record(&info)) && !thd->killed)
|
||||
{
|
||||
if (table->vfield)
|
||||
update_virtual_fields(thd, table);
|
||||
thd->examined_row_count++;
|
||||
if (!select || select->skip_record(thd) > 0)
|
||||
|
|
|
@ -6367,8 +6367,7 @@ int update_virtual_fields(THD *thd, TABLE *table, bool for_write)
|
|||
DBUG_ENTER("update_virtual_fields");
|
||||
Field **vfield_ptr, *vfield;
|
||||
int error __attribute__ ((unused))= 0;
|
||||
if (!table || !table->vfield)
|
||||
DBUG_RETURN(0);
|
||||
DBUG_ASSERT(table && table->vfield);
|
||||
|
||||
thd->reset_arena_for_cached_items(table->expr_arena);
|
||||
/* Iterate over virtual fields in the table */
|
||||
|
|
|
@ -303,6 +303,7 @@ typedef struct st_filesort_info
|
|||
{
|
||||
IO_CACHE *io_cache; /* If sorted through filesort */
|
||||
uchar **sort_keys; /* Buffer for sorting keys */
|
||||
uint keys; /* Number of key pointers in buffer */
|
||||
uchar *buffpek; /* Buffer for buffpek structures */
|
||||
uint buffpek_len; /* Max number of buffpeks in the buffer */
|
||||
uchar *addon_buf; /* Pointer to a buffer if sorted with fields */
|
||||
|
|
|
@ -110,8 +110,13 @@ static int check_one_key(HP_KEYDEF *keydef, uint keynr, ulong records,
|
|||
for (i=found=max_links=seek=0 ; i < records ; i++)
|
||||
{
|
||||
hash_info=hp_find_hash(&keydef->block,i);
|
||||
if (hp_mask(hp_rec_hashnr(keydef, hash_info->ptr_to_rec),
|
||||
blength,records) == i)
|
||||
if (hash_info->hash_of_key != hp_rec_hashnr(keydef, hash_info->ptr_to_rec))
|
||||
{
|
||||
DBUG_PRINT("error",
|
||||
("Found row with wrong hash_of_key at position %lu", i));
|
||||
error= 1;
|
||||
}
|
||||
if (hp_mask(hash_info->hash_of_key, blength, records) == i)
|
||||
{
|
||||
found++;
|
||||
seek++;
|
||||
|
@ -119,9 +124,7 @@ static int check_one_key(HP_KEYDEF *keydef, uint keynr, ulong records,
|
|||
while ((hash_info=hash_info->next_key) && found < records + 1)
|
||||
{
|
||||
seek+= ++links;
|
||||
if ((rec_link = hp_mask(hp_rec_hashnr(keydef, hash_info->ptr_to_rec),
|
||||
blength, records))
|
||||
!= i)
|
||||
if ((rec_link= hp_mask(hash_info->hash_of_key, blength, records)) != i)
|
||||
{
|
||||
DBUG_PRINT("error",
|
||||
("Record in wrong link: Link %lu Record: 0x%lx Record-link %lu",
|
||||
|
@ -147,13 +150,13 @@ static int check_one_key(HP_KEYDEF *keydef, uint keynr, ulong records,
|
|||
error=1;
|
||||
}
|
||||
DBUG_PRINT("info",
|
||||
("records: %ld seeks: %lu max links: %lu hitrate: %.2f "
|
||||
"buckets: %lu",
|
||||
records,seek,max_links,
|
||||
("key: %u records: %ld seeks: %lu max links: %lu "
|
||||
"hitrate: %.2f buckets: %lu",
|
||||
keynr, records,seek,max_links,
|
||||
(float) seek / (float) (records ? records : 1),
|
||||
hash_buckets_found));
|
||||
if (print_status)
|
||||
printf("Key: %d records: %ld seeks: %lu max links: %lu "
|
||||
printf("Key: %u records: %ld seeks: %lu max links: %lu "
|
||||
"hitrate: %.2f buckets: %lu\n",
|
||||
keynr, records, seek, max_links,
|
||||
(float) seek / (float) (records ? records : 1),
|
||||
|
|
|
@ -48,6 +48,7 @@ typedef struct st_hp_hash_info
|
|||
{
|
||||
struct st_hp_hash_info *next_key;
|
||||
uchar *ptr_to_rec;
|
||||
ulong hash_of_key;
|
||||
} HASH_INFO;
|
||||
|
||||
typedef struct {
|
||||
|
|
|
@ -250,9 +250,17 @@ static void init_block(HP_BLOCK *block, uint reclength, ulong min_records,
|
|||
max_records= 1000; /* As good as quess as anything */
|
||||
recbuffer= (uint) (reclength + sizeof(uchar**) - 1) & ~(sizeof(uchar**) - 1);
|
||||
records_in_block= max_records / 10;
|
||||
if (records_in_block < 10 && max_records)
|
||||
|
||||
/*
|
||||
We don't want too few records_in_block as otherwise the overhead of
|
||||
of the HP_PTRS block will be too notable
|
||||
*/
|
||||
records_in_block= min(1000, max_records);
|
||||
if (records_in_block < 10)
|
||||
records_in_block= 10;
|
||||
if (!records_in_block || records_in_block*recbuffer >
|
||||
|
||||
/* The + 1 is there to ensure that we get at least 1 row per level */
|
||||
if (records_in_block*recbuffer >
|
||||
(my_default_record_cache_size-sizeof(HP_PTRS)*HP_MAX_LEVELS))
|
||||
records_in_block= (my_default_record_cache_size - sizeof(HP_PTRS) *
|
||||
HP_MAX_LEVELS) / recbuffer + 1;
|
||||
|
|
|
@ -149,8 +149,9 @@ int hp_delete_key(HP_INFO *info, register HP_KEYDEF *keyinfo,
|
|||
else if (pos->next_key)
|
||||
{
|
||||
empty=pos->next_key;
|
||||
pos->ptr_to_rec=empty->ptr_to_rec;
|
||||
pos->next_key=empty->next_key;
|
||||
pos->ptr_to_rec= empty->ptr_to_rec;
|
||||
pos->next_key= empty->next_key;
|
||||
pos->hash_of_key= empty->hash_of_key;
|
||||
}
|
||||
else
|
||||
keyinfo->hash_buckets--;
|
||||
|
@ -159,7 +160,7 @@ int hp_delete_key(HP_INFO *info, register HP_KEYDEF *keyinfo,
|
|||
DBUG_RETURN (0);
|
||||
|
||||
/* Move the last key (lastpos) */
|
||||
lastpos_hashnr = hp_rec_hashnr(keyinfo, lastpos->ptr_to_rec);
|
||||
lastpos_hashnr= lastpos->hash_of_key;
|
||||
/* pos is where lastpos should be */
|
||||
pos=hp_find_hash(&keyinfo->block, hp_mask(lastpos_hashnr, share->blength,
|
||||
share->records));
|
||||
|
@ -168,7 +169,7 @@ int hp_delete_key(HP_INFO *info, register HP_KEYDEF *keyinfo,
|
|||
empty[0]=lastpos[0];
|
||||
DBUG_RETURN(0);
|
||||
}
|
||||
pos_hashnr = hp_rec_hashnr(keyinfo, pos->ptr_to_rec);
|
||||
pos_hashnr= pos->hash_of_key;
|
||||
/* pos3 is where the pos should be */
|
||||
pos3= hp_find_hash(&keyinfo->block,
|
||||
hp_mask(pos_hashnr, share->blength, share->records));
|
||||
|
|
|
@ -148,7 +148,7 @@ uchar *hp_search(HP_INFO *info, HP_KEYDEF *keyinfo, const uchar *key,
|
|||
{
|
||||
flag=0; /* Reset flag */
|
||||
if (hp_find_hash(&keyinfo->block,
|
||||
hp_mask(hp_rec_hashnr(keyinfo, pos->ptr_to_rec),
|
||||
hp_mask(pos->hash_of_key,
|
||||
share->blength, share->records)) != pos)
|
||||
break; /* Wrong link */
|
||||
}
|
||||
|
@ -299,7 +299,9 @@ ulong hp_hashnr(register HP_KEYDEF *keydef, register const uchar *key)
|
|||
}
|
||||
}
|
||||
}
|
||||
#ifdef ONLY_FOR_HASH_DEBUGGING
|
||||
DBUG_PRINT("exit", ("hash: 0x%lx", nr));
|
||||
#endif
|
||||
return((ulong) nr);
|
||||
}
|
||||
|
||||
|
@ -366,7 +368,9 @@ ulong hp_rec_hashnr(register HP_KEYDEF *keydef, register const uchar *rec)
|
|||
}
|
||||
}
|
||||
}
|
||||
#ifdef ONLY_FOR_HASH_DEBUGGING
|
||||
DBUG_PRINT("exit", ("hash: 0x%lx", nr));
|
||||
#endif
|
||||
return(nr);
|
||||
}
|
||||
|
||||
|
@ -437,7 +441,9 @@ ulong hp_hashnr(register HP_KEYDEF *keydef, register const uchar *key)
|
|||
}
|
||||
}
|
||||
}
|
||||
#ifdef ONLY_FOR_HASH_DEBUGGING
|
||||
DBUG_PRINT("exit", ("hash: 0x%lx", nr));
|
||||
#endif
|
||||
return(nr);
|
||||
}
|
||||
|
||||
|
@ -490,7 +496,9 @@ ulong hp_rec_hashnr(register HP_KEYDEF *keydef, register const uchar *rec)
|
|||
}
|
||||
}
|
||||
}
|
||||
#ifdef ONLY_FOR_HASH_DEBUGGING
|
||||
DBUG_PRINT("exit", ("hash: 0x%lx", nr));
|
||||
#endif
|
||||
return(nr);
|
||||
}
|
||||
|
||||
|
|
|
@ -65,7 +65,7 @@ int main(int argc, char *argv[])
|
|||
get_options(argc,argv);
|
||||
|
||||
bzero(&hp_create_info, sizeof(hp_create_info));
|
||||
hp_create_info.max_table_size= 1024L*1024L;
|
||||
hp_create_info.max_table_size= 2*1024L*1024L;
|
||||
hp_create_info.keys= keys;
|
||||
hp_create_info.keydef= keyinfo;
|
||||
hp_create_info.reclength= reclength;
|
||||
|
@ -636,7 +636,7 @@ static int get_options(int argc,char *argv[])
|
|||
case 'V':
|
||||
case 'I':
|
||||
case '?':
|
||||
printf("%s Ver 1.1 for %s at %s\n",progname,SYSTEM_TYPE,MACHINE_TYPE);
|
||||
printf("%s Ver 1.2 for %s at %s\n",progname,SYSTEM_TYPE,MACHINE_TYPE);
|
||||
puts("TCX Datakonsult AB, by Monty, for your professional use\n");
|
||||
printf("Usage: %s [-?ABIKLsWv] [-m#] [-t#]\n",progname);
|
||||
exit(0);
|
||||
|
|
|
@ -152,6 +152,13 @@ static uchar *next_free_record_pos(HP_SHARE *info)
|
|||
if ((info->records > info->max_records && info->max_records) ||
|
||||
(info->data_length + info->index_length >= info->max_table_size))
|
||||
{
|
||||
DBUG_PRINT("error",
|
||||
("record file full. records: %u max_records: %lu "
|
||||
"data_length: %llu index_length: %llu "
|
||||
"max_table_size: %llu",
|
||||
info->records, info->max_records,
|
||||
info->data_length, info->index_length,
|
||||
info->max_table_size));
|
||||
my_errno=HA_ERR_RECORD_FILE_FULL;
|
||||
DBUG_RETURN(NULL);
|
||||
}
|
||||
|
@ -198,6 +205,7 @@ int hp_write_key(HP_INFO *info, HP_KEYDEF *keyinfo,
|
|||
HP_SHARE *share = info->s;
|
||||
int flag;
|
||||
ulong halfbuff,hashnr,first_index;
|
||||
ulong UNINIT_VAR(hash_of_key), UNINIT_VAR(hash_of_key2);
|
||||
uchar *UNINIT_VAR(ptr_to_rec),*UNINIT_VAR(ptr_to_rec2);
|
||||
HASH_INFO *empty,*UNINIT_VAR(gpos),*UNINIT_VAR(gpos2),*pos;
|
||||
DBUG_ENTER("hp_write_key");
|
||||
|
@ -228,7 +236,7 @@ int hp_write_key(HP_INFO *info, HP_KEYDEF *keyinfo,
|
|||
{
|
||||
do
|
||||
{
|
||||
hashnr = hp_rec_hashnr(keyinfo, pos->ptr_to_rec);
|
||||
hashnr = pos->hash_of_key;
|
||||
if (flag == 0)
|
||||
{
|
||||
/*
|
||||
|
@ -260,7 +268,6 @@ int hp_write_key(HP_INFO *info, HP_KEYDEF *keyinfo,
|
|||
flag=LOWFIND | HIGHFIND;
|
||||
/* key shall be moved to the current empty position */
|
||||
gpos=empty;
|
||||
ptr_to_rec=pos->ptr_to_rec;
|
||||
empty=pos; /* This place is now free */
|
||||
}
|
||||
else
|
||||
|
@ -271,7 +278,6 @@ int hp_write_key(HP_INFO *info, HP_KEYDEF *keyinfo,
|
|||
*/
|
||||
flag=LOWFIND | LOWUSED;
|
||||
gpos=pos;
|
||||
ptr_to_rec=pos->ptr_to_rec;
|
||||
}
|
||||
}
|
||||
else
|
||||
|
@ -280,13 +286,15 @@ int hp_write_key(HP_INFO *info, HP_KEYDEF *keyinfo,
|
|||
if (!(flag & LOWUSED))
|
||||
{
|
||||
/* Change link of previous lower-list key */
|
||||
gpos->ptr_to_rec=ptr_to_rec;
|
||||
gpos->next_key=pos;
|
||||
gpos->ptr_to_rec= ptr_to_rec;
|
||||
gpos->next_key= pos;
|
||||
gpos->hash_of_key= hash_of_key;
|
||||
flag= (flag & HIGHFIND) | (LOWFIND | LOWUSED);
|
||||
}
|
||||
gpos=pos;
|
||||
ptr_to_rec=pos->ptr_to_rec;
|
||||
}
|
||||
ptr_to_rec= pos->ptr_to_rec;
|
||||
hash_of_key= pos->hash_of_key;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -297,20 +305,21 @@ int hp_write_key(HP_INFO *info, HP_KEYDEF *keyinfo,
|
|||
/* key shall be moved to the last (empty) position */
|
||||
gpos2= empty;
|
||||
empty= pos;
|
||||
ptr_to_rec2=pos->ptr_to_rec;
|
||||
}
|
||||
else
|
||||
{
|
||||
if (!(flag & HIGHUSED))
|
||||
{
|
||||
/* Change link of previous upper-list key and save */
|
||||
gpos2->ptr_to_rec=ptr_to_rec2;
|
||||
gpos2->next_key=pos;
|
||||
gpos2->ptr_to_rec= ptr_to_rec2;
|
||||
gpos2->next_key= pos;
|
||||
gpos2->hash_of_key= hash_of_key2;
|
||||
flag= (flag & LOWFIND) | (HIGHFIND | HIGHUSED);
|
||||
}
|
||||
gpos2=pos;
|
||||
ptr_to_rec2=pos->ptr_to_rec;
|
||||
}
|
||||
ptr_to_rec2= pos->ptr_to_rec;
|
||||
hash_of_key2= pos->hash_of_key;
|
||||
}
|
||||
}
|
||||
while ((pos=pos->next_key));
|
||||
|
@ -326,23 +335,27 @@ int hp_write_key(HP_INFO *info, HP_KEYDEF *keyinfo,
|
|||
|
||||
if ((flag & (LOWFIND | LOWUSED)) == LOWFIND)
|
||||
{
|
||||
gpos->ptr_to_rec=ptr_to_rec;
|
||||
gpos->next_key=0;
|
||||
gpos->ptr_to_rec= ptr_to_rec;
|
||||
gpos->hash_of_key= hash_of_key;
|
||||
gpos->next_key= 0;
|
||||
}
|
||||
if ((flag & (HIGHFIND | HIGHUSED)) == HIGHFIND)
|
||||
{
|
||||
gpos2->ptr_to_rec=ptr_to_rec2;
|
||||
gpos2->next_key=0;
|
||||
gpos2->ptr_to_rec= ptr_to_rec2;
|
||||
gpos2->hash_of_key= hash_of_key2;
|
||||
gpos2->next_key= 0;
|
||||
}
|
||||
}
|
||||
/* Check if we are at the empty position */
|
||||
|
||||
pos=hp_find_hash(&keyinfo->block, hp_mask(hp_rec_hashnr(keyinfo, record),
|
||||
share->blength, share->records + 1));
|
||||
hash_of_key= hp_rec_hashnr(keyinfo, record);
|
||||
pos=hp_find_hash(&keyinfo->block,
|
||||
hp_mask(hash_of_key, share->blength, share->records + 1));
|
||||
if (pos == empty)
|
||||
{
|
||||
pos->ptr_to_rec=recpos;
|
||||
pos->next_key=0;
|
||||
pos->ptr_to_rec= recpos;
|
||||
pos->hash_of_key= hash_of_key;
|
||||
pos->next_key= 0;
|
||||
keyinfo->hash_buckets++;
|
||||
}
|
||||
else
|
||||
|
@ -350,18 +363,17 @@ int hp_write_key(HP_INFO *info, HP_KEYDEF *keyinfo,
|
|||
/* Check if more records in same hash-nr family */
|
||||
empty[0]=pos[0];
|
||||
gpos=hp_find_hash(&keyinfo->block,
|
||||
hp_mask(hp_rec_hashnr(keyinfo, pos->ptr_to_rec),
|
||||
hp_mask(pos->hash_of_key,
|
||||
share->blength, share->records + 1));
|
||||
|
||||
pos->ptr_to_rec= recpos;
|
||||
pos->hash_of_key= hash_of_key;
|
||||
if (pos == gpos)
|
||||
{
|
||||
pos->ptr_to_rec=recpos;
|
||||
pos->next_key=empty;
|
||||
}
|
||||
else
|
||||
{
|
||||
keyinfo->hash_buckets++;
|
||||
pos->ptr_to_rec=recpos;
|
||||
pos->next_key=0;
|
||||
pos->next_key= 0;
|
||||
hp_movelink(pos, gpos, empty);
|
||||
}
|
||||
|
||||
|
|
|
@ -2797,7 +2797,7 @@ retry:
|
|||
"InnoDB: Check also that the disk is not full"
|
||||
" or a disk quota exceeded.\n",
|
||||
name, (ulong) offset_high, (ulong) offset,
|
||||
(ulong) n, (ulong) len, (ulong) err);
|
||||
(ulong) n, ret ? len : 0, (ulong) err);
|
||||
|
||||
if (strerror((int)err) != NULL) {
|
||||
fprintf(stderr,
|
||||
|
|
|
@ -1340,11 +1340,12 @@ int _ma_update_state_lsns(MARIA_SHARE *share, LSN lsn, TrID create_trid,
|
|||
my_bool do_sync, my_bool update_create_rename_lsn)
|
||||
{
|
||||
int res;
|
||||
DBUG_ENTER("_ma_update_state_lsns");
|
||||
mysql_mutex_lock(&share->intern_lock);
|
||||
res= _ma_update_state_lsns_sub(share, lsn, create_trid, do_sync,
|
||||
update_create_rename_lsn);
|
||||
mysql_mutex_unlock(&share->intern_lock);
|
||||
return res;
|
||||
DBUG_RETURN(res);
|
||||
}
|
||||
|
||||
|
||||
|
|
|
@ -2904,7 +2904,7 @@ retry:
|
|||
"InnoDB: Check also that the disk is not full"
|
||||
" or a disk quota exceeded.\n",
|
||||
name, (ulong) offset_high, (ulong) offset,
|
||||
(ulong) n, (ulong) len, (ulong) err);
|
||||
(ulong) n, ret ? len : 0, (ulong) err);
|
||||
|
||||
if (strerror((int)err) != NULL) {
|
||||
fprintf(stderr,
|
||||
|
|
Loading…
Reference in a new issue