Merge acurtis@bk-internal:/home/bk/mysql-5.0-engines

into  xiphis.org:/home/antony/work2/mysql-5.0-engines.merge
parents 09cfc052 ccbdbe57
...@@ -12355,3 +12355,12 @@ auto fld1 companynr fld3 fld4 fld5 ...@@ -12355,3 +12355,12 @@ auto fld1 companynr fld3 fld4 fld5
4 011403 37 intercepted audiology tinily 4 011403 37 intercepted audiology tinily
4 011403 37 intercepted audiology tinily 4 011403 37 intercepted audiology tinily
drop table t1, t2, t4; drop table t1, t2, t4;
create table t1 (i int) engine=archive;
insert into t1 values (1);
repair table t1 use_frm;
Table Op Msg_type Msg_text
test.t1 repair status OK
select * from t1;
i
1
drop table t1;
...@@ -90,3 +90,10 @@ id link name relevance ...@@ -90,3 +90,10 @@ id link name relevance
1 1 string 0 1 1 string 0
2 0 string 0 2 0 string 0
DROP TABLE t1,t2; DROP TABLE t1,t2;
CREATE TABLE t1 (a INT);
CREATE TABLE t2 (b INT, c TEXT, KEY(b));
INSERT INTO t1 VALUES(1);
INSERT INTO t2(b,c) VALUES(2,'castle'),(3,'castle');
SELECT * FROM t1 LEFT JOIN t2 ON a=b WHERE MATCH(c) AGAINST('+castle' IN BOOLEAN MODE);
a b c
DROP TABLE t1, t2;
...@@ -1364,3 +1364,13 @@ SELECT * from t2; ...@@ -1364,3 +1364,13 @@ SELECT * from t2;
drop table t1, t2, t4; drop table t1, t2, t4;
#
# BUG#26138 - REPAIR TABLE with option USE_FRM erases all records in ARCHIVE
# table
#
create table t1 (i int) engine=archive;
insert into t1 values (1);
repair table t1 use_frm;
select * from t1;
drop table t1;
...@@ -87,3 +87,14 @@ SELECT t1.*, MATCH(t1.name) AGAINST('string') AS relevance ...@@ -87,3 +87,14 @@ SELECT t1.*, MATCH(t1.name) AGAINST('string') AS relevance
DROP TABLE t1,t2; DROP TABLE t1,t2;
# End of 4.1 tests # End of 4.1 tests
#
# BUG#25729 - boolean full text search is confused by NULLs produced by LEFT
# JOIN
#
CREATE TABLE t1 (a INT);
CREATE TABLE t2 (b INT, c TEXT, KEY(b));
INSERT INTO t1 VALUES(1);
INSERT INTO t2(b,c) VALUES(2,'castle'),(3,'castle');
SELECT * FROM t1 LEFT JOIN t2 ON a=b WHERE MATCH(c) AGAINST('+castle' IN BOOLEAN MODE);
DROP TABLE t1, t2;
...@@ -211,6 +211,12 @@ ha_example::ha_example(TABLE *table_arg) ...@@ -211,6 +211,12 @@ ha_example::ha_example(TABLE *table_arg)
If frm_error() is called then we will use this to to find out what file extentions If frm_error() is called then we will use this to to find out what file extentions
exist for the storage engine. This is also used by the default rename_table and exist for the storage engine. This is also used by the default rename_table and
delete_table method in handler.cc. delete_table method in handler.cc.
For engines that have two file name extentions (separate meta/index file
and data file), the order of elements is relevant. First element of engine
file name extentions array should be meta/index file extention. Second
element - data file extention. This order is assumed by
prepare_for_repair() when REPAIR TABLE ... USE_FRM is issued.
*/ */
static const char *ha_example_exts[] = { static const char *ha_example_exts[] = {
NullS NullS
......
...@@ -503,8 +503,8 @@ int ha_archive::init_archive_writer() ...@@ -503,8 +503,8 @@ int ha_archive::init_archive_writer()
We just implement one additional file extension. We just implement one additional file extension.
*/ */
static const char *ha_archive_exts[] = { static const char *ha_archive_exts[] = {
ARZ,
ARM, ARM,
ARZ,
NullS NullS
}; };
......
...@@ -780,6 +780,17 @@ public: ...@@ -780,6 +780,17 @@ public:
virtual void free_foreign_key_create_info(char* str) {} virtual void free_foreign_key_create_info(char* str) {}
/* The following can be called without an open handler */ /* The following can be called without an open handler */
virtual const char *table_type() const =0; virtual const char *table_type() const =0;
/*
If frm_error() is called then we will use this to find out what file
extentions exist for the storage engine. This is also used by the default
rename_table and delete_table method in handler.cc.
For engines that have two file name extentions (separate meta/index file
and data file), the order of elements is relevant. First element of engine
file name extentions array should be meta/index file extention. Second
element - data file extention. This order is assumed by
prepare_for_repair() when REPAIR TABLE ... USE_FRM is issued.
*/
virtual const char **bas_ext() const =0; virtual const char **bas_ext() const =0;
virtual ulong table_flags(void) const =0; virtual ulong table_flags(void) const =0;
virtual ulong index_flags(uint idx, uint part, bool all_parts) const =0; virtual ulong index_flags(uint idx, uint part, bool all_parts) const =0;
......
...@@ -4615,14 +4615,14 @@ void Item_func_match::init_search(bool no_order) ...@@ -4615,14 +4615,14 @@ void Item_func_match::init_search(bool no_order)
fields.push_back(new Item_string(" ",1, cmp_collation.collation)); fields.push_back(new Item_string(" ",1, cmp_collation.collation));
for (uint i=1; i < arg_count; i++) for (uint i=1; i < arg_count; i++)
fields.push_back(args[i]); fields.push_back(args[i]);
concat=new Item_func_concat_ws(fields); concat_ws=new Item_func_concat_ws(fields);
/* /*
Above function used only to get value and do not need fix_fields for it: Above function used only to get value and do not need fix_fields for it:
Item_string - basic constant Item_string - basic constant
fields - fix_fields() was already called for this arguments fields - fix_fields() was already called for this arguments
Item_func_concat_ws - do not need fix_fields() to produce value Item_func_concat_ws - do not need fix_fields() to produce value
*/ */
concat->quick_fix_field(); concat_ws->quick_fix_field();
} }
if (master) if (master)
...@@ -4837,8 +4837,8 @@ double Item_func_match::val_real() ...@@ -4837,8 +4837,8 @@ double Item_func_match::val_real()
if (key == NO_SUCH_KEY) if (key == NO_SUCH_KEY)
{ {
String *a= concat->val_str(&value); String *a= concat_ws->val_str(&value);
if ((null_value= (a == 0))) if ((null_value= (a == 0)) || !a->length())
DBUG_RETURN(0); DBUG_RETURN(0);
DBUG_RETURN(ft_handler->please->find_relevance(ft_handler, DBUG_RETURN(ft_handler->please->find_relevance(ft_handler,
(byte *)a->ptr(), a->length())); (byte *)a->ptr(), a->length()));
......
...@@ -1308,12 +1308,12 @@ public: ...@@ -1308,12 +1308,12 @@ public:
FT_INFO *ft_handler; FT_INFO *ft_handler;
TABLE *table; TABLE *table;
Item_func_match *master; // for master-slave optimization Item_func_match *master; // for master-slave optimization
Item *concat; // Item_func_concat_ws Item *concat_ws; // Item_func_concat_ws
String value; // value of concat String value; // value of concat_ws
String search_value; // key_item()'s value converted to cmp_collation String search_value; // key_item()'s value converted to cmp_collation
Item_func_match(List<Item> &a, uint b): Item_real_func(a), key(0), flags(b), Item_func_match(List<Item> &a, uint b): Item_real_func(a), key(0), flags(b),
join_key(0), ft_handler(0), table(0), master(0), concat(0) { } join_key(0), ft_handler(0), table(0), master(0), concat_ws(0) { }
void cleanup() void cleanup()
{ {
DBUG_ENTER("Item_func_match"); DBUG_ENTER("Item_func_match");
...@@ -1321,7 +1321,7 @@ public: ...@@ -1321,7 +1321,7 @@ public:
if (!master && ft_handler) if (!master && ft_handler)
ft_handler->please->close_search(ft_handler); ft_handler->please->close_search(ft_handler);
ft_handler= 0; ft_handler= 0;
concat= 0; concat_ws= 0;
DBUG_VOID_RETURN; DBUG_VOID_RETURN;
} }
enum Functype functype() const { return FT_FUNC; } enum Functype functype() const { return FT_FUNC; }
......
...@@ -2068,7 +2068,9 @@ static int prepare_for_repair(THD* thd, TABLE_LIST *table_list, ...@@ -2068,7 +2068,9 @@ static int prepare_for_repair(THD* thd, TABLE_LIST *table_list,
/* /*
Check if this is a table type that stores index and data separately, Check if this is a table type that stores index and data separately,
like ISAM or MyISAM like ISAM or MyISAM. We assume fixed order of engine file name
extentions array. First element of engine file name extentions array
is meta/index file extention. Second element - data file extention.
*/ */
if (!ext[0] || !ext[1]) if (!ext[0] || !ext[1])
goto end; // No data file goto end; // No data file
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment