diff options
| author | unknown <istruewing@chilla.local> | 2007-03-19 15:56:53 +0100 |
|---|---|---|
| committer | unknown <istruewing@chilla.local> | 2007-03-19 15:56:53 +0100 |
| commit | db573e637c2ba66f214f7e1e2172ce9efeca0db0 (patch) | |
| tree | 5c48ed97050e9f6a5b2a0da2a264d7d9d3b1084e /mysql-test/r/heap_btree.result | |
| parent | da9c659c8196d1da63330fc7b1b6710217801a6f (diff) | |
| download | mariadb-git-db573e637c2ba66f214f7e1e2172ce9efeca0db0.tar.gz | |
Bug#26996 - Update of a Field in a Memory Table ends with wrong result
Using a MEMORY table BTREE index for scanning for updatable rows
could lead to an infinite loop.
Everytime a key was inserted into a btree index, the position
in the index scan was cleared. The search started from the
beginning and found the same key again.
Now we do not clear the position on key insert an more.
heap/hp_write.c:
Bug#26996 - Update of a Field in a Memory Table ends with wrong result
Removed the index-scan-breaking nulling of last_pos.
The comment behind this line ("For heap_rnext/heap_rprev")
was misleading. It should have been "Breaks heap_rnext/heap_rprev".
mysql-test/r/heap_btree.result:
Bug#26996 - Update of a Field in a Memory Table ends with wrong result
Added test result.
mysql-test/t/heap_btree.test:
Bug#26996 - Update of a Field in a Memory Table ends with wrong result
Added test.
Diffstat (limited to 'mysql-test/r/heap_btree.result')
| -rw-r--r-- | mysql-test/r/heap_btree.result | 15 |
1 files changed, 15 insertions, 0 deletions
diff --git a/mysql-test/r/heap_btree.result b/mysql-test/r/heap_btree.result index e6492e90b80..1a0666514be 100644 --- a/mysql-test/r/heap_btree.result +++ b/mysql-test/r/heap_btree.result @@ -280,4 +280,19 @@ a 1 1 drop table t1; +CREATE TABLE t1 ( +c1 CHAR(3), +c2 INTEGER, +KEY USING BTREE(c1), +KEY USING BTREE(c2) +) ENGINE= MEMORY; +INSERT INTO t1 VALUES ('ABC',0), ('A',0), ('B',0), ('C',0); +UPDATE t1 SET c2= c2 + 1 WHERE c1 = 'A'; +SELECT * FROM t1; +c1 c2 +ABC 0 +A 1 +B 0 +C 0 +DROP TABLE t1; End of 4.1 tests |