summaryrefslogtreecommitdiffstats
path: root/tests/unit/type/list-3.tcl
blob: 45df5939d726739fa0cdffe8715f5b6ec156960f (plain)
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
proc generate_cmd_on_list_key {key} {
    set op [randomInt 7]
    set small_signed_count [expr 5-[randomInt 10]]
    if {[randomInt 2] == 0} {
        set ele [randomInt 1000]
    } else {
        set ele [string repeat x [randomInt 10000]][randomInt 1000]
    }
    switch $op {
        0 {return "lpush $key $ele"}
        1 {return "rpush $key $ele"}
        2 {return "lpop $key"}
        3 {return "rpop $key"}
        4 {
            return "lset $key $small_signed_count $ele"
        }
        5 {
            set otherele [randomInt 1000]
            if {[randomInt 2] == 0} {
                set where before
            } else {
                set where after
            }
            return "linsert $key $where $otherele $ele"
        }
        6 {
            set otherele ""
            catch {
                set index [randomInt [r llen $key]]
                set otherele [r lindex $key $index]
            }
            return "lrem $key 1 $otherele"
        }
    }
}

start_server {
    tags {"list ziplist"}
    overrides {
        "list-max-ziplist-size" 16
    }
} {
    test {Explicit regression for a list bug} {
        set mylist {49376042582 {BkG2o\pIC]4YYJa9cJ4GWZalG[4tin;1D2whSkCOW`mX;SFXGyS8sedcff3fQI^tgPCC@^Nu1J6o]meM@Lko]t_jRyo<xSJ1oObDYd`ppZuW6P@fS278YaOx=s6lvdFlMbP0[SbkI^Kr\HBXtuFaA^mDx:yzS4a[skiiPWhT<nNfAf=aQVfclcuwDrfe;iVuKdNvB9kbfq>tK?tH[\EvWqS]b`o2OCtjg:?nUTwdjpcUm]y:pg5q24q7LlCOwQE^}}
        r del l
        r rpush l [lindex $mylist 0]
        r rpush l [lindex $mylist 1]
        assert_equal [r lindex l 0] [lindex $mylist 0]
        assert_equal [r lindex l 1] [lindex $mylist 1]
    }

    test {Regression for quicklist #3343 bug} {
        r del mylist
        r lpush mylist 401
        r lpush mylist 392
        r rpush mylist [string repeat x 5105]"799"
        r lset mylist -1 [string repeat x 1014]"702"
        r lpop mylist
        r lset mylist -1 [string repeat x 4149]"852"
        r linsert mylist before 401 [string repeat x 9927]"12"
        r lrange mylist 0 -1
        r ping ; # It's enough if the server is still alive
    } {PONG}

    test {Check compression with recompress} {
        r del key
        config_set list-compress-depth 1
        config_set list-max-ziplist-size 16
        r rpush key a
        r rpush key [string repeat b 50000]
        r rpush key c
        r lset key 1 d
        r rpop key
        r rpush key [string repeat e 5000]
        r linsert key before f 1
        r rpush key g
        r ping
    }

    test {Crash due to wrongly recompress after lrem} {
        r del key
        config_set list-compress-depth 2
        r lpush key a
        r lpush key [string repeat a 5000]
        r lpush key [string repeat b 5000]
        r lpush key [string repeat c 5000]
        r rpush key [string repeat x 10000]"969"
        r rpush key b
        r lrem key 1 a
        r rpop key 
        r lrem key 1 [string repeat x 10000]"969"
        r rpush key crash
        r ping
    }

    test {LINSERT correctly recompress full quicklistNode after inserting a element before it} {
        r del key
        config_set list-compress-depth 1
        r rpush key b
        r rpush key c
        r lset key -1 [string repeat x 8192]"969"
        r lpush key a
        r rpush key d
        r linsert key before b f
        r rpop key
        r ping
    }

    test {LINSERT correctly recompress full quicklistNode after inserting a element after it} {
        r del key
        config_set list-compress-depth 1
        r rpush key b
        r rpush key c
        r lset key 0 [string repeat x 8192]"969"
        r lpush key a
        r rpush key d
        r linsert key after c f
        r lpop key
        r ping
    }

foreach comp {2 1 0} {
    set cycles 1000
    if {$::accurate} { set cycles 10000 }
    config_set list-compress-depth $comp
    
    test "Stress tester for #3343-alike bugs comp: $comp" {
        r del key
        set sent {}
        for {set j 0} {$j < $cycles} {incr j} {
            catch {
                set cmd [generate_cmd_on_list_key key]
                lappend sent $cmd

                # execute the command, we expect commands to fail on syntax errors
                r {*}$cmd
            }
        }

        set print_commands false
        set crash false
        if {[catch {r ping}]} {
            puts "Server crashed"
            set print_commands true
            set crash true
        }

        if {!$::external} {
            # check valgrind and asan report for invalid reads after execute
            # command so that we have a report that is easier to reproduce
            set valgrind_errors [find_valgrind_errors [srv 0 stderr] false]
            set asan_errors [sanitizer_errors_from_file [srv 0 stderr]]
            if {$valgrind_errors != "" || $asan_errors != ""} {
                puts "valgrind or asan found an issue"
                set print_commands true
            }
        }

        if {$print_commands} {
            puts "violating commands:"
            foreach cmd $sent {
                puts $cmd
            }
        }

        assert_equal $crash false
    }
} ;# foreach comp

    tags {slow} {
        test {ziplist implementation: value encoding and backlink} {
            if {$::accurate} {set iterations 100} else {set iterations 10}
            for {set j 0} {$j < $iterations} {incr j} {
                r del l
                set l {}
                for {set i 0} {$i < 200} {incr i} {
                    randpath {
                        set data [string repeat x [randomInt 100000]]
                    } {
                        set data [randomInt 65536]
                    } {
                        set data [randomInt 4294967296]
                    } {
                        set data [randomInt 18446744073709551616]
                    } {
                        set data -[randomInt 65536]
                        if {$data eq {-0}} {set data 0}
                    } {
                        set data -[randomInt 4294967296]
                        if {$data eq {-0}} {set data 0}
                    } {
                        set data -[randomInt 18446744073709551616]
                        if {$data eq {-0}} {set data 0}
                    }
                    lappend l $data
                    r rpush l $data
                }
                assert_equal [llength $l] [r llen l]
                # Traverse backward
                for {set i 199} {$i >= 0} {incr i -1} {
                    if {[lindex $l $i] ne [r lindex l $i]} {
                        assert_equal [lindex $l $i] [r lindex l $i]
                    }
                }
            }
        }

        test {ziplist implementation: encoding stress testing} {
            for {set j 0} {$j < 200} {incr j} {
                r del l
                set l {}
                set len [randomInt 400]
                for {set i 0} {$i < $len} {incr i} {
                    set rv [randomValue]
                    randpath {
                        lappend l $rv
                        r rpush l $rv
                    } {
                        set l [concat [list $rv] $l]
                        r lpush l $rv
                    }
                }
                assert_equal [llength $l] [r llen l]
                for {set i 0} {$i < $len} {incr i} {
                    if {[lindex $l $i] ne [r lindex l $i]} {
                        assert_equal [lindex $l $i] [r lindex l $i]
                    }
                }
            }
        }
    }
}