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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
|
/* -*- 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 "logger/logcursor.h"
#include "test.h"
const int N = 2;
int
test_main (int argc, const char *argv[]) {
default_parse_args(argc, argv);
int r;
toku_os_recursive_delete(TOKU_TEST_FILENAME);
r = toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU); assert(r==0);
TOKULOGGER logger;
LSN lsn = ZERO_LSN;
int helloseq = 0;
// create N log files with a hello message
for (int i=0; i<N; i++) {
r = toku_logger_create(&logger);
assert(r == 0);
r = toku_logger_open(TOKU_TEST_FILENAME, logger);
assert(r == 0);
char str[32];
sprintf(str, "hello%d", helloseq++);
BYTESTRING bs0 = { .len = (uint32_t) strlen(str), .data = str };
toku_log_comment(logger, &lsn, 0, 0, bs0);
r = toku_logger_close(&logger);
assert(r == 0);
}
// create N empty log files
for (int i=0; i<N; i++) {
r = toku_logger_create(&logger);
assert(r == 0);
r = toku_logger_open(TOKU_TEST_FILENAME, logger);
assert(r == 0);
r = toku_logger_close(&logger);
assert(r == 0);
}
// CREATE AN EMPTY FILE (tests [t:2384])
{
long long nexti;
r = toku_logger_find_next_unused_log_file(TOKU_TEST_FILENAME, &nexti);
assert(r == 0);
char mt_fname[TOKU_PATH_MAX+1];
snprintf(mt_fname, TOKU_PATH_MAX, "%s/log%012lld.tokulog%d", TOKU_TEST_FILENAME, nexti, TOKU_LOG_VERSION);
int mt_fd = open(mt_fname, O_CREAT+O_WRONLY+O_TRUNC+O_EXCL+O_BINARY, S_IRWXU);
assert(mt_fd != -1);
r = close(mt_fd);
}
// create N log files with a hello message
for (int i=0; i<N; i++) {
r = toku_logger_create(&logger);
assert(r == 0);
r = toku_logger_open(TOKU_TEST_FILENAME, logger);
assert(r == 0);
char str[32];
sprintf(str, "hello%d", helloseq++);
BYTESTRING bs0 = { .len = (uint32_t) strlen(str), .data = str };
toku_log_comment(logger, &lsn, 0, 0, bs0);
r = toku_logger_close(&logger);
assert(r == 0);
}
// CREATE AN EMPTY FILE (tests [t:2384])
{
long long nexti;
r = toku_logger_find_next_unused_log_file(TOKU_TEST_FILENAME, &nexti);
assert(r == 0);
char mt_fname[TOKU_PATH_MAX+1];
snprintf(mt_fname, TOKU_PATH_MAX, "%s/log%012lld.tokulog%d", TOKU_TEST_FILENAME, nexti, TOKU_LOG_VERSION);
int mt_fd = open(mt_fname, O_CREAT+O_WRONLY+O_TRUNC+O_EXCL+O_BINARY, S_IRWXU);
assert(mt_fd != -1);
r = close(mt_fd);
}
// verify the log forwards
TOKULOGCURSOR lc = NULL;
struct log_entry *le;
r = toku_logcursor_create(&lc, TOKU_TEST_FILENAME);
assert(r == 0 && lc != NULL);
helloseq = 0;
for (int i=0; i<2*N; i++) {
r = toku_logcursor_next(lc, &le);
assert(r == 0 && le->cmd == LT_comment);
char expect[32];
sprintf(expect, "hello%d", helloseq++);
assert(le->u.comment.comment.len == strlen(expect) && memcmp(le->u.comment.comment.data, expect, le->u.comment.comment.len) == 0);
}
r = toku_logcursor_next(lc, &le);
assert(r != 0);
r = toku_logcursor_destroy(&lc);
assert(r == 0 && lc == NULL);
// verify the log backwards
r = toku_logcursor_create(&lc, TOKU_TEST_FILENAME);
assert(r == 0 && lc != NULL);
helloseq = 2*N;
for (int i=0; i<2*N; i++) {
r = toku_logcursor_prev(lc, &le);
assert(r == 0 && le->cmd == LT_comment);
char expect[32];
sprintf(expect, "hello%d", --helloseq);
assert(le->u.comment.comment.len == strlen(expect) && memcmp(le->u.comment.comment.data, expect, le->u.comment.comment.len) == 0);
}
r = toku_logcursor_prev(lc, &le);
assert(r != 0);
r = toku_logcursor_destroy(&lc);
assert(r == 0 && lc == NULL);
// VERIFY TRIM WORKS WITH ZERO LENGTH FILE [t:2384]
{
LSN trim_lsn;
trim_lsn.lsn = (2*N)-1;
r = toku_logger_create(&logger); assert(r==0);
r = toku_logger_open(TOKU_TEST_FILENAME, logger); assert(r==0);
toku_logger_maybe_trim_log(logger, trim_lsn);
assert( toku_logfilemgr_num_logfiles(logger->logfilemgr) == 4 ); // untrimmed log, empty log, plus newly openned log
r = toku_logger_close(&logger);
}
toku_os_recursive_delete(TOKU_TEST_FILENAME);
return 0;
}
|
