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
|
/* -*- 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"
/* Like test_log6 except abort. */
#include <db.h>
#include <stdlib.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <memory.h>
#ifndef DB_DELETE_ANY
#define DB_DELETE_ANY 0
#endif
// TOKU_TEST_FILENAME is defined in the Makefile
struct in_db;
struct in_db {
long int r;
int i;
struct in_db *next;
} *items=0, *deleted_items=0;
static void put_n (DB *db, DB_TXN *tid, int i) {
char hello[30], there[30];
DBT key,data;
struct in_db *XMALLOC(newitem);
newitem->r = random();
newitem->i = i;
newitem->next = items;
items = newitem;
snprintf(hello, sizeof(hello), "hello%ld.%d", newitem->r, newitem->i);
snprintf(there, sizeof(hello), "there%d", i);
memset(&key, 0, sizeof(key));
memset(&data, 0, sizeof(data));
key.data = hello; key.size=strlen(hello)+1;
data.data = there; data.size=strlen(there)+1;
int r=db->put(db, tid, &key, &data, 0); assert(r==0);
}
static void del_n (DB *db, DB_TXN *tid, int i) {
// Move it to deleted items if it is present.
struct in_db *present;
struct in_db **prevp;
for ((prevp=&items), (present=items);
present;
(prevp=&present->next), (present=present->next)) {
if (present->i==i) {
// Remove it
struct in_db *next = present->next;
present->next = deleted_items;
deleted_items = present;
*prevp = next;
char hello[30];
DBT key;
snprintf(hello, sizeof(hello), "hello%ld.%d", present->r, i);
memset(&key, 0, sizeof(key));
key.data = hello; key.size = strlen(hello)+1;
int r = db->del(db, tid, &key, DB_DELETE_ANY); assert(r==0);
return;
}
}
}
static void make_db (void) {
DB_ENV *env;
DB *db;
DB_TXN *tid;
int r;
int i;
toku_os_recursive_delete(TOKU_TEST_FILENAME);
r=toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO); assert(r==0);
r=db_env_create(&env, 0); assert(r==0);
r=env->open(env, TOKU_TEST_FILENAME, DB_INIT_LOCK|DB_INIT_LOG|DB_INIT_MPOOL|DB_INIT_TXN|DB_CREATE|DB_PRIVATE, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
r=db_create(&db, env, 0); CKERR(r);
r=env->txn_begin(env, 0, &tid, 0); assert(r==0);
r=db->open(db, tid, "foo.db", 0, DB_BTREE, DB_CREATE, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
r=tid->commit(tid, 0); assert(r==0);
r=env->txn_begin(env, 0, &tid, 0); assert(r==0);
for (i=0; i<1; i++) {
put_n(db, tid, i);
if (random()%3==0) {
del_n(db, tid, random()%(i+1));
}
}
r=tid->abort(tid); assert(r==0);
{
struct in_db *l=items;
for (l=items; l; l=l->next) {
char hello[30];
DBT key,data;
memset(&key, 0, sizeof(key));
memset(&data, 0, sizeof(data));
snprintf(hello, sizeof(hello), "hello%ld.%d", l->r, i);
r = db->get(db, 0, &key, &data, 0);
assert(r==DB_NOTFOUND);
}
}
r=db->close(db, 0); assert(r==0);
r=env->close(env, 0); assert(r==0);
while (items) {
struct in_db *next=items->next;
toku_free(items);
items=next;
}
while (deleted_items) {
struct in_db *next=deleted_items->next;
toku_free(deleted_items);
deleted_items=next;
}
}
int
test_main (int argc __attribute__((__unused__)), char *const argv[] __attribute__((__unused__))) {
make_db();
return 0;
}
|
