rtree8.test 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170
  1. # 2010 February 16
  2. #
  3. # The author disclaims copyright to this source code. In place of
  4. # a legal notice, here is a blessing:
  5. #
  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.
  9. #
  10. #***********************************************************************
  11. #
  12. #
  13. if {![info exists testdir]} {
  14. set testdir [file join [file dirname [info script]] .. .. test]
  15. }
  16. source $testdir/tester.tcl
  17. ifcapable !rtree { finish_test ; return }
  18. #-------------------------------------------------------------------------
  19. # The following block of tests - rtree8-1.* - feature reading and writing
  20. # an r-tree table while there exist open cursors on it.
  21. #
  22. proc populate_t1 {n} {
  23. execsql { DELETE FROM t1 }
  24. for {set i 1} {$i <= $n} {incr i} {
  25. execsql { INSERT INTO t1 VALUES($i, $i, $i+2) }
  26. }
  27. }
  28. # A DELETE while a cursor is reading the table.
  29. #
  30. do_test rtree8-1.1.1 {
  31. execsql { PRAGMA page_size = 512 }
  32. execsql { CREATE VIRTUAL TABLE t1 USING rtree_i32(id, x1, x2) }
  33. populate_t1 5
  34. } {}
  35. do_test rtree8-1.1.2 {
  36. set res [list]
  37. db eval { SELECT * FROM t1 } {
  38. lappend res $x1 $x2
  39. if {$id==3} { db eval { DELETE FROM t1 WHERE id>3 } }
  40. }
  41. set res
  42. } {1 3 2 4 3 5}
  43. do_test rtree8-1.1.3 {
  44. execsql { SELECT * FROM t1 }
  45. } {1 1 3 2 2 4 3 3 5}
  46. # Many SELECTs on the same small table.
  47. #
  48. proc nested_select {n} {
  49. set ::max $n
  50. db eval { SELECT * FROM t1 } {
  51. if {$id == $n} { nested_select [expr $n+1] }
  52. }
  53. return $::max
  54. }
  55. do_test rtree8-1.2.1 { populate_t1 50 } {}
  56. do_test rtree8-1.2.2 { nested_select 1 } {51}
  57. # This test runs many SELECT queries simultaneously against a large
  58. # table, causing a collision in the hash-table used to store r-tree
  59. # nodes internally.
  60. #
  61. populate_t1 1500
  62. do_execsql_test rtree8-1.3.1 { SELECT max(nodeno) FROM t1_node } {164}
  63. do_test rtree8-1.3.2 {
  64. set rowids [execsql {SELECT min(rowid) FROM t1_rowid GROUP BY nodeno}]
  65. set stmt_list [list]
  66. foreach row $rowids {
  67. set stmt [sqlite3_prepare db "SELECT * FROM t1 WHERE id = $row" -1 tail]
  68. sqlite3_step $stmt
  69. lappend res_list [sqlite3_column_int $stmt 0]
  70. lappend stmt_list $stmt
  71. }
  72. } {}
  73. do_test rtree8-1.3.3 { set res_list } $rowids
  74. do_execsql_test rtree8-1.3.4 { SELECT count(*) FROM t1 } {1500}
  75. do_test rtree8-1.3.5 {
  76. foreach stmt $stmt_list { sqlite3_finalize $stmt }
  77. } {}
  78. #-------------------------------------------------------------------------
  79. # The following block of tests - rtree8-2.* - test a couple of database
  80. # corruption cases. In this case things are not corrupted at the b-tree
  81. # level, but the contents of the various tables used internally by an
  82. # r-tree table are inconsistent.
  83. #
  84. populate_t1 50
  85. do_execsql_test rtree8-2.1.1 { SELECT max(nodeno) FROM t1_node } {5}
  86. do_execsql_test rtree8-2.1.2 { DELETE FROM t1_node } {}
  87. for {set i 1} {$i <= 50} {incr i} {
  88. do_catchsql_test rtree8-2.1.3.$i {
  89. SELECT * FROM t1 WHERE id = $i
  90. } {1 {database disk image is malformed}}
  91. }
  92. do_catchsql_test rtree8-2.1.4 {
  93. SELECT * FROM t1
  94. } {1 {database disk image is malformed}}
  95. do_catchsql_test rtree8-2.1.5 {
  96. DELETE FROM t1
  97. } {1 {database disk image is malformed}}
  98. do_execsql_test rtree8-2.1.6 {
  99. DROP TABLE t1;
  100. CREATE VIRTUAL TABLE t1 USING rtree_i32(id, x1, x2);
  101. } {}
  102. populate_t1 50
  103. do_execsql_test rtree8-2.2.1 {
  104. DELETE FROM t1_parent
  105. } {}
  106. do_catchsql_test rtree8-2.2.2 {
  107. DELETE FROM t1 WHERE id=25
  108. } {1 {database disk image is malformed}}
  109. do_execsql_test rtree8-2.2.3 {
  110. DROP TABLE t1;
  111. CREATE VIRTUAL TABLE t1 USING rtree_i32(id, x1, x2);
  112. } {}
  113. #-------------------------------------------------------------------------
  114. # Test that trying to use the MATCH operator with the r-tree module does
  115. # not confuse it.
  116. #
  117. populate_t1 10
  118. do_catchsql_test rtree8-3.1 {
  119. SELECT * FROM t1 WHERE x1 MATCH '1234'
  120. } {1 {SQL logic error or missing database}}
  121. #-------------------------------------------------------------------------
  122. # Test a couple of invalid arguments to rtreedepth().
  123. #
  124. do_catchsql_test rtree8-4.1 {
  125. SELECT rtreedepth('hello world')
  126. } {1 {Invalid argument to rtreedepth()}}
  127. do_catchsql_test rtree8-4.2 {
  128. SELECT rtreedepth(X'00')
  129. } {1 {Invalid argument to rtreedepth()}}
  130. #-------------------------------------------------------------------------
  131. # Delete half of a lopsided tree.
  132. #
  133. do_execsql_test rtree8-5.1 {
  134. CREATE VIRTUAL TABLE t2 USING rtree_i32(id, x1, x2)
  135. } {}
  136. do_test rtree8-5.2 {
  137. execsql BEGIN
  138. for {set i 0} {$i < 100} {incr i} {
  139. execsql { INSERT INTO t2 VALUES($i, 100, 101) }
  140. }
  141. for {set i 100} {$i < 200} {incr i} {
  142. execsql { INSERT INTO t2 VALUES($i, 1000, 1001) }
  143. }
  144. execsql COMMIT
  145. } {}
  146. do_test rtree8-5.3 {
  147. execsql BEGIN
  148. for {set i 0} {$i < 200} {incr i} {
  149. execsql { DELETE FROM t2 WHERE id = $i }
  150. }
  151. execsql COMMIT
  152. } {}
  153. finish_test