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
b4a0cdb8
Commit
b4a0cdb8
authored
Mar 19, 2003
by
unknown
Browse files
Options
Browse Files
Download
Plain Diff
Merge mysql.com:/space/my/mysql-4.0
into mysql.com:/space/my/mysql-4.0-build
parents
f04be0b9
cd4d7716
Changes
16
Show whitespace changes
Inline
Side-by-side
Showing
16 changed files
with
429 additions
and
50 deletions
+429
-50
innobase/row/row0mysql.c
innobase/row/row0mysql.c
+1
-1
mysql-test/r/heap.result
mysql-test/r/heap.result
+1
-1
mysql-test/r/innodb.result
mysql-test/r/innodb.result
+111
-1
mysql-test/r/multi_update.result
mysql-test/r/multi_update.result
+64
-0
mysql-test/t/heap.test
mysql-test/t/heap.test
+1
-1
mysql-test/t/innodb.test
mysql-test/t/innodb.test
+72
-1
mysql-test/t/multi_update.test
mysql-test/t/multi_update.test
+28
-0
sql/ha_innodb.h
sql/ha_innodb.h
+1
-2
sql/ha_myisam.cc
sql/ha_myisam.cc
+30
-0
sql/handler.h
sql/handler.h
+0
-1
sql/key.cc
sql/key.cc
+8
-0
sql/lex.h
sql/lex.h
+1
-0
sql/sql_test.cc
sql/sql_test.cc
+1
-1
sql/sql_update.cc
sql/sql_update.cc
+105
-41
sql/sql_yacc.yy
sql/sql_yacc.yy
+3
-0
strings/strto.c
strings/strto.c
+2
-0
No files found.
innobase/row/row0mysql.c
View file @
b4a0cdb8
mysql-test/r/heap.result
View file @
b4a0cdb8
...
...
@@ -23,7 +23,7 @@ a b
4 6
alter table t1 add c int not null, add key (c,a);
drop table t1;
create table t1 (a int not null,b int not null, primary key (a)) type=
heap
comment="testing heaps";
create table t1 (a int not null,b int not null, primary key (a)) type=
memory
comment="testing heaps";
insert into t1 values(1,1),(2,2),(3,3),(4,4);
delete from t1 where a > 0;
select * from t1;
...
...
mysql-test/r/innodb.result
View file @
b4a0cdb8
drop table if exists t1,t2;
drop table if exists t1,t2
,t3
;
create table t1 (id int unsigned not null auto_increment, code tinyint unsigned not null, name char(20) not null, primary key (id), key (code), unique (name)) type=innodb;
insert into t1 (code, name) values (1, 'Tim'), (1, 'Monty'), (2, 'David'), (2, 'Erik'), (3, 'Sasha'), (3, 'Jeremy'), (4, 'Matt');
select id, code, name from t1 order by id;
...
...
@@ -1091,3 +1091,113 @@ SELECT * from t1;
id
3
DROP TABLE t1,t2;
set autocommit=0;
CREATE TABLE t1 (id CHAR(15) NOT NULL, value CHAR(40) NOT NULL, PRIMARY KEY(id)) TYPE=InnoDB;
CREATE TABLE t2 (id CHAR(15) NOT NULL, value CHAR(40) NOT NULL, PRIMARY KEY(id)) TYPE=InnoDB;
CREATE TABLE t3 (id1 CHAR(15) NOT NULL, id2 CHAR(15) NOT NULL, PRIMARY KEY(id1, id2)) TYPE=InnoDB;
INSERT INTO t3 VALUES("my-test-1", "my-test-2");
COMMIT;
INSERT INTO t1 VALUES("this-key", "will disappear");
INSERT INTO t2 VALUES("this-key", "will also disappear");
DELETE FROM t3 WHERE id1="my-test-1";
SELECT * FROM t1;
id value
this-key will disappear
SELECT * FROM t2;
id value
this-key will also disappear
SELECT * FROM t3;
id1 id2
ROLLBACK;
SELECT * FROM t1;
id value
SELECT * FROM t2;
id value
SELECT * FROM t3;
id1 id2
my-test-1 my-test-2
SELECT * FROM t3 WHERE id1="my-test-1" LOCK IN SHARE MODE;
id1 id2
my-test-1 my-test-2
COMMIT;
set autocommit=1;
DROP TABLE t1,t2,t3;
CREATE TABLE t1 (a int not null primary key, b int not null, unique (b)) type=innodb;
INSERT INTO t1 values (1,1),(2,2),(3,3),(4,4),(5,5),(6,6),(7,7),(8,8),(9,9);
UPDATE t1 set a=a+100 where b between 2 and 3 and a < 1000;
SELECT * from t1;
a b
1 1
102 2
103 3
4 4
5 5
6 6
7 7
8 8
9 9
drop table t1;
CREATE TABLE t1 (a int not null primary key, b int not null, key (b)) type=innodb;
CREATE TABLE t2 (a int not null primary key, b int not null, key (b)) type=innodb;
INSERT INTO t1 values (1,1),(2,2),(3,3),(4,4),(5,5),(6,6),(7,7),(8,8),(9,9);
INSERT INTO t2 values (1,1),(2,2),(3,3),(4,4),(5,5),(6,6),(7,7),(8,8),(9,9);
update t1,t2 set t1.a=t1.a+100;
select * from t1;
a b
101 1
102 2
103 3
104 4
105 5
106 6
107 7
108 8
109 9
update t1,t2 set t1.a=t1.a+100 where t1.a=101;
select * from t1;
a b
201 1
102 2
103 3
104 4
105 5
106 6
107 7
108 8
109 9
update t1,t2 set t1.b=t1.b+10 where t1.b=2;
select * from t1;
a b
201 1
103 3
104 4
105 5
106 6
107 7
108 8
109 9
102 12
update t1,t2 set t1.b=t1.b+2,t2.b=t1.b where t1.b between 3 and 5;
select * from t1;
a b
201 1
103 5
104 6
106 6
105 7
107 7
108 8
109 9
102 12
select * from t2;
a b
1 5
2 5
3 5
4 5
5 5
6 5
7 5
8 5
9 5
drop table t1,t2;
mysql-test/r/multi_update.result
View file @
b4a0cdb8
...
...
@@ -246,3 +246,67 @@ INSERT INTO t3 VALUES (1,'jedan'),(2,'dva');
update t1,t2 set t1.naziv="aaaa" where t1.broj=t2.broj;
update t1,t2,t3 set t1.naziv="bbbb", t2.naziv="aaaa" where t1.broj=t2.broj and t2.broj=t3.broj;
drop table if exists t1,t2,t3;
CREATE TABLE t1 (a int not null primary key, b int not null, key (b));
CREATE TABLE t2 (a int not null primary key, b int not null, key (b));
INSERT INTO t1 values (1,1),(2,2),(3,3),(4,4),(5,5),(6,6),(7,7),(8,8),(9,9);
INSERT INTO t2 values (1,1),(2,2),(3,3),(4,4),(5,5),(6,6),(7,7),(8,8),(9,9);
update t1,t2 set t1.a=t1.a+100;
select * from t1;
a b
101 1
102 2
103 3
104 4
105 5
106 6
107 7
108 8
109 9
update t1,t2 set t1.a=t1.a+100 where t1.a=101;
select * from t1;
a b
201 1
102 2
103 3
104 4
105 5
106 6
107 7
108 8
109 9
update t1,t2 set t1.b=t1.b+10 where t1.b=2;
select * from t1;
a b
201 1
102 12
103 3
104 4
105 5
106 6
107 7
108 8
109 9
update t1,t2 set t1.b=t1.b+2,t2.b=t1.b where t1.b between 3 and 5;
select * from t1;
a b
201 1
102 12
103 5
104 6
105 7
106 6
107 7
108 8
109 9
select * from t2;
a b
1 3
2 3
3 3
4 3
5 3
6 3
7 3
8 3
9 3
drop table t1,t2;
mysql-test/t/heap.test
View file @
b4a0cdb8
...
...
@@ -17,7 +17,7 @@ select * from t1;
alter
table
t1
add
c
int
not
null
,
add
key
(
c
,
a
);
drop
table
t1
;
create
table
t1
(
a
int
not
null
,
b
int
not
null
,
primary
key
(
a
))
type
=
heap
comment
=
"testing heaps"
;
create
table
t1
(
a
int
not
null
,
b
int
not
null
,
primary
key
(
a
))
type
=
memory
comment
=
"testing heaps"
;
insert
into
t1
values
(
1
,
1
),(
2
,
2
),(
3
,
3
),(
4
,
4
);
delete
from
t1
where
a
>
0
;
select
*
from
t1
;
...
...
mysql-test/t/innodb.test
View file @
b4a0cdb8
...
...
@@ -4,7 +4,7 @@
# Small basic test with ignore
#
drop
table
if
exists
t1
,
t2
;
drop
table
if
exists
t1
,
t2
,
t3
;
create
table
t1
(
id
int
unsigned
not
null
auto_increment
,
code
tinyint
unsigned
not
null
,
name
char
(
20
)
not
null
,
primary
key
(
id
),
key
(
code
),
unique
(
name
))
type
=
innodb
;
insert
into
t1
(
code
,
name
)
values
(
1
,
'Tim'
),
(
1
,
'Monty'
),
(
2
,
'David'
),
(
2
,
'Erik'
),
(
3
,
'Sasha'
),
(
3
,
'Jeremy'
),
(
4
,
'Matt'
);
...
...
@@ -726,3 +726,74 @@ SELECT * from t1;
UPDATE
t1
,
t2
SET
t1
.
id
=
t1
.
id
+
1
where
t1
.
id
!=
t2
.
id
;
SELECT
*
from
t1
;
DROP
TABLE
t1
,
t2
;
#
# Test of range_optimizer
#
set
autocommit
=
0
;
CREATE
TABLE
t1
(
id
CHAR
(
15
)
NOT
NULL
,
value
CHAR
(
40
)
NOT
NULL
,
PRIMARY
KEY
(
id
))
TYPE
=
InnoDB
;
CREATE
TABLE
t2
(
id
CHAR
(
15
)
NOT
NULL
,
value
CHAR
(
40
)
NOT
NULL
,
PRIMARY
KEY
(
id
))
TYPE
=
InnoDB
;
CREATE
TABLE
t3
(
id1
CHAR
(
15
)
NOT
NULL
,
id2
CHAR
(
15
)
NOT
NULL
,
PRIMARY
KEY
(
id1
,
id2
))
TYPE
=
InnoDB
;
INSERT
INTO
t3
VALUES
(
"my-test-1"
,
"my-test-2"
);
COMMIT
;
INSERT
INTO
t1
VALUES
(
"this-key"
,
"will disappear"
);
INSERT
INTO
t2
VALUES
(
"this-key"
,
"will also disappear"
);
DELETE
FROM
t3
WHERE
id1
=
"my-test-1"
;
SELECT
*
FROM
t1
;
SELECT
*
FROM
t2
;
SELECT
*
FROM
t3
;
ROLLBACK
;
SELECT
*
FROM
t1
;
SELECT
*
FROM
t2
;
SELECT
*
FROM
t3
;
SELECT
*
FROM
t3
WHERE
id1
=
"my-test-1"
LOCK
IN
SHARE
MODE
;
COMMIT
;
set
autocommit
=
1
;
DROP
TABLE
t1
,
t2
,
t3
;
#
# Check update with conflicting key
#
CREATE
TABLE
t1
(
a
int
not
null
primary
key
,
b
int
not
null
,
unique
(
b
))
type
=
innodb
;
INSERT
INTO
t1
values
(
1
,
1
),(
2
,
2
),(
3
,
3
),(
4
,
4
),(
5
,
5
),(
6
,
6
),(
7
,
7
),(
8
,
8
),(
9
,
9
);
# We need the a < 1000 test here to quard against the halloween problems
UPDATE
t1
set
a
=
a
+
100
where
b
between
2
and
3
and
a
<
1000
;
SELECT
*
from
t1
;
drop
table
t1
;
#
# Test multi update with different join methods
#
CREATE
TABLE
t1
(
a
int
not
null
primary
key
,
b
int
not
null
,
key
(
b
))
type
=
innodb
;
CREATE
TABLE
t2
(
a
int
not
null
primary
key
,
b
int
not
null
,
key
(
b
))
type
=
innodb
;
INSERT
INTO
t1
values
(
1
,
1
),(
2
,
2
),(
3
,
3
),(
4
,
4
),(
5
,
5
),(
6
,
6
),(
7
,
7
),(
8
,
8
),(
9
,
9
);
INSERT
INTO
t2
values
(
1
,
1
),(
2
,
2
),(
3
,
3
),(
4
,
4
),(
5
,
5
),(
6
,
6
),(
7
,
7
),(
8
,
8
),(
9
,
9
);
# Full join, without key
update
t1
,
t2
set
t1
.
a
=
t1
.
a
+
100
;
select
*
from
t1
;
# unique key
update
t1
,
t2
set
t1
.
a
=
t1
.
a
+
100
where
t1
.
a
=
101
;
select
*
from
t1
;
# ref key
update
t1
,
t2
set
t1
.
b
=
t1
.
b
+
10
where
t1
.
b
=
2
;
select
*
from
t1
;
# Range key (in t1)
update
t1
,
t2
set
t1
.
b
=
t1
.
b
+
2
,
t2
.
b
=
t1
.
b
where
t1
.
b
between
3
and
5
;
select
*
from
t1
;
select
*
from
t2
;
drop
table
t1
,
t2
;
mysql-test/t/multi_update.test
View file @
b4a0cdb8
...
...
@@ -224,3 +224,31 @@ INSERT INTO t3 VALUES (1,'jedan'),(2,'dva');
update
t1
,
t2
set
t1
.
naziv
=
"aaaa"
where
t1
.
broj
=
t2
.
broj
;
update
t1
,
t2
,
t3
set
t1
.
naziv
=
"bbbb"
,
t2
.
naziv
=
"aaaa"
where
t1
.
broj
=
t2
.
broj
and
t2
.
broj
=
t3
.
broj
;
drop
table
if
exists
t1
,
t2
,
t3
;
#
# Test multi update with different join methods
#
CREATE
TABLE
t1
(
a
int
not
null
primary
key
,
b
int
not
null
,
key
(
b
));
CREATE
TABLE
t2
(
a
int
not
null
primary
key
,
b
int
not
null
,
key
(
b
));
INSERT
INTO
t1
values
(
1
,
1
),(
2
,
2
),(
3
,
3
),(
4
,
4
),(
5
,
5
),(
6
,
6
),(
7
,
7
),(
8
,
8
),(
9
,
9
);
INSERT
INTO
t2
values
(
1
,
1
),(
2
,
2
),(
3
,
3
),(
4
,
4
),(
5
,
5
),(
6
,
6
),(
7
,
7
),(
8
,
8
),(
9
,
9
);
# Full join, without key
update
t1
,
t2
set
t1
.
a
=
t1
.
a
+
100
;
select
*
from
t1
;
# unique key
update
t1
,
t2
set
t1
.
a
=
t1
.
a
+
100
where
t1
.
a
=
101
;
select
*
from
t1
;
# ref key
update
t1
,
t2
set
t1
.
b
=
t1
.
b
+
10
where
t1
.
b
=
2
;
select
*
from
t1
;
# Range key (in t1)
update
t1
,
t2
set
t1
.
b
=
t1
.
b
+
2
,
t2
.
b
=
t1
.
b
where
t1
.
b
between
3
and
5
;
select
*
from
t1
;
select
*
from
t2
;
drop
table
t1
,
t2
;
sql/ha_innodb.h
View file @
b4a0cdb8
...
...
@@ -82,8 +82,7 @@ class ha_innobase: public handler
HA_PRIMARY_KEY_IN_READ_INDEX
|
HA_DROP_BEFORE_CREATE
|
HA_NO_PREFIX_CHAR_KEYS
|
HA_TABLE_SCAN_ON_INDEX
|
HA_NOT_MULTI_UPDATE
),
HA_TABLE_SCAN_ON_INDEX
),
last_dup_key
((
uint
)
-
1
),
start_of_scan
(
0
)
{
...
...
sql/ha_myisam.cc
View file @
b4a0cdb8
...
...
@@ -1242,6 +1242,35 @@ longlong ha_myisam::get_auto_increment()
}
/*
Find out how many rows there is in the given range
SYNOPSIS
records_in_range()
inx Index to use
start_key Start of range. Null pointer if from first key
start_key_len Length of start key
start_search_flag Flag if start key should be included or not
end_key End of range. Null pointer if to last key
end_key_len Length of end key
end_search_flag Flag if start key should be included or not
NOTES
start_search_flag can have one of the following values:
HA_READ_KEY_EXACT Include the key in the range
HA_READ_AFTER_KEY Don't include key in range
end_search_flag can have one of the following values:
HA_READ_BEFORE_KEY Don't include key in range
HA_READ_AFTER_KEY Include all 'end_key' values in the range
RETURN
HA_POS_ERROR Something is wrong with the index tree.
0 There is no matching keys in the given range
number > 0 There is approximately 'number' matching rows in
the range.
*/
ha_rows
ha_myisam
::
records_in_range
(
int
inx
,
const
byte
*
start_key
,
uint
start_key_len
,
enum
ha_rkey_function
start_search_flag
,
...
...
@@ -1256,6 +1285,7 @@ ha_rows ha_myisam::records_in_range(int inx,
end_search_flag
);
}
int
ha_myisam
::
ft_read
(
byte
*
buf
)
{
int
error
;
...
...
sql/handler.h
View file @
b4a0cdb8
...
...
@@ -67,7 +67,6 @@
#define HA_CAN_FULLTEXT (HA_NO_PREFIX_CHAR_KEYS*2)
#define HA_CAN_SQL_HANDLER (HA_CAN_FULLTEXT*2)
#define HA_NO_AUTO_INCREMENT (HA_CAN_SQL_HANDLER*2)
#define HA_NOT_MULTI_UPDATE (HA_NO_AUTO_INCREMENT*2)
/*
Next record gives next record according last record read (even
...
...
sql/key.cc
View file @
b4a0cdb8
...
...
@@ -269,5 +269,13 @@ bool check_if_key_used(TABLE *table, uint idx, List<Item> &fields)
return
1
;
}
}
/*
If table handler has primary key as part of the index, check that primary
key is not updated
*/
if
(
idx
!=
table
->
primary_key
&&
table
->
primary_key
<
MAX_KEY
&&
(
table
->
file
->
table_flags
()
&
HA_PRIMARY_KEY_IN_READ_INDEX
))
return
check_if_key_used
(
table
,
table
->
primary_key
,
fields
);
return
0
;
}
sql/lex.h
View file @
b4a0cdb8
...
...
@@ -240,6 +240,7 @@ static SYMBOL symbols[] = {
{
"MEDIUMINT"
,
SYM
(
MEDIUMINT
),
0
,
0
},
{
"MERGE"
,
SYM
(
MERGE_SYM
),
0
,
0
},
{
"MEDIUM"
,
SYM
(
MEDIUM_SYM
),
0
,
0
},
{
"MEMORY"
,
SYM
(
MEMORY_SYM
),
0
,
0
},
{
"MIDDLEINT"
,
SYM
(
MEDIUMINT
),
0
,
0
},
/* For powerbuilder */
{
"MIN_ROWS"
,
SYM
(
MIN_ROWS
),
0
,
0
},
{
"MINUTE"
,
SYM
(
MINUTE_SYM
),
0
,
0
},
...
...
sql/sql_test.cc
View file @
b4a0cdb8
...
...
@@ -131,7 +131,7 @@ void TEST_filesort(SORT_FIELD *sortorder,uint s_length, ha_rows special)
DBUG_LOCK_FILE
;
VOID
(
fputs
(
"
\n
Info about FILESORT
\n
"
,
DBUG_FILE
));
if
(
special
)
fprintf
(
DBUG_FILE
,
"Records to sort: %l
d
\n
"
,
special
);
fprintf
(
DBUG_FILE
,
"Records to sort: %l
u
\n
"
,(
ulong
)
special
);
fprintf
(
DBUG_FILE
,
"Sortorder: %s
\n
"
,
out
.
ptr
());
DBUG_UNLOCK_FILE
;
DBUG_VOID_RETURN
;
...
...
sql/sql_update.cc
View file @
b4a0cdb8
...
...
@@ -23,6 +23,8 @@
#include "sql_acl.h"
#include "sql_select.h"
static
bool
safe_update_on_fly
(
JOIN_TAB
*
join_tab
,
List
<
Item
>
*
fields
);
/* Return 0 if row hasn't changed */
static
bool
compare_record
(
TABLE
*
table
,
ulong
query_id
)
...
...
@@ -520,11 +522,12 @@ int multi_update::prepare(List<Item> ¬_used_values)
/*
Store first used table in main_table as this should be updated first
This is because we know that no row in this table will be read twice.
Initialize table for multi table
Create temporary tables to store changed values for all other tables
that are updated.
IMPLEMENTATION
- Update first table in join on the fly, if possible
- Create temporary tables to store changed values for all other tables
that are updated (and main_table if the above doesn't hold).
*/
bool
...
...
@@ -538,17 +541,25 @@ multi_update::initialize_tables(JOIN *join)
main_table
=
join
->
join_tab
->
table
;
trans_safe
=
transactional_tables
=
main_table
->
file
->
has_transactions
();
log_delayed
=
trans_safe
||
main_table
->
tmp_table
!=
NO_TMP_TABLE
;
table_to_update
=
(
main_table
->
file
->
table_flags
()
&
HA_NOT_MULTI_UPDATE
)
?
(
TABLE
*
)
0
:
main_table
;
/* Create a temporary table for
all tables after
except main table */
table_to_update
=
0
;
/* Create a temporary table for
keys to all tables,
except main table */
for
(
table_ref
=
update_tables
;
table_ref
;
table_ref
=
table_ref
->
next
)
{
TABLE
*
table
=
table_ref
->
table
;
if
(
table
!=
table_to_update
)
{
uint
cnt
=
table_ref
->
shared
;
ORDER
group
;
List
<
Item
>
temp_fields
=
*
fields_for_table
[
cnt
];
ORDER
group
;
if
(
table
==
main_table
)
// First table in join
{
if
(
safe_update_on_fly
(
join
->
join_tab
,
&
temp_fields
))
{
table_to_update
=
main_table
;
// Update table on the fly
continue
;
}
}
TMP_TABLE_PARAM
*
tmp_param
=
tmp_table_param
+
cnt
;
/*
...
...
@@ -580,10 +591,63 @@ multi_update::initialize_tables(JOIN *join)
DBUG_RETURN
(
1
);
tmp_tables
[
cnt
]
->
file
->
extra
(
HA_EXTRA_WRITE_CACHE
);
}
}
DBUG_RETURN
(
0
);
}
/*
Check if table is safe to update on fly
SYNOPSIS
safe_update_on_fly
join_tab How table is used in join
fields Fields that are updated
NOTES
We can update the first table in join on the fly if we know that
a row in this tabel will never be read twice. This is true under
the folloing conditions:
- We are doing a table scan and the data is in a separate file (MyISAM) or
if we don't update a clustered key.
- We are doing a range scan and we don't update the scan key or
the primary key for a clustered table handler.
WARNING
This code is a bit dependent of how make_join_readinfo() works.
RETURN
0 Not safe to update
1 Safe to update
*/
static
bool
safe_update_on_fly
(
JOIN_TAB
*
join_tab
,
List
<
Item
>
*
fields
)
{
TABLE
*
table
=
join_tab
->
table
;
switch
(
join_tab
->
type
)
{
case
JT_SYSTEM
:
case
JT_CONST
:
case
JT_EQ_REF
:
return
1
;
// At most one matching row
case
JT_REF
:
return
!
check_if_key_used
(
table
,
join_tab
->
ref
.
key
,
*
fields
);
case
JT_ALL
:
/* If range search on index */
if
(
join_tab
->
quick
)
return
!
check_if_key_used
(
table
,
join_tab
->
quick
->
index
,
*
fields
);
/* If scanning in clustered key */
if
((
table
->
file
->
table_flags
()
&
HA_PRIMARY_KEY_IN_READ_INDEX
)
&&
table
->
primary_key
<
MAX_KEY
)
return
!
check_if_key_used
(
table
,
table
->
primary_key
,
*
fields
);
return
1
;
default:
break
;
// Avoid compler warning
}
return
0
;
}
multi_update
::~
multi_update
()
{
...
...
sql/sql_yacc.yy
View file @
b4a0cdb8
...
...
@@ -256,6 +256,7 @@ bool my_yyoverflow(short **a, YYSTYPE **b,int *yystacksize);
%token MAX_UPDATES_PER_HOUR
%token MEDIUM_SYM
%token MERGE_SYM
%token MEMORY_SYM
%token MIN_ROWS
%token MYISAM_SYM
%token NATIONAL_SYM
...
...
@@ -871,6 +872,7 @@ table_types:
| MYISAM_SYM { $$= DB_TYPE_MYISAM; }
| MERGE_SYM { $$= DB_TYPE_MRG_MYISAM; }
| HEAP_SYM { $$= DB_TYPE_HEAP; }
| MEMORY_SYM { $$= DB_TYPE_HEAP; }
| BERKELEY_DB_SYM { $$= DB_TYPE_BERKELEY_DB; }
| INNOBASE_SYM { $$= DB_TYPE_INNODB; };
...
...
@@ -3316,6 +3318,7 @@ keyword:
| MAX_UPDATES_PER_HOUR {}
| MEDIUM_SYM {}
| MERGE_SYM {}
| MEMORY_SYM {}
| MINUTE_SYM {}
| MIN_ROWS {}
| MODIFY_SYM {}
...
...
strings/strto.c
View file @
b4a0cdb8
...
...
@@ -35,6 +35,8 @@
it can be compiled with the UNSIGNED and/or LONGLONG flag set
*/
#define strtoll glob_strtoll
/* Fix for True64 */
#include <my_global.h>
#include "m_string.h"
#include "m_ctype.h"
...
...
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