Repository navigation
Expand file tree
/
Copy pathboundary4.tcl
More file actions
340 lines (300 loc) · 8.5 KB
/
Copy pathboundary4.tcl
File metadata and controls
340 lines (300 loc) · 8.5 KB
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
puts {# 2008 December 11
#
# 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 implements regression tests for SQLite library.
#
# This file is automatically generated from a separate TCL script.
# This file seeks to exercise integer boundary values.
#
# $Id: boundary4.tcl,v 1.3 2009/01/02 15:45:48 shane Exp $
set testdir [file dirname $argv0]
source $testdir/tester.tcl
# Many of the boundary tests depend on a working 64-bit implementation.
if {![working_64bit_int]} { finish_test; return }
ifcapable !altertable { finish_test; return }
}
expr srand(0)
# Generate interesting boundary numbers
#
foreach x {
0x7f
0x7fff
0x7fffff
0x7fffffff
0x7fffffffff
0x7fffffffffff
0x7fffffffffffff
0x7fffffffffffffff
} {
set x [expr {wide($x)}]
set boundarynum($x) 1
set boundarynum([expr {$x+1}]) 1
set boundarynum([expr {-($x+1)}]) 1
set boundarynum([expr {-($x+2)}]) 1
set boundarynum([expr {$x+$x+1}]) 1
set boundarynum([expr {$x+$x+2}]) 1
}
set x [expr {wide(127)}]
for {set i 127} {$i<=9} {incr i} {
set boundarynum($x) 1
set boundarynum([expr {$x+1}]) 1
set x [expr {wide($x*128 + 127)}]
}
# Scramble the $inlist into a random order.
#
proc scramble {inlist} {
set y {}
foreach x $inlist {
lappend y [list [expr {rand()}] $x]
}
set y [lsort $y]
set outlist {}
foreach x $y {
lappend outlist [lindex $x 1]
}
return $outlist
}
# A simple selection sort. Not trying to be efficient.
#
proc sort {inlist} {
set outlist {}
set mn [lindex $inlist 0]
foreach x $inlist {
if {$x<$mn} {set mn $x}
}
set outlist $mn
set mx $mn
while {1} {
set valid 0
foreach x $inlist {
if {$x>$mx && (!$valid || $mn>$x)} {
set mn $x
set valid 1
}
}
if {!$valid} break
lappend outlist $mn
set mx $mn
}
return $outlist
}
# Reverse the order of a list
#
proc reverse {inlist} {
set i [llength $inlist]
set outlist {}
for {incr i -1} {$i>=0} {incr i -1} {
lappend outlist [lindex $inlist $i]
}
return $outlist
}
set nums1 [scramble [array names boundarynum]]
set nums2 [scramble [array names boundarynum]]
set tname boundary4
puts "do_test $tname-1.1 \173"
puts " db eval \173"
puts " CREATE TABLE t1(a,x);"
set a 0
set all_rowid {}
set all_a {}
set all_x {}
foreach r $nums1 {
incr a
set t1ra($r) $a
set t1ar($a) $r
set x [format %08x%08x [expr {wide($r)>>32}] $r]
set t1rx($r) $x
set t1xr($x) $r
puts " INSERT INTO t1(oid,a,x) VALUES($r,$a,'$x');"
lappend all_rowid $r
lappend all_a $a
lappend all_x $x
}
puts " CREATE INDEX t1i1 ON t1(a);"
puts " CREATE INDEX t1i2 ON t1(x);"
puts " \175"
puts "\175 {}"
puts "do_test $tname-1.2 \173"
puts " db eval \173"
puts " SELECT count(*) FROM t1"
puts " \175"
puts "\175 {[llength $nums1]}"
proc maketest {tnum sql answer} {
puts "do_test $::tname-$tnum \173"
puts " db eval \173"
puts " $sql"
puts " \175"
puts "\175 {$answer}"
}
set ans {}
foreach r [sort $all_rowid] {
lappend ans $r $t1ra($r) $t1rx($r)
}
maketest 1.3 {SELECT rowid, a, x FROM t1 ORDER BY +rowid} $ans
maketest 1.4 {SELECT rowid, a, x FROM t1 ORDER BY rowid} $ans
set ans {}
foreach r [reverse [sort $all_rowid]] {
lappend ans $r $t1ra($r) $t1rx($r)
}
maketest 1.5 {SELECT rowid, a, x FROM t1 ORDER BY +rowid DESC} $ans
maketest 1.6 {SELECT rowid, a, x FROM t1 ORDER BY rowid DESC} $ans
set ans {}
foreach a [sort $all_a] {
set r $t1ar($a)
lappend ans $r $a $t1rx($r)
}
maketest 1.7 {SELECT rowid, a, x FROM t1 ORDER BY +a} $ans
maketest 1.8 {SELECT rowid, a, x FROM t1 ORDER BY a} $ans
set ans {}
foreach a [reverse [sort $all_a]] {
set r $t1ar($a)
lappend ans $r $a $t1rx($r)
}
maketest 1.9 {SELECT rowid, a, x FROM t1 ORDER BY +a DESC} $ans
maketest 1.10 {SELECT rowid, a, x FROM t1 ORDER BY a DESC} $ans
set ans {}
foreach x [sort $all_x] {
set r $t1xr($x)
lappend ans $r $t1ra($r) $x
}
maketest 1.11 {SELECT rowid, a, x FROM t1 ORDER BY +x} $ans
maketest 1.12 {SELECT rowid, a, x FROM t1 ORDER BY x} $ans
set ans {}
foreach x [reverse [sort $all_x]] {
set r $t1xr($x)
lappend ans $r $t1ra($r) $x
}
maketest 1.13 {SELECT rowid, a, x FROM t1 ORDER BY +x DESC} $ans
maketest 1.14 {SELECT rowid, a, x FROM t1 ORDER BY x DESC} $ans
maketest 2.1 {UPDATE t1 SET rowid=a, a=rowid} {}
set ans {}
foreach r [sort $all_rowid] {
lappend ans $r $t1ra($r) $t1rx($r)
}
maketest 2.3 {SELECT a, rowid, x FROM t1 ORDER BY +a} $ans
maketest 2.4 {SELECT a, rowid, x FROM t1 ORDER BY a} $ans
set ans {}
foreach r [reverse [sort $all_rowid]] {
lappend ans $r $t1ra($r) $t1rx($r)
}
maketest 2.5 {SELECT a, rowid, x FROM t1 ORDER BY +a DESC} $ans
maketest 2.6 {SELECT a, rowid, x FROM t1 ORDER BY a DESC} $ans
set ans {}
foreach a [sort $all_a] {
set r $t1ar($a)
lappend ans $r $a $t1rx($r)
}
maketest 2.7 {SELECT a, rowid, x FROM t1 ORDER BY +rowid} $ans
maketest 2.8 {SELECT a, rowid, x FROM t1 ORDER BY rowid} $ans
set ans {}
foreach a [reverse [sort $all_a]] {
set r $t1ar($a)
lappend ans $r $a $t1rx($r)
}
maketest 2.9 {SELECT a, rowid, x FROM t1 ORDER BY +rowid DESC} $ans
maketest 2.10 {SELECT a, rowid, x FROM t1 ORDER BY rowid DESC} $ans
set ans {}
foreach x [sort $all_x] {
set r $t1xr($x)
lappend ans $r $t1ra($r) $x
}
maketest 2.11 {SELECT a, rowid, x FROM t1 ORDER BY +x} $ans
maketest 2.12 {SELECT a, rowid, x FROM t1 ORDER BY x} $ans
set ans {}
foreach x [reverse [sort $all_x]] {
set r $t1xr($x)
lappend ans $r $t1ra($r) $x
}
maketest 2.13 {SELECT a, rowid, x FROM t1 ORDER BY +x DESC} $ans
maketest 2.14 {SELECT a, rowid, x FROM t1 ORDER BY x DESC} $ans
maketest 3.1 {UPDATE t1 SET rowid=a, a=rowid} {}
maketest 3.2 {ALTER TABLE t1 ADD COLUMN z; UPDATE t1 SET z=zeroblob(600)} {}
set ans {}
foreach r [sort $all_rowid] {
lappend ans $r $t1ra($r) $t1rx($r)
}
maketest 3.3 {SELECT rowid, a, x FROM t1 ORDER BY +rowid} $ans
maketest 3.4 {SELECT rowid, a, x FROM t1 ORDER BY rowid} $ans
set ans {}
foreach r [reverse [sort $all_rowid]] {
lappend ans $r $t1ra($r) $t1rx($r)
}
maketest 3.5 {SELECT rowid, a, x FROM t1 ORDER BY +rowid DESC} $ans
maketest 3.6 {SELECT rowid, a, x FROM t1 ORDER BY rowid DESC} $ans
set ans {}
foreach a [sort $all_a] {
set r $t1ar($a)
lappend ans $r $a $t1rx($r)
}
maketest 3.7 {SELECT rowid, a, x FROM t1 ORDER BY +a} $ans
maketest 3.8 {SELECT rowid, a, x FROM t1 ORDER BY a} $ans
set ans {}
foreach a [reverse [sort $all_a]] {
set r $t1ar($a)
lappend ans $r $a $t1rx($r)
}
maketest 3.9 {SELECT rowid, a, x FROM t1 ORDER BY +a DESC} $ans
maketest 3.10 {SELECT rowid, a, x FROM t1 ORDER BY a DESC} $ans
set ans {}
foreach x [sort $all_x] {
set r $t1xr($x)
lappend ans $r $t1ra($r) $x
}
maketest 3.11 {SELECT rowid, a, x FROM t1 ORDER BY +x} $ans
maketest 3.12 {SELECT rowid, a, x FROM t1 ORDER BY x} $ans
set ans {}
foreach x [reverse [sort $all_x]] {
set r $t1xr($x)
lappend ans $r $t1ra($r) $x
}
maketest 3.13 {SELECT rowid, a, x FROM t1 ORDER BY +x DESC} $ans
maketest 3.14 {SELECT rowid, a, x FROM t1 ORDER BY x DESC} $ans
maketest 4.1 {UPDATE t1 SET rowid=a, a=rowid, x=z, z=x} {}
set ans {}
foreach r [sort $all_rowid] {
lappend ans $r $t1ra($r) $t1rx($r)
}
maketest 4.3 {SELECT a, rowid, z FROM t1 ORDER BY +a} $ans
maketest 4.4 {SELECT a, rowid, z FROM t1 ORDER BY a} $ans
set ans {}
foreach r [reverse [sort $all_rowid]] {
lappend ans $r $t1ra($r) $t1rx($r)
}
maketest 4.5 {SELECT a, rowid, z FROM t1 ORDER BY +a DESC} $ans
maketest 4.6 {SELECT a, rowid, z FROM t1 ORDER BY a DESC} $ans
set ans {}
foreach a [sort $all_a] {
set r $t1ar($a)
lappend ans $r $a $t1rx($r)
}
maketest 4.7 {SELECT a, rowid, z FROM t1 ORDER BY +rowid} $ans
maketest 4.8 {SELECT a, rowid, z FROM t1 ORDER BY rowid} $ans
set ans {}
foreach a [reverse [sort $all_a]] {
set r $t1ar($a)
lappend ans $r $a $t1rx($r)
}
maketest 4.9 {SELECT a, rowid, z FROM t1 ORDER BY +rowid DESC} $ans
maketest 4.10 {SELECT a, rowid, z FROM t1 ORDER BY rowid DESC} $ans
set ans {}
foreach x [sort $all_x] {
set r $t1xr($x)
lappend ans $r $t1ra($r) $x
}
maketest 4.11 {SELECT a, rowid, z FROM t1 ORDER BY +z} $ans
maketest 4.12 {SELECT a, rowid, z FROM t1 ORDER BY z} $ans
set ans {}
foreach x [reverse [sort $all_x]] {
set r $t1xr($x)
lappend ans $r $t1ra($r) $x
}
maketest 4.13 {SELECT a, rowid, z FROM t1 ORDER BY +z DESC} $ans
maketest 4.14 {SELECT a, rowid, z FROM t1 ORDER BY z DESC} $ans
puts {finish_test}