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
|
/* -*- 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 "lock_request_unit_test.h"
namespace toku {
// starting a lock request without immediate success should get
// stored in the lock request set as pending.
void lock_request_unit_test::test_start_pending(void) {
int r;
locktree lt;
lock_request request;
DICTIONARY_ID dict_id = { 1 };
lt.create(nullptr, dict_id, dbt_comparator);
TXNID txnid_a = 1001;
TXNID txnid_b = 2001;
const DBT *zero = get_dbt(0);
const DBT *one = get_dbt(1);
const DBT *two = get_dbt(2);
// take a range lock using txnid b
r = lt.acquire_write_lock(txnid_b, zero, two, nullptr, false);
invariant_zero(r);
lt_lock_request_info *info = lt.get_lock_request_info();
// start a lock request for 1,1
// it should fail. the request should be stored and in the pending state.
request.create();
request.set(<, txnid_a, one, one, lock_request::type::WRITE, false);
r = request.start();
invariant(r == DB_LOCK_NOTGRANTED);
invariant(info->pending_lock_requests.size() == 1);
invariant(request.m_state == lock_request::state::PENDING);
// should have made copies of the keys, and they should be equal
invariant(request.m_left_key_copy.flags == DB_DBT_MALLOC);
invariant(request.m_right_key_copy.flags == DB_DBT_MALLOC);
invariant(compare_dbts(nullptr, &request.m_left_key_copy, one) == 0);
invariant(compare_dbts(nullptr, &request.m_right_key_copy, one) == 0);
// release the range lock for txnid b
locktree_unit_test::locktree_test_release_lock(<, txnid_b, zero, two);
// now retry the lock requests.
// it should transition the request to successfully complete.
lock_request::retry_all_lock_requests(<);
invariant(info->pending_lock_requests.size() == 0);
invariant(request.m_state == lock_request::state::COMPLETE);
invariant(request.m_complete_r == 0);
locktree_unit_test::locktree_test_release_lock(<, txnid_a, one, one);
request.destroy();
lt.release_reference();
lt.destroy();
}
} /* namespace toku */
int main(void) {
toku::lock_request_unit_test test;
test.test_start_pending();
return 0;
}
|
