1
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
3
#ident "$Id: rollback.cc 49033 2012-10-17 18:48:30Z zardosht $"
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
TokuFT, 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) 2007-2013 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."
94
#include "ft/logger/log-internal.h"
95
#include "ft/txn/txn_child_manager.h"
98
// initialized a txn_child_manager,
99
// when called, root->txnid.parent_id64 may not yet be set
101
void txn_child_manager::init(TOKUTXN root) {
102
invariant(root->txnid.child_id64 == TXNID_NONE);
103
invariant(root->parent == NULL);
105
m_last_xid = TXNID_NONE;
106
ZERO_STRUCT(m_mutex);
108
toku_pthread_mutexattr_t attr;
109
toku_mutexattr_init(&attr);
110
toku_mutexattr_settype(&attr, TOKU_MUTEX_ADAPTIVE);
111
toku_mutex_init(&m_mutex, &attr);
112
toku_mutexattr_destroy(&attr);
115
void txn_child_manager::destroy() {
116
toku_mutex_destroy(&m_mutex);
119
void txn_child_manager::start_child_txn_for_recovery(TOKUTXN child, TOKUTXN parent, TXNID_PAIR txnid) {
120
invariant(parent->txnid.parent_id64 == m_root->txnid.parent_id64);
121
invariant(txnid.parent_id64 == m_root->txnid.parent_id64);
123
child->txnid = txnid;
124
toku_mutex_lock(&m_mutex);
125
if (txnid.child_id64 > m_last_xid) {
126
m_last_xid = txnid.child_id64;
128
parent->child = child;
129
toku_mutex_unlock(&m_mutex);
132
void txn_child_manager::start_child_txn(TOKUTXN child, TOKUTXN parent) {
133
invariant(parent->txnid.parent_id64 == m_root->txnid.parent_id64);
134
child->txnid.parent_id64 = m_root->txnid.parent_id64;
135
toku_mutex_lock(&m_mutex);
138
// Here we ensure that the child_id64 is never equal to the parent_id64
139
// We do this to make this feature work more easily with the XIDs
140
// struct and message application. The XIDs struct stores the parent id
141
// as the first TXNID, and subsequent TXNIDs store child ids. So, if we
142
// have a case where the parent id is the same as the child id, we will
143
// have to do some tricky maneuvering in the message application code
144
// in ule.cc. So, to lessen the probability of bugs, we ensure that the
145
// parent id is not the same as the child id.
146
if (m_last_xid == m_root->txnid.parent_id64) {
149
child->txnid.child_id64 = m_last_xid;
151
parent->child = child;
152
toku_mutex_unlock(&m_mutex);
155
void txn_child_manager::finish_child_txn(TOKUTXN child) {
156
invariant(child->txnid.parent_id64 == m_root->txnid.parent_id64);
157
toku_mutex_lock(&m_mutex);
158
child->parent->child = NULL;
159
toku_mutex_unlock(&m_mutex);
162
void txn_child_manager::suspend() {
163
toku_mutex_lock(&m_mutex);
166
void txn_child_manager::resume() {
167
toku_mutex_unlock(&m_mutex);
170
void txn_child_manager::find_tokutxn_by_xid_unlocked(TXNID_PAIR xid, TOKUTXN* result) {
171
invariant(xid.parent_id64 == m_root->txnid.parent_id64);
172
TOKUTXN curr_txn = m_root;
173
while (curr_txn != NULL) {
174
if (xid.child_id64 == curr_txn->txnid.child_id64) {
178
curr_txn = curr_txn->child;
182
int txn_child_manager::iterate(txn_mgr_iter_callback cb, void* extra) {
183
TOKUTXN curr_txn = m_root;
185
toku_mutex_lock(&m_mutex);
186
while (curr_txn != NULL) {
187
ret = cb(curr_txn, extra);
191
curr_txn = curr_txn->child;
193
toku_mutex_unlock(&m_mutex);