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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
|
/* -*- 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 "test.h"
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <memory.h>
#include <errno.h>
#include <sys/stat.h>
#include <db.h>
static int
db_put (DB *db, DB_TXN *txn, int k, int v) {
DBT key, val;
return db->put(db, txn, dbt_init(&key, &k, sizeof k), dbt_init(&val, &v, sizeof v), DB_NOOVERWRITE);
}
static const char *db_error(int error) {
static char errorbuf[32];
switch (error) {
case DB_NOTFOUND: return "DB_NOTFOUND";
case DB_LOCK_DEADLOCK: return "DB_LOCK_DEADLOCK";
case DB_LOCK_NOTGRANTED: return "DB_LOCK_NOTGRANTED";
case DB_KEYEXIST: return "DB_KEYEXIST";
default:
sprintf(errorbuf, "%d", error);
return errorbuf;
}
}
/* t1 t2 l1 l2 p1 p2 c1 c2 */
static void
test_txn_cursor_last_1 (int nrows) {
if (verbose) printf("test_txn_cursor_last_1:%d\n", nrows);
int r;
toku_os_recursive_delete(TOKU_TEST_FILENAME);
toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO);
DB_ENV *env;
DB *db;
DB_TXN * const null_txn = 0;
const char * const fname = "test.txn.cursor.last.1.ft_handle";
/* create the dup database file */
r = db_env_create(&env, 0); assert(r == 0);
env->set_errfile(env, stderr);
r = env->open(env, TOKU_TEST_FILENAME, DB_CREATE|DB_INIT_MPOOL|DB_INIT_TXN|DB_INIT_LOCK|DB_INIT_LOG |DB_THREAD |DB_PRIVATE, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
r = db_create(&db, env, 0); assert(r == 0);
db->set_errfile(db,stderr); // Turn off those annoying errors
r = db->open(db, null_txn, fname, "main", DB_BTREE, DB_CREATE+DB_AUTO_COMMIT, 0666); assert(r == 0);
int i;
for (i=0; i<nrows; i++) {
int k = htonl(i);
int v = htonl(i);
DBT key, val;
r = db->put(db, null_txn, dbt_init(&key, &k, sizeof k), dbt_init(&val, &v, sizeof v), 0);
assert(r == 0);
}
DB_TXN *t1;
r = env->txn_begin(env, null_txn, &t1, 0); assert(r == 0);
if (verbose) printf("t1:begin\n");
DBC *c1;
r = db->cursor(db, t1, &c1, 0); assert(r == 0);
DB_TXN *t2;
r = env->txn_begin(env, null_txn, &t2, 0); assert(r == 0);
if (verbose) printf("t2:begin\n");
DBC *c2;
r = db->cursor(db, t2, &c2, 0); assert(r == 0);
DBT k1; memset(&k1, 0, sizeof k1);
DBT v1; memset(&v1, 0, sizeof v1);
r = c1->c_get(c1, &k1, &v1, DB_LAST);
if (verbose) printf("c1:last:%s\n", db_error(r));
r = c1->c_close(c1); assert(r == 0);
DBT k2; memset(&k2, 0, sizeof k2);
DBT v2; memset(&v2, 0, sizeof v2);
r = c2->c_get(c2, &k2, &v2, DB_LAST);
if (verbose) printf("c2:last:%s\n", db_error(r));
r = c2->c_close(c2); assert(r == 0);
int r1 = db_put(db, t1, htonl(nrows), htonl(nrows));
if (verbose) printf("t1:put:%s\n", db_error(r1));
int r2 = db_put(db, t2, htonl(nrows), htonl(nrows));
if (verbose) printf("t2:put:%s\n", db_error(r2));
if (r1 == 0) {
r = t1->commit(t1, 0);
if (verbose) printf("t1:commit:%s\n", db_error(r));
} else {
r = t1->abort(t1);
if (verbose) printf("t1:abort:%s\n", db_error(r));
}
if (r2 == 0) {
r = t2->commit(t2, 0);
if (verbose) printf("t2:commit:%s\n", db_error(r));
} else {
r = t2->abort(t2);
if (verbose) printf("t2:abort:%s\n", db_error(r));
}
r = db->close(db, 0); assert(r == 0);
r = env->close(env, 0); assert(r == 0);
}
/* t1 t2 l1 p1 l2 c1 p2 c2 */
static void
test_txn_cursor_last_2 (int nrows) {
if (verbose) printf("test_txn_cursor_last_2:%d\n", nrows);
int r;
toku_os_recursive_delete(TOKU_TEST_FILENAME);
toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO);
DB_ENV *env;
DB *db;
DB_TXN * const null_txn = 0;
const char * const fname = "test.txn.cursor.last.1.ft_handle";
/* create the dup database file */
r = db_env_create(&env, 0); assert(r == 0);
env->set_errfile(env, stderr);
r = env->open(env, TOKU_TEST_FILENAME, DB_CREATE|DB_INIT_MPOOL|DB_INIT_TXN|DB_INIT_LOCK|DB_INIT_LOG|DB_THREAD|DB_PRIVATE, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
r = db_create(&db, env, 0); assert(r == 0);
db->set_errfile(db,stderr); // Turn off those annoying errors
r = db->open(db, null_txn, fname, "main", DB_BTREE, DB_CREATE+DB_AUTO_COMMIT, 0666); assert(r == 0);
int i;
for (i=0; i<nrows; i++) {
int k = htonl(i);
int v = htonl(i);
DBT key, val;
r = db->put(db, null_txn, dbt_init(&key, &k, sizeof k), dbt_init(&val, &v, sizeof v), 0);
assert(r == 0);
}
DB_TXN *t1;
r = env->txn_begin(env, null_txn, &t1, 0); assert(r == 0);
if (verbose) printf("t1:begin\n");
DBC *c1;
r = db->cursor(db, t1, &c1, 0); assert(r == 0);
DB_TXN *t2;
r = env->txn_begin(env, null_txn, &t2, 0); assert(r == 0);
if (verbose) printf("t2:begin\n");
DBC *c2;
r = db->cursor(db, t2, &c2, 0); assert(r == 0);
DBT k1; memset(&k1, 0, sizeof k1);
DBT v1; memset(&v1, 0, sizeof v1);
r = c1->c_get(c1, &k1, &v1, DB_LAST);
if (verbose) printf("c1:last:%s\n", db_error(r));
r = c1->c_close(c1); assert(r == 0);
int r1 = db_put(db, t1, htonl(nrows), htonl(nrows));
if (verbose) printf("t1:put:%s\n", db_error(r1));
DBT k2; memset(&k2, 0, sizeof k2);
DBT v2; memset(&v2, 0, sizeof v2);
r = c2->c_get(c2, &k2, &v2, DB_LAST);
if (verbose) printf("c2:last:%s\n", db_error(r));
r = c2->c_close(c2); assert(r == 0);
if (r1 == 0) {
r = t1->commit(t1, 0);
if (verbose) printf("t1:commit:%s\n", db_error(r));
} else {
r = t1->abort(t1);
if (verbose) printf("t1:abort:%s\n", db_error(r));
}
int r2 = db_put(db, t2, htonl(nrows), htonl(nrows));
if (verbose) printf("t2:put:%s\n", db_error(r2));
if (r2 == 0) {
r = t2->commit(t2, 0);
if (verbose) printf("t2:commit:%s\n", db_error(r));
} else {
r = t2->abort(t2);
if (verbose) printf("t2:abort:%s\n", db_error(r));
}
r = db->close(db, 0); assert(r == 0);
r = env->close(env, 0); assert(r == 0);
}
int
test_main(int argc, char *const argv[]) {
parse_args(argc, argv);
test_txn_cursor_last_1(0);
test_txn_cursor_last_1(1);
test_txn_cursor_last_2(0);
test_txn_cursor_last_2(1);
return 0;
}
|
