1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
|
#!/usr/bin/env tarantool
test = require("sqltester")
test:plan(1999)
--!./tcltestrunner.lua
-- 2007 May 12
--
-- The author disclaims copyright to this source code. In place of
-- a legal notice, here is a blessing:
--
-- May you do good and not evil.
-- May you find forgiveness for yourself and forgive others.
-- May you share freely, never taking more than you give.
--
-------------------------------------------------------------------------
-- This file tests a special case in the b-tree code that can be
-- hit by the "IN" operator (or EXISTS, NOT IN, etc.).
--
-- $Id: in2.test,v 1.3 2008/07/12 14:52:20 drh Exp $
-- ["set","testdir",[["file","dirname",["argv0"]]]]
-- ["source",[["testdir"],"\/tester.tcl"]]
test:do_execsql_test(
"in2-1",
[[
CREATE TABLE a(i INTEGER PRIMARY KEY, a INT);
]], {
-- <in2-1>
-- </in2-1>
})
N = 2000
-- MUST_WORK_TEST
test:do_test(
"in2-2",
function()
local rows = {}
for i=0,N-1 do
table.insert(rows, string.format('INSERT INTO a VALUES(%d, %d)', i, i))
end
table.insert(rows, string.format('INSERT INTO a VALUES(%d, %d)', 4000, 0))
for i=0,N-1 do
table.insert(rows, string.format('INSERT INTO a VALUES(%d, 0x%x)', 4001 + i, i))
end
test:execsql('START TRANSACTION')
for _, v in ipairs(rows) do
test:execsql(v)
end
test:execsql('COMMIT')
-- return db("transaction", [=[
-- for {set ::ii 0} {$::ii < $::N} {incr ::ii} {
-- execsql {INSERT INTO a VALUES($::ii, $::ii)}
-- }
-- execsql {INSERT INTO a VALUES(4000, '')}
-- for {set ::ii 0} {$::ii < $::N} {incr ::ii} {
-- set ::t [format "x%04d" $ii]
-- execsql {INSERT INTO a VALUES(4001 + $ii, $::t)}
-- }
-- ]=])
end, {
-- <in2-2>
-- </in2-2>
})
-- Each iteration of this loop builds a slightly different b-tree to
-- evaluate the "IN (...)" operator in the SQL statement. The contents
-- of the b-tree are (in sorted order):
--
-- $::ii integers.
-- a string of zero length.
-- $::N short strings.
--
-- Records are inserted in sorted order.
--
-- The string of zero-length is stored in a b-tree cell with 3 bytes
-- of payload. Moving this cell from a leaf node to a internal node
-- during b-tree balancing was causing an assertion failure.
--
-- This bug only applied to b-trees generated to evaluate IN (..)
-- clauses, as it is impossible for persistent b-trees (SQL tables +
-- indices) to contain cells smaller than 4 bytes.
--
for ii=3,N-1 do
-- for _ in X(0, "X!for", [=[["set ::ii 3","$::ii < $::N","incr ::ii"]]=]) do
test:do_execsql_test(
"in2-"..ii,
'SELECT 1 IN (SELECT a FROM a WHERE (i <'..ii..' ) OR (i >= '..N..'))',
{
true
})
end
test:finish_test()
|
