1
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
5
COPYING CONDITIONS NOTICE:
7
This program is free software; you can redistribute it and/or modify
8
it under the terms of version 2 of the GNU General Public License as
9
published by the Free Software Foundation, and provided that the
10
following conditions are met:
12
* Redistributions of source code must retain this COPYING
13
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
14
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
15
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
18
* Redistributions in binary form must reproduce this COPYING
19
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
20
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
21
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
22
GRANT (below) in the documentation and/or other materials
23
provided with the distribution.
25
You should have received a copy of the GNU General Public License
26
along with this program; if not, write to the Free Software
27
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
32
TokuDB, Tokutek Fractal Tree Indexing Library.
33
Copyright (C) 2007-2013 Tokutek, Inc.
37
This program is distributed in the hope that it will be useful, but
38
WITHOUT ANY WARRANTY; without even the implied warranty of
39
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
40
General Public License for more details.
42
UNIVERSITY PATENT NOTICE:
44
The technology is licensed by the Massachusetts Institute of
45
Technology, Rutgers State University of New Jersey, and the Research
46
Foundation of State University of New York at Stony Brook under
47
United States of America Serial No. 11/760379 and to the patents
48
and/or patent applications resulting from it.
50
PATENT MARKING NOTICE:
52
This software is covered by US Patent No. 8,185,551.
53
This software is covered by US Patent No. 8,489,638.
57
"THIS IMPLEMENTATION" means the copyrightable works distributed by
58
Tokutek as part of the Fractal Tree project.
60
"PATENT CLAIMS" means the claims of patents that are owned or
61
licensable by Tokutek, both currently or in the future; and that in
62
the absence of this license would be infringed by THIS
63
IMPLEMENTATION or by using or running THIS IMPLEMENTATION.
65
"PATENT CHALLENGE" shall mean a challenge to the validity,
66
patentability, enforceability and/or non-infringement of any of the
67
PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.
69
Tokutek hereby grants to you, for the term and geographical scope of
70
the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,
71
irrevocable (except as stated in this section) patent license to
72
make, have made, use, offer to sell, sell, import, transfer, and
73
otherwise run, modify, and propagate the contents of THIS
74
IMPLEMENTATION, where such license applies only to the PATENT
75
CLAIMS. This grant does not include claims that would be infringed
76
only as a consequence of further modifications of THIS
77
IMPLEMENTATION. If you or your agent or licensee institute or order
78
or agree to the institution of patent litigation against any entity
79
(including a cross-claim or counterclaim in a lawsuit) alleging that
80
THIS IMPLEMENTATION constitutes direct or contributory patent
81
infringement, or inducement of patent infringement, then any rights
82
granted to you under this License shall terminate as of the date
83
such litigation is filed. If you or your agent or exclusive
84
licensee institute or order or agree to the institution of a PATENT
85
CHALLENGE, then Tokutek may terminate any rights granted to you
89
#ident "Copyright (c) 2014 Tokutek Inc. All rights reserved."
90
#ident "The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it."
92
// test the kill callback. the kill callback never kills the lock wait in this test.
93
// the test verifies that the kill callback is called close to its requested frequency.
95
#include "lock_request_unit_test.h"
99
const uint64_t my_lock_wait_time = 10 * 1000; // 10 seconds
100
const uint64_t my_killed_time = 1 * 1000;
102
static int killed_calls = 0;
103
static uint64_t t_last_kill;
105
static int my_killed_callback(void) {
106
uint64_t t_now = toku_current_time_microsec();
107
assert(t_now >= t_last_kill);
108
assert(t_now - t_last_kill >= my_killed_time * 1000 / 2); // div by 2 for valgrind which is not very accurate
114
// make sure deadlocks are detected when a lock request starts
115
void lock_request_unit_test::test_wait_time_callback(void) {
117
locktree::manager mgr;
120
mgr.create(nullptr, nullptr, nullptr, nullptr);
122
DICTIONARY_ID dict_id = { 1 };
123
lt = mgr.get_lt(dict_id, nullptr, compare_dbts, nullptr);
125
TXNID txnid_a = 1001;
126
lock_request request_a;
129
TXNID txnid_b = 2001;
130
lock_request request_b;
133
const DBT *one = get_dbt(1);
136
request_a.set(lt, txnid_a, one, one, lock_request::type::WRITE, false);
137
r = request_a.start();
140
// b tries to lock 'one'
141
request_b.set(lt, txnid_b, one, one, lock_request::type::WRITE, false);
142
r = request_b.start();
143
assert(r == DB_LOCK_NOTGRANTED);
145
uint64_t t_start = toku_current_time_microsec();
146
t_last_kill = t_start;
147
r = request_b.wait(my_lock_wait_time, my_killed_time, my_killed_callback);
148
assert(r == DB_LOCK_NOTGRANTED);
150
uint64_t t_end = toku_current_time_microsec();
151
assert(t_end > t_start);
152
uint64_t t_delta = t_end - t_start;
153
// fprintf(stderr, "delta=%" PRIu64 "\n", t_delta);
154
assert(t_delta >= my_lock_wait_time);
156
// fprintf(stderr, "killed_calls=%d\n", killed_calls);
157
assert(killed_calls > 0);
161
release_lock_and_retry_requests(lt, txnid_a, one, one);
168
} /* namespace toku */
171
toku::lock_request_unit_test test;
172
test.test_wait_time_callback();
added
removed
storage/tokudb/ft-index/locktree/tests/lock_request_not_killed.cc
