3 # The author disclaims copyright to this source code. In place of
4 # a legal notice, here is a blessing:
6 # May you do good and not evil.
7 # May you find forgiveness for yourself and forgive others.
8 # May you share freely, never taking more than you give.
10 #***********************************************************************
11 # This file tests a special case in the b-tree code that can be
12 # hit by the "IN" operator (or EXISTS, NOT IN, etc.).
14 # $Id: in2.test,v 1.3 2008/07/12 14:52:20 drh Exp $
16 set testdir [file dirname $argv0]
17 source $testdir/tester.tcl
21 CREATE TABLE a(i INTEGER PRIMARY KEY, a);
29 for {set ::ii 0} {$::ii < $::N} {incr ::ii} {
30 execsql {INSERT INTO a VALUES($::ii, $::ii)}
32 execsql {INSERT INTO a VALUES(4000, '')}
34 for {set ::ii 0} {$::ii < $::N} {incr ::ii} {
35 set ::t [format "x%04d" $ii]
36 execsql {INSERT INTO a VALUES(NULL, $::t)}
41 # Each iteration of this loop builds a slightly different b-tree to
42 # evaluate the "IN (...)" operator in the SQL statement. The contents
43 # of the b-tree are (in sorted order):
46 # a string of zero length.
49 # Records are inserted in sorted order.
51 # The string of zero-length is stored in a b-tree cell with 3 bytes
52 # of payload. Moving this cell from a leaf node to a internal node
53 # during b-tree balancing was causing an assertion failure.
55 # This bug only applied to b-trees generated to evaluate IN (..)
56 # clauses, as it is impossible for persistent b-trees (SQL tables +
57 # indices) to contain cells smaller than 4 bytes.
59 for {set ::ii 3} {$::ii < $::N} {incr ::ii} {
62 SELECT 1 IN (SELECT a FROM a WHERE (i < $::ii) OR (i >= $::N))