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
|
/* -*- 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 <db.h>
#include "txnid_set.h"
namespace toku {
int find_by_txnid(const TXNID &txnid_a, const TXNID &txnid_b);
int find_by_txnid(const TXNID &txnid_a, const TXNID &txnid_b) {
if (txnid_a < txnid_b) {
return -1;
} else if (txnid_a == txnid_b) {
return 0;
} else {
return 1;
}
}
void txnid_set::create(void) {
// lazily allocate the underlying omt, since it is common
// to create a txnid set and never put anything in it.
m_txnids.create_no_array();
}
void txnid_set::destroy(void) {
m_txnids.destroy();
}
// Return true if the given transaction id is a member of the set.
// Otherwise, return false.
bool txnid_set::contains(TXNID txnid) const {
TXNID find_txnid;
int r = m_txnids.find_zero<TXNID, find_by_txnid>(txnid, &find_txnid, nullptr);
return r == 0 ? true : false;
}
// Add a given txnid to the set
void txnid_set::add(TXNID txnid) {
int r = m_txnids.insert<TXNID, find_by_txnid>(txnid, txnid, nullptr);
invariant(r == 0 || r == DB_KEYEXIST);
}
// Delete a given txnid from the set.
void txnid_set::remove(TXNID txnid) {
uint32_t idx;
int r = m_txnids.find_zero<TXNID, find_by_txnid>(txnid, nullptr, &idx);
if (r == 0) {
r = m_txnids.delete_at(idx);
invariant_zero(r);
}
}
// Return the size of the set
size_t txnid_set::size(void) const {
return m_txnids.size();
}
// Get the ith id in the set, assuming that the set is sorted.
TXNID txnid_set::get(size_t i) const {
TXNID txnid;
int r = m_txnids.fetch(i, &txnid);
invariant_zero(r);
return txnid;
}
} /* namespace toku */
|
