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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2009 Sun Microsystems
*
* Authors:
*
* Jay Pipes <joinfu@sun.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/**
* @file
*
* Defines the implementation of a simple index into a transaction log.
*/
#include "config.h"
#include <drizzled/message/transaction.pb.h>
#include "transaction_log_index.h"
#include <pthread.h>
using namespace std;
using namespace drizzled;
TransactionLogIndex *transaction_log_index= NULL; /* The singleton transaction log index */
TransactionLogIndex::TransactionLogIndex(TransactionLog &in_log) :
log(in_log),
log_file(-1),
index_file(-1),
index_file_path(),
has_error(false),
error_message(),
min_end_timestamp(0),
max_end_timestamp(0),
min_transaction_id(0),
max_transaction_id(0),
num_log_entries(0)
{
(void) pthread_mutex_init(&index_lock, NULL);
open();
}
TransactionLogIndex::~TransactionLogIndex()
{
entries.clear();
transaction_entries.clear();
pthread_mutex_destroy(&index_lock);
}
void TransactionLogIndex::open()
{
}
bool TransactionLogIndex::hasError() const
{
return has_error;
}
void TransactionLogIndex::clearError()
{
has_error= false;
error_message.clear();
}
const std::string &TransactionLogIndex::getErrorMessage() const
{
return error_message;
}
uint64_t TransactionLogIndex::getMinEndTimestamp() const
{
return min_end_timestamp;
}
uint64_t TransactionLogIndex::getMaxEndTimestamp() const
{
return max_end_timestamp;
}
uint64_t TransactionLogIndex::getMinTransactionId() const
{
return min_transaction_id;
}
uint64_t TransactionLogIndex::getMaxTransactionId() const
{
return max_transaction_id;
}
uint64_t TransactionLogIndex::getNumLogEntries() const
{
return num_log_entries;
}
uint64_t TransactionLogIndex::getNumTransactionEntries() const
{
return transaction_entries.size();
}
TransactionLog::Entries &TransactionLogIndex::getEntries()
{
return entries;
}
TransactionLog::TransactionEntries &TransactionLogIndex::getTransactionEntries()
{
return transaction_entries;
}
void TransactionLogIndex::addEntry(const TransactionLogEntry &entry,
const message::Transaction &transaction,
uint32_t checksum)
{
pthread_mutex_lock(&index_lock);
if (entries.empty())
{
/* First entry...set the minimums */
min_transaction_id= transaction.transaction_context().transaction_id();
min_end_timestamp= transaction.transaction_context().end_timestamp();
}
num_log_entries++;
max_transaction_id= transaction.transaction_context().transaction_id();
max_end_timestamp= transaction.transaction_context().end_timestamp();
entries.push_back(entry);
transaction_entries.push_back(TransactionLogTransactionEntry(entry.getOffset(),
transaction,
checksum));
pthread_mutex_unlock(&index_lock);
}
|