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
|
#!/usr/bin/env python
#
# Public Domain 2014-2017 MongoDB, Inc.
# Public Domain 2008-2014 WiredTiger, Inc.
#
# This is free and unencumbered software released into the public domain.
#
# Anyone is free to copy, modify, publish, use, compile, sell, or
# distribute this software, either in source code form or as a compiled
# binary, for any purpose, commercial or non-commercial, and by any
# means.
#
# In jurisdictions that recognize copyright laws, the author or authors
# of this software dedicate any and all copyright interest in the
# software to the public domain. We make this dedication for the benefit
# of the public at large and to the detriment of our heirs and
# successors. We intend this dedication to be an overt act of
# relinquishment in perpetuity of all present and future rights to this
# software under copyright law.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
# IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
# OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
# ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
# OTHER DEALINGS IN THE SOFTWARE.
#
# test_timestamp04.py
# Timestamps: Test that rollback_to_stable obeys expected visibility rules
#
import datetime
import random
from suite_subprocess import suite_subprocess
import wiredtiger, wttest
from wtscenario import make_scenarios
def timestamp_str(t):
return '%x' % t
def timestamp_ret_str(t):
s = timestamp_str(t)
if len(s) % 2 == 1:
s = '0' + s
return s
class test_timestamp04(wttest.WiredTigerTestCase, suite_subprocess):
tablename = 'test_timestamp04'
uri = 'table:' + tablename
scenarios = make_scenarios([
#('col', dict(extra_config=',key_format=r')),
#('lsm', dict(extra_config=',type=lsm')),
('row', dict(extra_config=',memory_page_max=32k,leaf_page_max=8k,internal_page_max=8k')),
])
# Rollback only works for non-durable tables
conn_config = 'cache_size=20MB,log=(enabled=false)'
# Check that a cursor (optionally started in a new transaction), sees the
# expected values.
def check(self, session, txn_config, expected, missing=False):
if txn_config:
session.begin_transaction(txn_config)
c = session.open_cursor(self.uri, None)
if missing == False:
actual = dict((k, v) for k, v, pad in c if v != 0)
#print expected
#print actual
self.assertEqual(actual, expected)
# Search for the expected items as well as iterating
for k, v in expected.iteritems():
if missing == False:
self.assertEqual(c[k][0], v, "for key " + str(k))
else:
c.set_key(k)
self.assertEqual(c.search(), wiredtiger.WT_NOTFOUND)
c.close()
if txn_config:
session.commit_transaction()
def test_basic(self):
if not wiredtiger.timestamp_build():
self.skipTest('requires a timestamp build')
# Configure small page sizes to ensure eviction comes through and we have a
# somewhat complex tree
self.session.create(self.uri,
'key_format=i,value_format=iS,memory_page_max=16k,leaf_page_max=8k' + self.extra_config)
c = self.session.open_cursor(self.uri)
# Insert keys each with timestamp=key, in some order
key_range = 10000
keys = range(1, key_range + 1)
for k in keys:
self.session.begin_transaction()
c[k] = (1, 'the quick brown fox')
self.session.commit_transaction('commit_timestamp=' + timestamp_str(k))
# Setup an oldest timestamp to ensure state remains in cache.
if k == 1:
self.conn.set_timestamp('oldest_timestamp=' + timestamp_str(1))
# Roll back half the timestamps.
self.conn.set_timestamp('stable_timestamp=' + timestamp_str(key_range / 2))
self.conn.rollback_to_stable()
# Now check that we see the expected state when reading at each
# timestamp
self.check(self.session, 'read_timestamp=' + timestamp_str(key_range / 2),
dict((k, 1) for k in keys[:(key_range / 2)]))
self.check(self.session, 'read_timestamp=' + timestamp_str(key_range / 2),
dict((k, 1) for k in keys[(key_range / 2 + 1):]), missing=True)
# Bump the oldest timestamp, we're not going back...
self.conn.set_timestamp('oldest_timestamp=' + timestamp_str(key_range / 2))
# Update the values again in preparation for rolling back more
for k in keys:
self.session.begin_transaction()
c[k] = (2, 'jumped over the lazy dog')
self.session.commit_transaction('commit_timestamp=' + timestamp_str(k + key_range))
# Now we should have: keys 1-100 with value 2
self.check(self.session, 'read_timestamp=' + timestamp_str(2 * key_range),
dict((k, 2) for k in keys[:]))
# Rollback a quater of the new commits
self.conn.set_timestamp('stable_timestamp=' + timestamp_str(1 + key_range + key_range / 4))
self.conn.rollback_to_stable()
# There should be 50 keys, the first half of which have a value of 2, the
# second half have a value of 1
self.check(self.session, 'read_timestamp=' + timestamp_str(2 * key_range),
dict((k, (2 if j <= (key_range / 4) else 1))
for j, k in enumerate(keys[:(key_range / 2)])))
self.check(self.session, 'read_timestamp=' + timestamp_str(key_range / 2),
dict((k, 1) for k in keys[(1 + key_range / 2):]), missing=True)
if __name__ == '__main__':
wttest.run()
|
