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
|
/* -*- 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 "manager_unit_test.h"
#include "locktree_unit_test.h"
#include "lock_request_unit_test.h"
namespace toku {
static void assert_status(LTM_STATUS ltm_status, const char *keyname, uint64_t v) {
TOKU_ENGINE_STATUS_ROW key_status = NULL;
// lookup keyname in status
for (int i = 0; ; i++) {
TOKU_ENGINE_STATUS_ROW status = <m_status->status[i];
if (status->keyname == NULL)
break;
if (strcmp(status->keyname, keyname) == 0) {
key_status = status;
break;
}
}
assert(key_status);
assert(key_status->value.num == v);
}
void manager_unit_test::test_status(void) {
locktree_manager mgr;
mgr.create(nullptr, nullptr, nullptr, nullptr);
LTM_STATUS_S status;
mgr.get_status(&status);
assert_status(&status, "LTM_WAIT_COUNT", 0);
assert_status(&status, "LTM_TIMEOUT_COUNT", 0);
DICTIONARY_ID dict_id = { .dictid = 1 };
locktree *lt = mgr.get_lt(dict_id, dbt_comparator, nullptr);
int r;
TXNID txnid_a = 1001;
TXNID txnid_b = 2001;
const DBT *one = get_dbt(1);
// txn a write locks one
r = lt->acquire_write_lock(txnid_a, one, one, nullptr, false);
assert(r == 0);
// txn b tries to write lock one, conflicts, waits, and fails to lock one
lock_request request_b;
request_b.create();
request_b.set(lt, txnid_b, one, one, lock_request::type::WRITE, false);
r = request_b.start();
assert(r == DB_LOCK_NOTGRANTED);
r = request_b.wait(1000);
assert(r == DB_LOCK_NOTGRANTED);
request_b.destroy();
range_buffer buffer;
buffer.create();
buffer.append(one, one);
lt->release_locks(txnid_a, &buffer);
buffer.destroy();
assert(lt->m_rangetree->is_empty() && lt->m_sto_buffer.is_empty());
// assert that wait counters incremented
mgr.get_status(&status);
assert_status(&status, "LTM_WAIT_COUNT", 1);
assert_status(&status, "LTM_TIMEOUT_COUNT", 1);
// assert that wait counters are persistent after the lock tree is destroyed
mgr.release_lt(lt);
mgr.get_status(&status);
assert_status(&status, "LTM_WAIT_COUNT", 1);
assert_status(&status, "LTM_TIMEOUT_COUNT", 1);
mgr.destroy();
}
} /* namespace toku */
int main(void) {
toku::manager_unit_test test;
test.test_status();
return 0;
}
|
