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
|
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
#ident "$Id$"
/*======
This file is part of PerconaFT.
Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved.
PerconaFT is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License, version 2,
as published by the Free Software Foundation.
PerconaFT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
----------------------------------------
PerconaFT is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License, version 3,
as published by the Free Software Foundation.
PerconaFT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
======= */
#ident "Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved."
#include "locktree_unit_test.h"
namespace toku {
// test that the same txn can relock ranges it already owns
// ensure that existing read locks can be upgrading to
// write locks if overlapping and ensure that existing read
// or write locks are consolidated by overlapping relocks.
void locktree_unit_test::test_overlapping_relock(void) {
locktree lt;
DICTIONARY_ID dict_id = { 1 };
lt.create(nullptr, dict_id, dbt_comparator);
const DBT *zero = get_dbt(0);
const DBT *one = get_dbt(1);
const DBT *two = get_dbt(2);
const DBT *three = get_dbt(3);
const DBT *four = get_dbt(4);
const DBT *five = get_dbt(5);
int r;
TXNID txnid_a = 1001;
// because of the single txnid optimization, there is no consolidation
// of read or write ranges until there is at least two txnids in
// the locktree. so here we add some arbitrary txnid to get a point
// lock [100, 100] so that the test below can expect to actually
// do something. at the end of the test, we release 100, 100.
const TXNID the_other_txnid = 9999;
const DBT *hundred = get_dbt(100);
r = lt.acquire_write_lock(the_other_txnid, hundred, hundred, nullptr, false);
invariant(r == 0);
for (int test_run = 0; test_run < 2; test_run++) {
// test_run == 0 means test with read lock
// test_run == 1 means test with write lock
#define ACQUIRE_LOCK(txn, left, right, conflicts) \
test_run == 0 ? lt.acquire_read_lock(txn, left, right, conflicts, false) \
: lt.acquire_write_lock(txn, left, right, conflicts, false)
// lock [1,1] and [2,2]. then lock [1,2].
// ensure only [1,2] exists in the tree
r = ACQUIRE_LOCK(txnid_a, one, one, nullptr);
invariant(r == 0);
r = ACQUIRE_LOCK(txnid_a, two, two, nullptr);
invariant(r == 0);
r = ACQUIRE_LOCK(txnid_a, one, two, nullptr);
invariant(r == 0);
struct verify_fn_obj {
bool saw_the_other;
TXNID expected_txnid;
keyrange *expected_range;
const comparator *cmp;
bool fn(const keyrange &range, TXNID txnid) {
if (txnid == the_other_txnid) {
invariant(!saw_the_other);
saw_the_other = true;
return true;
}
invariant(txnid == expected_txnid);
keyrange::comparison c = range.compare(*cmp, *expected_range);
invariant(c == keyrange::comparison::EQUALS);
return true;
}
} verify_fn;
verify_fn.cmp = <.m_cmp;
#define do_verify() \
do { verify_fn.saw_the_other = false; locktree_iterate<verify_fn_obj>(<, &verify_fn); } while (0)
keyrange range;
range.create(one, two);
verify_fn.expected_txnid = txnid_a;
verify_fn.expected_range = ⦥
do_verify();
// unlocking [1,1] should remove the only range,
// the other unlocks shoudl do nothing.
lt.remove_overlapping_locks_for_txnid(txnid_a, one, one);
lt.remove_overlapping_locks_for_txnid(txnid_a, two, two);
lt.remove_overlapping_locks_for_txnid(txnid_a, one, two);
// try overlapping from the right
r = ACQUIRE_LOCK(txnid_a, one, three, nullptr);
r = ACQUIRE_LOCK(txnid_a, two, five, nullptr);
verify_fn.expected_txnid = txnid_a;
range.create(one, five);
verify_fn.expected_range = ⦥
do_verify();
// now overlap from the left
r = ACQUIRE_LOCK(txnid_a, zero, four, nullptr);
verify_fn.expected_txnid = txnid_a;
range.create(zero, five);
verify_fn.expected_range = ⦥
do_verify();
// now relock in a range that is already dominated
r = ACQUIRE_LOCK(txnid_a, five, five, nullptr);
verify_fn.expected_txnid = txnid_a;
range.create(zero, five);
verify_fn.expected_range = ⦥
do_verify();
// release one of the locks we acquired. this should clean up the whole range.
lt.remove_overlapping_locks_for_txnid(txnid_a, zero, four);
#undef ACQUIRE_LOCK
}
// remove the other txnid's lock now
lt.remove_overlapping_locks_for_txnid(the_other_txnid, hundred, hundred);
lt.release_reference();
lt.destroy();
}
} /* namespace toku */
int main(void) {
toku::locktree_unit_test test;
test.test_overlapping_relock();
return 0;
}
|
